1st YEAR CLASS TEST EXAMINATION, 2017

COMPUTER SCIENCE HONOURS

SECOND PAPER
Full Marks 50 Time 2 Hours
The figure in the margin indicate full marks
Candidates are required to give their answers in their own words as far as practicable
[Answer Question No. 1 and any three from rest, taking two from Section I and one from Section II]

1. Answer any four from the following:

(a) Define multiprogramming. What is system calls?
(b) What is dispatcher?
(c) What is the meaning of the term busy-waiting and wait-for-graph?
(d) What is ADT?
(e) What is tail recursion?
(f) What are limitations of arrays?
(g) Briefly discuss the memory representation of a 2-dimentional array.
(h) What is starvation? Name a scheduling algorithm that may lead to starvation.

SECTION - I
(SYSTEM SOFTWARE FUNDAMENTALS AND OPERATING SYSTEMS)
2. a) What is forward referencing? Discuss how a typical assembler handles forward referencing.
b) Define loading and linking. Briefly explain advantages and disadvantages of an absolute
loader for a computer system.
c) What is parsing? What is the role of a parse tree? (2+2) + (2+4) + (2+2)

3. a)What do you mean by assembler directives? What is program relocation? Describe IPC.
b) Differentiate between an assembler and interpreter. Describe in detail the design of a
2-pass assembler.
c) What is device driver? (2+2+2) + (2+4) + 2

4. a) Give structure of a process Pi as defined in Petersons solution of the critical section problem.
Explain how this solution successfully meets the 3 requirements- Mutual Exclusion, Progress
and bound waiting.
b) Compare micro-kernel and monolithic kernel. What is preemptive and non preemptive
scheduling.
c) Differentiate between paging and Segmentation. 6 + (2+2) + 4

5. a) What is Beladys anomaly? Discuss a page replacement algorithm which doesnt follow
Beladys anomaly.
b) What is the advantage of using page sizes that is a power of 2? An O.S. contains 3 resource
classes. The number of resource units in these classes is 7,7 and 10. The current resource
allocation state is shown below:
Processes Allocated resources Maximum requirements
R1 R2 R3 R1 R2 R3

P1 2 2 3 3 6 8
P2 2 0 3 4 3 3
P3 1 2 4 3 4 4

(I) Is the current allocation in safestate? Illustrate using Bankers Safety algorithm.
 (II) Can the request made by process P1(1,1,0) be granted?
c) Define inode and super block in UNIX. What is monolithic & microlithic Karnel? (2+3)+5+(2+2)

SECTION - II
(DATA STRUCTURE-I)
6. a) Consider the following arithmetic expression in postfix notation:
7 52+*415-/-
Find the value of the expression using stack. Show its content in each steps.
b) Write an algorithm to convert an infix expression into postfix expression.
c) What is circular queue? Write an algorithm to insert an element into circular Queue. 3+ 4 + (2+5)

7. a) Give the disadvantages of singly linked list over contiguous lists. Compare recursion and
iteration.
b) How can stack data structure be used to implement recursion? Explain with suitable example.
c) Write algorithms to create and reverse display a doubly linked list. (2+2) + 4 + 6