Total No. of Questions : 5] SEAT No.

P-1294 [Total No. of Pages : 2

[6055]-201
S.Y. B.Sc. (Semester - IV)
COMPUTER SCIENCE
CS 241 : Data Structures and Algorithms - II
(2019 Pattern) (CBCS) (24121)

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 whenever necessary.
4) Your answers will be value as whole.

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

a) Define min heap.
b) What is level order traversal?
c) What is descendant in tree?
d) In B+ tree data can only be stored in leaf node. State true or false.
e) List AVL tree Rotations.
f) List any two minimum spanning tree algorithms.
g) "DFS uses queue implementation". State true or false.
h) What is weighted graph?
i) What is load factor?
j) What is hashing?

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

a) Write a note on minimum spanning tree.
b) Write a note on splay tree.
c) Give any two differences between DFs & BFs.
d) Explain any two properties of good hash function.
e) Write a note on B tree.

P.T.O.
Q3) Attempt any two of the following : [2 × 4 = 8]
a) Write a 'C' function to calculate
i) leaf nodes
ii) non leaf nodes
b) Write a program that accepts adjacency matrix and print indegree and
outdegree of each vertex.
c) Write a program to insert new element in hash table.

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

a) Construct Red Black Tree for 2, 10, 7, 20, 30, 25, 50.
b) Consider following adjacency matrix

1 1 1 0
0 1 1 0
 
1 0 1 1
 
0 0 0 1

i) Draw the graph

ii) Give adjacency list
c) Construct minimum spanning tree using Kruskal's algorithm.

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

a) Define the following terms :
i) Terminal node
ii) depth of node
iii) root node
b) Give inorder, preorder and postorder traversal for :


[6055]-201 2
Total No. of Questions : 5] SEAT No. :
P-1304 [Total No. of Pages : 2

[6055]-305
T.Y. B.Sc.
COMPUTER SCIENCE
CS-355: Object Oriented Programming using Java - I
(2019 Pattern) (Semester - V) (CBCS) (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 javadoc?

b) What are command line argument?

c) Define Constructor.

d) List any two wrapper classes.

e) Write the use of extends key word.

f) Define functional interface.

g) List any two uncheck exception.

h) How to open file in read mode?

i) What is AWT?

j) Give the names of any two Adaptor class.

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

a) Differentiate between String and StringBuffer class.

b) State any four features of java.

c) What is polymorphism? How to implement it at compile time?

d) How to define and handle user defined exception?

e) What is listener? How to inherit it in program?

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

a) Write a java program to copy the content from one file to another file,
while copying change the case of alphabets.

b) Write a java program using swing to accept details of employee (eno,

ename, esal) and display it by clicking on a button.

c) Define abstract class shape with abstract method area (). Write a java
program to calculate area of circle.

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

a) Write a java program to give Red colour at the background of TextField

by clicking on a button.

b) Explain the uses of super keyword with example.

c) What is string? Explain its any three method with an example.

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

a) Explain the execution process of java program.

b) Explain MVC architecture in details.



[6055]-305 2
Total No. of Questions : 5] SEAT No. :

P-1305 [Total No. of Pages : 2

[6055]-306
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 output function λ of Moore and Mealy machines.
b) List all the proper prefixes of the string “ABCD’.
c) Define Nullable symbol.
d) Give formal definition of Pushdown Automata.
e) Define right linear grammar.
f) State True or False. DFA do not have multiple final states.
g) Name the type of language accepted by Turing Machine.
h) Write the tuples of LBA.
i) State true or false. Pumping lemma is used to show that language is not
context tree.
j) Write smallest possible string accepted by the following regular expression.
l0+(0+l 1)0*1

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

a) Explain Reduction with the help of example.
b) Construct FA for regular expression.
(0l+l0)*+ 11
c) Differentiate between DFA and NFA.

P.T.O.
 d) Write down the ∈-closure of each state from the following FA.

e) Define types of Turing Machine.

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

a) Construct a DFA for a language over Σ = {0,1 }
L1∩L2
L1 = { All strings starting with ‘0’}
L2 = { All strings not having ‘01’ as substring}
b) Construct the following CFG int Normal Form (CNF)
S-> aSa | bSb | a | b| aa | bb
c) Construct TM which accepts the language that start with 0 and ends with 1.

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

a) Construct a PDA for the language L = {anbn |n>=1}
b) Construct a Mealy machine for the language L over Σ = {0, 1} which
outputs ‘A’ if it has substring ‘101’. it outputs ‘B’ if it has substring
‘110’, otherwise it outputs ‘C’.
c) Write a short note on Chomsky’s hierarchy.

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

a) Construct a Moore machine over alphabet {0,1} to get l’s compliment of
a given binary string.
b) Show that L = {0n1n | n>=1} is not regular.


[6055]-306 2
Total No. of Questions: 5] SEAT No. :
P1308 [6055]-401
[Total No. of Pages :2

T.Y. B.Sc. (Computer Science)

CS-361 : OPERATING SYSTEMS-II
(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. [8×1=8]

a) What is claim edge?
b) What is request edge?
c) List any two file attributes.
d) List any two Disk performance parameters.
e) Define distributed system.
f) Write any two design goals of distributed systems.
g) What is cluster computer?
h) What is grid computing?
i) What is size scalability in distributed systems?
j) What is kernel?

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

a) What are advantages of windows mobile OS?
b) Write the difference between SCAN & Look disk Scheduling algorithms.
c) Explain in brief sensor network.
d) Write a short note on centralised organisation system architecture.
e) Define.
i) Seek time
ii) Rotational latency

P.T.O.
Q3) Attempt any Two of the following. [2×4=8]
a) Consider the given snapshot of the system. A system has 5 processes
and 3 types of resources A,B,C.

Allocation Max Available

A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3

Answer the following questions using Banker’s algorithm

i) What are the contents of need arrary?
ii) Is the system is in the safe state give the safe sequence.
b) Explain any four file operations
c) Write a note on cloud computing system

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

