Topic outline

  • Welcome to Operating Systems

    banner

    • Announcements Forum

      Dear Students,

      Welcome to the course CSE323 (Operating Systems) !! Myself Md. Sabab Zulfiker. I am looking forward to the opportunity so we will have to learn and grow together in this course.  I always believe that your success is most important to me as a teacher.  Please don’t hesitate to contact me in case of having difficulties with the course materials and any other academic problems. To smooth this operation, general questions related to the courses should be posted on the Discussion Forum.  If you have any question for which you are not interested to post in Forum, then you can send your query via email for a quick response. My contact information is mentioned below. Success in an online class requires just as much work and effort as success in a traditional classroom. Lastly, I am expecting much cooperation from all of you. Hope we will enjoy this journey joyfully.

      Stay safe and healthy. Thanks all of you for joining with this course.

      Best Regards,

      Md. Sabab Zulfiker  


      Welcome Video:


    • instrucl
      Instructor 
      		 : Md. Sabab Zulfiker (SZ)
      Designation :  Lecturer
      Office address : Room no 509-AB4, Department of CSE, DIU, Ashulia, Dhaka
      Email :  sabab.cse@diu.edu.bd
       Class Hours : 3 hours per week



    • 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 programmatically 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 timesharing and distributed systems.

    • Grading Scheme

                         Attendance         :7%

                           Class Test          :15%

                       Presentation        :8%

                         Assignment        :5%

      Mid Term Examination       :25%

               Final Examination      :40%


    • Attendance:

    • Student Feedbacks:

  • Week-1: Introduction

    Topic of Discussion

      • Introduction with the students
      • 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: Processes

    Topic of Discussion

      • 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 3: CPU Scheduling

    Topic of Discussion

      • 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


    • Slides and PDFs:

    • Video Lectures:

    • Video Lecture-3 (SJF Preemptive) URL
      Shortest Job First (Preemptive) is also known as Shortest Remaining Time First.

    • Class Lectures:

    • Class Lecture-1 (PC-A) URL
      Restricted Not available unless: You belong to PC-A
    • Class Lecture-2 (PC-A) URL
      Restricted Not available unless: You belong to PC-A
    • Class Lecture-3 (PC-A) URL
      Restricted Not available unless: You belong to PC-A
    • Class Lecture-1 (PC-B) URL
      Restricted Not available unless: You belong to PC-B
    • Class Lecture-2 (PC-B) URL
      Restricted Not available unless: You belong to PC-B
    • Class Lecture-3 (PC-B) URL
      Restricted Not available unless: You belong to PC-B

  • Week 4: CPU Scheduling

    Topic of Discussion

      • 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


    • Slides and PDFs:

    • Video Lectures:

    • Class Lectures:

    • Class Lecture-1 (PC-A) URL
      Restricted Not available unless: You belong to PC-A
    • Class Lecture-2 (PC-A) URL
      Restricted Not available unless: You belong to PC-A
    • Class Lecture-3 (PC-A) URL
      Restricted Not available unless: You belong to PC-A
    • Class Lecture-1 (PC-B) URL
      Restricted Not available unless: You belong to PC-B
    • Class Lecture-2 (PC-B) URL
      Restricted Not available unless: You belong to PC-B
    • Class Lecture-3 (PC-B) URL
      Restricted Not available unless: You belong to PC-B

    • Assignment:

    • Assignment Task on Priority Scheduling
      View Make a submission
      Consider the following dataset:
      Process Table
      Process Name        
      		 Priority Value      
      		 Arrival Time       
      		 Burst Time    
      P1
      		 4
      		 3
      		 2
      P2
      		 6(H)
      		 0
      		 6
      P3
      		 2
      		 4
      		 3
      P4
      		 5
      		 4
      		 1
      P5
      		 3
      		 6
      		 6
      P6
      		 4
      		 5
      		 3
      P7
      		 2(L)
      		 9
      		 4

      Perform priority scheduling (Non-preemptive) by drawing the Gantt Chart and calculate the average TAT, WT, and RT.

  • Week:5-First Quiz

    • quizICon

    • Question Paper:

    • Quiz Question (PC-A) File
      Restricted Not available unless: You belong to PC-A
    • Quiz-1 Question (PC-B) File
      Restricted Not available unless: You belong to PC-B

  • Week 6: Operating-System Structures

    Topic of Discussion

      • 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 7: Mid Term

  • Week 8: Deadlock

    Topic of Discussion

      • System Model
      • Deadlock Characterization
      • Methods for Handling Deadlocks
      • Deadlock Prevention
      • Deadlock Avoidance
      • Deadlock Avoidance Algorithm (Bankers Algorithm)
      • Exercise

    Expected Outcome

      • Identify deadlock situation by checking conditions
      • 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.


    • Slides and PDFs:

    • Video Lectures:

    • Class Lecture-1 (PC-A) URL
      Restricted Not available unless: You belong to PC-A
    • Class Lecture-1 (PC-B) URL
      Restricted Not available unless: You belong to PC-B
    • Class Lecture-2 (PC-A) URL
      Restricted Not available unless: You belong to PC-A
    • Class Lecture-2 (PC-B) URL
      Restricted Not available unless: You belong to PC-B

  • Week 9: Deadlock & Presentation

    Topic of Discussion

    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


    • Class Lectures:

    • Class Lecture (PC-A) URL
      Restricted Not available unless: You belong to PC-A
    • Class Lecture-1(PC-B) URL
      Restricted Not available unless: You belong to PC-B
    • Class Lecture-2 (PC-B) URL
      Restricted Not available unless: You belong to PC-B

  • Quiz-02

  • Week 10: Memory Management

    Topic of Discussion

      • Memory management strategy
      • Swapping, paging, segmentation

    Expected Outcome

      • Identify various ways of organizing memory hardware
      • Explain memory-management techniques, including paging and segmentation


  • Week 11: Class Test 3 and Virtual Memory

    Topic of Discussion

    Expected Outcome

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


  • Week 12: Virtual Memory

    Topic of Discussion

      • 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


    • Class Video Lectures:

    • Class Lecture (PC-A) URL
      Restricted Not available unless: You belong to PC-A
    • Class Lecture (PC-B) URL
      Restricted Not available unless: You belong to PC-B

  • Week 13: Mass-Storage Systems

    Topic of Discussion

      • 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



    • Slides and PDFs:

    • Class Video Lectures:

    • Class Lecture (PC-B) URL
      Restricted Not available unless: You belong to PC-B
    • Class Lecture (PC-A) URL
      Restricted Not available unless: You belong to PC-A

  • Presentation

  • Week 14: Final Exam