0% found this document useful (0 votes)
15 views2 pages

IA2 Set3 DS QP

The document is an internal assessment question paper for the subject 'Data Structures and Applications' for the Information Science and Engineering department. It includes various questions related to data structures such as collision resolution, graph traversal, binary trees, and AVL trees, with a total maximum mark of 50. The assessment is structured into two parts, each requiring students to answer specific questions.

Uploaded by

amrita.rit87
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
0% found this document useful (0 votes)
15 views2 pages

IA2 Set3 DS QP

The document is an internal assessment question paper for the subject 'Data Structures and Applications' for the Information Science and Engineering department. It includes various questions related to data structures such as collision resolution, graph traversal, binary trees, and AVL trees, with a total maximum mark of 50. The assessment is structured into two parts, each requiring students to answer specific questions.

Uploaded by

amrita.rit87
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/ 2

Ref. No.

TJGI/F/ACAD/15
Rev No: 00
Internal Assessment Question Paper
Rev Date : 01/01/2022
Page 1 of 2

USN

Internal Assessment Question Paper – Set3

Name of the Faculty Ms. Shilpa N.S. Department Information Science and Engineering
IA1 / IA2 / IA3 IA2 Scheme 2022 Class S3 Batch 2023
Name of the Subject DATA STRUCTURES AND APPLICATIONS Subject BCS304
Maximum Marks 50 Date 02.12.2024 Code
Duration 2:15PM -3:45PM
Q. No. Question Mark Cos Level
PART A (Answer any one) s
1. 25
1. A What is collision? What are the methods to resolve collision? Explain BCS304.5
10 2
) linear probing with an example.
Create an algorithm to perform a Breadth First Search (BFS) traversal BCS304.4
on a graph. Apply BFS for the graph given below.

1. B) 8 3

What is the advantage of threaded binary tree over binary tree? BCS304.3
1. C) Construct the threaded binary tree for the following elements 7 3
10,20,30,40,50.
OR
2.
Construct the hash table to insert the keys: 3,2,9,6,11,13,7,12 in a hash BCS304.5
2. A table of 10 memory locations. The hash function is h(k)=2k+3 ,use 10 3
) Division open addressing to store these values.
BCS304.4
What are the methods used for traversing a graph? Explain with an
2. B) 8 2
example.
What is a tree? With suitable example ,define BCS304.3
2 C) (i)Height of a node. (ii) Height of a tree. (iii)Degree of a tree. (iv)Path 7 2

PART B (Answer any one)


3. 25
3. A What are Red-Black Trees? Explain step by step, how to insert an BCS304.5
element into a Red-Black Tree? 10 2
)
Define BST. Construct a Binary search tree(BST) for the following BCS304.4
3. B) elements: 45, 15, 79, 90, 10, 55, 12, 20, 50.Traverse using in-order, 8 3
pré-order, and post-order traversal techniques.

1|P a g e
Ref. No. TJGI/F/ACAD/15
Rev No: 00
Internal Assessment Question Paper
Rev Date : 01/01/2022
Page 2 of 2

3. C) Write a function to insert an element into a Binary Search Tree (BST). 7 BCS304.4 2
OR
4.
4. A Discuss AVL tree with an example.Construct AVL tree by inserting BCS304.5
the following elements H, I, J, B, A, E, C, F, D, G, K, L. 10 3
)
BCS304.4
4. B) Explain in detail the fundamental operations performed on graphs. 8 2
Write a function to perform a recursive search in a Binary Search Tree BCS304.4
4. C) 7 2
(BST).

Sections PART-A PART-B


Q1 Q2 Q3 Q4
Qn No.
(a) (b) (c) (a) (b) (c) (a) (b) (c) (a) (b) (c)
Course BCS3 BCS30 BCS30 BCS30 BCS30 BCS3 BCS3 BCS3 BCS3 BCS3 BCS3 BCS30
Outcomes 04.5 4.4 4.3 4.5 4.4 04.3 04.5 04.4 04.4 04.5 04.4 4.4
Taxonomy
Level 2 3 3 3 2 2 2 3 2 3 2 2
Mapping Questions to Course outcomes

Mapping Questions to Course outcomes

Sections PART-A PART-B


Q1 Q2 Q3 Q4
Qn No.
(a) (b) (c) (a) (b) (c) (a) (b) (c) (a) (b) (c)
BCS304.1
BCS304.2
BCS304.3 100% 100%
BCS304.4 100% 100% 100% 100% 100% 100%
BCS304.5 100% 100% 100% 100%
Taxonomy
Level

Dated Signature of the Faculty Member

2|P a g e

You might also like