Differentiate between iterable and iterator.


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Data Structures Interview Questions

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 double hashing 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

5 Answers   KPIT,


Explain Linked List

0 Answers   Tech Mahindra,


What are the different types of linked list?

0 Answers  


Differentiate between compilers and interpreters.

0 Answers   Tech Mahindra,


What is the order of b tree?

0 Answers  






What is the height of an empty tree?

0 Answers  


Why do we need to recycle?

0 Answers  


What is dynamic array how is it created?

0 Answers  


List the data structures which are used in rdbms.

0 Answers  


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 ?

4 Answers  


How do you do a mergesort?

0 Answers  


where do you use double linked list?

0 Answers  


Categories