M.Sc. - Comp. Sci

Total No.
of Questions : 5 ]
P594
SEAT No. :
[Total No. of Pages : 3
[4339] - 102
M.Sc. (Semester - I)
Time :3 Hours]
COMPUTER SCIENCE
CS - 102 : Advanced Networking
(2011 Pattern)
[Max. Marks :80
Instructions to the candidates:

1)
Neat diagrams must be drawn wherever necessary.
2)
Figures to the right indicate full marks.
3)
All questions are compulsory.
Q1) Attempt all of the following :
[8 2 = 16]
a)
Why CSMA/CD is not used in gigabit ethernet ?
b)
List any two advantages & disadvantages of ECB & CBC mode.
c)
Why does RTP needs the service of another protocol, RTCP, but TCP
does not ?
d)
How timestamps -based authentication works ?
e)
What is DNS spoofing ?
f)
A routing table has 25 entries. It does not receive information about five
routers for 200 sec. How many timers are running at this time ?
g)
In an IP packet, the value of HLEN is 1000 in binary. How many bytes of

options are being carried by this packet ?
h)
Why is anonymous offline electronic money dangerous ?
Q2) Attempt any four of the following :

a)
[4 4 = 16]
When a user wants to send an email to multiple recipients, how PGP

handles the security ?
P.T.O.
b)
Give a potential disadvantage when Nagle's algorithm is used on a badly

- congested network ?
c)
In the fig. Show which router (s) sends out router link & network link
LSAs ?
d)
Apply play fair cipher on plain text University of Pune & use keyword
as "Systems".
e)
Explain different strategies of transition from IPv4 to IPv6.
[4 4 = 16]
a)
List the different technologies used to connect two remote devices in

point to point WAN. Explain any one in detail.
b)
Explain AH & ESP Protocols used in IPSec.
c)
Do you think H.323 is actually the same as SIP ? What are the differences?
Make a comparison between the two.
d)
What is attack ? Explain active & passive attacks.
e)
Explain key transformation & expansion permutation process in DES.
[4 4 = 16]
a)
Explain the working of Kerberos ?
b)
What are the typical contents of a digital certificate ?
c)
Explain how transport layer handles buffer allocation dynamically.
d)
Given two prime numbers P=17 & Q= 29, find out N,E & D in an RSA
encryption process.
e)
Explain how distance vector routing algorithm is used for creating the
routing table for routers in AS.
[4339] - 102
[4 4 = 16]
a)
Imagine a generalized n-army problem, in which the agreement of any

two of the blue armies is sufficient for victory. Does a protocol exist that
allows blue to win ? Justify.
b)
Application gateway firewall are generally more secure than packet

filters. - Justify.
c)
Explain how 3 - D secure protocol is used to provide security to the credit

card on the Internet.
d)
What is count to infinity problem ? Suggest solutions on that.
e)
Contrast error reporting messages in ICMPv6 with error reporting

messages ICMPv4.
nnn
[4339] - 102
Total No. of Questions : 5 ]
SEAT No. :
P595
[4339] - 103
M.Sc. COMPUTER SCIENCE
CS - 103: Distributed Database Concepts
(New 2011 Pattern) (Semester - I)
Time :3 Hours]
[Max. Marks :80
Instructions to the candidates:-
Q1) Atempt (any 8)
[8 2 = 16]
a)
State breigly, ther two basic alternatves of plcing data in a DDBS.
b)
State any 4 different forms of heterogeneity, found in a DDBS?
c)
Define the following:

i)
ii)
The Completeness rule of frogmentation.

The Disyontness rule of fragmentation.
d)
Define the frocessof localization of data involved in a query.
e)
State the following rules of neduction for primory horizontal fragmentation
f)
i)
reduction for selection
ii)
reduction for goin
Define the following:

i)
An irreducible query
ii)
A monorelation query.
g)
State what do you mean by a join selectivty factor between two nelation
R&S?
h)
Define a degree 3 lavel of consistomcy for a transaction.
i)
Define the concept of senalizality of distnbuted tronaection
P.T.O.
Q2) Justify the following (any eight)
[8 2 = 16]
a)
We can set only one of the two time values with the utime function.
b)
Getcwd ( ) is preferred than getwd ( ) in applications.
c)
No process can preeempt another process executing in the kernel.
d)
The kernel does a longjump to restore a previously saved context if it has

no way to complete the system call it is executing.
e)
A process never executes in user mode before handling outstanding

signals.
f)
It is very important that any signal handler has to be very careful about
the action it performs and the data it touches.
g)
Creating a Windows process consists of several stages.
h)
Create Thread notifies the windows subsystem about the new theread.
i)
Thread prority levels are assigned from different perspectives.
j)
The kernel never schedules Zombie process to execute.
Q3) Attempt any four of the following:
[16]
a)
Explain architecture of Unix Operating system with system Kernel in detail.
b)
The following sequence of code has been observed in program.

dup2(fd,o);
dup2(fd,1);
dup(fd,2);
if(fd>2)
close(fd);
To see why the if test is needed, assume that if is 1 and draw apicture of
[4336]- 202
what happens to the three descriptor entries and the corresponding file table
entry with each call to dup2. Then assume that fd is 3 & draw the same
picture.
c)
Explain six values for param defined in <malloc.h> supported by Linux.
d)
Explain the following functions sigaction( ), sigpending( ).
e)
Explain the kernel-mode components of Windows.
Q4) Explain the behavior of following C Program (any four)
[2 8 = 16]
a)
#include,fcntl.h>
main(argc,argv)
int argc;
char*argv[];
{
int fd, skval;
Char c;
if(argc!=2)
Exit( );
fd = open(argv[1],O_RDONLY);
if(fd= =-1)
exit( );
while(skval= read(fd,&c,1)
{
print("char%\n",c);
[4336]- 202
P.T.O.
skval=lseek(fd,1023l,1);
Printf("new seek val %d\n",skval);
}
}
b)
#include <unisted.h>
#include <stdio.h>
#include <sys/types.h>
#include <sys/wait.h>
int main (void)

{
int status;
pid_t pid;
if (!fork( ))
return 1;
pid = wait (&status);
if (pid = = -1)
perror (''wait'');
printf ("pid=%d\n",pid);
if (WIFEXITED(status))
printf ("Normal termination with exit status=%d\n", WEXITSTATUs(status));
if (WIFSIGNALED (status))
Printf ("Killed by signal=%d%s\n",WSTOPSIG (status),
WCOREDUMP (STATUS)}?" (dumped core)" : mm); if (WIFSTOPPED (status))
[4336]- 202
printf("stopped by signal=%d\n",WSTOPSIG (status));

if (WIFCONTINUED (status))
prinff ("Continued\n");
return 0;
}
c)
void print_chars (int n, char c)

{
int i;
fo (i = 0; i < n; i++) {
char *s;
int j;
s = calloc (i + 2, 1);
if (!s) {
perror ("calloc");
break;
}
for (J = 0; j < i + 1; j++)
s[j] = c;
printf ("%s\n",s);
free (s);
}
}
(Consider n=7 & c is *)
d)
char string{} = "hello";

main( )
{char buf[1024];
[4336]- 202
P.T.O.
char * cp1,*p2;
int fds[2];
cp1 = string;
cp2 = buf;
while(*cp1)
*cp2++ = *cp1++;
pipe(fds);
for(;;)
{
Write(fds[1[,buf,6);
read(fds[0],buf,6);
}
}
f)
#include<signal.h>
main( )
{
register int i;
setpgrp( );
for(1 =0;i<10;i++)
{
if(i&1)
setpgrp ( );
[4336]- 202
printf("pid=%d pgrp = %d\n"), getpid( ),

getpgrp ( ));
pause( );
}
kill(0,SIGINT);
}
e)
#include<signal.h>
main ( )
{
into i. *ip;
extern f( ), sigcatch( ) ;
ip = (int *)f;
for(i=0;i<20;i++)
signal(i,sigcatch);
*ip = 1;
printf("after assign to ip\n");
f( );
}
f( ) { }
sigcatch(n)
int n;
{
printf("causght sig % d\nnn, n);
exit(1);
}
Q5) Write a C Program for the folowing: (Any four)

a)
[ 4 4 = 16]
Writ a C Program to demonstarte use of Exit Handler.
b)
Write a C Program that creates two files, one with a umask of 0 and one
with umask that disables all the group and other permission bits.
[4336]- 202
7
c) Write a C Program to demonstarte Race condition in catching Signals.
d)
Write a C Program to catch SIGUSR1 & SIGUSR2.
P596
SEAT No. :
[4339] - 104
COMPUTER SCIENCE
CS - 104 : Design and Analysis of Algorithms
(2011 Pattern)
Time :3 Hours]
[Max. Marks :80
Instructions to the candidates:1)
2)
3)
4)
All questions carry equal marks.
5)
Use of calculator is allowed.
Q1) Attempt any eight of the following :
[ 8 2 = 16]
a)
Define Big- Ohnotation . Is 2n+1 = O (2n) ?
b)
What operations does heap data structure support and what is the growth
rate of these operations ?
c)
Merge sort is in - place algorithm. Justify.
d)
Greedy strategy may not always yield optimal solution. Justify.
e)
What is optimal substructure property ? List any two problems which

satisfy this property.
f)
What is the difference between tree edge and forward edge ?
g)
Why bounding functions are useful in context of Branch and Bound

strategy ?
h)
What is satisfiability problem ? State Cook's theorem.
i)
Define interpolation problem.
j)
Backtracking is Breadth First Search ( BFS) for solution. Justify.

P.T.O.

a)
[4 4 = 16]
Consider the following algorithm :

Algorithm solve (n)
{
if ( n < 1) then return 1;
else
{
for i = 1 to n do
for j = 1 to n do
k = k+1;
for i = 1 to 4 do
solve (n/2) ;
}
}
Obtain the recurrence relation for the above algorithm. Determine its
time complexity.
b)
Devise a divide and conquer strategy to determine the total number of

positive numbers in an array of n numbers.
c)
Obtain a set of optimal Huffman codes for the messages

( m1, m2, m3, m4, m5, m6, m7) with relative frequencies
(f1 , f2, f3, f4, f5, f6, f7) = (1,1, 2, 3, 5, 8, 13). Draw the decode tree for this
set of codes.
d)
What is the best way to multiply a chain of matrices having dimensions

13 5 , 5 89, 89 3 and 3 34 using dynamic programming.
e)
Show that Breadth First Traversal ( BFT) can be used to obtain the reflexive
transitive closure matrix of an undirected graph.
[4339] - 104

a)
b)
[4 4 = 16]
Find out all possible solutions for the following graph coloring problem
with m=3. Also show that only 12 solutions exist with exactly 3 colors.
1
Draw the portion of state space tree generated by Least Cost Branch Bound
( LCBB) method for the following 0/1 knapsack problem instance
where
w = ( 2, 4, 6, 9)
p = ( 10, 10, 12, 18)
m = 15
c)
Write non-deterministic algorithm for max - clique decision problem.
d)
Determine the polynomial of smallest degree that interpolates the points

(0,1) (1,2) and (2,3).
e)
Order the following functions in ascending order of their growth rate :

en, nn, n!, loge (nn) , n2.
Q4) Attempt any two from the following :

[2 8 =16]
a) Differentiate between Prims and Kruskals algorithm for finding minimum
spanning tree. Find the minimum spanning tree using Prims algorithm
for the following graph.
b)
Write control abstraction for divide and conquer strategy. Let x,y be two
n-bit numbers. The straight way of multiplying x and y takes O(n2) bit
operations. Show that multiplying x and y n- bit numbers required O( n log3 )
bit operations using divide and conquer method.
[4339] - 104
c)
Discuss the features of dynamic programming. Find all pair shortest path
for the following graph using dynamic programming.
Q5) Attempt any two of the following :
[2 8 = 16]
a)
What is backtracking ? Give the bounding function for backtracking

solution of sum of subsets problem. For the given set of weights
w= {5,7,10,12,15,17} and m= 22. Draw the state space tree using variable
tuple size and find all possible subsets that give sum of elements as 22.
b)
Why Least Cost Branch Bound (LCBB) is preferred over FIFO & LIFO
branch and bound methods. Consider the following travelling salesman
problem instance defined by cost matrix.
f 7 3 12 8
3 f 6 14 9
5 8 f 6 18
9 3 5 f 11
18 14 9 8 f
Obtain the reduced cost matrix. Which node will be selected next in LCBB
formulation of problem.
c)
Give an algorithm to test whether given diagraph is Directed Acyclic Graph

(DAG) . Test whether the following diagraph is DAG. If yes, apply
topological sort to produce ordering of vertices. Start from vertex 1.
nnn
[4339] - 104
P585
SEAT No. :
[4339] - 13
COMPUTER SCIENCE
CS - 103 : Distributed Database Concepts
(2008 Pattern)
Time :3 Hours]
[Max. Marks :80
2)
Neat diagram must be drawn wherever necessary.
3)
4)
Make necessary assumptions.
Q1) Answer the following.

a)
Write any one method in R* algorithm.
b)
Define fuzzy Read.
c)
Define DDBMS.
d)
B+ tree indexing is better than hash indexing comment.
e)
What is operator tree ?
f)
Write the different failures in DDBMS.
g)
What is Minterm predicate ?
h)
What is Global directory ?
Q2) Attempt any four:
[8 2 = 16]
[4 5 = 20]
a)
Discuss the different types of transparencies addressed by distributed

database.
b)
Explain different phases of query decomposition.
c)
Write short Note on semi - join strategy for query processing in DDBMS.
P.T.O.
d)
What is work flow ? Explain it's types.
e)
Write a short Note on distributed deadlock detection.

a)
[4 6 = 24]
Consider the following join graph
Let Size (emp) = 100 , Size (ASG) = 200 , Size (Proj) = 300 Size
( emp
ASG) = 300 , Size (ASG PROJ) = 200.
Assume that query needs to access all relation write all possible ways
in which query can be executed along with minimum data transfer.
b)
Simplify the following query and transform it into an optimized operator

tree using the restructuring algorithm.
Select ename , Pname
From emp , asg , Proj
Where dur > 12
and emp. eno = asg. eno and
(emp. title = " Mech. Eng" or asg. PNO < "P3") and asg. pno = Proj. Pno;
c)
Consider the following DWFG
Detect deadlock using the distributed deadlock detection algorithm.

[4339] - 13
d)
Apply the algorithm INGRES to the following query and illustrate the
detachments and substitutions by monorelation.
Select ename , pname
from emp , asg , Proj
Where dur > 12
and emp. eno = asg. eno
e)
Let Q = { q1,q2,q3} be set of queries. A = { A1, A2, A3} be set of attributes,

S = { S1, S2} be a set of sites.
Matrix (X) describe attribute value and
Matrix (Y) describe application access frequency.
Assume i (qk) = 1 and Si & Ai key attribute. Use Bond energy algorithm
to vertical fragmentation of attributes in the set A.
A1 A 2 A 3
S1
q1 1 1 0
q 2 1 0 1
q 3 1 0 0
S2
q1 2 30
q 2 28 0
q 3 33 35
[4 5 = 20]
a)
Explain D2PL algorithm.
b)
What is benchmarking ? why it is require ?
c)
Explain Top - down design process of distributed DBMS.
d)
Discuss the MDBS architecture.
e)
Write a note on Network Partitioning.
nnn
[4339] - 13
SEAT No. :
P598
[4339] - 202
M.Sc. (Semester - II)
COMPUTER SCIENCE
CS - 202: Advanced Operating Systems

(2011 Pattern)
Time :3 Hours]
[Max. Marks :80
Instructions to the candidates :

1) All questions are compulsory.
2)
3)

4)
Q1) Attempt all the following:
[8 2 = 16]
a)
How file sharing is done in UNIX Operating System.
b)
Explain the system calls fsync () & fdatasync().
c)
Explain Symlink () and readlink () functions.
d)
Explain Components of register in context with the process.
e)
Why are the logout records written by the init process? Is this handled in
the same way as network login?
f)
Explain mincore () function.
g)
What happens if a blocked signal is generated more than once before the
process unblocks the signal?
h)
Describe the structure of an executive process block.
Q2) Justify the following (any eight):
[8 2 = 16]
a)
We can set only one of the two time values with the utime function.
b)
getcwd () is preferred than getwd() in applications.
c)
No process can preempt another process executing in the kernel.
d)
The kernel does a longjump to restore a previously saved context if it has

no way to complete the system call it is executing.
P.T.O.
e)
A process never executes in user mode before handling outstanding

signals.
f)
It is very important that any signal handler has to be very careful about
the actions it performs and the data it touches.
g)
Creating a Windows process consists of several stages.
h)
Create Thread notifies the Windows subsystem about the new thread.
i)
Thread priority levels are assigned from different perspectives.
j)
The kernel never schedules Zombie process to execute.
[4 4 = 16]
a)
Explain architecture of Unix Operating system with system Kernel in detail.
b)
The following sequence of code has been observed in program.

dup2(fd,0);
dup2(fd,1);
dup(fd,2);
if(fd>2)
close(fd);
To see why the if test is needed, assume that fd is 1 and draw a picture
of what happens to the three descriptor entries and the corresponding file
table entry with each call to dup2. Then assume that fd is 3 & draw the same
picture.
c)
Explain six values for param defined in <malloc.h> supported by Linux.
d)
Explain the following functions sigaction(), sigpending().
e)
Explain the kernel-mode components of Windows.
[4339]- 202
Q4) Explain the behavior of following C Program (any four):

a)
#include<fcntl.h>
main(argc,argv)
int argc;
char*argv[ ];
{
int fd, skval;
Char c;
if(argc!=2)
Exit();
fd = open(argv[1],O_RDONLY);
if(fd= = 1)
exit();
while(skval= read(fd,&c,1)
{
print("char%c\n",c);
skval = lseek(fd,1023L,1);
printf("new seek val %d\n",skval);
}
}
[4339]- 202
[4 4 = 16]
b)
#include <unistd.h>
#include <stdio.h>
#include <sys/types.h>
#include <sys/wait.h>
int main (void)
{
int status;
pid_t pid;
if (!fork( ))
return 1;
pid = wait (&status);
if (pid = = -1)
perror (''wait'');
printf ("pid=%d\n",pid);
if (WIFEXITED(status))
printf ("Normal termination with exit status=%d\n", WEXITSTATUS(status));
if (WIFSIGNALED (status))
printf ("Killed by signal = %d%s \ n",WTERMSIG(status),
WCOREDUMP (status) ?" (dumped core)" : );
if (WIFSTOPPED (status))
printf("Stopped by signal=%d\n",WSTOPSIG (status));
if (WIFCONTINUED (status))
printf ("Continued\n");
return 0;
}
[4339]- 202
c)
void print_chars (int n, char c)

{
int i;
for (i = 0; i < n; i++) {
char *s;
int j;
s = calloc (i + 2, 1);
if (!s) {
perror ("calloc");
break;
}
for (j = 0; j < i + 1; j++)
s[j] = c;
printf ("%s\n",s);
free (s);
}
}
(Consider n=7 & c is *)
d)
char string{} = "hello";

main()
{char buf[1024];
char * cp1,*p2;
int fds[2];
cp1 = string;
cp2 = buf;
while(*cp1)
*cp2++ = *cp1++;
[4339]- 202
pipe(fds);
for(;;)
{
write(fds[1],buf,6);
read(fds[0],buf,6);
}
}
f)
#include<signal.h>
main()
{
register int i;
setpgrp();
for(i =0;i<10;i++)
{
if (fork ( ) = = 0)
{
if(i&1)
setpgrp ();
printf("pid=%d pgrp = %d\n"), getpid(),
getpgrp ());
pause();
}
}
kill(0,SIGINT);
}
[4339]- 202
e)
#include<signal.h>
main ()
{
int l,*ip;
extern f(), sigcatch() ;
ip = (int *)f;
for(i=0;i<20;i++)
signal(l,sigcatch);
*ip = 1;
printf("after assign to ip\n");
f();
}
f() { }
sigcatch(n)
int n;
{
printf("caught sig % d\n ,n);
exit(1);
}
Q5) Write a C Program for the following: (Any four)
[ 4 4 = 16]
a)
Write a C Program to demonstrate use of Exit Handler.
b)
Write a C Program that creates two files, one with a umask of 0 and one
with umask that disables all the group and other permission bits.
c)
Write a C Program to demonstrate Race condition in catching Signals.
d)
Write a C Program to catch SIGUSR1 & SIGUSR2.
e)
Write a C Program for a signal function that tries to prevent any interrupted
system calls from being restarted.
f)
Write a C Program to illustrate use of pipe, dup & fork system call.
[4339]- 202
+++++++
7
P599
SEAT No. :
[4339] - 203
COMPUTER SCIENCE
CS - 203 : Data Mining and Data Warehousing
(2011 Pattern)
Time :3 Hours]
[Max. Marks :80
Instructions to the candidates:1) All questions are compulsory.

2) Draw neat diagrams wherever necessary.
3) Figures to the right indicate full marks.
Q1) Attempt any eight of the following :

a)
What is the need for data warehousing ?
b)
Define an FP- Tree.
c)
Define an association rule.
d)
What are visualization technique ?
e)
What are the types of sequence mining ?
f)
What is clustering ?
g)
What do you mean by active learning ?
h)
When to apply chi- square test.
i)
What are key terms used in confusion matrix ?
j)
What are Bayesian classifier ?

a)
What are the data mining applications ?
b)
What are the challenges in web mining?
c)
What is WEKA ? What are the advantages of WEKA ?
d)
What are the two approaches to avoid overfitting ?
e)
What are the different ways of handling noisy data ?
[ 8 2 = 16]
[ 4 4 = 16]
P.T.O.
Q3) Attempt any two of the following :

a)
[ 2 8 = 16]
Suppose that a data warehouse of a match consists of the four dimensions

date , spectator, location and game and the two measures count and
charge, where charge is the fare that a spectator pays when watching a
game on a given date, spectators may be students, adults or seniors, with
each category having its own charge rate.
Draw a star schema diagram for the data warehouse.
b)
The following table consists of training tuples from the all electronics
customer database . The data have been generalized and in given below:
RID
age
income
Student
Credit
Class:
rating
buysComputer
youth
high
no
fair
no
"
"
"
excellent
"
middle-age
"
"
fair
yes
senior
medium
"
"
"
"
low
yes
"
"
"
"
"
excellent
no
middle -aged
"
"
"
yes
youth
medium
no
fair
no
"
low
yes
fair
yes
10
senior
medium
"
fair
"
11
youth
"
"
excellent
"
12
middle-eaged "
no
"
"
13
"
high
yes
fair
"
14
senior
medium
no
excellent
no
i)
[4339] - 203
Draw a decision tree for the concept buys - computer.

2
ii)
Compute information gain of the attribute age, to find the splitting criterion
for the tuples. (The class label attribute buys. Computer has two distinct
values. Let class C1 corresponds to no. of yes and C2 corresponds to no.
of no).
c)
Explain basic data mining tasks of predictive model.
[ 4 4 =16]
a)
What are data preprocessing techniques ? Explain any one.
b)
Differentiate between Text mining and Web mining.
c)
Explain sampling algorithm with an example.
d)
How is a data warehouse different from a database ? How are they similar?
e)
Differentiate between OLTP and OLAP.

a)
Explain the major steps of decision tree classification.
b)
How does the k- means clustering algorithm works ?
c)
Write a note on non linear regression.
d)
Explain following accuracy measures (any two) :

i)
Bootstrap
ii)
F - measure
[ 4 4 = 16]
iii) Precision
iv) Cross- validation
e)
Differentiate between agglomerative and divisive clustering method.
nnn
[4339] - 203
SEAT No. :
P588
[4339] - 22
COMPUTER SCIENCE
CS - 202 : Unix Internals
(2008 Pattern)
Time :3 Hours]
[Max. Marks :80

1)
2)
Neat diagram must be drawn wherever necessary.

3)
4)

Assume suitable data, if necessary.
5)
Q1) Attempt all of the following:
[8 2 = 16]
a)
List any four fields of uarea.
b)
When the kernel releases an inode, what happens if reference count drops
to zero?
c)
Give the syntax of mount system call. When does unmount call fail?
d)
List the steps for a context switch.
e)
Write any four functions of clock interrupt handler?
f)
What is a protection fault? When does a process incur a protection fault?
g)
What do you mean by Clists?
h)
What is the significance of following, kill (pid,signum);

where i) pid is -l ii) pid is 0
P.T.O.
Q2) State whether the following statements are true or false. Justify your answer
(any four):
[4 4 = 16]
a)
The kernel can lock and unlock an allocated inode independent of the
value of the reference count.
b)
No process can preempt another process executing in the kernel.
c)
The contents of inode will change only when file contents are modified.
d)
In the link system call, the kernel must release the source file's inode after
incrementing its link count.
e)
The kernel invokes growreg algorithm to increase the size of shared region
that is already attached to several processes.
[4 4 = 16]
a)
Why does kernel lock the file during the system call read? What would
happen if it does not lock it?
b)
Which are the actions taken by kernel for releasing a buffer?
c)
What happens if a process executing wait ( ) has :

i)
ii)
no zombie child
one zombie child
iii)
child processes but none are zombie.
d)
In sleep algorithm, why does kernel raises processor execution level to block
all interrupts? How it handles cases of interruptible and not interruptible sleep?
e)
Discuss swap in function of swapper process.
Q4) Attempt any four of the folloiwng:

a)
[4 4 = 16]
Write a program to accept a file name from user using command line argument
and create a file write the string UNIX at every 800th byte 10 times. Close the
file Reopen the file in readmode and print the string stored at every 800th
byte. Use lseek system call.
[4339]- 22
b)
Write and explain program in C, that checks the access time of a file every
minute and prints a message if the file had been accessed.
c)
Explain the behaviour of following program.

