Totul No. ol Questlcm.1 : S) SEAT No.:!..__ _ ___.

PS137 [Total No. ol Pages : 2

[5823)-301
S. Y. B.Sc. (Computer Science)
CS-231 :DATASTRUCTIJRESANDALGORITHMS-1
(2019 Pattern) (Semester• Ill) (Paper-I)
Time : 2 llaun I /!tlax.Marks:35
lnrrrw:tians ta the candldaus:
l) All q11estl1m,r au camp11/sary.
2) Flg11res 1/J the right lndlcate.r /111/ wwrks.
3) Nital diagrams must bedraw11 wl1mel't!r nece.r.rary.

Ql) Auerupt any 8ofthe following. [8:><1=8]

a) Define Data object.
b) Define in-place sorting.
c) What is circular linked list?
d) State the principle used i.n 4-queen problem.
e) Define Queue.
f) What is time complexity?
g) What is best case & worst case time complexity of merge son algorithm?
h) " Linked list can be accessed randomly" state true/false. Justify.
i) Round-robin algorithm is example of which type of queue?
J) List any two applications of stack.

Q2) Attemptany4oflhefollowing. [4x2=8)

a) Define Big Oh (0) and Big Omega (Q) Notations.
b) Define Array. List of an array.
c) Differentiate between singly li nked list and doubly linked list.
d) Convert following expression to equivalent postfix and prefix notation.
(A+B)>1<C-{D-E) "(F+G)
e) What are operations perfonned on dequeue?

P.T.O.
Q3) Attempt any two of the following: [2x4=8)
a) Define Data structure and explain types of Data struclUre.
b) Sort the followi ng data using bubble sort method:
30. 40, 10. 50. 25, 35, 15
c) Write a ·c· fwict.ion 10 create doubly linked list.

Q4) Attempt any two of the following: [2x4=8]

a) Show the stack contents and output while converting following infix
expression 10 postfix expression. A/8/\C+D•E--A>1<C
b) What is linear queue? How to implement it? Explain in detai l.
c) List the variants of sequential search. Explain any one with an example.

QS) Attempt any one of the following: [Jx3=3)

a) List advantageolJS & disadvantageous of circular queue.
b) Write a short noce on generaJjzed linked list.

•••• •••• ••••

[S823)-301 2
Total No. of Questions : 51 SEAT No. =I.__ _ __,
P5138 (Total No. of Pages : 2
(5823)-302
S.Y. B.Sc. (Computer Science)
CS -232: SOFIWARE ENGINEERING
(New CBCS 2019 Pattern) (Semester-Im (Paper-II)
nme :2 Houn] {Max. Marks : JS
lnstr111:tions to the candidates:
1) All questions are compulsory.
2) Figures to the right indicates full 111Mb.
3) Assume suitable dala if nttessary.

QJ) Attempt any Eight of the followin g. [8x l=8]

a) Define process Flow.
b) List any two agile principles.
c) What are the differe nt building blocks of UML?
d) Write any two purpose.,; scnied by SRS.
e) Define abstraction.
f) List the advantages of waterfall model.
g) What is requirement validation?
h) Write the purpose of activity diagram.
i) List any two umbrella activities of software process.
j) DefineArtifacts.

Q2) Attempt any Four of the following. (4x2=8)

a) What is Functional inde pendancc? Which qualitative criteria is applied
to assessed independance.
b) Define diagrams. Write cla,;sifica1ion of UML diagrams.
c) List the elements of A ndysis model.
d) Write the role of scrum.
e) Write advantages of RAD model.

QJ) Attempt any two of the following. [2x4==8)

a) Explain spiral model in detail.
b) Explain different approaches for req uirements elicitation.
c) Draw UML use ca.,e cliagram foconline shopping. (credi t card proces.,ing)

P.T.O.
 Q4) Al tempt any Two of the following. [2x4=8J
a) Explai n pha.~es of xp process with suitable diagram.
b) Draw UMLclass diagram for railway reservation system.
c) Define unified process. Explain phases of unified process.

QS) Altempt .any Oneofthe following. [lx3=3)

a) Explai n types of design panerns.
b) Explai n the human foctors COJt'lidered during agile soft ware development.

