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 (57)
111 Week 16/17 - Using Git and Gitlab
Git repository 1,
Local repository 2,
Git clone 3
22
cards
121 Sets and Relations Symbols
1,
2,
3
16
cards
121 Week 1 - Sets
Empty set 1,
Disjoin sets 2,
Equal sets 3
15
cards
121 Week 2 - Relations
Relation 1,
Binary relation 2,
N ary relations 3
17
cards
121 Week 3 - Functions
Function 1,
Domain 2,
Codomain 3
17
cards
121 Week 4 - Propositional Logic
Proposition 1,
Atomic proposition 2,
Compound proposition 3
43
cards
121 Week 5 - Predicate Logic
Why is predicate logic needed 1,
What are the 2 parts of predicate...,
Syntax 3
35
cards
121 Week 6 - Abstract Data Structures + Queue
Abstract data structure adt 1,
Queue example 1,
Operations of a queue 2
8
cards
121 Week 6 - Memory and Pointers
Byte accessible memory 1,
Words 2,
Big endian format 3
12
cards
121 Week 7 - 2D Arrays
2d array 1,
Indexing a 2d array 2,
Pros of 2d arrays 3
6
cards
121 Week 8 - Stack and Linked Lists
Stack 1,
Stack functions 2,
Underflow 3
8
cards
121 Week 9 - Time Complexity and Searching
Storage and retrieval speeds 1,
Theoretical time complexity 2,
Big o 3
6
cards
121 Week 9 - Recursion
Iteration and recursion 1,
Iteration 2,
Recursion 3
8
cards
121 Week 10 - Indexed Retrieval
What is indexed retrieval used for 1,
How does using keys for storage w...,
Why are keys used 3
10
cards
121 Week 11 - Hashing
What does a hashing function do 1,
Hash table 2,
Why are hash tables used 3
10
cards
121 Week 11 - Complexity
Algorithm 1,
Key types of algorithms 2,
How can algorithms be compared 3
10
cards
121 Week 12 - Operation Counting
Experimental approach to finding ...,
Limitations of experimental appro...,
Operation counting 3
13
cards
121 Week 13 - Sigma Notation
What is sigma notation used for 1,
How is sigma notation used 2,
Example 3
6
cards
121 Week 13 - Linear, Sentinel and Binary Search
How are the 3 time complexities c...,
How does a linear search work 2,
Linear search best and worst case...
13
cards
121 Week 14 - Big O Notation
Big o formal definition 1,
What is big o used for 2,
How to find big o of an algorithm...
8
cards
121 Week 15 - Big Ω and Θ Notations
Formal definition of big o 1,
Meaning of big o 2,
Formal definition of big 3
9
cards
121 Week 15 - Recursive Algorithms Complexity
Recursive algorithm 1,
Recurrence relation 2,
How are recurrence relations used...
10
cards
121 Week 16 - Sorting Algorithms
Need for sorting algorithms 1,
Application of sorting algorithms 2,
Selection sort 3
20
cards
121 Week 17 - Trees
Tree 1,
Applications for trees 2,
Tree structure 3
20
cards
Week 17 - Dictionaries, Binary Trees, Self Balancing Trees
Dictionary 1,
Key value pairs 2,
Dictionary operations 3
22
cards
121 Week 18 - Graphs
Graph 1,
Simple graph 2,
Directed and undirected graphs 3
23
cards
Week 18 - Pathfinding Algorithms
Path between nodes 1,
Shortest path between nodes 2,
Shortest path problems 3
12
cards
121 Week 19 - Greedy ALgorithms
Algorithmic paradigm 1,
Greedy algorithm 2,
Travelling salesman problem 3
13
cards
121 Week 19 - Dynamic Programming
Computational problem 1,
Formal definition for if an algor...,
Exhaustive search 3
17
cards
131 Week 1 - Computer Architecture
Computer 1,
Analytical engine 2,
Eniac electronic numerical integr...
15
cards
131 Week 2 - Information Coding
Why do we need information coding 1,
Ascii 2,
How can negative numbers be repre...
20
cards
131 Week 3 - Boolean Logic
Fundamental binary logical operat...,
Truth tables 2,
And 3
14
cards
131 Week 3 - Boolean Algebra Laws
Identity 1 1,
Identity 2 2,
Null 3
10
cards
131 Week 4 - Instruction Set Architecture
Instruction set architecture 1,
Reduced instruction set architect...,
Fetch decode execute cycle 3
10
cards
131 Week 4 - Arithmetic Logic Unit
Role of the arithmetic logic unit...,
What does the alu provide 2,
Half adder 3
15
cards
131 Week 5 - Memory
Volatile memory 1,
Non volatile memory 2,
Dynamic memory 3
21
cards
131 Week 5 - Control Unit
What does the control unit cu do 1,
How does the control unit control...,
Instruction register 3
14
cards
131 Week 6 - IO System
Function of the input output syst...,
Speed gap challenge 2,
Device diversity challenge 3
17
cards
131 Week 7 - Intro to Micro:bit Architecture
Core goals of the micro bit 1,
Requirements 2,
Runtime code software 3
21
cards
131 Week 8 - Micro:bit Display and Images
Microbit class 1,
Set up micro bit in c 2,
Display text on microbit 3
14
cards
131 Week 8 - Micro:bit buttons, Temps, Logs
How to access buttons in codal 1,
Detecting button presses 2,
Asynchronous programming 3
18
cards
131 Week 9 - Compilation
What are the 4 stages for creatin...,
Role of the pre processor 2,
Role of compiler 3
22
cards
131 Week 9 - Preprocessor
Role of the preprocessor 1,
C processor 2,
Initial processing 3
17
cards
131 Week 10 - Debugging
Compilation time bugs 1,
Run time bugs 2,
Divide and conquer debugging 3
11
cards
131 Week 11 - Micro:bit Radio Module
Radio hardware 1,
Micro bit signal strength 2,
Datagram 3
12
cards
131 Week 11/12 - Memory Layout
64 bit processors 1,
Virtual memory 2,
Virtual memory layout 3
13
cards
131 Week 12 - Build Automation
Build automation systems 1,
Build script generation tools 2,
Need for build automation systems 3
13
cards
131 Week 13 - Assembly Intro
Instruction set architecture isa 1,
Acorn risc machine arm 2,
Aim of arm 3
13
cards
131 Week 13 - Arithmetic Operations
Move instruction 1,
Adding instruction 2,
Subtracting instruction 3
18
cards
131 Week 14 - Memory
Cortex m3 memory map 1,
Cortex m3 memory layout 2,
Arm isa memory 3
13
cards
131 Week 14 - Branching
Pipelining 1,
Program counter pc 2,
Branch instructions 3
11
cards
131 Week 15 - ARM Functions
Function 1,
Uses of functions 2,
Function execution 3
11
cards
131 Week 16 - Inline Assembler
Inline assembly 1,
Reason for wanting inline assembly 2,
Inline assembly syntax 3
10
cards
131 Week 16 - ARM Assembly serialisation
Instruction 1,
Assembler 2,
Arm assembler 3
9
cards
131 Week 17 - Exceptions
Exception 1,
Exception types 2,
Cpu privilege levels 3
13
cards
131 Week 17 - Memory Mapped IO
Memory mapped io 1,
Io bus 2,
Io modules 3
12
cards
131 Week 18 - LED Assembly
0
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
- 8,635 learners
Decks:
Biochemical Basics, Cell Biology, Microbiology, And more!
Computer Science
- 33 decks
- 1991 flashcards
- 170 learners
Decks:
11 Processors, 11 Processors Extra, 12 Software, And more!
