Conquer
The
Academy
Welcome
back
Skip to content
Conquer
YOUR A LEVELS
Subjects
C
Cambridge
E
Pearson Edexcel
AQA
AQA
OCR
OCR
Competitive
Study space
Mistake Bank
AI Marking
Log in
Create free account
Study space
Mistake Bank
AI Marking
Subjects
C
Cambridge
E
Pearson Edexcel
AQA
AQA
OCR
OCR
Competitive
Log in
Create free account
Revision Notes
Practice Questions
Topical Past Paper Questions
Past Papers
Resources
Revision Notes
Practice Questions
Topical Past Paper Questions
Past Papers
Fundamental Problem-solving and Programming Skills
/
Data Types and Structures
Contents
Linear search and bounds
Practise Data Types and Structures
Contents
All chapters
Computer Science · 9618
Fundamental Problem-solving and Programming Skills
Chapter 02 · Data Types and Structures
Arrays
Linear search and bounds
01
Algorithm Design and Problem-solving
Computational Thinking Skills
1
Abstraction and decomposition
Algorithms
3
Algorithms, identifiers and changing state
Flowcharts, pseudocode and logical conditions
Stepwise refinement
02
Data Types and Structures
Data Types and Records
1
Data types and record structures
Arrays
3
1D and 2D arrays and their indexes
Linear search and bounds
Bubble sort, passes and swaps
Files
1
Text files, modes and end-of-file
Abstract Data Types
2
Stacks, queues and array implementations
Linked lists, pointers and free positions
03
Programming
Programming Basics
2
Variables, constants, input and expressions
Strings, built-in functions and libraries
Programming Constructs
2
IF, nested selection and CASE
FOR, WHILE and REPEAT loops
Structured Programming
2
Procedures, functions and interfaces
BYVAL, BYREF and variable scope
04
Software Development
Program Development Life Cycle
1
Development stages, waterfall, iteration and RAD
Program Design
2
Structure charts and module interfaces
States, events and transition diagrams
Program Testing and Maintenance
3
Syntax, run-time and logic errors
Testing methods, plans and boundary data
Maintenance and program improvement
Search resources