Scribd
Upload
11 views

bsc_computer-science-cs_semester-4_2023_april_data-structures-and-algorithms-ii-2019-pattern

This document is an examination paper for S.Y. B.Sc. (Semester - IV) in Computer Science, focusing on Data Structures and Algorithms. It consists of five questions, with various parts requiring definitions, explanations, and programming tasks related to tree structures, hash tables, and graph algorithms. The paper is structured with specific marks assigned to each question and emphasizes the importance of neat diagrams and comprehensive answers.

Uploaded by

gauravshinde5545
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

bsc_computer-science-cs_semester-4_2023_april_data-structures-and-algorithms-ii-2019-pattern

This document is an examination paper for S.Y. B.Sc. (Semester - IV) in Computer Science, focusing on Data Structures and Algorithms. It consists of five questions, with various parts requiring definitions, explanations, and programming tasks related to tree structures, hash tables, and graph algorithms. The paper is structured with specific marks assigned to each question and emphasizes the importance of neat diagrams and comprehensive answers.

Uploaded by

gauravshinde5545
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Total No.

of Questions : 5l
SEAT No. :

P-1294 [Total No. of Pages ; 2


[6055J-201
S.Y. B.Sc. (Semester - IV)
CO'HIPU.TER SCIENCE
CS 241 : Da€a Structures and Algorithms - II
(2$19 fpttern) (CBCS) e4t2l)

Time:2 HoursJ
[Max.Marks : 35
I nstructio ns to thi' Xan d id a,tes :
I) All qaestions are compulsory.
2) F,rguris to the right indicute full marks.
3) Neai diqgrams must be drawn whenever necessory.
4) Your anwers will be value as whole.
:
[8x1=8]

b) What is ievel order traversal? ,. ,"=


- - .''

c) trVhat is descend.ant in tree?.--,- - ..,,'

d) In B+ tree data can only or.e leaf node. state true or ta1se.
e) List AVL tree Rotatiensj. ".
0 List any two mini upaqriiing rree algorirhms.
g) "DFS uses queue implerrentation". State true or false.
h) What is weighted gra,p. h? ., '.
i) What is load factor?
j) What is hashing?

Q2) Attempt any four of the following : 14x2=81


a) Write a note on minimum spanning
b) Write a note on splay tree.
c) Give any two differences between nF( A.'Bfs.
d) Explain any two properties of good hashifunction.
\,'

P.T,O.
,
i
I

Q3) Attempt a*y two of the f-oilorn ing : [2 x 4 = s]


a) Write a'C'functicn to calcu'late
i) leaf nodes
ii) non leaf nodes :','
b) Write a programah,+t accepts'adjacency matrix and print indegree
and
outdegree of eaclr vertex.
c) Write a progffii to insert new elemerlt in hash table.
- *u
-,*t" -'

Q4) Attempr any txt'* tf r$s foilowing : lz x4 = g]


a)ConStrdotRedBlackTreefor2.lo,7,2o,30,25,50.
b) Con f_ollowing adjacency matrix

1 1.'1'0
0 ,',1.'1 0
1
1".-'0 1

0001
i) Draw the graph i\,
t'l

i, Give adjacency list .,,i"


c) Construct minimum sparui.-rjg ng Kruskal's algorithm.

i.1 "

Q5) Attempt any one of the fdilbwing :


a) Define the following terms : lt
rr 4fi s1
i) Terminal node "
r1:\q..:
ii) depth of node i\::i
iii) roct node .,, it
_
b) Give inorder, preorder and postorder traveffEj*fur,1.. '

,A.A.A.
[60ssF201

You might also like