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
Define object oriented programmin...,
Define polymorphism,
Define inheritance
21
cards
3.1.1.8 Random Number Generation In Programming Languages.
Syntax for random number generation,
Syntax for number generator betwe...
2
cards
3.1 Fundamentals Of Programming
Name the two data types,
What do primitive data types include,
What do non primitive data types ...
43
cards
3.1.1.2 Programming Concepts.
Define a variable declaration,
Define the syntax for variable de...,
Define a constant
15
cards
3.1.1.3 Arithmetic operations in a programming language.
Addition,
Subtraction,
Multiplication
9
cards
3.1.1.4 Relational operations in a programming language
Equal to,
Equal to,
Not equal to
12
cards
3.1.5 Boolean operations in a programming language.
Or operator,
And operator,
Xor operator
8
cards
3.1.1.6 Constants and variables in a programming language.
Define a constant,
Define a variable,
Outline the differences between a...
4
cards
3.1.1.7 String-handling operations in a programming language.
Define the purpose and syntax of ...,
Define the purpose and syntax of ...,
Define the purpose and syntax of ...
10
cards
3.1.1.8 Random number generation in programming.
Define the syntax for the random ...,
Define the syntax for generating ...
2
cards
3.1.1.9 Exception handling.
What is an exception,
What is the key word for when an ...,
What does it mean to catch an exc...
9
cards
3.1.1.10 Subroutines (procedures/functions)
Define a subroutine,
How is data passed in subroutines,
Define a procedure
8
cards
3.1.1.11 Parameters of subroutines.
How do we pass an argument,
Outline passing data through para...,
Define a subroutine interface
3
cards
3.1.1.12 Returning a value/values from a subroutine.
Define the key word for returning...,
What return type would this use,
Define what must happen if a meth...
3
cards
3.1.1.13 Local variables in subroutines.
Define the relationship between v...,
Outline the rules of local variables,
Why is it good practice to use lo...
3
cards
3.1.1.14 Global variables in a programming language.
Outline the difference between gl...,
Why is it not a good idea to use ...
2
cards
3.2.1.1 Data Structures.
Define a data structure,
Give examples of data structures
2
cards
3.2.1.2 Single and multi-dimensional arrays.
Define the use of a single array,
Define the syntax to declare an a...,
How do you access the elements of...
5
cards
3.2.1.3 Fields, Records and Files.
Outline the syntax for writing to...,
Outline the syntax for reading fr...
2
cards
3.3.1 Analysis.
What conditions must be met befor...,
Define abstraction,
How can abstraction be applied to...
3
cards
3.3.1.2 Design.
Outline the design patterns,
Define creational design patterns,
Outline an example of a creationa...
7
cards
3.3.1.3 Implementation.
What do we need to be aware of wh...,
Define implementation of an inter...
2
cards
3.3.1.4 Testing.
What do we need to be aware of wh...,
Define boundary
2
cards
3.3.1.5 Evaluation.
Outline the criteria to evaluate ...,
Define end user needs,
Define functionality
11
cards
3.4.1.2 Following and writing algorithms.
Define an algorithm,
Outline the assignment operations...,
Outline the comparison operations...
7
cards
3.4.1.3 Abstraction
Define abstraction in computers,
Define representational abstraction,
Define abstraction by generalisat...
4
cards
3.4.1.4 Information hiding.
What is information hiding
1
cards
3.4.1.5 Procedural abstraction.
What does procedural abstraction ...
1
cards
3.4.1.6 Functional abstraction.
What must we remember when concer...
1
cards
3.4.1.7 Data Abstraction.
What does data abstraction allow for,
Define data abstraction
2
cards
3.4.1.8 Problem abstraction/reduction.
Define problem abstraction
1
cards
3.4.1.9 Decomposition.
Define decomposition
1
cards
3.4.1.10 Composition.
Define composition,
Define composition aggregation,
Define association aggregation
4
cards
3.4.1.11 Automation.
Define automation,
What does automation require
2
cards
3.4.2.1 Finite State Machines Without Output.
Define a finite state machine,
Define finite,
Define a state transition diagram
5
cards
4.11 Big Data.
Define big data,
What are the three v s,
Define volume
4
cards
4.04 Classification Of Algorithms.
Define computability,
Define feasibility,
What are the two standard measure...
23
cards
4.2.1 Data Structures and Abstract Data Types
Data structure definition,
Array definition,
An array must be
21
cards
Circular queues
Circular queue definition,
Difference between a linear and c...
2
cards
Priority queues
Definition,
Items are removed in the usual,
Give an example of when a priorit...
4
cards
Stacks
Definition,
Type of data structure,
Example to remember the type of d...
9
cards
Graphs
Definition,
Can be used to represent,
Graphs consist of
20
cards
Trees
Defintion,
What is a cycle,
A closed path circuit definition
16
cards
Hash Tables
Purpose,
Purpose,
Hashing algorithm definition
26
cards
Dictionaries
Definition,
Dictionary example,
What is an application of a dicct...
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?
Biology 101
- 16 decks
- 1,045 flashcards
- 424 learners
Decks:
Biochemical Basics, Cell Biology, Microbiology, And more!
Computer-Science GCSE Revision (Paper 1)
- 11 decks
- 541 flashcards
- 1270 learners
Decks:
A Component 11 Hardware Finished, Component 15 Operating Systems Finishedi, Component 16 Principles Of Programming F, And more!
Computer Science
- 33 decks
- 1991 flashcards
- 42 learners
Decks:
11 Processors, 11 Processors Extra, 12 Software, And more!
biology paper 1
- 34 decks
- 578 flashcards
- 61 learners
Decks:
Biological Molecules Carbohydrates, Biological Molecules Lipids, Biological Molecules Proteins, And more!
