Topic outline

  • Welcome to Operating Systems


    • Course Teacher

      Course Teacher:Most. Hasna Hena

      Designation:Assistant Professor

      Office address:Room no 405, Level 4, CSE Building, DIU(MC)

      Email:hena.cse@diu.edu.bd

      Mobile:01719472885

      Appoinment in Google Calendar: Click Here

      Text Book:

      1. Text Book: Operating System Concepts, 9th edition by Silberschatz, Galvin, Gagne

      2. Reference Book: Modern Operating Systems

      Course Outline

       Download course outline

      Daily Useful Links

      • Attendance: Click Here
      • Telegram: Click Here
      • Google Classroom:
        • Section E: 66x24r3
        • Section F: hbvbtsi
        • Section G: aoizaci
        • Section H: h2zbjya

      • Grading Scheme

                           Attendance         :7%

                             Class Test          :15%

                         Presentation        :8%

                           Assignment        :5%

        Mid Term Examination       :25%

                 Final Examination      :40%

      Course Code: CSE 323

      Course Description

      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 concept behind operating systems, and examines the ways that design goals can be achieved.

      Course Learning Outcome

      CLO1 Able to explain and analyze the functions, facilities, structure, environment and security of operating systems.
      CLO2 Able to investigate operating system administrative functions and can build shell program for process and file system management with system calls.
      CLO3 Able to analyze the performance and can 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.
      CLO4 Able to select, implement and justify recommending an operating system for a specified application and system configuration.

      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.

      Welcome my students to the course of Operating System. We teacher, can open the door, but you must enter it yourself.

      Welcome to Operating systems

       

       

      Prefect Information

      Name:Muhammad Rabius Sunny

      Dept:Computer Science and Engineering

      Email:Muhammad15-10932@diu.edu.bd

      Mobile:01171313713

      Name:Tariqul Islam

      Dept:Computer Science and Engineering

      Email:tariqul15-10765@diu.edu.bd

      Mobile:01862274335

    • Quick Access
      Attendance: Attend
      Class Test:       Self Test, Self Test 2, CT      Assignment: ASN       Presentation        Mid Exam       Final Assessment
      Week2Go:   WK1    WK2    WK3    WK4    WK5    WK6   WK7    WK8    WK9    WK10    WK11    WK12    WK13    WK14
      Class Link: SEC E, SEC F, SEC G, SEC H

    • Feedback Form URL

  • 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


    • Introduction to Operating Systems 

    • Recorded Class(Sec E) URL
      Restricted Not available unless: You belong to CSE-323(E)

      Please click on the link to see the class video

    • Recorded Class(Sec: F) URL
      Restricted Not available unless: You belong to any group

      Please click on the link to see the class lecture.

    • Recorded Class(Sec G) URL
      Restricted Not available unless: You belong to CSE-323(G)

      Please click on the link to see the class video

    • Recorded Class(Sec H) URL
      Restricted Not available unless: You belong to CSE-323(H)

      Please click on the link to see the class video

    • Self Test 1 Quiz
      View Receive a grade
    • Open Discussion Forum
      View Make forum posts: 1

  • Week 2: 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 3: Processes

    Topic of Discussion

      • Review class
      • Process Concept
      • Process Scheduling
      • Operations on Processes
      • Inter Process Communication

    Expected Outcome

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


  • Week 4: 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


  • Week 5: CPU Scheduling and Class Test

    Topic of Discussion

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

    Expected Outcome


    • Priority Scheduling Algorithm Pt-1 

    • Priority Scheduling Algorithm Pt-2

    • Practice Problem(F) Assignment
      Restricted Not available unless: You belong to CSE-323(F)
    • Practice Problem(G) Assignment
      Restricted Not available unless: You belong to CSE-323(G)
    • Practice Problem(E) Assignment
      Restricted Not available unless: You belong to CSE-323(E)
    • Class Test(Sec H) Assignment
      Restricted Not available unless: You belong to CSE-323(H)
    • Class Test(Sec E) Assignment
      Restricted Not available unless: You belong to CSE-323(E)
    • Class Test(Sec F) Assignment
      Restricted Not available unless: You belong to CSE-323(F)
    • Class Test(Sec G) Assignment
      Restricted Not available unless: You belong to CSE-323(G)

  • Week 6: CPU Scheduling Algorithm and Assignment

    Topic of Discussion

      • Review on previous Topic
      • Scheduling Algorithm(Round Robin)

    Expected Outcome



    • Round Robin Scheduling Algorithm Interactive Content

      Please click on the link to see the video

    • Assignment (F)
      Restricted Not available unless: You belong to CSE-323(F)
    • Assignment (G)
      Restricted Not available unless: You belong to CSE-323(G)
    • Assignment (H)
      Restricted Not available unless: You belong to CSE-323(H)
    • Assignment (E)
      Restricted Not available unless: You belong to CSE-323(E)

  • Week 7: Mid Term

    • Mid Term Assessment (E) Assignment
      Restricted Not available unless: You belong to CSE-323(E)
    • Mid Term Assessment (F) Assignment
      Restricted Not available unless: You belong to CSE-323(F)
    • Mid Term Assessment (G) Assignment
      Restricted Not available unless: You belong to CSE-323(G)
    • Mid Term Assessment (H) Assignment
      Restricted Not available unless: You belong to CSE-323(H)

  • 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.


    • Deadlock Interactive Content
      Complete the activity

      Please click on the link to see the video lecture 

    • Dead Lock URL

      Please click on the link to watch or download the video lecture.

    • Class Record(F) URL
      Restricted Not available unless: You belong to CSE-323(F)
    • Class Record(G) URL
      Restricted Not available unless: You belong to CSE-323(G)
    • Class Record(E) URL
      Restricted Not available unless: You belong to CSE-323(E)

  • Week 9: Deadlock

    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


    • Banker's Algorithm URL

      Please click on the link to watch or download the video lecture.

    • Class Record (G) URL
      Restricted Not available unless: You belong to CSE-323(G)
    • Class Record (E) URL
      Restricted Not available unless: You belong to CSE-323(E)
    • Class Record (F) URL
      Restricted Not available unless: You belong to CSE-323(F)
    • Practice Problem(F) Assignment
      Restricted Not available unless: You belong to CSE-323(F)
    • Practice Problem (G) Assignment
      Restricted Not available unless: You belong to CSE-323(G)
    • Practice Problem(E) Assignment
      Restricted Not available unless: You belong to CSE-323(E)

  • Week 10: Presentation


    • Presentation (G) Assignment
      Restricted Not available unless: You belong to CSE-323(G)
    • Presentation (E) Assignment
      Restricted Not available unless: You belong to CSE-323(E)
    • Presentation (F) Assignment
      Restricted Not available unless: You belong to CSE-323(F)
    • Presentation (H) Assignment
      Restricted Not available unless: You belong to CSE-323(H)

  • Week 11: Memory Management

    Topic of Discussion

    Expected Outcome

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


    • Memory Allocation Algorithm  

       

    • Class Record (F) URL
      Restricted Not available unless: You belong to CSE-323(F)
    • Class Record (G) URL
      Restricted Not available unless: You belong to CSE-323(G)
    • Class Record (E) URL
      Restricted Not available unless: You belong to CSE-323(E)
    • Class Record (H) URL
      Restricted Not available unless: You belong to CSE-323(H)
    • Practice Problems (F) Assignment
      Restricted Not available unless: You belong to CSE-323(F)
    • Practice Problems (G) Assignment
      Restricted Not available unless: You belong to CSE-323(G)
    • Practice Problems (E) Assignment
      Restricted Not available unless: You belong to CSE-323(E)
    • Practice Problems (H) Assignment
      Restricted Not available unless: You belong to CSE-323(H)

  • Week 12: Virtual Memory

    Topic of Discussion

      • Review on Previous topic
      • Virtual memory management 
      • Demand paging
      • Page replacement and Page replacement Algorithm

    Expected Outcome

      • Understand benefits of a virtual memory system
      • Explain the concepts of demand paging
      • Explain the concepts of demand paging, page-replacement algorithms, and allocation of page frames


    • Page Replacement Algorithm 

       

       

    • Class Record (F) URL
      Restricted Not available unless: You belong to CSE-323(F)
    • Class Record (G) URL
      Restricted Not available unless: You belong to CSE-323(G)
    • Class Record (E) URL
      Restricted Not available unless: You belong to CSE-323(E)
    • Class Record (H) URL
      Restricted Not available unless: You belong to CSE-323(H)
    • Practice Problems(E) Assignment
      Restricted Not available unless: You belong to CSE-323(E)
    • Practice Problems(F) Assignment
      Restricted Not available unless: You belong to CSE-323(F)
    • Practice Problems(G) Assignment
      Restricted Not available unless: You belong to CSE-323(G)
    • Practice Problems(H) Assignment
      Restricted Not available unless: You belong to CSE-323(H)

  • Week 13: Review Class

    Topic of Discussion

             Review on the topics of Week 8, Week 9, Week 10, Week 11 and Week 12.


    • Week 14: Final Exam

      • Final Exam ( Sec F) Assignment
        Restricted Not available unless: You belong to CSE-323(F)
      • Final Exam ( Sec G) Assignment
        Restricted Not available unless: You belong to CSE-323(G)
      • Final Exam ( Sec E) Assignment
        Restricted Not available unless: You belong to CSE-323(E)
      • Final Exam ( Sec H) Assignment
        Restricted Not available unless: You belong to CSE-323(H)