Provided by www.YuvaJobs.com - Whole Testpaper       


HUGHES PAPER PATTERN&nbsp;&nbsp;
section A 30m (Compulsary)&nbsp; section B or C 20 m(changed )m&nbsp; Attempt either B or C sec B contains CST C E&amp;C&nbsp; Better to attempt Electronics paper (Those who are having electronics background)
&nbsp; Section A


Which of the folowing is not correct&nbsp;&nbsp; a. (x+y),=x,.y, b. (x,+y,),=x.y&nbsp;&nbsp; c. (x,.y,),=x+y d. (x,+y,),=x,.y, [d]

Question on logic ckt. U have to find the output&nbsp;&nbsp;&nbsp; ans. AB,+CD,+EF,

Output of MUX&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; _________&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; c-----| |&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; c,----| |-------Y&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; c,----| | ans. A xor B xor C&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; c-----| |---------&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; | |A B (select lines)

If X and Y are two sets. |X| and |Y| are corresponding coordinates and exact no.of functions from X to Y is&nbsp;&nbsp;&nbsp; 97 then&nbsp;&nbsp; a. |X|=97 |Y|=1 b. |X|=1 |Y|=97&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; c. |X|=97 |Y|=97 d. .....

If two dies are thrown simultaneously what is the prob. of one of the dice getting face 6 ?&nbsp;&nbsp; a. 11/36 b. 1/3 c. 12/35 d. 1/36 [a]

&nbsp;The relation ,&lt;,on reals is&nbsp; a. a partial order because of symmetric and reflexive&nbsp;&nbsp;&nbsp; b. ... antisymmetric and ....&nbsp;&nbsp;&nbsp; c. not ...... .. asymmetric and non reflexive&nbsp;&nbsp;&nbsp; d. ... .... not anti-symm and non reflexive

&nbsp;In C language the parameters are passsed by&nbsp;&nbsp;&nbsp;&nbsp; a. values b. name c.referrence d....

Advantage of SRAM over DRAM&nbsp;&nbsp; ans. faster

&nbsp;Diasy chaining related question (refer Z80)&nbsp;&nbsp; a. uniform interrupt priority&nbsp;&nbsp; b.non .... ....&nbsp;&nbsp; c.interfacing slower peripherals&nbsp;&nbsp; d.....

RAM chips arranged in 4X6 array and of 8kX4bit capacity each. How many address lines reqd. to access&nbsp; each byte&nbsp; a. 12 b. 16 c.15 d. 17

Question related to AVL trees regarding how many no.of&nbsp; nodes to be changed to become balanced after&nbsp; addition of a leaf node to a particular node.&nbsp; ans . 3

When following sequence is insertedin the binary search tree no.of nodes in left and right subtrees 52 86 64 20&nbsp;&nbsp; 3 25 14 9 85

Method used for Disk searching..&nbsp;&nbsp;&nbsp; a.l&nbsp; inked list b.&nbsp; AVL c.&nbsp; B-tree d.&nbsp;&nbsp; binary tree

Which of the following is correct statement.&nbsp;&nbsp; a.&nbsp;&nbsp; 1,s complement can have two zero re[resentations&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; b.&nbsp;&nbsp; 2,s ... ... represent an extra neg. number&nbsp;&nbsp; c.&nbsp;&nbsp; 2,s &amp; 1,s have no difference in representing 16-bit no.&nbsp;&nbsp; d.......

AX=B where A is mXn ,b&amp;X are column matrices of order m a. if m&lt;n, X has infinite solutions&nbsp; b.if m=n, rank of A &lt;n then X has trivial solutions&nbsp; c.... d....

The option avialable in C++, not C:&nbsp;&nbsp; a.&nbsp; dynamic scoping&nbsp;&nbsp; b.&nbsp; declaration in the middle of code block&nbsp;&nbsp; c.&nbsp;&nbsp; seperate compiled and linked units&nbsp; d. ....

&nbsp; int a[4]={1,2,3,4};&nbsp; int *ptr;&nbsp; ptr=a;&nbsp;*(a+3)=*(++ptr)+(*ptr++);A part of code is shown. The elements in A after the execution of this code.&nbsp; a.1 2 3 4 b. 1 2 3 6c. compilation error d.1 2 2 4 [a]

Critical section program segment is&nbsp;&nbsp;&nbsp;&nbsp; a.&nbsp;&nbsp; enclosed by semaphores with P &amp; V operations&nbsp;&nbsp;&nbsp; b.&nbsp;&nbsp; deadlock avoidance&nbsp;&nbsp;&nbsp; c.&nbsp;&nbsp;&nbsp; where shared resources are accessed&nbsp;&nbsp; d. ...

when head is moving back and forth, the disk scheduling&nbsp; algorithm is _____&nbsp; a) scan&nbsp;&nbsp; b) sstf&nbsp;&nbsp; c) fcfs&nbsp;&nbsp; d)....