# include <stdio.h>
main ( )
{
int p[2], j, pid;
char msg [20];
pipe (p);
pid = getpid ( );
fork ( ) ;
fork ( ) ;
if (pid = = getpid ( ) )
{
for, (j = 0, j<3 ; j ++)
wait ((int*)0);
for (j = 0; j<3 ; j++)
{
read (p[0], msg, 12);
printf("%s\n", msg);
}
}
else
write (p[1], "hello world", 12);
}
d)
Write a program which is ready to catch a signal generated by pressing

cntr1 + c. The program should display message "you have pressed
cntr1+c". The process should catch the cntr1+c signal five times, display
same message and should not terminate. The process will terminate when it
catches the cntr1+c signal 6th time.
[4339]- 22
e)
Explain the behaviour of following program.

# include < fcntl. h>
main ( )
{
int i, j;
char but 1 [512], but 2[512] ;
i = open("/etc/ passwd",O_RDONLY);
j = dup (i);
read (i,but 1, sizeof (but 1 ));
read (j, but2, sizeof (but 2));
close (i);
read(j, but2, sizeof (but 2));
}
[ 4 4 = 16]
a)
Give and explain logical format of an executable file.
b)
Write a short note on page stealer process.
c)
List the sequence of operations taken by kernel for handling the interrupt.
What do you mean by interrupt vector?
d)
Explain the race condition arised in unlink system call.
e)
What are the components of register level context?

+++++++
[4339]- 22
P602
SEAT No. :
[4339] - 303
M.Sc. (Semester - III)
COMPUTER SCIENCE
CS - 303 : Soft Computing
(2011 Pattern)
Time :3 Hours]
[Max. Marks :80
2)
3)
4)
5)
Use of electronic pocket Calculator is allowed.
Q1) Attempt All
[8 2 = 16]
a)
State any two basic operators in genetic algorithms.
b)
Find AC B for the following two fuzzy sets A & B

0.1 0.5 1 0.6 0.2

1 2 3
4
0
A =
0.2 0.5 0.8 0.3 0.1

1
2
3
4
0
B =
c)
Explain the linguistic hedge - Concentration.
d)
State the equation for a piecewise linear threash old signal function.
e)
Define a Fuzzy set.
f)
State any two applications of G.A.
g)
What is unsupervised learning ?
h)
State the components of a neural network.

P.T.O.
Q2) Attempt any four
[4 4 = 16]
a)
What is defuzzification ? Explain the centroid and weighted average

methods for defuzzifying fuzzy output.
b)
Explain the concept of Convex fuzzy sets. What is a fuzzy number.
c)
Explain any four properties of GA.
d)
Briefly outline the procedure of gradient descent based learning.
e)
State the important properties of TLN's.
Q3) Attempt any four :

a) Given the following two fuzzy sets
[4 4 = 16]
1 .75 .3 .15 0

1.0 1.5 2.0 2.5 3.0
D1 =
.6
.2
.1
0
1

1.0 1.5 2.0 2.5 3.0
D2 =
b)
Find i) D2 | D1
ii) D 1 D 2
For the following fuzzy relation R find the l - cut relation for l .7 and l .3.
x1 x2 x3 x4
x1 1 .8 .4 .2
x .8 1 .3 .1
R= 2
x3 .4 .3 1 .2
x4 .2 .1 .2 1
c)
Given the following fuzzy numbers I & J, using Zadeh's extension principle
calculate fuzzy number " Approximately 24''. Is the resulting set convex?
.6
3
1
4
.5
5
I = approximately 4
.2 .4 1 .6 .3
J = approximately 6
4
d)
Determine the preposition " IF K THEN V "for the fuzzy sets given below.
K
0 .2 1 1

q t r c
0 .3 .8 1

n s g e
[4339] - 303
e)
Given the following two fuzzy sets :

0
0.6 0.8 1

4.5 4.7 5.0 6.0
Bright = B
.5
.8
1 .85 .5

2.2 2.8 3.6 4.0 4.5
Dark = D
Find membership functions for

i)
not very bright & very dark.
ii)
not very dark but not bright
Q4) Attempt any two
[2 8 = 16]
a)
Explain any two properties of neural networks. Differentiate between

supervised and unsupervised learning.
b)
Define linear separability and show that the 2D boolean function XOR is
linearly non - separable.
c)
Let X = { x1 , x2, x3} Y = { y1 ,y2, y3} and Z = {z1, z2,z3} be the universe of
discourse on which the following fuzzy sets be defined respectively.
A
0.1 0.9 0.3

x
x
x3
1
2
0.4 1
0

y1 y2 y3
0.3 1.0 .2

z2 z3
z1
Find
i)
Au B R
ii)
S B uC
iii) T = RoS using min - max composition

iv)
[4339] - 303
U R xS
Q5) Attempt any two
[2 8 =16]
a)
Simulate the execution of perceptron learning algorithm for each epoch

on the following inputs : ( 1,1,1) ( 1,1,1) (1,0,1) (1,1,1), (1,1,1)
(1,0,1) with weight vector ( 0,1,0) and h = 1. What is the final weight
vector.
b)
Let X = {a,b,c,d} and Y= {1,2,3,4} &

.1 .7 .5 1

a b c d
Let A
B
.3 1 .8 0

1 2 3 4
0 .5 1 .7

1 2 3 4
Determine the implication relations

i)
if x is in A then y is in B
ii)
if x is in A then y is in B
else y is in C
c)
Explain the basic genetic algorithm, Maximize f(x) = 2x over {0,1,2,3,.......31}

with initial x values of ( 12, 23, 8, 16)
nnn
[4339] - 303
Total No. of Questions : 5]
P593
SEAT No. :
[4339]-101
COMPUTER SCIENCE
CS - 101 : Principles of Programming Languages
(2011 Pattern)
Time : 3 Hours]
1) Neat diagrams must be drawn wherever necessary.
3) All questions carry equal marks.
4) Assume suitable data, if necessary.
[Max. Marks : 80
Q1) Attempt any eight.

[8 2 = 16]
a) What distinguishes declarative languages from imperative languages.
b) Find o/p of
i) (first (rest (first ((a b) (c d))))).
ii) (list (a b c) ( )).
c) What are bound and free variables in prolog.
d) What is elaboration and referencing environment?
e) What is 1 - value and r - value?
f) C language does not support array operations Justify whether true or
false.
g) Define i) Static link.
ii) Dynamic link.
h) What is generic subroutine? Name one language which support it.
i) What is task? What is purpose of a task ready queue?
j) Define i) Physical concurrency.
ii) Logical concurrency.
Q2) Attempt any four.
[4 4 = 16]
a) Explain how IDE differs from a collection of command - line tools.
b) What is an object closure? Explain with suitable example in C++.
c) Explain the difference between applicative and normal order evaluation
of an expression. Under what circumstances is each desirable?
d) Explain the reference counters approach to garbage collection. What
problems are faced with this approach?
P.T.O.
e) Give the implementation for the following shared multiple inheritance.

A
B
C
D

[4 4 = 16]
a) Write a pseudo code to illustrate the use of semaphores to provide both
competition and cooperation synchronization for a concurrently accessed
shared buffer.
b) Explain why ordering within an expression is important.
c) Explain different approaches to dangling reference problem.
d) What is coroutine? What is quasi - concurrency?
e) What is abstraction? What are the benefits of abstraction provided by
modules and module types.
[4 4 = 16]
a) Write a code in C/C ++ to demonstrate creation of lost heap - dynamic
variables.
b) What is difference between enumeration - controlled loop and logically
controlled loops?
Consider a midtest loop given below that looks for blank lines in its
input.
for (; ;)
{
line = read _ line ( );
if (all _ blanks (line)) break;
consume _ line (line);
}
show how you might accomplish the same task using post - test loop.
c) Explain following parameter passing modes with proper pseudocode
for each one.
i) Pass by result.
ii) Pass by value result.
d) Explain how cooperation synchronization is accomplished in Java.
e) Explain the layout of the run - time stack.
[4339]-101
[4 4 = 16]
a) Write a prolog program to find factorial of a given number.

b) Define a lisp function pal to check whether a given list is palindrome or not.
c) Write a lisp function for finding intersection of 2 lists.
d) Consider the employee database.
Works _ in (employee _ name, department)
earns (employee _ name, salary)
Write a prolog program to list
i)
All employees not working in sales department.
ii)
List employees earning salary more than 10,000. (Use cut and fail)
e) All cats like to eat all types of fish. All calico are cats. All tuna are fish.
Charlie is tuna. Herby is tuna puss is calico. Write a prolog program to
answer the question, what does puss like to eat? Show how it will be
answered by your program.
tttt
[4339]-101
P583
SEAT No. :
[4339] - 11
COMPUTER SCIENCE
CS - 101 : Principles of Programming Language
(2008 Pattern)
Time : 3 Hours]
[Max. Marks : 80

1)
2)
3)

