C++ technical questions

Discussion in 'Latest Placement papers' started by Guest, Jul 22, 2006.

  1. Guest

    Guest Guest

    1.What is a class?
    2.What is an object?
    3.What is the difference between an object and a
    4.What is the difference between a class and a
    5.What is public, private, protected?
    6.What are virtual functions?
    7.What is friend function?
    8.What is a scope resolution operator?
    9.What do you mean by inheritance?
    10.What is abstraction?
    11.What is polymorphism? Explain with an example?
    12.What is encapsulation?
    13.What do you mean by binding of data and functions?
    14.What is function overloading and operator
    15.What is virtual class and friend class?
    16.What do you mean by inline function?
    17.What do you mean by public, private, protected and
    18.When is an object created and what is its lifetime?
    19.What do you mean by multiple inheritance and
    multilevel inheritance? Differentiate between them?
    20.Difference between realloc() and free?
    21.What is a template?
    22.What are the main differences between procedure
    oriented languages and object oriented languages?
    23.What is RTTI?
    24.What are generic functions and generic classes?
    25.What is namespace?
    26.What is the difference between pass by reference
    and pass by value?
    27.Why do we use virtual functions?
    28.What do you mean by pure virtual functions?
    29.What are virtual classes?
    30.Does C++ support multilevel and multiple
    31.What are the advantages of inheritance?
    32.When ia memory allocated to a class?
    33.What is the difference between declaration and
    34.What are virtual constructors/destructors?
    35.In C++ there is only virtual destructor, no
    constructors. Why?
    36.What is late bound function call and early bound
    function call? Differentiate?
    37.How is exception handling carried out in C++?
    38.When will a constructor executed?
    39.What is dynamic polymorphism?
    40.Write a macro for swapping integers?

    DATASTRUCTURE Questions:-
    1.What is a datastructure?
    2.What does abstract data type means?
    3.Evaluate the following prefix expression “ ++ 26 + -
    1324 ” (Similar types can be asked)
    4.Convert the following infix expression to post fix
    notation ((a+2)*(b+4))-1 (Similar types can be asked)
    5.How is it possible to insert different type of
    elements in stack?
    6.Stack can be described as a pointer. Explain?
    7.Write a binary search program?
    8.Write programs for Bubble sort, Quick sort?
    9.Explain about the types of linked lists?
    10.How would you sort a linked list?
    11.Write the programs for linked list (insertion and
    deletion) operations?
    12.What data structure would you most likely see in a
    non-recursive implementation of a recursive algorithm?
    13.What do you mean by Base case, Recursive case,
    Binding time, Run-time stack and Tail recursion?
    14.Explain quick sort and merge sort algorithms and
    derive the time-constraint relation for these?
    15.Explain binary searching, Fibonacci search?
    16.What is the maximum total number of nodes in a tree
    that has N levels? Note that the root is level (zero)
    17.How many different binary trees and binary search
    trees can be made from three nodes that contain the
    key values 1, 2 and 3?
    18.A list is ordered from smaller to largest when a
    sort is called. Which sort would take the longest time
    to execute?
    19.A list is ordered from smaller to largest when a
    sort is called. Which sort would take the shortest
    time to execute?
    20.When will you sort an array of pointers to list
    elements, rather than sorting the elements themselves?
    21.The element being searched for is not an array of
    100 elements. What is the average number of
    comparisons needed in a sequential search to determine
    that the element is not there? If the elements are
    completely unordered?
    22.What is the average number of comparisons needed in
    sequential search to determine the position of an
    element in an array of 100 elements? If the elements
    are ordered from largest to smallest?
    23.Which sort show the best average behavior?
    24.What is the average number of comparisons in a
    sequential search?
    25.Which data structure is needed to convert infix
    notations to post fix notations?
    26.What do you mean by Syntax Error? How can you
    correct it?
    27.What do you mean by Logical Error? How can you
    correct it?
    28.What do you mean by Runtime Error? How can you
    correct it?
    29.In which data structure, elements can be added or
    removed at either end, but not in the middle?
    30.How will inorder, preorder and postorder traversals
    print the elements of a tree?
    31.Parenthesis are never needed in prefix or postfix
    expressions. Why?
    32.Which one is faster? A binary search of an ordered
    set of elements in an array or a sequential search of
    the elements?
  2. Guest

    Guest Guest

Share This Page