Vyom World.com . Let's Touch the Sky Together!  

VyomWorld.com Home
Interview Questions
VyomLinks.com Home
JobsAssist.com Home
Vyom Network
Contact Us
Jobs & Careers
Resume Submitter
Placement Papers
IT Companies Directory
Computer Jobs
Interview Questions
Online Exams
Vyom Career eMag.
SMS Jokes
Source Codes Library
Source Codes Home
ASP Source Codes
C Source Codes
C++ Source Codes
COBOL Source Codes
Java Source Codes
Pascal Source Codes
Submit Source Codes
GATE an Overview
GATE Preparation
Study Materal
GRE an Overview
GRE Questions
GRE Preparation
GRE Universities
TOEFL Preparation
TOEFL Resources
GMAT Preparation
GMAT Resources
MBA Preparation
MBA Resources
Networking Concepts
Networking Concepts
Testing Preparation
Testing Resources
Free Traffic Builder
Webmaster Articles
Web Hosting
Hardware Tutorial
1500 Free eBooks New!
Get 30,000 Interview Questions & Answers in an eBook.

Interview Success Kit - Get Success in Job Interviews

Interview Success Kit - Get Success in Job Interviews Interview Success Kit - 30,000 Interview Que. & Ans.

Home » Placement Papers » Hughes Placement Papers » Hughes Placement Paper 7

New Click here to Download 2017 Latest placement papers of this company New

Hughes Placement Paper 7


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

Ans : c

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

















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

14. Given the following c program

static int i = 10;

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;

{ int i = 5, j = 2;
   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)


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

New Click here to Download 2017 Latest placement papers of this company New



Recently Updated: New Placement Papers added.
Vyom Network : Web Hosting | Dedicated Server | Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Programming & Source Codes | GRE Preparation | Jobs, Discussions | Software Listing | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | International Business Information | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | FAQs | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Excellent Mobiles | Software Testing | Interview Questions | Freshers Jobs | Server Insiders | File Extension Directory

Copyright ©2003-2017 Vyom Technosoft Pvt. Ltd., All Rights Reserved. Read our Privacy Policy