Scribd
Upload
47 views4 pages

DSA QUESTION BANK

The document is a question bank for the Data Structures & Algorithm subject for the 3rd semester CSE students, covering various topics including searching algorithms, data structures, linked lists, trees, graphs, and sorting algorithms. It consists of 2-mark, 4-mark, and 8-mark questions that require explanations, definitions, and algorithms related to the subject matter. The document is prepared by Er. Meenakshi Garg and is intended for the July-Dec 2022 batch.

Uploaded by

pallavprem2003
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
47 views4 pages

DSA QUESTION BANK

The document is a question bank for the Data Structures & Algorithm subject for the 3rd semester CSE students, covering various topics including searching algorithms, data structures, linked lists, trees, graphs, and sorting algorithms. It consists of 2-mark, 4-mark, and 8-mark questions that require explanations, definitions, and algorithms related to the subject matter. The document is prepared by Er. Meenakshi Garg and is intended for the July-Dec 2022 batch.

Uploaded by

pallavprem2003
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

QUESTION BANK

SUBJECT: DATA STRUCTURES & ALGORITHM


Semester: 3rd, CSE, Batch 2021, July-Dec 2022
SUBJECT CODE: BTCS 302-18

2 MARKS QUESTIONS
1 Differentiate between linear search and binary search.
2 Explain asymptotic notations in detail.
3 What is meant by time complexity? Define different time complexity notations.
Give examples one for each.
4 Classify various data structures.
5 Define ADT data structures.
6 Differentiate between data structure & data type?
7 What is the significance of Big -OH notation?
8 Differentiate between LIFO & FIFO.
9 Write an algorithm for binary search.
10 Application of Graph, stack and Queue.
11 Define the term DFS and BFS.
12 Write down the syntax of dynamic memory allocation.
13 What are the time complexity of Bubble and Quick Sort?
14 What is Binary Search tree?
15Difference between threaded binary tree and binary search tree.
16What is the significance of priority queue?
17 Define the concept of Hashing.
18 Define the space and time complexity of bubble, selection and insertion sort.
19 outline the importance of stack and queue.
20. Outline the importance of sorting, graph and linked list.
21 Outline the following terms: Predecessor and successor.
(4,8 MARKS QUESTIONS) UNIT-III
1 Differentiate between Single linked list and circular linked list
2 Differentiate between Double linked list and single linked list
3 Differentiate between Double linked list and circular linked list
4 Explain algorithm to insert an element at the beginning, at a specified position &
at the end of a singly linked list.
5 Explain algorithm to delete an element from the beginning, from a specified
position & from the end of a singly linked list.
6 What are header linked list?
7 What are the advantages of doubly linked list over singly linked list?
8 Explain traversing, insertion & deletion algorithms on circular linked list with
appropriate example.
9 Explain algorithm to delete an element from the beginning, from a specified
position & from the end of a doubly linked list.
10 Explain algorithm to delete an element from the beginning, from a specified
position & from the end of a doubly linked list.
11.Implement queue in linked list.
12. Implement stack in linked list.
13.insertion and deletion in sorted and unsorted linked list.
14 advantage and disadvantage of stack, queue and linked.

(4,8 MARKS QUESTIONS) UNIT-III


1 What is Binary Tree? Explain about operations on Binary tree?
2 Describe in brief about array and linked representations of binary tree
3 Write a short note on Threaded binary trees
4 Describe the concept of tree traversals with an example.
5 Describe a procedure to insert and delete an element into a Max Heap
6 Differentiate between tree and binary tree
7 Explain insertion in B-tree with example.(In most of the cases, example(list of
elements) of every concept will be given, if not, then you can take random example
)
8 Explain deletion in B-tree with example.
9 Explain insertion in B+tree with example.
10 Explain deletion in B+tree with example.
11 Explain insertion in AVL with example.
12 Explain deletion in AVL with example.
13 Define threaded binary tree and give an example
14 Define the following a. Max heap b. Min heap
15 What are the advantages of AVL tree? What is acceptable balancing factor for
AVL tree.
16 Differentiate between B+ & B-tree.
17 Describe a procedure about insertion and deletion operations of BST.
18 What is Graph? Explain linked list representation of graphs.
19 Differentiate between graph and tree.
20 Explain BFS traversal in a graph taking suitable example.
21 Explain array representation of graphs.
22 What are PROS & CONS of adjacency matrix?
23 Explain DFS traversal in a graph taking suitable example.
24vDefine multigraph & digraph.
25 Explain various types of binary trees.

(4,8 MARKS QUESTIONS) UNIT-IV AND UNIT-V


1 Perform complexity analysis of bubble sort algorithm
2 What is sorting? Explain about Selection and Heap Sorting
3 Illustrate the concept of Merge sort taking suitable example.
4 Construct binary tree from given inorder and preorder elements.
Inorder - 2,5,7,8,99,65,43,32,45,76
Preorder- 65,43,2,7,8,45,99,76,5,32
5 Explain algorithm for Insertion sort taking suitable example
6 Differentiate between quick sort and merge sort
7 What is the time complexity of quick sort in best, worst and average case
8 Define hash tables
9 Write an algorithm of Merge sort
10 Apply selection sort algorithm on given set of integers.
11 Explain the concept of sorting and which sorting technique is best among all.
12 Compare best, worst and average case complexity scenarios of quicksort &
mergesort.
13 What are recurrence relations?
14 Apply bubble sort algorithm on given set of integers.(integers will be given).
15 Apply Selection sort algorithm on given set of integers.(integers will be given).
16 Apply Insertion sort algorithm on given set of integers.(integers will be given).
17 Apply Quick sort algorithm on given set of integers.(integers will be given).
18 Apply Merge sort algorithm on given set of integers.(integers will be given).
19 Define the concept of Recurrence Relation. Also define the Substitution
Method.
20 define the concept of hashing. Draw a hash table of Open Hashing using
division method
21. define the concept of hashing. Draw a hash table of Closed Hashing using
division method.
22 define the concept of hashing. Draw a hash table of Linear Probe using division
method.
23 define the concept of hashing. Draw a hash table of Quadratic probe using
division method.
24 define the concept of hashing. Draw a hash table of Double Hashing using
division method.
25 Insertion and Deletion cases of B Tree.
26 Insertion and Deletion cases of B+ Tree.
27 Construct Binary Search tree on given set of integers.
28. Construct Binary Threaded tree on given set of integers.
29. define the terminologies of a tree.
30 Define the terminologies of a graph. `

Prepared by:
Er. Meenakshi Garg

You might also like