- decks
- flashcards
- learners
Decks in this class (81)
TLAs (Three Letter Acronyms)
Ram 1,
Rom 2,
Ssd 3
22
cards
Pseudo code
What is pseudo code 1,
Program to output largest of two ...,
Program to output largest of thre...
3
cards
Components of the processor(1.1.1 a)
What is the processor 1,
What are registers 2,
A downside to registers 3
18
cards
FDE Cycle(1.1.1 b)
What is the fde cycle 1,
What is the fetch stage 2,
What is the decode stage 3
9
cards
Performance of the CPU (1.1.1 c)
Clock speed 1,
What is clock speed measured in 2,
What is typical clock speed 3
13
cards
Pipelining(1.1.1 d)
What is pipelining 1,
What is flushing 2
2
cards
Von Neumann and Harvard Architectures(1.1.1 e)
What is a processor architecture 1,
Key components of von neumann 2,
Von neumann advantages 3
8
cards
Cisc And Risc (1.1.2 a)
What is an instruction set 1,
What does cisc stand for 2,
Cisc processors 3
9
cards
GPUs (1.1.2 b)
What does gpu stand for 1,
What is a gpu 2,
What is a co processor 3
7
cards
Multicore and Parallel Processing(1.1.2 c)
What is concurrent 1,
What is parallel 2,
Parallel processing 3
9
cards
Input and output(1.1.3 a)
What is an input device 1,
What is an output device 2,
What is a multi use device 3
6
cards
Types of storage(1.1.3 b)
What is storage 1,
Describe magnetic storage 2,
Describe optical storage 3
10
cards
RAM and ROM(1.1.3 c)
What is memory 1,
What does rom stand for 2,
What does ram stand for 3
8
cards
Virtual storage (1.1.3 d)
0
cards
Operating System(1.2.1 a)
What is an operating system 1,
Os examples 2,
Key features of a os 3
11
cards
Memory Management(1.2.1 b)
What is paging 1,
Advantage of paging 2,
Disadvantage of paging 3
11
cards
Interrupts(1.2.1 c)
What is an interrupt 1,
Interrupt register 2,
Where are interrupts handled in t...
8
cards
Scheduling(1.2.1 d)
What is the purpose of scheduling 1,
Reamble process queue 2,
The scheduling algorithms 3
12
cards
Types of OS(1.2.1 e)
Multi tasking os 1,
Some issues with multi tasking os 2,
Multi user os 3
11
cards
BIOS(1.2.1 f)
What does bios stand for 1,
What is bios main two tasks 2,
What does post stand for 3
9
cards
Device drivers(1.2.1 g)
What is a device driver 1,
Why might an os use a generic dri...,
How are device drivers installed 3
5
cards
Virtual machines(1.2.1 h)
What is a virtual machinie 1,
What can virtual machines imitate 2,
Alternate os uses of vm 3
9
cards
Nature of applications(1.2.2 a)
What is an application 1,
What is the line like between os ...,
What is application software about 3
4
cards
Utility software(1.2.2 b)
What is utility software 1,
What types of software counts as ...,
File repair 3
8
cards
Open source vs closed source (1.2.2 c)
Open source 1,
Open source advantages 2,
Open source disadvantages 3
6
cards
Translators (1.2.2 d)
Translators 1,
Low level translation 2,
High level language translation 3
12
cards
Stages of compilation (1.2.2 e)
Stages of compilation 1,
Lexical analysis 2,
Syntax analysis 3
4
cards
Linkers loaders and libraries (1.2.2 f)
Libraries 1,
Advantages of libraries 2,
Disadvantages of libraries 3
7
cards
Software lifecycles (1.2.3 a)
Sdlc 1,
Phases of the sdlc 2,
Waterfall lifecycle 3
7
cards
Merits and drawbacks of methodologies (1.2.3 b)
Advantages of waterfll 1,
Disadvantages of waterfall 2,
Advantages of rad 3
8
cards
Programming paradigms(1.2.4 a)
What is a paradigm 1,
What is machine code 2,
Examples of high level programmin...
14
cards
Procedural programming paradigm(1.2.4 b)
What is the procedural programmin...,
What is structured programming 2,
What does the term spaghetti code...
10
cards
Assembly Language(1.2.4 c)
What is assembly language 1,
What is little man computer lmc 2,
Add 3
26
cards
Modes of addressing(1.2.4 d)
Four types of addressing 1,
Immediate addressing 2,
Direct addressing 3
5
cards
Oop intro, Encapsulation, Inheritance and Polymorphism(1.2.4 e)
What is a paradigm 1,
Programming languages in paradigms 2,
What are classes 3
24
cards
Lossy vs lossless compression (1.3.1 a)
Compression 1,
Lossless compression 2,
Lossy compression 3
3
cards
Lossless compression (1.3.1 b)
What is dictionary encoding 1,
What is run length encoding 2,
Run length encoding 3
7
cards
Encryption (1.3.1 c)
Encryption 1,
Historical encryption methods 2,
Symmetric encryption 3
5
cards
Hashing (1.3.1 d)
Hashing 1,
What is salting 2
2
cards
Data relations(1.3.2 a)
What are relational databases 1,
What are table identifiers 2,
What is a record 3
24
cards
Methods of capturing selecting managing and exchanging data (1.3.2 b)
0
cards
Normalisation(1.3.2 c)
Standards 1,
Normal forms 2,
0nf conditions 3
7
cards
SQL(1.3.2 d)
Sql 1,
Dbms stands for 2,
Sql select 3
10
cards
Integrity and ACID (1.3.2 e/f)
Referential integrity requires 1,
Referential integrity foreign key...,
What is data integrity 3
9
cards
Network characteristics protocols and standards (1.3.3 a)
What is a network 1,
Network 2,
Network advantages 3
11
cards
Internet structure (1.3.3 b)
The internet 1,
What is router 2,
Concept of layers 3
16
cards
Network security and threats (1.3.3 c)
Need for network security 1,
Hacker 2,
Malware 3
17
cards
Network hardware (1.3.3 d)
Hardware 1,
Modem 2,
Router 3
11
cards
Client server and peer to peer (1.3.3 e)
Client server architecture 1,
Advantages of client server 2,
Disadvantages of client server 3
6
cards
HTML, CSS and JavaScript(1.3.4 a)
Html file 1,
What defines that the file is a h...,
What defines where a html documen...
20
cards
Search engine indexing (1.3.4 b)
What is indexing 1,
What is the index 2,
Search engine indexing 3
4
cards
Primative Data Types(1.4.1 a)
What are primitive data types 1,
Four main data types 2,
What is a variable 3
5
cards
Signed binary(1.4.1 c)
Sign and magnitude 1,
What does the leading bit in sign...,
Sign and magnitude largest value 3
10
cards
Binary Addition and Subtraction(1.4.1 d)
Binary addition 1,
Binary subtraction 2
2
cards
Hex Binary and Denery (1.4.1 f)
What is hex 1,
Hex to denary examples 2,
Denary to hex examples 3
4
cards
Fractions and decimal binary (1.4.1 g)
What is floating point binary 1,
What is fixed point binary 2,
Fixed point binary example 3
6
cards
Bit-wise Operations(1.4.1 i)
What is a bit wise operation 1,
Bit wise operation not 2,
What is a mask 3
8
cards
Character Sets(1.4.1 j)
What is encoding 1,
Ascii 2,
Unicode 3
4
cards
Lists, tuples arrays and records(1.4.2 a)
What are compound data types 1,
What are arrays 2,
Arrays 3
16
cards
Graphs, trees, hash tables(1.4.2 b)
What are the three parts of trees 1,
How many ways in a tree to get fr...,
Tree diagram 3
48
cards
Boolean algebra(1.4.3 a)
Four logic gates 1,
What is boolean algebra 2,
And gates 3
6
cards
Boolean simplification(1.4.3 c)
Double negation 1,
Commutation 2,
Association 3
17
cards
Truth tables and logic gates(1.4.3 d)
What are truth tables 1,
Truth table examples 2
2
cards
Adders and flip flops(1.4.3 e)
Adding 1,
The half adder 2,
Full adder 3
15
cards
Data protection act (1.5.1 a)
Dpa and dpa roles 1,
Personal data includes 2,
Sensitive data includes 3
5
cards
Computer misuse act (1.5.1 b)
Offenses covered by the computer ...
1
cards
Copyright design and patent act (1.5.1 c)
What is intellectual property 1,
The copyright act prevents people...,
Intellectual properties are prote...
6
cards
Regulation of investigatory powers act (1.5.1 d)
Ripa 1,
Public bodies able granted rights...,
Things people can do under ripa 3
6
cards
Abstraction(2.1.1)
What is abstraction 1,
Nature of abstraction 2
2
cards
Thinking ahead (2.1.2)
What is thinking ahead 1,
Considering outputs thinking ahead 2,
Considering inputs thinking ahead 3
12
cards
Thinking procedurally (2.1.3)
Identifying components of problems 1,
What is decomposition 2,
Identifying subprocedures 3
3
cards
Thinking concurrently (2.1.4)
Concurrent programs 1,
However concurrent programs 2
2
cards
Thinking logically (2.1.5)
Flowchart symbols 1
1
cards
Features of a computable problem (2.2.2 a)
What is a tractable problem 1,
Features of a computable problem 2,
Abstraction and decomposition fea...
6
cards
Divide and conquer (2.2.2 d)
Divide and conquer 1,
Divide and conquer example 2
2
cards
Other computational methods (2.2.2 f)
What is heuristics 1,
Tractable heurisitics 2,
Intractable heuristics 3
15
cards
Algorithm efficiency (2.3.1 c)
Space complexity 1,
Time complexity 2,
Big o notation 3
3
cards
Data structure algorithms (2.3.1 e)
Stack and queue traveral 1,
Removing data data structure 2,
Stack pop algorithm 3
8
cards
Standard algorithms (2.3.1 f)
Linear search 1,
Application of linear search 2,
Linear search pseudo code 3
20
cards
Server and client side processing (1.3.4 d)
Client side processing 1,
Server side processing 2
2
cards
PageRank algorithm (1.3.4 c)
Pagerank algorithm 1,
Pagerank algorithm breakdown 2,
Applying pagerank algorithm 3
3
cards
More about
Computer Science
- School Unspecified
- Program type Unspecified
- Course Unspecified
- Instructor Unspecified
- Standards Unspecified
The creator of this class did not yet add a description for what is included in this class.
How studying works.
Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.
Add your own flashcards.
Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!
What's Brainscape anyway?
Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.
We use an adaptive study algorithm that is proven to help you learn faster and remember longer....
Looking for something else?
Computer Science
- 26 decks
- 668 flashcards
- 231 learners
Decks:
111 Structure And Function Of The Proces, 112 Types Of Processor, 113 Input Output And Storage, And more!
Computers
- 76 decks
- 1935 flashcards
- 105 learners
Decks:
Glossary, Final Cut Pro X Shortcuts 2, Final Cut Pro X, And more!
