Topic outline

  • Welcome to Operating Systems

    Welcome to Operating Systems! This course will cover an exciting range of materials from the broad field of operating systems, including basic operating system structure, communication, management of memory, reliability, file systems and storage, virtual machines, security, and manageability. We will examine influential historical systems and important current efforts, extracting lessons both on how to build systems as well as how to evaluate them. Happy learning together!


    • Welcome Audio by Taslima Ferdaus


    • Instructor 
      		 : Taslima Ferdaus Shuva
      Designation : Senior Lecturer
      Office address : Room no 601, Level 6, CSE Building, DIU(UC)
      Email : shuva.cse@diu.edu.bd
      Employee ID:  : 710001783

      Appointment in the Google Calendar:  Click here

      Google Classroom Code : 2pemetc


    • Course Rationale:

      Operating systems are central to computing activities. An operating system is a program that acts as an intermediary between a user of a computer and the computer hardware. Two primary aims of an operating system are to manage resources (e.g. CPU time, memory) and to control users and software. Operating system design goals are often contradictory and vary depending of user, software, and hardware criteria. This course describes the fundamental concepts behind operating systems, and examines the ways that design goals can be achieved.

    • Course Objective:

        • To learn the fundamentals of Operating Systems.
        • To learn the mechanisms of OS to handle processes and threads and their communication.
        • To learn the mechanisms involved in memory management in contemporary OS.
        • To gain knowledge on distributed operating system concepts that includes architecture, mutual exclusion algorithms, deadlock detection algorithms and agreement protocols.
        • To know the components and management aspects of concurrency management.
        • To learn how to implement simple OS mechanisms.


    • Course Outcomes (CO’s):

        • CO1:  Able to explain the functions, facilities, structure of operating systems and fundamental operating system abstractions.
        • CO2:  Able to analyze the structure of operating system and design the applications to run in parallel either using process or thread models of different OS.
        • CO3: Able to analyze the performance and apply different algorithms used in major components of operating systems, such as scheduler, memory manager, concurrency control manager and mass-storage manager, I/O manager
        • CO4:  Able to analyze and justify the various device and resource management techniques, managing deadlock situations for time-sharing and distributed systems.

    • Grading System:


    • Announcement

    • Survey!!!

    • Daily_Attendances

  • Week-1: Introduction

    Topic

      • Introduction to Operating systems
      • Review the basic organization of computer systems.
      • Operating systems Structure and functions
      • Computing Environments

    Expected Learning Outcome                            

      • Learn about the major components and functions of operating systems
      • Learn about many types of computing environments
      • Explore several open-source operating systems


  • Week 2: Operating-System Structures

    Topic

      • Operating System Services
      • System Calls
      • Operating System Design and Implementation
      • Operating System Structure

     Expected Outcome

      • Learn about the services an operating system provides to users, processes, and other systems
      • Differentiate between user level and system level functions of OS
      • Explain the various ways of structuring an operating system


  • Week 3: Processes

    Topic

      • Review class
      • Class Test-1
      • Process Concept
      • Process Scheduling
      • Operations on Processes

    Expected Outcome

      • Understand processes, various features of processes.
      • Understanding process scheduling, context switching, process creation and termination.


  • Week 4: CPU Scheduling

    Topic

      • Scheduling Criteria
      • Scheduling algorithm (FCFS and SJF)
      • Advantages, Disadvantages and application of scheduling algorithm
      • Exercise

    Expected Outcome

      • Explain different process scheduling algorithms and their pros and cons.
      • Evaluate the performance of various scheduling algorithms


  • Week 5: CPU Scheduling

    Topic

      • Scheduling algorithm (Priority and Round Robin)
      • Advantages, Disadvantages and application of scheduling algorithm
      • Exercise
      • Class Test-2

    Expected Outcome

      • Explain different process scheduling algorithms and their pros and cons.
      • Evaluate the performance of various scheduling algorithms


  • Week 6: Process Synchronization

    Topic

      • Inter Process Communication, Threading
      • Process coordination, synchronization
      • Critical Section problem, semaphores

    Expected Outcome

      • Explore interprocess communication using shared memory and message passing
      • Introduce the critical-section problem, whose solutions can be used to ensure the consistency of shared data
      • Examine several classical process-synchronization problems

  • Week 9: Deadlock & Presentation

    Topic

      • Deadlock Avoidance Algorithm (Bankers Algorithm)
      • Deadlock Detection
      • Recovery from Deadlock
      • Exercise
      • Presentation

    Expected Outcome

      • Select a deadlock handling method from a number of different methods for a specific scenario.
      • Identify safe state and apply Deadlock avoidance algorithm for sample data set.
      • To present a number of different methods for preventing or avoiding deadlocks in a computer system


  • Week 10: Virtual Memory

    Topic

    Expected Outcome

      • Understand benefits of a virtual memory system
      • Explain the concepts of demand paging


  • Week 11: Class Test 2 and Mid Discussion

    Topic

      • Demand paging
      • Page replacement and Page replacement Algorithm
      • Disk structure

    Expected Outcome

      • Explain the concepts of demand paging, page-replacement algorithms, and allocation of page frames
      • Examine the relationship between shared memory and memory-mapped files
      • Explore how kernel memory is managed
      • Describe the physical structure of secondary storage devices and its effects on the uses of the devices


    Midterm_Discussion


  • Week 12: Presentation Week



  • Week 13: Mass-Storage Systems

    Topic

      • Disk Structure
      • Disk scheduling 
      • RAID structure
      • Review Class

    Expected Outcome:

      • Describe the physical structure of secondary storage devices and its effects on the uses of the devices
      • Explain the performance characteristics of mass-storage devices
      • Evaluate disk scheduling algorithms
      • Discuss operating-system services provided for mass storage, including RAID

  • Week 14: Final Exam