Thanks to visit codestin.com
Credit goes to www.scribd.com

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

Syllabus

The document outlines the syllabus for the B. Tech II Year II Semester course on Operating Systems, detailing course objectives, unit topics, and expected outcomes. Key areas of study include operating system structures, process management, synchronization, memory management strategies, and file systems. Students will learn practical skills such as writing shell scripts, creating processes and threads, and implementing scheduling techniques.

Uploaded by

hkumar92504
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)
60 views2 pages

Syllabus

The document outlines the syllabus for the B. Tech II Year II Semester course on Operating Systems, detailing course objectives, unit topics, and expected outcomes. Key areas of study include operating system structures, process management, synchronization, memory management strategies, and file systems. Students will learn practical skills such as writing shell scripts, creating processes and threads, and implementing scheduling techniques.

Uploaded by

hkumar92504
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

Dept.

of Computer Science & Engineering (Cyber Security)

B. Tech II Year II Semester


23CSC105 OPERATING SYSTEMS
L T P C
3 0 0 3
Course Objectives:
1. To describe the operating system structures, services and system call.
2. To illustrate the process management concepts and threads
3. To demonstrate about scheduling algorithms and process synchronization.
4. To explain the concept of deadlocks.
5. To illustrate the file system and protection techniques.
UNIT I INTRODUCTION 9 hours

Concept of Operating Systems, OS Services, System Calls, Structure of an OS - Layered, Monolithic,


Microkernel Operating Systems, Case study on UNIX and Windows Operating System.
Korn Shell Programming: Basic Script Concepts, Expressions, Decisions: Making Selections, Repetition,
Special Parameters and Variables, Changing Positional Parameters, Argument Validation, Debugging
Scripts.
UNIT II PROCESS CONCEPTS 9 hours

Processes: Definition, Process Relationship, Different states of a Process, Process State transitions, Process
Control Block (PCB), Context switching Thread: Definition, Various states, Benefits of threads, Types of
threads, Concept of multithreads
Process Scheduling: Foundation and Scheduling objectives, Types of Schedulers, Scheduling criteria: CPU
utilization, Throughput, Turnaround Time, Waiting Time, Response Time; Scheduling algorithms: Pre-
emptive and Non-pre-emptive, FCFS, SJF, RR; Multiprocessor scheduling.
UNIT III PROCESS SYNCHRONIZATION AND DEADLOCKS 9 hours

Critical Section, Race Conditions, Mutual Exclusion, Hardware Solution, Strict Alternation, Peterson’s
Solution, The Producer Consumer Problem, Semaphores, Event Counters, Monitors, Message Passing,
Classical IPC Problems: Reader’s & Writer Problem, Dinning Philosopher Problem etc. Deadlocks:
Definition, Necessary and sufficient conditions for Deadlock, Deadlock Prevention, Deadlock Avoidance:
Banker’s algorithm, Deadlock detection and Recovery.

UNIT IV MEMORY MANAGEMENT STRATEGIES 9 hours

Memory Management: Basic concept, Logical and Physical address map, Memory allocation: Contiguous
Memory allocation, Fixed and variable partition, Internal and External fragmentation and Compaction;
Paging: Principle of operation, Page allocation, Hardware support for paging, Protection and sharing,
Disadvantages of paging. Virtual Memory: Basics of Virtual Memory, Hardware and control structures,
Locality of reference, Page fault, Working Set, Dirty page/Dirty bit, Demand paging, Page Replacement
algorithms: Optimal, First in First Out (FIFO), Second Chance (SC), Not recently used (NRU) and Least
Recently used (LRU).

82 | P a g e
Dept. of Computer Science & Engineering (Cyber Security)

UNIT V FILE SYSTEM 9 hours

File Management: Concept of File, Access methods, File types, File operation, Directory structure, File
System structure, Allocation methods (contiguous, linked, indexed), Free-space management (Bit vector,
linked list, grouping), directory implementation (linear list, hash table), efficiency and performance. Disk
Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk reliability, Disk
formatting, Boot-block, Bad blocks.
Protection: Goals of protection, Principles of protection, Protection Rings, Domain of protection, Access
matrix.
Course Outcomes:
At the end of this course students will demonstrate the ability to
CO1: Write shell scripts using KornShell.
CO2: Create processes & threads and implement the various process scheduling techniques.
CO3: Analyze the concurrent processing and deadlock situations.
CO4: Design algorithmic solutions to solve memory management problems.
CO5: Implement the file protection techniques.

Text Books:
1. “Operating System Concepts”, Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, 10th
Edition, John Wiley and Sons Inc., 2018
2. "Modern Operating Systems", Andrew S Tanenbaum, Pearson, 5th Edition, 2022 New Delhi.
Reference Books:
1. “Operating Systems – A Spiral Approach”, RamazElmasri, A. Gil Carrick, David Levine, Tata McGraw
Hill Edition, 2010.
2. "Operating Systems: Internals and Design Principles", William Stallings, 7th Edition,
Prentice Hall, 2018.
3. “Operating Systems”, AchyutS.Godbole, AtulKahate, McGraw Hill Education, 2016.

Mode of Evaluation: Assignments, Mid Term Tests and End Semester Examination.

83 | P a g e

You might also like