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

YAHOO Placement paper 2012

Posted on :02-02-2016

No. of questions : 25 Maximum Time allowed : 60 minutes

Q1. Teacher asked the students to find the cube root of a natural number but she did not mention the base. Students assumed the base found the cube root. Each student got an integer. Find the sum of digits of that number. 

A. 0 
B. 1 
C. 6 
D. 7 
E. 8
 

Q2. What is the difference of last two digits of N where N=7^2010 

A. 1 
B. 3 
C. 5 
D. 7 
E. 9


Q3. Find the first non Zero digit in 67!(Factorial)

A. 3 
B. 4 
C. 5 
D. 6 
E. 7


Q4. Suppose here are n processes in the system and each one needs k instances of a resources to complete. What would be the minimum number of resources that you should keep in the system to ensure no deadlock in the system? 

A. n*k 
B. n*k-n+1 
C. n*k+1 
D. n*k*k 
E. None of the above


Q5. If we have a ring counter of 4 bits, with an initial state of 1000, what is the modulus of the counter? 

A. 16 
B. 8 
C. 32 
D. 4 
E. Node of the above


Q6. Which of the following masks can be used to zero out alternate bits of a 16 bit number? 

A. 0101 
B. AAAA 
C. FFFF 
D. EEEE 
E. BBBB


Q7. We define a function below. What is the value returned by this function: express your answer as a function of n? 

unsigned int func(unsigned int n) { unsigned int r=0; unsigned int i,j,k; for(i=1;i<=n;i++) for(j=1;j<=i;j++) for(k=j;k<=i+j;k++) r++; return r; }

A. func(n)=summation of i*(i+1) with i varing from 1to n 
B. func(n)=n*n+1 + n*n-1 
C. func(n)=func(n-1)+n*n+n with func(n)=0 
D. func(n)=func(n-1)+n*n+2 with func(n)=0 
E. both a and c.


Q8. Which of the following statements about the datagram sent by a node in a network using IPv4 protocol is (are) true?

i. Datagrams at the source must be the size of the smallest maximum transmission unit (MTU) of all the links on a path to the destination 
ii. Datagrams may be fragmented during routing 
iii. Datagrams are re-assembled at the destinations

A. I only 
B. II only 
C. III only 
D. I and III 
E. II and III


Q9. In a pipeline RISC computer all arithmetic instructions have the same CPI(Cycles per instructions), which of the following actions would improve the execution time of a typical; program?

i. Instructions the clock cycle rate 
ii. Disallowing any forwarding in the pipeline 
iii. Doubling the sizes of the instruction a cache and the data cache without changing the clock cycle time

A. I only 
B.II only 
C.III only 
D. I and II 
E. I and III


Q10. Let n(1), n(2), n(3).... n(t) be positive integers. What is the minimum number N of objects to ensure that if N objects are placed into t boxes, for some I in [1,t], box I contains at least n(i) objects?

A. n(1)+ n(2)+ n(3)+....+ n(t) 
B. n(1)+ n(2)+ n(3)+....+ n(t)+t-1 
C. n(1)+ n(2)+ n(3)+....+ n(t)-t 
D. n(1)+ n(2)+ n(3)+....+ n(t)-t-1 
E. n(1)+ n(2)+ n(3)+....+ n(t)-t+1


Q11. 
#define scanf %s is a string Main(){ Printf(scanf,scanf); } 

What is the output? 

A. compiler error 
B. scanf is a string 
C. %s is a string is a string 
D. %s is a string


Q12. 
#define boo(x) x/4
main(){ int i; i=64/boo(4); Printf(%d,i); } 

A. Compiler time error 
B. 16 
C. 64
D. 4 
E. Divide by Zero Error


Q13. What the following C function will do? 

unsigned int bitwise(unsigned int x) { unsigned int r=x &-x; unsigned int l x+=r if(0==l) return 0; l=x &-x; l-=r; while(0==(l&l) { l>>=1; } return x|(l>>1); } 

A. Return the greatest integer smaller then x 
B. Returns x/2 
C. Returns the smallest integer greater than x with the some number of bits set 
D. Returns the smallest integer greater than x with less number of bits set 
E. None of the above


Q14. 
int i Void increment(int i) { i++; } Int main() { For(i=0;i<10; increment(i)) { } Printf(i=%d,i); Return 0; }

Predict the output of the above C code.

A. i=10 
B. i=9 
C. i=11 
D. Compiler Error 
E. None of the above


Q15. Consider the following C program 

main() { int i=0; i++; fork(); Printf(d,i); i++; fork();
Printf(d,i); }

What is the maximum value of i that will be printed? 

A. 0 
B. 7 
C. 5 
D. 2 
E. 10


Q16. What will be printed by the code below? 

#include using namespace std; Template void swap( T *a, T *b){ temp =*a; *a=*b *b=temp; } int main(){ char hello[]=hello; char world[]=world; swap((char *)&hello, (char *)&world); cout< 

A. hh 
B. ww 
C. hw 
D. wh


Q17. Consider a Binary Tee represented as a 1-indexed array (where the children of an element L are at indexes 2L and 2*L+1, elements at index is the root), with elements 1,2,3,4,5,6,7 in that order. If the post order traversal of the array gives ab-cd*+, the the label on the nodes 1,2,3,4,5,6,7 can be

A. +,-,*,a,b,c,d 
B. a,-,b,+,c,*,d 
C. a,b,c,d,-,*,+ 
D. -, a,b,+,*,c,d 
E. none of the above


Q18. A hypercube is defined as follows: A hypercube of dimension 0 has only a vertex. To construct a hypercube of N dimensions, take two N-1 dimensional hypercubes, and attach edges between corresponding nodes of each of these hypercubes. How many colors will you need to color the EDGES of an N dimentional hypercube such that no two edges of the same color share a common vertex?

A. 2 
B. 2^N 
C. N 
D. N^2 
E. Node of the above


Q19. Find the complexity function F(n)=2F(n/2)+10n, if n>1 F(n)=1, if n=1 

A. n^2 
B. n(logn)^2 
C. n
D. nlogn 
E. None of the above


Q20. In each step of insertion sort algorithm, a new element has to be inserted into an already sorted sub array. Instead of using sequential search to determine the location of new element which takes O(n) time( Which makes the overall complexity O(n^2) sorted, which will take O(log n) time. By using this sort from O(n^2) to

A. O(nlogn) 
B. O(n) 
C. O(logn) 


Q21. Consider the following procedure:

f(n) for i=1 to n dp j=n while j>i do j=j-1 end while end

procedure are T only an R integer n>0; ), IN technique, We What can use is we the binary D. can IT time O(n^2) reduce search complexity the since I complexity in the n for sub E. the O(1) array of insertion is

A. O(nlogn) 
B. O(n) 
C. O(n^2) 
D. O(N^3) 
E. O(1)


Q22. The worst case time complexity of finding 5th smallest number in a list of 50000 randomly chosen numbers.

A. O (1) 
B. O(n) 
C. O(log n) 
D. O(n^2) 
E. O(n log n)


Q23. Consider the problem of sorting (in ascending order) of an array of numbers, each number being the range (50,000 - 5000, 000). What sorting algorithm is the best choice for the above problem?

A. Merge sort 
B. Insertion Sort 
C. Quick Sort 
D. Counting sort 
E. Bubble Sort


  
   






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