Datastructure interview questions
Question - 1) What Is Data Structure ?
Question - 2) What Is The Need For Data Structures In Programming ?
Question - 3) What Are The Different Data Types Which A Data Structure May Comprise Of ?
Question - 4) How Can Data Structures Be Classified ?
Question - 5) What Are Linear Data Structures ?
Question - 6) What Are Non Linear Data Structures ?
Question - 7) Differentiate Between Data Types & Data Structures ?
Question - 8) List Four Major Operations On Linear Data Structures ?
Question - 9) What Do You Mean By A Static Data Structure ?
Question - 10) What Is Dynamic Memory Allocation ?
Question - 11) What Is A Stack ?
Question - 12) What Is A Queue ?
Question - 13) What Are Linked Lists ?
Question - 14) What Are Trees ?
Question - 15) What Are Arrays ?
Question - 16) What Is A Circular Queue ?
Question - 17) What Do You Mean By The Terms ‘Overflow’ & ‘Underflow’ In Data Structures ?
Question - 18) What Is Meant By Dequeue ?
Question - 19) What Do You Mean By Garbage Collection In Data Structures ? What Role Does The AVAIL List Play In A Linked List ?
Question - 20) Differentiate Between A LIFO & FIFO List ?
Question - 21) What advantages and disadvantages, do you think does a circular singly linked list have over a non-circular singly linked list?
Question - 22) Give the similarities between queues and stacks ?
Question - 23) Differentiate between queues and stacks ?
Question - 24) To perform recursion, which data structure is generally used?
Question - 25) What do you mean by merging of data structures?
Question - 26) What are the different types of arrays ?
Question - 27) What do you mean by the base address of an array ?
Question - 28) Give the formula to calculate the address of any element in an array, when the length of the array along with its base address and size of the element are given ?
Question - 29) How is computer memory allotted for a two-dimensional array ?
Question - 30) What is the difference between an array and a stack housed in an array ?
Question - 31) List the basic operations which can be performed on data structures ?
Question - 32) How can you calculate the size of an array, given the upper and lower bounds of the array ?
Question - 33) Which are the two very common search techniques and what are their mechanisms ?
Question - 34) Describe how linear search is carried out ?
Question - 35) How does the binary search work ?
Question - 36) What are the differences between linear search and binary search ?
Question - 37) State the condition(s) under which binary search is applicable ?
Question - 38) What are the advantages of linked lists over arrays ?
Question - 39) What is sorting of an array ? Name a few types of sorting techniques ?
Question - 40) What is the mechanism of selection sort ?
Question - 41) What do you mean by bubble sort ?
Question - 42) What is insertion sort ?
Question - 43) Differentiate between the different types of linked lists ?
Question - 44) What do you mean by ‘pushing’ and ‘popping’ with regard to stacks ?
Question - 45) What are input restricted dequeues and output restricted dequeues ?
Question - 46) What do you mean by Polish string ?
Question - 47) What do you mean by an infix, postfix and prefix expression ?
Question - 48) What is the evaluation order according to which an infix expression is converted to postfix expression ?
Question - 49) Give the advantages of using post fix notations over infix notations ?
Question - 50) How can prefix notations be converted to infix form ?