Oral Question Bank

SR. NO	QUESTIONS
1.	What is a class? How does it accomplish data hiding?
2.	How a member function of a class defined?
3.	What is the difference between private and Protected Members?
4.	Can we use the same function name for a member function of a class and an outside function in the same program file? If yes, how are they distinguished? If no, give reason
5.	What are objects? How objects are created?
6.	Define a function. Explain each category with a suitable example. What do you mean by time complexity and Space complexity?
7.	What do you mean by asymptotic notations?
8.	What is big Oh notation?
9.	What are worst case, best case and average case time complexity?
10.	What are advantages of adjacency list over adjacency matrix?
11.	What is meant by Sparse Matrix
12.	What do you mean by saddle point
13.	What is difference between array and linked list?
14.	What are the advantages and disadvantages of linked list?
15.	Explain different types of linked list?
16.	Differentiate between single linked list and doubly linked list?
17.	Explain the advantages of circular Doubly Linked List
18.	Explain the number of pointers exchanged during insertion and deletion in single Linked List
19.	Explain the number of pointers exchanged during insertion and deletion in Double Circular Linked List
20.	Explain use of stack in recursion.
21.	What do you mean by stack overflow?
22.	What is Polish Notation?
23.	What is sorting? Explain the concept of passes, efficiency of sorting, sort order, types of sorting?
24.	Examine the passes of sorting in case of bubble sort? What are its Average, best and worst case complexities?
25.	Out of all sorting method which sorting method is best? How you select the best sorting methods?
26.	Explain Queue as an ADT
27.	What are the different applications of Queue
28.	What is Deque
29.	What is meant by Queue full condition in Linear Queue
30.	Advantages of Circular queue over Linear Queue
31.	What is the time complexity of linear search, Binary search, quick sort, merge sort, bubble sort, selection sort, heap sort, radix sort etc?