a) Explain the benefits or advantages of distributed systems.
b) Explain any two deadlock prevention strategies.
c) Explain sequential access & direct access methods of files.

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

a) What is total head movement for first-come first-served (FCFS) sched-
uling for the disk queue with requests for I/O to blocks on cylinders 98,
183, 37, 122, 14, 124, 65, 67 in that order. If the disk head is initially at
cylinder 53.
b) Give a comparative study of Android OS and Apple IOS mobile operat-
ing systems.



[6055]-401 2
Total No. of Questions : 5] SEAT No. :

P-1309 [Total No. of Pages : 2

[6055]-402
T.Y. B.Sc. (Semester - VI)
COMPUTER SCIENCE
CS-362 : Software Testing
(2019 Pattern) (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) Assume suitable data if necessary.

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

a) Define the term errors.
b) What is stub?
c) Write a goal of white Box testing.
d) What is test plan?
e) Write two methods of Black Box Testing.
f) Write dimensions of quality.
g) What do you mean by performance Testing?
h) Write a goal of unit testing.
i) Which is a core agile principle?
j) Define the term Regression Testing.

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

a) Write an advantages of white box testing.
b) Explain the working of web application.
c) Explain various forms of acceptance testing.
d) Write features of agile testing.
e) Explain various types of system testing.

P.T.O.
Q3) Attempt any two of the following : [2 × 4 = 8]
a) Explain the difference between Testing and Debugging.
b) What is Cyclomatic complexity and Graph matrix? Explain with
example.
c) Explain the process of stress testing with example.

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

a) Define navigation testing. How to test navigation syntax and semantics?
b) Define the term test case. Explain with example test case.
c) Compare verification and validation.

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

a) Explain the various phases of internationalization testing.
b) Difference between Alpha and Beta Testing.



[6055]-402 2
Total No. of Questions : 5] SEAT No. :
P1310 [Total No. of Pages : 2
[6055]-403
T.Y.B.Sc. (Computer Science)
CS-363 : WEB TECHNOLOGIES - II
(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. [8 × 1 = 8 ]

a) Which function is used to print an error message and exit from current
code?
b) What is sticky form?
c) XML Parser cannot alter documents or create new documents. Justify
True or False.
d) What is DOM?
e) How the variables declared in Javascript?
f) What is JQuery?
g) Give any two applications of AJAX.
h) Which object is Ajax make web page interactive?
i) What is Code Igniter?
j) Which function is used for page redirecting?

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

a) Discuss differences between GET and POST method.
b) Explain any five elements of $_server variable.
c) Explain the concept of session handling with example.
d) Explain the structure of well-formed XML document.
e) Draw and explain AJAX web application module.

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

a) Explain the workflow of MVC Architecture.
b) Which are the fields used in cookies?
c) What is XML parser? Explain it with its types.

P.T.O.
Q4) Attempt any TWO of the following. [2 × 4 = 8]
a) Write a JavaScript code to display message - ‘Exams are near, Prepare
well for it” using alert, prompt and confirm boxes. Accept proper input
from user and display messages accordingly.
b) Write a php program to add or append in paragraph text and also in the
numbered (ordered) list in a given HTML document using jQuery
selectors.
c) Write an Ajax program to search Student Name according to the
character typed and display list using array.

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

a) Write XML syntax rules.
b) What are Query selectors? Explain in brief.

  

[6055]-403 2
Total No. of Questions : 5] SEAT No. :
P-1312 [Total No. of Pages : 2

[6055]-405
T.Y. B.Sc. (Computer Science)
CS - 365 : OBJECT ORIENTED PROGRAMMING USING
JAVA - II
(2019 Pattern) (Semester - VI) (CBCS) (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) Define collection.

b) Give the name of JDBC API.

c) What is interthread communication?

d) What is servlet?

e) How to represent expression in JSP?

f) List modules in spring.

g) Which interface is implemented by hashset class?

h) What is use of get connection ()?

i) Define multithreading.

j) What is session?

P.T.O.
Q2) Attempt any four of the following : [4 × 2 = 8]
a) Differentiate between list and set interface.
b) What is result set interface? List any two fields of it.
c) Write a syntax of doGet ()
d) What are advantages of JSP over servlet?
e) How to create a thread in multithreading?

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

a) Write a java program to accept N integer from user store them into suitable
collection and display only even integers.
b) Write a Java program to accept details of teacher (Tid, Tname, Tsubject),
store it into database and display it.
c) Write a JSP program to accept user name and greets the user according
to time of system.

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

a) Explain life cycle of JSP.
b) Explain synchronization with an example.
c) Write a Java program to update the salary of a given employee (use
prepared statement interface). Assume Emp table (Eno, Ename, Esal) is
already created.
Q5) Attempt any One of the following : [1 × 3 = 3]
a) What is spring frame work? Explain its advantages.
b) Explain execution process of servlet application.



[6055]-405 2
Total No. of Questions : 5] SEAT No. :
P1313 [6055]- 406
[Total No. of Pages : 2

T.Y. B.Sc. (Computer Science)

CS - 366 : COMPILER CONSTRUCTION
(2019 Pattern) (CBCS) (Semester - VI)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) All questions are compulsory.
2) Figure to right indicate full marks.

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

a) Define cross - compiler.
b) State the advantages of Boot-strapping.
c) What is sentinels?
d) State the use of function retract( ).
e) Name the types of LR parsers.
f) What does second ‘L’ stand for LL(1) parser?
g) What is the purpose of augmenting the grammar?
h) Define synthesize attribute.
i) What is basic block?
j) Define DAG.

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

a) Construct the DAG for the following expression.

b * (a + c) + (a + c) * d
b) What are the basic task & auxiliary task of a lexical analyzes?
c) Write any two limitations of top down parsing.
d) Define S-attributed grammar and L-attributed grammar.
e) Differentiate between top-down parsing & Bottom-up parsing.

[6055]-406 1 P.T.O.
Q3) Attempt any two of the following. [2×4=8]
a) Check whether the following grammar is SLR or not.
S  0A2
A  1A1 1

b) Write a lex program to find the sum of n numbers.

