Home »» Placement Papers »» All Papers »» Hughes »» Placement Paper

### Hughes Placement Paper2-2006 (Technical- Computer Architecture)

Paper: Hughes Placement Paper2-2006 (Technical- Computer Architecture)

1. 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'
Ans : [d]

2. Question on logic ckt. U have to find the output
ans. AB'+CD'+EF'

3. Output of MUX

c-----| |
c'---- | |--Y
c'---- | |
c-----| |
| |
A B (select lines)

ans. A xor B xor C

4.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. .....

5. 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
Ans :[a]

6. The relation ,<,on reals is
a. a partial order because of symmetric and reflexive
b Antisymmetric
c. asymmetric and non reflexive
d. anti-symm and non reflexive

7.  In C language the parameters are passed by
a. values  b. name  c. reference

8.  Advantage of SRAM over DRAM
ans. faster

9. Daisy chaining related question (refer Z80)
a. uniform interrupt priority
b. non
c. interfacing slower peripherals

10. RAM chips arranged in 4X6 array and of 8kX4bit capacity each. How many address lines required to access each byte
a. 12 b. 16 c.15 d. 17

11.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

12.When following sequence is inserting the binary search tree no. of nodes in left and right sub trees 52 86 64 20 3 25 14 9 85

13.Method used for Disk searching..
a.linked list b.AVL c.B-tree d. binary tree

14.Which of the following is correct statement.
a. 1's complement can have two zero representations
b.2's ... ... represent an extra neg. number
c.2's & 1's have no difference in representing 16-bit no.

15.AX=B where A is mXn ,b&X are column matrices of order m
a. if m
b. if m=n, rank of A
.
16.The option available in C++, not C:
a. dynamic scooping
b. declaration in the middle of code block
c. separate compiled and linked units

17.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]

18.Critical section program segment is
a. enclosed by semaphores with P & V operations
c. where shared resources are accessed

19.when head is moving back and forth, the disk scheduling
algorithm is _____
a) scan b) sstf c) fcfs

20.how many times the loop will execute

LOOP LXI B,1526H
DCX B
JNZ LOOP
a)1526H times b) 31 c)21 d)38

21. 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

22. (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).....

23. the network

 Comment Tweet