Scribd
Upload
143 views4 pages

Exam Guide: Algorithms & Data Structures

This document outlines the structure and content of an end semester examination for the course CSIT365, focusing on Analysis of Algorithms and Data Structures. It includes details about the exam duration, total marks, and the sections with specific questions to be attempted by students. The questions cover various topics such as greedy algorithms, sorting techniques, search methods, sparse matrices, and data structure concepts.

Uploaded by

harshsingh110099
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
143 views4 pages

Exam Guide: Algorithms & Data Structures

This document outlines the structure and content of an end semester examination for the course CSIT365, focusing on Analysis of Algorithms and Data Structures. It includes details about the exam duration, total marks, and the sections with specific questions to be attempted by students. The questions cover various topics such as greedy algorithms, sorting techniques, search methods, sparse matrices, and data structure concepts.

Uploaded by

harshsingh110099
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/ 4

■-----------------------:--

~~
r-~
- [No . of Printe d Pages - 4] 1050

b~ CSIT365 Enrol. No ........ ..... ..

r::~ [ET]

~~ END SEME STER EXAM INAT ION: NOVEMBER-


t~ DECEMBER, 2023

~~ ANAL YSIS OF ALGO RITH MS AND DATA


l:~ STRU CTUR ES

~ Time: 3 Hrs. Maxim um Mark s : 60

~
Note: Attem pt questi ons from all sectio ns as directed.
~
~ SECT ION - A (24 Mark s)
~ Attem pt any four questi ons out of five.
Each questi on carrie s 06 marks .
~
b
1. State the reasons for naming the algori thms as the
~
'Greedy' algorithm.
~
~ 2. (a) Name any one elementary sortin g techn ique and
write its working algorithm. (3)
~
f:.:, (b) Give the most releva nt examp le of divide and
t:=' conqu er algorithmic techn ique that you are aware

~ of stating the reason behin d. (3)


P.T.O .
~
~
CSIT365 2 1050

3. Compare and contrast Linear Search and Binary ~

Search methods. Which one is more faster and

efficient? Explain.

4. Define 'Sparse Matrices'. Take an integer 4x6 sparse

matrix of your choice and draw its linked list 9


representation. ~

c:=
5. (a) Write the necessary code for array based Stack
implementation . Write the necessary input and 9
~
expected output of the program. (3)

(b) Define 'Graphs' in the context of Data Structure


studies. (3)
9
9
1 SECTION - B (20 Marks) ~
Attempt any two questions out of three.
C1
Each question carries 10 marks.
~

6. Write the necessary code to implement the creation


:1 '

and printing of the single linked list. Discuss the code


to come to a conclusion.
3 10 50
CSIT365
rsive Definition of
7. Explain how will you develop Recu
pl e pr ob le m s? St at e th e ad va nt ag es an d
sim
.
disadvantages of us ing recursion

) and Breadth Fi rst


8. Compare Depth Fi rst Search (DFS
ar ch (B FS ) me th od s. W rit e th e ma in
Se
observations.

SE CT IO N - C (1 6 M ar ks )

(C om pu lso ry)

d ef fic ien t so rti ng


9. (a) "Heap So rt is a po pu lar an
rt is to eli mi na te
algorithm . Th e co nc ep t of he ap so
he ap pa rt of the
the elements on e by on e from the
so rte d pa rt of
list, and then insert them int o the
lis t". Us in g fe w se ria l di ag ra m m at ic
the
ap so rt log ica lly
representations, ex pla in ho w he
co de , pr ov id e
wo rk s . W rit e th e ne ce ss ar y
pe cte d ou tpu t of
necessary inp ut an d wr ite th e ex
(8)
the code.

P.T.0. .
·',·
,,
I• .
'

L;, J
f a
~

~
CSIT365 4 1050
I ~
e,:j
.I I
. ' '
(b) "Priority Queue is an abstract data type that
~
performs operations on data elements as per the
~
priority". Explain the statement clearly by giving
e::j
an appropriate example. (8)
~

e-i
C=l
e:-J
C:1
.I -~

~
~
d
~
j
~
j
~

C$
~

(100) ~
~
~

You might also like