Vai al contenuto

AQA A level Computer Science

A-Level · AQAComputer Science573 schede

573 flashcard per AQA A-Level Computer Science, creata da cookie, in 73 sottomazzi che seguono gli argomenti del corso.

Studia queste carte

Selezionati per lo stesso corso in base a ciò che viene usato più spesso; puoi consultarli tutti senza un account.

Tutto per Computer Science

Cerchi aiuto per Computer Science?

Cookie Tutoring, il nostro servizio di lezioni private, potrebbe avere tutor per Computer Science. Le lezioni sono in diretta e individuali; i primi 15 minuti con qualsiasi tutor sono gratuiti.

Trova un tutor

Flashcards for AQA A level Computer Science (7517), split into the specification's A-level topics, 4.1 to 4.14, with a subdeck for each topic and for each subsection that is large. Follows version 1.6 of the specification (2023). Delete or suspend any subdeck your course leaves out.

Aggiungendolo avrai una tua copia, con tutti i sottomazzi. Ogni flashcard tornerà poco prima che tu la dimentichi e ogni risposta giusta o sbagliata contribuirà alla tua padronanza dell'argomento. Una volta aggiunto, potrai eliminare o sospendere le parti che non stai studiando.

Cosa contiene (73 sottomazzi)

  • 4.1 Fundamentals of programming79 schede
    • 4.1.1 Programming60 schede
      • 4.1.1.1 Data types11 schede
      • 4.1.1.2 Programming concepts9 schede
      • 4.1.1.3 to 4.1.1.6 Operators and constants14 schede
      • 4.1.1.7 to 4.1.1.8 Strings, conversions and random numbers10 schede
      • 4.1.1.9 to 4.1.1.16 Subroutines and parameters11 schede
      • 4.1.1.16 Recursion5 schede
    • 4.1.2 Programming paradigms19 schede
  • 4.2 Fundamentals of data structures47 schede
    • 4.2.1 Data structures and abstract data types10 schede
    • 4.2.2 Queues7 schede
    • 4.2.3 Stacks6 schede
    • 4.2.4 Graphs9 schede
    • 4.2.5 Trees6 schede
    • 4.2.6 Hash tables3 schede
    • 4.2.7 Dictionaries3 schede
    • 4.2.8 Vectors3 schede
  • 4.3 Fundamentals of algorithms31 schede
    • 4.3.1 Graph traversal6 schede
    • 4.3.2 Tree traversal7 schede
    • 4.3.3 Reverse Polish notation5 schede
    • 4.3.4 Searching algorithms4 schede
    • 4.3.5 Sorting algorithms4 schede
    • 4.3.6 Optimisation algorithms5 schede
  • 4.4 Theory of computation53 schede
    • 4.4.1 Abstraction and automation15 schede
    • 4.4.2 Regular languages15 schede
    • 4.4.3 Context-free languages3 schede
    • 4.4.4 Classification of algorithms14 schede
    • 4.4.5 A model of computation6 schede
  • 4.5 Fundamentals of data representation94 schede
    • 4.5.1 Number systems10 schede
    • 4.5.2 Number bases7 schede
    • 4.5.3 Units of information13 schede
    • 4.5.4 Binary number system21 schede
    • 4.5.5 Information coding systems7 schede
    • 4.5.6 Images, sound and other data25 schede
    • 4.5.6.10 Encryption11 schede
  • 4.6 Fundamentals of computer systems39 schede
    • 4.6.1 Hardware and software9 schede
    • 4.6.2 Classification of programming languages5 schede
    • 4.6.3 Types of program translator7 schede
    • 4.6.4 Logic gates13 schede
    • 4.6.5 Using Boolean algebra5 schede
  • 4.7 Fundamentals of computer organisation and architecture46 schede
    • 4.7.1 Internal hardware components9 schede
    • 4.7.2 The stored program concept5 schede
    • 4.7.3 The processor and its components24 schede
    • 4.7.4 External hardware devices8 schede
  • 4.8 Consequences of uses of computing16 schede
    • 4.8.1 Individual, social, legal and cultural issues16 schede
  • 4.9 Fundamentals of communication and networking81 schede
    • 4.9.1 Communication14 schede
    • 4.9.2 Networking13 schede
    • 4.9.3 The Internet19 schede
    • 4.9.4 The TCP/IP protocol stack35 schede
  • 4.10 Fundamentals of databases24 schede
    • 4.10.1 Conceptual data models and entity relationship modelling6 schede
    • 4.10.2 Relational databases4 schede
    • 4.10.3 Database design and normalisation3 schede
    • 4.10.4 Structured Query Language (SQL)6 schede
    • 4.10.5 Client-server databases5 schede
  • 4.11 Big Data10 schede
    • 4.11.1 Big Data10 schede
  • 4.12 Fundamentals of functional programming25 schede
    • 4.12.1 Functional programming paradigm10 schede
    • 4.12.2 Writing functional programs5 schede
    • 4.12.3 Lists in functional programming10 schede
  • 4.13 Systematic approach to problem solving15 schede
    • 4.13.1 Aspects of software development15 schede
  • 4.14 Non-exam assessment: the computing practical project13 schede
    • 4.14.1 Overview13 schede

Alcune delle sue flashcard

  • What is a data type?
    A classification of values that sets which values a variable can hold and which operations apply to it
  • What is a data structure?
    A way of organising data so that it can be stored and used efficiently
  • What does breadth-first search visit first?
    All neighbours of the current vertex before moving further away
  • What is an algorithm?
    A sequence of steps that completes a task and always terminates
  • Which set is written N\mathbb{N}?
    The natural numbers, {0,1,2,3,…}\{0, 1, 2, 3, \ldots\}
  • What is hardware?
    The physical components of a computer system
  • What is a bus?
    A set of wires that carries signals between components
  • What does digital technology enable with personal information?
    Monitoring behaviour, amassing and analysing personal information, and distributing it
  • What is serial transmission?
    Sending bits one after another along a single channel
  • What is an entity?
    A thing about which data is held, such as a customer or an order

E altre 563 dopo aver aggiunto il mazzo.