Scribd
Upload
6 views

22100309 c5 System Software and Operating System Jan 2022

The document outlines the examination structure for the B.Sc Computer Science program, specifically for the fifth semester course on System Software and Operating Systems. It includes three parts: Part A with ten short answer questions, Part B with six detailed questions, and Part C with two in-depth questions, covering topics such as dynamic binding, file management, deadlock, and CPU scheduling algorithms. The exam is scheduled for January 2022, with a total duration of 3 hours and a maximum score of 80 marks.

Uploaded by

pikkiribabu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

22100309 c5 System Software and Operating System Jan 2022

The document outlines the examination structure for the B.Sc Computer Science program, specifically for the fifth semester course on System Software and Operating Systems. It includes three parts: Part A with ten short answer questions, Part B with six detailed questions, and Part C with two in-depth questions, covering topics such as dynamic binding, file management, deadlock, and CPU scheduling algorithms. The exam is scheduled for January 2022, with a total duration of 3 hours and a maximum score of 80 marks.

Uploaded by

pikkiribabu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

22100309

QP CODE: 22100309 Reg No : .....................

Name : .....................

B.Sc DEGREE (CBCS ) REGULAR / REAPPEARANCE EXAMINATIONS,


JANUARY 2022
Fifth Semester
B.Sc Computer Science Model III
CORE COURSE - CC5CRT04 - SYSTEM SOFTWARE AND OPERATING SYSTEM
2017 Admission Onwards
380CC10F
Time: 3 Hours Max. Marks : 80
Part A
Answer any ten questions.
Each question carries 2 marks.

1. What is Dynamic Binding?

2. Write the syntax for a macro call.

3. What is a token?

4. What is linking?

5. What is file management?

6. Define the terms


a) job queue b)ready queue c)device queue.

7. What is race condition?

8. What is a critical section in relation to a process?

9. Differentiate between resource allocation graph and wait for graph.

10. What do you mean by best fit?

11. How does swapping result in better memory management?

12. Which access method supported by indexed allocation and why?


(10×2=20)
Part B
Answer any six questions.
Each question carries 5 marks.

Page 1/2 Turn Over


13. What is the role of analysis phase in language processing?

14. Write any four assembler directives and their functions.

15. Explain bottom up parsing with an example.

16. Explain the aspects of compilation.

17. Explain Batch Processing System.

18. Explain the process control block.

19. What is deadlock? How does it occur?

20. Explain deadlock recovery techniques.

21. Why paging is used?


(6×5=30)
Part C
Answer any two questions.
Each question carries 15 marks.

22. What do you mean by code optimization? Explain local and global optimization.

23. Explain any four CPU scheduling algorithm.

24. Explain deadlock avoidance with the help of Banker’s algorithm and suitable illustrations.

25. Compare fixed partition and variable partition scheme.


(2×15=30)

Page 2/2

You might also like