Total No. of Questions : 5] SEAT No.

:
P6390 [Total No. of Pages : 2
[6155]-51
T.Y. B.Sc. (Computer Science)
CS-351 : OPERATING SYSTEMS-I
(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.
3) Assume suitable data if necessary.

Q1) Attempt any EIGHT of the following. [8×1=8]

a) Define I/O bound process.
b) What is the purpose of fork ( ) system call?
c) What is Bootstrap Loader?
d) Define context switch.
e) “Priority scheduling suffers from starvation”, True/False Justify.
f) What is Mutual Exclusion.
g) What is race condition?
h) Define Limit register?
i) What is Frame?
j) List the advantages of open-source operating system?

Q2) Attempt any FOUR of the following. [4×2=8]

a) What is critical section problem?
b) What is the role of dispatcher?
c) Write the benefits of virtual memory?
d) Explain any two advantages of multithreding?
e) Write the system calls under the category of process management?

P.T.O.
Q3) Attempt any TWO of the following. [2×4=8]
a) What is process? Explain in different types of process states?
b) What is fragmentation? Explain the types of Fragmentation.
c) Consider the following set of processes with the length of CPU burst
time and arrival time given in milliseconds.
Process Burst time Arrival time
P1 4 2
P2 6 0
P3 2 1
Illustrate the execution of these processes using Round Robin (RR) CPU
scheduling algorithm consider the time quantum is 3. calculate average
waiting time and average turn-around time. Also draw the Gantt chart.

Q4) Attempt any TWO of the following. [2×4=8]

a) What is semaphore? Explain the dining philosopher’s problem.
b) Which are the different types of schedulers? Explain the working of short-
term scheduler?
c) Consider the following page replacement
String : 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 3
How many page faults would occur for the following page replacement
algorithms assuming three frames?
i) FIFO
ii) LRU

Q5) Attempt any ONE of the following. [1×3=3]

a) Write a short note on MMU.
e) Explain Layered structure of the operating system.



[6155]-51 2
Total No. of Questions : 5] SEAT No. :
P-6391 [Total No. of Pages : 2

[6155]-52
T.Y. B.Sc. (Computer Science)
CS - 352 : COMPUTER NETWORKS - II
(2019 Pattern) (CBCS) (Semester - V)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Draw neat and labelled diagrams wherever necessary.
3) Use of calculators is not allowed.

Q1) Attempt any EIGHT of the following (Out of TEN). [8 × 1 = 8]

a) What is Jitter?
b) Name the two parts of Email?
c) Why MIME protocol is required?
d) List the types of MPEG frames.
e) What is frequency masking?
f) What do you mean by Proxy firewall?
g) What do you mean by cryptography and cryptoanalysis?
h) List the PGP services.
i) What is the difference between plaintext and cipher text?
j) List the services of user agent.

Q2) Attempt any FOUR of the following (Out of FIVE). [4 × 2 = 8]

a) Explain VPN in detail with example.
b) Distinguish between message integrity and message authentication.
c) What is firewall? Explain its types.
d) Write a short note on message access agent: IMAP & POP.
e) Explain in detail use of FTP and HTTP.
P.T.O.
Q3) Attempt any TWO of the following (Out of THREE). [2 × 4 = 8]
a) Write a short note on DNS.
b) Explain the header format of the authentication header in transport mode.
c) Explain the concept of key rings in PGP.

Q4) Attempt any TWO of the following (Out of THREE). [2 × 4 = 8]

a) Explain in detail RTCP-Message types.
b) Explain substitution cipher with example.
c) Explain how a packet filter firewall filters packets.

Q5) Attempt any ONE of the following (Out of TWO). [1 × 3 = 3]

a) Write a short note on Real time interactive audio/video-.
b) Using columnar transposition convert the ciphertext
“STMTCRCCOVUSITEEYPEHCILDIIOAAE” to plain text. The key
is CIPHER.



[6155]-52 2
Total No. of Questions : 5] SEAT No. :
P6392 [Total No. of Pages : 3
[6155]-53
T.Y.B.Sc.
COMPUTER SCIENCE
CS-353 : Web Technologies - I
(2019 Pattern) (Semester - V) (CBCS)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) All questions are compulsory.
2) Figures to the right indicate full marks.

Q1) Attempt any EIGHT of the following. [8×1=8]

a) Which HTML tag is used to create hyperlink?
b) Define Web Browser.
c) What is the use of = = and = = =operators in PHP?
d) Which keyword is used for creating a function?
e) How to check if given variable is array or not.
f) How to read file in PHP?
g) What is POP3?
h) What is associative array?
i) What is use fileatime() function?
j) Which function is used to get a file name out of a file path?

Q2) Attempt any FOUR of the following. [4×2=8]

a) Find the Output
<?php
$city= ‘pune’;
$string = ‘I like $city very much!’;
echo $string;
?>

P.T.O.
 b) Find the Output

<?php

$file=fopen(“samp1e.txt”, “w”);

echo fwrite($file, “Hello! How are you Rahul?”);

fclose($file);

?>

c) Find output of following code:

<?php

$a= “1E3 points of light” + 1;

var_dump($a);

?>

d) What is use of var_dump( ) function?

e) What is use of mail( ) function? Give syntax of it.

Q3) Attempt any TWO of the following. [2×4=8]

a) Explain two syntax and proper example of for each loop.

b) Explain types of strings in PHP.

c) How to get array of keys and array of values from an associative

array? Explain with proper example.

[6155]-53 2
Q4) Attempt any TWO of the following. [2×4=8]

a) Create HTML form for accepting employee number, name, age,

gender. Use proper controls of HTML.

b) Write a PHP program to read two arrays of integer values merge

two arrays and display only unique values in it.

c) Consider the following relational database: student (rollno, name,

age) and marks (rollno, mark1, mark2, mark3, total, per). Write a
PHP script which display rollno, name, mark1, mark2, mark3, total
and percentage in tabular format.

Q5) Attempt any ONE of the following. [1×3=3]

a) What is use of pg_fetch_row( ) and pg_fetch_array( ).

b) What are the different types of CSS?



[6155]-53 3
Total No. of Questions : 5] SEAT No. :

P-6393 [Total No. of Pages : 2

[6155]-54
T.Y. B.Sc.
COMPUTER SCIENCE
CS-354 : Foundations of Data Science
(Rev.2019) (CBCS) (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.

Q1) Attempt any eight of the following : [8 × 1 = 8]

a) What do you mean by Primary Data?
b) What do you mean by Data Quality?
c) Define outlier.
d) Define Interquartile range.
e) What do you mean by missing values?
f) What are uses of zip files?
g) What do you mean by XML Files data format?
h) Define data discretization.
i) What is tag cloud?
j) What is visual encoding?

Q2) Attempt any four of the following : [4 × 2 = 8]

a) Explain different applications of Data Science.
b) Explain null and alternate hypothesis.
c) What do you mean by Noisy data? Explain any two causes of noisy
data.
d) What do you mean by data visualization? Give example of any two
data visualization libraries.
e) Explain 3V's of data science.
P.T.O.
Q3) Attempt any two of the following : [2 × 4 = 8]

a) Explain data cube aggregation method in context of data reduction.

b) What is mean, mode, median and range for the following list of values:

24, 29, 24, 25, 24, 27, 25, 32, 24

c) Explain any four data visualization tools.

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

a) Differentiate between structured and unstructured data.

b) What do you mean by Data attributes? Explain types of attributes with

example.

c) How do you visualize geospatial data? Explain in detail.

Q5) Attempt any one of the following : [1 × 3 = 3]

a) What do you mean by Data transformation? Explain strategies of data

transformation.

b) What are the different methods for measuring the data dispersion?



[6155]-54 2
Total No. of Questions : 5] SEAT No. :
P6394 [Total No. of Pages : 2
[6155]-55
T.Y.B.Sc.
COMPUTER SCIENCE
CS - 355 : Object Oriented Programming Using Java - I
(Revised 2019) (CBCS) (Semester - V) (Paper - V)

Time : 2 Hours] [Max. Marks : 35

Instructions to the candidates:
1) All questions are compulsory.
2) Figures to the right indicate full marks.

Q1) Attempt any EIGHT of the following: [8×1=8]

a) A final keyword can not be overriden state true/false and justify.
b) Give the types of access specifiers.
c) Differentiate between Scanner and Buffered Reader class.
d) What is Layout Manager?
e) Write the purpose of this keyword.
f) List any two types of checked Exception.
g) What is listener ? State any two Listeners.
h) What are command line arguments?
i) Differentiate between throw and throws keyword.
j) Write the purpose of jab.

Q2) Attempt any FOUR of the following: [4×2=8]

a) What is constructor? List its types.
b) Differentiate between class variables and instance variables.
c) Write the purpose of abstract keyword.
d) Which class and interface are at topmost position in Exception hierarchy.
e) Give the syntax of J File Chooser class.

P.T.O.
Q3) Attempt any TWO of the following: [2×4=8]
a) Write a java program to delete the files having extension. txt. (Use
command line arguments)
b) Write a java program using swing to accept the details of project (PID, P
Name, duration) from user and display it by clicking on a button.
c) Define an abstract class Shape with abstract method area ( ). Write a java
program to calculate area of Triangle.

Q4) Attempt any TWO of the following: [2×4=8]

a) Write a java program to change the text color of Lable to Red by clicking
on a button.
b) What is inheritance? Explain multilevel inheritance with an example.
c) How to create and access package in a program? Explain with an example.

Q5) Attempt any ONE of the following: [1×3=3]

a) Explain the structure of java program.
b) Explain different types of Dialog Box with an example.



[6155]-55 2
Total No. of Questions : 5] SEAT No. :
P-6395 [Total No. of Pages : 3

[6155]-56
T.Y. B.Sc. (Computer Science)
CS - 356 : THEORETICAL COMPUTER SCIENCE
(2019 Pattern) (CBCS) (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.

Q1) Attempt any Eight of the following (out of Ten) : [8 × 1 = 8]

a) Write the smallest possible string accepted by regular expression.

01 (0 + 1) 01*.

b) State True or False. PDA accepts only non-regular sets.

c) Define ambiguous grammar.

d) What are the types of grammar in Chomsky hierarchy?

e) What is Reduction?

f) State True or False. String consists of only Non-Terminal symbol.

g) Define non-deterministic Turing machine.

h) If A = {  } find the value of | A |.

i) Write down the  -closure of each state from the following FA.

j) State two differences between NFA and DFA.

P.T.O.
Q2) Attempt any Four of the following (out of Five) : [4 × 2 = 8]
a) Explain two methods for defining language. Accepted by PDA.
b) Explain types of regular grammar.
c) Construct FA for regular expression ((1+0)* + 100)*.
d) Differentiate between Moore and Melay Machine.
e) State two differences between TM and LBA.

Q3) Attempt any Two of the following (out of Three) : [2 × 4 = 8]

a) Construct DFA for language which contains all string with exactly 2
consecutive 1's any where.
b) Convert the following CFG into CNF
S  XYX
X  aX/ 
Y  bY/ 
c) Design TM for language
L = {am bn / n  m and m  1}

Q4) Attempt any Two of the following (out of Three) : [2 × 4 = 8]

a) Construct a PDA for the language {w / na (w) = nb (w)} number of a's is
equal to number of b's.
b) Construct Moore machine which outputs even or odd according to
number of a's encounted is even or odd.
c) Construct equivalent DFA for the following NFA.

[6155]-56 2
Q5) Attempt any One of the following (out of Two) : [1 × 3 = 3]
a) Show that L = {On 1n On} is not regular.

b) Eliminate  -production for grammar & also find nullable variable.

S  AB

A  SA/BB/bB
B  b/aA/ 



[6155]-56 3
Total No. of Questions : 5] SEAT No. :
P6396 [Total No. of Pages : 3
[6155]-57
T.Y. B.Sc. (Computer Science)
CS-3510 : PYTHON PROGRAMMING
(Revised 2019 Pattern) (CBCS) (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.
3) Total number of questions are five.

Q1) Attempt any Eight of the following: [8×1=8]

a) What is indentation?

b) Write code to print the elements of the list 11 = [10, 20, 30, 40, 50]

c) What is a slice operator?

d) What is variable-length argument?

e) How to add multiple elements at the end of the list?

f) Explain the remove () method.

g) Write a lambda function to add 10 to a given integer.

h) How to raise an exception with arguments.

i) List the methods of re package.

j) What is a wb mode in file?

Q2) Attempt any four of the following: [4×2=8]

a) What is a package? Explain with example how to create a package.

b) What are the usage of tuples zip (), tuple(), count() and index() functions?

[6155]-57 1 P.T.O.
 c) What is an anonymous function? How to create it? Explain with example.

d) Explain the following loops with example.

i) While
ii) For
e) How to perform input output operations? Explain with example.

Q3) Attempt any Two of the following: [2×4=8]

a) Write a program to accept a string from user and display the string in
reverse order eliminating the letter ‘s’ from the string.
b) Write a program to raise a user defined exception to check if age is less
that 18.
c) Write a Python program to check that a string contains only a certain set
of characters (in this case a-z, A-Z and 0-9).

Q4) Attempt any Two of the following: [2×4=8]

a) Write a Python program to add ‘ing’ at the end of a given string (length
should be at least 3). If the given string already ends with 'ing', add 'ly'
instead. If the string length of the given string is less than 3, leave it
unchanged.
b) Write a Python program to combine values in a list of dictionaries. Sample
data: [{'item': 'item 1', 'amount': 400}, {'item': 'item2', 'amount': 300},
{'item': 'item1', 'amount': 750}]
Expected Output: Counter ({'item1': 1150, 'item2': 300})
c) Write a Python program to extract year, month, date and time using
Lambda.

[6155]-57 2
Q5) Attempt any one of the following: [1×3=3]
a) Check1 = ['Learn', 'Quiz', 'Practice', 'Contribute']
Check2 = check1
Check3 = check1 [:]
Check2[0] = 'Code'
Check3[1] = 'Mcq'
Count = 0
For c in (check 1, check2 check3):
if c[0] == 'Code':
count + = 1
if c[1] == 'Mcq':
count + = 10
print (count)
b) Counter = {}
Def add To Counter (Country):
If country in counter:
Counter [country] + = 1
Else:
Counter [country] = 1
Add To Counter ('China')
Add To Counter ('Japan')
Add To Counter ('china')
Print (len(counter))



[6155]-57 3
Total No. of Questions : 5] SEAT No. :
P-6397 [Total No. Of Pages : 2

[6155]-58
T.Y. B.Sc.
COMPUTER SCIENCE
CS - 3511: Blockchain Technology
(2019 Revised Pattern) (Semester - V) (CBCS)
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.

Q1) Attempt any Eight of the following (out of Ten) : [8 × 1 = 8]

a) What is hash function?

b) Define PoW.

c) What is DApp?

d) What is consensus?

e) What is Nonce?

f) What is Ether?

g) Give the name of crypto currencies where blockchain is used.

h) What is DAO?

i) What is plain text and cipher text?

j) What is a smart contract?

P.T.O.
Q2) Attempt any Four of the following (out of Five) : [4 × 2 = 8]

a) What are the advantages of smart contract?

b) What is hard fork and soft fork?

c) What is PoS? Which blockchain uses PoS?

d) Explain symmetric & asymmetric key cryptography.

e) Explain the structure of blocks in Blockchain.

Q3) Attempt any Two of the following (out of Three) : [2 × 4 = 8]

a) Which are the different types of Blockchain?

b) What are the challenges of Blockchain?

c) Write a short note on ICO.

Q4) Attempt any Two of the following (out of Three) : [2 × 4 = 8]

a) Write a short note on digital signature.

b) Explain the working of mining.

c) Write a short note on Byzentine fault tolerance.

Q5) Attempt any One of the following (out of Two) : [1 × 3 = 3]

a) Which are the different data types in solidity?

b) Differentiate between blockchain and database.

  

[6155]-58 2
Total No. of Questions : 5] SEAT No. :
P-6398 [Total No. of Pages : 2

[6155]-61
T.Y. B.Sc. (Computer Science)
CS361 : OPERATING SYSTEMS - II
(2019 Pattern) (Semester-VI)
Time : 2 Hour] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicates full marks.

Q1) Attempt any Eight of the following. [8×1=8]

a) List all dead lock recovery methods.
b) List file system free space management techniques.
c) What is disk scheduling?
d) What is deadlock?
e) Define object-based architecture.
f) List system architectures.
g) List any Four commercial mobile operating systems.
h) What is kernel?
i) What are the features of mobile operating systems?
j) List the types of distributed systems.

Q2) Attempt any Four of the following. (Out of Five) [4×2=8]

