1) What do you mean by ADT?
2) Write down the difference between linked lists and arrays. Write down their relative advantages and disadvantages.
3) What do you mean by depth and height of a tree?
4) Write down the application of trees.
5) What are the significant factors to be considered in designing the hash function?
6) What do you mean by a disjoint set? Explain the ADT for a disjoint set.
7) What do you mean by an Euler circuit?
8) What are the methods of representing a graph? Give examples.
9) Explain NP-complete problems in detail with suitable example.
10) What do you mean by a backtracking?