This class was created by Brainscape user Nicole Millinship. Visit their profile to learn more about the creator.
- decks
- flashcards
- learners
Decks in this class (102)
4.5.1 Number systems
No deck description has yet been added by the author.
6
cards
4.1.1.2 Programming concepts
No deck description has yet been added by the author.
13
cards
4.1.1.6 Constants and variables in a programming language
No deck description has yet been added by the author.
3
cards
4.1.1.9 Exception handling
No deck description has yet been added by the author.
3
cards
4.1.1.10 Subroutines (procedures/functions) and 4.1.1.11 Parameters of subroutines
No deck description has yet been added by the author.
9
cards
4.1.1.13/14 Local variables in subroutines / Global variables in a programming language
No deck description has yet been added by the author.
5
cards
4.2.1.2 Single- and multi-dimensional arrays (or equivalent)
No deck description has yet been added by the author.
2
cards
4.2.1.3 Fields, records and files
No deck description has yet been added by the author.
4
cards
4.4.1.2 Following and writing algorithms
No deck description has yet been added by the author.
2
cards
4.4.2.1 Finite state machines (FSMs) without output
No deck description has yet been added by the author.
2
cards
4.5.2.1 Number base
No deck description has yet been added by the author.
2
cards
4.12.1.3 Function application and 4.12.1.4 Partial function application
No deck description has yet been added by the author.
2
cards
4.5.5.2 ASCII and Unicode
No deck description has yet been added by the author.
6
cards
4.5.5.3 Error checking and correction
No deck description has yet been added by the author.
9
cards
4.5.6.2 Analogue and digital and 4.5.6.3 Analogue/digital conversion
No deck description has yet been added by the author.
7
cards
4.5.6.4 Bitmapped graphics
No deck description has yet been added by the author.
8
cards
4.5.6.7 Digital representation of sound
No deck description has yet been added by the author.
7
cards
4.5.6.8 Musical Instrument Digital Interface (MIDI)
No deck description has yet been added by the author.
5
cards
4.5.6.9 Data compression
No deck description has yet been added by the author.
6
cards
4.5.6.8 Encryption
No deck description has yet been added by the author.
6
cards
4.6.1.1 Relationship between hardware and software and 4.6.1.2 Classification of software
No deck description has yet been added by the author.
13
cards
4.6.1.3 System software and 4.6.1.4 Role of an operating system (OS)
No deck description has yet been added by the author.
10
cards
4.6.2.1 Classification of programming languages
No deck description has yet been added by the author.
7
cards
4.7.1.1 Internal hardware components of a computer
No deck description has yet been added by the author.
13
cards
4.7.3.1 The processor and its components
No deck description has yet been added by the author.
8
cards
4.7.3.2 The Fetch-Execute cycle and the role of registers within it
No deck description has yet been added by the author.
4
cards
4.7.3.3 The processor instruction set
No deck description has yet been added by the author.
3
cards
4.7.3.7 Factors affecting processor performance
No deck description has yet been added by the author.
9
cards
4.7.4.1 Input and output devices
No deck description has yet been added by the author.
7
cards
4.7.4.2 Secondary storage devices
No deck description has yet been added by the author.
15
cards
4.8.1 Individual (moral), social (ethical), legal and cultural issues and opportunities
No deck description has yet been added by the author.
30
cards
4.9.1.1 Communication methods
No deck description has yet been added by the author.
10
cards
4.9.1.2 Communication basics
No deck description has yet been added by the author.
9
cards
4.9.2.1 Network topology
No deck description has yet been added by the author.
8
cards
4.4.2.2 Maths for regular expressions
No deck description has yet been added by the author.
11
cards
4.9.2.3 Wireless networking
No deck description has yet been added by the author.
18
cards
4.6.3.1 Types of program translator
No deck description has yet been added by the author.
8
cards
4.2.6.1 Hash tables
No deck description has yet been added by the author.
5
cards
4.9.3.1 The Internet and how it works
No deck description has yet been added by the author.
14
cards
4.9.3.2 Internet security
No deck description has yet been added by the author.
9
cards
4.9.4.1 TCP/IP
No deck description has yet been added by the author.
9
cards
4.1.1.3 Arithmetic operations in a programming language
No deck description has yet been added by the author.
1
cards
4.2.1.4 Abstract data types/data structures
No deck description has yet been added by the author.
12
cards
4.13.1 Aspects of software development
No deck description has yet been added by the author.
6
cards
4.1.1.15 Role of stack frames in subroutine calls
No deck description has yet been added by the author.
4
cards
4.1.2.1 Programming paradigms
No deck description has yet been added by the author.
5
cards
4.1.2.3 Object-oriented programming
No deck description has yet been added by the author.
15
cards
4.2.1.1 Data structures
No deck description has yet been added by the author.
1
cards
4.1.2.2 Procedural-oriented programming
No deck description has yet been added by the author.
2
cards
4.2.3.1 Stacks
No deck description has yet been added by the author.
6
cards
4.2.2.1 Queues
No deck description has yet been added by the author.
4
cards
4.2.4.1 Graphs
No deck description has yet been added by the author.
9
cards
4.2.5.1 Trees
No deck description has yet been added by the author.
6
cards
4.2.8.1 Vectors
No deck description has yet been added by the author.
2
cards
4.3.1.1 Simple graph-traversal algorithms
No deck description has yet been added by the author.
3
cards
4.3.2.1 Simple tree-traversal algorithms
No deck description has yet been added by the author.
3
cards
4.3.3.1 Reverse Polish – infix transformations
No deck description has yet been added by the author.
2
cards
4.3.4 Searching algorithms
No deck description has yet been added by the author.
2
cards
4.3.5 Sorting algorithms
No deck description has yet been added by the author.
3
cards
4.3.6.1 Dijkstra’s shortest path algorithm
No deck description has yet been added by the author.
1
cards
4.10.1 Conceptual data models and entity relationship modelling
No deck description has yet been added by the author.
1
cards
4.10.3 Database design and normalisation techniques
No deck description has yet been added by the author.
5
cards
4.10.2 Relational databases
No deck description has yet been added by the author.
7
cards
4.10.4 Structured Query Language (SQL)
No deck description has yet been added by the author.
7
cards
4.5.4.6 Absolute and relative errors
No deck description has yet been added by the author.
3
cards
4.5.4.1 Unsigned binary and 4.5.4.3 Signed binary using two’s complement
No deck description has yet been added by the author.
5
cards
4.5.4.7 Range and precision
No deck description has yet been added by the author.
6
cards
4.5.4.8 Normalisation of floating point form
No deck description has yet been added by the author.
2
cards
4.5.4.9 Underflow and overflow
No deck description has yet been added by the author.
6
cards
4.9.2.2 Types of networking between hosts
No deck description has yet been added by the author.
6
cards
4.9.4.2 Standard application layer protocols
No deck description has yet been added by the author.
6
cards
4.9.4.3 IP address structure
No deck description has yet been added by the author.
1
cards
4.9.4.4 Subnet masking
No deck description has yet been added by the author.
1
cards
4.9.4.5 IP standards
No deck description has yet been added by the author.
1
cards
4.9.4.6 Public and private IP addresses
No deck description has yet been added by the author.
2
cards
4.9.4.7 Dynamic Host Configuration Protocol (DHCP)
No deck description has yet been added by the author.
3
cards
4.9.4.8 Network Address Translation (NAT)
No deck description has yet been added by the author.
2
cards
4.9.4.9 Port forwarding
No deck description has yet been added by the author.
1
cards
4.9.4.10 Client server model
No deck description has yet been added by the author.
5
cards
4.9.4.11 Thin- versus thick-client computing
No deck description has yet been added by the author.
4
cards
4.7.2.1 The meaning of the stored program concept
No deck description has yet been added by the author.
1
cards
4.4.1.3 Abstraction and 4.4.1.4 Information hiding
No deck description has yet been added by the author.
5
cards
4.7.3.4 Addressing modes
No deck description has yet been added by the author.
2
cards
4.7.3.6 Interrupts
No deck description has yet been added by the author.
3
cards
4.10.5 Client server databases
No deck description has yet been added by the author.
6
cards
4.6.4.1 Logic gates
No deck description has yet been added by the author.
5
cards
4.4.1.5 Procedural abstraction and 4.4.1.6 Functional abstraction and 4.4.1.7 Data abstraction and 4.4.1.8 Problem abstraction/reduction
No deck description has yet been added by the author.
4
cards
4.4.1.9 Decomposition and 4.4.1.10 Composition
No deck description has yet been added by the author.
2
cards
4.4.1.11 Automation
No deck description has yet been added by the author.
1
cards
4.4.2.3 Regular expressions and 4.4.2.4 Regular language
No deck description has yet been added by the author.
11
cards
4.4.3.1 Backus-Naur Form (BNF)/syntax diagrams
No deck description has yet been added by the author.
4
cards
Skeleton Program
No deck description has yet been added by the author.
21
cards
4.4.5.1 Turing machine
No deck description has yet been added by the author.
5
cards
4.4.4.1 Comparing algorithms
No deck description has yet been added by the author.
3
cards
4.4.4.2 Maths for understanding Big-0 notation and 4.4.4.3 Order of complexity
No deck description has yet been added by the author.
8
cards
4.4.4.5 Classification of algorithmic problems
No deck description has yet been added by the author.
2
cards
4.4.4.6 Computable and non-computable problems and 4.4.4.7 Halting problem
No deck description has yet been added by the author.
3
cards
4.11.1 Big Data
No deck description has yet been added by the author.
7
cards
4.12.1.1 Function type and 4.12.1.2 First-class object
No deck description has yet been added by the author.
4
cards
4.12.1.5 Composition of functions
No deck description has yet been added by the author.
1
cards
4.12.2.1 Functional language programs
No deck description has yet been added by the author.
4
cards
4.12.3.1 List processing
No deck description has yet been added by the author.
2
cards
More about
computing theory
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Nicole Millinship's Computing Theory 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?
2014 K12 Theory
- 16 decks
- 503 flashcards
- 22 learners
Decks:
Education 1 16, Interpreting 1 16, Student Development 2 7, And more!
CS 115 Computer Science
- 30 decks
- 997 flashcards
- 753 learners
Decks:
Chapter 1 Checkpoint, Chapter 1 Notes Pt 1, Chapter 1 Notes Pt 2, And more!
