ib computer science case study 2022 notes

2022 case study

• 1 Introduction
• 2 The case study
• 3 Every term in the case study
• 4 Markscheme for case study
• 5 Previous years case studies
• 6 References

Introduction [ edit ]

Higher-level students must write 3 papers. The case study is the third paper. Every year, the case study discusses a different topic. Students must become very very familiar with the case study . The IB recommends spending about a year studying this guide.

This page will help you organize and understand the 2022 case study .

The case study [ edit ]

Click here for the full pdf case study for 2022

Every term in the case study [ edit ]

• Please visit our programming page to see a list of terms involved in genetic algorithms .

Markscheme for case study [ edit ]

Previous years case studies [ edit ]

• Click here for the 2020 and 2021 case study
• Click here for the 2019 case study
• Click here for the 2018 case study
• Click here for the 2017 case study
• Click here for the 2016 case study

References [ edit ]

• ↑ http://www.flaticon.com/

Devote time and attention to gaining knowledge of (an academic subject), especially by means of books

Give a sequence of brief answers with no explanation.

IB HL Paper3 Case Study 2022 Genetic Algorithms

Case study 2020 block chain, about paper 3.

The paper is normally written on the same day as paper 2 and has a duration of  1 hour , with a  maximum   mark  of  30 , counting for  20%  of the  total subject grade . Every year, it is a based on a case study or scenario that changes.

Marking Bands

The CASE STUDY 

IB_HL_Paper3_CaseStudy_2022 by Tiberius Hodoroabă - Simion

Genetic Algorithms by 1balamanian

CASE STUDY Questions

Case study student notes.

Write Notes under the following headings

CASE Study Knowledge and understanding:

Terminology guide.

Additional Terminology

Brute force approach Combinatorial optimization Computational intractability Convergence Crossover / crossover operator Elitism Exploration vs exploitation Fitness / fitness function / fitness landscape Heuristic Hill climbing Initialization parameters Local extrema Mating pool Mutation / mutation rate Novelty search Offspring Optimization Population Premature convergence Problem space Ranking Roulette wheel selection Selection strategy Simulated annealing Stochastic universal sampling Termination condition Tour Tournament selection Truncation selection

Lesson One - Homework

Read the Case Study and summarize the introduction section

In your research so far have you come across any protocols ?

What is Section

What is a hashing function.

Hashing functions are mathematical algorithms that take inputs and generate unique outputs.

• Hash functions turn an arbitrarily-large piece of data into a fixed-length hash output
• They are one-to-one: the same input will always provide the same hash output
• They are one-way functions: it's impossible to "work backwards", and reconstruct the input given a hash output.

What is a Good Hashing Function

“The essential characteristics of good hashing algorithms are determinism, noninvertibility and collision resistance.” A good cryptographic hash function is non-invertible, meaning it cannot be reverse engineered.

What is SHA256 Hash Generator

What is  sha256 hash generator.

he SHA (Secure Hash Algorithm) is one of a number of cryptographic hash functions. A cryptographic hash is like a signature for a data set. If you would like to compare two sets of raw data (source of the file, text or similar) it is always better to hash it and compare SHA256 values. It is like the fingerprints of the data. Even if only one symbol is changed the algorithm will produce different hash value. SHA256 algorithm generates an almost-unique, fixed size 256-bit (32-byte) hash. Hash is so called a one way function. This makes it suitable for checking integrity of your data, challenge hash authentication, anti-tamper, digital signatures, blockchain. With the newest hardware (CPU and GPU) improvements it is become possible to decrypt SHA256 algorithm back. So it is no longer recommended to use it for password protection or other similar use cases. Some years ago you would protect your passwords from hackers by storing SHA256 encrypted password in the your data base. This is no longer a case. SHA256 algorithm can be still used for making sure you acquired the same data as the original one. For example if you download something you can easily check if data has not changed due to network errors or malware injection. You can compare hashes of your file and original one which is usually provided in the website you are getting data or the file from. SHA-256 is one of the successor hash functions to SHA-1,and is one of the strongest hash functions available.

Online Tool Click Here

what is Immutable transaction

What is an immutable transaction.

Immutability is used to denote something which can never be modified or deleted. In a blockchain, it refers to the logs of transactions, which is created by consensus among the chain’s participants. The basic notion is this: once a blockchain transaction has received a sufficient level of validation it can never be replaced or reversed or edited.

Now let us see how blockchain attains immutability.

If a miner tries to change a transaction from history, he will have to re-mine all the blocks from that block till the current block and this will have to be reflected in every copy of the ledger in the network. Miners will have to rebuild the merkle tree of the block in which the transaction is present and redo all the proof of work for that block.

Now, since the next block stores the hash of this block, the next block will also have to be re-mined. This is because the next block will have to be edited with the new “previous block hash”. This change will result in a different block hash. The new block hash might result in a hash that does not match the set difficulty level. Thus, this block will also have to be re-mined.

What about the new blocks being added every 10 minutes?

The computing power required to achieve this is enormous and probably only theoretical.

