Scribd
Upload
122 views2 pages

c5 System Software and Operating System Nov 2022

This document outlines the examination structure for the B.Sc Computer Science Model III, specifically for the System Software and Operating System core course. It includes details on the exam format, with three parts: Part A consists of ten short answer questions, Part B includes six questions requiring more detailed responses, and Part C features two in-depth essay questions. The exam is scheduled for November 2022 and has a maximum score of 80 marks.

Uploaded by

pikkiribabu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
122 views2 pages

c5 System Software and Operating System Nov 2022

This document outlines the examination structure for the B.Sc Computer Science Model III, specifically for the System Software and Operating System core course. It includes details on the exam format, with three parts: Part A consists of ten short answer questions, Part B includes six questions requiring more detailed responses, and Part C features two in-depth essay questions. The exam is scheduled for November 2022 and has a maximum score of 80 marks.

Uploaded by

pikkiribabu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

22103657

QP CODE: 22103657 Reg No : .....................

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

[Link] DEGREE (CBCS) REGULAR / REAPPEARANCE EXAMINATIONS,


NOVEMBER 2022
Fifth Semester
[Link] Computer Science Model III
CORE COURSE - CC5CRT04 - SYSTEM SOFTWARE AND OPERATING SYSTEM
2017 Admission Onwards
6D566090

Time: 3 Hours Max. Marks : 80

Part A
Answer any ten questions.
Each question carries 2 marks.

1. What is a language migrator?

2. What is Type-0 Grammar?

3. What is backtracking?

4. What is lexical analysis?

5. What is memory management?

6. Discuss Round Robin scheduling policy?

7. Why process synchronization is required?

8. What is Banker’s algorithm?

9. Mention any two deadlock recovery techniques.

10. Which are the various page replacement algorithms?

11. List some file attributes.

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. Name the basic elements of assembly language.

14. How assembler handles forward reference instruction?

15. Differentiate parse tree and abstract syntax tree.

16. Explain different code optimization techniques.

17. Explain the process control block.

18. Explain queueing diagram.

19. Explain critical section problem.

20. Describe the necessary conditions for deadlock.

21. How does dynamic loading aid in better memory space utilization?
(6×5=30)
Part C
Answer any two questions.
Each question carries 15 marks.

22. Explain the concept of linker and loader.

23. Explain types of operating system in detail.

24. Explain various strategies to deal with deadlocks. How deadlocks are detected and
recovered?

25. Compare fixed partition and variable partition scheme.


(2×15=30)

Page 2/2

You might also like