Placement Papers for All Companies

3i infotech
Abacus Infotech
Abatix
Abaxis
ABB
ACC Limited
Accel Frontline
Accenture
Aditi Technologies
Adobe System
ADP
Agilysys
AgreeYa
AIG
AirNet
Alanco Technologies
Alle Technologies
Allfon
Alter Systems
Amazon
AMDL
Amdocs
AMI
Amiti Software Technologies
ANZ
Apple
Applied Materials
Apps Associates
Aricent
ASDC
Ashok Leyland Ltd
Asian Paints
Aspire System
AT & T
Atlas Copco
Atos Origin
AXA Technology Services
Axes Technology
Bain
Bajaj
Bayer
Bharti Airtel Ltd
Bhawan Cybertek
Birlasoft
Blue Star Infotech
BMC
BOB
Brakes India
C-DOT
CA Technologies
Cadence
Calsoft
Canarys
Capgemini
Caterpillar
Celstream
CGI Group
Changepond Technologies
Cimtrix Systems
Cisco system
Citicorp Overseas Software Ltd
ClinTech
CMC Limited
CMS
Cognizant
Compaq
Consagous Technologies
Convergys
CORDYS
CRISIL
Crompton Greaves
CSC
CSFB
CtrlS Datacenters Ltd
Cummins
Cyient
Daffodil
Daimler
Dell
Deloitte
Delphi-TVS
Dharma Systems
Directi
DSRC
Eicher
ELGI
ELICO
EMC Corporation
Emphasis
Ericsson
Ernst & Young
ESKO
Essar
Facebook
Fanuc Corporation
Fidelity
Flextronics
Flipkart
Freescale
Fujitsu
Gajshield
GE
Genpact India
Geodesic
Geometric Limited
GlobalEdge
GlobalLogic
GMR Group
Godrej Infotech
Google
Grapecity
Harita - TVS
HCL
HCL Technologies
Headstrong
Healthasyst
HEC Ltd
Hexaware
HFCL
Holool
Honeywell
HP
HTC Global Services
Huawei
Hughes
Hyundai
IBM
IBS Software Services
IGate
Ikanos
IKOS
Impetus
iNautix
Indecomm
IndiaBulls Power Limited
Inductis-EXL
Industrial Alliance
Infineon
Infogain
Infosys
Intec
Integra
Intel
Intergraph
ITC Infotech
Jindal Steel and Power Limited
KPIT
L & T
L & T Infotech
LG Soft
Linde India Ltd
LnT Emsys
LnT-ECC
Lucas - TVS
Mahindra Engineering Services Ltd
Mahindra Ltd
Maruti
Matrix
Maveric Systems
McAfee
Microland
Microsoft
Mindtree
Miraclesoft
MKCL
Motorola
Mu-Sigma
Nagarro
NASSCOM
NCR Corporation
Ness Technologies
Neudesic
NIIT Technologies
Novell
Nvidia
Oracle
Persistent
Philips
Planetasia
Polaris
Poornam Info Vision
PSI Data Systems Limited
Quest-Global
Quinnox
R Systems
Redpine
Reliance Energy
Robert Bosch
RS Software
Samsung
SAP labs India
Sapient
Sasken Communications
Schneider India
Serco
Siemens
Sierra Atlantic
SkyTECH
Soliton
Sonata Software
Sony India
SQL Star
Steria
Subex Limited
Sutherland Global Services
Syntel
Talisma
Tata motors
Tata technologies
Tata-ELXSI
TCE
TCS
Tech Mahindra
Temenos
Tesco
Texas Instruments
Thermax
ThoughtWorks
Torry Harris
Triad
Trianz
Trilogy
TVS Motor
Unisys
UnitedHealth Group
UST Global
UTC Aerospace System
Valuelabs
Vedanta
Verifone
Verizon
Virtusa
Vision Infotech
Vizual
VMware
Wipro
Yahoo
YASH Technologies
Zenith
Zensar Technologies
ZTE

Hughes Technical Test 31st December 2009

Posted on :01-04-2016

Q1. Which does not use client server model?
  
a. Email
b. Web access
c. C. Telephone call
d. N/w file system


Q2. For disk or direct access storage, which is best?                                       

a. AVL
b. B-tree
c. Red tape.


Q3. In worst case, which sort is best out of following sorts?

a. heap
b. selection
c. quick
d. insertion


Q4. In a pipeline having 3 stages, each having reliability of 0.9, what is the overall reliability of pipeline?

a. 0.9
b. 0.729
c. 0.81


Q5. There is a diskless workstation. Which will be the first protocol it will use?

a. FTP
b. ARP
c. HTTP
d. RARP


Q6. Which one does not have file descriptor?

a. process
b. keyboard
c. pipe
d. socket


Q7. What is dirty read?

a. Transaction reexecutes and gives diff. Results from the original execution
b. Read is done when the transaction is not yet committed


Q8. Java applet of a moving /waving file is running on one machine then it means

a. Javas executable code is downloaded and running on the m/c
b. A virtual X server is running on that m/c while the actual program is running on the web server


Q9. Any n/w on the computer can have only

a. one domain &one IP
b. more than one domain & more than one IP
c. one domain and more than one IP
d. more than one domain & one IP


Q10. During run time heap is managed by

a. a user process in kernel mode
b. A system process manages heap for all the processes
c. A system process for each process
d. A user process in user mode


Q11. X: In DFD, input is converted into output by passing through various functional units 
Y:DFD cannot be used in object oriented design

a. both X& y are correct
b. both X & Y are incorrect
c. X correct, Y incorrect
d. Xincorrect, Y correct


Q12. If there are N people and we have to do symmetric & asymmetric cryptography, how many keys would be used in these cases respectively? 

a. N & N ^ 2 
b. N ^ 2 & N
c. N & N
d. N ^ 2 & N ^2


Q13. Which is not necessary condition for deadlock? 
 
a. mutual exclusion
b. no preemption
c. Circular wait


Q14. One megabit file transfer, serially on 9600 baud one start bit and two stop bits, then how much time it takes? 

a. 4 hours
b. 2 hours
c. 20 minutes
d. 2 minute


Q15. When the program counter is incremented in the instruction cycle?

a. fetch cycle
b. int cycle
c. execution cycle


Q16. DHCP is

a. for routing
b. for network address conversion
c. for diagnosis


Q17. In public key algorithm, A wants to send message to B. Which key is used?

a. A public key
b. A private key
c. B public key
d. B private key


Q18. Which of the following is efficient in terms of space?

a. insertion sort
b. quick sort
c. selection
d. both a and c


Q19. In reentrant procedure, which should be not used for passing parameters?
     
a. passed by reg
b. by direct
c. by indirect
d. by stack


Q20. In demand paging overhead of context switching is more due to

a. copy processes from disk to memory
b. viceversa
c. to get associative table
d. swapping to the disk


Q21. A table contains less than 10 elements which one is fastest
   
a. bubble sort
b. selection sort
c. quick sort


Q22.  What is cyclometric complexity in product of x and y?

if(x=0|y=0)
y=1;
else
y=0;

a. 3
b. 2
c. 1
d. 0


Q23. Path testing is

a. white box
b. black box
c. installation test
d. environment test


Q24. About UDP one Address is given but that is not the state table what will it do the packet?
 
a. packet is discarded
b. packet is sent to ethernet server
c. packet is sent to other address


Q25. RAM chips arranged in 4X6 array and of 8kX4bit capacity each. How many address lines required to access each byte?

a. 12 
b. 16 
c.15 
d. 17


Q26. Method used for Disk searching ---.

a. linked list 
b. AVL 
c. B-tree 
d. binary tree


Q27. The option available in C++, not C:

a. dynamic scoping
b. declaration in the middle of code block
c. seperate compiled and linked units


Q28. How many times the loop will execute

   LOOP LXI B,1526H
   DCX B
   JNZ LOOP 

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


Q29. A part of code is shown. 

int a[4]={1,2,3,4};
int *ptr;
ptr=a;
*(a+3)=*(++ptr)+(*ptr++);