c) Write recursive descent parser for the following grammar.

S  a S a sb ss b

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

a) Write the steps of creation of lexical analyzer on lex. Explain the lex
library functions associated with lex.

b) Check whether following grammar is LALR (1) or not.

S  A a A b Bb B a
A 
 
c) For the input expression (2+3) * (3+4) design SDD and draw annotated
tree using following grammar.
LE
E 
* F | F
F digit
Q5) Attempt any ONE of the following. [1×3=3]
a) Consider the following operator grammar
E  E + E | E * E | id
Construct the operation precedence relation table.
b) Construct triple and indirect triple for the following strings.
a+b*c+d*ef&x+b*c

  

[6055]-406 2
Total No. of Questions : 5] SEAT No. :
P-1314 [Total No. Of Pages : 2

[6055]-407
T.Y.B.Sc. (Computer Science)
CS - 3610: Software Testing and Tools
(Semester-VI) (2019 Pattern) (Paper VII) (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 (Out of TEN): [8 × 1 = 8]

a) Define smoke testing.
b) Define code coverage with formula.
c) Enlist any two bug tracking tool.
d) Explain test plan.
e) Enlist any two types of loop testing.
f) Enlist any two objective of writing test cases.
g) What are functional defects?
h) Enlist any two types of defects.
i) What is automation testing?
j) Silk test is most popular testing tool specifically design for regression
and functionality testing. State true or false.
Q2) Attempt any Four of following (out of Five): [4 × 2 = 8]
a) Enlist any two feature of bugzilla.
b) Write any two advantages of branch coverage.
c) What is test summary report?
d) Write any two causes of defect.
e) Write any two limitations of manual testing.
P. T. O
Q3) Attempt any Two of following (Out of Three): [2 × 4 = 8]
a) What are entry and exit criteria?
b) Explain path coverage testing.
c) Explain design defects with its different types.
Q4) Attempt any Two of following (Out of Three): [2 × 4 = 8]
a) Write test plan for the functionality of Flipkart login page.
b) Explain winrunner tool.
c) Consider following code-
Inpur (int x,int y){
Sub=x-y;
If(sub>0)
Print("Positive")
else
Print("Negative")
}
Test case 1: x = 10, y = 03
Test case 2: x = 10, y = 15
Consider the above test cases and find the percentage of statement
coverage.
Q5) Attempt any One of following (Out of Two): [1 × 3 = 3]

a) Explain severity defect with its types.

b) What are unit testing and load testing.

  

[6055]-407 2
Total No. of Questions : 5] SEAT No. :
PA-1017 [Total No. of Pages :2

[5902]-41
S.Y. B.Sc. (Computer Science)
CS-241 : DATA STRUCTURES & ALGORITHMS - I
(CBCS) (2019 Pattern) (Semester - IV)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) Neat diagrams must be drawn wherever necessary.
2) Figures to the right indicate full marks.

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

a) Define degree of a tree.
b) Define the term left skewed binary tree.
c) What is height balance tree?
d) List 2 applications of graph.
e) What is topological sorting?
f) Define Bucket.
g) What is collision?
h) Define complete Binary tree.
i) What is weighted graph?
j) Explain open addressing concept in hash table.

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

a) Traverse the following binary tree using given traversal technique
i) Inorder ii) Postorder.

P.T.O.
 b) Compare B tree & B+ tree.
c) Define indegree & outdegree of vertex with example.
d) Explain the concept of hushing & rehashing in Hash table.
e) Explain concept of Red - Black Tree.

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

a) Write C program to represent graph as adjacency matrix.
b) Write C Program to compare two BST.
c) Write a program to find minimum value node from the BST.

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

a) Write a program to insert an element into binary tree.
b) Construct AVL tree for the following:
{Mon, Sun, Thur, Fri, Sat, Wed, Tue}
c) Consider the following graph.

Give i) DFS Traversal

ii) BFS Traversal.

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

a) Write note on quadratic probing
b) Compare the data structures.
Tree & Graph.



[5902]-41 2
Total No. of Questions : 5] SEAT No. :

PA-1027 [Total No. of Pages : 3

[5902]-55
T.Y. B.Sc. (Computer Science)
CS - 355 : OBJECT ORIENTED PROGRAMMING USING
JAVA - I
(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.

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

a) What is use of Javac?
b) Give the name of any two wrapper classes.
c) What is use of 'implements' keyword?
d) List types of constructor.
e) What is use of Array?
f) Give the name of any two listeners.
g) What is exception?
h) Give the syntax of ends with( ) method?
i) What is package?
j) What is use of new operator?

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

a) 'When constructor of class will be called?' Comment.

b) What is command line argument? Where they are stored in a program.

P.T.O.
 c) What is Frame? Give its any two methods.

d) Differentiate between method overloading and method overriding.

e) Write any two access specifiers.

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

a) Define an interface shape with abstract method area( ). Inherit interface
shape into the class traingle.Write a Java Program to calculate area of
Triangle.
b) Design the following screen by using swing.
Student details – ×
Roll No.
Name
Percentage
Display Clear
Write a Java program to accept the details of student & display an console
by clicking on Display button. Clear button should clear all the controls.
c) Write a Java Program to copy the contents form one file into another file.
While copying, change the case of cell the alphabets & replace all the
digital by '*'.

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

a) Differentiate between AWT & Swing.

b) Define user define exception zeronumber Exc. Write a Java program to

accept a number from user. If it is zero then throw user define exception
"Number is zero" otherwise calculate the sum of first & last digit of
given number. (use Static Keyword).

c) Write a Java program to accept n number from user & store only perfect
numbers into array & display that array.

[5902]-55 2
Q5) Attempt any ONE of the following. (out of Two) [1×3=3]

a) Explain uses of final keyword with example.

b) Define a class Emp with a member Eid and display() method, inherit
EmP class into the Emp Name class, Emp Name class having a member
Ename & display ( ) method. Write a Java program to accept details of
employee [Eid, Ename] & display it. (Use super keyword).



[5902]-55 3
Total No. of Questions : 5] SEAT No. :

