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

Home
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.
Fun
Send FREE SMS!
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
GATE an Overview
GATE Preparation
Study Materal
GRE
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
Webmasters
Free Traffic Builder
Webmaster Articles
Web Hosting
Tutorials
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 8

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


Hughes Placement Paper 8


Advertisements
Advertisements

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

Ans. (a)


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


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


4.Iintegrated check value(ICV) are used as:

Ans. The client computes the ICV and then compares it with the senders value.


5. Question on client-server system using asychronous request from the client

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


7. 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) A array in reverse sorted order is a heap
d) A heap can't contain any element more than once


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

Ans. Status check.


9. 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 search
d) None


10. Find the outpur 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);
}


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


12. Path testing is

a) Black box testing strategy
b) White box testing strategy
c) An installation .........
d) An enviornment


13.  X:verification' asks are we building the right product
       Y:validation' asks are we building the product right


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

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


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


17. Which of the following is not condition having a deadlock resource previous granted, can be forcebly 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 hold on to old ones
c) Here is a cycle in the resource allocation graph


18. An IP/IPX packet received by a computer using... having IP/IPX  both how the packet is handled.

Ans. Read the, field in the packet header with to send IP or IPX protocol.


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


20.  Cyclomatic complexity

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


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


22. Global static variable within a file is intended to

a) Localize swap
b) Retain value persistently
c) Define constant
d) Fixed address in memory


23. Why is thread switch faster than a process switch


24. What is the binary equivalent of 41.6875


25. Checkpoint value will be calculated in


26. DHCP is used for

a) IP address allocation
b)dynamic host configuration protocol


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

 

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