Siksha Sarovar

Siksha Sarovar (sikshasarovar.com) is a free educational web application that helps students in India learn programming and prepare for academic and competitive exams. The platform offers structured coding courses (C, C++, Python, Java, HTML, CSS, PHP, Power BI, AI, Machine Learning, Data Science), complete university curriculum notes for BCA/MCA students with previous year question papers, Class 10 and Class 12 CBSE/HBSE school notes, and dedicated preparation material for SSC, UPSC, Banking, Railway and other government exams. Browsing the site is completely free and requires no account. Users may optionally sign in with Google solely to save their learning progress, quiz scores and personal preferences across devices.

Privacy Policy | Terms of Service | Contact Siksha Sarovar | About Siksha Sarovar

v4.0.9 · PWA
Siksha Sarovar logo
Siksha Sarovar
Your Learning Universe

Siksha Sarovar is a free e-learning platform for coding courses, BCA university notes and competitive exam preparation. Optional Google sign-in saves your learning progress across devices.

Initializing knowledge base…
Compiling modules 0%

About This Course

Lesson 1 of 17 in the free Logical Organization of Computer-II notes on Siksha Sarovar, written by Rohit Jangra.

Logical Organization of Computer-II — BCA II Semester

Logical Organization of Computer-II (LOC-II) is the advanced half of the computer organization sequence. Where LOC-I dealt with digital logic (gates, flip-flops, combinational and sequential circuits), LOC-II climbs one level up and asks: how are those circuits assembled into a working processor, memory system, and I/O subsystem? By the end you should be able to trace an instruction from fetch to write-back, hand-compute a Booth multiplication, break a memory address into tag/index/offset fields, and argue RISC vs CISC like an architect.

📚 Unit-Wise Syllabus

UnitThemeKey Topics
Unit 1CPU OrganizationRegister organization, general-register vs stack CPUs, 3/2/1/0-address instruction formats, all addressing modes with EA calculations, instruction cycle, timing & control signals
Unit 2Computer ArithmeticInteger representation (sign-magnitude, 1's, 2's complement), half/full/ripple/carry-lookahead adders, Booth's multiplication, restoring & non-restoring division, IEEE 754 floating point
Unit 3Control & PerformanceHardwired vs microprogrammed control, control memory, horizontal/vertical microinstructions, microprogram sequencing, pipelining & hazards, RISC vs CISC (ARM vs x86)
Unit 4Memory SystemMemory hierarchy & locality, cache mapping (direct/associative/set-associative), replacement & write policies, AMAT, virtual memory, paging, TLB, page replacement, segmentation
Unit 5I/O & ParallelismProgrammed / interrupt-driven I/O, interrupt priority & daisy chaining, DMA transfer modes, bus arbitration, synchronous vs asynchronous buses, PCI/USB, Flynn's taxonomy, cache coherence

🗺️ How the Lessons Are Organized

Each unit is split into three focused lessons (15 in total). Every lesson follows the same discipline:

  1. Concept first — what the mechanism is and why the design exists (the "why" is where advanced marks hide).
  2. Worked numeric examples — binary arithmetic digit by digit, address breakdowns, step tables for Booth's algorithm and page replacement. These mirror the style of actual end-term numericals.
  3. 🎯 Exam Focus — 4–6 PYQ-style questions (define / differentiate / solve) closing every lesson, so you always know what to practice.

🎓 Exam Pattern & Strategy

ComponentDetail
Q1 (compulsory)Short-answer sweep across all five units — definitions, small conversions, one-line comparisons.
Unit questionsOne long question per unit with internal choice — usually one theory part + one numerical part.
High-yield numericalsBooth's algorithm, cache address mapping, page-replacement fault counting, pipeline speedup, IEEE 754 conversion, effective address calculation.

Strategy: master the worked examples in Units 2 and 4 first — numerical questions are the most predictable marks in this paper. Then layer on the comparison tables (hardwired vs microprogrammed, RISC vs CISC, paging vs segmentation), which are perennial 5-mark questions.

PYQ papers are available below in the lesson list.