M.SC ( COMPUTER SCIENCE ) 2023 PATTERN
M.SC ( COMPUTER SCIENCE ) 2023 PATTERN
:
PB3019 [Total No. of Pages : 3
[6255]-101
First Year M.Sc. (Computer Science)
CS-501-MJ : ADVANCED OPERATING SYSTEM
(2023 Credit Pattern) (Semester-I)
a) Define interrupt.
e) Justify “In linux the files are usually accessed via filenames”.
P.T.O.
Q3) Attempt the following.
a) i) How does the command mkdir work? [4]
ii) Explain the behavior of following C program. [3]
#include <fcntl.h>
char string = "hello";
main(argc, argv)
int argc;
char * argv[];
{
int fd;
char buf [256];
mknod("fifo",010777,0);
if (argc= =2)
fd= open("fifo", O_WRONLY);
else
fd= open("fifo", O_RDONLY);
for (;;)
if (argc==2)
write(fd, string, 6);
else
read(fd, buf, 6);
}
b) Explain scenario of “delayed write buffer” with suitable diagram. [5]
[6255]-101 2
Q5) Attempt the following.
a) i) Explain process and its states with help of diagram. [4]
ii) Write a program that will read data from one file and will copy into
another file. [3]
b) What is race condition? Explain any one scenario in which race condition
occurs. [5]
[6255]-101 3
Total No. of Questions : 6] SEAT No. :
PB-3020 [Total No. of Pages : 3
[6255]-102
M.Sc.
COMPUTER SCIENCE
CS-502-MJ: Artificial Intelligence
(2023 Pattern) (Semester - I)
Time : 3 Hours] [Max. Marks : 70
Instructions to the candidates:
1) All question are compulsory.
2) Figures to the right indicate full marks.
P.T.O.
Q3) Attempt any three of the following. [12]
a) Explain Mean end analysis algorithm?
b) Difference between predicate and propositional logic?
c) Difference between Breadth First and Depth First Search algorithm.
d) Explain Optimal Decisions in Games?
Q4) Attempt any three of the following. [12]
a) Difference between Forward Chaining and Backward Chaining.
b) Explain AO* algorithm with a suitable example.
c) Explain Alpha Beta pruning algorithm with example?
d) Explain the Best first search.
Q5) Attempt the following : [12]
a) Solve any two [2 × 5 = 10]
i) Explain IDDFS algorithm?
ii) Explain A*algorithin with a suitable example.
OR
Give symbolic form of following statements (predicate logic)
I) Some men are genius.
II) For every x, there exists a y such that x2 +y2 >=100
III) Given any positive integer, there is greater positive integer
IV) Everyone who like fun will enjoy each of these plays.
V) Some students are clever.
iii) Let p. He is intelligent and q: He is tall be two propositions. Write each of
the Following statement in symbolic form using p and q:
I) He is tall but not intelligent.
II) He is neither tall nor intelligent.
III) He is intelligent or he is tall.
IV) It is not true that he is intelligent or tall.
V) It is not true that he is not tall or not intelligent.
b) Explain Games theory in Artificial Intelligent. [1 × 2 = 2]
[6255]-102 2
Q6) Attempt any two of the following. [10]
a) Explain the Application of AI in different domain?
b) How to define a problem as state space search? Discuss it with the help
of water jug example.
[6255]-102 3
Total No. of Questions : 5] SEAT No. :
PB-3021 [Total No. of Pages : 2
[6255]-103
M.Sc. (Computer Science)
CS - 503 - MJ : PRINCIPLES OF PROGRAMMING
LANGUAGES
(2023 Pattern) (Semester - I) (Paper - I)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) Q.1 is compulsory.
2) Solve any Three questions from Q.2 to Q.5.
[6255]-103 2
Total No. of Questions : 5] SEAT No. :
PB3022 [6255]-104
[Total No. of Pages : 2
[6255]-104 1 P.T.O.
Q5) Attempt any two of the following [10]
a) Create employee collection with following fields Employee (eno,ename,
salary, designation, Dept: {deptno, dname, Location}, Proiect: {Pname,
HRs}) [5]
i) Display all employee whose salary > 20,000
ii) Display all employee details whose name start with’p
iii) Update employee name where eno is 11.
iv) Sort the pname in tescenting order.
v) Update the location from pune to Mumbai.
b) Explain following form attribute [5]
i) Autocomplete
ii) Form
iii) Formenctype
iv) Formaction
v) Autofocus
c) Explain advantages and disadvantages of Bootstrap. [5]
[6255]-104 2
Total No. of Questions : 5] SEAT No. :
PB3023 [Total No. of Pages : 2
[6255]-105
First Year M.Sc.
COMPUTER SCIENCE
CS-512-MJ : Cloud Computing
(2023 Credit Pattern) (Semester - I)
d) What is Hypervisor?
P.T.O.
Q3) Attempt the following : [10]
[6255]-105 2
Total No. of Questions : 6] SEAT No. :
PB3024 [6255]-106
[Total No. of Pages : 2
[6255]-106 2
Total No. of Questions : 6] SEAT No. :
P.T.O.
Q3) Attempt any three of the following : [12]
[6255]-107 2
Total No. of Questions : 6] SEAT No. :
PB3026 [Total No. of Pages : 3
[6255]-201
First Year M.Sc.
COMPUTER SCIENCE
CS-551 - MJ : Design and Analysis of Algorithms
(2023 Credit Pattern) (Semester - II)
Time : 3 Hours] [Max. Marks : 70
Instructions to the candidates:
1) All questions are compulsory.
2) Neat diagrams must be drawn wherever necessary.
3) Use of single memory non programmable scientific calculator is allowed.
Q1) Solve any five of the following. [5×2=10]
a) Define time complexity. List asymptotic notations.
b) Merge sort is in place algorithms. Justify.
c) Consider 4 programs with the length 14, 5, 20, 8, 3 respectively are to be
stored on a computer tape. Find MRT using greedy method.
d) What is negative weighted cycle? Does Flyod Warshall algorithm consider
the negative weighted cycle?
e) What do you mean by branch and bound? Where this technique might be
useful.
f) Define P & NP class problem.
P.T.O.
Q3) Attempt any two questions. [2×6=12]
a) Apply the Merge Sort to sort the following numbers. Derive its Time
complexity.
26, 5, 37, 1, 61, 11, 59, 15, 48, 19.
b) What is the best way to multiply a chain of matrices A1, A2, A3, A4 with
dimensions 15×5, 5×10, 10×20, 20×25 respectively using Dynamic
Programming?
c) Find shortest path for all vertices by using Dijkstra’s Algorithm.
[6255]-201 2
Q5) Attempt any two questions. [2×6=12]
a) What is m-colouring problem? Find all possible solutions when the
following graph is coloured with exactly 3 colours.
10 8 14
22 7 6
A=
9 10 4
5 6 2
c) Find the minimum spanning tree for the following graph using Kruskal’s
Algorithm.
[6255]-201 3
Total No. of Questions : 6] SEAT No. :
P.T.O.
Q3) Solve any three of the following : [3 × 4 = 12]
a) What is thread? Explain the use of AsynTask class.
b) What is Android OS? Explain its architecture in detail.
c) Explain PhoneGap Plug-Ins? Explain steps to publish a plugin to npm.
d) Explain various types of Mobile OS. Differentiate them.
[6255]-202 2
Total No. of Questions : 5] SEAT No. :
PB3028 [Total No. of Pages : 2
[6255]-203
First Year M.Sc.
COMPUTER SCIENCE
CS-553-MJ : Software Project Management
(2023 Credit Pattern) (Semester - II)
a) What is Project?
c) What is CMM?
e) What is Solicitation?
f) What is Risk?
P.T.O.
Q3) Attempt the following :
a) What is GANTT chart? What are the uses of GANTT charts? [4]
[6255]-203 2
Total No. of Questions : 5] SEAT No. :
a) What are symbols in ES6 and how are they used? Explain with an
example. [2]
P.T.O.
Q3) Attempt the following : [10]
a) Explain what TypeScript is with Static Typing feature with example?
[2]
b) What is middleware in ExpressJS. Provide examples of three common
middleware functions used in ExpressJS. [4]
c) Explain the concept of the event loop in Node.js and discuss its role in
managing asynchronous operations. [4]
[6255]-204 2
Total No. of Questions : 6] SEAT No. :
PB-3030 [Total No. of Pages : 2
[6255]-205
M.Sc. (Computer Science)
CS - 562 - MJ : WEB SERVICES
(2023 Pattern) (Semester - II)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Questions 2 to 6 carry equal marks.
[6255]-205 2
Total No. of Questions : 5] SEAT No. :
PB-3031 [Total No. of Pages : 2
[6255]-206
F.Y. M.Sc. (Computer Science)
CS - 564 - MJ : ASP.NET PROGRAMMING
(2023 Pattern) (Semester - II)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Neat diagrams must be drawn wherever necessary.
[6255]-206 2