Home Company Questions Yahoo Interview Questions Yahoo Interview Questions - 5

Interview Dates

« < September 2010 > »
S M T W T F S
29 30 31 1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 1 2
Subscribe to cyberqbank.com

Powered by
in.groups.yahoo.com

Login Form




Yahoo Interview Questions - 5 Print E-mail

 

1. How does yahoo handles billions of requests, does it create a thread per request or a process?

 

2. How to call a C++ function which is compiled with C++ compiler in C code?

 

3. Consider a heap containing numbers 10, 20, 30, 40, 80, 60,

 

4. 70 such that numbers are in ascending order from the leaf to the root. If 25 is to be inserted what is the position.(A[1], A[2], A[3], A[4])

 

5. What are the various modes used to send data over the network

 

6. A is a 3*4 matrix and B is 4*5 matrix. What is the number of additions and multiplications performed to obtain the resultant matrix.

 

7. how to delete the node in the linked list. give the pointer to that node?

 

8. There are $1070 dollars how to split them into bags such that asked for any denomination from $1 to $1070 , u must b able to give without
opening bag.

 

9. Write a query to display the name of the students whose total marks is divisible by 25 (total marks may be 175,200,150 ?.)

 

10. If you are given the name of the function at run time how will you invoke the function?

 

11. given two integers a, b how to divde a/b without using /,% operator

 

12. Krishna tosses a one-rupee coin and a rupee coin. He announces that one is head. But the result is not announced. What is the probability that the other coin is head?

 

13. P(S1)

   a++;

  P(S2)

   v++;

  V(S2)

  V(S1)

P-wait, V-signal, S1 and S2 are semaphores. Consider two threads running. Is there a deadlock . If yes in which situation does the deadlock occur.

 

14. how to count the no of bits set in an no

 

15. In database sort the student id and the course id for each student. Which is the best possible solution.

a. Sort the student id using a stable algorithm and then sort the course id using unstable algorithm

b. Sort the student id using a unstable algorithm and then sort the course id using stable algorithm

c. Sort the course id using a stable algorithm and then sort the student id using unstable algorithm

d. Sort the course id using a unstable algorithm and then sort the student id using unstable algorithm

 

  No Comments.
Quick Post


Discuss this item on the forums. (0 posts)