KEMBAR78
CS331 System Software Lab CSE Syllabus-Semesters - 5 | PDF | Assembly Language | Scheduling (Computing)
Scribd
Upload
531 views2 pages

CS331 System Software Lab CSE Syllabus-Semesters - 5

The document outlines the syllabus and course plan for the System Software Lab course (CS331) for the 5th and 6th semesters of the B-Tech CSE program. The course objectives are to build an understanding of designing and implementing different types of system software. There are two parts that list 21 total exercises/experiments covering topics like CPU scheduling algorithms, file allocation strategies, paging, file organization techniques, the banker's algorithm, disk scheduling algorithms, page replacement algorithms, and producer-consumer problems. The expected outcomes are that students will be able to compare and analyze CPU scheduling algorithms, implement basic memory management and synchronization techniques, implement the banker's algorithm, and implement system software like loaders, assemblers,

Uploaded by

RONIN T
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
531 views2 pages

CS331 System Software Lab CSE Syllabus-Semesters - 5

The document outlines the syllabus and course plan for the System Software Lab course (CS331) for the 5th and 6th semesters of the B-Tech CSE program. The course objectives are to build an understanding of designing and implementing different types of system software. There are two parts that list 21 total exercises/experiments covering topics like CPU scheduling algorithms, file allocation strategies, paging, file organization techniques, the banker's algorithm, disk scheduling algorithms, page replacement algorithms, and producer-consumer problems. The expected outcomes are that students will be able to compare and analyze CPU scheduling algorithms, implement basic memory management and synchronization techniques, implement the banker's algorithm, and implement system software like loaders, assemblers,

Uploaded by

RONIN T
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
You are on page 1/ 2

B-Tech CSE S5& S6 Syllabus & Course Plan

Course No. L-T-P Credits Year of


Course Name
Introduction

CS331 SYSTEM SOFTWARE LAB 0-0-3-1 2015


Course Objectives
To build an understanding on design and implementation of different types of systemsoftware.
List of Exercises/Experiments: (Exercises/experiments marked with * are mandatory from
each part. Total 12 Exercises/experiments are mandatory)
Part A
1. Simulate the following non-preemptive CPU scheduling algorithms to find turnaround
time and waiting time.
a) FCFS b) SJF c) Round Robin (pre-emptive) d) Priority

2. Simulate the following file allocation strategies.


a) Sequential b) Indexed c) Linked

3. Implement the different paging techniques of memory management.

KTU STUDENTS
4. Simulate the following file organization techniques *
a) Single level directory b) Two level directory c) Hierarchical

5. Implement the banker’s algorithm for deadlock avoidance.*

6. Simulate the following disk scheduling algorithms. *


a) FCFS b)SCAN c) C-SCAN

7. Simulate the following page replacement algorithms


a) FIFOb)LRU c) LFU

8. Implement the producer-consumer problem using semaphores. *

9. Write a program to simulate the working of the dining philosopher’s problem.*

For more study materials>www.ktustudents.in


B-Tech CSE S5& S6 Syllabus & Course Plan

Part B
10. Implement the symbol table functions: create, insert, modify, search, and display.
11. Implement pass one of a two pass assembler. *
12. Implement pass two of a two pass assembler. *
13. Implement a single pass assembler. *
14. Implement a two pass macro processor *
15. Implement a single pass macro processor.
16. Implement an absolute loader.
17. Implement a relocating loader.
18. Implement pass one of a direct-linking loader.
19. Implement pass two of a direct-linking loader.
20. Implement a simple text editor with features like insertion / deletion of a character,
word, and sentence.
21. Implement a symbol table with suitable hashing.*
Expected Outcome
Student is able to

KTU STUDENTS
1. Compare and analyze CPU Scheduling Algorithms like FCFS, Round Robin, SJF, and
Priority.
2. Implement basic memory management schemes like paging.
3. Implement synchronization techniques using semaphores etc.
4. Implement banker’s algorithm for deadlock avoidance.
5. Implement memory management schemes and page replacement schemes and file allocation
and organization techniques.
6. Implement system software such as loaders, assemblers and macro processor.

For more study materials>www.ktustudents.in

You might also like