Thinking logically (2.1.5) Flashcards
(1 cards)
1
Q
Flowchart symbols
A
- Types of storage(1.1.3 b)
- Input and output(1.1.3 a)
- RAM and ROM(1.1.3 c)
- TLAs (Three Letter Acronyms)
- Components of the processor(1.1.1 a)
- FDE Cycle(1.1.1 b)
- Assembly Language(1.2.4 c)
- Modes of addressing(1.2.4 d)
- Boolean algebra(1.4.3 a)
- Performance of the CPU (1.1.1 c)
- Pipelining(1.1.1 d)
- Von Neumann and Harvard Architectures(1.1.1 e)
- Cisc And Risc (1.1.2 a)
- GPUs (1.1.2 b)
- Multicore and Parallel Processing(1.1.2 c)
- Operating System(1.2.1 a)
- Memory Management(1.2.1 b)
- Scheduling(1.2.1 d)
- Interrupts(1.2.1 c)
- Primative Data Types(1.4.1 a)
- Signed binary(1.4.1 c)
- Binary Addition and Subtraction(1.4.1 d)
- Hex Binary and Denery (1.4.1 f)
- Character Sets(1.4.1 j)
- Bit-wise Operations(1.4.1 i)
- Truth tables and logic gates(1.4.3 d)
- Boolean simplification(1.4.3 c)
- Adders and flip flops(1.4.3 e)
- Types of OS(1.2.1 e)
- BIOS(1.2.1 f)
- Device drivers(1.2.1 g)
- Virtual machines(1.2.1 h)
- Nature of applications(1.2.2 a)
- Utility software(1.2. b)
- Programming paradigms(1.2.4 a)
- Procedural programming paradigm(1.2.4 b)
- Oop intro, Encapsulation, Inheritance and Polymorphism(1.2.4 e)
- Lists, tuples arrays and records(1.4.2 a)
- Graphs, trees, hash tables(1.4.2 b)
- HTML, CSS and JavaScript(1.3.4 a)
- Data relations(1.3.2 a)
- Normalisation(1.3.2 c)
- SQL(1.3.2 d)
- Integrity and ACID (1.3.2 e/f)
- Abstraction(2.1.1)
- Thinking ahead (2.1.2)
- Thinking procedurally (2.1.3)
- Thinking concurrently (2.1.4)
- Thinking logically (2.1.5)
- Features of a computable problem (2.2.2 a)
- Divide and conquer (2.2.2 d)
- Other computational methods (2.2.2 f)
- Lossy vs lossless compression (1.3.1 a)
- Lossless compression (1.3.1 b)
- Encryption (1.3.1 c)
- Hashing (1.3.1 d)
