LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

BH 22

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

1. What is the function of assembler?
2. Write down the syntax of declaration statements used in assembly level language?
3. What are the important tasks of memory allocation?
4. Define the term LINKING
5. What do you mean by Process Control Block?
6. What are three requirements of any solution to the critical sections problem?
7. What is Dispatcher?
8. What is CPU Scheduler?
9. What is Context Switch?
10. What is a Safe State and what is its use in deadlock avoidance?

PART – B (5 X 8 =40)

ANSWER ALL THE QUESTIONS

1. a) What are the data structures used in the design of Pass l of the Assembler?

(OR)

1. b) Explain any two features of MACRO preprocessor.

 

1. a) What are the steps involved in dynamic debugging of a program?

(OR)

1. b) Write an algorithm for the design of an LINKER?

 

13. a) What is fragmentation? What are the different types of fragmentation? Give the solution for the

(OR)

1. b) What are the four conditions required for deadlock to occur? Explain it?

 

14. a) How can you implement a lock using semaphores?

(OR)

1. b) How will you detect the deadlock occurrence if the system has single instance of resource type?

 

15. a) Explain about the tree structured directory structure?

(OR)

1. b) What file allocation strategy is most appropriate for sequential access files?

 

PART – C (2 X 20 =40)

ANSWER ANY TWO QUESTIONS

16. a) Draw the Pass 2 flowchart for the design of an assembler?
17. 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?
18. b) Write down the algorithm. Explain it with suitable example.
19. a) Explain briefly about the demand paging technique.
20. b) Describe round robin scheduling algorithm with suitable example?

Go To Main page

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – COMPUTER SC.

SECOND SEMESTER – APRIL 2011

CS 2809 – SYSTEM SOFTWARE AND OPERATING SYSTEM

 

 

Date : 02-04-2011             Dept. No.                                        Max. : 100 Marks

Time : 1:00 – 4:00

PART – A

 

Answer all Questions                                                                                                                 10 X 2 = 20

 

1. What is assembler?
2. What are macros?
3. What  is the difference between Compiler and Interpretter
4. What are linkers?
5. Define Operating System.
6. What is Deadlock?
7. What is race Condition?
8. What is Virtual Memory?
9. Write any four input devices
10. What are the file types in UNIX?

PART – B

Answer all Questions                                                                                                             5 X 8 = 40

 

1. a) Explain the pass structure of an Assembler.

(or)

1. b) Explain Macro definition and call

 

1. a) Explain Code optimization

(or)

1. b) Explain debug monitors

 

1. a) Explain the evolution of Operating System.

(or)

1. b) Explain deadlock prevention and recovery.

 

1. a) Explain Semaphores in Operating System

(or)

1. b) Explain Noncontiguous allocation and its advantages.

 

1. a) Explain the directory Structure

(or)

1. b) Explain file system reliability.

 

 

 

PART – C

Answer any two Questions                                                               2 X 20 = 40

 

1. i) Explain Two pass assembler with block diagram

1. ii) Explain the compilation of control structures

 

1. i)  Explain Job Scheduling Algorithms

1. ii) Explain Inter process communication

 

1. i)  Explain Advanced I/O programming

1. ii) Explain the file system of Unix

 

 

Go To Main page