DI03000041 Fundamentals Operating System
DI03000041 Fundamentals Operating System
Semester: 3nd
Prerequisite: Basic computer literacy, Logical Thinking and Command Line Interface
As a core subject of Computer Engineering, this course enables to understand
importance of Operating System, its functionalities to manage resources of
Computer and Peripherals, program development and its execution. An
operating system (OS) is the core software that manages hardware resources and
Rationale: provides essential services to applications. Every student of computer science
must therefore understand basic structure of an operating system. After learning
this subject student will be able to discriminate between various types of
operating systems, its processor, processes, and memory and file management.
The subject also emphasizes on Linux utilities and scripting.
Course Outcome:
After Completion of the Course, Student will able to:
Course Content:
Unit No. of % of
Content
No. Hours Weightage
Introduction of Operating System
Fundamental Goals of Operating system, Operating System
services
Types of Operating Systems:
1. 06 13
Multi programming, Time sharing, Real Time, Multithreading,
Distributed, Embedded Operating System
OS structure: Layered, Monolithic, Microkernel Operating Systems
Case Study: Linux, Latest Windows Operating System, Mac OS
Concepts of Process
Overview of the Process & threads, Process Life Cycle/ Process
States, Process Control Block (PCB)
Process Scheduling
2 Scheduling Criteria, Scheduling Algorithms: First Come First 14 31
Serve, Shortest Job First, Round Robin, Non-Preemptive
Priority based Scheduling
Overview of Schedulers
Tyes of Schedulers: Long term Schedulers, Short Term
Schedulers, Medium Term Schedulers, Scheduling Queues,
Context Switch
Process Synchronization
2.
Critical Section, Mutual Exclusion, Race Condition
Deadlock
Definition, Conditions for Deadlock, Dealing with Deadlock:
ignorance of deadlock, Detection and recovery, Dynamic avoidance,
Deadlock Prevention, Resource allocation graph
Memory Management
Logical and physical address, Swapping
Memory Allocation
1. Contiguous memory allocation:
Multiprogramming with Fixed partition, Multiprogramming with
dynamic partition, Internal and External Fragmentation and
3 compaction, Memory relocation and protection mechanism, 10 23
Allocation techniques – First Fit, Best Fit and Worst Fit
2. Non-Contiguous Memory allocation
Overview of Paging: Address translation using basic method
of paging, Overview of Segmentation: Address translation
using Segmentation
Page replacement algorithm – FIFO, LRU
Files System
Files Attributes, File Operations, File Types, File Paths: Absolute
file path, Relative file path, File Security and Protection mechanism
Directory System
Directory Structures: Single Level, Two Level, Tree Structured,
4 Acyclic Graph, General Graph Directory Structure 06 13
left-hand side. Using the SCAN and CSCAN method, determine the total number of track
movements of the Read/Write head.
6) Test and run basic Unix commands.
7) Test and run advanced Unix commands.
8) Test commands related with File editing with Vi, Vim, gedit, gcc.
9) Create a shell script to read from command line and print “Hello”.
10) Create a Shell script to read and display content of a file. And append content of one file to another
11) Create a Shell script to accept a string in lower case letters from a user, & convert to upper case
letters.
12) Create a Shell script to add two numbers.
*********