Home

Resources

Placement Papers

Hughes Interview Questions

Category: Placement Papers
Published on: 8th Jun 2005 | 7569 people have read this article.

Hughes Interview Questions.

Latest 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?

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

5. Definition of Context Sensitive Grammar

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

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

8. CSMA/CD is used in A. token ring B. FDDI C. ethernet

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

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

11. Which is a good way of representing variables in recursion A. local variables B. static variables C. global variables

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

13. 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);}

14. There was a circuit given using three nand gates with two inputs and one output. Find the output. A. OR B. AND C. XOR D. NOT

15. Suggest a sorting algorithm, which is efficient (in worst case) to 10 values A. Binary tree B. Selection C. Bubble D. Any of the above

16. What is the number of comparisons in the worst case to merge two sorted lists containing n elements each? A. 2n B. 2n-1 C. 2n+1 D. 2n-2

17. Integrated check value (ICV) are used as:

18. If a binary tree is constructed using nodes with two pointers each, how many null pointers does a tree with N nodes have? A. n-1 B. n C. n+1 D. Depends on the number of edges

19. Which of following statements about heap is wrong A. An n element heap has height log n(base of log is 2) B. Smallest element of heap is always a leaf C. An array in reverse sorted order is a heap D. A heap can't contain any element more than o...

20. When applets are downloaded from web sites, a byte verifier performs _________?

21. For the following C program void insert(key,r) typekey key,data array r; {extern int n; if(n>=max) /*error table if full */ else r[n++].k=key; } This on executing, enables a A. Basic sequential search B. Binary search C. Interpolation ...

22. Find the output of the following C program void f(char *p) {p=(char *) malloc(6); strcpy(p,"hello"); } void main( ) {char *P="bye"; f(p); printf("%s',p); }

23. Time taken to access cache is 100ns and to access memory is 1000ns. Hit ratio given. Find the average access time

24. Path testing is A. Black box testing strategy B. White box testing strategy C. An installation D. An environment

25. Which one of the following can't be used to find an Internet address given the domain name? A. /etc/host B. NIS yellow pages C. DNS D. ARP

26. Flow control is necessary for the transport protocol layer due to the following reasons A. Unreliable link B. Congestion at receiver C. Packets out of sequence D. None of these

27. In public key encryption, if A wants to send a message to B so that no one else can read the message then A encrypts the message using A. A's public key B. A's private key C. B's public key D. B's private key

28. Which of the following is not condition having a deadlock resource previous granted can be forcibly taken away from a process? A. Resources need to be used in mutually exclusion fashion B. Process can request new resources, as they continue to h...

29. An IP/IPX packet received by a computer having IP/IPX or both. How the packet is handled.

30. The range of the 32-bit number in two's complement form is _______

31. Cyclomatic complexity {if((x=0) or (y=0)) p=0; else {p=x;i=1; while(i!=y) {p=p+x; i=i+1;} } }

32. Activation record will contain the A. Storage for simple names B. Information about attributes for local names C. Return address D. All of the above

33. Global static variable within a file is intended to A. Localize swap B. Retain value persistently C. Define constant D. Fixed address in memory

34. Why is thread switch faster than a process switch?

35. What is the binary equivalent of 41.6875?

36. Checkpoint value will be calculated in

37. DHCP is used for A. IP address allocation B. dynamic host configuration protocol

38. For the following C program int x(char *a) {a=(char *) malloc(10*sizeof(char)); *a="hello"; } main() {char *a="new"; x(a); printf("%s",a); } The output is A. Hello B. New C. Hello new D. Run time error

Ads

Read Next: Keane India Placement Paper

Login Panel

Data Warehouse

Resources

Programming

Database

Testing

Information Technology

Career Development

Enterprise System

Industry

Subscribe via RSS

Hughes Interview Questions