Skip to content
cookie
Shared flashcard decks

OCR A-Level Computer Science

A-Level · OCRComputer Science1322 cards

More for OCR A-Level Computer Science

Picked for the same course from what people use most, and all of it can be read without an account.

Everything for Computer Science

Looking for help with Computer Science?

Cookie Tutoring, our own tutoring service, may have tutors for Computer Science. Lessons are live and one to one, and the first 15 minutes with any tutor is free.

Find a tutor

Flashcards for OCR A-Level Computer Science (H446), split into Computer systems and Algorithms and programming, then by the specification's numbered topics. Covers the processor, software, data exchange, data types, data structures, Boolean algebra, legal and ethical issues, computational thinking, programming and algorithms. The programming project is left out.

Adding it gives you your own copy, with every subdeck below. Each card then comes back just before you would forget it, and every one you get right or wrong counts towards your mastery of its topic. You can delete or suspend the parts you are not studying once it is yours.

What is inside (41 subdecks)

  • Component 01 Computer systems1090 cards
    • 1.1 Processors, input, output and storage154 cards
      • 1.1.1 Structure and function of the processor71 cards
      • 1.1.2 Types of processor31 cards
      • 1.1.3 Input, output and storage52 cards
    • 1.2 Software and software development192 cards
      • 1.2.1 Systems software61 cards
      • 1.2.2 Applications generation34 cards
      • 1.2.3 Software development23 cards
      • 1.2.4 A Paradigms and procedural languages17 cards
      • 1.2.4 B Assembly language and the Little Man Computer25 cards
      • 1.2.4 C Modes of addressing memory10 cards
      • 1.2.4 D Object-oriented programming22 cards
    • 1.3 Exchanging data264 cards
      • 1.3.1 Compression, encryption and hashing47 cards
      • 1.3.2 Databases81 cards
      • 1.3.3 Networks90 cards
      • 1.3.4 Web technologies46 cards
    • 1.4 Data types, data structures and algorithms399 cards
      • 1.4.1 A Data types, binary integers and two's complement69 cards
      • 1.4.1 B Hexadecimal30 cards
      • 1.4.1 C Floating point38 cards
      • 1.4.1 D Bitwise operations and character sets58 cards
      • 1.4.2 A Arrays, records, lists and tuples23 cards
      • 1.4.2 B Linked lists, stacks and queues31 cards
      • 1.4.2 C Graphs, trees and hash tables43 cards
      • 1.4.3 A Boolean logic, gates and truth tables26 cards
      • 1.4.3 B Boolean laws and simplification35 cards
      • 1.4.3 C Karnaugh maps25 cards
      • 1.4.3 D Adders and flip-flops21 cards
    • 1.5 Legal, moral, cultural and ethical issues81 cards
  • Component 02 Algorithms and programming232 cards
    • 2.1 Elements of computational thinking50 cards
    • 2.2 Problem solving and programming72 cards
      • 2.2.1 Programming techniques56 cards
      • 2.2.2 Computational methods16 cards
    • 2.3 Algorithms110 cards
      • 2.3.1 (a-d) Analysis and Big O27 cards
      • 2.3.1 (e) Data structure algorithms and traversal23 cards
      • 2.3.1 (f1) Sorting algorithms29 cards
      • 2.3.1 (f2) Searching and shortest path algorithms31 cards

Some of its cards

  • What is a flat file database?
    A single table of data, with no links to other tables
  • Which input device reads the black and white lines on a product at a checkout?
    A barcode reader
  • What is application software?
    Programs that let a user do a task, such as writing a document, rather than running the computer itself
  • What is assembly language?
    A low-level language that uses short names in place of binary opcodes
  • How does bubble sort work?
    It compares adjacent items and swaps them if they are in the wrong order, and repeats until a pass has no swaps
  • What does the arithmetic logic unit (ALU) do?
    Carries out arithmetic and logical operations on data
  • What is an operating system?
    Software that manages the hardware and provides a platform for applications to run
  • What are the steps to push an item onto an array-based stack?
    Check the stack is not full, increase the stack pointer, then store the item at that position
  • What is the base of hexadecimal?
    16
  • What makes a problem suitable for a computational solution?
    It can be described as a finite set of clear steps, with well-defined inputs and outputs

And 1312 more once you add the deck.