PA-1028 [Total No. of Pages : 2

[5902]-56
T.Y. B.Sc. (Semester - V)
COMPUTER SCIENCE
CS-356 : Theoretical Computer Science
(2019 Pattern) (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 (Out of TEN). [8 × 1 = 8]

a) Define Unit production of grammar.
b) Construct Melay machine which toggles its input.
c) Explain proper Suffix and Prefix of a string with one example.
d) Give formal definition of Push down Automata.
e) Define left linear and right linear grammar.
f) State True or False. Finite Automata has an infinite number of states.
g) Name the types of normal forms of grammar.
h) Write the tuples of LBA.
i) State true or false. Pumping lemma is used to show that language is
not context tree.
j) Write smallest possible string accepted by the following regular
expression.
10 + (0 + 11)0*1

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

a) Explain types of grammar.
b) Construct FA for regular expression.
(01+10)*+11
c) Differentiate between FA and PDA (any two points).

P.T.O.
 d) Write down the -closure of each state from the following FA.

e) Define types of Turing Machine.

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

a) Construct a DFA for a language
L1L2
L1= { All strings starting with ‘a’}
L2= { All strings not having ‘ab’ as substring}
b) Construct the following CFG into Normal Form (CNF)
S-> ABA
A-> aA | 
B-> bB | 
c) Design TM for language,
L {WCWR|W is in (0+1)*}

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

a) Construct a PDA for the language
L = {0 n 1 m 2 n+m
| n,m>=1}
b) Construct a Moore machine for the language L over  = {0, 1 } which
outputs ‘*’ if the string contains ‘11’ in it and outputs ‘#’ otherwise.
c) Compare DFA and NFA.

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

a) Construct a Mealy machine to convert each occurrence of substring
101 by 100 over alphabet {0,1}.
b) Show that L = {0n1n | n>=1} is not regular.


[5902]-56 2
Total No. of Questions : 5] SEAT No. :

PA-1031 [Total No. of Pages : 3

[5902]-61
T.Y. B.Sc. (Semester - VI)
COMPUTER SCIENCE
CS-361 : Operating System - II
(2019 Pattern) (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) What is request edge?

b) What is safe state?

c) Write the names of any two disk allocation methods of disk space.

d) List disk performance parameters.

e) Define distributed system.

f) What is size scalability?

g) List the different architectural styles of distributed operating systems.

h) What is kernel?

i) What is RISC in ARM architecture?

j) Write any two special service requirements of mobile operating system.

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

a) Write the difference between SCAN & LOOk disk scheduling

algorithms.

b) Define seek time & rotational latency.

c) Explain features of mobile operating system.

d) Give a comparative study of any four points of Android mobile

operating system and Apple i05 mobile operating system.

e) Write a short note on centralized organization of system architecture.

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

a) Explain any two deadlock prevention strategies.

b) Explain sequential access & Direct access methods for a file.

c) Write a short note on cloud computing system.

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

a) Consider following snapshot of the system. A, B, C, D are the resource

types. Answer the following questions using Banker's algorithm.

i) What are the contents of Need matrix/array?

ii) If the system is in the safe state, give the safe sequence.

Allocation Max Total

A B C D A B C D A B C D

P0 0 0 1 2 0 0 1 2 1 5 2 0

P1 1 0 0 0 1 7 5 0

P2 1 3 5 4 2 3 5 6

P3 0 6 3 2 0 6 5 2

P4 0 0 1 4 0 6 5 6

[5902]-61 2
 b) Explain any four file operations.

c) Explain the design goals of distributed systems.

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

a) What is total head movement for First-Come First-Served (FCFS)

scheduling for the disk queue with requests for I/O to blocks on cylinders
98, 183, 37, 122, 14, 124, 65, 67 in that order, If the disk head is
initially at cylinder 53.

b) Explain the special constraints & requirements of mobile operating

system.



[5902]-61 3
Total No. of Questions : 5] SEAT No. :

PA-1032 [Total No. of Pages : 2

[5902]-62
T.Y. B.Sc. (Computer Science)
CS - 362 : SOFTWARE TESTING
(2019 Pattern) (Semester - VI) (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) Assume suitable data if necessary.

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

a) What is fault?
b) Define verification.
c) Define stub.
d) Write methods of white box testing.
e) Define regression testing.
f) What is Agile Methodology?
g) List dimensions of quality
h) Define strategy for web applications.
i) Define acceptance testing.
j) Black box testing is called glass box testing Justify T/F.

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

a) Write short note on testing roles.
b) Explain white box and black box testing.
c) Compare testing and debugging any two points.
d) Explain performance of testing.
e) Write a short note on features of Agile testing.

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

a) Explain test case with example.

b) Write a short note on V-model with diagram.

c) Explain navigation testing in detail.

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

a) Write a short note on alpha & beta testing.

b) Explain integration testing. What is bottom up integration.

c) What is web application? How it works explain with diagram.

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

a) Explain different layers of automated tests.

b) Write a short note on internationailization testing.



[5902]-62 2
Total No. of Questions : 5] SEAT No. :

PA-1033 [Total No. of Pages : 3

[5902]-63
T.Y. B.Sc. (Computer Science)
CS - 363 : WEB TECHNOLOGIES - II
(2019 Pattern) (Semester - VI) (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) How to set response header in PHP?
b) Write any two applications of using AJAX.
c) What are XML namespaces?
d) Write the elements of global array $_SERVER.
e) Give any two limitations of JavaScript.
f) Whether root element is required for XML file? If so, how many root
elements are required?
g) What is the use of iSNAN() function in Java Script?
h) What are different values of readyState property of XMLHttpRequest?
i) List out parts of XML document structure.
j) Which function is used to create cookie in PHP? Give syntax of it.

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

a) List any four datatypes that JavaScript support with its usage.
b) How to start and destroy session in PHP? Give syntax.
c) Draw AJAX web application model.
d) What is MVC?
e) What are different rules to make XML document well-formed?

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

a) Explain the JavaScript confirm dialog box with suitable example.

