GLOBAL INSTITUTE OF TECHNOLOGY

ITS-1, IT-Park, EPIP Jaipur 302022

Ph.0141-2770445
E.mail: [email protected]

Estd. 2002

GUESS PAPERS

Subject Name : DATA STRUCTURE AND ALGORITHMS

Code : 3CS4-05

Name : Ms Apoorva Joshi

Branch : Computer Science & Engineering

Session : 2023-24

Semester : III – A & B

 Year : II
MODEL QUESTION PAPER-I

Global Institute Technology, Jaipur Data Structure & Algorithms

Sem : III CSE
(Approved by AICTE and Affiliated to RTU, Kota)

PART-A
All questions are compulsory [10 x 2 = 20]
Q.1 What are the application of stack ?
Q.2 Compare Graph and Tree?
Q.3 What are Hash Functions and How to choose a good Hash Function?
Q.4 Define data Structure. Mention the application of data structure?
Q.5 What do you mean by tower of Hanoi problem?
Q.6 Define Dequeue.
Q.7 What is Header Linked list.
Q.8 What is the concept of Linear search.
Q.9 Explain the threaded Binary tree?
Q.10 Explain How many type of Binary tree.

PART-B
Attempt any five questions [5 x 4 = 20]
Q.1 Define Binary Search tree. Write algorithms to implement insertion operation on Binary search tree?
Q.2 What is quick sort, Sort the following elements by using quick sort 54, 26, 93, 17, 77, 31, 44, 55, 20
Q.3 "The Inorder and preorder traversal sequence nodes in a binary tree are given below
Inorder: E A C K F H D B G
Preorder: F A E K C D H G B
Draw a Binary Tree
Q.4 Write algorithms for push and pop operations in the stack.
Q.5 Describe the Dijkstra’s algorithm for finding shortest path with help of suitable example.

PART-C
Attempt any four questions [3 x 10 = 30]
Q.1 Write an algorithms with suitable example for insertion and selection sort.
Q.2 What is AVL Tree, explain the rotation of AVL tree, also Construct an AVL tree having the following
elements H, I, J, B, A, E, C, F, D, G, K, L"
Q.3 Explain Link list and write an algorithms for the singly link list.
a) Create a node b) Insert a node c) delete a node d) Traverse a node
 Year : II
MODEL QUESTION PAPER-II

Global Institute Technology, Jaipur Data Structure & Algorithms

Sem : III CSE
(Approved by AICTE and Affiliated to RTU, Kota)

PART-A
All questions are compulsory [10 x 2 = 20]

Q.1 What is linear and quadric probing.

Q.2 What is B tree ?
Q.3 What is minimum spanning tree.
Q.4 Write down the Application of queue.
Q.5 Write down the advantage and disadvantage of single link list.
Q.6 Write down the difference between linear and binary search.
Q.7 Write down the application of B- Tree
Q.8 Write down the difference in B Tree and B+ Tree
Q.9 Explain types of queue?
Q.10 What is Doubly link list?
PART-B
Attempt any five questions [5 x 4 = 20]
Q1. "Convert the following expression into reverse polish notations by stack (4 + 2 * 5) / (1 + 3 * 2)
Q.2 How to sort the following elements of bubble sort- 14, 33, 27, 35, 10
Q.3 Explain the concept of traversing of binary tree, also write down the algorithms for traversal.
Q.4 What is B Tree, explain how to insert and delete an elements in B Tree.
Q.5 What do you mean by collision, Explain the type of Collision resolution technique?

PART-C
Attempt any four questions [3 x 10 = 30]
Q.1 "a) Explain linear search with suitable example, also write down the algorithms for linear search.
b) Explain the counting sort with suitable example."
Q.2 "Write down the algorithms for inserting a node and deletion a node in doubly linked list. Also write
down the advantage of doubly linked list over singly linked list. "
Q.3 What is priority queue ? How can it be implemented? Explain an application of priority queue?
 Year : II
MODEL QUESTION PAPER-III

Global Institute Technology, Jaipur Data Structure & Algorithms

Sem : III CSE
(Approved by AICTE and Affiliated to RTU, Kota)

PART-A
All questions are compulsory [10 x 2 = 20]
Q.1 Define Data Structure? How you will classify it?
Q.2 Explain garbage collection.
Q.3 What do you understand by asymptotic notation? Explain.
Q.4 Illustrate the applications of Queue and Linked list.
Q.5 Discuss the advantages and disadvantages of Linked List.
Q.6 Explain linear and quadric probing.
Q.7 Write down the difference in B Tree and B+ Tree
Q.8 Explain min and max heap with example.
Q.9 State the difference between linear and binary search.?
Q.10 Discuss Hash Functions and How to choose a good Hash Function .

PART-B
Attempt any five questions [5 x 4 = 20]
Q.1 What is B+ Tree, Write an algorithms for insertion and deletion in B+ Tree.
Q.2 What is queue, write down the algorithm for front and rear.
Q.3 Explain the concept of hashing, write down the Common hashing functions.
Q.4 What is Circular queue, explain with suitable examples.
Q.5 Describe the Dijkstra’s algorithm for finding shortest path with help of suitable example.

PART-C
Attempt any four questions [3 x 10 = 30]
Q.1 a) what is Threaded Binary Tree? Explain the advantage of using a threaded binary tree.
b) What is binary tree, explain type of binary tree.
Q.2 Write short notes on
a) Address calculation techniques,
b) Reversing a single linked list
Q.3 "Write down the algorithms for Depth First Search and Breadth First Search, also explain how Depth
First Search and Breadth First Search works."