[+] Post Title :
[+] Date : Tuesday 29 October 2013
[+] Author : Prudhvi raj
[+] Type : assignments
Data Strucutres Sample viva Questions
[+] Date : Tuesday 29 October 2013
[+] Author : Prudhvi raj
[+] Type : assignments
1. what is an ADT? what is its use?
2. Where are stacks used ?
3. give some applications of queues.
4. some applications of graphs.
5. when would you choose the linked representation?
6. when would you choose the array representation?
7. What is the difference between a tree and a graph?
8. You will be given a tree. write the inorder,preorder and postorder traversals.
9. You will be given a graph. draw the DFS and BFS traversals.
10. which data structure is used by the BFS traversal? which one is used by DFS?
11. You have been give an almost sorted input values. which one of the sorting algorithms will you
choose and which one you will avoid?
12. In a binary search tree with 'n' nodes , what is the worst case time complexity for search?when
does it occur?
13. what is the justification for height balanced search trees such as AVL trees? what is the use of
balancing a tree?
14. convert a given infix expression into a postfix notation.using a stack or otherwise.
15. evaluate a given post fix expression. using a stack and otherwise.
16. For example, you got the quick sort program. for a given sample data values, show how the
program works stepwise,i.e.,trace the program.
17. if there are 'n' number s in a full binary tree, what is the height of the tree?
18. You will be given a set of values and asked to create a binary search tree. also an avl tree.
19. what is a statble sorting algorithm?
20. what is internal sorting?
21. what is external sorting?
22. what is a threaded binary tree?
23. what is an expression tree?
24. what is a priority queue?
25. what is a dequeue?
26. sometimes we use a header node in circular lists. what is its use?
27. what is the Max heap property?
28. what is a complete binary tree?
29. when is B-tree used?
30. what are the properties of red black trees?
31. what is a collision?
32. what is overflow?
33. Name some collision resolution techniques.
34. what is the expected time complexity of search in Hashing?
35. what is asymptotic time complexity? explain the three notations.Big-Oh, theta and omega.
YOU MUST KNOW EXACTLY HOW EACH PROGRAM WORKS. YOU MUST BE ABLE TO EXPLAIN THE
CODE YOU HAVE WRITTEN.
2. Where are stacks used ?
3. give some applications of queues.
4. some applications of graphs.
5. when would you choose the linked representation?
6. when would you choose the array representation?
7. What is the difference between a tree and a graph?
8. You will be given a tree. write the inorder,preorder and postorder traversals.
9. You will be given a graph. draw the DFS and BFS traversals.
10. which data structure is used by the BFS traversal? which one is used by DFS?
11. You have been give an almost sorted input values. which one of the sorting algorithms will you
choose and which one you will avoid?
12. In a binary search tree with 'n' nodes , what is the worst case time complexity for search?when
does it occur?
13. what is the justification for height balanced search trees such as AVL trees? what is the use of
balancing a tree?
14. convert a given infix expression into a postfix notation.using a stack or otherwise.
15. evaluate a given post fix expression. using a stack and otherwise.
16. For example, you got the quick sort program. for a given sample data values, show how the
program works stepwise,i.e.,trace the program.
17. if there are 'n' number s in a full binary tree, what is the height of the tree?
18. You will be given a set of values and asked to create a binary search tree. also an avl tree.
19. what is a statble sorting algorithm?
20. what is internal sorting?
21. what is external sorting?
22. what is a threaded binary tree?
23. what is an expression tree?
24. what is a priority queue?
25. what is a dequeue?
26. sometimes we use a header node in circular lists. what is its use?
27. what is the Max heap property?
28. what is a complete binary tree?
29. when is B-tree used?
30. what are the properties of red black trees?
31. what is a collision?
32. what is overflow?
33. Name some collision resolution techniques.
34. what is the expected time complexity of search in Hashing?
35. what is asymptotic time complexity? explain the three notations.Big-Oh, theta and omega.
YOU MUST KNOW EXACTLY HOW EACH PROGRAM WORKS. YOU MUST BE ABLE TO EXPLAIN THE
CODE YOU HAVE WRITTEN.
