1) A topic on Gandhiji’s Salt Satyagraha Movement. Four sentences were given and you
have to arrange them to make a paragraph. Ans: CABD (Check it out).
2) What can’t be changed by the user program? Ans: Memory Map(Check)
3) In which layer ROUTING is performed? Ans: Network Layer
4) What is the output of the following code snippet?
main()
{
printf(5+”Fascimile”);
}
Ans: mile
5) What is the output?
Main()
{
Int count=10,sum=0,*temp;
Temp=&count;
Sum=∑ &count; (It was actually given temp=∑&count; which is probably wrong)
Printf(“sum=%d count= %d temp=%d “,sum, count,*temp);
} Ans: C (most expected answer, check it)
6) Which one has no L-Value
[i] a[i] [ii] I [iii] 2 [iv] *(a+i) Ans: [iii]
7) In threaded binary for which traversal orders unused left and right links are used?
8) Which is false for binary tree?
[i] Any node should have two children.
[iii] At fourth level the number of node should be less than 16.
9) Which is true for binary search?
[i] Traversal scheme [ii] [iii] Greedy algorithm [iv] Divide and conquer algorithm Ans: [iv]
10) What is the protocol used for getting the physical address by supplying IP address of a node?
[i] ARP [ii] RARP [iii] BOOTP [iv] DHCP Ans: [i]
11) If DELHI is coded as CCIDD then how BOMBAY will be coded?
12) Opposite of SPUR.
13) Opposite of HARBINGER? Ans: Follower
14) Opposite of PROTRUSION.
15) Opposite of RESTIVENESS. Ans: Docility.
16). Find the odd one in a given analogy? Ans: Mundane.
17) Find the analogy: SURPRISE: EXCLAMATION Ans: Dismay: groan.
18) Find the analogy:-- Plateau: Taxonomy.
19) Question from congestion control topic: Ans: source quench.
20) Question from kernel mode: Ans: Disable Interrupts.
21) Which one is a page replacement algorithm?
[i] fifo [ii] [iii] Least recently used. [iv] All of the above.
22) Using two numbers and interchanging + and * there was a question.
Ans: (iii) (some expression=22).
23) For each hour a watch is going slow by 30 seconds. Now time is
8a.m.What will be the actual time at 8 p.m? Ans: ii) 7:54.
24) Question regarding while loop. Ans: (iii).
25) Alphabetical order L, M…(can’t remember) Ans: F
26) One puzzle:(I cant exactly remember this question giving brief idea of this question) there were four guys A, B, C, D. the older and younger relation is given. U have to find the age of the A ? Ans: 7 years (check it out).
28) Nine people six floors. Conditions are given. (This was a very long paragraph). Peoples named like I, J, K, L, M, N, O, P, Q. Ans: J.
29) A question regarding node. Ans: (iii)
30) A problem regarding age of father and son (very easy problem u can solve it).
31) Point out error in the following sentence:
I got the book in the office and slipped it out.
[i] I got the book. [ii] in the. [iii] office and . [iv] Slipped it out. Ans: [iv].
32) Point out error:(about a flowers garden)
Ans: “among on another”. (I can’t remember the options).
1) abcD+abcd+aBCd+aBCD then the simplified function is( Capital letters are copliments of corresponding letters A=compliment of a) [a] a [b] ab [c] abc [d] a(bc)* [e] none
(bc)*=compliment of bc Ans: e
2) A 12 address lines maps to the memory of[a] 1k bytes [b] 0.5k bytes [c] 2k bytes [d] none Ans: b
3) In a processor these are 120 instructions . Bits needed to impliment this instructions
[a] 6 [b] 7 [c] 10 [d] none Ans: b
4) In 8085 microprocessor READY signal does.which of the following is incorrect statements
[a]It is input to the microprocessor [b] It sequences the instructions Ans : b
5) Return address will be returned by function to [a] Pushes to the stack by call Ans : a
6) n=7623
{
temp=n/10;
result=temp*10+ result;
n=n/10
} Ans : 3267
7) If A>B then
F=F(G);
else B>C then
F=G(G);
in this , for 75% times A>B and 25% times B>C then,is 10000 instructions are there ,then the ratio of F to G [a] 7500:2500 [b] 7500:625 [c] 7500:625 if a=b=c else 7500:2500
8) In a compiler there is 36 bit for a word and to store a character 8bits are needed. IN this to store a character two words are appended .Then for storing a K characters string, How many words are needed. [a] 2k/9 [b] (2k+8)/9 [c] (k+8)/9 [d] 2*(k+8)/9 [e] none Ans: a
9) C program code>
int zap(int n)
{
if(n<=1)then zap=1;
else zap=zap(n-3)+zap(n-1);
}
then the call zap(6) gives the values of zap [a] 8 [b] 9 [c] 6 [d] 12 [e] 15 Ans: b
