| Other Data Structures Interview Questions |
|| Asked @
|Stack can be described as a pointer. Explain.
|wt is a datastructure
|Write the programs for Linked List (Insertion and Deletion)
|No. of possible ordered trees with n nodes ? Please give
formula (if any).
|What does abstract data type means?
|why do tree always takes o(log n) time?
|Tell me real world example of polymorphism and encapsulation .
|How many different binary trees and binary search trees can
be made from three nodes that contain the key values 1, 2 & 3?
|Evaluate the following prefix expression " ++ 26 + - 1324"
|1) Program A and B are analyzed and found to have worst-
case running times no greater than 150nlog2n and n2
respectively.Answer the folloWing questions if possible..
i) which program has the better guarantee on the running
time,for larger values of n(n>10000) ?
ii) which program has the better guarantee on the running
time,for small values of n(n<100) ?
iii) which program will run faster on average for n =1000
2) wRite a program to compute the number of collisions
required in a long random sequence of
insertions using linear probing ,quadratic probing and
3) what is the optimal way to compute A1 A2 A3 A4 A5 A6
where the dimensions of the matrices are
A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30
A6 : 30 X 15
|How can one find a cycle in the linked list? IF found how
to recognize the cycle and delete that cycle?
|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 ?
|For more Data Structures Interview Questions Click Here |