2022

Full Marks - 50
Time - As in the Programme
The figure in the right hand margin indicate marks
Answer All question.

1. Write the answer of the following questions

a) How to define the structure of double linked list to store the data?
b) How a binary tree is called Threaded binary tree?
c) What is Compaction?
d) How to calculate degree of a node? Explain it with example.
e) What is the postfix operaiton of (A*B+C) - (D/E)?

2. Answer any FIVE of the following questions.

i) Explain different types of data structure with examples.
ii)a) Write a program to add two different 3-dimensional matrixes.
b) Define Pointer. Explain its advantages over array?Write an example how a set of
elements are manipulated with pointer.

iii) a) Draw the B-tree of order 5 using following keys. 65, 71, 70, 66, 75,68,72, 77,74, 69,
83, 73, 82, 88, 67, 76, 78, 84, 85, 80.
b) Write an algorithm to store data in a tree.
iv) Write insertion, first-insert, last-insert and deletion algorithm of linked list.
v) a) How arithmetic expressions are evaluated using stack? Explain it with example.
b) Explain linked representation of stack with an example.
vi) Define Queue. How it is represented? Explain inserting and deleting algorithm in a
queue. Discuss various applications of queue.
vii) Write down push & pop algorithms and various applications of stack.
viii) Explain pre-order, in-order and post-order tree traversal with their algorithms and ex-
ample.
***
 2022
Full Marks - 60
Time - As in the Programme
The figure in the right hand margin indicate marks
Answer All question.
1. Answer all the questions :
a) What is binary tree?
b) What is the use of queue data structure?
c) What is the maxium number of nodes in a binary tree of height K?
d) Which data structure suits the most in the tree construction?
e) Which data structure is used in BFS algorithm?
f) What is the use of void data type?
g) What is abstract data type?
h) Define the use of POP operation.
2. Answer any EIGHT of the following questions.
a) What is the drawback of array implementation of data structure?
b) List few applications of tree data structure.
c) What is linked list?
d) What are the advantages of dynamic data structure?
e) What is LIFO? 
f) Which data structure is used for recursive algorithm?
g) What are the advantages of data structure?
h) What is post fix operation?
3. Answer any Eight of the following questions
a) State the property of B Tree.
b) Write the difference between linear and non-linear data structure?
c) Which data structure is used for pre-fix operation and how?
d) Convert the following infix to post fix operation (a+b)  c(c/d) +e.
e) Write the difference between array and stack.
f) What is the use of dequeue?
g) What is AVL Tree? Explain it with an example.
h) Which sorting algorithm is called fastest and why?
4. Answer any Four of the following questions.
i) Explain different types of data structure with examples.
ii) a) Write a program to add two different 3-dimensional matrixes.
b) Define Pointer. Explain its advantages over array? ;Write an example how a set of
elements are manipulated with pointer.
iii) Write insertion, first-insert, last-insert and deletion algorithm of linked list.
(iv) a) How arithmetic expressions are evaluated using stack? Explain it with example
b) Explain linked representation of stack with an example.
(v) Define queue. How it is represented? Explain insertin and deleting algorithm in a
queue. Discuss various applications of queue.
vi) Write down push & pop algortithms and various applications of stack.
vii) Explain pre-order, in-order and post-order tree traversal with their algorithms and
example.

***
 2020
Full Marks - 50
Time - As in the Programme
The figure in the right hand margin indicate marks

Answer any TWO questions

1. (a) What is time and space complexity? How it is calculated? Is it necessary to measure
the above components in the designing of programs? Justify your answer.
b) Explain the features and application of various linear data structure.
OR
c) Define structure. Discuss the syntax of a structure with example. Create a structure
input book No., subject, No. of pages and price for five books and print it.
d) What is DMA? How it is implemened? Is it possible to make memory efficient pro-
gram using pointer. Suggest your views.
2.a) Write an algorithm to delete a node from the last position of single linked list.
b) What is traversing in a linked list? Write an algorithm to print all the values of a linked
list.
OR
c) Write an algorithm to merge two different linked lists.
d) Discuss the structure of double linked list with example.
3.a) Convert the following expression to prefix and postfix form.
a - (b* (c+ d/e-f) + g* h
b) What do you mean by Stack? What are the different types of stack operation? Write a
program to perform each operation on a stack.
OR
c) Define queue. What are the operations performed in a queue? Write various applica-
tions of queue.
d) Define recursion. Discuss various dis-advantaged of recursive function? Write a pro-
gram to calculate factorial of number using recursion.
4.a) Write algorithms for different order of traversal performed in a binary tree.
b) What is the differfence between tree and binary tree? Define different types of binary
trees.
OR
c) Write an algorithm to search a key element in a Binaryh Search Tree.
d) Construct a binary search tree whose preorder traversal is given as follows.
55, 66, 77, 15, 11, 33, 22, 35, 25, 44, 88, 99
5.a) Write an algorithm of binary search operation to search a number from a list.
b) Write a program to sort 10 numbers and print it using quick sort.
OR
c) Explain the concept of storage allocation strategies.
d) Write a program to sort a set of numbers using insertion sort.
 2019
