1
Q
The 3 laws recursion abides by
A
Must have a base case
Must call itself recursively
Must change its state and go towards the base case
Computer Science
flashcards
Decks in class (37)
# Cards
-
Binary Search Tree (Depth First Search & Breath First Search)2
-
Computational Method (Abstraction, Decomposition, different processing types)4
-
Recursion1
-
Sorting Algorithms and Big O notation16
-
OOPS (Classes, Objects, Methods, Unified Modelling Language)8
-
Output and Input devices6
-
Paper 1 Computer Science Revision52
-
Subroutines6
-
Pipelining4
-
Queue3
-
Big O Searching Algorithm5
-
Quick Sort6
-
A* Star Algorithm1
-
Binary and Linear Search3
-
TCP/IP STACK4
-
Internet / Network Protocols6
-
Network Security7
-
RISC / CISC & SISD / SIMD / MIMD5
-
Operating System and Types of OS7
-
Scheduling Techniques6
-
Normalisation3
-
ACID Properties and Concurrent Accessing9
-
Code Generation4
-
Linkers, Loaders and Libraries8
-
Components / Processor Registers0
-
Fetch-Decode-Execute Cycle3
-
Factors which affect processor performance3
-
Von-Neumann V Harvard2
-
Testing Strategies6
-
Web Technologies4
-
CS Acts4
-
Moral/Ethical/Social Issues9
-
RAM /ROM / BIOS / VM4
-
Encryption and Hashing6
-
Databases10
-
Data Types6
-
Number Bases0
