Flashcards and recall.

Try this with Computer Science

1. Write one prompt per card. Use definitions, explanations or examples from your current topic.
2. Answer aloud before turning the card. Split a card if it asks for several unrelated facts.
3. Set aside missed cards and revisit them in a later session.

View Computer Science resources on ATARMAXXING ↗

Recall topics

• Sequence (control structure)
• Selection (control structure)
• Pre-test loop vs post-test loop
• Fixed (count-controlled) loop
• When should a CASE statement not be used?
• Integer division (DIV, //) and modulus (MOD, %)
• Python value of 2 + 3 * 4 ** 2
• Order of precedence of logical operators
• Value of True or False and False in Python
• De Morgan's law for NOT (A OR B)
• Boolean expression that is TRUE only for ages 13 to 17 inclusive
• How a truth table proves two Boolean expressions are equivalent
• Parameter vs argument
• Local variable
• Global variable
• Pass by value
• Pass by reference
• Why should a function return a value instead of changing a reference parameter?
• One-dimensional array
• In grid = [[1, 2, 3], [4, 5, 6], [7, 8, 9]], what is grid[1][2]?
• Nested loops to visit every element of a 2D array
• Dictionary
• Result of d = {"a": 1}; d["b"] = 2; d["a"] = 5
• Purpose of Big O notation
• Linear search and its Big O
• Binary search and its Big O
• Worst-case comparisons for binary search on 1 000 000 sorted items
• Bubble sort
• Selection sort
• Insertion sort
• [5, 2, 4, 1] after two passes of insertion sort
• Class vs object
• Attribute vs method
• Instantiation
• Inheritance
• Encapsulation (OOP)
• Abstraction (OOP)
• Polymorphism
• What does super().__init__(...) do in a subclass constructor?
• Four stages of the framework for development