b) Explain CodeIgniter architecture with suitable diagram.

c) What are different techniques to maintain state in PHP?

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

a) Write an AJAX program to display list of countries stored in an array

on clicking OK button.

b) Design the HTML form to accept Employee name, Age and Mobile
no. and perform the following validation using Java Script:

i) No field should be empty.

ii) Mobile no. must contain 10 digits

c) Suppose following books.xml is loaded into xmlDoc. Get the first

<book> element and change the ''category'' attribute value to “food”
using XML DOM.

<?xml version=''1.0'' encoding=''UTF-8''?>

<bookstore>

<book category=''cooking''>

<title lang=''en''>Everyday Italian</title>

<author>Giada De Laurentiis</author>

<year>2005</year>

<price>30.00</price>

<book>

</bookstore>
[5902]-63 2
Q5) Attempt any ONE of the following : [1 × 3 = 3]

a) What is XML parser? Explain two different types of XML parsers.

b) Write down the steps to integrate external CSS and JS file in CodeIgniter.
Give example.



[5902]-63 3
Total No. of Questions : 5] SEAT No. :

PA-1034 [Total No. of Pages : 2

[5902]-64
T.Y. B.Sc. (Semester - VI)
COMPUTER SCIENCE
CS-364 : Data Analytics
(2019 Pattern) (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 (out of 10). [8 × 1 = 8]

a) Define Data Analytics.
b) What is AVC & ROC curve?
c) Write any two applications of Supervised Machine Learning.
d) Give the formula for support & confidence.
e) What is an outlier?
f) State applications of NLP.
g) What is web scraping?
h) What is the purpose of n-gram?
i) Define classification.
j) Define Recall.

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

a) Explain the concept of underfitting & overfitting.
b) What is linear Regression? What type of Machine learning applications
can be solved with linear Regression?

P.T.O.
 c) What is Social Media Analytics?
d) What are the advantages of FP-growth Algorithm?
e) What are dependent & independent variables?

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

a) What are frequent itemsets & association rules? Describe with example.
b) What is stemming & lemmatization?
c) Explain various types of Data Analytics.

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

a) What is Bag of words & DOS tagging in NLP?
b) What is Logistic Regression? Explain it with example.
c) Consider the following database & find out the frequent itemset using
Apriori Algorithm with minimum support threshold = 3.
T. id. Item purchased
1 M,T,B
2 E,T,C
3 M,E,T,C
4 E,C
5 J

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

a) Define the terms
i) Confusion Matrix
ii) Accuracy
iii) Precision
b) What is Machine Learning? Explain its type.


[5902]-64 2
Total No. of Questions : 5] SEAT No. :

PA-1035 [Total No. of Pages : 2

[5902]-65
T.Y. B.Sc. (Semester - VI)
COMPUTER SCIENCE (Paper - V)
CS-365 : Object Oriented Programming using Java - II
(2019 Pattern) (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) What is collection?
b) Define Thread Priority.
c) What is jdbc?
d) Define Session.
e) What is use of request object?
f) Write any one application of spring.
g) What is use of join( ) method?
h) Define HashTable.
i) What is use of commit( ) method?
j) List any two implicit object in JSP.

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

a) Write any two differences between Array List and Linked List.
b) Give any two field of Resultset Interface.
c) Give any two types of servlet.

P.T.O.
 d) Differentiate between sleep( ) and interrupt( ).
e) Write a syntax of getcookies( ) method in servlet.

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

a) Write a jdbc program to accept details of student (RN, Name, percentage)
from user. Display that details.
b) Write a java program in multithreading to display all the numbers between
1 to 10. Each number should display after 2 seconds.
c) Write a jsp script to check the given number is prime or not. Display the
result in blue color.

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

a) Write a Servlet program to get information about the server such as
name, port number and version of server.
b) Explain JSP lifecycle in details.
c) Explain Synchronization with an example.

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

a) Explain execution process of servlet application.
b) Write a java program to accept 'n' names from user store them into Array
List, sort them in ascending order and display it.



[5902]-65 2
Total No. of Questions : 5] SEAT No. :

PA-1036 [Total No. of Pages : 3

[5902]-66
T.Y. B.Sc. (Semester - VI)
COMPUTER SCIENCE
CS-366 : Compiler Construction
(2019 Pattern) (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 (out of Ten) : [8 × 1 = 8]

a) YACC is a compiler or Parser. Write Correct Statement.

b) Write a regular expression in lex for hex decimal number in C language.

c) Define cross Compiler.

d) List any two transformations performed on basic block.

e) What is sentinels?

f) Define Annotated Parse Tree.

g) Name the types of LR parser.

h) What is basic block?

i) State the use of function retract ( ).

j) Construct LR(1) items for the following production.

S→∈

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

a) List out all phases of compiler in sequence.

b) Define synthesized attribute and Inherited attribute.

P.T.O.
 c) Construct a DAG for block :

b = a[i]

a[j] = d

e = a[i]

d) Differentiate between top-down parsing and bottom-up parsing.

e) Define left recursion. How it can be eliminated?

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

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

S→L=R|R

L → * R | id

R→L

b) Write lex program specification. Explain the Lex library functions

associated with lex in brief.

c) Compute First & Follow for the following.

S → BD | AB

A → aAa|b

B → bAa |∈

D→∈

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

a) Check whether the give grammar is LALR (1) or not.

S → aAd | bBd | aBe | bAe

A→c

B→c

[5902]-66 2
 b) What is multi-pass compiler? Explain diagrammatically with its
advantages and disadvantages.

c) Consider the following syntax-directed definition and Draw the

Annotated parse tree for the input string 5+3*4.

Production Semantic Rule

L → En Print E.val

E → E1+T E.val=El.val+T.val

E→T E.val=T.val

T → Tl * F T.val=TI.val* F.val

T→F T.val=F.val

F → (E) F.val=E.val

F → digit F.val=digit.lexval

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

a) List the code optimization techniques. Explain anyone technique with

an example.

b) Draw the operator precedence table for the following grammar :

E → E + E |E*E |E-E |id



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