•••• •••
• ••••

[5823)-302 2

Ill
Total No. or Qul"ltlons: SI
SEAT No. :~I____ J

Pll88 [Total No. of Pages : 2

[6055)-101
S.Y.BSc. (Computer Science)
CS· 231: DATASI'RUCTURES AND ALGORITHMS -1
(2019 Pattern) (Seme;ter - III) (23121)
1ime : 2 Hours/ (Max. Marks : JS
lns1r11cti11ns to tht candidates:
1) All questi,ms au COlflp11/.w ry.
2) Fig11rts 1,1 the right Indicates full marks.
3) Ntat diagrams must be drawn whtne..,, 11~sary.

QJ) Anernpt any EIGHT of the following. rsxt=BJ

a) Define Data Object.
b) Whal are the advantages of ADT'!
c) Write any two applications of Que ue.
d) What is lop of the stack?

e) Stale True or False. "Queue Follows Last in First out (LIFO) Order".
f) Write the time complexity of merge sort.
g) What is stack underflow?
h) Define space complexity.
~ Whal is circular queue'!
j) Whic h data struct ure is 11-~ed in recursion?

Q2) Auempt anyfourofthefollowing. [4x2=81

a) Whal are different a~ymptotic no1a1ions?
b) Lisi the operations performed on dequeue.
c) Write the postfix expression of the following(A+B) * (C-D).
d) Write node structure of singly I inked list.
e) Give any two applications of stac k.

P.T.O.
 Q3) A11emp1 any TWO of the following: f2 x4=8]
a) Write a •c· fllllCtion for deleting element from singly linked list.
b) Son the following elements using insertion sorting method.
25. l5, 45, 85, 75, 55, 35, 65.
c) Write a •c· fllllCtion 10 reverse singly Linked list.

Q4) Attempt any Iwoof the following: (2x4=8)

a) Explain with example- Generalized linked lisi.
b) Write ·c·function for implemcming Linear search algorithm.
c) Evaluate the following postfix expression AB *C-(Lel A= 5. B=6. C = 4 ).

QS) Attempt anyone of the following: [lx3=3)

a) Write a short DOie on priority queue.
b) Define the following terms.
i) Ti me complexi Iy.
ii) Doubly Ended Queue.

0 0 0

[605S]-101 2

II
Total No. or Questlom : SI
SEAT No. =I..._ _ ___,
P1289 !Total Ne~ of Pages : 2
[605S)-102
S. Y.B.Sc. (Computer Science)
CS· 232 : SOFI'WARE ENGINEERING
(2Ul9 CHCS Pattern) (Semester· ill) (23U2)
Time : 2 Ho11rs/ {Max. Marks: 35
lnstr11ctions to the candidates:
I ) A.II q11ations are comp11lsory.
2) Neat diagrams m11st IN, drawn if necasary.

QJ) At1emp1any EIGHT of the following. [8x1=8)

a) What is Software Panems"

b) Define: Software Engineering.

c) Explain the purpose of sequence model.
d) Define: Dependency.
e) What is agility?
O What is the importance of design model?
g) State in brief for separatio n of concerns.
h) Explain requirement validation.
~ What is meant by XP?
j) Define : protocyping.

Q2) An empl any four of the followi ng. [4x2=8)

a) Explain in brief about waterfall model.
b) S1n1e any 1wo symbols wi th a n example for developing use ca~es.
c) Statethedisadvamages Incremental model.
d) What is difference between system and application software?
e) Explain the purpose of class diagram.
P.T.O.
Q3) AnempianyTWOofthefollowing: [2x4=8)
a) Lisi the acti vities of spiral model in detail.
b) Explain any four symbols of class diagram.
c) Draw an activity diagram forAirline reservation system.

Q4) A11emp1anytwooflhefollowing: [2x4=8)

a) Explain the purposes served by software requirement specification.
b) Write in detail for Dynamic system development model.
c) Explain asof1ware process framework in detaiJ.

QS) ALtempi anyoneofthefollowing: (lx3=3)

a) Draw a sequence diagram for student registration syste m.
b) State any six attributes of good software.

0 0 0

