M.Sc. (CS) Second Semester Examination (Year 2015)
Data Structure & Algorithms
Subject Code: MSC-201
Paper Code: FCJ-141
Roll No.
Enrollment No.
Time
: 20 Minutes
M.Marks : 10
Invigilator’s Signature
Section A
Objective Type Questions
Attempt All Questions (Each question carry 1/2 mark). Use the symbol (√) in the box for marking
the correct answer.
Q. No. I.
1.
2.
3.
4.
5.
Choose the correct answerA technique of direct search isa)
Binary Search
b)
Linear Search
b)
Tree Searching
d)
Hashing
A mathematical model with a collection of operations defined on that model is calleda)
Data Structure
b)
Primitive data types
c)
Abstract data types
d)
Algorithm
The number of inter change required to sort 5,1,6,24 in ascending order using Bubble
Sort isa)
6
b)
5
c)
8
d)
7
The complexity of multiplying two matrices of order m*n and n*p isa)
np
b)
mp
c)
mn
d)
mnp
For an undirected graph with n vertices and e edges, the sum of the degree of each
vertex is equal toa)
2n
b)
e2/2
c)
(2n-1)/2
d)
2e
1
6.
7.
8.
9.
10.
11.
12.
13.
If a node in a BST has two children, then its in order predecessor hasa)
No child
b)
Two Children
c)
No left Child
d)
No right Child
A Binary tree in which if all its levels except possibly the last, have the maximum
number of nodes and all the nodes at the last level appears as far left as possible,
known asa)
AVL tree
b)
Threaded tree
c)
Full Binary tree
d)
Complete Binary tree
Which of the following sorting algorithms does not have a worst case running time of
o(n2)?
a)
Insertion sort
b)
Quick sort
c)
Merge sort
d)
Bubble sort
A smallest element of an array’s index is called itsa)
Lower bound
b)
Upper bound
c)
Extraction
d)
Range
A maximum degree of any vertex in a simple graph with n vertices isa)
n+1
b)
2n-1
c)
n-1
d)
n
The data structure required for Breadth first Traversal on a graph isa)
Trees
b)
Stack
c)
Queue
d)
Array
The data structure required to evaluate a postfix expression isa)
Queue
b)
Array
c)
Stack
d)
Linked List
Which data structure would you mostly likely see in a non recursive implementation
of a recursive algorithm?
a)
Linked List
b)
Trees
c)
Queue
d)
Stack
2
14.
15.
16.
17.
18.
19.
20.
In a circular Linked Lista)
Components are arranged hierarchically
b)
Forward & Backward traversal within the list is permitted.
c)
There is no beginning & no end
d)
Components are all linked together in some sequential manner.
Which of the following sorting methods would be most suitable for sorting a list
which is almost sorted?
a)
Bubble sort
b)
Insertion sort
c)
Selection sort
d)
Quick sort
A BST is tranversed in the following order recursively; Right, Root, Left. The output
sequence will be ina)
Ascending order
b)
No specific order
c)
Bitomic sequence
d)
Descending order
An adjacency matrix representation of a graph cannot contain information ofa)
Nodes
b)
Edges
c)
Direction of edges
d)
Parallel edges
Quick sort is also known asa)
Merge sort
b)
Heap sort
c)
Bubble sort
d)
None of these
One of the major drawback of B-tree is the difficulty of traversing the keys
sequentiallya)
True
b)
False
c)
Both (a) and (b)
d)
None of these
What is the postfix form of the following prefix * -ab-cd.
a)
ab+cd-*
b)
abc+*-
c)
ab+*cd
d)
ab+*cd-
-----------------------------3
M.Sc. (CS) Second Semester Examination (Year 2015)
Data Structure & Algorithms
Roll No.
Subject Code: MSC-201
Paper Code: FCJ-141
Time
: 2:40 hours
M.Marks : 60
Section – B
(Short Answer Type Questions)
Attempt all questions (each question carries 4 marks)
Q.No.2.
What values are automatically assigned to those elements which are not explicitly
initialized?
OR
What is an algorithm? What are the characteristics of a good algorithm?
Q.No.3.
Which sorting algorithm is best if the list is already sorted? Why?
OR
What are circular Queues? Write down routines for inserting and deleting element
from a circular queue implemented using array.
Q.No.4.
Write short notes on (any two)i)
B-Tree
ii)
Abstract data type
iii)
Simulation of queues
Q.No.5.
What is graph? How it was represented in memory.
OR
Write the use of Greedy Method.
Q.No.6.
What do you mean by merge sort. Explain any two sorted array.
OR
What do you mean by dynamic programming? Give an example in detail.
1
Section C
(Long answer type questions)
Attempt all questions (each question carries 8 marks)
Q.No.7.
Write an algorithm to insert a node in the beginning of the linked list.
OR
What is a linear array? Explain how two dimensional arrays are represented in
memory.
Q.No.8.
Define a sparse metrices. Explain the representation of matrix using linked list.
OR
What is a Binary tree? What is the maximum number of nodes possible in a
Binary tree of depth d. Explain the terms required in Binary tree.
Q.No.9.
What are tournament trees? Explain the concept with example.
OR
What are binary search & AVL trees with all four notations? Explain B-tree
applications.
QNo.10.
Draw the complete undirected graph on one, two, three, four and five vertices.
OR
What do you understand by Game trees? Explain it by using perfect example.
Q.No.11.
What is the use of Branch & Bound Method? What do you mean by Backtracking?
OR
Explain the method to calculate the address of an element in an array. A 25×4
matrix array DATA is stored in memory in row-major order. If base address is
200 & we=4, words per memory cell. Calculate the address of DATA [12,3].
-------------------------
2
M.Sc. (CS) Second Semester Examination (Year 2015)
Operating System
Subject Code: MSC-202
Paper Code: FCJ-142
Roll No.
Enrollment No.
Time
: 20 Minutes
M.Marks : 10
Invigilator’s Signature
Section A
Objective Type Questions
Attempt All Questions (Each question carry 1/2 mark). Use the symbol (√) in the box for marking the
correct answer.
Q. No. I.
1.
2.
3.
4.
5.
6.
Choose the correct answerMutual exclusion can be provided by thea)
Mutex locks
b)
Binary semaphores
c)
Both (a) and (b)
d)
None of these
UCB stands fora)
Unified Control Block
b)
Unit Control Block
c)
Universal Control Block
d)
None of these
Chaining and indexing are strategies ofa)
Contiguous allocation
b)
Non-Contiguous Allocation
c)
Partition Allocation
d)
Static allocation
Multithreading on a multi CPU machinea)
Decrease concurrency
b)
Doesn’t affect concurrency
c)
Increase concurrency
d)
May increase/decrease concurrency
The “process” term was coined bya)
Barry Boehm
b)
Alrecht
c)
Daley
d)
None of these
Belady’s Anomaly is a behavior of which page replacement algorithm?
a)
FIFO
b)
Circular FIFO
c)
Optimal
d)
LRU
1
7.
8.
9.
10.
11.
12.
13.
Which of the following is the crucial time while accessing data on the disk?
a)
Seek time
b)
Rotational time
c)
Waiting time
d)
Transmission time
Process isa)
A program in execution
b)
Program in high level kept on disk
c)
Contents in main memory
d)
None of these
The strategy of allowing process that are logically runnable to be temporally suspended is
calleda)
Pre-emptive scheduling
b)
Non-pre-emptive scheduling
c)
FCFS
d)
SJF
Rotating Priority is used ina)
RR algorithm
b)
FCFS
c)
SJF
d)
STRN
An OS module that selects the next job to be admitted for execution isa)
Schedular
b)
Throughput
c)
Compiler
d)
Dispatcher
External fragmentation is subjected toa)
Segmentation
b)
Swapping
c)
Pure demand Paging
d)
None of these
Dispatchera)
Never changes task priorities
b)
Schedules task into processor
c)
Small and simple
d)
Puts task in I/O wait
2
14.
15.
16.
17.
18.
19.
20.
A virtual device isa)
Dedicated for One Purpose
b)
Shared device converted to dedicated device
c)
Dedicated device converted to a shared device
d)
None of these
Swap space exists ina)
Primary Memory
b)
Secondary Memory
c)
CPU
d)
None of these
A process can be terminated due toa)
Normal Exit
b)
Fatal Error
c)
Killed by another Process
d)
All of these
Which of the following is a process synchronization tool?
a)
Thread
b)
Pipe
c)
Semaphore
d)
Socket
Virtual memory is normally implemented bya)
Demand Paging
b)
Buses
c)
Virtualization
d)
All of these
Process synchronization can be done ona)
Hardware level
b)
Software level
c)
Both (a) and (b)
d)
None of these
Because of virtual memory, the memory can be shared amonga)
Processes
b)
Threads
c)
Instructions
d)
None of these
-----------------------------3
M.Sc. (CS) Second Semester Examination (Year 2015)
Operating System
Roll No.
Subject Code: MSC-202
Paper Code: FCJ-142
Time
: 2:40 hours
M.Marks : 60
Section – B
(Short Answer Type Questions)
Attempt all questions (each question carries 4 marks)
Q.No.2.
What are the main advantages of time shared system? How it is implemented?
OR
Compare spooling and buffering?
Q.No.3.
Discuss the significance of maintaining the access control list in file system?
OR
Explain ISAM access method of file?
Q.No.4.
On a system using round-robin scheduling what would be the effect of including
one process twice in the list of Processes? Justify your answer?
OR
Explain Convoy Effect? Why is starvation a major problem in priority
scheduling?
Q.No.5.
Comparei)
Demand Paging Versus Segmentation
ii)
Logical Address space Versus Physical Address space.
OR
Explain the difference between MVT and MFT schemes.
Q.No.6.
Explain Virtual devices?
OR
Briefly describe about the techniques of device management?
1
Section C
(Long answer type questions)
Attempt all questions (each question carries 8 marks)
Q.No.7.
Explain Operating System as Resources Manager. Why spooling adds an
advantage to the system.
OR
Explain the dual mode operation of operating system? How does it protects the
OS?
Q.No.8.
Explain the single level and two level directory structure with example?
OR
Explain file allocation methods?
Q.No.9.
Considerthe jobs
Job
p1
p2
p3
p4
p5
Burst time
10 ms
29 ms
3 ms
7 ms
12 ms
Calculate the minimum average waiting time fori)
FCFS
ii)
SJF
iii)
Round Robin (quantum=10)
OR
What are the various Process states? Write a short note on PCB.
QNo.10.
How many Page faults will occur with a string 0,1,7,2,3,2,7,1,0,3.There are four
frames which are initially empty. Usei)
FIFO ii)
LRU iii)
LFU iv)
Optimal.
OR
Under what circumstances do page fault occur? What are the steps for handling a
page fault?
Q.No.11.
Write a short note on I/O schedulars?
OR
Explaini)
Buffering
ii)
Block Multiplexing.
--------------------------
2
M.Sc. (CS) Second Semester Examination (Year 2015)
Computer Network with Windows NT
Subject Code: MSC-203
Paper Code: FCJ-143
Roll No.
Enrollment No.
Time
: 20 Minutes
M.Marks : 10
Invigilator’s Signature
Section A
Objective Type Questions
Attempt All Questions (Each question carry 1/2 mark). Use the symbol (√) in the box for marking
the correct answer.
Q. No. I.
Choose the correct answerIn PCM an analog to ______________ conversion occurs.
2.
3.
4.
5.
6.
a)
Analog
b)
Digital
c)
QAM
d)
differential
In ______________ transmission, bits are transmitted simultaneously each across its
own wire.
a)
Asynchronous serial
b)
Synchronous serial
c)
Parallel
d)
Both (a) and (b)
Which topology requires a multipoint connection?
a)
Mesh
b)
Star
c)
Bus
d)
Ring
A television broadcast is an example of _________ transmission.
a)
Simplex
b)
Half Duplex
c)
Full Duplex
d)
Automatic
A cable break in a topology stops all transmission in _______ topology.
a)
Mesh
b)
Bus
c)
Star
d)
Primary
Which multiplexing technique transmits analog signals?
a)
FDM
b)
TDM
c)
WDM
d)
Both (a) and (c)
1
7.
8.
9.
10.
11.
12.
13.
14.
AM and FM are examples of ________ modulation.
a)
Digital to Digital
b)
Analog to Analog
c)
Digital to Analog
d)
Analog to Digital
The ______ layer is the layer closest to the transmission medium.
a)
Physical
b)
Data link
c)
Network
d)
Transport
Mail services are available to N/W users through the __________ layer.
a)
Data link
b)
Physical
c)
Transport
d)
Application
Identify the class IP Address 4,5,6,7.
a)
Class A
b)
Class B
c)
Class C
d)
Class D
Which of the following is a connective device?
a)
Bridge
b)
Repeater
c)
Hub
d)
All of these
A repeater takes a corrupted signal and __________ it.
a)
Amplifies
b)
Regenerates
c)
Resamples
d)
Reroutes
Which of the following is not a guided medium?
a)
Twisted pair cable
b)
Coaxial cable
c)
Fiber optic cable
d)
Atmosphere
Transmission medium is usually categorized asa)
Fixed or unfixed
b)
Guided or Unguided
c)
Determinate or indeterminate
d)
Metallic or non metallic
2
15.
16.
17.
18.
19.
20.
Number of Classes defined for IP addressing area)
2
b)
3
c)
5
d)
7
Telephone networks usea)
Message switching
b)
Circuit switching
c)
Packet switching
d)
None of these
CSMA is acronym fora)
Carrier Sense Multiple Access
b)
Computer Sense Multiple Access
c)
Collision Sense Multiple Access
d)
Carrier Sense Multi Access
_____________ is used to identify each device connected to the internet.
a)
Computer Address
b)
IP Address
c)
Class
d)
None of these
The first version of Windows NT was released ina)
1990
b)
1993
c)
1995
d)
1997
TDM is an acronym fora)
Time Distributed Multiplexing
b)
Time Data Multiplexing
c)
Time Division multiplexing
d)
Time Digital Multiplexing
-----------------------------3
M.Sc. (CS) Second Semester Examination (Year 2015)
Computer Network with Windows NT
Subject Code: MSC-203
Paper Code: FCJ-143
Time
: 2:40 hours
M.Marks : 60
Section – B
(Short Answer Type Questions)
Attempt all questions (each question carries 4 marks)
Q.No.2.
Explain topology. Explain any two types of topology.
OR
What do you mean by modulation? Describe Amplitude and Frequency
modulation.
Q.No.3.
Describe packet and message switching techniques.
OR
What do you understand by token ring and token bus?
Q.No.4.
Explain IPv6 addressing.
OR
Describe congestion control.
Q.No.5.
Describe ISDN Services.
OR
Explain SMTP and UDP Protocols.
Q.No.6.
Define Windows NT Operating System.
OR
Explain any four salient features of Windows NT.
1
Roll No.
Section – C
(Long Answer Type Questions)
Attempt all questions (each question carries 8 marks)
Q.No.7.
What is the importance of Networking? Explain the different types of
networks.
OR
Explain multiplexing. Describe FDM and TDM techniques.
Q.No.8.
Explain OSI model. What is the importance of physical layer and application
layer.
OR
What do you understand by IEEE standard? Describe 802.4 and 802.5
standards.
Q.No.9.
Explain any 4 connecting devices.
OR
Describe routing algorithm. Explain distance-vector routing.
Q.No.10.
Explain TELNET and FTP protocols.
OR
What do you understand by cryptography? Explain any two data encryption
methods.
Q.No.11.
Describe Security Models.
OR
Write the differences between WINDOWS NT and other Operating Systems.
------------------------
2
M.Sc. (CS) Second Semester Examination (Year 2015)
Programming in Java
Subject Code: MSC-204
Paper Code: FCJ-144
Roll No.
Enrollment No
Enrollment
No.
Time
: 20 Minutes
M.Marks : 10
Invigilator’s Signature
Section A
Objective Type Questions
Attempt All Questions. Each question carry 1/2 mark. Use the symbol (√) in the box for marking
the correct answer.
Q. No. I.
1.
2.
3.
4.
5.
6.
Choose the correct answerWhich of the following is not the keyword in Java?
a)
Null
b)
Import
c)
Package
d)
Volatile
The extension name of a java byte code file isa)
.java
b)
.obj
c)
.class
d)
.exe
Which of the following feature is not supported by java?
a)
Multi threading
b)
Reflection
c)
Operator Overloading
d)
Garbage Collection
How many methods does a threadd class provides for sleeping a thread?
a)
3
b)
1
c)
4
d)
2
Which of the following is generated when the source code is successfully
compiled?
a)
Output
b)
Byte code
c)
Error
d)
None of these
Which keyword is used to monitor statement for exception?
a)
try
b)
catch
c)
throw
d)
thrown
1
7.
8.
9.
10.
11.
12.
13.
Interfaces helps in which type of inheritance?
a)
Multiple
b)
Hierarchical
c)
Multilevel
d)
Single
Which is not a wrapper class?
a)
Vector
b)
Boolean
c)
Character
d)
Integer
Java Runs ona)
Windows
b)
Mac
c)
Unix/Linux
d)
All of these
All applets must be declared asa)
Public
b)
Protected
c)
Private
d)
Static
Which package provides interfaces and classes for writing servalate?
a)
Javax
b)
Javay
c)
Javad
d)
None of these
Which one is not an event class?
a)
Action Event
b)
Listener Event
c)
Item Event
d)
Key Event
What is the name of the method used to start a thread execution?
a)
init();
b)
start();
c)
run();
d)
resume();
2
14.
15.
16.
17.
18.
19.
20.
The last value in an array called or can be found at indexa)
0
b)
1
c)
ar.length
d)
ar.length-1
Keyword which is used to access the method or member variables from the super
class.
a)
Super
b)
Using
c)
is_a
d)
has_a
An object that has more than one form is referred asa)
Inheritance
b)
Interface
c)
Abstract class
d)
Polymorphism
b)
7 bits
d)
16 bits
What is the size of a char in Java?
a)
4 bits
c)
8 bits
b)
JRE stands fora)
Java Runtime Environment
b)
Java Runtime Encaptulation
c)
Java Resource Engine
d)
Java Runtime Engine
Which of these keyword must be used to inherit a class?
a)
Super
b)
This
c)
Extent
d)
Extends
Standard output variable ‘out’ is defined in which class?
a)
Void
b)
Process
c)
Runtime
d)
System
-------------------------------
3
M.Sc. (CS) Second Semester Examination (Year 2015)
Programming in Java
Subject Code: MSC-204
Paper Code: FCJ-144
Time
: 2:40 hours
Max.Marks : 60
Section – B
(Short Answer Type Questions)
Attempt all questions (each question carries 4 marks)
Q.No.2.
Explain the features of java applications.
OR
What do you understand by Java Byte code? Explain.
Q.No.3.
What is Wrapper Classes? Explain with example.
OR
Difference between Objects and Methods.
Q.No.4.
Explain about abstract classes and final classes.
OR
Explain try-catch functionality in Exception Handling.
Q.No.5.
What do you understand by java packages. Explain.
OR
Explain life cycle of a Thread.
Q.No.6.
Explain AWT Classes.
OR
Explain Delegation Event model.
1
Roll No.
Section C
(Long answer type questions)
Attempt all questions (each question carries 8 marks)
Q.No.7.
Briefly explain about fundamentals of java programming.
OR
Explain life cycle of an Applet?
Q.No.8.
What are wrapper classes? Discuss their application.
OR
How can you handle strings in java? Explain.
Q.No.9.
What is Exceptions? Explain with example.
OR
Explain the differences between packages and interfaces.
Q.No.10.
Write a note on TCP/IP socket programming. Write a programe for TCP socket
connection in JAVA.
OR
What is a datagram? Explain the datagram packet and datagram server and client.
Q.No.11.
Explain the relationship between an Event Listener Interface and an Event
Adapter Class.
OR
Difference between Delegation Event model and Event Classes.
------------------------------
2