Figures to the right indicates full marks.
[8 2 = 16]
a)
b)
c)
d)
e)
f)
g)
State any four datatypes predicates in LISP.

Give the structure of PROLOG program.
Define precedence and associativity.
Differentiate type casting and coercion.
What are first and second class subroutines?
What is the use of cactus stack.
Define :
i)
Dynamic binding.
ii) Bindings Lifetime.
h) State any two real life applications of multithreading.
[4 4 = 16]
a) What determine whether an object is allocated statically, on the stack or

on the heap.
b) Why there are so many programming languages? Explain.
c) What is a referencing environment? Describe the difference between deep
and shallow binding of referrencing environments.
d) Differentiate between boolean condition evaluation techniques in C and
PASCAL.
e) Discuss the significance of holes in records. Why do they arise? What
problems do they cause.
P.T.O.
[4 4 = 16]
a) What is a dope vector? What purpose does it serve?

b) What is subroutine calling sequence? What does it do? What is meant
by the subroutine prologue and epilogue.
c) Explain how assignment operations are implemented in imperative
languages.
d) What are dangling references? How are they created? Why are they a
problem? Discuss the advantages of tombstones to solve the problem.
e) Consider the following program segment in C++.
try { - - // Protected block of code
} catch (end _ of _ file)
{---}
catch (io _ error e)
{ // handler for io-error other than end-of-file
}
catch (- - -)
{ // handler for any exception not previously named
}
show how this exceptions can be handled using exception handler in
C++.
[4 4 = 16]
a) State six different syntactic constructs commonly used to create new

thread of control in a concurrent program? Explain any one.
b) What do you mean by collateral execution? Illustrate with the help of
suitable example.
c) Explain how shared multiple inheritance is implemented with suitable
diagram.
d) What is critical section? What is semaphore? Why semaphore is used?
e) The main program calls P1, P1 calls P2 and P2 calls P3. What is the
stack layout after these calls? Show the stack with subroutine frames
and static links.
[4 4 = 16]
a) Define a LISP function to find the smallest element from the list.
b) Define a LISP function to find a power. Power (m, n) = m raised to the
power of n.
[4339]-11
c) Write a PROLOG program to store and retrieve the compound object

part which contains (no, description, unit-price, quantity). The program
should output the list of parts.
d) Write a PROLOG program to count the number of words in a given
sentence.
e) Consider the following sentences.
John likes all animals. Cat, bird, dog and snake are animals.
Write a PROLOG program such that goal :
likes (John, Snake)
return false; whereas for other animal it will return ture.
xxxx
[4339]-11
P584
SEAT No. :
[4339] - 12
COMPUTER SCIENCE
CS - 102 : Object Oriented Software Engineering
(2008 Pattern)
Time : 3 Hours]
[Max. Marks : 80

1)
2)
3)
4)

Neat diagrams must be drawn where necessary.
Q1) Attempt the following :

a)
b)
c)
d)
e)
f)
g)
h)
What is object orientation?

What is UML?
What is unified process?
Define the terms :
i)
Fork
ii) Polymorphism
What is meta model?
What is object oriented analysis?
What is testing?
What are components?

a)
b)
c)
d)
e)
[8 2 = 16]
[4 4 = 16]
What are different kinds of relationships supported in UML?

Differentiate between link and association.
Discuss the component of sequence diagram with example.
What are the steps in object oriented analysis.
What is a qualifier? Explain with example.
[4 8 = 32]
a) Draw a use case diagram and class diagram for an interactive diagram
editor. A sheet is a collection of links and boxes. A link is a sequence of
line segments that connects two boxes. Each line segment is specified
by two points. A point may be shared by a vertical and horizontal line
segment in the same link. A selection is a collection of links and boxes.
P.T.O.
b)
c)
d)
e)
A buffer is a collection of links and boxes that have been cut or copied
from the sheet.
Prepare an object diagram showing at least six relationships among the
following object classes. Include association, aggregation and
generalization. Show multiplicity and add atleast one attribute to each,
class, card, deck, hand, collection of cards, discard file, draw file.
Draw state diagram and sequence diagram for considering different
scenarios for ATM machines.
Draw activity diagram for considering different scenarios for icecream
preparation machine where you can get different flavours.
A system for distributing electronic mail over network is needed. Each
user of the system should be able to send mail from any computer. All
the received mails are stored at a central server. The user can receive
mail at any computer. One or two machines with larger data spaces also
allows saving messages in files. There should be provisions for forwarding
mails and sending mail to several users at once using address list. Draw
component and deployment diagram.
[4 4 = 16]
a) Write short note on object oriented testing.

b) How a use case model helps in analysis phase from inception to
elaboration?
c) Discuss the task management component.
d) Consider an automatic water level control system. Which is used for
controlling the water flow. Identify the different states and draw a state
transition diagram.
e) Draw a collaboration diagram for Railway Reservation system. The
passenger is required to fill a reservation form giving details of his journey.
The counter clerk ensures whether the place is available and prepares a
booking statement.
xxxx
[4339]-12
SEAT No. :
P586
[4339] - 14
COMPUTER SCIENCE
CS 11 - 104 : Design And Analysis Of Algorithms
(2008 Pattern)
Time : 3 Hours]
[Max. Marks : 80

1)
2)
3)
4)
[8 2 = 16]
a)
Name sorting algorithm which use divide & conquer strategy.
b)
Define NP-hard class & give an example of decision problem that is NPhard
c)
Give the implicit and explicit constraints of 8 Queens problem.
d)
Define notation. Is 3n + 2 = (n). Justify.
e)
What do you mean by minimum spanning tree.
f)
Define principle of Optimality? State one essential difference between

greedy method and dynamic programming.
g)
Show that there is no solution to the 2-queens.
h)
Define live node and dead node.
P.T.O.
[4 5 = 20]
a)
Write insertion sort algorithm and derive its best case and worst case
running time.
b)
Let A [1 .... n] be an array of integer write an efficient algorithm to count

occurrences of given integer using divide and conquer strategy what is
its time complexity.
c)
Consider the following instance for job scheduling with deadlines

problems where n = 6. P = (20, 15, 10, 7, 5, 3), d = (3, 1, 1, 3, 1, 3). Give
solution obtained using fast greedy method that uses set representation.
d)
Explain string editing problem for X = ( b, b, a, b, a) and Y = (a, b, a, a)

give the matrix of values computed in bottom-up manner.
e)
Using Bellman ford algorithm find length of shortest path from source z
to all other vertices.
[4 5 = 20]
a)
What are the minimum and maximun number of element in a heap of

height h? Is an sorted array, a min heap? Justify.
b)
Use strassens algorithm to compute the matrix product of following

matrix giving each computational step
4 3
A=
5 6
c)
3 2
B=
4 2
What is best way to multiply a chain of matrices with dimensions that are
13 5 , 5 89, 89 3, 3 34. respectively.
[4339] - 14
d)
Find all possible solution when the following graph is coloured using
exactly 3 colours
e)
Explain the function that characterize a non-deterministic algorithm.
[4 6 = 24]
a)
Find out the maximum flow from the network where S is source and T is
sink.
b)
Give BFS and DFS for the following graph. Show all steps (Start at
vertex A)
c)
What is Travelling salesman problem. Solve the following TSP instance

using Dynamic programming method.
7 3 12 8
3 6 14 9
5 8 6 18
9 3 5 11
18 14 9 8
[4339] - 14
d)
Describe LCBB method. Apply it to solve following instance of 0/1

Knapsack problem. w = (3, 4, 6, 2, 5), p = (15, 12, 10, 8, 6) m = 14.
e)
Give the recurrence relation for the value of the optimal solution when
longest common subsequence problem is to be solved using dynamic
programming method Give the matrix of the values computed while
determining LCS of the following string.
X=BDCABA
Y=AB C B DAB
f)
Define sum of subset problem? Let the weight given the w = (5, 7, 10,
12, 15, 17) and m = 22 Draw the state space tree for the above problem
to find all subsets that sum to 22.
zzz
[4339] - 14
P587
SEAT No. :
[4339] - 21
Time : 3 Hours]

COMPUTER SCIENCE
CS - 201 : Advanced Networking Concepts
(2008 Pattern)
[Max. Marks : 80

1)
2)
3)

Figures to the right indicates full marks.

a)
b)
c)
d)
e)
[8 2 = 16]
Give format and maximum length of jumbo payload of IPV 6.

Define partially qualified domain name.
What is hidden terminal problem?
Define interactive audio/video.
In figure which router(s) sends out router link LSAS?
f) What is role of relay agent in BOOTP?

g) What is significance of persistence timer used in TCP?
h) How does the hop count limit alleviate RIPs problems?
[4 4 = 16]
a) Create shortest path tree by using Dijkstra algorithm for Node C. Explain
the steps.
P.T.O.
b)
c)
d)
e)
Discuss the different options supported by DHCP.

Explain the login procedure used in TELNET.
Explain any two options supported by IPV4/IPV6.
Compare and contrast CSMA/CA with CSMA/CD.
[4 4 = 16]
a) List the different types of commands used in FTP. Explain any one in
detail.
b) Explain socket structure used in client server model.
c) What are the problems for full implementation of voice over IP? Do you
think we will stop using the telephone network very soon.
d) Releasing a connection without data loss in transport layer is not simple.
Comment.
e) Explain the functions of RTCP.
a)
b)
c)
d)
e)
[4 4 = 16]
Discuss ethernet gigabit implementation.

State the advantages of IPV6 over IPV4.
How TCP handles congestion control?
Explain the general header and entity header used in HTTP.
Explain Tomlinsons clock based method and state its problems.

a)
b)
c)
d)
[4 4 = 16]
How non ASCII data is sent through email?

What is the significance of transport layer in TCP/IP model?
How errors are handled in TFTP? Explain sorcerers apprentice bug.
State the differences between data link layer protocol and transport layer
protocol.
e) Discuss response message of DNS.
xxxx
[4339]-21
P589
SEAT No. :
[4339] - 23
Time : 3 Hours]
M.Sc. - I (Semester - II)

COMPUTER SCIENCE
CS - 203 : Software Architecture
(2008 Pattern)
[Max. Marks : 80

1)
2)
3)
4)


a)
b)
c)
d)
e)
f)
g)
h)
Define the term Architectural Styles.

What do you mean by Architectural Patterns?
What is a pattern?
Briefly explan. Pure Fabrication GRASP.
What are the types of responsibility?
In short, explain sitemesh framework.
Give the features of webwork framework.
What are the advantages of components?
Q2) Attempt the following (any four) :

a)
b)
c)
d)
e)
[8 2 = 16]
[4 4 = 16]
What are the VP phases?

Write a short note on Allocation structure.
Explain Interpreter Architectural Style.
How pattern meets the objectives of software Architecture?
What is a design pattern? What are the essential elements of a design
pattern?
[4 4 = 16]
a) Many graphical user interface toolkits separate the presentational aspects

of the user interface from the underlying application data. Classes defining
application data and presentations can be used independently. They can
work together, too. Both a spreadsheet object and bar chart objects can
depict information in the same application data object using different
presentations. The spreadsheet and the bar chart dont know about each
P.T.O.
b)
c)
d)
e)
other, but they behave as though they do. When the user changes the
information in the spreadsheet, the bar chart reflects the changes
immediately, and vice versa.
Select the most appropriate design pattern to address the above problem.
Give structure and participants to illustrate the use of design pattern.
With the help of example, illustrate indirection GRASP.
Explain Intent and applicability of Abstract Factory Design Pattern.
What are the participants of decorator design pattern?
Give structure and collaboration of strategy design pattern.
[4 4 = 16]
a) What are the consequences and implementation issues of singleton design

pattern?
b) What do you mean by cohesion? What are the types of cohesion?
c) What are the scopes of resources in struts framework?
d) Define the term Framework. What are the characteristics of frameworks.
e) Write a short note on MVC model.
a)
b)
c)
d)
[4 4 = 16]
Explain the concept of container in struts framework.

With the help of diagram, explain middle tier of struts framework.
What are the different approaches for component based development?
Consider a PAN card registration form with the fields Name, Address,
Date of Birth, Mobile No., Email-ID.
Apply validator framework of struts for the above fields.
e) The website contains a home page displaying information about real

estate. On clicking the Real Estate URL, a home page asks for type,
location, and price range. When a page is submitted, an index page
displays a list of Real Estate, and prices along with the link to the details.
Design a struts application along with the struts components needed to
design the above application.
xxxx
[4339]-23
P590
SEAT No. :
[4339] - 31

COMPUTER SCIENCE
CS - 301 : Software Metrics and Project Management
(2008 Pattern)
Time : 3 Hours]
[Max. Marks : 80

1)
2)
3)
All the questions are compulsory.


a)
b)
c)
d)
e)
f)
g)
h)
[8 2 = 16]
Define activity sequencing.

What is project charter?
What is metric plan?
What is the need of CCBs?
Define fault and failure in software.
Define MTTF.
State tools and techniques used in quality assurance.
What do you mean by project.

Discuss project life cycle.
Explain WBS with example.
What is the project scope management.
Define :
i) EVA.
ii)
iii) CV.
iv)
e) Discuss various types of contracts.
[4 4 = 16]
a)
b)
c)
d)

a)
b)
c)
d)
e)
SV.
CPI.
[4 4 = 16]
Project manager tries to reduce high staff turnover. Justify.

Write a note on quality control.
Write a note on GQM.
Write a note on solicitation planning.
Discuss role of communication management in particular project.
P.T.O.
[4 4 = 16]
a) The basic problem of reliability theory is to predict when a system will

eventually fail. Justify.
b) What are the different areas for identification of risk.
c) Explain different process involved in project Human Resource
Management? Explain team development planning in detail.
d) In software metrics data collection, what are the consideration for when
to collect data.
e) Explain importance of good time management.
a)
b)
c)
d)
e)
Write a note on organizational work breakdown structure.

Differentiate between software reliability and hardware reliability.
Describe project execution tools and techniques.
Write a note on attributes of software measure.
What are the types of power in HR management.
xxxx
[4339]-31
[4 4 = 16]
P591
SEAT No. :
[4339] - 32
Time : 3 Hours]

COMPUTER SCIENCE
CS - 302 : Mobile Computing
(2008 Pattern)
[Max. Marks : 80

1)
2)
3)
4)


a) What is the difference between CLDC and CDC?
b) What is good code for CDMA?
c) What is RTT problem in GSM? How it can be resolved?
d) What are the advantages of spread spectrum technology?
e) What is the difference between FACOA and Co-COA?
f) What are the functions of MSC in GSM?
g) What is profile? Name different profiles of J2ME?
h) What are the functions of Gateway GSN in GPRS?
[16]
[16]
a)
b)
c)
d)
e)
Name all entities of GSM with their functionality.

What is snooping TCP? What are its advantages and disadvantages?
Why is routing in multi-hop ad-hoc network is complicated?
What are the advantages and disadvantages of cellular system?
Explain MACA with its advantages and disadvantages.
[16]
a) What is micro-mobility support? Why it is required in mobile IP? Which
are the schemes available for micro-mobility support?
b) Explain coda file system.
c) What is the purpose of following optimizations in TCP?
i)
Fast retransmission/Recovery.
ii) Timeout freezing.
iii) Transaction oriented TCP.
iv) Selective Retransmissions.
P.T.O.
d) What are the advantages of IPV6 in mobile IP?

e) Explain logical reference model of location based services (LCS).
a)
b)
c)
d)
e)
How localization is achieved in GSM?

Explain architecture of WAP.
What are the features of WML?
What are the constraints possible on Text Box in J2ME?
What are the Quality Of Services (QOS) GPRS supports?

a)
b)
c)
d)
e)
[16]
What is reverse tunneling? Why it is needed?

What improvements are needed in TCP for 2.5/3G networks?
Compare proactive protocols and reactive protocols.
Explain Agent Discovery mechanism of mobile IP.
Compare direct sequence spread spectrum with frequency hopping spread
spectrum.
xxxx
[4339]-32
[16]
P592
SEAT No. :
[4339] - 33

COMPUTER SCIENCE
CS - 23 - 303 : Information Systems Security
(2008 Pattern)
Time : 3 Hours]
[Max. Marks : 80

1)
2)
3)


a)
b)
c)
d)
e)
f)
g)
h)
[8 2 = 16]
Define masquerade attack.

Discuss Homophonic substitution cipher.
What is use of IV in CBC mode?
Explain how birthday attack is used to detect collisions in message digest
algorithms.
What are the problems with public key cryptography.
What are the applications of IPsec?
Define the term steganography.
What is phishing?
[4 4 = 16]
a) Explain how 3-D secure protocol is used to provide security to the credit
card on the Internet?
b) Why internetwork security is called fascinating and complex?
c) Apply the vernam cipher algorithm to a plain text message Hello John
using a one time pad NCBTZQARX.
d) Discuss the advantages and disadvantages of ECB and OFB mode.
e) Given two prime numbers P = 7 and Q = 17. Find out N, E and D in an
RSA encryption process.
[4 4 = 16]
a) Explain the working of secure hash algorithm.

