Scribd
Upload
60 views

Slow Learns Question Bank

This document contains practice questions from 3 modules - Module 2 on linked lists, Module 4 on binary trees, and Module 7 on heaps and AVL trees - that are intended for students needing extra help in the data structures and algorithms course BCSE202L. The questions cover implementing various operations on linked lists, binary trees, binary search trees, heaps, and AVL trees such as insertion, deletion, traversal, sorting, and balancing binary search trees. Students are asked to write algorithms or code to solve problems related to these fundamental data structures.

Uploaded by

Satwik Krishna
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
60 views

Slow Learns Question Bank

This document contains practice questions from 3 modules - Module 2 on linked lists, Module 4 on binary trees, and Module 7 on heaps and AVL trees - that are intended for students needing extra help in the data structures and algorithms course BCSE202L. The questions cover implementing various operations on linked lists, binary trees, binary search trees, heaps, and AVL trees such as insertion, deletion, traversal, sorting, and balancing binary search trees. Students are asked to write algorithms or code to solve problems related to these fundamental data structures.

Uploaded by

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

BCSE202L DATA STRUCTURES AND ALGORITHMS

FALL SEMESTER 2022-23

CAT-2 QUESTION BANK FOR SLOW LEARNERS

SYLLABUS FOR CAT2


MODULE 2 :
Applications – List: Singly linked lists, Doubly linked lists, Circular linked lists- Applications:
Polynomial Manipulation.

MODULE 4:
Introduction - Binary Tree: Definition and Properties - Tree Traversals- Expression Trees:-
Binary Search Trees - Operations in BST: insertion, deletion, finding min and max, finding
the kth minimum element.

MODULE 7
Heaps - Heap sort- Applications -Priority Queue using Heaps. AVL trees: Terminology, basic
operations (rotation, insertion and deletion).

MODULE 2 Practice Questions:

1. Write an algorithm / Program to implement single linked list operations by storing


the names of the students.
2. Write an algorithm / program to delete all the names of the students whose name
starts with the alphabet “A” or “S”
3. Explain by writing a procedure / algorithm to sort the names present in the list in the
increasing/decreasing order
4. Construct a doubly linked list and insert either a number or character in the nodes of
the DLL. Split the DLL such that the new list should have only the vowels and the
original list should have consonants
5. Implement josephus problem using circular linked lists.
6. Write an algorithm to implement Polynomial addition using two linked lists by
storing the coefficient and exponents in a node and store the resultant polynomial
in the third list.

MODULE 4 Practice Questions:


1. Try to know all the definition of Trees ( use introduction to Trees Presentation )
2. For a given binary tree compute the pre order, in order, post order and level order tree
traversals
3. Write an algorithm / code to implement pre order, in order, post order and level order tree
traversals
4. Construct an Expression tree using In order Tree traversals
5. Construct an Expression tree using Post order Tree traversals
6. Evaluate the Expression Tree
7. For a given Binary Tree how will you identify the following write necessary algorithm or
procedure
a. Number of nodes in the Binary Tree
b. List out the leaf nodes in the Binary Tree
c. Search an element in the Binary Tree
d. Insert an element
e. Delete an element
f. Identify the duplicates
g. Identify the path between the root and the leaf nodes
h. Compute the degree of a binary tree
i. Compute the depth and height of a binary tree
8. Construct a binary tree using the tree traversals
a. In order and pre order tree traversals
b. In order and post order tree traversals
c. In order and level order tree traversals
9. Construct a binary search tree using the given numbers
10. Find the minimum and maximum element present in the BST
11. Find the kth minimum / Kth maximum element in the given BST
12. Display all leaf nodes in the BST.
13. Write a program / algorithm to insert / delete elements in the given BST
14. In a BST Compute / display the following
a. Left sub tree of a node
b. Right sub tree of a node

MODULE 7 Practice Questions:


1. Why we need to go for balanced BST?
2. Whether height balanced BST are AVL Trees?
3. All AVL Trees are BST. Justify your answer
4. Explain the approaches/ways for implementing a balancing a BST. Illustrate with an example
5. Implement AVL Tree by performing the following operations
a. Insert 35
b. Insert 56
c. Insert 62
d. Insert 23
e. Insert 31
f. Delete 62
g. Insert 47
h. Insert 48
i. Insert 12
j. Delete 47
k. Delete 56
l. Insert 50
6. What are Heaps ? Explain its types with an example
7. Implement Heap sort by applying either max heap / min Heap principles using the following
numbers
12,45, 34, 23,52, 30, 11, 7, 5, 63, 17, 39
8. What are priority queues? Why we are in need of Heap data structure to implement priority
queues? Explain the types of implementing priority queues
9. Make use of Min Heap / Max Heap definitions to implement Priority Queues. Illustrate with
suitable example.

You might also like