Operating Systems (Diploma)

Processes, CPU scheduling, synchronization, deadlocks, memory management and file systems.

6 MonthsDuration 5Chapters30Topics

Syllabus · पाठ्यक्रम

Download PDF
01Unit 1: Introduction to Operating Systems 5 topics
  1. Definition and functions of an OS
  2. Batch, multiprogramming, time-sharing, real-time and distributed OS
  3. OS services and system calls
  4. Kernel - monolithic and microkernel
  5. Examples - Windows, Linux, Android
02Unit 2: Process Management and CPU Scheduling 7 topics
  1. Process concept and process states
  2. Process Control Block
  3. Threads - user and kernel level
  4. Context switching
  5. Scheduling criteria
  6. FCFS, SJF, priority and round robin scheduling
  7. Gantt chart, waiting time and turnaround time
03Unit 3: Process Synchronization and Deadlocks 6 topics
  1. Critical section problem
  2. Semaphores - binary and counting
  3. Producer-consumer and readers-writers problems
  4. Deadlock - necessary conditions
  5. Resource allocation graph
  6. Deadlock prevention, avoidance (Banker's algorithm), detection and recovery
04Unit 4: Memory Management 7 topics
  1. Logical and physical address
  2. Contiguous allocation - first fit, best fit, worst fit
  3. Internal and external fragmentation
  4. Paging and segmentation
  5. Virtual memory and demand paging
  6. Page replacement - FIFO, LRU, Optimal
  7. Thrashing
05Unit 5: File and Disk Management 5 topics
  1. File concepts, attributes and operations
  2. Access methods - sequential, direct, indexed
  3. Directory structures
  4. File allocation - contiguous, linked, indexed
  5. Disk scheduling - FCFS, SSTF, SCAN, C-SCAN

About

You will be able to

  • Explain the functions, structure and types of operating systems
  • Describe process states, PCB, threads and inter-process communication
  • Solve CPU scheduling problems using FCFS, SJF, priority and round robin and find average waiting time
  • Explain critical section, semaphores and classical synchronization problems
  • Identify deadlock conditions and apply prevention, avoidance (Banker's algorithm) and detection
  • Explain paging, segmentation, virtual memory and page replacement algorithms
  • Describe file organisation, directory structures and disk scheduling

Who it is for

  • Diploma Computer Science & Engineering students of Semester 4 (BTEUP)
  • Diploma IT students and BCA students studying operating systems
  • Students preparing for lateral-entry and computer operator exams

What you need

  • Basic computer fundamentals and Computer Organisation of Semester 3

Questions

Which syllabus is covered?

The BTEUP Diploma Computer Science & Engineering Semester 4 Operating Systems syllabus. Where your college syllabus differs, the centre follows your own syllabus.

Are numericals included?

Yes. CPU scheduling, page replacement, Banker's algorithm and disk scheduling numericals are practised step by step.

Is Linux taught?

Basic Linux commands are shown to explain processes and files; the main focus is the theory needed for the exam.

Download the syllabus (PDF)

Tell us who you are — your copy is made with your name, and our counsellor can help you choose the right course and centre.

Want to join right away? Enquire now — our centre will call you.