a) What are the goals of distributed systems.
b) Differentiate scan and c-scan disk scheduling.
c) What is ARM?
d) What is native code?
e) Explain resource - allocation graph with example.
P.T.O.
Q3) Attempt any two of the following. (Out of Three) [2×4=8]
a) Consider the following snapshot of system A,B,C,D are the resource
types.
Allocation MAX Available
A B C D A B C D A B C D
P0 0 0 1 2 P0 0 0 1 2 1 5 2 0
P1 1 0 0 0 P1 1 7 5 0
P2 1 3 5 4 P2 2 3 5 6
P3 0 6 3 2 P3 0 6 5 2
P4 0 0 1 4 P4 0 6 5 6
Answer the following questions using Banker's Algorithm:
i) What are the contents of need array?
ii) Is the system in safe state? If yes give safe sequence.
iii) If a request from P1 arrives for (0,4,2,0) can it be granted immediately?
b) Explain the architecture of Android OS.
c) Explain access methods of file system management.

Q4) Attempt any two of the following. (Out of Three) [2×4=8]

a) Differentiate Desktop OS and Mobile OS.
b) Explain the necessary conditions of deadlock with suitable example and
diagram.
c) Write a short note on directory structure.

Q5) Attempt any ONE of the following. (Out of two) [1×3=3]

a) Consider following work queue : 23, 89, 132, 42, 187 & show schedule
using following algorithms :
i) SSTF
ii) SCAN
iii) C-LOOK
Also find total head movements in each algorithm.
b) Differentiate between Android OS and iphone OS.



[6155]-61 2
Total No. of Questions : 5] SEAT No. :
P6399 [Total No. of Pages : 2

[6155]-62
T.Y. B.Sc. (Computer Science)
CS-362 : SOFTWARE TESTING
(Revised 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.

Q1) Attempt the following. [8×1=8]

a) Define debugging.
b) Black Box testing is known as glass box testing. Justify T/F.
c) Write advantages of Load Testing.
d) Write difference between Agile and Traditional testing.
e) Write objective of Spike testing.
f) List any 2 objectives of Software Testing.
g) Define Cyclomatic complexity.
h) Define Test plan.

Q2) Attempt any four of the following: [4×2=8]

a) Explain Top down integration.
b) Write difference between White and Black box testing.
c) List the features of Agile Testing.
d) Write short note on dimension of quality.
e) Write advantages of regression testing.

Q3) Attempt any two of the following: [2×4=8]

a) Explain V-model in detail.
b) Describe basic path testing with example.
c) What is system testing? How it test the system? Also list it’s different
types.

P.T.O.
Q4) Attempt any two of the following: [2×4=8]
a) What is Web application? How it works? Explain diagrammatically.
b) What is unit testing? How it works? Explain with example.
c) What is test case? Explain with example.

Q5) Attempt any one of the following: [1×3=3]

a) Write a difference between Alpha and Beta testing.
b) Write short note on Agile testing Quadrants.

 

[6155]-62 2
Total No. of Questions : 5] SEAT No. :
P-6400 [Total No. of Pages : 2

[6155]-63
T.Y. B.Sc. (Computer Science)
CS-363 : WEB TECHNOLOGIES - II
(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.

Q1) Attempt any EIGHT of the following: [8 × 1 = 8]

a) Enlist the characteristics of XML?
b) What do you mean by sticky form?
c) Which information is stored in $_FILES?
d) Justify True or False - XML Parser cannot alter documents or create new
documents.
e) What is DOM?
f) Give any two applications of AJAX.
g) What is JQuery?
h) What is CodeIgniter?
i) What is the use of XMLHttpRequest object?
j) What is the use of redirect() function in CodeIgniter?

Q2) Attempt any FOUR of the following : [4 × 2 = 8]

a) What is session? How to start the new session?
b) Explain the structure of well-formed XML document.
c) Explain pop-up boxes in JavaScript.
d) Discuss similarities and differences between GET and POST method.
e) Explain asynchronous mode in Ajax.

P.T.O.
Q3) Attempt any TWO of the following : [2 × 4 = 8]
a) What is XML parser? Explain it with its types
b) Explain the workflow of MVC Architecture.
c) Write a note on Ajax Web Application model.

Q4) Attempt any TWO of the following : [2 × 4 = 8]

