LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034
M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE
|
SECOND SEMESTER – APRIL 2008
CS 2809 – SYSTEM SOFTWARE AND OPERATING SYSTEM
Date : 22-04-08 Dept. No. Max. : 100 Marks
Time : 1:00 – 4:00
PART – A (10 X 2 =20)
ANSWER ALL THE QUESTIONS
- What is the function of assembler?
- Write down the syntax of declaration statements used in assembly level language?
- What are the important tasks of memory allocation?
- Define the term LINKING
- What do you mean by Process Control Block?
- What are three requirements of any solution to the critical sections problem?
- What is Dispatcher?
- What is CPU Scheduler?
- What is Context Switch?
- What is a Safe State and what is its use in deadlock avoidance?
PART – B (5 X 8 =40)
ANSWER ALL THE QUESTIONS
- a) What are the data structures used in the design of Pass l of the Assembler?
(OR)
- b) Explain any two features of MACRO preprocessor.
- a) What are the steps involved in dynamic debugging of a program?
(OR)
- b) Write an algorithm for the design of an LINKER?
- a) What is fragmentation? What are the different types of fragmentation? Give the solution for the
(OR)
- b) What are the four conditions required for deadlock to occur? Explain it?
- a) How can you implement a lock using semaphores?
(OR)
- b) How will you detect the deadlock occurrence if the system has single instance of resource type?
- a) Explain about the tree structured directory structure?
(OR)
- b) What file allocation strategy is most appropriate for sequential access files?
PART – C (2 X 20 =40)
ANSWER ANY TWO QUESTIONS
- a) Draw the Pass 2 flowchart for the design of an assembler?
- b) Explain briefly about the major issues in code generations for expressions.
a) What must the banker’s algorithm know a priori in order to prevent deadlock? - b) Write down the algorithm. Explain it with suitable example.
- a) Explain briefly about the demand paging technique.
- b) Describe round robin scheduling algorithm with suitable example?