Total No. of Questions : 5] SEAT No.

:
PB1883 [Total No. of Pages : 2
[6237]-501
T.Y.B.Sc.
COMPUTER SCIENCE
CS-351 : Operating Systems - I
(Revised 2019 Pattern) (New CBCS) (Semester-V) (Paper-I)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Neat diagrams most be drawn wherever necessary.
4) Assume suitable data if necessary.

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

a) List types of Senaphore.
b) Define segmentation.
c) Which schedular controls the degree of multiprogramming.
d) What do you mean by system call?
e) Define system booting.
f) What do you mean by thread?
g) List the purpose of synchronization.
h) Define the term Dispatcher.
i) Define CPU bound process.
j) Define Virtual Memory.

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

a) List the benefits of thread.
b) List advantages of pre-emptive and non-premptive scheduling algorithm.
c) Define operating system. Write any two tasks of O.S.
d) Consider refference string 1, 3, 3, 2, 5, 4, 5, 4, 1, 4, 2, 2, 5 and number
of frames are three. Calculate total no. of page faults using optimal page
replacement Algorithm.
e) A counting semaphore S is initialized to 10. Then 6p operations and 4v
operations are performed on S. What is the final value of 8?

P.T.O.
Q3) Attempt any Two of the following. [2×4=8]
a) What is process? Explain the different types of process states.
b) Consider the following snapshot of a system.
Process CPU Burst time Arrival time
P1 5 3
P2 2 0
P3 2 4
P4 3 5
Draw the Gratt chart and calculate average wairting and average turn
around time for the follwing scheduling algorithms.
i) Preemptive SJF.
ii) Round Robin (Time Quantum = 2)
c) Compare MFT and MVT of memory partation.

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

a) What is critical section problem? Give peterson’s solution to solve critical
section problem.
b) Consider the following segment table
Segment Base Length
0 600 120
1 1200 350
2 75 85
3 1760 90
What are the physical addresses for the following logical addresses.
i) 0,125
ii) 1,310
iii) 3,88
iv) 2,77
c) Explain multilevel queue scheduling Algorithm.

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

a) Define swaping. Write advantages & disadvantages of swapping.
b) Explain different types of services provided by an operating system.

eeee

[6237]-501 2
Total No. of Questions : 5] SEAT No. :
PB1884 [Total No. of Pages : 2
[6237]-502
T.Y.B.Sc. (Computer Science)
CS - 352 : COMPUTER NETWORKS - II
(Revised 2019 Pattern) (Semester - V) (CBCS)

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) List SSL/TSL four protocols.

b) List the types of MPEG frames.

c) What is frequency masking?

d) What is the difference between plaintext and cipher text?

e) What do you mean by cryptography and cryptoanalysis.

f) List the PGP services.

g) State the need of VPN.

h) List the services of user agent.

i) What is Hierarchical name space.

j) What do you mean by Voice over IP.

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

a) Write a short note on Message confidentiality - With Symmetric key

cryptography.

b) Distinguish between message integrity and message authentication.

c) List the types of Email architecture. Explain in short any one.

d) What are RTCP - message types?

e) Compare and contrast FTP and HTTP.

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

a) Write a short note on SSL services.

b) Explain the header format of the authentication header in transport mode.

c) Write a short note on Message Access Agent : POP and IMAP.

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

a) Compare streaming stored, streaming live and interactive live audio/video.

b) Explain transposition cipher with example.

c) Write a short note on Proxy firewall.

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

a) Explain various security services.

b) Explain any two fundamental cryptographic principles.


[6237]-502 2
Total No. of Questions : 5] SEAT No. :
PB1885 [Total No. of Pages : 2
[6237]-503
T.Y.B.Sc.
COMPUTER SCIENCE
CS-353: Web Technologies-I
(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.

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

a) In PHP which protocols used to send an email?
b) Which tag is used to set the text in Superscript format?
c) In PHP which function is used to create connection to the database?
d) What is a frameset?
e) Which tag specifies additional details that the user can view or hide on
demand?
f) How will you find number of elements in Array?
g) Define SMTP.
h) What is a PEAR?
i) What is HTTP stands for?
j) Which tag is used to add images to the HTML document?

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

