HUGHES PLACEMENT PAPER -------- Placement Paper

HUGHES PLACEMENT PAPER -------- Placement Paper - 1

Question Posted / guest

1 Answers
6109 Views
Hughes, I also Faced
E-Mail Answers

HUGHES PLACEMENT PAPER -------- Placement Paper - 1..

Answer / guest

Hughes Placement Paper

Hughes Aptitude Questions

1. Find the probability of getting a number with 7 between
100 and 999 (both inclusive).

2. There are 10 items in a box, out of which 3 are
defective.
��� 2 balls are taken one after the other.
��� What is the probability that both of them are defective?

Hughes Technical Test Questions

3. Context free grammar is accepted by

a) finite automata
b) push down automata
c) two way bounded automata
d) both b and c

4. Which is not a memory management scheme?

a) buddy system
b) swapping
c) monitors
d) paging

Ans : c

5. Simplify the Karnaugh map given below and derive its
expression in SOP form

-
1
1
-

1
-
-
1

1
-
-
1

-
1
1
-

6. Question on NAND gates implementation.

7. Definition of Context Sensitive Grammar

8. An identifier can start with a letter followed by any
number of letter or digits .

9. With the following configuration:
��� 8MB total memory, 256kb cache , 4kb is block size.
��� Using direct mapping, how many different physical
memory blocks can be mapped on to the cache.

(a) 64� (b) 256� (c) 128

10. CSMA/CD is used in

a) token ring
b) FDDI
c) ethernet

11. In TCP/IP header, checksum contains

a) sum of all the words
b) ones complement of the data
c) ones complement of the sum of all the words
d) ones complement of the sum in ones complement

12. What is the maximum number of acknowledgements for a 4
bit sequence number in a sliding window protocol.

13. Which is a good way of representing varaibles in
recursion

a) local variables
b) static varaibles
c) global variables

C Questions
C Test Questions

14. Given the following c program

func()
{
static int i = 10;
printf("%d",i);
i++;
}

What is the value of i if the function is called twice ?

15. Given the following c program

func(int *i, int*j)
{*i=*i * *i;
��*j=*j* *j;
}

main()
{ int i = 5, j = 2;
�� func(&i,&j);
�� printf("%d %d", i, j);}

What is the output?

16. Given page table, page size and offset find the
corresponding physical address ?

17. In a memory chip 4k size and 16bit words are to be
stored.
����� No of address and data lines required is:

18. Identify in which pass of the 2 pass compiler are the
following compiled

1) literals
2) address resolution
3) listing

19. Object code does not require

a) relocation bits
b) external names and place where they are located
c) absolute adress
d) all the object codes

20. ARP is in reference to

a) MAC to IP
b) IP to MAC

21. Question on Balanced tree -
����� A balanced tree is given and a node is addded at the
leaf.
����� Find the no of unbalanced nodes?

22. What is the order of Hashing time:

a) 0(1)
b) 0(n2)

23. Given that:
������� s -> s + s ; s -> s * s ; s -> a
����� Find the no of parse trees for a+a*a+a

a) 4
b) 5
c) 6
d) 7

24. Order of deleting a node from a linked list.
����� (pointer is to an arbitrary node)

a)0(1)
b)0(n)

25. A choclate of size nXn is given and is to be made into
pices of size 1x1.
����� At a time both horizontal and a vertical cut is done.
����� Find the order of complexity

a) O(n2)
b) O(nlogn)
c) O(logn)

26. A directed graph is represented by adjacency list.
����� To find the complexity of indegree of the node. e -
edge n- vertices

27) No of leaf nodes given. find the no of nodes with
degree 2.

28) AX = B.
����� A is mXn and B is mX1

a) there is a unique solution if rank of A is same as rank
of augumented matrix [A b]
b) there are multiple solutions

29. LXI sp,2099h
����� LXI b, 2012h
����� PUSH b

30. A and B are sets.
����� A's cardinality is m and B's is n where m < n
����� How many one to one mappings can be obtained.

a) n ^ m
b) npm
c) mpn
d) mcn

31. In scheduling algorithnms which are logically executed
but suspended

a) preemptive
b) SJF
c)non preemptive
d) all the above

32. I/O redirection is

a) copying programs files through a pipe
b) input files are created
c) input file taken from existing ones
d) none

33. Symmetric multiprocessing can be done in

a) snoopy protocols
b) cache coherence

34. In the dining philosophers problems to avoid dead lock

a) 1 person will take left one and all other will take
right one
b) adjacent persons should not eat concurrently

35. In the process state cycle, which is the correct order

a) timeout:� ready -> running
b) blocked: ready -> running

36. For converting infix expression to postfix what do we
require

a) operand stack
b) operator stack

37. 0 is reprented as both and negative and positive in

a) ones complement
b) twos complement
c) two's complement has extra negative number

�

38. What is the difference between c and c++?

a)In c++ we can define variables in the middle
b)dynamic scoping

39. Which of the following is correct

a) Synchronous tranmission needs more badwidth than
Asychronous.
b) Inasychronous transmission , the time is associated with
data itself.....

Hughes Placement Papers | Hughes Technical Test Questions |
Hughes Aptitude Questions | Hughes Interview Procedure |
Hughes Interview Questions