Scribd
Upload
16 views2 pages

Updated DSA - QB 3

DSA question bank important questions

Uploaded by

keerthan050604
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
16 views2 pages

Updated DSA - QB 3

DSA question bank important questions

Uploaded by

keerthan050604
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

(Approved by AICTE, New Delhi & Affiliated to VTU, Belegavi, Karnataka)

181/1, 182/1, Behind SAP Labs, Seetharam Palya, Basavanagar, Hoodi, Bangalore - 560 048

QUESTION BANK-3
Academic Year : 2024-25
Programme : CSE / ISE
Year/Semester/Section : III / II / B / C
Course Code/ Name : BCS304 / Data Structures and Applications
Faculty Name : Subrahmanya H M

MODULE 2 & 3: Title


TREES(Cont..): Binary Search trees, Selection Trees, Forests, Representation of Disjoint
sets, Counting Binary Trees,
GRAPHS: The Graph Abstract Data Types, Elementary Graph Operations
HASHING: Introduction, Static Hashing, Dynamic Hashing
CO4 Develop solutions using trees and graphs to model the real-world problem.
Explain the advanced Data Structures concepts such as Hashing Techniques and
CO5
Optimal Binary Search Trees.

**Revised Bloom’s Taxonomy (RBT) Levels


RBT Remember Understand Apply Analyze Evaluate Create
RBT Levels L1 L2 L3 L4 L5 L6

RBT**
Q. No. Questions Marks COs*
Level
Write a C function to perform the following operation on Binary Search
1
Tree (BST), 08 CO4 L3
i) Searching an element in BST
ii) Inserting an new element to BST
2 Explain all methods used for traversing a graph with suitable CO5
12 L2
example and write a C function for the same.
Write a short note on priority queue. 06 L2
3 CO5
4 Define hashing. Explain different hashing functions with examples. 08 CO5 L2
5 What is collision? List the different methods of collision resolving
technique used in hashing. Explain rehashing method with an example. 10 CO5 L3

6 Design and develop a C program for a given file of N employee


records with a set K of Keys (4-digit) which uniquely determine the
records in file F. Assume that file F is maintained in memory by a 08 L3
CO5
Hash Table(HT) of m Memory locations with L as the set of memory
addresses (2-digit) of locations in HT.
Let the keys in K and addresses in L are Integers. That uses Hash
function H: K → L as H(K)=K mod m (remainder method), and
implement hashing technique to map a given key K to the address
space L. Resolve the collision (if any) using linear probing.

Define Forest. Explain Transforming a Forest into a Binary Tree with 06 CO4 L2
7
an example.
Define graph. Show the adjacency matrix and adjacency list
8 representation of the graphs given below.
i) ii)

08 CO4 L3

iii)

Define the following Terminologies with an example.


9 i) Directed graph ii) Weighted graph
iii) Complete graph iv) Self-loop 08 CO4 L1
v) Cyclic graph vi) Connected graph
10 Design, Develop and Implement a Program in C for the following
operations onGraph(G) of Cities
i. Create a Graph of N cities using Adjacency Matrix.
10 CO4 L3
ii.. Print all the nodes reachable from a given starting node in a
digraph using BFS method
iii. Check whether a given graph is connected or not using DFS
method
11 What is collision? What are the methods to resolve collision? Explain 07 CO5 L2
linear probing with an example.
12 Define min leftist tree. 06 CO5 L2
Meld the following leftist trees,

13 Define selection tree. Construct min winner tree for the runs of a
game given below. Each run consists of values of players. Find the 08 CO4 L2
first 5 winners.

14 Define the Disjoint set. Consider the tree created by the weighted
union function on the sequence of unions: union(0,1), union(2,3), 06 CO4 L2
union(4,5), union(6,7), union(0,2), union(4,6), and union(0,4). Write
simple find and collapsing find function.
15 What is chained hashing? Discuss its pros and cons. Construct the 10 CO5 L3
hash table to insert the keys: 7, 24, 18, 52, 36, 54, 11, 23 in a
chained hash table of 9 memory locations. Use h(k) = k mod m.
16 What is dynamic hashing? Explain the following techniques with
examples: 05 CO5 L2
i) Dynamic hashing using directories
ii) Directory less dynamic hashing

Prepared by Approved by

SUBRAHMANYA H M/ AP/CSE
(Name of Faculty / Designation / Dept.) (HOD – DEPT)

You might also like