what is a trapdoor function

What is a merkle tree ( also known as a binary hash tree ), what is  a merkle tree.

In very simple terms, a Merkle Tree is a way of structuring data that allows a large body of information to be verified for accuracy both extremely efficiently and quickly. They have become a crucial component of blockchain technology and cryptocurrency,

The Merkle Tree has been around since 1979, when a man named Ralph Merkle was at Stanford University. Merkle wrote a paper titled “A Certified Digital Signature” during his time at Stanford, and unknowingly created a major component of blockchain. In his paper, Merkle described a brand new method of creating proofs. Essentially, Merkle designed a process for verifying data that would allow computers to work much faster than before

A Merkle Tree Example

Let’s imagine that there were four transactions performed on one block: A, B, C, and D. Each transaction is then hashed, leaving us with:

The hashes are paired together resulting in:

These two hashes are hashed together to give us our Merkle Root: Hash ABCD. In reality, a Merkle Tree is far more complicated than this (especially when you consider that each transaction ID is 64 characters long) but this should give you an idea as to how the algorithms work and why it is so effective. 

The implementation of Merkle trees in blockchains has multiple effects. It allows them to scale while also providing the hash-based architecture for them to maintain data integrity and a trivial way to verify the integrity of data .

Slide Shows & Lessons

Paper 3 long question.

Paper 3 always ends with a long discussion question. The time is one hour so allow 2 minutes per point, for example if the Long question   is for 12 points allocate 23 minutes. If short question is for 4 mark allocate 8 minutes. This will help ensure you spend the correct amount of time on each question.

=== Long Question (12 marks) ===

- Suggestions for the responses --- … USE TECHNICAL VOCABULARY whenever possible and sensible. … Your response to this question(s) should be 1-2 pages long, depending on the size of your writing. … and it must be completed within 20-30 minutes, as there are other questions on the exam. … Hence, you may only give partial responses to each part of the question. … Be sure to address ALL parts of the question(s), albeit briefly, rather than one part in depth. … Keep in mind that there are no "RIGHT" answers, but there are better and worse answers.

Paul Baumgarten

Computer Scientist, teacher, freelance programmer and self confessed geek

• Classes IB Diploma CompSci IGCSE CompSci MYP Digital Design Coding club
• Resources Python Java Javascript C++ Raspberry Pi

IB Diploma Computer Science

Welcome to my teaching notes for the International Baccalaureate Diploma Computer Science course.

• Course introduction (November 2020)
• Course syllabus
• Schedule for Year 12 (class of 2023)
• Schedule for Year 13 (class of 2022)

Units & key resources

• Unit 1: Systems design
• Unit 2: Computer architecture
• Unit 3: Networks
• Unit 4a: Java notes
• Java Exam Tool Subset (JETS) (previous syllabus but still very relevant)
• Codingbat and video introduction
• Video: What's happening in a while loop
• Video: For loops with arrays
• Video: How functions work (Python)
• Video: Exceptions
• Unit 4b: Teaching notes
• Search & sort algorithm animations
• IB pseudocode (exam version)
• IB pseudocode (additional detail)
• Unit 5 (& D4): Abstract data structures (HL only)
• Unit 6: Resource management (HL only)
• Unit 7: Control systems (HL only)
• OOP part 1 - concepts
• OOP terminology check
• OOP part 2 - programming
• IA handbook 2020
• IA proposal
• IA technology stacks 2022
• IA client nomination form)
• Past IA's (STC students only)
• Case study (HL only)
• Extended essay (optional)

IB assessment outline

Other ib teacher websites.

Other IB CS teacher websites. Feel free to check them out!

• Chris Coetzee, Dartford Grammar School, UK
• Michael Brooke, St Julian’s School
• Bill MacKenty, American School of Warsaw
• Robert Griffiths, Colegio Gran Bretaña, Bogotá
• Wikibooks, various authors

Other resources

Online programming courses & lectures

