ASSIGNMENT-1
DATA STRUCTURE PROGRAMMING
Tutorial-1
1. Define abstract data type and explain it’s significant?
2. Explain the classification of data structures and explain
with suitable examples?
3. Discuss the advantage of using dynamic arrays over static
arrays ?
4. Write a short note on a) Time complexity , b) Space
complexity ?
5. Explain asymptotic notation and their important ?
Tutorial-2
1. Compare and contact static and dynamic memory
allocation ?
2. WAP in c to demonstrate the use of Molloc ,Calloc ,Realloc
and free function ?
3. Which of the following is not a non-linear data structure?
A) Tree B) Graph C)stack D)Heap
4. Time complexity describe the relationship b/w execution
time and ___________.
5. Which of the following notation represents the lower
bound of an algomithm?
A) Ω B)ϕ C)0 D)none of these
Tutorial-3
1. Explain the Tower of Hanoi?
2. Explain Recursion as application of stack with example?
3. Convert Infix to Post fix ?
A-(B/C+(D%E*F)/G)*H
4. Write the short note on priority queue?
5. Give any implementation of circular queue ?
Tutorial-4
1. Discuss application of queue?
2. Write a program to Insert a node at a specific position in a
doubly linked list?
3. Discuss application of linked list?
4. Give algorithim for linked list implementation of double
ended queue?
5. Differentiate double ended queue (dequeue)and queue
Tutorial-5
1. Explain the concept of a tree. Draw a binary tree for the
following algebraic expressions ?
[a+(b-c)]*[(d-e)/(f+g-h)]
2. Construct a binary tree with following traversa ?
In order :B F G H P R S T W Y Z
Pre-order : P F B H G S R Y T W Z
3. Explain Pre-order tree traversal produce using stack.
Consider a binary tree given below and simulate the Pre-
order along with this binary tree.
4. Explain in-order tree traversal produce using stack in-
order? For given binary tree.
5.Consider following tree , find post-order, Pre-order ,in-order
traversal
Tutorial-6
1. Construct a binary tree with the following traversals:
Post-order : H I O E B F G C A
In-order: H O I B E A F C G
2. Write an algorithm to search an element in a BST. Just why
binary search tree is search efficient .
3. Explain the threaded binary tree with an example .
4. Define BST. Show the result of inserting keys :
6,3,5,8,12,15,18,19,20,24 into an empty BST.
5. WTP in c function:(a) Insertion in BST,
(b)Deletion from BST.