a) Write a JavaScript code to accept employee’s name and age, validate it
with name and age should not be null and age should be greater than 18
years.
b) Create Doctor table as follows Doctor (dno, dname, experience).Write
Ajax program to print the doctor’s details of selected doctor.
c) Write a PHP Script to keep track of number of times the web page has
been accessed. (Use Session Tracking)

Q5) Attempt any ONE of the following : [1 × 3 = 3]

a) Write XMLsyntax rules.
b) What are JQuery selectors ? Explain in brief.



[6155]-63 2
Total No. of Questions : 5] SEAT No. :
P6401 [Total No. of Pages : 2

[6155]-64
T.Y. B.Sc.
COMPUTER SCIENCE
CS-364 : Data Analytics
(CBCS Rev 2019 Pattern) (Semester
- VI)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) All questions are compulsory.
2) Neat diagrams must be drawn wherever necessary.
3) Figures to the right indicate full marks.

Q1) Attempt any Eight of the following. [8×1=8]

a) State occam’s razor principle.
b) Define Data Analytics
c) What is supervise learning?
d) What is TF-IDF?
e) What is frequent itemset?
f) Define stemming.
g) What is Link prediction?
h) State Applications of AI.
i) State types of logistic regression.
j) Define precision

Q2) Attempt any four of the following: [4×2=8]

a) State types of Machine learning. Explain any one in detail.
b) How Receiver operating characteristic (ROC) curve is created?
c) What is association rule? Give one example.
d) What is Influence Maximization?
e) Explain Knowledge discovery in database (KDD) process.

P.T.O.
Q3) Attempt any two of the following: [2×4=8]
a) Write a short note on community detection.
b) Explain Apriori algorithm.
c) Short note on challenges in social Media Analytics (SMA)

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

a) Explain phases in Natural language processing (NLP).
b) Explain exploratory data analytics.
c) Explain life cycle of social media Analytics.

Q5) Attempt any one of the following: [1×3=3]

a) Consider the following transactional database and find out Frequent
Itemsets using Apriori algorithem with minimum - support = 50%
TID Items - Purchased
T1 I1, I2, I3,
T2 I2, I3, I4
T3 I4, I5
T4 I1, I2, I4
T5 I1, I2, I3, I5
T6 I1, I2, I3, I4

b) Write a short note on Text analytics.

 

[6155]-64 2
Total No. of Questions : 5] SEAT No. :
P-6402 [Total No. of Pages : 2

[6155]-65
T.Y. B.Sc. (Computer Science)
CS-365 : OBJECT ORIENTED PROGRAMMING USING
JAVA - II
(2019 Pattern) (CBCS) (Semester-VI) (Paper-V)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicate full marks.

Q1) Attempt any EIGHT of the following: [8 × 1 = 8]

a) What is use of callable Statement?
b) What is thread?
c) How servlet is differ from CGI?
d) Define set.
e) List any two parameter using scriplet.
f) Define spring.
g) Which interface is implemented by Treeset class.
h) List any two method of statement interface.
i) Write the purpose of yield ().
j) What is cookie?

Q2) Attempt any FOUR of the following : [4 × 2 = 8]

a) What is Map interface and how to implement it?
b) What is Data Base Meta Data?
c) Give the name of directives in JSP.
d) State the type of servlet.
e) What are the thread priorities?
P.T.O.
Q3) Attempt any TWO of the following : [2 × 4 = 8]
a) Write a java program to accept 'N' student name from user, store them in
Linked list collection and display in reverse order.
b) Write a java program to accept details of student (rollno, name,
percentage). Store it into database & display it.
c) Write a JSP program to accept username & password, if username &
password is same then display "Login sucessful" message on the browser
other - wise display "Login failed" message.

Q4) Attempt any TWO of the following : [2 × 4 = 8]

a) Explain Life cycle of thread.
b) What is session tracking? How to implement it.
c) Write a java program to delete the details of given teacher & display
remaining records from Teacher Table. Assume teacher table (tid, tname,
subject) already created.

Q5) Attempt any ONE of the following : [1 × 3 = 3]

a) Explain the architecture of spring.
b) Explain the components of JSP.



[6155]-65 2
Total No. of Questions : 5] SEAT No. :
P6403 [Total No. of Pages : 3

[6155]-66
T.Y. B.Sc. (Computer Science)
CS - 366 : COMPILER CONSTRUCTION
(2019 Pattern) (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.

Q1) Attempt any Eight of the following (out of 10). [8×1=8]

a) Define cross compiler.

