Scribd
Upload
19 views2 pages

Iii - Ia-Ds

Data Structure Paper and Solution

Uploaded by

mdiliyazcs_735857212
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
19 views2 pages

Iii - Ia-Ds

Data Structure Paper and Solution

Uploaded by

mdiliyazcs_735857212
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

USN 1 R L Subject Code BCS304

Sri Devaraj Urs Educational Trust (R.)


R. L. JALAPPA INSTITUTE OF TECHNOLOGY
(Approved by AICTE, New Delhi & Affiliated to VTU, Belagavi)
Kodigehalli, Doddaballapur- 561 203
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Continuous Internal Evaluation – III
Max
Date 05/03/2024 25
Subject: Data Structures and Applications Marks
Semester III Duration 60 Minutes
Section A&B Faculty Name: Vinaykumar Y B & Iliyaz Pasha M Time 2:00pm to 3:00pm
Note: Answer any ONE full question from each PART
RBT – Bloom’s Taxonomy Levels (1- Remembering, 2- Understanding, 3 – Applying, 4 – Analyzing, 5 – Evaluating, 6 - Creating)
CO – Course Outcomes PO – Program Outcomes

Q. No Questions Marks RBT CO PO


PART A
What is BST? Write a c function to insert an element in BST. Crate BST for
a) below series 10 L2 CO4 PO1
55,43,85,77,42,34,44,62,90,95
Define the following terms,
1
I. Graph
b) II. Multi-graph 5 L2 CO4 PO1
III. Graph with self-edge
IV. Complete graph.
OR
What is BFS? Write algorithm for BFS graph traversal methods and apply
same for below graph.

a) 10 L2 CO4 PO1

What is graph? Give matrix and adjacency list representation for the below
graph.

b) 5 L2 CO4 PO1

PART B
Page 1 of 2
USN 1 R L Subject Code BCS304

Construct a hash table ht of size 5 (using chaining method to avoid collision)


a) and solve the following words: like, a, tree, you, first, find, a, place, to, grow, 5 L3 CO5 PO1
3 and, then, branch, out.

b) With an example explain the concept of forest in data structure. 5 L2 CO4 PO1

OR

a) Explain how collision can be handling in hashing. 5 L2 CO5 PO1

Consider below min-max heap as shown below and perform the following
i. Min-Max Heap after inserting element 4.
ii. Min-Max Heap after inserting element 80.
4
b) 5 L2 CO5 PO1

CO 4. Develop solutions using trees and graphs to model the real-world problem.
CO 5. Explain the advanced Data Structures concepts such as Hashing Techniques and Optimal
Binary Search Trees.

Prepared By Verified by Department IQAC Approved by HoD


Co-ordinator

Page 2 of 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy