B.Tech Computer Science & Engineering · Sem 4 (Core, code BCS401) · B.Tech Information Technology · Sem 4 (Core, code BCS401) · B.Tech Artificial Intelligence & Machine Learning · Sem 4 (Core, code BCS401) · B.Tech Artificial Intelligence & Data Science · Sem 4 (Core, code BCS401) · B.Tech CSE (Artificial Intelligence) · Sem 4 (Core, code BCS401) · B.Tech CSE (AI & ML) · Sem 4 (Core, code BCS401) · B.Tech CSE (Data Science) · Sem 4 (Core, code BCS401) · B.Tech CSE (Cyber Security) · Sem 4 (Core, code BCS401) · B.Tech CSE (Internet of Things) · Sem 4 (Core, code BCS401) · B.Tech Computer Science & Design · Sem 4 (Core, code BCS401) · B.Tech Computer Science (Hindi) · Sem 4 (Core, code BCS401H) · B.Tech Computer Science & Business Systems · Sem 4 (Core, code BCS401) · B.Tech Cyber Security · Sem 4 (Core, code BCS401) · B.Tech Data Science · Sem 4 (Core, code BCS401) · B.Tech Electronics & Computer Engineering · Sem 4 (Core, code BCS401)
Operating system and functions, Classification of Operating systems- Batch, Interactive, Time sharing, Real Time System, Multiprocessor Systems, Multiuser Systems, Multiprocess Systems, Multithreaded Systems, Operating System Structure- Layered structure, System Components, Operating System services, Reentrant Kernels, Monolithic and Microkernel Systems.
Process Concept, Principle of Concurrency, Producer / Consumer Problem, Mutual Exclusion, Critical Section Problem, Dekker’s solution, Peterson’s solution, Semaphores, Test and Set operation; Classical Problem in Concurrency- Dining Philosopher Problem, Sleeping Barber Problem; Inter Process Communication models and Schemes, Process generation.
Scheduling Concepts, Performance Criteria, Process States, Process Transition Diagram, Schedulers, Process Control Block (PCB), Process address space, Process identification information, Threads and their management, Scheduling Algorithms, Multiprocessor Scheduling. Deadlock: System model, Deadlock characterization, Prevention, Avoidance and detection, Recovery from deadlock.
Basic bare machine, Resident monitor, Multiprogramming with fixed partitions, Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation, Paged segmentation, Virtual memory concepts, Demand paging, Performance of demand paging, Page replacement algorithms, Thrashing, Cache memory organization, Locality of reference.
I/O devices, and I/O subsystems, I/O buffering, Disk storage and disk scheduling, RAID. File System: File concept, File organization and access mechanism, File directories, and File sharing, File system implementation issues, File system protection and security.
After completion of the course student will be able to:
Note: The B.Tech Cyber Security and Data Science syllabus PDF (2nd year, effective from 2025-26) prints new course outcomes for this subject: CO1: Explain the architecture, functions, services, and different types of operating systems along with their structural organization (K2); CO2: Analyze process management concepts, process synchronization techniques, inter-process communication mechanisms, and classical synchronization problems (K4); CO3: Analyze CPU scheduling algorithms, thread management, and deadlock handling techniques for efficient process execution (K4); CO4: Evaluate memory management techniques for optimal memory utilization (K5); CO5: Evaluate I/O management, disk scheduling algorithms, RAID, and file system organization to ensure efficient storage management and system performance (K5).
This subject is on page 13 of the original AKTU PDF.
