FLEXTRONICS PAPER – 2006
FLEXTRONICS PAPER
Section C
1. An lead compensator zero is at Z=Zc, pole is at P=Pc then the following is correct
a. Pc > Zc, pc< 0, zc< 0 b. c.
2. Gain margin of g(s)h(s)=1/s(s+k);
a. sqrt(1+k2) b. 0 c. infinity d. 1
3. Machestor code does not improves
a. clock recovery b. bandwidth efficiency c.
4. possion distribution is used for
a. used in FSM b.
c. used for queuing delay system of mutually identical events of arrival
d. both a and c
5. no.of filpflops for mod 11 counter
a. four b. five c.
6. if even parity is used for parity generation, what is the hamming distance (simple fig is given) ans:2
7. the code set is {00000,00111,11100,11011} what is the error detecting and correcting capability?
ans:2,1
8. operational amp characteristics following is correct:
1. input impedance is 0
2. output impedance is infinity
3. input impedance is infinity
4. gain is infinity which combinations are correc
9. band pass signal having frequencies 2.5k and 4.5k?give the sampling freq
a. 9k b. 4k c. 4.5k d. 7k
10. definition of avalanche diode multiplication
11. more no of ripples are present in the diagram?which is correct
a. lower order filter b. high order filter c.
12. If CPU have one interrupt pin and on to connect with external devices with some priority? which type of the following is used?
a. parallel priority interrupt b. daisy chain c. RS filpflop d.
13. one megabit file transfer, serially on 9600 baud one start bit and two stop bits, then how much time it takes (approx)
a. 4 hours b. 2 hours c. 20 minutes d. 2 minute
14. IEEE 802.5 is ans: TOKEN RING
15. Code sequence is given what is the error correcting distance
16. bit stuffing used in HDLC Protocol for ans: b is correct (read on text book)
Section A & B (Both are mixed )
17. If “AaBbCc” is passed to the char
char x(*a)
{
a[0]?x(a+1):1;
printf(“%c”,a[0]);
return 1;
} what will be the output?
18. f(*p)
{
p=(char *)malloc(6);
p=”hello”;
return;
}
main()
{
char *p=”bye”;
f(p);
printf(“%s”,p);
}
what is the o/p? ans:bye
19. when the program counter is incremented in the instruction cycle
a. fetch cycle b. int cycle c. execuation cycle d.
20. Two sorted lists of n elements will take at least fine the order of complexity?
a. 2n b. n/2 c. square(n)
21. Logic diagram is given? find the expression ans: OR gate
22. Question on JAVA string ans: string ends without a null character
23. Cache access time is 100ns. main memory access time is 1000ns, hit ratio is .9, find mean access time?
ans :200ns
24. Which is not suitable to find out IP address ans:ARP
25. about deadlock condition
26. convert 41.6875 into binary
27. read about IP AND IPX
28. read about NFS
29. DHCP is
a. for routing b. for network address conversion
c. for diagnosis d.
30. Execution phase can be
a. pipelined b. no parallelism is possible c. vector processing d.
31. In public key algorithm, A wants to send message to B ….. which key is used
a. A public key b. A private key c. B public key d. B private key
32. to prevent replay attacks in transmission
a. symmetric encoding b. Asymmetric encoding c. for every exchange, key should be changed
33. Virtual functionality is used in C++
a. dynamic binding
b. if the derived func is present but base class not present
34. if there are n nodes in a binary tree, how many null pointers are there ans:n+1;
35. if heap sort contains n elements, no of comparsions required are
a. log(n) b. height of heap sort c. d.
36. question on ICV(integrity check)
37. which of the following is efficient in terms of space
a. insertion sort b. quick sort c. selection d. both a and c
38. In 32 bit representation, the range of numbers in 2’s complement form
ans :-2 to the power of 31 to 2 to the power of 31 minus 1
39. About normalization
40. Socket is implemented in TCP Layer. which of the following is related to TCP layer
ans: port number
41. In reentrant procedure, which should be not used for passing parameters?
a. passed by reg b. by direct c. by indirect d. by stack
42. flow control is used for
a. congestion at receiver b. c. d.
43.5 questions on DBMS are there
44. in global static variable, declartion in a file
a. localization of scope
b. persistance of the value through out the file
45. in sorted table contains elements, which of the searching is false
a. hash table b. binary searching
46. in demand paging overhead of context switching is more due to
a. copy processes from disk to memory b. viceversa c. to get associative table d. swapping to the disk
47. when write through is better than write back(related to cache memory)
48. which is false when normalization is used?can’t express
49.
I :verification: are we doing right product
II: validation:are we doing product right
a. i and ii are true b. i and ii are false
c. i true and ii false d. i false and ii true
50. A table contains less than 10 elements which one is fastest
a. bubble sort b. selection sort c. quick sort
51.about subroutine, precondition is false. what about post condition
a. post condition is not defined b. post condition is always true
52. When static variables are used, which one of the following is not possible?
a. dynamic run time b. c.
53.in product of x and y,
if(x=0|y=0)
y=1;
else
y=0;
(not cleared)
what is cyclometric complexity?
a. 3 b. 2 c. 1 d. 0
54. CREATE TABLE NEW AS SELECT BIG FROM EMP
The above SQL statement is correct or not? (question is not cleared)
55. path testing is
a. white box b. black box c. installation test d. environment test
56. program is given?
above algorithm represents what type of search?
a. binary search b. interpolation search c. sequential search (may be “b” is correct);
57. if x->y in a relation R, x1 and x2 are in x, y1 and y2 are in y (question not cleared), about functional dependancy
a.x1=x2 and y1=y2 b. c.
58. in a down loading from website ,which one is correct? ans: check the byte code and indicate the error, if any. Ch etanaS
59. about UDP one Address is given but that is not the state table what will it do the packet
a. packet is discarded b. packet is sent to ethernet server
c. packet is sent to other address d.
60. in associated memory for fast accessing which one is used
a. single linked list b. double ” c. hash table
61. which of the folowing is not correct
a. (x+y)’=x’.y’ b. (x’+y’)’=x.y
c. (x’.y’)’=x+y d. (x’+y’)’=x’.y’ [d]
62. Question on logic ckt. U have to find the output ans. AB’+CD’+EF’
63. Output of MUX
_________
c—–| |
c’—-| |——-Y
c’—-| | ans. A xor B xor C
c—–| |———
| |
A B (select lines)
64. If X and Y are two sets. |X| and |Y| are corresponding coordinates and exact no.of functions from X to Y is
97 then
a. |X|=97 |Y|=1 b. |X|=1 |Y|=97
c. |X|=97 |Y|=97 d. …..
65. If two dies are thrown simultaneously what is the prob. of one of the dice getting face 6 ?
a. 11/36 b. 1/3 c. 12/35 d. 1/36 [a]
66. The relation ,<,on reals is a. a partial order because of symmetric and reflexive
b. … antisymmetric and ….
c. not …… .. asymmetric and non reflexive
d. … …. not anti-symm and non reflexive
67. In C language the parameters are passsed by
a. values b. name c.referrence d….
68. Advantage of SRAM over DRAM ans. faster
69. Diasy chaining related question (refer Z80)
a. uniform interrupt priority b. non …. ….
c. interfacing slower peripherals d. ….
70. RAM chips arranged in 4X6 array and of 8kX4bit capacity each. How many address lines reqd. to access each byte
a. 12 b. 16 c.15 d. 17
71. Question related to AVL trees regarding how many no.of nodes to be changed to become balanced after addition of a leaf node to a particular node. ans . 3
72. When following sequence is insertedin the binary search tree no.of nodes in left and right subtrees 52 86 64 20 3 25 14 9 85
73. Method used for Disk searching..
a.linked list b. AVL c. B-tree d. binary tree
74. Which of the following is correct statement.
a. 1’s complement can have two zero re[resentations
b. 2’s … … represent an extra neg. number
c. 2’s & 1’s have no difference in representing 16-bit no.
d…….
75. AX=B where A is mXn ,b&X are column matrices of order m
a.if m
b.if m=n, rank of A < c…. solutions trivial then>
76. The option avialable in C++, not C:
a. dynamic scoping b. declaration in the middle of code block
c. seperate compiled and linked units d. ….
77. int a[4]={1,2,3,4};
int *ptr;
ptr=a;
*(a+3)=*(++ptr)+(*ptr++);
A part of code is shown. The elements in A after the execution of this code.
a.1 2 3 4 b. 1 2 3 6
c. compilation error d.1 2 2 4 [a]
78. Critical section program segment is
a. enclosed by semaphores with P & V operations
b. deadlock avoidance
c. where shared resources are accessed
79. when head is moving back and forth, the disk scheduling algorithm is _____
a) scan b) sstf c) fcfs d)….
80. how many times the loop will execute
LOOP LXI B,1526H
DCX B
JNZ LOOP
a) 1526H times b) 31 c) 21 d) 38
81. The addressing mode in which the address of the operand is expressed explicitly within the instruction
a) index addressing b) absolute c) indirect d) immediate
82. (A – B) U (B – A) U (A ^ C) = ? where A,B are two sets A’ , B’ are compliments of A and B
a) A U B b) A ^ B c)…. d)….
83. The network that does not use virtual circuit
a) IP b) X.25 c)…. d)..
84. source routing bridge
a) source will route the frame b) frame will routed with info in header
85. cache access time 100 msec. main memory access time 800 msec if the hit ratio is 95% , what is mean access time …
86. The module that should be always reside in main memory is
a) loader b) link module c)… d)….
…. and some questions related to
1. addressing mode 2.assembler passes 3.linking and loading 4. file directory search 5. turning machine 6. finite state machine 7. daisy wheel
87. The order of algorithm to merge the two sorted lists of lengths m and n is
a. O(m) b. O(n) c. O(m+n) d. O(log(m)+log(n))
88. A chocolate block is of 4 X 4 size.How many cuts are needed to make 1 X 1 size blocks. No simultaneous vert. & horz. cuts.
89. Which among the following is not correct
a. O(n) > O(log n) .. likewise
90.ne question of Set Theory Like there Are two sets A and B and (A-B)union(B-A)union(A intersection B) is equivalent to Ans. A union B
91. Union and intersection are in there sign conventions.
92. One question of probability Like between 100 and 999 how many no have the prob that they does not contain 7
Ans. 16/25 (not sure u can check by own)
93. Of Newton Rapson method…
94. Of power set A set contains {(fi),a,{a,b}} what is the powerset of it Ans. 8
95. A question of logic gates Ans. U can got the answer very easily
96. A question on the Booths algo Ans. The sequence is 1010101010101010
97. Relative addressing mode is used for Ans. Dont know.
98. For how many numbers there is no difference between little endian and big endian
Ans. 256
99. For the multiplication of two 8 bit numbers how much ROM will be used
Ans. 64k*16 ROM(Check it)
100. Why direct mapping is not good for the mapping of Cache Memory.
101. What is the main property of Desiy I/O Sytem
102. A question on the nyquist theorem
Ans. 18000 bps
103. What is the shannon theorem…
Ans. Refer to data communication (Stalling) book
104. CSMA/CD protocol is used in
Ans. Ethernet
105. What is the limitation of the Pulse Code Modulation
Ans. Refer to data communication book
106. In CSMA/CD
Ans. The Access to the channnel is probabilistic.
107. For an IP Router how many IP addresses
Ans. Check it i think Answer is Only One.
108. Which protocol u used when you want to know the IP address corresponding to a MAC Address
Ans. RARP
109. Which part of the IP header is used for the time limit of the packet.
Ans. TTL
110. Which PageReplacement algo will give the best result
Ans. By replacing that page which has the next reference after a long time.(optimal algo)
111. What the code will be said when it is called by another part and it is not completed yet
Ans. Reentrant Code.
112. Three questions on the simple programs
113. There is a sequence of no and prepare a binary tree and tell how many nodes are in the left and right sub tree.
Ans. Check it Ans (4,7)
114. What is the rank of the graph
Ans. e-n+k
115. One question on the multithreading
116. Which traversal of the tree gives the node in the ascending order.
Ans. Inorder
117. Which traversal of the tree gives the node in the ascending order.
Ans. Inorder
118. What is garbage collector.
119. nice(‘val’)? unix command
120. for(l=1;a<=l;a++)
cout<<++a;cout<
output?
a.21 b.22 c.23 d.none
121. int a[4]={1,2,3,4};
array to the pointer?
a.int *a[4]
b.int (*a)[4]
122. valid system prievlage in restricted seesion?
a. create user b. create session c. restricted session
123. Semaphore?
a. shared memory
124. which is used to store hard disk sector info
a. eerom b. rom c . ram d. cmos
125. If duplicate segments , file are there in hardisk which is best for management
a. fat b. san c. raid(may be) d…..
126. If a lan with 100mbps is there which wan can give same features?
a. atm b. isdn c. x.25 d. ….
127. IPv6 has how many bytes for its address?
a. 8 b. 12 c. 16
128. Sliding window in which layer?
a. session layer b. transport layer c. application layer d. presentation layer
129. when interupt occurs to cpu what happen?
130. 5DEBUG trigger (oracle)
131. order of insertion sort and Heap sort?
a. O(n**2),O(nlogn)
132. NEXTVAL and CURRENTVAL in sequence (Oracle)?
133. Which one is called family tree?
a. B+
b. Binary
c. AVL
134. Intel 386 support which memory management?
a. paged
b. segmented
c. paged segmented
d……..
135. Complexity to access name from the given double link list?
|A|–>|B|
| |<–| |
a. O(n)
b. O(n**2)
c. O(nlogn)
136. question on virtual function and overloading?
137. question to find error in this C++ code.