Unit Test II Question Bank
Subject Title: DSU Subject Code: 313301
Course Code: CO3K
Linked List
1. With neat diagram describe any two terms from the following: Node, Null Pointer,
Empty list with respect to singly linked list
2. List any four applications of linked list.
3. State the syntax of declaration of doubly linked list.
4. Write an algorithm to insert an element at the beginning of singly linked list.
5. Write a C program to implement singly linked list with operation: i) insert at end
ii) Display the list
6. Differentiate between singly linked list and doubly linked list (minimum six points)
7. Describe circular linked list with suitable diagram. Also state the advantages of circular
linked list over linear linked list.
8. Construct a singly linked list using data field : 22, 27, 86, 48, 75 and show procedure
step-by-step with the help of diagram start to end.
9. Draw structure to following: i) Singly linked list ii) Doubly linked list iii) Circular
singly linked list iv) Circular doubly linked list.
Stack
1. State the LIFO Principle of stack
2. List any four applications of stack data structure
3. Describe stack over flow and stack underflow condition with the help of example.
4. Differentiate between stack and queue. (Min. two points each)
5. Show the effect of PUSH and POP operation on to the stack of size 10. The stack
contains 10, 20, 30, 40, 50 and 60 with 60 being at top of the stack. Show
diagrammatically the effect of – i) PUSH 55 ii) PUSH 70 iii) POP iv) POP
Sketch the final structure of stack after performing the above said operations.
6. Write down step-by-step conversion of the following infix expression to postfix
expression using stack ( (A + B) * C ) ∧ (D – E)
7. Convert following expression into post fix form. Give stepwise procedure.
A * (B + C) / D – G
8. Convert following infix expression into prefix using stack in tabular form : (A + B) *
C^D – (E/F).
9. Evaluate the following post fix expression with suitable diagram using stack
10, 2, * 15, 3, /, +, 12, 3, +, +
Queue
1. List types of Queue data structure.
2. Show the effect of insert and delete operations on to the linear queue of size 10. The
linear queue sequentially contain 11, 22, 33, 44 and 55 where 11 is at front of
queue.Show diagrammatically the effect of i) INSERT (60) ii) INSERT (70) iii) Delete
iv) INSERT (80)
3. Explain types of queue and implement a program for circular queue.
4. Write ‘C’ program to insert into and delete the element into from linear queue.
5. Write ‘C’ program to implement a linear queue with insert and delete operation.
Tree
1. Define the term general tree and binary tree.
2. Define the term binary tree and binary search tree.
3. Describe following terms with respect to tree data structure
i) Leaf node of a tree
ii) Sibling
iii) Degree of a tree
iv) Depth of a tree
4. State the following terms: i) Leaf node of a tree ii) Degree of a tree
5. Write an algorithm for in order and post order traversal of binary tree.
6. Construct a binary search tree for the given numbers : 50, 33, 44, 22, 77, 35, 60, 40
Present each step of construction of BST diagrammatically.
7. Construct a binary search tree for following elements: 10, 3, 15, 22, 6, 45, 65, 23,
78, 34, 5 show each step of construction of BSP.
8. Draw the expression tree of the following expressions
i) (2a + 5b)3 * (x – 7y)4 ii) (a – 3b) * (2x – y)3
9. Draw tree structure for the following expression. (3A + 7B) – [(6D – 4E) ^ 6C]
10. For given binary tree write in-order, pre-order and post-order traversal.
