UniGeniusIB Computer Science

Course map

Theme A: concepts of computer science

  • A1 Computer fundamentalsSL and HL: Paper 1 Section A
    • Describe the CPU, GPU, memory, storage, the fetch, decode and execute cycle, compression and cloud services
    • Represent data in binary and hexadecimal; use logic gates and truth tables
    • Explain operating systems, scheduling, polling and interrupts; HL: pipelining, control systems and translation
    LessonPractice
  • A2 NetworksSL and HL: Paper 1 Section A
    • Describe networks, devices, protocols and modern digital infrastructure
    • Compare topologies and networking models; explain segmentation, IP addressing, media and packet switching
    • Discuss firewalls, encryption and digital certificates; HL: TCP/IP, servers, routing, vulnerabilities and countermeasures
    LessonPractice
  • A3 DatabasesSL and HL: Paper 1 Section A
    • Explain relational databases: keys, relationships, schemas, ERDs and normalization
    • Construct SQL queries that select, join, filter, sort and update data
    • HL: aggregate functions, views, transactions, alternative databases, data warehouses and distributed databases
    LessonPractice
  • A4 Machine learningSL and HL: Paper 1 Section A
    • Describe the types of machine learning, their applications and hardware needs
    • HL: data cleaning, feature selection, regression, classification, clustering, neural networks and model choice
    • Discuss the ethical implications of machine learning and of computing in daily life
    LessonPractice

Theme B: computational thinking and problem-solving

  • B1 Computational thinkingSL and HL: Paper 2
    • Construct a problem specification and apply decomposition, pattern recognition, abstraction and algorithm design
    • Trace flowcharts and algorithms without code
    • Explain how computational thinking approaches a real problem
    LessonPractice
  • B2 Programming fundamentals and data structuresSL and HL: Paper 2
    • Trace and construct programs with variables, strings, selection, loops and functions
    • Use arrays and lists, 2D structures, stacks and queues; handle exceptions and debug
    • Read and write files
    LessonPractice
  • B2.4 Searching, sorting, efficiency and recursionSL and HL: Paper 2
    • Trace linear and binary search, bubble sort and selection sort
    • Describe efficiency with Big O notation
    • HL: explain and trace recursion
    LessonPractice
  • B3 Object-oriented programmingSL and HL: Paper 2
    • Design and construct classes; instantiate objects; static and instance members
    • Explain encapsulation and information hiding
    • HL: inheritance, polymorphism, abstraction, composition, aggregation and design patterns
    LessonPractice
  • B4 Abstract data types (HL)HL only: Paper 2
    • Explain the purpose and properties of abstract data types
    • Construct and evaluate linked lists (singly, doubly and circular) and binary search trees
    • Use sets and hash tables
    LessonPractice

The case study

  • The case study approachSL and HL: Paper 1 Section B
    • Explain how the systems in a scenario work and the computational thinking behind them
    • Apply syllabus concepts to a new scenario and relate it to others
    • Discuss impacts and ethics; evaluate and justify strategies from the scenario and new material
    LessonPractice

Assessment and the internal assessment

  • How Computer Science is assessedSL and HL: Paper 1 Section A; Paper 2
    • Know the papers, sections, marks and timings at SL and HL
    • Answer to the command term: from State to Evaluate
    • Plan the computational solution against the five IA criteria
    LessonPractice

IB Diploma Programme Computer Science, SL and HL. The internal assessment, a research proposal, is not practised here.

Independent preparation for IB Diploma Programme Computer Science. Not affiliated with or endorsed by the International Baccalaureate Organization.

Questions? support@unigenius.co.uk

Privacy · Terms