Nov 2024
Nov 2024
a) What is ADT?
g) Give best case and worst case time complexity of selection sort.
i) What is stack?
P.T.O.
Q2) Attempt any Four of the following: [4 × 2 = 8]
a) Explain the need of data structures.
b) Write a short note on Divide and conquer strategy.
c) What is doubly linked list? Write its node structure.
d) Convert following infix expression to equivalent prefix and postfix
rotation: (A+B) * C - D
e) Differentiate between linear queue and circular queue.
Q3) Attempt any Two of the following: [2 × 4 = 8]
a) Write a 'C' function for implementing binary search algorithm.
b) Write a 'C' function to insert element in singly linked list (by position).
c) Write a 'C' function to reverse a string using stack.
Q4) Attempt any Two of the following: [2 × 4 = 8]
a) Sort the following elements using bubble sort method: 58, 12, 23, 65, 89,
41, 72, 34
b) Evaluate the following postfix expression:
xy + z - wv* / (Let x = 6, y = 4, z = 2, w = 3, v = 2)
c) Define data structure and explain various types of data structures in
detail.
Q5) Attempt any One of the following: [1 × 3 =3]
JJJ
[6328]-31 2
Total No. of Questions : 5] SEAT No. :
P.T.O.
Q2) Attempt any Four of the following: [4 × 2 = 8]
a) State and explain any two framework activities of Software Engineering.
b) Write Advantages of RAD Model.
c) List the elements of analysis model.
d) What is Refactor? Explain with example.
e) Write & explain five principles of active agility.
JJJ
[6328]-32 2
Total No. of Questions : 3] SEAT No. :
[6328]-33
S.Y. B.Sc. (Computer Science)
MATHEMATICS (Paper - II)
MTC-231 : Groups and Coding Theory
(Rev. 2019) (23221) (Semester - III)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Non - programmable scientific calculator is allowed.
a) Find gcd of 3997 and 2947. Also find integers m and n such that,
(3997,2947) = m (3997) + n (2947).
b) i) Let R be a relation on A= {1,2,3} defined as, R = {(1,2) (2,3)}.
Obtain transitive closure R*.
ii) Determine the group code eH : B2 B5 whose given purity check
matrix is,
1 1 0
0 1 1
H 1 0 0
0 1 0
0 0 1
[6328]-33 2
Total No. of Questions : 3] SEAT No. :
PC-1568 [Total No. of Pages : 2
[6328]-34
S.Y. B.Sc. (Computer Science)
MATHEMATICS
MTC - 232 : Numerical Techniques
(Revised 2019) (Semester - III) (23222) (Paper - II)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Non-programable scientific calculator is allowed.
1 2
e) Evaluate 0 x dx, with h = 0.5 by Trapezoidal rule.
f) Prepare divided difference table for following data.
x: 2 4 9 10
y: 4 56 711 980
P.T.O.
Q2) Attempt any three of the following : [3 × 5 = 15]
a) Derive Newton's forward difference interpolation formula for equal interval.
b) Find a real root of x3 – x2 – 2 = 0 correct to three decimal by false
position method.
c) Find the cubic polynomial by Lagranges formula for following data.
x: 0 1 2 5
y: 2 3 12 147
6 1
d) Evaluate 0 1 x 2 dx by using Simpson's 3 8 th rule (Take h = 1).
dy
e) Given x 2 y with y(0) = 1, find y(0.1) by Euler's modified method.
dx
(Take h = 0.1).
♦♦♦
[6328]-34 2
Total No. of Questions : 5] SEAT No. :
PC-1569 [Total No. of Pages : 2
[6328] - 35
S.Y. B.Sc. (Computer Science)
ELECTRONICS
ELC - 231 : Microcontroller Architecture and Programming
(Semester - III) (Paper - I) (23321) (Revised 2019)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) Q.1 is compulsory.
2) Solve any three questions from Q.2 to Q.5.
3) Figures to the right indicate full marks.
4) Neat diagrams must be drawn wherever necessary.
5) Use of calculator is allowed.
P.T.O.
Q3) Answer the following : [2 × 5 = 10]
a) Explain any five types of instructions used in 8051 microcontroller with
suitable example?
b) Draw bit format of IP (Interrupt Priority) register and explain function of
each bit?
JJJ
[6328] - 35 2
Total No. of Questions : 5] SEAT No. :
PC-1570 [Total No. of Pages : 2
[6328] - 36
S.Y.B.Sc (Computer Science)
ELECTRONICS SCIENCE
ELC - 232 : Digital Communication and Networking
(Semester - III) (Paper - II) (23322) (Revised 2019 Pattern)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) Q.1 is compulsory.
2) Solve any three questions from Q.2 to Q.5.
3) Figures to the right indicate full marks.
4) Neat diagrams must be drawn wherever necessary.
5) Use of calculator is allowed.
P.T.O.
Q4) Answer the following. [2 × 5 = 10]
a) Draw and explain Block diagram of generalised electronic communication
system.
b) Explain with necessary block diagram of Time Division Multiplexing
(TDM).
Q5) Write a short note on any four of the following. [4 × 2.5 = 10]
a) External Noise
b) Need of Modulation
c) FDM
d) Token Passing?
e) Ethernet.
f) TCP/IP
JJJ
[6328] - 36 2
Total No. of Questions : 5] SEAT No. :
PC1571 [Total No. of Pages : 2
[6328]-37
S.Y. B.C.A./B.Sc. (Computer Science)/(Biotech.)/(Animation)/
(Hospitality Studies)/(Cyber and Digital Science)
AECC - I : ENVIRONMENTAL AWARENESS
(Revised 2019 Pattern) (Semester - III) (23921)
P.T.O.
Total No. of Questions : 5]
PC1571
[6328]-37
S.Y. B.C.A./B.Sc. (Computer Science)/(Biotech.)/(Animation)/
(Hospitality Studies)/(Cyber and Digital Science)
AECC - I : ENVIRONMENTAL AWARENESS
(Revised 2019 Pattern) (Semester - III) (23921)
(‘amR>r ê$nm§Va)
doi : 2 Vmg] [ EHy$U JwU : 35
gyMZm …- 1) àíZ H«$. 1 A{Zdm¶© Amho.
2) àíZ H«$. 2 Vo 5 ‘ܶo H$moUVohr VrZ àíZ gmoS>dm.
3) àíZ H«$. 2 Vo 5 ¶m§Zm g‘mZ JwU AmhoV.
i) What is a Bucket?
P.T.O.
Q2) Attempt any Four of the following: [4 × 2 = 8]
a) What do you mean by Huffman Encoding?
b) Write a short note on B-tree.
c) Define:
i) Height of tree ii) Siblings
d) Draw adjacency list of following graph.
a) Write the conditions and rules that red black tree must be satisfied.
JJJ
[6328]-41 2
Total No. of Questions : 5] SEAT No. :
d) Define subnetting.
P.T.O.
Q2) Attempt any Four of the following: (out of five) [4 × 2 = 8]
a) IF the bandwidth of a channel is 5 kbps, how long does it take to transmit
a data frame of 100000 bits?
b) What are the types of standards?
c) Write Shannon's formula for noisy channel.
d) Find out class, netid and hostid of following IP address-126.26.22.2
e) "UDP is faster than TCP", Comment.
JJJ
[6328]-42 2
Total No. of Questions : 3] SEAT No. :
PC-1574 [Total No. of Pages : 3
[6328]-43
S.Y. B.Sc. (Computer Science)
MATHEMATICS
MTC-241 : Computational Geometry
(Revised 2019 Pattern) (Semester - IV) (24221)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Non-programmable, scientific calculator is allowed.
é 3 2 ù
ê 0 0úú
ê 2 4
ê ú
ê 1 ú
ê 0 0 0ú
ê 2 ú
ê ú
ê 1 - 6 ú
ê 0 0ú
ê 2 4 ú
ê ú
êë 0 0 0 1úû
P.T.O.
e) Write the matrix of perspective projection on X = 0 plane from centre of
projection at (–7, 0, 0).
g) Write the transformation matrix for the rotation about x-axis through an
angle 60°.
b) Find the combined transformation matrix and apply it on the triangle with
vertices A(1 2], B[3 –1], C[2 1]. The sequence of transformation is given
below :
c) Consider the line with direction ratios 2, 3, 3 and passing through origin
(0, 0, 0). Determine the angles through which the line should be rotated
about x-axis and then about y-axis, so that it coincides with z-axis.
d) Obtain three uniformly spaced points in the first quadrant on the circle
x2 + y2 = 1.
[6328]-43 2
Q3) Attempt any two of the following : [2 × 5 = 10]
a) Find the parametric equation of a Be'zier curve determined by control
points B0[1 0], B1[2 3] and B2[4 1]. Also find position vector of the
points on the curve corresponding to parametric valve t = 0.1, 0.2.
b) Find the combined transformation matrix for reflection through the line
y = –4. Apply it to the position vector [–1 2].
c) obtain isometric projection of the line segment of the points A[1 –2 1]
and B[3 1 –6] for > 0 and > 0.
[6328]-43 3
Total No. of Questions : 3] SEAT No. :
PC-1575 [Total No. of Pages : 4
[6328]-44
S.Y. B.Sc. (Computer Science)
MATHEMATICS
MTC-242 : Operation Research
(Revised 2019 Pattern) (Semester - IV) (24222)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicate full marks.
P.T.O.
e) Obtain initial basic feasible solution by North West corner rule for following
transportation problem.
Destination
Origin D1 D2 D3 Supply
O1 1 2 3 1
O2 4 5 6 2
O3 7 8 9 3
Demand 3 2 1
I II III
A - 2 3
B 3 - 1
C 2 1 -
Max Z = 4x + 10y
Subject to
2x + y < 10
2x + 5y < 20
2x + 3y < 18
x, y > 0
[6328]-44 2
b) Obtain initial basic feasible solution by least cost method for following.
D1 D2 D3 D4 Supply
A 5 2 4 3 22
B 4 8 1 6 15
C 4 6 7 5 8
Demand 7 12 17 9
c) Obtain initial basic feasible solution by vogels approximation method for
following.
Destination
Origin D1 D2 D3 D4 Supply
O1 2 3 11 7 6
O2 1 0 6 1 1
O3 5 8 15 9 10
Demand 7 5 3 2
d) Solve the following Assignment problem for minimization.
I II III IV
A 16 10 14 11
B 14 11 15 15
C 15 15 13 12
D 13 12 14 15
e) Solve the following Assignment problem for maximization.
A B C D
I 2 3 4 5
II 4 5 6 7
III 7 8 9 8
IV 3 5 8 4
[6328]-44 3
Q3) Attempt any one of the following : [1 × 10 = 10]
Subject to
y1 + y2 > 5
y1 + 2y2 > 6
y1, y2 > 0
6 3 5 4
12 1 9
5 9 2 7
15
5 7 8 6
7 1
[6328]-44 4
Total No. of Questions : 5] SEAT No. :
PC-1576 [Total No. of Pages : 2
[6328] - 45
S.Y.B.Sc. (Computer Science)
ELECTRONICS SCIENCE
ELC-241: Embedded System Design
(Revised 2019 Pattern) (Semester - IV) (Paper - I) (24321)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) Q.No. 1 is compulsory
2) Solve any three questions from Q. 2 to Q. 5.
3) Figures to the right indicate full marks.
4) Neat diagrams must be drawn whenever necessary.
5) Use of calculotor is allowed.
P.T.O.
Q2) Answer the following : [2 × 5 = 10]
Q5) Write short note on (any four) of the following : [4 × 2.5 = 10]
f) Wi - Fi
[6328]-45 2
Total No. of Questions : 5] SEAT No. :
PC-1577 [Total No. of Pages : 2
[6328] - 46
S.Y. B.Sc. (Computer Sciences)
ELECTRONICS
ELC-242: Wireless Communication and Internet of Things
(Revised 2019 Pattern) (Semester - IV) (Paper - II) (24322)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) Q.No. 1 is compulsory.
2) Solve any three questions from Q. 2 to Q. 5.
3) Figures to the right indicate full marks.
4) Use of calculator is allowed.
Q1) Answer the following in one or two sentence each (any five) : [5 × 1 = 5]
a) What is cluster in cellular telephony?
P.T.O.
Q2) Answer the following : [2 × 5 = 10]
Q5) Write short note on (any four) of the following : [4 × 2.5 = 10]
a) Z-wave architecture.
b) NB - IoT
d) Sigfox.
e) ZigBee devices
[6328]-46 2
Total No. of Questions : 5] SEAT No. :
PC1578 [Total No. of Pages : 4
[6328]-47
S.Y. B.C.A./B.Sc. (Computer Science)/(Biotech.)/(Animation)/
(Hospitality Studies)/(Cyber and Digital Science)
AECC-I : ENVIRONMENTAL AWARENESS - II
(Revised 2019 Pattern) (Semester - IV) (24921)
P.T.O.
Q4) Answer the following.
d) Earthquake [2½]
[6328]-47 2
Total No. of Questions : 5]
PC1578
[6328]-47
S.Y. B.C.A./B.Sc. (Computer Science)/(Biotech.)/(Animation)/
(Hospitality Studies)/(Cyber and Digital Science)
AECC-I : ENVIRONMENTAL AWARENESS - II
(Revised 2019 Pattern) (Semester - IV) (24921)
(‘amR>r ê$nm§Va)
doi : 2 Vmg] [ EHy$U JwU : 35
gyMZm …- 1) àíZ H«$. 1 A{Zdm¶© Amho.
2) àíZ H«$. 2 Vo 5 ‘ܶo H$moUVohr VrZ àíZ gmoS>dm.
3) àíZ H«$. 2 Vo 5 ¶m§Zm g‘mZ JwU AmhoV.
[6328]-47 3
à. 4) Imbrb àíZmMo CÎmao X²¶m.
A) {MnH$mo MidirMo dU©Z H$am. [6]
[6328]-47 4
Total No. of Questions : 5] SEAT No. :
PC-1579 [Total No. of Pages : 2
[6328]-51
T.Y. B.Sc.
COMPUTER SCIENCE
CS - 351 : Operating Systems - I
(Revised 2019) (Semester - V) (New CBCS) (Paper - I)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Assume suitable data, if necessary.
♦♦♦
[6328]-51 2
Total No. of Questions : 5] SEAT No. :
PC-1581 [Total No. of Pages : 2
[6328]-53
T.Y. B.Sc.
COMPUTER SCIENCE
CS-353 : Web Technologies - I
(Revised 2019) (Semester - V)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicate full marks.
[6328]-53 2
Total No. of Questions : 5] SEAT No. :
PC1582 [Total No. of Pages : 2
[6328]-54
T.Y.B.Sc.
COMPUTER SCIENCE
CS-354 : Foundations of Data Science
(Revised 2019 Pattern) (Semester-V)
d) What is outlier?
e) Define variance.
eeee
[6327]-143 2
Total No. of Questions : 5] SEAT No. :
PC-1583 [Total No. of Pages : 2
[6328]-55
T.Y. B.Sc (Computer Science)
CS - 355 : OBJECT-ORIENTED PROGRAMMING USING
JAVA - I
(Revised 2019) (Semester - V)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) Answer all Questions.
2) Figures to the right indicate full marks.
Employee Info. – ×
ENo
EName
Salary
Display Clear
[6328] - 55 2
Total No. of Questions : 5] SEAT No. :
[6328]-56
T.Y. B.Sc.
COMPUTER SCIENCE
CS-356 : Theoretical Computer Science
(Revised 2019 Pattern) (CBCS) (Semester - V)
P.T.O.
Q2) Attempt any Four of the following (Out of Five) : [4 × 2 = 8]
a) Differentiate between FA and PDA.
b) Construct FA for regular expression.
( (a+b)* + abb)*
c) Construct CFG for language L which accepts set of all palindromes
over a,b
d) Define Turing Machine.
e) Construct minimal DFA for the following.
[6328]-56 2
Q4) Attempt any Two of the following (Out of Three) [2 × 4 = 8]
a) Construct a PDA for the language L= {an bn | n>=1}.
b) Construct a Moore machine which outputs even or odd according to
number of a's encountered is even or odd.
c) Explain Left linear grammar and Right linear grammar with example.
[6328]-56 3
Total No. of Questions : 5] SEAT No. :
PC1585 [6328]-57 [Total No. of Pages : 2
T.Y.B.Sc. (C.S.)
CS - 3510 : PYTHON PROGRAMMING
(Revised 2019 Pattern) (Semester-V)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) All questions are compulsory.
2) Figures to the right indicate full marks.
[6328]-57 1 P.T.O.
Q3) Attempt any Two of the following : [2×4=8]
a) Write a python program to find sum of natural numbers.
b) Write a python function to check whether a number is perfect or not.
c) Write a python program to convert a list to a tuple.
[6328]-57 2
Total No. of Questions : 5] SEAT No. :
PC1586 [Total No. of Pages : 2
[6328]-58
T.Y. B.Sc.
COMPUTER SCIENCE
CS-3511 : Blockchain Technology
(Revised 2019 Pattern) (CBCS) (Semester - V)
b) What is gas?
e) Define nonce.
h) What is IPO?
j) What is confidentiality?
P.T.O.
Q2) Attempt any four of the following (out of five) : [4×2=8]
a) What is Ether? List any two denominations in wei?
b) What is consortium and private blockchain?
c) List and explain types of variables in solidity.
d) How nonce useful in hashing?
e) Define stream cipher and block cipher.
[6328]-58 2
Total No. of Questions : 5] SEAT No. :
[6328]-61
T.Y. B.Sc.
COMPUTER SCIENCE
CS-361 : Operating Systems-II
(Rev. 2019 Pattern) (Semester - VI)
b) Define starvation.
h) Define deadlock.
P.T.O.
Q2) Attempt any Four of the following : [4 × 2 = 8]
a) Write features of mobile operating system.
b) List the different types of Distributed systems.
c) Explain any two Disk performance parameters.
d) Explain resource allocation Graph.
e) What do you mean by absolute path and relative path.
[6328]-61 2
Q5) Attempt any one of the following: [1×3=3]
a) Write Advantages and Disadvantage of Distributed systems.
b) Assume there are total 200 tracks are presents on each surface of the
disk. If request quecee is 30,140,20,170,60,190 and initial position of the
head is 120. Apply following disk scheduling Algorithms & calculate
total head movement.
i) FCFS
ii) SSTF
[6328]-61 3
Total No. of Questions : 5] SEAT No. :
PC-1588 [Total No. of Pages : 2
[6328]-62
T.Y. B.Sc. (Computer Science)
CS - 362 : SOFTWARE TESTING
(Rev-2019) (Semester - VI)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Assume suitable data, if necessary.
P.T.O.
Q3) Attempt any Two of the following : [2 × 4 = 8]
a) Describe test case template with the help of example.
b) Explain the process of load testing. Give the examples of load testing.
c) Differentiate between testing and debugging
[6328]-62 2
Total No. of Questions : 5] SEAT No. :
P.T.O.
Q3) Attempt any Two of the following : [2 × 4 = 8]
a) Explain working with Database in Codelgniter.
b) Explain Pop-up boxes in JavaScript.
c) How to get SERVER information? Explain with example.
[6328]-63 2
Total No. of Questions : 5] SEAT No. :
PC-1590 [Total No. of Pages : 2
[6328]-64
T.Y. B.Sc.
COMPUTER SCIENCE
CS-364 : Data Analytics
(Revised 2019 Pattern) (CBCS) (Semester - VI)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicate full marks.
[6328]-64 2
Total No. of Questions : 5] SEAT No. :
PC-1591 [Total No. of Pages : 2
[6328]-65
T.Y. B.Sc.
COMPUTER SCIENCE
CS - 365 : Object Oriented Programming Using Java - II
(Revised 2019) (Semester - VI)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) Answer all questions.
2) Figures to the right indicate full marks.
P.T.O.
Q3) Attempt any two of the following (out of three) : [2 × 4 = 8]
a) Write a JSP program to accept student name, address & class & display
it on next page in tabular format.
b) Write a java program to display the odd numbers between 1 to 100. Each
number should display after 5 second. (Use sleep())
c) Write a java program to accept the details of student (Rno, Name,
Percentage) from user & store it into the database using prepared statement
interface.
♦♦♦
[6328]-65 2
Total No. of Questions : 5] SEAT No. :
PC-1592 [Total No. of Pages : 3
[6328]-66
T.Y. B.Sc. (Computer Science)
CS-366 : COMPILER CONSTRUCTION
(Revised 2019 Pattern) (CBCS) (Semester - VI)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Neat diagrams must be drawn wherever necessary.
4) Assume suitable data if necessary.
e) What is a parser?
f) LALR is the best bottom-up parsing method state & Justify True / False.
j) What is sentinel?
P.T.O.
Q2) Attempt any Four of the following : [4 × 2 = 8]
a) Write short note on S-attributed grammar.
b) Find FIRST and FOLLOW of the following grammar.
S AB
A BS|b|E
B bSB'|SB'|aB'
B' SSB'|E
c) What is the basic and auxiliary tasks of a lexical analyzer?
d) Explain the value number method to construct DAG with an example.
e) Construct the local & non-local variable scope or accessibility table for
the following blocks A, B, C, D
A
X, Y, Z : Integer
B a : real
C H, Z : Integer
D i, j : integer
[6328]-66 2
Q4) Attempt any Two of the following : [2 × 4 = 8]
a) Check whether the following grammar is LL(1) or not
A aAa|Ab|AA|b
b) Check whether the given grammar is LR(1) or not.
E E + T|T
T T * F|F
F id
c) Check whether the following grammar is operator precedence or not?
E E + E | E * E | (E) | id.
also construct operator precodence relation table.
[6328]-66 3
Total No. of Questions : 5] SEAT No. :
PC1593 [Total No. of Pages : 2
[6328]-67
T.Y. B.Sc. (Computer Science)
CS-3610: SOFTWARE TESTING AND TOOLS
(Revised 2019 Pattern) (Semester - VI)
j) What is selenium?
P.T.O.
Q2) Attempt any Four of following. (Out of Five) [4×2=8]
a) Define bug and explain different software bug.
b) Explain goal of loop coverage testing.
c) Explain exit criteria in test planning.
d) Define any two root causes of defect.
e) Define any two limitation of manual testing.
[6328]-67 2
Total No. of Questions : 4] SEAT No. :
PC5146 [Total No. of Pages : 2
[6328]-71
S.Y. B.Sc. (Computer Science)
CS - 221 : Object Oriented Concepts Using C++
(2013 Revised Pattern) (Semester - II) (22121)
[6328]-71 2