PA-1037 [Total No. of Pages : 2

[5902]-67
T.Y. B.Sc. (Computer Science) (Semester - VI)
CS-3610 : Software Testing and Tools (Paper - VII)
(2019 Pattern)

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) Define Test Automation.
b) What is test report?
c) What is static testing?
d) What is error?
e) Write any two software defect by nature.
f) Define Smoke testing.
g) Test suites are used to group similar test cases. State TRUE or FALSE.
h) What is Cyclomatic complexity?
i) How many types of testing tools?
j) Define code coverage in white box testing.

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

a) List the goals of loop coverage testing.
b) Define test criteria and explain its types.
c) List any two web based open source automation software testing tools.
d) Define priority defect and its different levels.
e) Write any two features of Bugzilla tool.
P.T.O.
Q3) Attempt any two of the following (out of three) : [2 × 4 = 8]
a) What are different types of loop testing? Explain in details.
b) Explain IEEE Std.Test Incident report in details.
c) Develop source code to check if number is prime or not in C
Programming lang.
i) Draw the control flow graph.
ii) Calculate Cyclomatic complexity for all methods.
iii) List all independent path test cases for independent paths.

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

a) Create case study for verify the functionality of amazon login page.
b) Consider following code and apply decision coverage testing create
use cases
Check-class(int x)
{
If(x>80)
Print(“O”)
else
Print(“Class A”)
}
Test case 1: x >80 and Test case 2: x <80
c) Explain STLC with its phases.

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

a) Write short note on Classification of Defects.
b) Give any three features of winRunner and selenium.


[5909]-67 2
Total No. of Questions : 5] SEAT No. :

P5143 [Total No. of Pages : 3

[5823]-401
S.Y.B.Sc.
COMPUTER SCIENCE
CS 241 : Data Structure and Algorithms - II
(2019 CBCS Pattern) (Semester - IV)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) Figures to the write indicate full marks.
2) Neat diagrams must be drawn wherever necessary.
3) Your answers will be values as a whole.

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

a) Define Heap.
b) List tree traversal methods.
c) Define node of tree.
d) What is height balance tree?
e) Define balance factor.
f) Define Spanning tree.
g) Define in-degree & out-degree of vertex.
h) What is weighted graph.
i) Define Bucket
j) What do you mean by rehashing.

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

a) Write any two properties of hash function.
b) Define i) Degree of vertex
ii) Subgraph
c) List any two applications of tree data structure.
d) What is skewed binary tree.
P.T.O.
 e) Convert the following undirected graph into adjacency matrix.

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

a) Write a program to sort 'n' randomly generated elements using heapsort
method.
b) Write a program that accepts the vertices and edges of graph and store it
as an adjacency matrix. Display adjacency matrix.
c) Write a function to search an element in binary search tree.

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

a) Construct an AVL tree for the following data.
70, 50, 30, 90, 80, 130, 120
b) Consider the following adjacency matrix.

1 2 3 4
1 é0 1 1 0ù
ê ú
2 ê1 0 1 0ú
ê ú
3 ê0 0 0 1úú
ê
4 ê1 0 0 0úû
ë

i) Draw the graph

ii) Draw Adjacency list.
c) Write a C function to traverse a graph using BFS.

[5823]-401 2
Q5) Attempt any ONE of the following. [1 × 3 = 3]
a) Define the following terms.
i) Height of tree
ii) Forest
iii) Siblings of tree
b) Traverse the following tree using preorder, inorder and postorder traversal
techniques.



[5823]-401 3
Total No. of Questions : 5] SEAT No. :

P5153 [Total No. of Pages : 2

[5823]-505
T.Y. B.Sc. (Computer Science)
CS-355 : Object Oriented Programming Using Java - I
(2019 Pattern) (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) Define exception
b) Define Interface
c) What is javadoc?
d) What is AWT?
e) What is use of static keyword?
f) What is command line argument?
g) List the types of constructor.
h) What is package?
i) How to open a file in read mode?
j) List any two listener.

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

a) List any two methods of string buffer class.
b) What is use of 'throw' keyword.
c) Differentiate between final and finally keyword.
d) What is method overloading?
e) What is anonymous inner class?
P.T.O.
Q3) Attempt any TWO of the following : [2 × 4 = 8]
a) Write a Java program using AWT to change background color of
table to 'RED' by clicking on button.
b) Write a Java program to copy content from one file into another file,
while copying digits are replaced by '*'.
c) Define an interface shape with abstract method area( ). Write a Java
program to calculate area of rectangle.

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

a) Write a Java program to accept a number from user. If it is zero then
throw user defined exception "Number is zero". Otherwise calculate
its factorial.
b) Explain uses of super-keyword with suitable example.
c) Differentiate between AWT and swing.

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

a) Write a Java program to count number of vowels from given string.
b) Explain the features of Java.



[5823]-505 2
Total No. of Questions : 5] SEAT No. :

P5154 [Total No. of Pages : 2

[5823]-506
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) If A = {} Find the value of |A|.
b) List all the proper suffixes of the string "0123".
c) Define Useless symbol.
d) Give formal definition of Turning Machine.
e) Define left linear grammar.
f) State True or False. DFA do not have multiple final states.
g) Name the type of language accepted by Pushdown Automata.
h) Write the tuples of LBA.
i) State true or false. Pumping lemma is used to show that language is not
context tree.
j) Write smallest possible string accepted by the following regular
expression.
a(a+b)*ab

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

a) Explain types of grammar.
b) Construct FA for regular expression.
(1+0)*0
c) Differentiate between CNF and GNF (any two points).

P.T.O.
 d) Write down the -closure of each state from the following FA.

e) Define types of Turing Machine.

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

a) Construct a DFA for a language

L1L2

L1={All strings starting with 'a'}

L2={All strings not having 'ab' as substring}

b) Construct the following CFG intNormal Form (CNF)

S–>aSa | bSb

S–>a |b| aa | bb

c) Design TM for language,

L={WCWR|W is in (0+1)*}

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

a) Construct a PDA for the language

L={a nbncn |n>=0}.

