OBE Operating System Syllabus - UPDATED
OBE Operating System Syllabus - UPDATED
COURSE SYLLABUS
DMMMSU-SOI-02-F05
MISSION
To provide quality relevant instruction, research and extension
A. COURSE DESCRIPTION
This course will provide an introduction to the concepts, theories and components that serve as
the bases for the design of classical and modern operating systems. Topics include the brief
historical perspective of the evolution of operating systems over the last fifty years, process and
memory management, process synchronization and deadlocks.
B. COURSE OBJECTIVES
By the end of the course, you should be able to: 1) elaborate what OS are, what they do, how
they are designed and constructed; 2) discuss how OS manage different system components
specifically process, main memory, secondary storage, and file systems; 4) compare and
contrast early and modern operating systems; 4) develop a good GUI design of a prototype
operating system using any application software; and 5) develop simulation programs on the
different CPU Scheduling algorithms used;
LECTURE
WEEK TOPICS
1–3 Overview of Operating Systems; History; Functionality of a typical OS
4 System Structures: Computer System and Operating System Structures
5 Process Management: Process Concept and Synchronization
6–7 Deadlock Handling: Prevention, Avoidance, Detection and Recovery
8 Memory Management: Allocation Strategies, Paging, Segmentation and Virtual
1
WEEK TOPICS
Memory
9 MIDTERM EXAM
10 – 11 File Management: File-System Interface, Concept, and Implementation;
Concurrent Processes
12-17 CPU Scheduling Algorithm: First Come First Served (FCFS), Shortest Job Next
(SJN), Shortest Remaining Time (SRT), Priority Scheduling, Round Robin (RR),
and Multi-level Feedback Scheduling.
18 FINAL EXAM
LABORATORY
WEEK TOPICS
1–6 Disk Operating System (DOS): Interfacing with DOS, DOS File System and
Commands, Wildcards, Redirecting Input and Output, Pipes, and Batch files
7–8 Storyboard of the Operating System Prototype
9 MIDTERM EXAM
10 – 13 Development of the Operating System Prototype Using Visual Basic 10
14 – 17 Develop Programs for the different CPU Scheduling Algorithm: First Come First
Served (FCFS), Shortest Job Next (SJN), Shortest Remaining Time (SRT),
Priority Scheduling, Round Robin (RR), and Multi-level Feedback Scheduling
using any application or programming language.
18 FINAL EXAM
F. Course Requirements
Group/individual projects, group/individual reports, performance activities, written and
oral examinations, learning contract, portfolio and research study
G. Grading System
Major Examination: 40%
Class Standing (Quizzes, Assignments, Seatworks, Project, Participation, Behavior):
60%
H. Classroom Policies
Class attendance and punctuality must be observed in accordance to the Revised
Student Code of Discipline, Article 10 - Class Attendance.
Wearing proper uniform and school ID card must be in compliance to the Revised
Student Code of Discipline, Article 2. Sections 1-3.
All mobile devices must be turned off or put in silent mode during classes.
Mobile devices and laptop computers are allowed in the classroom for academic
purposes only.
Kindness, courtesy, and respect are expected of every student.
Cheating during examinations and taking exams by proxy, or plagiarism in connection
with any academic work are strictly prohibited.
Any activity that would dishonestly improve your results or the results of others is not
allowed.
Strictly follow all the rules regarding the proper use of computer laboratory
2
I. Consultation Hours
Maria Concepcion G. Balcita MF 8-10; TTH 8-9, 3:30-5; W 8-9, 1-5
Jocelyn I. Ancheta MF 8-10; TTH 10-11, 2-3; W 8-10, 1-5
Ezekiel O. Bacungan MF 2-3; TTH 1-2, 4-5; W 8-11, 1-5
Prepared by:
EZEKIEL O. BACUNGAN
Faculty Member
Recommending Approval:
Approved: