1
Q
Space complexity
A
how much memory does it use while running
2
Q
Time complexity
A
how quickly will it complete
3
Q
Big O notation
A
takes the largest power (most significant) term and just calls that the order of the algorithm
Computer Science
flashcards
Decks in class (81)
# Cards
-
TLAs (Three Letter Acronyms)22
-
Pseudo code3
-
Components of the processor(1.1.1 a)18
-
FDE Cycle(1.1.1 b)9
-
Performance of the CPU (1.1.1 c)13
-
Pipelining(1.1.1 d)2
-
Von Neumann and Harvard Architectures(1.1.1 e)8
-
Cisc And Risc (1.1.2 a)9
-
GPUs (1.1.2 b)7
-
Multicore and Parallel Processing(1.1.2 c)9
-
Input and output(1.1.3 a)6
-
Types of storage(1.1.3 b)10
-
RAM and ROM(1.1.3 c)8
-
Virtual storage (1.1.3 d)0
-
Operating System(1.2.1 a)11
-
Memory Management(1.2.1 b)11
-
Interrupts(1.2.1 c)8
-
Scheduling(1.2.1 d)12
-
Types of OS(1.2.1 e)11
-
BIOS(1.2.1 f)9
-
Device drivers(1.2.1 g)5
-
Virtual machines(1.2.1 h)9
-
Nature of applications(1.2.2 a)4
-
Utility software(1.2.2 b)8
-
Open source vs closed source (1.2.2 c)6
-
Translators (1.2.2 d)12
-
Stages of compilation (1.2.2 e)4
-
Linkers loaders and libraries (1.2.2 f)7
-
Software lifecycles (1.2.3 a)7
-
Merits and drawbacks of methodologies (1.2.3 b)8
-
Programming paradigms(1.2.4 a)14
-
Procedural programming paradigm(1.2.4 b)10
-
Assembly Language(1.2.4 c)26
-
Modes of addressing(1.2.4 d)5
-
Oop intro, Encapsulation, Inheritance and Polymorphism(1.2.4 e)24
-
Lossy vs lossless compression (1.3.1 a)3
-
Lossless compression (1.3.1 b)7
-
Encryption (1.3.1 c)5
-
Hashing (1.3.1 d)2
-
Data relations(1.3.2 a)24
-
Methods of capturing selecting managing and exchanging data (1.3.2 b)0
-
Normalisation(1.3.2 c)7
-
SQL(1.3.2 d)10
-
Integrity and ACID (1.3.2 e/f)9
-
Network characteristics protocols and standards (1.3.3 a)11
-
Internet structure (1.3.3 b)16
-
Network security and threats (1.3.3 c)17
-
Network hardware (1.3.3 d)11
-
Client server and peer to peer (1.3.3 e)6
-
HTML, CSS and JavaScript(1.3.4 a)20
-
Search engine indexing (1.3.4 b)4
-
Primative Data Types(1.4.1 a)5
-
Signed binary(1.4.1 c)10
-
Binary Addition and Subtraction(1.4.1 d)2
-
Hex Binary and Denery (1.4.1 f)4
-
Fractions and decimal binary (1.4.1 g)6
-
Bit-wise Operations(1.4.1 i)8
-
Character Sets(1.4.1 j)4
-
Lists, tuples arrays and records(1.4.2 a)16
-
Graphs, trees, hash tables(1.4.2 b)48
-
Boolean algebra(1.4.3 a)6
-
Boolean simplification(1.4.3 c)17
-
Truth tables and logic gates(1.4.3 d)2
-
Adders and flip flops(1.4.3 e)15
-
Data protection act (1.5.1 a)5
-
Computer misuse act (1.5.1 b)1
-
Copyright design and patent act (1.5.1 c)6
-
Regulation of investigatory powers act (1.5.1 d)6
-
Abstraction(2.1.1)2
-
Thinking ahead (2.1.2)12
-
Thinking procedurally (2.1.3)3
-
Thinking concurrently (2.1.4)2
-
Thinking logically (2.1.5)1
-
Features of a computable problem (2.2.2 a)6
-
Divide and conquer (2.2.2 d)2
-
Other computational methods (2.2.2 f)15
-
Algorithm efficiency (2.3.1 c)3
-
Data structure algorithms (2.3.1 e)8
-
Standard algorithms (2.3.1 f)20
-
Server and client side processing (1.3.4 d)2
-
PageRank algorithm (1.3.4 c)3
