Scribd
Upload
12 views1 page

2 Iat-Ds

This document outlines the structure for the Internal Assessment Test II for the CS3301 - Data Structures course in the Department of Computer Science and Engineering. It includes details such as the total marks, date, time, and the format of the test, which consists of multiple parts with specific questions. The test covers various topics including tree structures, graphs, sorting algorithms, and hashing.

Uploaded by

babu2friends
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
12 views1 page

2 Iat-Ds

This document outlines the structure for the Internal Assessment Test II for the CS3301 - Data Structures course in the Department of Computer Science and Engineering. It includes details such as the total marks, date, time, and the format of the test, which consists of multiple parts with specific questions. The test covers various topics including tree structures, graphs, sorting algorithms, and hashing.

Uploaded by

babu2friends
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/ 1

REG.NO REG.

NO

INTERNAL ASSESSMENT TEST II INTERNAL ASSESSMENT TEST II


DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
CS3301 – DATA STRUCTURES CS3301 – DATA STRUCTURES
Year/ sem ; II/III-CSE Total Marks: 60 Year/ sem ; II/III-CSE Total Marks: 60
Date: 13.11.2024 Time: 1½ hrs Date: 13.11.2024 Time: 1½ hrs
Answer All Questions Answer All Questions
PART A – (10 X 2 = 20 marks) PART A – (10 X 2 = 20 marks)
1 Define tree C03/BL1 1 Define tree C03/BL1
2 Define non-linear data structure C03/BL1 2 Define non-linear data structure C03/BL1
3 List out the steps involved in deleting a node from a 3 List out the steps involved in deleting a node from a
C03/BL1 C03/BL1
binary search tree. binary search tree.
4 What is a balance factor in AVL trees? C03/BL1 4 What is a balance factor in AVL trees? C03/BL1
5 Define Graph C03/BL1 5 Define Graph C03/BL1
6 Define adjacent nodes C04/BL1 6 Define adjacent nodes C04/BL1
7 What is an acyclic graph C04/BL1 7 What is an acyclic graph C04/BL1
8 Define sorting C05/BL1 8 Define sorting C05/BL1
9 Define hash function C05/BL1 9 Define hash function C05/BL1
10 Define collision in hashing. C05/BL1 10 Define collision in hashing. C05/BL1
PART – B (2 X 15 = 30 marks) PART – B (2 X 15 = 30 marks)
11 Explain about Heap tree ADT in detail. C03/BL2 11 Explain about Heap tree ADT in detail. C03/BL2
a). a).
OR OR
b). Explain about threaded binary tree ADT in detail. C03/BL3 b). Explain about threaded binary tree ADT in detail. C03/BL3

12 C04/BL3 12 C04/BL3
a.i) Explain about breadth first search algorithm (8) a..i) Explain about breadth first search algorithm (8)

a.ii) Explain about Rehashing function in detail.(7) C05/BL2 a.ii) Explain about Rehashing function in detail.(7) C05/BL2

OR OR
b). Explain about any three sorting algorithms with example C05/BL2 b). Explain about any three sorting algorithms with example C05/BL2

PART – C (1X 10= 10 marks) PART – C (1X 10= 10 marks)


13 Explain about open addressing with example in details C05/BL3 13 Explain about open addressing with example in details C05/BL3

Prepared By Verified By HOD Prepared By Verified By HOD

You might also like