The elements in A after the execution of this code are ---.

a.1 2 3 4 
b. 1 2 3 6
c. compilation error 
d.1 2 2 4


Q30. Critical section program segment is 

a. enclosed by semaphores with P & V operations
b. deadlock avoidance
c. where shared resources are accessed


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


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


Q33. What is the maximum number of hops in hypercube n/w with n (=2 ^ p) to go from one node to another?

a. p
b. log p
c. n ^ 2


Q34. In completely connected multiprocessor system with n processors, links will be of the order of

a. O(n ^ 2)
b. O(2 ^ n)
c. O(n/2)


Q35. p points to an integer. We do not want p to change value. In C, what declarations will we use?

a. const int *p  
b.  int *p
c.  int const *p
e.  int* const p


Q36. Program counter is incremented in

a. fetch 
b. decode
c. execute


Q37. For synchronisation in distributed computing, what should not be there?

a. all machines are synchronised by a global clock
b. all systems should have their own clock.


Q38. What is in RSA algorithm?

a. First the session key is encrypted & then whole message is encrypted using RSA Algorithm
b. Message is encrypted using RSA algorithm
c. First RSA algorithm is used &then encrypted with the session key.                       

Q39. What does CONNECT BY means?

a. connect to a different data base for retreival
b. arrange in tree ordered structure


Q40. In which of following search is efficient?

a. height balanced tree
b. Weight balanced tree
c. Binary tree


Q41. Where regression testing is used?

a. Dynamic analysers
b. Loaders


Q42. In a linked list, we can delete a node in order of

a. 1
b. n
c. n ^ 2


Q43. For Java interfaces, what is true?

a. Functions declarations are not given
b. Variables are not declared
c. Instance variables are not used


Q44. The protected element of a class can not be accessed by

a. member functions of the same class
b. member functions of the derived class
c. member functions of any other class in the same program 


Q45. To solve an expression which of following trees will you use?

a. postfix
b. infix


Q46. In public key encryption what does A do such that It is not visible to others?

a) A uses public key part of A
b) A uses private key part of A
c) A uses public key part of B
d) A uses private key part of B


Q47. Path testing comes under

A) white box 
B) black box


Q48. When server A sends a time request to server B, (time synchronization), and response becomes past, What does A do?

a) resets its own clock
b) resends time request again


Q49. When an IP address is not in the computer address resolution file, what does it do with that packet?

a) Ignores it
b) sends it to default gateway
c) sends it to ethernet server


Q50. X: verification means doing the right things
  Y: validation means doing things right

a. both true
b. both false
c. one true one correct


Q51. Which is best for associative list searching?

a) single linked list
b) doubly linked list
c) hash table


Q52. Gain margin of g(s)h(s)=1/s(s+k);

a. sqrt(1+k2)
b. 0
c. infinity
d. 1


Q53. Number of flip flops for mod 11 counter is ---.

a. four
b. five


Q54. Machestor code does not improves

a. clock recovery
b. bandwidth efficiency


Q55. Poisson distribution is used for

a. used in FSM
b. used for queuing delay system of mutually identical events of arrival
d. both a and b


Q56. Operational amplifier characteristics - Which of the following is correct?                                    

a. input impedance is 0
b. output impedance is infinity
c. input impedance is infinity
d. gain is infinity 


Q57. If CPU have one interrupt pin and on to connect with external devices with some priority, which type of the following is used?

a. parallel priority interrupt
b. daisy chain
c. RS flip flop


Q58. Band pass signal having frequencies 2.5k and 4.5k, give the sampling frequency.

a. 9k
b. 4k
c. 4.5k
d. 7k


Q59. Two sorted lists of n elements will take at least fine the order of complexity?

a. 2n
b. n/2
c. square(n)


Q60. Execution phase can be

a. pipelined
b. no parallelism is possible
c. vector processing


Q61. Virtual functionality is used in C++

a. dynamic binding
b. if the derived function is present but base class not present                 


Q62. To prevent replay attacks in transmission

a. symmetric encoding
b. Asymmetric encoding
c. For every exchange, key should be changed


