CSA Final Exam Study App
Complete guide for WRES1201 — refreshable practice with randomized numbers every reload · interactive tools
Share with classmates at rafiarsya.com
Share with classmates at rafiarsya.com
Challenges Solved
0
of 0
Accuracy
—
first try
MCQ Correct
0
of 0
Streak
0
in a row
Topic progress (challenges)
What's inside
Topic Guide
Every T1–T10 topic — concepts and exam focus, with final-scope tags.
Refreshable Challenges
Calculation problems with new random numbers every reload. Full step-by-step solutions.
Refreshable MCQs
Concept + applied questions, options shuffled and re-rolled each refresh.
Interactive Tools
Shift visualizer, Hamming calculator, Cache mapper, Smart calculator.
Topic Guide
What each topic is, why it matters, key concepts, and exam focus. Not-in-final topics are tagged.
Formula Reference
Every formula — name, when to use it, variables explained, worked example.
Calculation Challenges
Type your numerical answer. 2% rounding tolerance accepted. Full solution after every attempt. Hit New random set for fresh numbers.
0
Correct
0
Wrong
0
Skipped
0
Left
MCQ Concept Drill
Theory + applied questions covering all topics. Options shuffle and re-roll each refresh.
0
Correct
0
Wrong
0
Left
Shift Visualizer
Tutorial 8 exam uses
10101110 shifted by 4 bits. Try all 6 shift types here.8-bit binary
Amount
Type
Original
All 6 shifts at once
Rules
| Type | Empty bits filled with | Bits that fall off |
|---|---|---|
| Logical Right | 0 always | Discarded |
| Logical Left | 0 always | Discarded |
| Arithmetic Right | MSB (sign bit) copy | Discarded |
| Arithmetic Left | 0 (same as logical left) | Discarded |
| Right Rotate | Bits from right end | Wrap to left |
| Left Rotate | Bits from left end | Wrap to right |
Hamming Code Calculator
Tutorial 5: find check bits for data word
11000010. Enter any 8-bit word below.How it works
Hamming code adds parity bits at power-of-2 positions (1,2,4,8…) to detect and correct single-bit memory errors. Each parity bit checks a specific group of positions. For 8 data bits we need 4 check bits → 12-bit codeword.
Parity positions: P1=pos1, P2=pos2, P4=pos4, P8=pos8 | Data: D1=3, D2=5, D3=6, D4=7, D5=9, D6=10, D7=11, D8=12
Calculator
8-bit data word
Cache Address Mapper
Tutorial 4: split addresses into Tag | Line | Byte. Find which cache line each maps to.
How direct-mapped addressing works
Every address splits into 3 fields (LSB → MSB):
Byte offset — which byte within the block. Bits = log₂(block size)
Line number — which cache line it maps to. Bits = log₂(lines)
Tag — identifies which memory block is loaded. Remaining bits.
Two addresses with the same Line field compete for the same cache slot.
Byte offset — which byte within the block. Bits = log₂(block size)
Line number — which cache line it maps to. Bits = log₂(lines)
Tag — identifies which memory block is loaded. Remaining bits.
Two addresses with the same Line field compete for the same cache slot.
Configure
Address bits
Cache lines
Block size
Enter address (binary or 0x hex) to trace
Tutorial 4 addresses (set 16-bit / 32 lines / 8 bytes)
Smart Calculator
Fill in what the question gives you — get all outputs instantly.