b) Construct a Moore machine for the language L over = {0,1} which
outputs '*' if the string contains '11' in it and outputs '#' otherwise.

c) Compare DFA and NFA.

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

a) Construct a Mealy machine over alphabet {0, 1} which toggles its input.

b) Show that L={0n1n | n>=1} is not regular.


[5823]-506 2
Total No. of Questions : 5] SEAT No. :
P5157 [Total No. of Pages : 2
[5823]-601
T.Y.B.Sc. (C.S.)
CS-361 : OPERATING SYSTEM-II
(2019 Credit Pattern) (Semester - VI)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) All question are compulsory.
2) Figures to the right indicate full marks.

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

a) List any four attributes of files.
b) What is starvation?
c) List the features of ios. mobile OS?
d) What is Access Transparency?
e) Define mobile OS?
f) Define rational latency?
g) Define claim edge?
h) Wha is cloud computing?
i) Define P2P architecture?
j) Define native level programming?

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

a) Define cluster computing. State the advantages and disadvantages of
cluster operating system.
b) Differentiate mobile OS and desktop OS.
c) Explain disk formatting in disk management.
d) What is distributed operating system? List the purpose of distributed
operating system”?
e) List down the advantages and disadvantages of windows mobile OS?

[5823]-601 1 P.T.O.
Q3) Attempt any two of the following. [2×4=8]
a) List down the architectural styles in distributed operating system & explain
any one in detail.
b) What is deadlock? Explain different ways of deadlock recovery.
c) List down different file allocation methods explain any one in detail.

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

a) Differntiate between cluster, grid & cloud computing.
b) Consider the following snap shot of a system with 5 processes P0,
P1,P2,P3,P4 and resources A, B,C.
Process Allocation Max
A B C A B C
P0 2 3 2 9 7 5
P1 4 0 0 5 2 2
P2 5 0 4 11 0 4
P3 4 3 3 4 4 4
P4 2 2 4 6 5 5
Available
A B C
3 3 2
Answer the following using Banker’s algorithm
i) What are the contents of matrix need?
ii) Is the system in a safe state? If yes find safe sequence.
c) Write a note on tree structured directories.

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

a) Suppose the request sequence is 176, 79, 34, 60, 92, 11, 41, 114, and
initial head position is 50. Calculate total head movements using SSTF
disk scheduling algorithm.
b) Write a short note on kernel architecture of mobile OS.

  

[5823]-601 2
Total No. of Questions : 5] SEAT No. :
P5158 [Total No. of Pages : 2
[5823]-602
T.Y.B.Sc. (Computer Science)
CS - 362 : SOFTWARE TESTING
(New CBCS 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.
3) Assume suitable data if necessary.

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

a) Define software testing.
b) What is mean by validation?
c) What is stub?
d) Write goal of white box testing.
e) Define regression testing.
f) List any 2 agile principles.
g) List dimensions of quality.
h) Define web application, testing.
i) List levels of testing.
j) What is test plan?

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

a) Write 2 differences between bugs, Faults & Failures.
b) Write short note on black box testing.
c) Explain equivalance partitioning.
d) Explain performance testing.
e) Write features of agile testing.

[5823]-602 1 P.T.O.
Q3) Attempt any two of the following. [2 × 4 = 8]
a) With the help of diagram explain V-model.
b) What is test case? Explain with example.
c) Explain Navigation testing in detail.

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

a) What is performance testing? Write steps in performance testing.
b) Differentiate between alpha & beta testing.
c) What is integration testing? Explain top-down integration.

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

a) Write a short note on Automated tests.
b) What is internationalization testing? Explain with types.

  

[5823]-602 2
Total No. of Questions : 5] SEAT No. :
P5159 [Total No. of Pages : 2
[5823]-603
T.Y.B.Sc.
COMPUTER SCIENCE
CS-363 : Web Technologies-II
(2019 CBCS 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. [8×1=8]

a) Which function is used to remove all global session variables?
b) Which information is stored in $_FILES?
c) What are the characteristics of XML?
d) XML tags are case sensitive. Justify true of false.
e) Write the primitive datatypes in JavaScript.
f) Define DOM.
g) What is the use of XML Http Request object?
h) What is Ajax?
i) What is codeIgniter?
j) Which function is used for page redirection in codeIgniter?

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

a) What is the significance of POST method?
b) What is session? How to start the new session?
c) Give relationship between XML and PHP.
d) Explain Synchronous request to the server in Ajax.
e) What is page redirecting? Write down syntax of the function used for
page redirection.

[5823]-603 1 P.T.O.
Q3) Attempt any two of the following (out of three). [2×4=8]
a) What is XML parser? Explain with its types.
b) What is the scope of variable in JavaScript?
c) What are the advantages and disadvantages of AJAX?

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

a) Write a JavaScript code to accept username and password validate it
with username should not be null and password should be at least 6 digit
long.
b) Write a php program to strore current date-time in COOKIE and display
last visited on”. date-time on the webpage upon reopening of the same
page.
c) Create student table as follows student (sno. sname, per). Write Ajax
program to select the student name and print the selected student’s
details.

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

a) Explain use of setcookie () function with its arguments.
b) Explain MVC framework.

  

[5823]-603 2
Total No. of Questions : 5] SEAT No. :
P5160 [Total No. of Pages : 2
[5823] - 604
T.Y.B.Sc.
COMPUTER SCIENCE
CS-364 : Data Analytics
(CBCS 2019 Pattern) (Semester -VI)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) Figures to the right indicate full marks.
2) All questions are necessary.
3) Neat diagrams must be drawn wherever necessary.

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

a) Define Data Analytics.
b) Define Tokenization.
c) Define Machine Learning.
d) What is clustering?
e) What is Frequent Itemset?
f) What is data characterization?
g) What is outlier?
h) What is Bag of words?
i) What is Text Analytics?
j) Define Trend Analytics?

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