• Video lectures from various universities
• edX: Introduction to Java Programming – Part 1 (25 hours)
• coursera: Object Oriented Programming in Java Specialization (13 hours for course 1, 24 hours for course 2, 25 hours for course 3, don't worry about course 4)
• Introduction to Programming Using Java, Eighth Edition (online, free edition) by David Eck

If you come across any other site worth adding to the list, please let me know!

Graded IB Computer Science Notes Page

This page will store notes made by Mr. Griswold for students in IB Computer Science. It will be updated and edited over time, but old versions will be archived.

The material below is broken into three sections - general course resources, Paper 1, and Paper 2. Paper 2 is focused on java programming, but much of the thinking in paper 2 overlaps with topic 4 from Paper 1.

Paper 1 Notes

We will mostly use external resources for this topic

• P1 2.1 - Abstraction and the Elements of a Computer System (IB Topic 2)
• P1 2.1a - Transistors
• P1 2.2 - Memory and Storage (IB Topic 2)
• P1 2.3 - Computer Processor Architecture (IB topic 2)
• P1 2.4 - Software, the OS, and Programming languages (IB Topic 2)
• P1 2.5 - Working with Binary and Hexadecimal
• P1 2.6 - Representing characters on computers
• P1 2.7 - Representing other numbers
• P1 2.8 - Representing colors
• P1 2.9 - Logic gates and circuits
• P1 3.1 - Types of networks
• P1 3.2 - Protocols and Standards
• P1 3.3 - Network Layers
• P1 3.4 - Network Hardware
• P1 3.5 - VPNs
• P1 4.3 - IB collections
• P1 4.4 - IB Arrays
• P1 4.5 - Search Algorithms
• P1 4.6 - Sorting Algorithms
• P1 4.10 - Common Pseudocode Techniques

No notes here yet!

• P1 6.1 - Operating Systems
• P1 6.2 - Types of computers and their resources
• P1 6.3 - Management Techniques
• P1 7.1 - Introducing Control

Paper 2 - Java and Programming Notes

We will learn programming and problem solving in java using several resources - Coding Bat , CS Awesome , and CodeHS , and these notes will supplement those ideas.

• P2 1.1 - Anatomy of a method signature
• P2 1.2 - Variables and data types
• P2 1.3 - If statements, Return, and Logical Operators
• P2 1.4 - Operators
• P2 1.5 - Strings and reference types
• P2 1.6 - Printing and the Java skeleton

You should also use CS Awesome to study this material, specifically chapters 2 and 5.

• P2 2.1 - Anatomy of a Class

Check back later

Course Resources

Official IB Syllabus . In the notes, when a section connects directly to this syllabus, it will be represented with a superscript, like this .

CS Awesome . This is the primary online platform we will use to learn to program in Java.

Traced algorithms and coding problems . I will add coding problems and traced algorithms to this page, over time, for you to view and practice with.

CodingBat . Coding practice in java

CodingBat Pseudocode Practice - Coding practice in IB Pseudocode

IA Information

Sample IA Made in Class by Mr. G

The IB CS Guide - Includes the full syllabus (as a PDF, rather than the website above) and IA guidelines among other things

CompSciHub About page - This excellent resource put together by IB CS teachers and students compiles notes and information about the course.

Paul Baumgarten’s IB CS Page - Paul Baumgarten is a long-time IB CS teacher and active contributor to the community. His page includes notes and exercises on nearly all IB topics, as well as links to even more resources. The order is different than our course, but an excellent resource for studying or reading new perspectives.

Mr. Wach’s IB CS Page - Mr. Wachs is a teacher of many computer science courses including IB CS. He has many videos, slideshows, and workbooks that we will look at for some units, and makes a good resource for studying many aspects of the course.

See the version of these notes used from 2019-2020

IB Computer Science Notes

Filter exemplars, cs questions - topic 2, python if statements, want to get full marks for your ia allow us to review it for you 🎯, full notes for unit 4, full notes for unit 1, topic 4 key definitions, fast track your coursework with mark schemes moderated by ib examiners. upgrade now 🚀, topic 6: resource management, resource management, ib computer science 6.1.1, topic 7: control, system fundamentals (topic 1), networks (topic 3), computer organization (topic 2), computational thinking, problem-solving and programming (topic 4), computer organisation notes, paper 1 notes, computer science paper 1 notes, option d (object oriented programming) revision guide, impacts of digital citizenship(computer science), computer science sl notes, computer science units 1, 2, exam revision sheet, pseudocode notation for ibdp cs, paper 1 computer science notes (both sl and hl), ib cs unit 1 - system fundamentals, problem solving - cs sl, computer science booklet, computer science chapter 3 notes, ibdp computer science hl 1 course orientation questions, topic 1-2 notes, topic 1: systems in organization - planning and systeminstallation, website to assign tasks to students (all criteria).

Navigation Menu

Search code, repositories, users, issues, pull requests..., provide feedback.

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly.

To see all available qualifiers, see our documentation .

• Notifications

IB CompSci Hub

Grade boundaries

The IB releases the grade boundaries for every year’s papers shortly after the exam results are published in July . They have been steadily increasing year on year from the course’s update in May 2014. Here is a summary of the past 4 years and our projections for the 2018 cohort for HL Computer Science (given in %):

Here are the official published grade boundaries for the different components for both SL and HL:

IB CompSci May 2019 – Grade Boundaries  (HL only)

IB CompSci May 2018 – Grade boundaries  (HL only)

IB CompSci May 2017 – Grade Boundaries

IB CompSci May 2016 – Grade Boundaries

IB CompSci May 2015 – Grade Boundaries

IB CompSci May 2014 – Grade Boundaries

The IB also publishes ‘ generic grade descriptors ‘ to show what are the traits and characteristics of someone who gets a particular grade (in this case, level 5 and level 7)

IB Grade descriptors  (e.g. difference between a level 5 and level 7)

Also, the IB publishes a statistical report on the whole of IB diploma’s program every year. Fun fact : in 2017, there were only 1451 HL Computer Science students in the world!

IB Diploma Statistical Report: May 2017