MANONMANIAM SUNDARANAR UNIVERSITY COLLEGE

NADUVAKURICHI, SANKARANKOVIL- 627862

INTERNAL TEST – III
Subject : OPERATING SYSTEM Time : 1 hour
Sub. Code : SMCS61 Max. Marks: 20
Class : III B.Sc., (CS) Date : 11.05.22FN

Answer ALL the questions

Part A - (2 x 1 = 2)
1. The process of a page is removed from the physical memory and stored
into backing store is called _______.
a) Swap in b) Swap out c) Roll in d) Address mapping

2. ___________ scheme allocates the largest hole.

a) First fit b) Best fit c) Worst fit d) All of these

Part B - (2 x 5 = 10)
3. a. Describe the deadlock recovery methods.
(Or)
b. Write short notes on deadlock characterization.

4. a. Describe the segmentation mechanism.

(Or)
b. Write a note on contiguous memory allocation.

Part C - (1 x 8 = 8)
5. a. Explain the mechanisms of paging.
(Or)
b. Explain the Banker’s algorithm with example.

&&&& *** &&&&

MANONMANIAM SUNDARANAR UNIVERSITY COLLEGE
NADUVAKURICHI, SANKARANKOVIL- 627862
INTERNAL TEST – III
Subject : DATA STRUCTURES Time : 1 hour
Sub. Code : AMCS41 Max. Marks: 20
Class : II B.Sc., (CS) Date : 11.05.22FN
Part – A (2 x 1 = 2)
Answer ALL the questions
1. The total number of edges containing the node ‘u’ is called ______.
a) In-degree b) Out-degree c) Degree d) None of these

2. The memory requirement of an adjacency matrix is ____________.

a) O(n) b) O(n2) c) O(n3) d) O(log n)

Part – B (2 x 5 = 10)
Answer ALL the questions

3. a. Discuss with example BFS.

(Or)
b. Write a note on DFS.

4. a. Discuss the Sollin’s algorithm with example.

(Or)
b. Write short notes on transitive closure of a graph.

Part – C (1 x 8 = 8)
Answer ALL the questions

5. a. Explain the Kruskal’s Algorithm with example.

(Or)
b. Discuss the Prim’s Algorithm with example.

&&&& *** &&&&