| Other Data Structures Interview Questions |
|| Asked @
|applications of linked lists and mostly used linked list?
|create an singly linked lists and reverse the lists by
interchanging the links and not the data?
|What is B+ tree?
|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?
|Which data structure is needed to convert infix notations to
post fix notations?
|What do you mean by Base case, Recursive case, Binding Time,
Run-Time Stack and Tail Recursion?
|Write a Binary Search program
|Q # 1 : in which graph algorithm do we start finding
vertices that should be first in the topological order and
then apploy the fact that every vertex must come before its
successors in the topolgical order.
|Let the G be a graph with 100 vertices numbered 1 to 100
Two vertices i and j are adjecnt if | i-j| =8 or | i-j|
=12. The Number of connected components in G is ?
|The element being searched for is not found in 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?
|ple.. briefly describe the purpose of having a base case and
a recursive case in a recursive algorithm
|A list is ordered from smaller to largest when a sort is
called. Which sort would take the longest time to execute?
|For more Data Structures Interview Questions Click Here |