b) List the two classes of SDD.

c) Define the term dead code.

d) List the differnt types of conflicts that occur in LR parser.

e) State one difference between annotated Parse tree and dependency graph.

f) List the techniques used in code optimization.

g) What is the purpose of augmenting the grammar?

h) Define term Attribute Grammar.

i) What is output of Lexical Analysis?

j) State True or False : Shift - Shift conflict does not occur in LR Parser.

Q2) Attempt any four of the following (out of 5): [4×2=8]

a) Compute First and Follow for the following
S  i CtSS| a
S  e S| 
Cb

P.T.O.
 b) Write difference between LL parser and LR Parser.
c) Compute Leading and Trailing symbols of the following Grammar:

S  (T) | a | 
T  T, S | $

d) Write execution steps of VACC program.

e) Give two difference between synthesized and inherited attributes.

Q3) Attempt any Two of the following (out of 3) [2×4=8]

a) Write a Recursive Descent Parser (RDP) for the following grammar.
E  E+T | T
T  TF|F
F  (E) | id

b) Construct DAG for following expression.

i) b * a  c  a  c * d
ii) y   y  x /  x  z * x  z

c) Check whether the following Grammar is LL(1) or not?

S  a||(R)
T  S,T | S
R T

Q4) Attempt any two of the following (out of 3) [2×4=8]

a) Check whether the given grammar is SLR (1) or not.

S  A|B
A  aA | b
B  dB / b

[6155]-66 2
 b) Construct triples and Quadruples for the following expression :
(a+b)*(m–n)  (m+n)
c) Consider the following SDD and construct Annotated Parse tree for
input string 3*5* 2
Production Semantic Rules
E  TE E.inh = T.val
E.val = E.syn

E   TE E1 .inh = E.inh+T.val

E1 .syn = E1 .syn

E  E.syn  E.inh

T  FT T.inh  F.val

T.val  T.syn

T  *FT T1.inh  T.inh * F.val

T1.syn  T1.syn

T1  T.syn  T.inh

F  digit F.val  digit.lexval

Q5) Attempt any one of the following (out of 2). [1×3=3]

a) Write a LEX program to find factorial of a given number.
b) Eliminate left-Recursion from following grammar:

S  Aa | b

A  Ac | sd| 

 

[6155]-66 3
Total No. of Questions : 5] SEAT No. :

P-6404 [Total No. of Pages : 2

[6155]-67
T.Y. B.Sc. (Computer Science)
CS-3610 : Software Testing and Tools (Paper - VII)
(Revised 2019) (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.

Q1) Attempt any Eight of the following (Out of Ten) : [8 × 1 = 8]

a) What is software testing?
b) Enlist any two features of Bugzilla tool?
c) State any two advantages of statement coverage.
d) Define test Plan.
e) Define entry criteria and exit criteria in a test case.
f) Define error.
g) Enlist the types of defects.
h) Define Manual Testing.
i) What is test suite?
j) What is a test report?

Q2) Attempt any Four of the following (Out of Five) : [4 × 2 = 8]

a) Explain any two test case design techniques.
b) Enlist four objective of writing test cases.
c) What are the critical defects?
d) What is difference between manual testing and automation testing?
e) State features of JIRA tool.
P.T.O.
Q3) Attempt any TWO of the following (Out of Three) : [2 × 4 = 8]
a) How to design test cases in MS Excel? Describe with example.
b) Write a note on path coverage testing.
c) Explain steps for writing test cases.

Q4) Attempt any Two of the following (Out of Three) : [2 × 4 = 8]

a) Explain defect life cycle with the help of detailed diagram.
b) Consider following code -
i) input(intx, inty) {
ii) sum = x+y;
iii) if (sum >0)
iv) Printf (This is positive
results);
v) else
vi) Printf(This is negative
result);
vii) }
Test case 1: x = 6, y = 2
Test case 2: x = –4, y = –3
Consider above test cases scenarios and find the percentage of statement
coverage.
c) Explain different types of Automation testing tools? Explain two of
them in short.

Q5) Attempt any ONE of the following (Out of Two) : [1 × 3 = 3]

