Weekly outline

  • Welcome to Operating Systems, the heart of computer! This system runs the computer literally.


    • WELCOME!!!

    • Instructor : Ms. Subhenur Latif
      Office :  Room#409, Level 4, CSE Building, Daffodil Tower Extension
      Email  : snlatif@daffodilvarsity.edu.bd
      DIU Profile: https://faculty.daffodilvarsity.edu.bd/profile/cse/latif.html
      Google Site: https://sites.google.com/daffodilvarsity.edu.bd/subhenur-latif/

      I am also available at:
               youtube logo



      Students! Join in our Telegram Group by clicking the link below:
      telegram

      Join in our Telegram Group:

      A Section Joining Link
      B Section Joining Link



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

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

    • Assessment

                         Attendance       :7%

                           Class Test       :15%

                       Presentation        :8%

                         Assignment        :5%

      Mid Term Examination       :25%

               Final Examination      :40%


    • Student Interest Survey

      My beloved students,

      Please provide your feedback and help me to help you!


    • Appointment

      appointment

      Dear students, you can set appointment with me!



    • Quick Link
      Class Test: Demo, CT1, CT2, CT3      Assignment: ASN1, ASN2, ASN3       Presentation       Mid Exam       Final Exam
      Week2Go:   WK1    WK2    WK3    WK4    WK5    WK6   WK7    WK8    WK9    WK10    WK11    WK12    WK13    WK14

    • Section A Live Class Link URL
      Restricted Not available unless: You belong to Section A

      Students from A section. Join live class through this link!

    • B Section Live Class Link URL
      Restricted Not available unless: You belong to Section B

      Students from B section, Join live class through this link!

  • Week 1

    week 1

    Introduction to Operating System

    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


    File: 1Lesson: 1Forum: 1Interactive Content: 1

  • Week 2

    week 2

    OS Services and 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


    Files: 2Quiz: 1Interactive Content: 1

  • Week 3

    week 3

    Processes and Threads

    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.


    Files: 2Quiz: 1Interactive Content: 2

  • Week 4 and 5

    week 4

    week 5

    CPU Scheduling

    Topic of Discussion

      • Scheduling algorithm (FCFS, SJF, 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


    Files: 2Assignment: 1

  • Week 6

    week 6

    Review Week



    Assignments: 2

  • Instructions for Mid-term Exam

    week 7

    mid guide

    Mid-term exam Syllabus:

    Core Chapters:

    Chapter Name: Processes

    Key points:

    Idea of Process, major parts and states of process, transition of states, context switching, operation (process create, delete), schedulers (All types) 

    Chapter Name: CPU Scheduling

    Key points:

    Name of Algorithms:

    FCFS

    SJF [ Preemptive, Nonpreemptive ], 

    Priority [Preemptive, Nonpreemptive ])

    RoundRobin

    Main concept of each algorithm, Gantt Chart, Waiting Time, Response time, Pros and cons


    Other Chapters:

    Introduction to OS 

    OS Services and Structures

    Key points: All basic concept

    ____________________________________________________________________________________

    Mid-term Exam Assessment Criteria:
    Assessment will be done in two parts:
    Part 1: Theoretical Concept
    Part 2: Algorithm

    Marks Distribution:

    Mid-term exam will be on 25 marks. It will be equally distributed in two parts of assessment.

    All the questions should be answered.

    How to Complete Exam Process from Student Side: Watch the Video!!


    File: 1Assignment: 1URL: 1

  • week 8


    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.


    Files: 3Interactive Content: 1

  • Week 9


    Memory Management

    Topic of Discussion

    Expected Outcome

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


    File: 1

  • Week 10


    Files: 2Forum: 1Quiz: 1

  • Week 12

    week 12

    Review Class

    Topic of Discussion

    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
      • Identify Deadlock
      • Apply Banker's Algorithm
      • Explain Disk Scheduling


    Quiz: 1

  • Week 13

    week 13

    Instructions for Assessment:

    Syllabus:

    Deadlock

    Memory Management

    Virtual Memory

     Mass Storage System

    Date and Time:

    Date:15/4/2021, Time: 11AM, Duration: 5 Hours

    Chapter-wise Algorithms: 

    Chapter-Deadlock: Banker's Algorithm, Resource Request Algorithm 

    Chapter-Memory Management: Memory Allocation Algorithm ( First Fit, Best Fit, Worst Fit )

    Chapter-Virtual Memory: Page Replacement Algorithm ( FIFO, Optimal, LRU )

    Chapter- Mass Storage System (Disk Scheduling Alogorithms)


    Chapter-wise Concepts: 

    Chapter-Deadlock Identification, Conditions for Deadlock, Methods of handling deadlock

    Chapter-Memory Management:Logical to Physical Address Conversion (Techniques, Reason, Use), Address Binding, Segmentation

    Chapter-Virtual Memory: Basic Concept of Paging


    All the Best!


    Assignment: 1