BCA 202T Operating Systems Notes for GGSIPU BCA Sem 4

Scheme: BCA scheme w.e.f. 2024-25 | Applies to: batch admitted 2024-25 onwards | Verified against: BCA Scheme and Syllabus, 12 Oct 2026

On this page

1. BCA 202T at a glance
2. Unit-wise notes
   1. Unit 1: OS, Linux and vi editor
   2. Unit 2: Processes, scheduling and synchronization
   3. Unit 3: Memory, virtual memory and deadlocks
   4. Unit 4: Files and Linux file security
3. Exam corner
4. Excerpt: page replacement
5. Syllabus coverage
6. Who writes and checks the notes
7. BCA 202P lab and Sem 4 papers
8. How to write answers
9. FAQs
10. Get the full notes

BCA 202T Operating Systems at a glance: GGSIPU BCA Sem 4 credits, units and exam pattern

Its only prerequisite is a basic idea of computer hardware and software.

The other core theory paper is BCA 204T Software Testing; electives fill the rest of the GGSIPU BCA Semester 4 papers.

BCA 202T Operating Systems Notes unit-wise: 20 solved examples and 46 diagrams across 4 units

The official syllabus numbers its units without titles, so the headings below use the titles printed in these BCA 202T Operating Systems IPU notes. Notes for other papers: GGSIPU BCA notes.

BCA 202T Unit 1: Introduction to Operating System, Linux and vi Editor

Pages 4 to 21 · 8 sections · 1 solved Linux session, 2 shell scripts with output · 8 figures · 14 + 10 questions.

Quick look: path symbols (from page 14)

BCA 202T Unit 2: Processes, CPU Scheduling and Process Synchronization

Process states, the PCB, schedulers, fork() and threads. One set of four processes runs through FCFS, SJF, SRTF, both priority types and Round Robin. Then semaphores, the bounded buffer and ps, top, nice, renice.

Pages 22 to 43 · 10 sections · 6 solved examples, key for 2 practice numericals · 15 figures · 12 + 9 questions.

Quick look: P1 to P4, AT 0 to 3, BT 5, 3, 8, 6 (from page 36)

BCA 202T Unit 3: Memory Management, Virtual Memory and Deadlocks

Memory: swapping, first, best and worst fit, paging with the TLB, segmentation. Virtual memory: demand paging, page replacement, frames, thrashing. Deadlocks: Coffman conditions, prevention, the Banker's algorithm, detection, recovery.

Pages 44 to 63 · 19 sections · 10 solved examples · 11 figures · 11 + 9 questions.

Quick look: segment table lookups (from page 51)

BCA 202T Unit 4: Information Management and Linux File Security

Files, three access methods, five directory structures, disk access time and six disk-scheduling algorithms. Then ls -l permission strings, symbolic and octal chmod, chown and umask.

Pages 64 to 78 · 7 sections · 3 solved examples · 12 figures · 13 + 8 questions.

Quick look: head movement, queue 98, 183, 37, 122, 14, 124, 65, 67, head at 53 (from page 73)

BCA 202T exam corner: 50 two-mark and 36 ten-mark exam questions by unit

Exam-style practice for Q1 and the unit choices, with no past-paper year tags.

The BCA 202T notes list 50 two-mark and 36 ten-mark exam questions across 4 units, plus 20 solved examples.

1. Unit 1 (2 marks): Difference between rmdir and rm -r? Pointer: rmdir removes only an empty directory; rm -r removes contents too (page 16).
2. Unit 2 (10 marks): Explain the critical-section problem and its semaphore solution. Pointer: three requirements, then wait(mutex) and signal(mutex), mutex = 1 (pages 37 to 38).
3. Unit 3 (10 marks): Explain the Banker's algorithm with an example. Pointer: Need = Max − Allocation, then the safety algorithm: <P1, P3, P4, P0, P2> (pages 59 to 60).
4. Unit 4 (2 marks): Convert rwxr-x--- to octal. Pointer: 7, 5, 0, so 750 (page 76).

More practice will sit in the BCA 202T important questions.

