Vai al contenuto

Eduqas GCSE Computer Science

GCSE · EduqasComputer Science706 schede

706 flashcard, creata da cookie, in 88 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 Eduqas GCSE (9-1) Computer Science (C500QS), split into Component 1 Understanding Computer Science and Component 2 Computer Programming, then by topic in the specification's order. Delete or suspend any subdeck your course leaves out once the deck is yours.

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 (88 sottomazzi)

  • Component 1 Understanding Computer Science506 schede
    • 1 Hardware67 schede
      • 1.1 Central processing unit29 schede
      • 1.2 Memory and storage28 schede
      • 1.3 Additional hardware and embedded systems10 schede
    • 2 Logical operations45 schede
      • 2.1 Logical operators and truth tables20 schede
      • 2.2 Boolean simplification25 schede
    • 3 Networking and cybersecurity89 schede
      • 3.1 Networks and topologies17 schede
      • 3.2 Network hardware10 schede
      • 3.3 Protocols and the OSI model25 schede
      • 3.4 The internet, DNS and URLs7 schede
      • 3.5 Routing8 schede
      • 3.6 Cybersecurity threats13 schede
      • 3.7 Protecting systems9 schede
    • 4 Data representation and storage96 schede
      • 4.1 Number systems and integers47 schede
        • 4.1.1 Counting systems16 schede
        • 4.1.2 Signed integers9 schede
        • 4.1.3 Binary arithmetic13 schede
        • 4.1.4 Data types9 schede
      • 4.2 Characters, graphics and sound30 schede
        • 4.2.1 Characters9 schede
        • 4.2.2 Graphics12 schede
        • 4.2.3 Sound9 schede
      • 4.3 Storage units and compression19 schede
        • 4.3.1 Storage units9 schede
        • 4.3.2 Compression10 schede
    • 5 Data organisation21 schede
      • 5.1 Records and files7 schede
      • 5.2 Arrays7 schede
      • 5.3 Choosing and designing structures7 schede
    • 6 Operating systems27 schede
      • 6.1 Purpose and management14 schede
      • 6.2 Utility software13 schede
    • 7 Principles of programming20 schede
      • 7.1 Levels of language7 schede
      • 7.2 Choosing a language10 schede
      • 7.3 What a high-level language hides3 schede
    • 8 Algorithms and constructs61 schede
      • 8.1 Describing algorithms13 schede
      • 8.2 Subroutines and variables9 schede
      • 8.3 Pseudo-code operations11 schede
      • 8.4 Sorting8 schede
      • 8.5 Searching9 schede
      • 8.6 Validation and verification11 schede
    • 9 Software development23 schede
      • 9.1 Software tools19 schede
      • 9.2 Compiling, linking and running4 schede
    • 10 Program construction30 schede
      • 10.1 Translators10 schede
      • 10.2 Stages of compilation10 schede
      • 10.3 Programming errors10 schede
    • 11 Impacts of digital technology on wider society27 schede
      • 11.1 Ethical, legal and cultural issues17 schede
      • 11.2 Privacy, consent and the environment10 schede
  • Component 2 Computer Programming200 schede
    • 1 Investigation18 schede
      • 1.1 Approach and decomposition5 schede
      • 1.2 Modules and requirements5 schede
      • 1.3 Stakeholders and requirements8 schede
    • 2 Design19 schede
      • 2.1 User interface and data6 schede
      • 2.2 Routines in pseudo-code6 schede
      • 2.3 Documenting the design7 schede
    • 3 Implementation126 schede
      • 3.1 Variables and data types10 schede
      • 3.2 Operators and expressions9 schede
      • 3.3 Input and output6 schede
      • 3.4 Selection8 schede
      • 3.5 Iteration10 schede
      • 3.6 Subroutines8 schede
      • 3.7 Strings14 schede
      • 3.8 Lists, tuples and dictionaries16 schede
      • 3.9 Files12 schede
      • 3.10 Records and objects8 schede
      • 3.11 Graphical user interfaces9 schede
      • 3.12 Validation and authentication in code6 schede
      • 3.13 Libraries and modules4 schede
      • 3.14 Style and documentation6 schede
    • 4 Testing18 schede
      • 4.1 Test data and plans12 schede
      • 4.2 Carrying out and reporting tests6 schede
    • 5 Refinement19 schede
      • 5.1 Improving a solution7 schede
      • 5.2 Changing requirements4 schede
      • 5.3 Evaluating given code8 schede

Alcune delle sue flashcard

  • What is the purpose of the CPU?
    To carry out the instructions of a program by fetching, decoding and executing them
  • What is a systematic approach to problem solving?
    Working through a problem in ordered stages, such as investigate, design, implement, test and refine
  • What is the Von Neumann architecture?
    A design in which program instructions and data are held in the same main memory and fetched over one shared path
  • What is decomposition?
    Breaking a large problem into smaller parts that can be designed, coded and tested separately
  • What does the control unit (CU) do?
    Directs the operation of the processor by decoding instructions and sending control signals to other components
  • What is abstraction?
    Removing details that do not affect the problem, so that only the features the solution needs are modelled
  • What does the arithmetic and logic unit (ALU) do?
    Carries out arithmetic calculations and logical comparisons
  • Why does abstraction help when modelling a real system?
    It keeps the features the solution needs and ignores details that do not change the result
  • What is main memory?
    The memory that holds the programs and data in use, which the CPU reads from and writes to directly
  • Why should a problem be decomposed before it is coded?
    Smaller parts are easier to design, write and test on their own

E altre 696 dopo aver aggiunto il mazzo.