how many times the loop will execute&nbsp;&nbsp; LOOP LXI B,1526H&nbsp;&nbsp; DCX B&nbsp;&nbsp; JNZ LOOP&nbsp;&nbsp;&nbsp; a)&nbsp;&nbsp; 1526H times&nbsp;&nbsp;&nbsp; b)&nbsp;&nbsp;&nbsp; 31&nbsp;&nbsp;&nbsp; c)&nbsp; 21&nbsp;&nbsp; d)&nbsp; 38&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;

the addressing mode in which the address of the operand is expressed explicitly within the instruction&nbsp;a)&nbsp;&nbsp; index addressing b)&nbsp;&nbsp; absolute c)&nbsp;&nbsp; indirect d)&nbsp;&nbsp; immediate

(A - B) U (B - A) U (A ^ C) = ?&nbsp; where A,B are two sets A, , B, are compliments of A and B&nbsp; a) A U B&nbsp;&nbsp; b) A ^ B&nbsp;&nbsp; c)....&nbsp;&nbsp; d)....

&nbsp;The network that does not use virtual circuit&nbsp;&nbsp; a) IP&nbsp;&nbsp; b) X.25&nbsp;&nbsp; c)....&nbsp;&nbsp; d)..

source routing bridge&nbsp;&nbsp; a)&nbsp; source will route the frame&nbsp;&nbsp; b)&nbsp; frame will routed with info in header&nbsp; c).... d)..

&nbsp;cache access time 100 msec. main memory access time 800 msec if the hit ratio is 95% , what is mean access&nbsp; time ...

The module that should be always reside in main memory is&nbsp; a)&nbsp; loader b)&nbsp; link module&nbsp;&nbsp; c)...&nbsp;&nbsp; d)....&nbsp;&nbsp; .... and some questions related to1.&nbsp;&nbsp; addressing mode 2.assembler passes 3.linking and loading4. file directory search 5. turning machine&nbsp;6. finite state machine 7. daisy wheel

The order of algorithm to merge the two sorted lists of&nbsp; lengths m and n is&nbsp;a. O(m) b. O(n) c. O(m+n) d. O(log(m)+log(n))

A chocolate block is of 4 X 4 size.How many cuts are needed to make 1 X 1 size blocks. No simultaneous&nbsp; vert. &amp; horz. cuts.

Which among the following is not correcta. O(n) &gt; O(log n) .. likewise
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Section C 


One question of Set Theory Like there Are two sets A and B and (A-B)union(B-A)union(A intersection B)&nbsp;&nbsp;is equivalent to Ans. A union B

&nbsp;Union and intersection are in there sign conventions.&nbsp;

One question of probability Like between 100 and 999 how many no have the prob that they does not contain 7&nbsp;Ans. 16/25 (not sure u can check by own)&nbsp;

Of Newton Rapson method...&nbsp;

Of power set A set contains {(fi),a,{a,b}} what is the powerset of it&nbsp;&nbsp; Ans. 8&nbsp;

A question of logic gates Ans. U can got the answer very easily

A question on the Booths algo&nbsp; Ans. The sequence is 1010101010101010&nbsp;

Relative addressing mode is used for Ans. Dont know.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;

For how many numbers there is no difference between little endian and big endian&nbsp;Ans. 256

For the multiplication of two 8 bit numbers how much ROM will be used&nbsp;Ans. 64k*16 ROM(Check it)

Why direct mapping is not good for the mapping of Cache Memory.&nbsp;Ans. Dont know

What is the main property of Desiy I/O Sytem Ans.&nbsp;

A question on the nyquist theorem&nbsp;Ans. 18000 bps&nbsp;

What is the shannon theorem...&nbsp;Ans. Refer to data communication(Stalling) book&nbsp;

CSMA/CD protocol is used in&nbsp;Ans. Ethernet&nbsp;

What is the limitation of the Pulse Code Modulation&nbsp;Ans. Refer to data communication book&nbsp;

In CSMA/CD&nbsp;Ans. The Access to the channnel is probabilistic.&nbsp;

For an IP Router how many IP addresses&nbsp;Ans. Check it i think Answer is Only One.&nbsp;

Which protocol u used when you want to know the IP address corresponding to a MAC Address&nbsp;Ans. RARP&nbsp;

Which part of the IP header is used for the time limit of the packet.&nbsp;Ans. TTL&nbsp;

Which PageReplacement algo will give the best result&nbsp;Ans. By replacing that page which has the next reference after a long time.(optimal algo)&nbsp;

What the code will be said when it is called by another part and&nbsp; it is not completed yet&nbsp;Ans. Reentrant Code.&nbsp;

&nbsp;three questions on the simple programs&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;

There is a sequence of no and prepare a binary tree and tell how many nodes are in the left and right sub tree.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Ans. Check it Ans (4,7)&nbsp;

hat is the rank of the graph&nbsp;Ans. e-n+k&nbsp;

One question on the multithreading

Which traversal of the tree gives the node in the ascending&nbsp; order.&nbsp;Ans. Inorder&nbsp;

Which traversal of the tree gives the node in the ascending&nbsp; order.&nbsp;Ans. Inorder&nbsp;

What is garbage collector.&nbsp;&nbsp;
Provided by www.YuvaJobs.com - Whole Testpaper