| Other Data Structures Interview Questions |
|| Asked @
|input function and output function in c language
|how to search an element in sorted linked list with time
complexity is O(log n).
|A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
|What is the average number of comparisons needed in a
sequential search to determine the position of an element in
an array of 100 elements, if the elements are ordered from
largest to smallest?
|Q#1: An algorithm is made up of 2 modules M1 and M2.If
order of M1 is F(n) and order of M2 is g (n) then what is
the order of the algorithm.
Q # 2 : How many binary trees are possible with 3 nodes?
with 4 nodes?
|What data structure would you mostly likely see in a non
recursive implementation of a recursive algorithm?
|example of linear and non-linear data structures?
|Explain binary searching, Fibinocci search.
|What do you mean by: Syntax Error, Logical Error, Runtime Error?
|what is the different between B-tree and B+ tree.
|Explain about the types of linked lists
|create an singly linked lists and reverse the lists by
interchanging the links and not the data?
|For more Data Structures Interview Questions Click Here |