0% found this document useful (0 votes)
20 views2 pages

BSC - Computer Science Cs - Semester 3 - 2023 - November - Data Structures and Algorithms I 2019 Pattern

Uploaded by

Rohit Ghavate
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
0% found this document useful (0 votes)
20 views2 pages

BSC - Computer Science Cs - Semester 3 - 2023 - November - Data Structures and Algorithms I 2019 Pattern

Uploaded by

Rohit Ghavate
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

84

Total No. of Questions : 5l


SEAT No. :

P-637 6
[Total No. of Pages : 2

l6lssl-3r
,Hu$..
(domputer Science)
S.Y.
cs-231 : DATA giT V,S-ruRES AND ALGORITHMS - I
(+. 0t9)lsemester-Ill) (23 tzt)
Time: 2 HoursJ ,""1..;7)1.1 -.-..''
[Max lVfarks : 35
I nstr uctions to h ffiaq;l"i
t e.

l) FiSu,,;ffio the rifht indicatc full murks.


2) Ngat"diagra!$'must be drawn wherever necesssry.
a-

Ql) Attempt
?$,EIGHT
of the foltowing: '',* [8x1:8]
a) 'Q'4btation is used to denote upper of the tiry,€ic6mRlexity, state true/
F61se.
b) Define Data structure.
c) What is In-place sorting? ,.= .,,.'.t ,1,1'"r
d) State the time complexity of qe r,94?t
e) Write structure defi n ition for 5ilg ly tu, I inked list.
0
"ffi
Write postfix expressionffi"iivn infix expression.
(((P+Q)A.)*L)*M),t?v'" ..,...:'
.!

"Doubly linked list ged


- -o6
s) Et
merely than singly linked List" state truq/
farse. io
,"1

h) "
What is priarity queue!. ',";'
r) Wha is Double endod'Queue? :|,':''
i) Define stack.

Q2) Attempt any FOUR of the following : 14 x 2:81


a) List different types of data structures.
b) What is time complexity?
c) ExplainDivide and Conquer strategy. Y (:1

d)
.,;.1:,141 .;

Write representation ofpolynomial usir,lg t,ft.{ .tri6t with suitable example.


e) List applications of stack. "'-,.'" ,..:r,..,
0 Differentiate between circular queue & liffilqueue
P.TO.
\
!

Q3) Attempt any TWO of the following , x 4 : gl


[2
a) write a recussive function in 'c' for binary search.
b) write a function in'c'to delete.p'rode from singly
linked list by value.
c) write functions definition ,s*,rc" for push0 and pop0
to imprement
-'e" o"u,'
**".

Q4) Attempt any:Y#iffio*ing , t2 x 4:81


a) Apply selg{effsqr$o/ttre f_oilowing data:
a-
s8,22,ffi,aa,;?i,tz
:] yr:. ffi]drrl'cito imprement inserr operation of a dynamic queue.
c) eva$a& Y6*ire postfix JJ;r;;.
+n&' "*pr"rrio.,
arzump$
&
l6,B:z,c:4, D:l-)u,E:2L ,1
4,. r* \y
\ "'
1,. '-1"
,.'
QS) AttemFtloy oNE of the foilowing : :^"
a) *
what is generalized linked List? Rpn rrL$#given
[I x 3 : 3l
rist ru,d,c,d),e,f).
b) show the contents of queue of the folrowing program
statements u#&e
q* r.,,:.d
intx: 20,y:3Effi' l.t
^
init0; _ry "-.;:

y : deqftu'e 0; ,;p
enqu{d1y+:;; t
*
x : y+3a &k- "?i.'
enqueue (x);
fo*? i:,
enqueue (x-l); *ry 4*lF''
enqueue (x); r*n\' 'r'
1hJ ^i'=
*q,\"
i-"Pq#

oooc,,Y*1
I ,'
Jr'',
e"#' "Yl
q.*..'

#"
,ir .

[61 ssl -31

You might also like