Q63. If heap sort contains n elements, no of comparisons required are

a. log(n)
b. height of heap sort


Q64. In sorted table contains elements, which of the searching is false?

a. hash table
b. binary searching


Q65.  In associated memory for fast accessing which one is used?

a. single linked list
b. double 
c. hash table


Q66. If X and Y are two sets. |X| and |Y| are corresponding coordinates and exact number of functions from X to Y is  97 then

a. |X|=97 |Y|=1 
b. |X|=1 |Y|=97 
c. |X|=97 |Y|=97


Q67. When head is moving back and forth, the disk scheduling algorithm is _____

a) scan   
b) sstf   
c) fcfs  


Q68. What is Kerberos?    

ANS: Authentication Protocol.


Q69. When quick sort gives worst performance?    

ANS: When elements are in order


Q70. What is Function Point? 

ANS: S/W estimation technique


Q71. 2 level caches are there, first level caches access time is 100 ns, second  level caches access time is 33 ns & memory access time is 1000 ns . What is total memory access time? 

ANS: 140 ns


Q72. What does projection of a relation give? 

ANS: Gives vertical partition of relation corresponding to specified columns.


Q73. Ping command uses which protocol? 

ANS: ICMP


Q74. Merge sort uses which technique? 

ANS: Divide and Conquer


Q75. What does the following program do?   
                                                       
f(int n)
{
int c;
while(n)
{
n&=n-1;
c++;
}
print c;
}

ANS: Program prints the number of set bits in number


Q76. In which algorithm waiting time is minimum?

ANS: SJF


Q77. How many address bits are there in Ipv6?

ANS: 128 bits


Q78. What is the binary representation of 41.6785?


Q79. What is the output of the following program?

Void f(char *p)
{
p = (char*)malloc(6);             
strcpy(p,hello);
}
void main( )
{
char *p = BYE;
f(p);
printf(%s,p);

ANS: BYE


Q80. What is concerned with transport layer? 

ANS: PORT.


Q81. For which purpose dhcp is used? 

ANS: IP address


Q82. Program counter is incremented typically in which uses?

ANS: fetch


Q83. What is the number of NULL pointers in a tree with n leaf nodes?

ANS: N+1


Q84. Thread take less time than process context: Why? 

ANS: Address space is same.


Q85. Execution divided in different stages then this is called ------.

ANS: Pipelining


Q86. In C the macros are ---.

ANS: converted in to inline code during preprocessing 


Q87. The code set is {00000, 00111, 11100, 11011}. What is the error detecting and correcting capability?

ANS: 2,1


Q88. IEEE 802.5 is ---.

ANS: TOKEN RING


Q89.  If AaBbCc is passed to the char

char x(*a)
{
a[0]?x(a+1):1;
printf(%c,a[0]);
return 1;

what will be the output?


Q90. Which is not suitable to find out IP address?

ANS: ARP


Q91. Convert 41.6875 into binary.


Q92. In 32 bit representation, the range of numbers in 2s complement form.

ANS: 2 to the power of 31 to 2 to the power of 31 minus 1


Q93. Socket is implemented in TCP Layer. Which of the following is related to TCP layer?

ANS: Port number


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

ANS: 64k*16 ROM


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

ANS: 256


Q96. CSMA/CD protocol is used in ---.

ANS: Ethernet 


Q97. Which protocol you used when you want to know the IP address corresponding to a MAC Address?

ANS: RARP 


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

ANS: Inorder traversal.


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

ANS: TTL 


Q100. What does the code will be said, when it is called by another part and it is not completed yet?
 
ANS: Reentrant Code. 


  
   






FreshersLive - No.1 Job site in India. Here you can find latest 2016 government as well as private job recruitment notifications for different posts vacancies in India. Get top company jobs for both fresher and experienced. Job Seekers can get useful interview tips, resume services & interview Question and answer. Practice online test free which is helpful for interview preparation. Register with us to get latest employment news/rojgar samachar notifications. Also get latest free govt and other sarkari naukri job alerts daily through E-mail.

closepop
closepop