0% found this document useful (0 votes)
6 views4 pages

66f8fb9450951CourseOutlineTemplate Withlab

You're tdhfjfldydirstidlhx

Uploaded by

bscs22f34
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views4 pages

66f8fb9450951CourseOutlineTemplate Withlab

You're tdhfjfldydirstidlhx

Uploaded by

bscs22f34
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Namal University Mianwali

Department of Computer Science

1. COURSE DETAILS
Course Title: Operating Systems
Course Code: CS-240
Credits (Theory + Lab): 4 (3+1)
Lecture Hours/Week: 3
Lab Hours/Week: 3
Pre-Requisite: Nil
Brief Course Description: The Operating Systems (3+1) course offers an in-depth study of the fundamental
principles and concepts that administer modern operating systems. Students will discuss core concepts such as
process management, memory management, and file systems, gaining a comprehensive understanding of how
operating systems manage resources and execute processes. They will analyze key algorithms for scheduling,
memory management, and file system operations, evaluating their impact on system performance. Additionally,
the course includes practical components where students simulate OS procedures and routines using C++
programming, enabling them to design and implement OS components effectively. This blend of theoretical
knowledge and hands-on experience prepares students for both advanced study and practical applications in
software and system development.

2. INSTURCTOR DETAILS
Name: Dr. Mudassar Raza
Lecture Timings:
Office Hours: 08:30-04:30
Office Location: Department of Computer Science
Office Phone: 187
Email: [email protected]

3. COURSE UNIT WISE MAJOR TOPICS


No of Teaching
Unit No. Topics
Hours
1 Course Overview and Introduction 3
2 System Structure 3
3 Processes 6
4 Threads 3
5 CPU Scheduling 6
6 Memory Management 9
7 Process Synchronization 6
8 Deadlock 6
9 File-System Interface 3
Adv OS
Total Contact Hours 48
4. COURSE LEARNING OUTCOMES (CLOs)

Unit
Sr. No CLO Statement Taxonomy Level GA
No
CLO’s for Theory
Discuss the principles and concepts
CLO-1 1 governing the functions of operating C2 1
systems.
Analyze the algorithms of the core functions
CLO-2 2-9 C4 3
of the Operating Systems
Design and simulate OS components using
CLO-3 2-9 C5 5
C++ programming procedures
CLO’s for Lab
Simulate procedures and routines using
CLO-4 2-9 Shell and C++ programming for designing C5 5
and implementing OS components.

5. WEEKLY LECTURE BREAKUP


Referenc
e in Book
Lecture Unit
Topics Covered in Class Topics Covered in Lab /
# #
Assessm
ents
Course Overview and Introduction: Linux Environment,
Definitions, History of OS, Types of Introduction to CLI & Directory TB 1, CH
1. 1
OS, Computer-System Architecture, Management. 1
Operating-System Operations
System Structure: File and Directory Management TB 1, CH
2. 2 Kernel, Interrupts, System Calls, Types
1
of System Calls
Processes: Grep, Redirection and Piping
Process Concept, 5 State model,
TB 1, CH
3. 3 Process Control Block, CPU
3
Scheduling, Context Switching,
Operations on Processes
Processes: Child Processes, System Calls TB 1, CH
cooperating Processes, Inter-process - Open () 3
4. 3 Communication - Close ()
- More I/O functions Project
Assignment
Threads: System Calls and Process TB 1, CH
Multithreading Models, Thread Management I 4
5. 4
Libraries, Thread Pools, Threading
Issues Quiz 1
6. 5 CPU Scheduling: System Calls and File TB 1, CH
Background, Scheduling Criteria, First- Management II 5
Come, First-Served Scheduling,
Shortest-Job-First Scheduling
CPU Scheduling: Inter-process Communication,
Round-robin scheduling, Priority Messages passing through pipes, TB 1, CH
Scheduling, Multilevel Queue shared memory 5
7. 5 Scheduling, Multilevel Feedback
Queue Scheduling, Shortest Remaining Assignm
Job First, Multi-Processor Scheduling, ent 1
Real-Time CPU Scheduling
Memory Management: Inter-process Communication, TB 1, CH
Background, Contiguous Memory Messages passing through sockets, 9
8. 6
Allocation, Paging, Page Table monitors
Quiz 2
Mid Term Exam
Memory Management: Threaded Programming,
TB 1, CH
9. 6 Swapping, Virtual Memory, Demand Multithreading
9
Paging Page Replacement Algorithms
Memory Management: Implementation of CPU
TB 1, CH
10. 6 Thrashing, Segmentation, Page Fault Scheduling Algorithm
9
Handling, Fragmentation
Process Synchronization: Implement the Paging Technique TB 1, CH
The Critical-Section Problem, for memory management. 7
11. 7
Peterson’s Solution, Hardware Support
for Synchronization, Mutex Locks Quiz 3
Process Synchronization: Implementation of Page
TB 1, CH
12. 7 Semaphores, Monitors, Classic Replacement Algorithms
7
Problems of Synchronization
Deadlock: Implementation of Peterson
System Model, Deadlock Solution and Mutex lock TB 1, CH
13. 8
Characterization, Methods for 8
Handling Deadlocks
Deadlock: Implementation of Semaphore TB 1, CH
Deadlock Prevention, Deadlock 8
14. 8 Avoidance, Deadlock Detection,
Recovery from Deadlock Assignm
ent 3
File-System Interface: Implementation of Solution of TB 1, CH
File Concept, Access Methods, Classic Problems of 11
15. 9
Directory Structure, Protection, Synchronization
Memory-Mapped Files
Final Review and Project Banker Algorithm for deadlock
Presentations avoidance
16. Topics: Review key concepts,
project presentations, and
discussions.
Final Term Exam
6. CLO ASSESSMENT MECHANISM
Assessment Tool CLO1 CLO2 CLO3 CLO4 CLO5
Quizzes ✔ ✔
Assignments ✔ ✔ ✔
Projects ✔ ✔ ✔
Lab ✔
Mid Term Exam ✔ ✔
Final Term Exam ✔ ✔ ✔

7. TEACHING MATERIAL
Text Books:
1. Operating System Concepts (10th Edition) by Abraham Silberschatz, Peter B. Galvin, Greg Gagne
Reference Material:
1. Modern Operating Systems (5th Edition) by Andrew Tanenbaum, Herbert Bos
2. Operating Systems: Internals and Design Principles (9th Edition) by William Stallings

8. POLICY & PROCEDURES


 Attendance Policy: Students must attend 75% of this course's lectures and laboratory work. Students
who fall short of the required attendance percentage cannot appear in the terminal examination.
 Plagiarism Policy: Namal University's rules and regulations prohibit plagiarism, copying, and other
dishonest behavior. Violators will face serious disciplinary action.
 Course Assessment:
Assessment Quiz Assignment Lab Task Project Mid Term Final Term Total
Tool Exam Exam
Theory (T) 15 10 10 25 40 100
Lab (L) 50 20 30 100

9. VERIFICATION
(i) I verify that the content of this document is correct and up-to-date.

Dr. Mudassar Raza


Instructor’s Name and Signature Date

(ii) I have reviewed course-outline and state that it complies with Namal University policies and
guidelines.

Dr. Muhammad Ali Shahid _____________


Name and Signature of Head of Department Date

You might also like