# Placement Papers - Hughes

## Why Hughes Placement Papers?

Learn and practice the placement papers of Hughes and find out how much you score before you appear for your next interview and written test.

## Where can I get Hughes Placement Papers with Answers?

IndiaBIX provides you lots of fully solved Hughes Placement Papers with answers. You can easily solve all kind of placement test papers by practicing the exercises given below.

## How to solve Hughes Placement Papers?

You can easily solve all kind of questions by practicing the following exercises.

### HUGHES - Placement Paper Pattern - Paper - 2

Posted By : Mythili Rating : +7, -0

HUGHES
Paper Pattern

Part - 2

Section A 30m (Compulsary)

Section B or C 20 m(changed )m

Attempt either B or C sec B contains CST C E&C

Better to attempt Electronics paper (Those who are having electronics
background)

Section A

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]

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

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]

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

In C language the parameters are passsed by a. values b. name c.referrence
d....

Advantage of SRAM over DRAM ans. faster

Diasy chaining related question (refer Z80)

a. uniform interrupt priority

b.non .... ....

c.interfacing slower peripherals

d.....

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

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

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

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

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

AX=B where A is mXn ,b&X are column matrices of order m a. if m<n, X
has infinite solutions b.if m=n, rank of A <n then X has trivial solutions
c.... d....

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

int a={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]

Critical section program segment is

a. enclosed by semaphores with P & V operations

c. where shared resources are accessed

d. ...

when head is moving back and forth, the disk scheduling algorithm is _____

a) scan
b) sstf
c) fcfs
d)....

how many times the loop will execute

LOOP LXI B,1526H

DCX B

JNZ LOOP

a) 1526H times b) 31 c) 21 d) 38

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

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

The network that does not use virtual circuit

a) IP b) X.25 c).... d)..

source routing bridge

a) source will route the frame

b) frame will routed with info in header

c)....         d)..

cache access time 100 msec. main memory access time 800 msec if the hit ratio is
95% , what is mean access  time ...

The module that should be always
reside in main memory is

c)...         d)........ and some questions
related to

2.assembler passes

4. file directory search

5. turning machine

6. finite state machine

7. daisy wheel

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))

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.

Which among the following is not correct

a. O(n) > O(log n) .. likewise

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)

is equivalent to Ans. A union B

Union and intersection are in there sign conventions.

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)

Of Newton Rapson method...

Of power set A set contains {(fi),a,{a,b}} what is the powerset of it Ans. 8

A question of logic gates Ans. U can got the answer very easily

A question on the Booths algo Ans. The sequence is 1010101010101010

Relative addressing mode is used for Ans. Dont know.

For how many numbers there is no difference between little endian and big
endian

Ans. 256

For the multiplication of two 8 bit numbers how much ROM will be used

Ans. 64k*16 ROM(Check it)

Why direct mapping is not good for the mapping of Cache Memory.

Ans. Dont know

What is the main property of Desiy I/O Sytem Ans.

A question on the nyquist theorem

Ans. 18000 bps

What is the shannon theorem...

Ans. Refer to data communication(Stalling) book

CSMA/CD protocol is used in

Ans. Ethernet

What is the limitation of the Pulse Code Modulation

Ans. Refer to data communication book

In CSMA/CD

For an IP Router how many IP addresses

Ans. Check it i think Answer is Only One.

Which protocol u used when you want to know the IP address corresponding to a

Ans. RARP

Which part of the IP header is used for the time limit of the packet.

Ans. TTL

Which PageReplacement algo will give the best result

Ans. By replacing that page which has the next reference after a long
time.(optimal algo)

What the code will be said when it is called by another part and it is not
completed yet

Ans. Reentrant Code.

three questions on the simple programs

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)

hat is the rank of the graph

Ans. e-n+k

Which traversal of the tree gives the node in the ascending order.

Ans. Inorder

Which traversal of the tree gives the node in the ascending order.

Ans. Inorder

What is garbage collector.