C/C++
  1. Grade ur knowledge in c and c++ from 0 to 100
  2. What is virtuval distrcuctor.
  3. Are there any default concstructors in c++? what are they?
  4. What is the difference between copy constructor and Overkloading =. Why language is provided two of these?
  5. What are inline functions, what is the difference between #define and inline
  6. What is the difference between inline and normal function. will the compiler take inline functions always inline ,if not on which basis it will decide to ignore inline.
  7. Prog which illustrates difference between extern and static
  8. Virtual and Friend Function in C++
  9. The sequence in which constructors of classes A, B and C are called when class A is inherited from class B which is inherited from class C.
  10. Steps in the compilation of a C program. or steps in preprocessing in sequence.
  11. Differences between a reference and a pointer in C++.
  12. Differences between typedef and #define
  13. If we have a union with three variables int i, char c, float f; and we store a value in say the variable c now. and we forget what is the variable of the union that holds a value currently,
    after some time. for this is there any mechanism provided by the language using which we can find out whether it is i or c or f that currently holds a value.
  14. padding bytes for structures: suppose there is structure struct x{int x, char c}; and the compiler is a four byte compiler. then what is memory allocated to variable of this struct type. if the structure definition is struct y{char x; int y;}; then what is the memory allocated for a variableof this type.
  15. Prototype definition of the printf() function.
  16. How do you dynamically allocate a two dimensional array of size a by b.
    ans: int **x;
    x = (int**)malloc(sizeof(int*)*a);
    for(int i=0;i
  17. Then what if it is assigned as: int *y = (int*)x;
  18. Questions on declarations of function pointers in C.
  19. Differences between Java and C++.
  20. Inorder, preorder, and post order traversals.
  21. how do you find out if a loop(cycle) exists in a linked list,efficiently
  22. name the oo concepts.
OS/Compiler/AI/Networking
  1. What is the light weight process ?
  2. Why thread is lightweight?
  3. What is the best Scheduling algo that will give best throughput?
  4. Semaphores and mutexes.
  5. What is that we can't do with boolean variables that can be done with semaphores?
  6. Question about UNIX file system.
  7. Inode number 0 corresponds to what?
  8. Name few compiler optimizations (little more about compiler optimizations)
  9. What is LALR parser.
  10. What is hill climbing?
  11. What is simulated annealing?
  12. What is piggybacking?
  13. Tell some differences between congestion control and flow control?
  14. Theory of computations
    1) about various complexity classes;
    2). NP-hard and NP-copmleteness,
    examples;
    3). what is universal Turing machine?
Aptitude
  1. There are 100 gates with doors ( 1.... 100).Intially they are open. Switching the gates ( if open then close , if closed then open ) can be done. First they will switch the multiples of 1's then they will switch the multiple's of 2's and soooo on multiple's of 100's. Now, at the end how many doors are closed and what are they?
  2. 10 58 ____ Ans: 3^n+7^n --> 3^3+7^3
    Ans: ( 1,4,9,16,25,36,49,64,81,100)