FIFO, Optimal and LRU page replacement in operating systems: excerpt from page 53 of the BCA 202T notes

Excerpt from page 53

All three algorithms below use the Silberschatz reference string with 3 frames: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. In the frame tables of the notes, every column marked F is a page fault and "-" is a hit.

FIFO page replacement

The page that has been in memory the longest is replaced. FIFO is easy to program with a queue, but the oldest page may still be in heavy use. On this string FIFO gives a total of 15 page faults and 5 hits.

Optimal (OPT) page replacement

Replace the page that will not be used for the longest period of time in the future. OPT gives the lowest possible page-fault rate and never suffers from Belady's anomaly, but no OS can know the future reference string, so it is used only as a benchmark. Total page faults with Optimal: 9.

One decision, worked: at the 4th reference (page 2), memory holds 7, 0 and 1. Page 0 is needed next at reference 5, page 1 at reference 14 and page 7 only at reference 18, so 7 is replaced.

LRU (Least Recently Used) page replacement

Replace the page that has not been used for the longest period of time. LRU uses the recent past as a guess for the near future and is the most widely used good algorithm. It can be built with counters (a time-of-use field in each page-table entry) or a stack of page numbers, and it does not suffer from Belady's anomaly. Total page faults with LRU: 12.

One decision, worked: at reference 8 (page 4), memory holds 0, 2 and 3. Looking back, 0 was used just before, 3 two references ago and 2 four references ago, so 2 is replaced.

FIFO, Optimal and LRU compared, 3 frames (excerpt, page 53)

Algorithm	Page faults	Belady's anomaly?	Implementable?
FIFO	15	Yes	Yes, very easy
Optimal	9	No	No, needs future knowledge
LRU	12	No	Yes, needs hardware support

FIFO, Optimal and LRU compared, 3 frames (excerpt, page 53)

Algorithm

FIFO

Page faults

15

Belady's anomaly?

Yes

Implementable?

Yes, very easy

Algorithm

Optimal

Page faults

9

Belady's anomaly?

No

Implementable?

No, needs future knowledge

Algorithm

LRU

Page faults

12

Belady's anomaly?

No

Implementable?

Yes, needs hardware support

Belady's anomaly

Normally more frames should mean fewer faults. For FIFO this can fail: on the string 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5, FIFO gives 9 faults with 3 frames but 10 faults with 4 frames.

Do the BCA 202T notes cover the full GGSIPU syllabus?

Yes. Every official BCA 202T topic has a section in the notes; Unit 4 also adds disk scheduling and allocation methods.

Sources: BCA Scheme and Syllabus, 1st and 2nd Year Common, batch 2024-25 onwards and BCA Scheme of Examination, w.e.f. 2024-25.

Each unit cites its Silberschatz (TB1) and Sumitabha Das (TB2) chapters. Each course in GGSIPU notes is mapped to its official PDF the same way.

Who writes and checks the BCA 202T OS notes?

• Prateek Talwar, author: Founder, Unnati Educations; ACS (ICSI, membership no. 58704, since 2019); B.Com, University of Delhi, 2012. Author bio.
• Ritik Rawat, subject reviewer: Senior Full Stack Developer, Unnati Educations; B.Tech. Checks the scheduling numericals, Linux commands and chmod outputs. Reviewer bio.

The same team prepares GGSIPU important questions for every course.

BCA 202T and the BCA 202P OS lab (17 practicals), plus other GGSIPU BCA Sem 4 papers

Lab: BCA 202P OS lab notes. 17 official practicals, 15 to be implemented, all at a Linux terminal.

• Unit 1 Linux and vi → practicals 1 to 5, 9, 10
• Unit 1 shell scripts → practicals 11 to 17
• Unit 2 process commands → practical 6
• Unit 4 file permissions → practicals 7, 8
• Unit 3 → no practical; theory only

Other Semester 4 papers: BCA 204T/204P Software Testing; BCA 232 Logic & Critical Thinking; BCA 234 Health & Wellness (NUES).

One elective pair: BCA 212T/212P Data Science, 216T/216P Cyber Security, 218T/218P Web Development Using Python or 220T/220P Information Security; plus one of BCA 222T Digital Marketing, 224T Principles of Accounting or 226T Open Elective.

