Scribd
Upload
13 views2 pages

CC5 (Dsa)

The document outlines the examination structure for the BS Honors 3rd Semester in Computer Science at West Bengal State University for the academic year 2023-24. It includes two groups of questions, Group A and Group B, covering various computer science topics such as data structures, algorithms, and memory representation. The total marks for the examination are 40, with specific instructions on answering the questions and adhering to word limits.

Uploaded by

Rita Poddar
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
13 views2 pages

CC5 (Dsa)

The document outlines the examination structure for the BS Honors 3rd Semester in Computer Science at West Bengal State University for the academic year 2023-24. It includes two groups of questions, Group A and Group B, covering various computer science topics such as data structures, algorithms, and memory representation. The total marks for the examination are 40, with specific instructions on answering the questions and adhering to word limits.

Uploaded by

Rita Poddar
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

CBCSRSHonArd Sem CMSACOReST 20224

WEST BENGAL STATE UNIVERSTY


BS Honors ird Semester Fxaminstion, 2023-24

CMSACOROST-CoMPUTER SCIENCE (CC5)


Time Allotted 2 Hours Full Mark 40

Th gwre n th mrgs ncute flmrt


rand adhere lo the word limit as praeahi
4ll nhos re ef a gicance

GROUPA
Answe a four trom the followng 24-8

a What s the advantage of usng pol1sh notaton in computers


(b Wrte anc ad antage of circular linked list over singty linked list
eWhco does the worst casc for Bubble sort occur
hat sa beight balanced BST
Whats deque
What is tad recursion?
Wrtc pastfx form of the following:
(A By"D- E/F 4" Dy +C

GROUPB

Aftempt any four questions 8x4-32

Write at algorithm to implement qucue using stack Prove that the maxinum 4+4

number of nodes on level i of a binary tree is 2.121

Wrne atn algorithn to reverse a ink list WVhat is theaded hinary tree? Explain 4+4
with an cLampie

(a) Lmngne a hash-table of stre 10 Using the hash function )-1% 10, and open
addresting wih linear probing for collision resolution, insert the following four
keys one by one isto the ha table (2, 13, 22, 4) Show the contenis of the hash
tabir after each insertion
(b) Prove that a troe with n odes has exactly n - I edges

1010 Turn Over


CBCS/B.SeMons./3 rd Sen./CMSACOROST/2023-24

. (a) Write an algorithm to delete an element from a circular queue. 4

(b) Write a program in C/Ctt to find duplicate elements in an array. 4

6, a) Give a memory efficient storage representation for sparse matrices. 4

(b) Based on the representation you suggested above for sparse matrices, now write 4
an algorithm to add two sparse matrices.

4
Reconstruct the original binary tree from the following sequences:
Inorder sequence: D, G, B, H, E, A, F, I, C
Preorder sequence: A, B, D. G, E, H, C, F. I
4
(b) Compare the best and worst case time complexity of scarching an element in a
linked Iist versus an array.

You might also like