This class was created by Brainscape user Annabel Molloy. Visit their profile to learn more about the creator.
By:
Annabel Molloy
- decks
- flashcards
- learners
Decks in this class (45)
Programming Concepts
No deck description has yet been added by the author.
21
cards
3.1.1.8 Random Number Generation In Programming Languages.
No deck description has yet been added by the author.
2
cards
3.1 Fundamentals Of Programming
No deck description has yet been added by the author.
43
cards
3.1.1.2 Programming Concepts.
No deck description has yet been added by the author.
15
cards
3.1.1.3 Arithmetic operations in a programming language.
No deck description has yet been added by the author.
9
cards
3.1.1.4 Relational operations in a programming language
No deck description has yet been added by the author.
12
cards
3.1.5 Boolean operations in a programming language.
No deck description has yet been added by the author.
8
cards
3.1.1.6 Constants and variables in a programming language.
No deck description has yet been added by the author.
4
cards
3.1.1.7 String-handling operations in a programming language.
No deck description has yet been added by the author.
10
cards
3.1.1.8 Random number generation in programming.
No deck description has yet been added by the author.
2
cards
3.1.1.9 Exception handling.
No deck description has yet been added by the author.
9
cards
3.1.1.10 Subroutines (procedures/functions)
No deck description has yet been added by the author.
8
cards
3.1.1.11 Parameters of subroutines.
No deck description has yet been added by the author.
3
cards
3.1.1.12 Returning a value/values from a subroutine.
No deck description has yet been added by the author.
3
cards
3.1.1.13 Local variables in subroutines.
No deck description has yet been added by the author.
3
cards
3.1.1.14 Global variables in a programming language.
No deck description has yet been added by the author.
2
cards
3.2.1.1 Data Structures.
No deck description has yet been added by the author.
2
cards
3.2.1.2 Single and multi-dimensional arrays.
No deck description has yet been added by the author.
5
cards
3.2.1.3 Fields, Records and Files.
No deck description has yet been added by the author.
2
cards
3.3.1 Analysis.
No deck description has yet been added by the author.
3
cards
3.3.1.2 Design.
No deck description has yet been added by the author.
7
cards
3.3.1.3 Implementation.
No deck description has yet been added by the author.
2
cards
3.3.1.4 Testing.
No deck description has yet been added by the author.
2
cards
3.3.1.5 Evaluation.
No deck description has yet been added by the author.
11
cards
3.4.1.2 Following and writing algorithms.
No deck description has yet been added by the author.
7
cards
3.4.1.3 Abstraction
No deck description has yet been added by the author.
4
cards
3.4.1.4 Information hiding.
No deck description has yet been added by the author.
1
cards
3.4.1.5 Procedural abstraction.
No deck description has yet been added by the author.
1
cards
3.4.1.6 Functional abstraction.
No deck description has yet been added by the author.
1
cards
3.4.1.7 Data Abstraction.
No deck description has yet been added by the author.
2
cards
3.4.1.8 Problem abstraction/reduction.
No deck description has yet been added by the author.
1
cards
3.4.1.9 Decomposition.
No deck description has yet been added by the author.
1
cards
3.4.1.10 Composition.
No deck description has yet been added by the author.
4
cards
3.4.1.11 Automation.
No deck description has yet been added by the author.
2
cards
3.4.2.1 Finite State Machines Without Output.
No deck description has yet been added by the author.
5
cards
4.11 Big Data.
No deck description has yet been added by the author.
4
cards
4.04 Classification Of Algorithms.
No deck description has yet been added by the author.
23
cards
4.2.1 Data Structures and Abstract Data Types
No deck description has yet been added by the author.
21
cards
Circular queues
No deck description has yet been added by the author.
2
cards
Priority queues
No deck description has yet been added by the author.
4
cards
Stacks
No deck description has yet been added by the author.
9
cards
Graphs
No deck description has yet been added by the author.
20
cards
Trees
No deck description has yet been added by the author.
16
cards
Hash Tables
No deck description has yet been added by the author.
26
cards
Dictionaries
No deck description has yet been added by the author.
4
cards
More about
computer science paper 1 (mine)
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Annabel Molloy's Computer Science Paper 1 (mine) 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?
Yr11 Paper 1 Computer Science AQA 8520
- 3 decks
- 253 flashcards
- 47 learners
Decks:
2 Programming, 3 Fundamentals Of Data Representation, 1 Fundamentals Of Algorithms, And more!
Physics Paper 1
- 15 decks
- 385 flashcards
- 38 learners
Decks:
Measurements And Their Errors, Particles And Nuclides, Fundamental Particles, And more!
Computer Science
- 12 decks
- 825 flashcards
- 2 learners
Decks:
Unit 1 Computer Components, Unit 2 Operating System, Unit 3 Software Development, And more!