How to write BCA 202T answers: Gantt-chart numericals, frame tables and ten-mark comparison answers

Most marks in this paper come from three answer types, and the notes give a fixed format for each. Follow it even when you are short of time, because examiners award step marks for the layout, not only for the final figure.

1. Scheduling numericals (Unit 2)

Write the Gantt chart with the time under every boundary, a table of AT, BT, CT, TAT and WT, the formulas TAT = CT − AT and WT = TAT − BT, then the averages with the division shown. Step marks are given for each part. For SRTF, preemptive priority and Round Robin, re-check the ready queue at every arrival.

2. Frame and Banker's tables (Units 3 and 4)

Draw one column per reference and mark every fault with F before counting. In Banker's problems write the Need matrix first and show Work after each step. A chmod answer gives the command and the result, e.g. chmod 754 file → rwxr-xr--.

3. Theory and comparison answers

For each OS type: definition, diagram, advantages, disadvantages, example. For each Linux command: syntax, main options, one example with output. Put comparisons such as kernel vs shell in a table of at least five points.

Worked example: the convoy effect (page 32)

1. P1 = 24, P2 = 3, P3 = 3, all arrive at 0, served FCFS.
2. Order P1, P2, P3: average WT = (0 + 24 + 27) / 3 = 17 ms.
3. Order P2, P3, P1: average WT = (6 + 0 + 3) / 3 = 3 ms.
4. Short jobs stuck behind one long job: the convoy effect.

Common slip: in the bounded-buffer answer, call wait(empty) before wait(mutex), or the producer can deadlock. Practise on the GGSIPU BCA important questions.

BCA 202T OS notes FAQs

What is the passing mark for BCA 202T Operating Systems?

BCA 202T is marked out of 100: 40 internal and 60 in the end-term exam. The BCA scheme of examination does not print a separate pass percentage for this paper, so we do not quote one. End-term minimums, re-appear and grading follow the university's Ordinance 11 on ipu.ac.in, so check it or ask your college.

Which unit of BCA 202T has the most solved examples?

Unit 3 has 10 of the 20 solved examples in the BCA 202T notes: memory fits, paging address translation, page-table size, TLB access time, segmentation, demand-paging access time, frame allocation, two Banker's problems and one deadlock detection problem. Unit 2 follows with 6 scheduling examples, all on the same four processes so the averages can be compared.

Do the BCA 202T notes show Linux commands with output?

Yes. Unit 1 gives sample output for whatis, apropos, ls -l and uname, a nine-step Linux session and two shell scripts with output. Unit 2 shows ps, top and pstree -p screens and a nice/renice run. Unit 4 reads ls -l permission strings and shows chmod before and after.

Is BCA 202T the same as the BCA 202P lab?

No. BCA 202T is the 4-credit theory paper with a 60-mark written end-term. BCA 202P Operating Systems Lab is a separate 1-credit practical paper with its own 40 internal and 60 external marks and 17 listed practicals. These notes cover theory; Unit 1 commands overlap with the lab, but lab practicals are not solved here.

Are the BCA 202T exam questions in the notes from past papers?

The 86 questions in the BCA 202T notes are exam-style questions written to the official pattern: short ones for the compulsory Q1 and long ones for the one-per-unit choice. They carry no year tags, so we do not claim any was asked in a particular exam. Two long scheduling numericals in Unit 2 come with an answer key.

Get the full BCA 202T Operating Systems Notes on WhatsApp

Order these notes in book form through WhatsApp. The full notes are not available in PDF.

Format: Operating Systems notes in English as a printed 78-page book with 46 diagrams and 120 revision-table facts.

Order the BCA 202T notes book on WhatsApp (4 units, 78 pages)

Unnati Educations is an independent education provider based in Vikaspuri, Delhi. We are not affiliated with, authorised by, or endorsed by Guru Gobind Singh Indraprastha University (GGSIPU). 'GGSIPU' and 'IPU' are used only to describe the syllabus our notes follow. For official information, visit ipu.ac.in.