[6055]-102 2
Total No. or Questions : 51 SEAT No. =I.______,
PA-1010 [Total No. or Pages : 2
[5902)-31
S.Y.B.Sc. (Computer Science)
CS 2.ll : DATA STRUCTURES AND ALGORITHMS· I
(2019 CBCS Pattern) (Semester - ill) (2.ll21)
Time: 2 Hours I {Max. Marks : JS
lnstrnctions to the candidatn:
1) All quntions au compulsory
1) Figures to the right indicau full inarks.
J) Neat diagrams must be drawn whutFf!T nttrssary.
J) Your answers wm be ,alun as a ••hole.

Ql) Attempt any Eight of the following. [8xl=8]

a) Define Data Object.
b) Defioe stable sorting.
c) List Linear search variations.
d) What is time complexity of merge son?
e) Defioe the term null list.
O Write any two applications of linked Jjs1.
g) Write oode structure of doubly linked list.
h) What is Top of the stack?
i) Define Recursion.
j) Whal is circula, queue ?

Q2) Attempt any Four of the following. [4x2=8]

a) Describe the 1en11 ADT.
b) What is the best case and worst case effic iency of quick sort?
c) What is divide and conquer strategy?
d) Justi fy true or false: "'A )joked lis t can o nly be traversed sequenti ally".
e) Defioe the following terms.
i) Stack overflow.

ii) Stack underflow.

P.T.0.
 Q3) At1emp1 any lWO of 1he following. [.Zx4=8)

a) Wri1e a program to search an e.lemem using linear search algorithm.

b) Wri1e a C funclion 10 reverse a siring using stack.
c) Wri1e a C func1ion 10 delele u node from singly circular linked lism al any
position.

Q4) Anempt any lWO of the following. [2x4=8)

a) Sor1 1he folJowing elements using bubble sort algorithm.

89 29 39 79 59 49 69 19
b) Convert the following infix expression i1110 postfix expression.
P*Q+R /S- T
c) Define Dcque. Lisi 1ypes of Dequc and explain any 1wo operations
perfonncd on Deque.

QS) A11emp1 any ONE of the following. [Ix3=3)

a) Define the following terms.
i) Data S1ructure.
ii) Omega Notation.
iii) Time Complexi1y.
b) Write a shori note on priority queue.

•••

(5902)-31 2
Total No. oCQut1Stlcms: SJ SEAT Ne,. =I..._ _ _ _..,
PA-1011 [Total No. or Pages : 2
[5902)-32
S.Y.B.Sc. (Cmnputer Science)
CS 232 : SOFf WARE ENGINEERING
(2019 CBCS Pattern) (Sem~ter - ill) (23122)
Time; ZHaun I IMa:x, Marb .- JS
Jn.rtruaions 10 rite candida1a:
/) A.II q11esti1ms are compulsory.
2) Neat diagram.r must 1w dra•,n If n«asary.

Ql) A11cmp1 any EIGHT of the following. (8 xl=8]

a) What is II unified process?
b) What is ASD?
c) List the goals of Software Engi neering.
d) What is eli citruion?
e) What is nega1ia1ion?
t) Draw a symbol of extend.
g) Define: Association.
h) Li~t of UML diagrams (wty Two).
i) What is software design?
p Define: data Abstraction.

Q2) Aucmpt a,ny FOUR of the following. [4 x2=8]

a) What is system software and Application Software?
b) What are the advantages of scrum?
c) What is cla'\.~ a nd object?
d) What is Actor?
e) What are the cle ment~ of design model?

P.T.O.
Q3) Anempt any TWO of the following. [2x4=8J

a) Define tenn~:
i) Agi.le Method
ii) Agile Process
b) Wlnt is soflware requirement specification?
c) What is modularity? Explain its benefits.

Q4) Anempt any TWO of the following. [2x4=8]

a) Explain advaruages and disadvantages of spiral model.
b) Define tenns:
i) Active class
ii) Component
ii) Artifact
iv) Node
c) Describe component diagram in brief and draw a component diagram for
on.line shopping.

QS) A11emp1 any ONE. (lx3=3]

a) Explain any three notation of activity diagram with each notalioo symbols.
b) Explain waterfall model with diagram.

•••

[S902)-32 2