Home BCA 301 Course Plan

BCA 301 Course Plan

  • Programme Code 020
  • Course Code BCA-301
  • Course TypeCore
  • Programme Bachelor's in Computer Application
  • Course Name Operating System
  • L - T/P - Credits 3 - 1 - 4
  • Course Outcome
  • CO1
  • CO2
  • CO3
  • CO4
  • Understand the fundamentals of OS, its functionalities and techniques for managing processes, memories, disks, devices and threats in a computing system.
  • To Student would be acclimatized with the different forms of mass communication and Mass media activism.
  • To Students would be able to analyze & evaluate the various communication Models & Theories and their relevance.
  • Students would be able to identify & evaluate the emerging trends in Communication & Mass Communication.
Unit No.Lecture No.TopicSessional OutcomeMapping with COICT Tools / Class Material (PPT )First ShiftSecond ShiftGuest LectureExpert Lecture
1L1Introduction to Operating System, Simple Batch SystemsStudent would be able to understand basic concepts of managementCO1, CO3
1L2Multiprogrammed Batch systems, Time-Sharing SystemsUnderstand the difference between Batch OS and Time-Sharing OSCO1, CO3
1L3Parallel systems, Distributed SystemsUnderstand the concept and difference between Parallel and Distributed systemsCO1
1L4Real-Time SystemsUnderstand the concept of Real-Time systemsCO1, CO3
1L5Introduction to Memory Management, Logical versus Physical Address spaceUnderstand the basics of memory management and the two types of address spacesCO3
1L6Contiguous allocation, SwappingLearn the conept of continuous memory allocation and swapping techniqueCO1, CO3
1L7PagingUnderstand the concept of PagingCO3
1L8SegmentationUnderstand the concept and difference between Paging and Segmentation
1L9Virtual Memory, Demand PagingLearn about virtual memory and demand pagingCO3
1L10Page Replacement Algorithms: First Come First Serve, Optimal Page ReplacementApply knowledge of page replacement schemes like First Come First Serve and Optimal Page Replacement for OS designingCO2
1L11Page Replacement Algorithms: Least Recently UsedApply page replacement schemes like Least Recently UsedCO2
1L12Page Replacement Algorithms: Last In First OutApply page replacement schemes: Last In First OutCO3
1L13Performance of Demand PagingAnalyze the performance of demand paging techniquesCO2
1L14Allocation of Frames, ThrashingPerform allocation of frames and thrashingCO3
1L15Revision of Unit 1Doubt clearance and revision of the concepts studied in Unit 1
2L16Introduction to ProcessUnderstand the concept of process
2L17Difference between program and processUnderstand the concept of a process and the difference between program and processCO1
2L18Process SchedulingApply knowledge of different process scheduling techniques in designing OSCO1
2L19Operation on ProcessesExplain the different operations on processesCO1
2L20Revision
2L21CPU Scheduling: Basic ConceptsLearn the basics of CPU schedulingCO2
2L22Scheduling CriteriaLearn about different scheduling criteriaCO2
2L23Scheduling Algorithms TheoryExplain different scheduling algorithmsCO2
2L24Scheduling algorithm continueExplain different scheduling algorithms
2L25Scheduling Algorithms ApplicationUse various scheduling algorithms for process managementCO3
2L26Multiple Processor Schedulingunderstand the concept of multiple processor schedulingCO3
2L27Multitasking vs MultiprogrammingLearn the difference between multitasking and multiprogrammingCO3
2L28RevisionClear doubts
2L29Process SynchronizationExplain about synchronisation among processesCO1
2L30The Critical-Section ProblemUnderstand the critical section problemCO1
3L31Synchronization HardwareLearn about synchronization hardwareCO1
3L32SemaphoresLearn about semaphores
3L33Classical Problems of Synchronizationlearn about various synchronization problemsCO1
3L34Revision of Unit 2Doubt clearance and revision of the concepts studied in Unit 2
3L35Introduction to DeadlocksUnderstand the basics concepts of deadlocksCO4
3L36Deadlock examplesExplain real life examples of deadlock
3L37Deadlock CharacterizationExplain about the situations that cause deadlocksCO4
3L38Methods for Handling DeadlocksApply knowledge for various methods for handling deadlocksCO4
3L39Deadlock PreventionApply deadlock prevention techniquesCO4
3L40RevisionRevise concepts of deadlock
3L41Deadlock Avoidance, Deadlock DetectionApply deadlock avoidance and detection techniquesCO4
3L42Recovery from DeadlockExplain techniques for deadlock recoveryCO4
3L43Device Management TechniquesLearn about different techniques for device managementCO4
3L44Shared DevicesUnderstand the concept of shared devices
3L45Virtual Devices, Input-Output DevicesUnderstand the difference between shared, virtual and input-output devicesCO4
4L46Buffering, Disk StructureLearn about buffering and details of disk structureCO4
4L47Disk Scheduling, Disk ManagementPerform disk scheduling and management techniquesCO4
4L48RevisionRevision of device management
4L49Swap-Space Management, Disk ReliabilityUnderstand about managing swap space and disk reliabilityCO4
4L50Revision of Unit 3Doubt clearance and revision of the concepts studied in Unit 3
4L51Introduction to File SystemUnderstand the basic concepts of file systemCO1
4L52Types of File SystemUnderstyand types of file system
4L53Access Methods, Directory StructureLearn about access control methods and directory structureCO1
4L54Goals of Protection, Access RightsUnderstand the goals of protection and the concept of access rightsCO2
4L55Consistency Semantics SecurityLearn about consistency semantics securityCO2
4L56Revision
4L57Authentication, EncryptionUnderstand about authentication and apply encryption techniquesCO2
4L58Program Threats, System ThreatsLearn about program threats and system threatsCO2
4L59Case Study on Operating System (Linux, Windows OS)Discussion on Case Study
4L60RevisionClear doubts

# As per Scheme & Syllabus Of Guru Gobind Singh Indraprastha University, New Delhi 2022-23 Onwards.

[whatsapp]