Study by subject

Computer science

In computer science you need concepts, complexities, syntax and classic algorithms in your head. Lumi has you recall them so you can write code without looking up the basics every line.

How to turn this subject into cards

In computer science, put on cards what has to be remembered, the definitions (stack, queue, tree, graph), the complexities of classic algorithms, the syntax rules of your course language and the invariant of each algorithm. The usual trap is reading code, understanding it, and then freezing in front of an empty file. To fix that, get yourself to describe an algorithm in steps from memory before you write it. Lumi quizzes you on those steps and on complexities. Most students reread, and few test themselves, which the authors of a survey called an illusion of competence (Karpicke et al., 2009). It helps you remember definitions, syntax, complexities and algorithm steps.

Example card

Try it, Lumi turns it into fill in the blank questions in your browser.

study-card.txt

Computer science · teach this card to Lumi

A bit is 0 or 1, and eight bits make a byte. Binary search on a sorted array halves the search range at each step. Merge sort runs in n log n time. A stack follows the rule last in, first out. In Python a list is mutable but a tuple is immutable.

Lumi’s question

A bit is 0 or 1, and eight bits make a _____.

Pick the missing word

1 / 5

All subjects

Preview