a) What is role of web server and web browser?
b) Explain Anonymous function concept in PHP.
c) Write the Output for following code:-

<?php

$file=fopen("pragati.txt", "w");
echo fwrite($file, "Hello World. Testing!");
fclose($file);

?>
P.T.O.
 d) Write the Output for following code:-

<?php

$n = array("a"->10, "b"=>35, "c"->12);

extract($n);
echo $a. " " . $b. " " . $c;

?>

e) Write the functions of decompose string with suitable example.

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

a) Discuss the Scope of a Variable in PHP with an example.
b) What is Form? How to create a Form?
c) Explain the concept of missing parameters to a function with suitable
example.

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

a) Write a complete PHP script to accept three strings str1, str2, str3 from
user. Search str2 is str1 and replace all occurrences of str2 by str3. Also
display total number of occurrence.
b) Write PHP Script to accept file name from user and print total number of
words.
c) Write a PHP program to accept associative array of five expenses
(electricity bill, Phone bill, petrol bill, property tax, college fees) and
their respective amount of two persons. Print the total expenditure of
each person.

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

a) Explain the execution of PHP script with help of diagram.

b) Define file. How to create it? Explian with example.



[6237]-503 2
Total No. of Questions : 5] SEAT No. :
PB1886 [6237]-504
[Total No. of Pages : 2

T.Y. B.Sc.
COMPUTER SCIENCE
CS-354 : Foundation of Data Science
(Revised 2019 Pattern) (CBCS) (Semester - V) (Theory)
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 word cloud?
b) Why data cleaning is important operation of data preprocessing?
c) Define Statistical data analysis?
d) What is the purpose of data Visualization?
e) List any two applications of data Science.
f) What do you mean by data transformation?
g) What is Visual encoding?
h) Define Bubble plot?
i) What is CSV format?
j) Define Standard derivation?

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

a) What is 3V’s?
b) What are the uses of XML files?
c) Calculate mean, mode, median and range:
22, 24, 35, 47, 23, 23, 31, 25
d) Why data preprocessing is important before data analysis?
e) List different types of data attributes with example.

[6237]-504 1 P.T.O.
Q3) Attempt any two of the following. [2×4=8]
a) What do you mean by Data Reduction? Explain any two Data Reduction
strategies.
b) What do you mean by hypothesis testing? Explain null and alternate
hypothesis.
c) How to visualize geospatial data? Explain in detail.

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

a) What are the components of data scientist tool box? Explain two of
them in detail.
b) What is Outlier? Explain types of outlieas.
c) What are the various types of data? Explain in detail.

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

a) What do you mean by data discretization? Explain discretization by

Histogram analysis.
b) Write short note on different methods fer measuring data simillarity and
Dissimilarity.

  

[6237]-504 2
Total No. of Questions : 5] SEAT No. :
PB1887 [6237]-505
[Total No. of Pages : 2

T.Y. B.Sc.
COMPUTER SCIENCE
CS-355 : Object Oriented Programming Using Java - I
(Revised 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) What is the purpose of Javap?
b) List any two datatypes in java.
c) Write the purpose of this keyword.
d) What is the use of tostring ( )?
e) Write the use of abstract keyword.
f) Define interface.
g) List any two Reader Classes.
h) How to check end of file?
i) What is panel?
j) Give the names of any two Layout Managers.

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

a) Differentiate between method overloading and method overriding.
b) State any four access specifiers in Java.
c) What is Marker interface?
d) What is Exception? List its any two types.
e) What is Swing? How it is differ from AWT?

[6237]-505 1 P.T.O.
Q3) Attempt any TWO of the following. [2×4=8]
a) Write a java program to display contents of file in reverse order.
b) Write a java program using swing to accept student details (rno, name,
percentage) 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 rectangle.

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

a) Write a java program to accept employee name from user, if it is not
valid then throw user defined exception “InvalidName” otherwise display
a name.
b) What is Layout Manager? Explain it with example.
c) Explain the uses of final keyword with example.

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

a) Explain the features of Java.

b) Explain event delegation model in Java.

  