Full Marks - 60
Time - As in the Programme
The figure in the right hand margin indicate marks
Answer All question.

Group - A
1. (Answer all questions, Each carries 1 mark)
i) Define the term NonLinear Data Structure.
ii) Differenciate between double linked list and single linked list.
iii) Differenciate runtime and compile time initialization of an array.
iv) State the syntax of 2D array declaration.
v) What is postfix notation of the expression (c/d)* (a+d)?
vi) Define height of a tree.
vii) State two properties of Height Balanced Tree.
viii) Construct a binary search tree using the following key values.
11, 22, 67, 89, 21, 9, 56
ix) Define the term Dequeue.
x) State two applications of Array.
Group-B
(Answer all questions. Each carries 8 marks)
2.a) What are the different types of data structures? Explain each one in brief.
OR
b) Write a C Programme to display the result of addition of two 3*3 matrix using array
3.a) Write an algorithm to delete node from a double linked list.
OR
b) Write an algorithm to insert a node after a given node of a single linked list.

4.a) What do you mean by Stack. What are the different types of stack operation. Write
a program to perform each operationon a slack.
OR
b) Define Recursion. Write a program to calculate factorial of a number.
5.a) Write an algorithm to delete an element at the end of queue.
OR
b) Write an algorithm to delete an element from the beginning of a queue.
6.a) Explain the concept of physical implemention of binary tree in memory.
OR
b) Construct a balanced binary search tree using the following nodes jan, feb, mar, apr,
may, jun, jul, aug, sep, oct, nov, dec.
 2019
Full Marks - 50
Time - As in the Programme
The figure in the right hand margin indicate marks
Answer All question.
1. Write the answer of the following questions.
a) How to calculate degree of a node? Explain it with example.
b) What is the postix operation of (A*B+C) - (D/E)?
c) How to define the structure of double linked list to store the data?
d) How a binary tree is called threaded binary tree?
e) What is Compaction?
2. Explain different types of data structure with examples.
a) WRite a program to add two different 3- dimensional matrix.
b) Define Pointer. Explain its advantages over array? Write an example how a set of
elements are manipulated with pointer.
3.a) What is deallocation? How such strategy applied in data structure.
b) Explainboundary tag system in details.
OR
Write insertion, fist-insert, last-insert and deletion algorithm of linked list.
4.a) How arithmetic expressions are evaluated using stack? Explain it with example.
b) Explain linked representaiton of stack with an exmple.
OR
Write down push & pop algorithms and various applications of stack.
5.a) Define queue. How it is represented ? Explain inserting and deleting algorithm in a
queue.
b) Discuss various applications of queue.
OR
a) Explain how priority queue used inRound Robin Scheduling.
b) Write down the algorithms used for insertion and deletion in deque?
6. Explain pre-order, in-order and post-order tree traversal with their algorithms and ex-
ample.
OR
a) Draw the B-tree of order 5 using following keys.
65, 71, 70, 66, 75, 68, 72, 77, 74, 69, 83, 73, 82, 88, 67, 76, 78, 84, 85, 80.
b) Write an algorithm to store data in a tree.

***
 2018
Full Marks - 70
Time - As in the Programme
The figure in the right hand margin indicate marks
Answer All question.