a) How to prepare test plan?
b) Explain unstructured loop testing.



[6155]-67 2
Total No. of Questions : 4] SEAT No. :
P8766 [Total No. of Pages : 2
[6155]-101
S.Y. B.Sc.
COMPUTER SCIENCE
CS - 212 : Relational Database Management System
(2013 Revised Pattern) (Semester - I) (21122) (Paper - II)

Time : 2 Hours] [Max. Marks : 40

Instructions to the candidates:
1) All questions are compulsory.
2) All questions carry equal marks.
3) Figures to the right indicate full marks.

Q1) Attempt all of the following: [10×1=10]

a) Define Trigger.

b) What do you mean by time stamp?

c) Define System Log.

d) Name any two Armstrong axioms.

e) List various states of a transaction

f) Define cursor.

g) What is downgrading?

h) Define checkpoints.

i) State how to detect deadlock.

j) List the disadvantages of concurrent schedules.

P.T.O.
Q2) Attempt any 2 of the following: [2×5=10]
a) Explain client-server architecture benefits.
b) What is transaction? Explain ACID property of transaction.
c) Explain desirable properties of decomposition

Q3) Attempt any 2 of the following: [2×5=10]

a) Explain referential integrity.
b) Explain role of DBA with respect to security.
c) Explain DAC (Discretionary Access Control).

Q4) Attempt either (A) or (B): [1×10=10]

A) a) Consider the following relation schema: [5]
student (sno, sname) teacher (tno, tname, qualification)
Student and teacher are related with many-many relationship.
Write a cursor to list details of students who have taken RDBMS as
a subject
b) Discuss how the recovery from catastrophic failure is handled. [3]
c) Explain concatenation of strings in PQ/SQL. [2]
OR
B) a) Consider the following relational database: [5]
Doctor (dno, dname, dcity) Hospital (hno, hname, hcity)
Doc-hosp (dno, hno)
Write a function to return count of number of hospitals located in
‘Pune ‘City.
b) Explain timestamp based protocol. [3]
c) What is stored procedure? Give syntax to create stored procedure.[2]


[6155]-101 2
Total No. of Questions : 4] SEAT No. :
P8767 [Total No. of Pages : 2
[6155]-102
S.Y. B.Sc.
COMPUTER SCIENCE
CS - 221 : Object Oriented Concepts Using C++
(Revised 2013 Pattern) (Semester - II) (Paper - I) (22121)

Time : 2 Hours] [Max. Marks : 40

Instructions to the candidates:
1) All questions are compulsory.
2) All questions carry equal marks.
3) Assume suitable data, if necessary.

Q1) Attempt all of the following: [10×1=10]

a) What do you mean by encapsulation?

b) What is destructor?

c) Give any two benefits of OOP.

d) What is inline function?

e) What is function template?

f) What is the purpose of delete operator?

g) Give the syntax and example of precision() function.

h) What is the purpose of private access specifier?

i) State the purpose of “this” pointer.

j) Which flags should be used to open a binary file for writing only if the
file does not exist?

P.T.O.
Q2) Attempt any two of the following: [2×5=10]
a) What are different types of inheritance? Explain multilevel inheritance
with example.
b) Create a class Fraction containing data members as Numerator and
Denominator. Write a C++ program to overload operators to add and
multiply two Fraction.
c) Create a C++ class Sumdata to perform following functions:
int sum(int, int) - returns the addition of two integer arguments.
float sum(flaot, float, float) - returns the addition of three float arguments.
int sum(int [ ] ,int) - returns the sum of all elements in an array of size ‘n’.
Write a C++ program to illustrate the use of above class.

Q3) Attempt any two of the following: [2×5=10]

a) Explain runtime polymorphism by a suitable example.
b) What is friend function? What are the features of friend function?
c) Write a C++ program to find maximum of two integer numbers and two
float numbers by using function template.

Q4) Attempt any one of the following (A or B): [1×10=10]

A) a) What is constructor? List types of constructor. Explain overloading
of constructor with suitable example. [5]
b) Write a C++ program to merge two text files into one file. [5]
OR
B) a) Write and explain block structure of C++ program. [4]
b) Explain the Advantages of Exception Handling. [3]
c) Write a C++ program to find area and volume of cylinder using Inline
function. [3]


[6155]-102 2