[6237]-505 2
Total No. of Questions : 5] SEAT No. :
PB1888 [Total No. of Pages : 2
[6237]-506
T.Y.B.Sc.
COMPUTER SCIENCE
CS-356 : Theoretical Computer Science
(Revised 2019 Pattern) (Semester-V) (CBCS)

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 TEN) [8×1=8]

a) Give the meaning of ‘δ’ function of NFA
b) State pumping lemma of regular set.
c) Define suffix of a string. Give one example.
d) If A={ε}. Find the value of A.
e) Define context sensitive grammar.
f) Compare ‘λ’ function of Melay and Moore Machine.
g) Name the type of language accepted by Pushdown Automata.
h) “PDA is more powerful than FA”. Justify.
i) Define tuples of turing Machine.
j) State two differences between NFA and DFA.

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

a) Explain types of Regular grammar.

b) Construct NFA for regular expression.(1*+0)*

c) Differentiate between Moore and Mealy machine.

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

e) Write a regular expression for language contains set of all strings of a’s
and b’s ending in bb..

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

a) Construct a NFA for a language to accept strings which contains substring
‘abbc’ over the set of alphabets {a,b,c}
b) Convert the following CFG into Chomsky Normal Form (CNF)
S->ABA
A->aA|∈
B->bB|∈
c) Design TM for language which accept regular language a *b*

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

a) Construct a PDA for the language
L={WWR|W is in (a+b)*}
b) Construct a Moore machine to generate 1’s complement of binary number.
c) Write short note on Chomsky hierarchy.

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) { n n

}
Show that L = 0 1 | n >= 1 is not regular.


[6237]-506 2
Total No. of Questions : 5] SEAT No. :
PB1889 [6237]-507
[Total No. of Pages : 2

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 in indentation?
b) List the features of Python?
c) What are break and continue statements?
d) List any two built-in exceptions?
e) What is the purpose of range ( ) function?
f) What does the following function return - clock ( ) and gmtime ( ).
g) Compare for and while loop.
h) Define text and binary files.
i) Define list and dictionary.
j) What is lambda function?

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

a) Explain built-in string methods with example.
b) How to list files and directories? Describe with example.
c) Explain set union and intersection with example.
d) What is recorsion? Explain with example.
e) What are the basic tuple operations? Explain with example.

[6237]-507 1 P.T.O.
Q3) Attempt any two of the following. [2×4=8]
a) Write a phython program to find factorial of a number.
b) Write a python program to check if a given number is Armstrong.
c) Write a python program to check whether a given string is Palindrome or
not.

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

a) Write a python program to check if a given key already exists in a
dictionary.
b) Write a python program to put even and odd elements of a list into two
different lists.
c) Write a python program to count vowels and consonants in a string.

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

a) Trace the output of the following
import tracebook
try:
x =8/0
print(x)
except:
print (“error update”)
traceback print-exc ( )
Print (“Program Execution Successful”)
b) Trace the output of the following
n = 50
i=5
s=0
while i < n :
st = i
i + = 10
Print (“ i =” , i)
Print (“Sum = “, Sum)

  

[6237]-507 2
Total No. of Questions : 5] SEAT No. :
PB1890 [Total No. of Pages : 2
[6237]-508
T.Y.B.Sc.
COMPUTER SCIENCE
CS - 3511 : Block Chain Technology
(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 indicates full marks.
3) Neat diagrams must drawn wherever required.

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

a) Define plain text and cipher text.
b) Which institute standardised AES algorithm?
c) What is a hash function?
d) Who proposed a white paper for Ethereum in 2013.
e) What is block height?
f) Define Nonce.
g) Which programming language is used to write a smart contract in Remix?
h) What is a time - stamp?
i) What is gas price?
j) Name any five cryptocurrencies.

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

a) What are the benefits of immutable ledger in blockchain.
b) Explain the structure of a block in blockchain.
c) Explain merkle tree with diagram.

P.T.O.
 d) List and explain value data types in solidity.
e) What is hard fork and soft fork?

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

a) Differentiate between blockchain and databases.
b) What are the tasks of miners?
c) Explain the widely used cryptographic algorithms.

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

a) Write a short note on DES.
b) List the advantages of smart contract. Explain any four.
c) Explain the working of DAO.

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

a) Define transaction and explain its structure.
b) Write a short note on cryptowallets.



[6237]-508 2