b) What are the broad level differences between CRL, OSCP and SCVP?
c) How key agreement and key distribution is handled in IPsec?
P.T.O.
d) When is a Demilitarized zone required? How is it implemented?

e) Explain how subkeys are generated in Blowfish algorithm.
[4 4 = 16]
a) Discuss the different types of intruders. Explain any one intrusion

detection mechanism.
b) Explain any one mutual authentication mechanism with its advantages
and drawbacks.
c) Discuss the working of handshake protocol used in SSL.
d) How does the one time initialization step works in AES?
e) What is key wrapping? How is it useful?
[4 4 = 16]
a) Explain the working of PEM.

b) Discuss the VPN architecture in detail.
c) A and B want to establish a secret key using Deffie Hellman key exchange
protocol. Assuming the values are N = 5, g = 13, x = 13, y = 9. Find out
the values of A, B, K1 and K2.
d) Discuss the various steps used in verification of digital certificate.
e) What are authentication tokens? Explain time based tokens.
xxxx
[4339]-33
SEAT No. :
P595
[4339] - 103
COMPUTER SCIENCE
CS - 103 : Distributed Database Concepts
(2011 Pattern)
Time : 3 Hours]
[Max. Marks : 80
Instructions to candidates :
2) All questions carry equal marks.
4) Neat diagrams must be drawn wherever necessary.
Q1) Attempt any 8
[8 2 = 16]
a)
State briefly, the two basic alternatives of placing data, in a DDBS.
b)
State any 4 different forms of heterogeneity, found in a DDBS?
c)
Define the following : i)
The Completeness rule of fragmentation.
ii)
The Disjointness rule of fragmentation.
d)
Define the process of localization of data involved in a query.
e)
State the following rules of reduction for primary horizontal fragmentation
f)
i)
reduction for selection
ii)
reduction for join
Define the following :

i)
An irreducible query.
ii)
A monorelation query.
P.T.O.
g)
State what do you mean by a join selectivity factor between two relations
R & S?
h)
Define a degree 3 level of consistency, for a transaction.
i)
Define the concept of serializability of distributed transactions.
j)
Define the following terms :

i)
Reliability of data.
ii)
Availability of data.
Q2) Attempt any 4
[4 4 = 16]
a)
Concurrency control is one of the major problem areas in a DDBS.

Comment.
b)
A unilingual MDBS doesnt provide data model transparency and

language transparency to users. Comment.
c)
A simple join graph ensures an intraquery parallelism, during query

execution. Comment.
d)
The Semantic correctness of a query can be determined using a query

graph. Comment.
e)
Semijoins are beneficial with fast networks, if they have a good selectivity
and are implemented with bit arrays. Comment.
Q3) Solve any 4

a)
[4 4 = 16]
Consider the following set of queries, on a relation

dept (dno, dname, Budget, location)
i)
Select * from dept where

dno < 10;
ii)

budget = 500000;
iii)

budget < 700000 and
location = Geneva ;
[4339] - 103
Derive the set of valid predicates, that are candidates for deriving a primary
horizontal fragmentation of the relation, dept, using COM-MIN algorithm.
b)
Consider the following relations :prog (pno , pname)

Emp (eno, ename, title)
Asg (eno, pno, resp, dur)
Consider the following fragmentations, of the above relations :
p1 = pno
< p
2
proj
p2 = pno > p proj

2
A1= Asg pno p1

A2= Asg pno p2
1 = eno, ename Emp
2 = eno, title Emp
Transform the following query into a reduced query on fragments.
Select ename, title
From Emp e, Asg a, proj p
Where p.pno = a. pno and
P.pname = Order processing
and e.eno = A.eno and
A.dur < 24 ;
c)
Consider the following relations

Emp (eno, ename, title)
Proj (pno, pname)
Asg (eno, pno, resp, dur)
[4339] - 103
Apply Ingres algorithm and illustrate successive detachments and

substitutions by giving mono relation queries :Select ename from
emp e, Asg a, proj p
where e.eno = a.eno and
a.pno = p.pno and
p.pno = p4 and
dur > 12 ;
d)
Consider the following join graph
and the fragmentation information given as :

Relation
Site 1
Site 2
Site 3
game
1000
1000
1000
gp
2000
player
1000
Assume,
Size (game gp) = 2000
and Size (gp player) = 1000
Apply the algorithm of distributed Ingres in the following 2 cases
i)
Point - to - Point n/w
ii)
broadcast n/w
so that communication time is minimized.

[4339] - 103
e)
Consider a data item, x, stored at site 1, in a DDB with 2 sites.

Let the triple < Ri, j, Ts>, < Wi, j, Ts> denote a read / write request of a
transaction Ti, on x, generated at site j with time stamp Ts. Assume that
initially following operations are buffered.
<R1, 2, 12> , <W2, 1, 8>, <W3, 2, 9>
Indicate the behaviour of conservative Time stamp algorithm, with the
following sequence of requests :<R4, 1, 10>, <R5, 1, 11> , <W6, 1, 13>
<W7, 2, 14> , <R8, 1, 14> , <R9, 2, 17>
<R10, 1, 16> , <W11, 1, 20> , <W12, 2, 22>
Q4) Atempt any 4

a)
[4 4 = 16]
Consider the following view definition create view gameview (gno, gname,
pno, prole)
as select g.gno, g.gname, gp.pno,
gp.prole from game g,
gameplayer gp
where g.gno = gp.gno and g.no of players <10;
The above view is accessed by an application q1 located at sites 1 & 2
with frequencies 10 and 20 respectively. Let us further assume that another
query q2, defined as
select gno, prole
from gameplayer where
pno < 10;
runs at sites 2 & 3, with frequencies 20 & 10 respectively.
Based on the above information,
i)
Construct the usage matrix,

use (qi , Ai), for the attributes of game & gameplayer.
ii)
[4339] - 103
Construct Affinity matrix containing all attributes of game and game

player.
(Note :- The relation game is defined by attributes (gno, gname, no of

Players) and the relation game player is defined by attributes (gno, pno,
prole)
b)
Explain in brief, with the help of a neat diagram, the different layers of
query processing, in a DDBS.
c)
Consider the following relations

emp (eno , ename , title)
pay (title , salary)
proj (pno , pname)
Asg (eno , pno , resp)
Consider the following query
Find the salaries of engineers who work on the cad/cam project and
the following assumptions :
Tmsg = 0, TTr = 1 and the fragmentation / storage information given as
Relation
Size
Site
emp
pay
proj
Asg
10
Length of a tuple in every relation = 1.

Size (emp pay) = Size (emp)
Size (proj Asg) = 2 * size (proj)
Size (Asg emp) = Size (Asg)
i)
Draw the join graph (query graph) for the above query.
ii)
Apply hill climbing algorithm and illustrate the different possible

solutions for Asg emp proj pay.
[4339] - 103
d)
Consider the following DWFG,
Detect deadlock, if any, using the distributed deadlock detection algorithm.

e)
Write a short note on

Different types of failures in a DDBS.
Q5) Answer any 4
[4 4 = 16]
a)
Explain, with an example, the concept of Data localization, in query

processing.
b)
Write a short note on Different methods of lock management in a DDBS.
c)
Write a short note on Isolation levels, for a transaction, in a DDBS.
d)
Explain briefly, the steps followed, in the execution of a termination

protocol, in case of voting based protocols.
e)
Write a short note on the correctness rules of fragmentation for Derived

Horizontal fragmentation.
zzz
[4339] - 103
SEAT No. :
P597
[4339] - 201

COMPUTER SCIENCE
CS - 201 : Digital Image Processing
(2011 Pattern)
Time : 3 Hours]
[Max. Marks : 80

1)
2)
3)
4)
Question 1 is compulsory.
Attempt any four from the remaining.
Draw neat diagrams wherever necessary.

[8 2 = 16]
a) What is Spatial Filtering?
b) What is Smoothing?
c) What do you mean by Smearing?
d) Which are the logical operations involved in binary images?
e) Define Image Sampling.
f) What is a blind spot?
g) How do we estimate the degradation function for use in image restoration?
h) Write the coordinates of the four diagonal neighbors of pixel p (x, y).
Q2) a) Explain the different noise probability density functions encountered in
image restoration.
[8]
b) Explain and state the use of Wiener Filtering.
[4]
c) Given below is X a section of horizontal intensity profile from an image.
Illustrate the 1st and 2nd derivative of the 1-D digital functions represented
by x. Depict zero crossing if any.
[4]
Scan Line x :
6 6 6 6 6 5 4 3 2 1 1 1 1 1 1 6 6 6 6 6
Q3) a) State the equations for 2-D discrete Fourier transform and its inverse.
Describe any two properties of 2-D discrete Fourier transform.
[8]
b) Explain Image Subtraction and Image Averaging. Why is it used in Image
Enhancement?
[4]
c) List the types of Adaptive Filters and explain how they help in noise
reduction.
[4]
P.T.O.
Q4) a) Explain the basics of filtering in the frequency domain.

