Cadance placement papers -------- placement paper -1

Cadance placement papers -------- placement paper -1..

75 Marks paper..time limit 1.15 H
10 related to s/w & then 10 related to h/w & 55 aptitute.

technical part questions

1. ans:O(n**2)

2. inorder & preorder seq. of tree is given & you have to
find out post order..
very easy but do practice you can make one easy method by
practice..

3. problem on pass by ref. & pass by value.

asn: x=5 & y=3

4.in assembler relocatable code generated by ...!!??

5.depth of the tree

ans:log(n)

6.very simple problem on binary tree ...

so learn who to build tree & insert new tree node...
ans: 10

7.problem on FSM

8.problem on stack

9.problem on grammer

1. A(XOR)B

2. for modulo-13 ...FF req.
asn: 4

3. asn: modulo-6
4. ans: z(x+y)
5. ans: 0,1
6. on DMA : I/O to Mem. without CPU monitering

7. problem on ring counter
8.number given in form 20 digit repesentation ...

where A,B ,C ,,,..J

are 10,11,12,...20
number is 'IA'
what is the value in octal
asn:562

9. one program is given
inwhich statement are
t= u%v
t= u%v
u=v v=v-1...
you have to find complexcity of prog.

sn: !!??

1. log( X**3 + Y**3) where x=3/4 y=1/4

log(3) , log(7) & log(2) is given ...

ans:-0.385

2. one puzzle related cards ...
asn: 1 black card & 12 red crads

3. last question of paper ..
sum of money of A & B =Rs.10
diffrence of A + B = Rs.9
ans : 50 pesa

4. one paper is equlely folded 50 times...

what is new thikness of paper..
ans: 2**50

 Is This Answer Correct ? 0 Yes 1 No

More Placement Papers Interview Questions

Lucknow Hcl Technologies Placement Paper 12 Feb 2007

HUGHES PLACEMENT PAPERS

What kind of Issues/bugs arise in ETL projects? I would like to know few issues (critical to somewhat bugs ) normally occur in ETL process especially when testing? Domains can be banking, retail or any.

wipro placement process

tta original question paper held at 2008

WIPRO PLACEMENT PAPERS ---------- Placement Paper 3

TCS PLACEMENT PAPERS -------------- Placement Paper 3

INDUS PLACEMENT PAPERS -------- PLACEMENT PAPER-1

Symphony Services Placement Pattern

Satyam Placement Paper Gd & Interview- 02- Sep

TCS January 25,27 2008

SNAPDEAL QUESTIONS 1. A train is going at a speed of 60kmph towards Delhi and returned back at a speed of 30kmph. What is its average speed? ANS : (2*30*60)/(30+60) = 40kmph 2. How many different 4 letter words can be framed that have at least one vowel? ANS : 264 - 214 (total no of 4 digits words – no of words with no vowels) 3. Write an algorithm to find out a number from an array of numbers where only one number occurs once and rest all occurs twice. ANS : XOR all the numbers ,you will get the number with single occurrences . 4. Which among the following have the product of the distance between opposite sides of a regular polygon and it side equals one fourth of the area. A. hexagon B. octagon C. n=16 D. n=18 ANS : n=16.(area of regular polygon = apothem*perimeter/2 Apothem = distance between opposite sides/2 Area = (opp_side_dist * n * a )/4 Product of opp_side_dist and side of reg. polygon = opp_side_dist * a For n= 16 the ration becomes 1:4 5. Which of the following cannot be a relation between two variables? ANS = 4th diagram. 6.what will be the output of this program Void print (int n) { If (n>0) { printf(“hello”); print(n-1); } printf(“world”); } ANS : N times hello followed by N+1 times world. 7. Which among the following cannot be used for future prediction? ANS : 4th Diagram. 8. There are 25 horses. We have to find out the fastest 3 horses In one race maximum 5 horses can run. How many such races are required in minimum to get the result. ANS : 7 races (A. first run all horses = 5 races, eliminate 4th 5th of all races. B. Run horses who came 1st in those 5 races = 1 race , the horse coming first is the fastest Run horses a. 2nd and 3rd with the fastest horse (in first time race A) b. 2nd and 3rd coming horse in B. c. The horse who came 2nd with the horse(who came 2nd in race B) in race A You will have the fastest 3 horses.) 9. In a game of rolling dice you are given 2 dice and you have to roll them. Whatever is the outcome the player will win that many dollars. What should the game owner charge each player (optimum) so that he doesn’t have to bear any loss? ANS : \$7 10. We have a function REV(“string”,m,n).This function is capable of reversing the caharacters in the string from mth location to nth location. e.g. REV(“abcd”,2,3) &#61672; the output will be acbd We need to swap a string from a position,e.g. SWAP(“abcdefg”,4) &#61672; output needs to be efgabcd. How can the REV function used do this. ANS : L = string length,N= position given in SWAP function. SWAP(“abcdefg”,4) = REV(REV(REV(“abcdefg”,N+1,L),1,N),1,L).

Categories