1) What do you understand by abstract data type (ADT)?
2) What are the postfix and prefix forms of the following expression:
A + B* (C–D) / (P–R)
3) What do you man by a Binary tree?
4) What do you understand by expression tree.
5) Write down the applications of hash table.
6) What do you understand by an equivalence relation?
7) Define indegree and out degree of a graph.
8) What is a minimum spanning tree?
9) Compare backtracking and branch-and-bound.
10) Write down the different decision problems which are NP-Complete.
11)(i) Write the insertion and deletion procedures for cursor based linked lists.
(ii) Write down the algorithm for the deletion and reverse operations on doubly linked list.
12)(i) Write the algorithm for Push and Pop operations on Stack using Linked List.
(ii) Describe the addition and deletion operations performed on a circular queue with essential algorithms.
13) Write down an algorithm for pre-order and post-order traversals of a binary tree.