M.SC (Computer Science) 2019 Pattern
M.SC (Computer Science) 2019 Pattern
[6173]-11 2
Total No. of Questions : 7] SEAT No. :
P8573 [Total No. of Pages : 4
[6173] - 12
M.Sc. - I
COMPUTER SCIENCE
CSUT-112 : Design and Analysis of Algorithms
(CBCS 2019 Pattern) (Semester - I)
P.T.O.
Q3) Attempt the following.
a) Write algorithm to find maximum from an array of N integers using
Divide and Conquer Strategy. Show how it works on the following input
numbers. [7]
24, 2, 34, 18, 45, 23, 58
0 10 9 4
20 0 7
A
7 10 0 6
5 5 2 0
[6173] - 12 2
b) Find the shortest distance from source vertex ‘S’ to all other vertices
Using Dijkstra’s Method. [5]
b) Write an algorithm for insertion sort and state its time complexity for best
case and average case. [5]
a) Define Hamiltonian cycle. Find all possible Hamiltonian cycles that starts
with vertex 1.
[6173] - 12 3
b) What do you mean by Branch and Bound strategy? Obtain the reduced
cost matrix for the TSP instance given by the cost matrix.
10 8 4
16 6 7
A
15 4 4
15 6 12
i) P Class
ii) NP Class
[6173] - 12 4
Total No. of Questions : 7] SEAT No. :
P-8574 [Total No. of Pages : 2
[6173]-13
F.Y. M.Sc.
COMPUTER SCIENCE
CSUT - 113 : Database Technologies
(2019 Pattern) (Semester - I)
Time : 3 Hours] [Max. Marks : 70
Instructions to the candidates :
1) Question 1 is compulsory.
2) Solve any five questions from Q. 2 to Q.7.
3) Questions Q. 2 to Q. 7 carry equal marks.
P.T.O.
Q4) Attempt all. [12]
a) What are the styles of distributing data? [2]
b) Relational databases are not designed to run on Clusters. Comment. [5]
c) What is deployment complexity? [5]
[6173]-13 2
Total No. of Questions : 5] SEAT No. :
P8575 [Total No. of Pages : 5
[6173]-14
First Year M.Sc. (Computer Science)
CSDT114A : CLOUD COMPUTING
(CBCS 2019 Pattern) (Semester - I)
P.T.O.
Total No. of Questions : 5]
P8575
[6173]-14
First Year M.Sc. (Computer Science)
CSDT-114B : ARTIFICIAL INTELLIGENCE
(CBCS 2019 Pattern) (Semester - I)
[6173]-14 2
Q4) Attempt the following : [10]
a) Explain use of AO* algorithm. [2]
b) Find the best move for the MAX player using the mini-max procedure &
perform left-to-right alpha- beta pruning on the tree to indicate where
cut-offs occur. [4]
[6173]-14 3
Total No. of Questions : 5]
P8575
[6173]-14
First Year M.Sc. (Computer Science)
CSDT-114C: WEB SERVICES
(CBCS 2019 Pattern) (Semester - I)
ii) Explain design guidelines for building RESTful Web services. [4]
b) What is SOAP? Give the structure of SOAP message and explain it. [4]
b) List SOAP communication style and explain any one in detail. [5]
[6173]-14 5
Total No. of Questions : 7] SEAT No. :
P8576 [6173]-21
[Total No. of Pages : 2
M.Sc. - I
COMPUTER SCIENCE
CSUT-121 : Advanced Operating System
(2019 Pattern) (Semester - II)
Time : 3 Hours] [Max. Marks : 70
Instructions to the candidates:
1) Question 1 is compulsory.
2) Solve any 5 questions from Q.2 to Q.7
3) Questions 2 to Questions 7 carry equal marks.
[6173]-21 1 P.T.O.
Q4) Attempt all questions.
a) Explain how Linux handles a system call? [5]
b) Explain setuid(), seteuid(), getuid(), geteuid(). [5]
c) Explain the disadvantages of mmap. [2]
[6173]-21 2
Total No. of Questions : 7] SEAT No. :
P.T.O.
Q4) Attempt all questions.
a) Explain SQLiteOpenHelper and SQLiteDatabase in Android. [7]
b) Explain different features of swift programming. [5]
[6173]-22 2
Total No. of Questions : 7] SEAT No. :
[6173]-23 2
Total No. of Questions : 5] SEAT No. :
P8579 [Total No. of Pages : 4
[6173]-24
First Year M.Sc. (Computer Science)
CSDT - 124B : HUMAN COMPUTER INTERACTION
(CBCS 2019 Pattern) (Semester - II)
a) Define synthesizability.
[6173]-24 2
Total No. of Questions : 5]
P8579
[6173]-24
First Year M.Sc. (Computer Science)
CSDT - 124 C : SOFT COMPUTING
(CBCS 2019 Pattern) (Semester - II)
[6173]-24 3
b) Let x x , x y y , y , and z z , z , z consider the following
fuzzy relations : [4]
y y z z z
x . . y . . .
R and S
x . . y
. . .
. .
‘short’
[6173]-24 4
Total No. of Questions : 7] SEAT No. :
P.T.O.
Q5) Attempt all questions :
a) i) List participants and structure of observer design pattern. [4]
ii) Explain in Detail Cohesion. [3]
b) Explain GWT architecture in Short [5]
[6173]-31 2
Total No. of Questions : 7] SEAT No. :
P8581 [6173]-32
[Total No. of Pages : 2
e) What is overfitting?
g) What is precision?
[6173]-32 1 P.T.O.
Q4) Attempt all of the following.
a) Draw dendrogram for the following dataset using single linkage. [7]
Custamer Age
A 7
B 10
C 15
D 22
E 28
b) Explain various types of linkage methods. [5]
[6173]-32 2
Total No. of Questions : 7] SEAT No. :
P-8582 [Total No. of Pages : 2
[6173]-33
M.Sc.
COMPUTER SCIENCE
CSUT - 233 : Web Frameworks
(2019 Pattern) (Semester - III)
Time : 3 Hours] [Max. Marks : 70
Instructions to the candidates :
1) Q. 1 is compulsory.
2) Solve any Five questions from Q.2 to Q. 7 of the following.
3) Q.2 to Q.7 carry equal marks.
4) Neat diagrams must be drawn wherever necessary.
5) Figures to the right side indicates full marks.
P.T.O.
Q4) Attempt all of the following: [12]
a) What is Callback and Promises in JavaScript? Explain with suitable
example. [7]
b) Create an HTML form that contain the Employee Registration details and
write a JavaScript to validate DOB, Joining Date and Salary. [5]
[6173]-33 2
Total No. of Questions : 5] SEAT No. :
P8583 [Total No. of Pages : 2
[6173]-34
S.Y. M.Sc. (Computer Science)
CSDT-234A : BIG DATA ANALYTICS
(2019 Pattern) (CBCS) (Semester - III)
P.T.O.
Q3) Attempt any Two of the following : [2×4=8]
[6173]-34 2
Total No. of Questions : 5] SEAT No. :
P8584 [Total No. of Pages : 2
[6173]-35
S.Y. M.Sc. (Computer Science)
CSDT234B : WEB ANALYTICS
(2019 Pattern) (CBCS) (Semester - III)
P.T.O.
Q3) Attempt any Two of the following : [2×4=8]
c) Explain the purpose of online survey with its benefits and give the details
of different online survey tools.
[6173]-35 2