FIU CDA 3102: Computer Architecture

CDA 3102 covers the levels of organization in a computer: digital logic, machine and assembly language programming, and the design of memory, buses, the ALU, and the CPU, with virtual memory and I/O at the end. It's where FIU CS students find out what their Java has been running on all along.

Fennie is independent and not affiliated with Florida International University. This is an unofficial study guide.

Build my CDA 3102 study plan

What makes it hard

The course stacks abstraction layers fast — gates to circuits to datapath to assembly — and each layer assumes the previous one stuck. Assembly programming is the practical hurdle: no objects, no safety, just registers and memory, and students who can't simulate the machine in their head end up debugging by guesswork.

What you'll cover

• Digital logic and Boolean algebra
• Number representation and arithmetic
• Assembly language programming
• CPU datapath and control
• Memory hierarchy and virtual memory
• Buses and I/O

The CDA 3102 study guide

How to study for FIU CDA 3102, step by step.

1
Master number representation in week one
Binary, two's complement, and hex conversions are the arithmetic of this course. If they're not automatic early, every later topic costs double.
2
Hand-execute assembly on paper
Keep a register table and step through programs line by line, updating values as you go. Being able to simulate the machine by hand is the skill the exams actually test.
3
Rebuild the datapath from memory
Draw the CPU datapath cold — fetch, decode, execute, and what moves where. Exams ask what changes when an instruction flows through, and a memorized picture beats a half-remembered one.
4
Connect each layer to the one below
After each unit, write a few sentences tracing how it rests on the previous layer — logic to circuits, circuits to datapath, datapath to assembly. The course is a tower, and reviews should climb it.
5
Keep the layers fresh with Fennie
Upload your CDA 3102 materials and Fennie's Daily Plan schedules spaced review so early layers stay warm while new ones arrive, with conversion drills and datapath quizzes generated from your actual content. Free to start.
Start my CDA 3102 plan free

How Fennie helps with CDA 3102

Fennie's Daily Plans keep CDA 3102's tower of abstractions standing — spaced review so digital logic is still fresh when the datapath needs it weeks later. Use chat to step through assembly behavior register by register, and drill generated quizzes on conversions and instruction flow, the highest-frequency exam material.

FAQ

Is CDA 3102 hard at FIU?

It's a different kind of hard than the programming courses — less code volume, more layered theory plus unforgiving assembly. Students who keep up weekly and practice hand-executing programs do fine; the course is brutal to cram because each layer assumes the last one stuck.

What are the prerequisites for CDA 3102?

COP 3337 plus discrete math (COT 3100 or MAD 2104). The programming maturity matters less than the discrete math here — Boolean algebra and logical reasoning are used from the first week.

How do I get better at assembly programming?

Trace programs by hand with a register table before you ever run them, and write small programs that each isolate one instruction pattern. Assembly rewards students who simulate the machine on paper — debugging by trial and error teaches almost nothing at this level.

Pass CDA 3102 with a plan, not a cram

Upload your CDA 3102 materials and Fennie generates a Daily Plan paced to your deadline — plus chat, flashcards, and quizzes built from the actual course content.

Get started free

More FIU courses

COP 2210 — Programming I

COP 2210 is FIU's first programming course, taught in Java — objects and classes, control flow, methods, arrays, strings, and file I/O. It's a 4-credit course with a required closed instructional lab, and it's the front door of the FIU computing majors, feeding directly into COP 3337.

COP 3337 — Programming II

COP 3337 is FIU's second programming course, deepening Java: inheritance, polymorphism, interfaces, exception handling, recursion, and an introduction to data structures. It's the bridge between writing programs that work and writing programs designed well, and it's a prerequisite for COP 3530 and CDA 3102.

COP 3530 — Data Structures

COP 3530 covers data organization and algorithm analysis — running time, abstract data types, linked lists, trees, sets, graphs, and sorting. It's the gateway to FIU's upper-division CS curriculum, and fittingly, the canonical data structures textbooks by Mark Allen Weiss were written by an FIU professor.

COT 3100 — Discrete Structures

COT 3100 is the computer science department's discrete math course — logic, proof techniques, sets, functions, relations, counting, and graphs. FIU CS degree plans accept it interchangeably with MAD 2104, and one of the two is required before COP 3530 and CDA 3102.