Scribd
Upload
15 views2 pages

14 Computer Science Sep Oct 2022

Computer science

Uploaded by

simransheikh73302
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
15 views2 pages

14 Computer Science Sep Oct 2022

Computer science

Uploaded by

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

i1ilililffiiltillifiilfitiltiil NP - 120

ll Semester B.Sc. Examinatio[f, September/Octob er 2022


(NEP - 2021 -22 and Onwards)
COMPUTER SCIENCE
Paper - Il : Data Structures
Time :ZYz Haurs Max. Marks : 60

lnstruction : Answer any four questions from each Part.

PAHT _ A

l. Answer any four questions. Each question carries two marks. (4x2=8)
1) Define abstract data type. Give an example"
2) What is a sparse matrix ?

l) Define garbage collection.

J) What is a binary search tree ?


5) Define AVL tree.
6) Define hash function.

PART _ B

ll. Answer any foun questions. Each question carries five marks. (4x5=20)
7) Explain the various asymptotic notationS for complexity of algorithm. 5

8) Write an algorithm to insert an element into an array at a given position. 5

9) Write a C program for tower of Hanoi problem. 5


1p) Explain topological sorting. 5

1{) Explain how to build a binary search tree with an exarnple. 5

12) Explain various tree traversal methods with suitable examples. 5

P.T.O.
NP - 120 itillill lffilil fllfi ililiililillt

PART _ C

lll. Answer any four questions" Each question carries eight marks. (4x8=32)
13) a) Explain any four string operations. 4
b) Explain the four operations performed on primitive data structure. 4

14) a) Define queue. Explain its types. 5


b) Explain push and pop operations of stack. 3

15) a) Define linked tist. Write an algorithm to insert an element at the end of
a singly linked list. 6
b) Write any two applications of stack. 2

16) a) Explain sequential representation of graph in memory. 4


b) Explain collision resolution by chaining. 4

17) Explain shell sortforthe given elements 18,32, 14,9,45,6,55, 16. I


18) Write an algorithm to implement binary search technique in an array with
an example.

,!'t

You might also like