Scribd
Upload
7 views2 pages

November 2024 B.SC Computer Science 2019 Pattern

This document is an examination paper for a Computer Science course on Data Structures and Algorithms-II, consisting of five questions with varying marks. It includes topics such as binary trees, graph theory, hashing, and tree structures, with specific instructions for candidates. The exam is designed to assess knowledge through definitions, programming tasks, and theoretical questions.

Uploaded by

10 C 25 Shweta Padte
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
7 views2 pages

November 2024 B.SC Computer Science 2019 Pattern

This document is an examination paper for a Computer Science course on Data Structures and Algorithms-II, consisting of five questions with varying marks. It includes topics such as binary trees, graph theory, hashing, and tree structures, with specific instructions for candidates. The exam is designed to assess knowledge through definitions, programming tasks, and theoretical questions.

Uploaded by

10 C 25 Shweta Padte
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

Total No. of Questions : 5] SEAT No.

PC-1572 [Total No. of Pages : 2


[6328]-41
S.Y. [Link].
Computer Science
CS-241: DATA STRUCTURES AND ALGORITHMS-II
(Revised 2019 Pattern) (Semester - IV) (CBCS) (24121)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Neat diagrams must be drawn wherever necessary.
4) Your answers will be values as a whole.

Q1) Attempt any Eight of the following: [8 × 1 = 8]

a) What is complete binary tree?

b) Define degree of the tree.

c) What is expression tree?

d) Define Balance factor.

e) What do you understand by splay tree?

f) Write about inverse adjacency list.

g) Give any two uses of graph in social network.

h) Define topological sort.

i) What is a Bucket?

j) List any two collision resolution techniques.

P.T.O.
Q2) Attempt any Four of the following: [4 × 2 = 8]
a) What do you mean by Huffman Encoding?
b) Write a short note on B-tree.
c) Define:
i) Height of tree ii) Siblings
d) Draw adjacency list of following graph.

e) What do you understand by collision in hashing?


Q3) Attempt Any Two of the following: [2 × 4 = 8]
a) Write a C program to calculate indegree, outdegree of each node and
total degree of graph.
b) Write a 'C' function for deleting a node from Binary search tree.
c) Write a 'C' function 'Search' - that will searches an element in a hash
table.
Q4) Attempt Any Two of the following: [2 × 4 = 8]
a) Differentiate between BFS and DFS.
b) Construct AVL tree for following data.
RUS, BRA, GER, IND, PAK, BAN, USA, AFR
c) Describe coalesced chaining with an example.
Q5) Attempt Any One of the following: [1 × 3 =3]

a) Write the conditions and rules that red black tree must be satisfied.

b) Define the following terms.


i) Spanning Tree
ii) Acyclic Graph
iii) Weighted Graph

JJJ

[6328]-41 2

You might also like