This class was created by Brainscape user Sam Brereton. Visit their profile to learn more about the creator.
By:
Sam Brereton
- decks
- flashcards
- learners
Decks in this class (41)
121 Sets and Relations Symbols
∈,
∉,
{ … }
16
cards
121 Week 1 - Sets
Empty set,
Disjoin sets,
Equal sets
15
cards
121 Week 2 - Relations
Relation,
Binary relation,
N ary relations
17
cards
121 Week 3 - Functions
Function,
Domain,
Codomain
17
cards
121 Week 4 - Propositional Logic
Propositon,
Atomic proposition,
Compound proposition
43
cards
121 Week 5 - Predicate Logic
Why is predicate logic needed,
What are the 2 parts of predicate...,
Syntax
35
cards
121 Week 6 - Abstract Data Structures + Queue
Abstract data structure,
Queue,
Operations of a queue
8
cards
121 Week 6 - Memory and Pointers
Byte accessible memory,
Words,
Big endian format
12
cards
121 Week 7 - 2D Arrays
2d array,
Indexing a 2d array,
Pros of 2d arrays
6
cards
121 Week 8 - Stack and Linked Lists
Stack,
Stack functions,
Underflow
8
cards
121 Week 9 - Time Complexity and Searching
Storage and retrieval speeds,
Linear search,
Big o
6
cards
121 Week 9 - Recursion
Iteration and recursion,
Iteration,
Recursion
8
cards
121 Week 10 - Indexed Retrieval
What is indexed retrieval used for,
How does indexed retrieval work,
Why are keys used
10
cards
121 Week 11 - Hashing
What does a hashing function do,
Hash table,
Why are hash tables used
10
cards
121 Week 11 - Complexity
Algorithm,
Key types of algorithms,
How can algorithms be compared
10
cards
121 Week 12 - Operation Counting
Experimental approach to finding ...,
Limitations of experimental approach,
Operation counting
13
cards
121 Week 13 - Sigma Notation
What is sigma notation used for,
How is sigma notation used,
Example
6
cards
121 Week 13 - Linear, Sentinel and Binary Search
How are the 3 time complexities c...,
How does a linear search work,
Linear search time complexities
13
cards
121 Week 14 - Big O Notation
Big o formal definition,
What is big o used for,
How to find big o of an algorithm...
8
cards
131 Week 1 - Computer Architecture
Computer,
Analytical engine,
Eniac electronicnumerical integra...
15
cards
131 Week 2 - Information Coding
Why do we need information coding,
Ascii,
How can negative numbers be repre...
20
cards
131 Week 3 - Boolean Logic
Fundamental binary logical operators,
Truth tables,
And
14
cards
131 Week 3 - Boolean Algebra Laws
Identity 1,
Identity 2,
Null
10
cards
131 Week 4 - Instruction Set Architecture
Instruction set architecture,
Reduced instruction set architect...,
Fetch decode execute cycle
10
cards
131 Week 4 - Arithmetic Logic Unit
Role of the arithmetic logic unit...,
What does the alu provide,
Half adder
15
cards
131 Week 5 - Memory
Volatile memory,
Non volatile memory,
Dynamic memory
21
cards
131 Week 5 - Control Unit
What does the control unit do,
How does the control unit control...,
Instruction register
14
cards
131 Week 6 - IO System
Function of the input output system,
Speed gap challenge,
Device diversity challenge
17
cards
131 Week 7 - Intro to Micro:bit Architecture
Core goals of the micro bit,
Requirements,
Runtime code software
21
cards
131 Week 8 - micro:bit display and images
Microbit class,
Set up micro bit in c,
Scroll text on microbit
14
cards
131 Week 8 - micro:bit buttons, temps, logs
How to access buttons in codal,
Detecting button presses,
Asynchronous programming
18
cards
131 Week 9 - Compilation
What are the 4 stages for creatin...,
What are,
Role of compiler
22
cards
131 Week 9 - Preprocessor
Role of the preprocessor,
C processor,
Initial processing
17
cards
131 Week 10 - Debugging
Compilation time bugs,
Run time bugs,
Divide and conquer debugging
11
cards
131 Week 11 - MicroBit radio module
Radio hardware,
Micro bit signal strength,
Datagram
12
cards
131 Week 11/12 - Memory layout
64 bit processors,
Virtual memory,
Virtual memory layout
13
cards
131 Week 12 - Build Automation
Need for build automation,
Build script generation tools,
Need for build automation systems
13
cards
131 Week 13 - Assembly intro
Instruction set architecture isa,
Acorn risc machine arm,
Aim of arm
13
cards
131 Week 13 - Arithmetic Operations
Move instruction,
Adding instruction,
Subtracting instruction
18
cards
131 Week 14 - Memory
Cortex m3 memory,
Cortex m3 memory layout,
Arm isa memory
13
cards
131 Week 14 - Branching
Pipelining,
Program counter pc,
Branch instructions
11
cards
More about
Computer Science Year 1
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Sam Brereton's Computer Science Year 1 flashcards now!
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?
Biology 101
- 16 decks
- 1,045 flashcards
- 6,703 learners
Decks:
Biochemical Basics, Cell Biology, Microbiology, And more!
Computer Science
- 33 decks
- 1991 flashcards
- 147 learners
Decks:
11 Processors, 11 Processors Extra, 12 Software, And more!
