Find Flashcards
Make Flashcards
Why It Works
More
Educators
Businesses
Academy
About

Log in
Get Started

Brainscape's Knowledge Genome^TM

Entrance Exams
Professional Certifications
Foreign Languages
Medical & Nursing
Science
English
Humanities & Social Studies
Mathematics
Law
Vocations
Health & Fitness
Business & Finance
Technology & Engineering
Food & Beverage
Fine Arts
Random Knowledge

Top Flashcards (Certified)

A OCR Computer Science A level > Chapter 63 - Graph traversal algorithms > Flashcards

Chapter 63 - Graph traversal algorithms Flashcards

(0 cards)

A OCR Computer Science A level (75 decks)

Chapter 1 - Processor components

Chapter 2 - Processor performance

Chapter 3 - Types of processor

Chapter 4 - Input devices

Chapter 5 - Output devices

Chapter 6 - Storage devices

Section 2 - Systems Software

Chapter 7 - Functions of an operating system

Chapter 8 - Types of operating system

Chapter 9 - The nature of applications

Chapter 10 - Programming language translators

Section 3 - Software development

Chapter 11 - System analysis methods

Chapter 12 - Writing and following algorithms

Chapter 13 - Programming paradigms

Chapter 14 - Assembly language

Section 4 - Exchanging data

Chapter 15 - Compression, encryption and hashing

Chapter 16 - Database concepts

Chapter 17 - Relational databases and normalisation

Chapter 18 - Introduction to SQL

Chapter 19 - Defining and updating tables by using SQL

Chapter 20 - Transaction processing

Section 5 - Networks and web technologies

Chapter 21 - Structure of the Internet

Chapter 22 - Internet communication

Chapter 23 - Network security and threats

Chapter 24 - HTML and CSS

Chapter 25 - Web forms and JavaScript

Chapter 26 - Search engine indexing

Chapter 27 - Client-server and peer-to-peer

Section 6 - Data types

Chapter 28 - Primitive data types, binary and hexadecimal

Chapter 29 - ASCII and Unicode

Chapter 30 - Binary Arithmetic

Chapter 31 - Floating point arithmetic

Chapter 32 - Bitwise manipulation and masks

Section 7 - Data structures

Chapter 33 - Arrays, tuples and records

Chapter 34 - Queues

Chapter - 35 Lists and linked lists

Chapter 36 - Stacks

Chapter 37 - Hash tables

Chapter 38 - Graphs

Chapter 39 - Trees

Section 8 - Boolean algebra

Chapter 40 - Logic gates and truth tables

Chapter 41 - Simplifying Boolean expressions

Chapter 42 - Karnaugh maps

Chapter 43 - Adders and D-type flip-flops

Section 9 - Legal, moral, ethical and cultural issues

Chapter 44 - Computing related legislation

Chapter 45 - Ethical, moral and cultural issues

Chapter 46 - Privacy and censorship

Section 10 - Computational thinking

Chapter 47 - Thinking abstractly

Chapter 48 - Thinking ahead

Chapter 49 - Thinking procedurally

Chapter 50 - Thinking logically, thinking concurrently

Chapter 51 - Problem recognition

Chapter 52 - Problem solving

Section 11 - Programming techniques

Chapter 53 - Programming basics

Chapter 54 - Selection

Chapter 55 - Iteration

Chapter 56 - Subroutines and recursion

Chapter 57 - Use of an IDE

Chapter 58 - Use of object - oriented techniques

Section 12 - Algorithms

Chapter 59 - Analysis and design of algorithms

Chapter 60 - Searching algorithms

Chapter 61 - Bubble sort and insertion sort

Chapter 62 - Merge sort and quick sort

Chapter 63 - Graph traversal algorithms

Chapter 64 - Optimisation algorithms

Key Links
Subjects
Company
- About Us
- Earn Money!
- Academy
- Swag Shop
- Contact
- Terms
- Podcasts
- Careers
Find Us

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions