8 live

study hubstudyhub

Practice for every course, built from its own slides and marked like the real checkpoint. Open one and start.

Subjects

Pick your course. No account needed · press 1–8 to open one.

1st yearCIS 1101Modules 0–9
Programming 1
C, module by module from Ma'am Mayol's slides: algorithms and flowcharts, then functions, control structures, pointers and arrays. Every C question is a real program marked by what it actually does.
Jump to:Study Intro Pseudocode +18 more
1st yearCIS 12018 units
Programming 2
Arrays and pointers, strings, searching and the three elementary sorts, then structs, file handling and linked lists. Every question is a real C program, marked by what it actually does.
Jump to:Arrays & pointers Arrays in functions Strings +5 more
1st yearCIS 1103Modules 1–4
Discrete Structures I
Sets, relations, functions, formal logic, and Boolean algebra with logic gates. Notes for every unit from the lecture decks, and drills that draw new sets, relations and truth tables each time and work the answer out.
Jump to:Notes Sets Relations +5 more
2nd yearCIS 210112 units
Data Structures and Algorithms
Lists, stacks and queues in array, linked and cursor-based form, then sets, hashing, trees, heaps and graphs. Every question is a real C program, and the tracer draws the structure as it changes.
Jump to:ADT List Stack +9 more
3rd yearCS 3106NModules 1–6, 8–14, 18
Information Assurance & Security
Notes for every module with diagrams and working models, the checkpoint deck flipped or asked as multiple choice, and six cryptography drills that mark you on keys, hashes and certificates.
Jump to:Notes Deck Cram +6 more
3rd yearCS 3101NModules 1–4
Discrete Structures III
Linear algebra: systems of equations, matrix operations, the inverse, determinants and vector spaces. Notes for every unit from the lecture slides, drills that draw new matrices each time and work the answer out in exact fractions, and a bench to row-reduce by hand.
Jump to:Notes Systems Matrices +4 more
3rd yearLectures 1–3, 5–9
Graph Theory
Thirteen auto-graded drills built from the lecture decks, plus an exam simulator that marks the way the sheet does.
Jump to:Traps Inspect Edge sets +11 more
3rd yearCS 3202NFinite automata
Automata Theory
Seven drills, one per lesson: read a diagram into a 5-tuple, design a machine for a language, run NFA and ε-NFA through to a DFA, minimise a DFA, and read, run and convert Moore and Mealy machines.
Jump to:5-tuple Design NFA → DFA +4 more

Tools

For Programming 1 and DSA, any C you’re stuck on, and the networking labs.

Answers you got right

right in the last year: 0
days worked: 0
days running: 0

Mon

Wed

Fri

Less

Take a break

Done studying? Play something real quick.

Rest your brain between sessions: word search, memory, chess puzzles and sliding tiles.

Open bored

Found a wrong answer or a bug?

Tell us, or suggest what to add next. It’s anonymous, and only the people who build study hub read it.

Send feedback

study hubstudyhub

Subjects

Programming 1

Programming 2

Discrete Structures I

Data Structures and Algorithms

Information Assurance & Security

Discrete Structures III

Graph Theory

Automata Theory

Tools

Write C and watch it run, line by line.

Every data structure the course builds, operation by operation.

Configure routers and switches, Packet Tracer style.

Build your own topology from an empty bench.

Answers you got right

Done studying? Play something real quick.

Found a wrong answer or a bug?