0% found this document useful (0 votes)
13 views2 pages

Operating Systems

The document outlines the syllabus and practical guidelines for the B.Sc. (H) Computer Science Semester III course on Operating Systems. It includes a detailed breakdown of topics, lecture hours, and references for core and additional resources. The practical list consists of programming tasks related to process management, memory management, and scheduling algorithms.

Uploaded by

hehehe2225
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
0% found this document useful (0 votes)
13 views2 pages

Operating Systems

The document outlines the syllabus and practical guidelines for the B.Sc. (H) Computer Science Semester III course on Operating Systems. It includes a detailed breakdown of topics, lecture hours, and references for core and additional resources. The practical list consists of programming tasks related to process management, memory management, and scheduling algorithms.

Uploaded by

hehehe2225
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

Guidelines of B.Sc.

(H) Computer Science Sem III (CBCS)


Operating System (BHCS06) Core Course - (CC)

Chapter Topic Contents Lectures

1 Introduction 1.1, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.11 10

2 System Structures 2.1, 2.3, 2.4, 2.5, 2.7 – 2.7.4, 2.10 6

* 2.2 – Coverage with Demo for Practical


Purpose

3 Process Concept 3.1, 3.2, 3.3 (excluding process creation 4


using Windows API figure 3.11)

4 Multithreaded 4.1, 4.2, 4.3, 4.4 – 4.4.1 4


Programming

5 Process Scheduling 5.1, 5.2, 5.3 – 5.3.4 5

6 Synchronization 6.1, 6.2, 6.3, 6.6 - 6.6.1 4

7 Deadlocks 7.1 , 7.2, 7.3 (excluding deadlocks with 3


mutex locks)

8 Memory- 8.1, 8.2, 8.3, 8.4, 8.5 8


Management
Strategies

9 Virtual-Memory 9.1, 9.2, 9.3, 9.4 – 9.4.3 5


Management

10 File System 10.1, 10.2, 10.3 4

12 Mass–Storage 12.1, 12.4 3


Structure
Refe
rences

1. Silberschatz, P.B. Galvin, G. Gagne, Operating System Concepts, 9th edition, John Wiley Publications.

Additional Resources

1. Dhamdhere, D. M. (2006). Operating Systems: A Concept-based Approach. 2nd edition. Tata McGraw-Hill
Education.
2. Kernighan, B. W., & Rob Pike, R. (1984). The Unix programming environment (Vol. 270). Englewood
Cliffs, NJ: Prentice-Hall
3. Stallings, W. (2018). Operating Systems: Internals and Design Principles. 9th edition. Pearson Education.
4. Tanenbaum, A. S. (2007). Modern Operating Systems. 3rd edition. Pearson Education.

B.Sc. (H) Computer Science Sem III (CBCS)


C – VI Practical List for Operating Systems

1. Write a program (using fork() and/or exec() commands) where parent and child execute:
a) same program, same code.
b) same program, different code.
c) before terminating, the parent waits for the child to finish its task.
2. Write a program to report behaviour of Linux kernel including kernel version, CPU type and
model. (CPU information)
3. Write a program to report behaviour of Linux kernel including information on 19 configured
memory, amount of free and used memory. (memory information)
4. Write a program to print file details including owner access permissions, file access time,
where file name is given as argument.
5. Write a program to copy files using system calls.
6. Write a program to implement FCFS scheduling algorithm.
7. Write a program to implement Round Robin scheduling algorithm.
8. Write a program to implement SJF scheduling algorithm.
9. Write a program to implement non-preemptive priority based scheduling algorithm.
10. Write a program to implement preemptive priority based scheduling algorithm.
11. Write a program to implement SRJF scheduling algorithm.
12. Write a program to calculate sum of n numbers using thread library.
13. Write a program to implement first-fit, best-fit and worst-fit allocation strategies.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy