1) What do you mean by ADT?
2) prepare down the difference between linked lists and arrays. prepare down their relative advantages and disadvantages.
3) What do you mean by depth and height of a tree?
4) prepare 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? describe 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 exs.
9) describe NP-complete problems in detail with suitable ex.
10) What do you mean by a backtracking?