1. (a) What are the differences between Static Data Structure and Dynamic Data Structure?
b) What is array? Explain types of array with example.
OR
a) What is Abstract Data types? Explain with example.
b) How to structures are processed? Explain it by Nested structure.
2.a) What is lists? Explain it by using array.
b) What is single linked list? Write a algorithm to insert a node at beginning of Single
Linked list.
OR
c) What is Double Linked List? Explain with example.
d) What are the applications of linked list? How linked lsit is advantageous over Array.
3.a) What is stack? What are the uses of stack? Implement stack using linked list.
b) What is Queue? Explain Queue implementation using array.
OR
c) What is tree? Write the algorithm for traversing a Binary Tree.
d) (A + B/C) * (D  E) + F. Convert this infix expression into postfix by using stack.
4.a) What is Quick sort? Write the algorithm for Quick sort.
b) What is Merge sort? Sort the following by using merge sort:
9 12 3 57 98 1 37 40
OR
c) What is Heap sort? Explain the algorithm for Heap sort.
d) What is Selection sort? Sort the following using Section Sort
7 3 6 10 24 2 8 23
5.a) What is Searching? Explain the criteria of selecting a search algorithm.
b) Explain High Probability ordering with example
OR
c) What is Hashing? What are the Hashing Techniques? Explain.
d) How collision occurs? Explain the linear probing.

***
 2018
Full Marks - 50
Time - As in the Programme
The figure in the right hand margin indicate marks
Answer All question.
1. Answer all the questions :
a) Explain ADT with suitable examples.
b) Evaluate the postfix expression 3, 16, 2, +, *, 12, 6, /, -.
c) What do you mean buy Expression Tree? Give an example of it.
d) List out applications of stack.
e) What are the limitations of arrays in comparisons to the linked lists?
2.a) What is data structure? Explain the objective of data structure. Discuss types of data
structure with examples.
b) Write the C code to access the elements of 1D array A having capcity 15.
c) What do you mean by merging of two arrays? Write an algorithm for merging two 1D
arrays into single array.
3.a) What is list? Write an algoprithm for creation a single linked list. Also write algorithm
for insertion a new node to that SLL at end and at specific position.
OR
b) What do you mean by Double linked list? What is the advantageous of DLL over SLL.
c) List out the applications of linked list. Explain the memory representation of linked list.
4.a) Explain the process of conversion from infix expression to postfix expression using
stack.
b) Convert infox to postfix using stack Z+ (Y*X-(W/V^U)*T)*S.
OR
c) Explain the algorithm for quick sort. Sort the elements using quick sort 56, 24, 20, 17,
2.
5.a) Write the algorithm for linked list representation of queue.
b) What is queue? Explain the overflow and underflow conditions of linear queue.
OR
c) What is double ended queue? Explain types of double ended queue with suitable
examples.
6.a) In-order traversal : 10, 12, 20, 30, 37, 40, 45
Preorder traversal : 30, 20, 10, 12, 40, 37, 45
Construct BST using the above traversals.
b) What is a tree ? Describe the terminololgies used in tree.
OR
c) Construct the AVL tree by using the keys: 50, 40, 35, 58, 48, 42, 60, 30, 33, 25. Delete
40 after constructing the AVL tree.
***
 2018
Full Marks - 60
Time - As in the Programme
The figure in the right hand margin indicate marks
Answer All question.

Group-A
1. a) Explain the physical Implementation of Binary tree.
b) What is Buddy System?
c) Classify Data Structure.
d) What is Heap Tree?
e) Evaluate the postfix expression 5,4,6,+,*,4,9,3,/,+,*.
f) Write down the application of Linked Lists.
g) Define Double Circular Linked list.
h) What do you mean by Expression Tree?
i) Write down the applications of Stack.
j) Define Array.
Group -B
2.a) What is Multi-Dimensional Array? Write a program to enter a 3x3 matrix and display
the lower triangula rmatrix.
OR
a) Write a program to multiply two 3x3 matrices
3.a) Perform the following operations in a Single Linked List.
i) Add a node at the beginning of the list
ii) Delete a node from a particular position
OR
a) Perform the following operations in a Circular Linked List.
i) Add a node at the a particular position of the list.
ii) Count total no of nodes present in the list.
4.a) What is Stack? Perform the push, Pop and Traverse Operation.
b) Find out positfix form of the expression (A+B)*(C*D-E)*F/G.
OR
a) What is Recursion? Write a program to calculate factorial of a no using Recursion.
b) Explain Quick sort with example.
5.a) What is Queue? Write algorithms to add and delete element from a queue usign
Link List Representation.
OR
a) Explain any two with example
i) Dequeu
ii) Priority Queue
iii) Application of Queue
6.a) Explain any two with example
i) Binary Search Tree
ii) Weighted Binary Tree
iii) Decision Tree
OR
a) Define Linked list representation of a Binary Tree.
b) Explain Insertion, deletion, Traversal Operation on Binardy Tree.

***