[8]
b) What is Bridging Gap? How is it achieved with the help of Dilation?[4]
c) Explain the following with respect to a pixel :
[4]
i) Adjacency.
ii) Boundaries.
iii) Connectivity.
iv) Regions.
Q5) a) Describe the fundamental steps in Image Processing with the help of
block diagram?
[8]
b) Explain Image Acquisition using sensor arrays.
[4]
c) Explain Bandreject, Bandpass and Notch Filters.
[4]
Q6) a) Given a 3-bit image of size 64 64 pixels having intensity distribution as
shown in the table given below, where intensity levels are in the range
0-7. Apply histogram equalization technique and find the transfer function
T(r) which relates input image intensity level Rk to output image intensity Sk.[8]
Intensity Level
R0 = 0
R1 = 1
R2 = 2
R3 = 3
R4 = 4
R5 = 5
R6 = 6
R7 = 7
Number of Pixels
790
1023
850
656
329
245
122
81
b) Draw the shapes for the orders n = 4, 6 and 8. Also give their Chain code
representations, first difference and shape number.
[4]
c) What is Gamma Correction? Explain.
[4]
Q7) a) Explain hit or miss transformation in Morphological Image Processing.[8]
b) Explain local processing for edge linking.
[4]
c) Write a short note on Ideal High Pass Filter.
[4]
Q8) a) Describe the role of illumination in thresholding, basic adaptive
thresholding and basic global thresholding.
[8]
b) Explain Zooming and Shrinking in digital images. How does it take place? [4]
c) Define mixed adjacency. Explain how it eliminates ambiguity that often
arises with 8-adjacency.
[4]
xxxx
[4339]-201
P600
SEAT No. :
[4339] - 301

COMPUTER SCIENCE
CS - 301 : Software Metrics and Project Management
(2011 Pattern)
Time : 3 Hours]
[Max. Marks : 80

1)
2)
3)

Q1) Attempt the following questions :

a)
b)
c)
d)
[8 2 = 16]
Why project manager called as captain of ship of the project.

What do you mean by project plan?
Define the first phase of project scope.
Define :
i) Fault.
ii) Failure.
e) Define staff acquisition.
f) List the process of project procurement management.
g) Define :
i)
MTTF.
ii) MTBF.
h) What is the defination of quality according to JSO.
a)
b)
c)
d)
e)
[4 4 = 16]
Explain characteristics of measurement team member.

Write a short note on CMM.
Differentiate between software reliability and hardware reliability.
Discuss the reasons of failure of JT projects.
Explain cost estimation tools and techniques.
P.T.O.
[4 4 = 16]
a) Explain five basic modes in handling conflict in communication.

b) Differentiate internal product attribute and external product attribute based
on various entities.
c) Explain why and what, Where and when. How of metric plan?
d) Consider the example of designing a website for aircraft system. Design
work break down structure for the above system.
e) Describe project execution tools and techniques.
a)
b)
c)
d)
e)
Summarize the process involved in human resource management.

Write a short note on performance reporting.
What is the need of resource measurement.
Write a short note on PSP.
Write a short note on :
i)
ii)
Stake holder analysis.

Overall change control.

a)
b)
c)
d)
e)
[4 4 = 16]
Explain in detail project scope statement.

Describe Gantt chart.
Which factors affects the quality of JT project.
Write a short note on simulation.
What are the different types of contracts.
xxxx
[4339]-301
[4 4 = 16]
P601
SEAT No. :
[4339] - 302

COMPUTER SCIENCE
CS - 302 : Mobile Computing
(2011 Pattern)
Time : 3 Hours]
[Max. Marks : 80

1)
2)
3)


a)
b)
c)
d)
e)
f)
g)
h)
[8 2 = 16]
Define short term fadding.

List the different messages used in wireless control message protocol.
What disadvantages does OVSF have with respect to flexible data rates?
List any two disadvantages of snooping TCP.
Why guard spaces are required in multiplexing?
How mobile communication is useful in vehicles?
Explain hidden and exposed terminals.
Give any two requirements of mobile IP.
[4 4 = 16]
a) Explain the packet delivery to and from the mobile node.

b) What is path loss of radio signal? Also explain additional signal
propagation effects.
c) List and explain the task of RNC in UMTS.
d) Why is a new infrastructure needed for GPRS, but not for HSCSD?
Which components are new and what is their purpose?
e) Explain J2ME architecture.
[4 4 = 16]
a) Explain the mobile originated SMS procedures.

b) Explain the three classes of transaction service used in WTP.
c) Compare in between SDMA and TDMA.
P.T.O.
d) How does registration of mobile node occures?

e) What are the functions of authentication and encryption in GSM? How
is system security maintained?
[4 4 = 16]
a) Which general features WSP offers for content exchange?

b) Discuss the features of Android.
c) Name the inefficiencies of mobile IP regarding data forwarding from a
correspondent node to a mobile node. What are optimizations and what
additional problems do they cause?
d) Give reasons for a handover in GSM. What are the typical steps of intra
MSC handover.
e) How and why does I - TCP isolate problems on the wireless link? What
are the main drawbacks of this solution?
a)
b)
c)
d)
e)
[4 4 = 16]
How does dynamic source routing handle routing?

Explain UMTS system architecture.
Explain the working of mobile TCP.
Discuss the demand assigned multiple access method.
Explain how wireless transport layer established a secure session.
xxxx
[4339]-302

M.Sc. - Comp. Sci

Uploaded by

Copyright:

Available Formats

M.Sc. - Comp. Sci

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

M.Sc. - Comp. Sci

Uploaded by

Copyright:

Available Formats

Total No.

[Max. Marks :80

Instructions to the candidates:

Neat diagrams must be drawn wherever necessary.

Figures to the right indicate full marks.

All questions are compulsory.

Q1) Attempt all of the following :

Why CSMA/CD is not used in gigabit ethernet ?

How timestamps -based authentication works ?

What is DNS spoofing ?

In an IP packet, the value of HLEN is 1000 in binary. How many bytes of

Why is anonymous offline electronic money dangerous ?

Q2) Attempt any four of the following :

When a user wants to send an email to multiple recipients, how PGP

Give a potential disadvantage when Nagle's algorithm is used on a badly

Explain different strategies of transition from IPv4 to IPv6.

Q3) Attempt any four of the following :

List the different technologies used to connect two remote devices in

Explain AH & ESP Protocols used in IPSec.

What is attack ? Explain active & passive attacks.

Explain key transformation & expansion permutation process in DES.

Q4) Attempt any four of the following :

Explain the working of Kerberos ?

What are the typical contents of a digital certificate ?

Explain how transport layer handles buffer allocation dynamically.

Q5) Attempt any four of the following :

Imagine a generalized n-army problem, in which the agreement of any

Application gateway firewall are generally more secure than packet

Explain how 3 - D secure protocol is used to provide security to the credit

What is count to infinity problem ? Suggest solutions on that.

Contrast error reporting messages in ICMPv6 with error reporting

Total No. of Questions : 5 ]

[Total No. of Pages : 7

[Max. Marks :80

Instructions to the candidates:-

Q1) Atempt (any 8)

State breigly, ther two basic alternatves of plcing data in a DDBS.

State any 4 different forms of heterogeneity, found in a DDBS?

Define the following:

The Completeness rule of frogmentation.

Define the frocessof localization of data involved in a query.

State the following rules of neduction for primory horizontal fragmentation

reduction for selection

reduction for goin

Define the following:

Define a degree 3 lavel of consistomcy for a transaction.

Define the concept of senalizality of distnbuted tronaection

Q2) Justify the following (any eight)

Getcwd ( ) is preferred than getwd ( ) in applications.

No process can preeempt another process executing in the kernel.

The kernel does a longjump to restore a previously saved context if it has

A process never executes in user mode before handling outstanding

Creating a Windows process consists of several stages.

Thread prority levels are assigned from different perspectives.

The kernel never schedules Zombie process to execute.

Q3) Attempt any four of the following:

Explain architecture of Unix Operating system with system Kernel in detail.

The following sequence of code has been observed in program.

Explain six values for param defined in <malloc.h> supported by Linux.

Explain the following functions sigaction( ), sigpending( ).