a) What is confusion matrix?
b) Define support and confidence in association rule mining.
c) Explain any two Machine Learning (ML) Applications.
d) Write a short note on stop words.
e) Define supervise Learning and unsupervise Learning.
[5823] -604 1 P.T.O.
Q3) Attempt any Two of the following : [2×4=8]
a) What is prediction? Explain any one regression model in detail.
b) Differentiate between Stemming and Lemmatization.
c) Describe types of Data Analytics.

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

a) Consider the following transactional database and find out Frequent
Itemsets using Apriori algorithm with minimum support count=2
TID List _ of _ Item_IDs
T1 I1, I2,I5
T2 I2,I4
T3 I2, I3
T4 I1,I2,I4
T5 I1, I3
T6 I2, I3
T7 I1, I3
T8 I1, I2, I3, I5
T9 I1, I2, I3

b) Which are the challenges in social media analytics?

c) Explain Reinforcement learning.

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

a) Write a short note on support vector machine.
b) Explain life cycle of Data Analytics.

ooo

[5823] -604 2
Total No. of Questions : 5] SEAT No. :
P5161 [5823] - 605
[Total No. of Pages : 2

T.Y. B.Sc.
COMPUTER SCIENCE
CS - 365 : Object Oriented Programming Using Java - II
(2019 Pattern ) (Semester - VI) (CBCS) (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) Define map interface.
b) What is use of wait ( )?
c) What is use of get connection ( )?
d) What is scriplet?
e) What is purpose of JSP directives?
f) Define spring framework.
g) Give the name of JDBC API.
h) Define Iterator Interface.
i) What is ArrayList?
j) Define cookie.

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

a) How to create thread?
b) List JDBC driver.
c) Differentiate between set & list interface.

d) Write any two methods of HTTP_session.

e) What are the applications of spring?

[5823] - 605 1 P.T.O.

Q3) Attempt any TWO of the following. [2×4=8]
a) Write a JDBC program to accept details of Book (B_id, B_name,
B_cost) from user & display it.
b) Write a java program in multithreading to display all the alphabets between
‘A’ to ‘Z’. Each alphabet should display after two seconds.
c) Write a JSP script to check whether given number is perfect or not &
display the result in yellow colour.

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

a) Write a servlet program to count the number of times a servlet has been
invoked [use cookies].
b) Explain life cycle of thread.
c) Differentiate between statement & prepared statement interface.

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

a) Explain JDBC architecture.
b) Write a java program to accept ‘n’ numbers from user, store them into
LinkedList collection. Display only odd numbers.



[5823] - 605 2
Total No. of Questions : 5] SEAT No. :
P5162 [Total No. of Pages : 3
[5823]-606
T.Y.B.Sc. (Computer Science)
CS-366: COMPILER CONSTRUCTION
(CBCS 2019 Pattern) (Semester-VI)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) Figures to the right indicate full marks.
2) All questions are compulsory.

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

a) What is the use of lookahead pointer.

b) State true or false, “Target code is generated in the analysis phase of the
compiler”.

c) What is the output of LEX program?

d) Terminals can have synthesized attributes, but not inherited attributes.

State true or false.

e) Define operand descriptors.

f) State True or False. The yywrap() lex library function by default always
return 1.

g) List the two aspects of compilation.

h) List the different types of conflicts that occur in LR parser.

i) What is handle pruning?

j) List the techniques used in code optimization.

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

a) Define Annotated Parse tree. Give an example.

b) List and explain in short any two LEX library function.

c) Calculate FIRST and follow for the following.

Sa |^| (R)

TS, T|S

R T

d) Give 2 differences between synthesized and inherited attributes.

e) Compute LEADING and TRAILING symbols of the following grammar.

E E+T | T

TTF | F

F(E) | id

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

a) Write a RDP parser for the following grammar.

S aA | SbB

A aA | bB

B b

b) Give difference between single pass compiler & multipass compiler.

c) Check whether the given grammar is LL(1) or not.

S A

A aA | Ad

B bBc | f

C g

[5823]-606 2
Q4) Attempt any Two of the following (out of 3) [2×4=8]

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

N V = E | E

E V

V a / E

b) Consider the expression a = b(  c) + b(  c). Give Triple representation

and quadruple representation.

c) Check whether given grammar is operator precedence or not.

S < L > | a

L L,S | S

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

a) Write a LEX program to find sum of first n numbers.

b) Construct DAG for the following expressions

- b  (a + c) + (a + c)  d

-i=i+5

hhhhh

[5823]-606 3
Total No. of Questions : 5] SEAT No. :
P5163 [5823] - 607
[Total No. of Pages : 2

T.Y.B.Sc. (Computer Science )

CS-3610 : SOFTWARE TESTING AND TOOLS
(2019 Credit Pattern) (Semester -VI) (Paper-VII)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) All questions are compulsory.
2) Figures to be right indicate full marks.

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

a) Define test case.
b) Define static testing.
c) What is test incident report?
d) What is test plan?
e) What is design defect?
f) McCabe’s Cyclomatic complexity defines an lower bound for the number
of linearly path through a program. State true of false.
g) Enlist the two open source automation testing tools.
h) What is defect?
i) What is entry criteria?
j) Write two limitation of manual testing.

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

a) Define errors with its different types.
b) Enlist the different types of loop testing.
c) Write objective of writing test cases.
d) What is testing defect? List its different types.
e) Write the name of test automation frameworks.

[5823] -607 1
P.T.O.
Q3) Attempt any TWO of the following. (Out of Three). [2×4=8]
a) Define bug and explain bug tracking tools.
b) Explain branch coverage testing with its advantages and disadvantages.
c) Explain IEEE Std. test summary report with its various parameters.

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

a) Write a test case for facebook login functionality of the web page
application.
b) Consider following code.
Input (int x, int y)
{
int z = ((x+y)/200) * 100;
If (z>50)
Printf(“PASS”);
Else
Printf(“FAIL”);
}
Test case 1 : x=20, y = 30, Test case 2: x=100, y=75
Consider above test cases scenarios and find the percentage of statement
coverage.
c) Write benefits of automated testing.

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

a) Explain defect life cycle.
b) Write selenium installation steps.

ooo

[5823] -607 2