Subjects · Leaving Cert Computer Science
Leaving Cert Computer Science: Problem solving & puzzles
How often Problem solving & puzzles comes up on the Computer Science papers, every year it was asked, and questions to try.
HL Asked on 5 of the last 5 Higher Level papers, most recently in 2025. banker
OL Asked on 2 of the last 5 Ordinary Level papers, most recently in 2023.
Quick ones on Problem solving & puzzles.
- The fox
- The goose
- The grain
- 4
- 3
- 2
- 7
- 6
- 8
Show the answers
(a) The goose
(b) 2
(c) 7
Higher Level
Asked on 5 of the last 5 Higher Level papers, most recently in 2025. banker
Every paper, year by year
| Year | Where it came up |
|---|---|
| 2025 | A3 |
| 2024 | A4 |
| 2023 | A8, A9 |
| 2022 | A10 |
| 2021 | B14 |
Links open the State Examinations Commission’s paper for that year.
More Problem solving & puzzles questions
Problem solving & puzzles, 3 marks
A snail climbs 3 m up a 10 m well each day and slips back 2 m each night. On which day does it reach the top?
- Day 10
- Day 7
- Day 8
Show the answer
Day 8
It gains 1 m per full day, so it starts day 8 at 7 m. That day it climbs 3 m and reaches 10 m before it can slip. Counting 1 m a day gives the wrong answer 10.
Problem solving & puzzles, 3 marks
A drawer has only black and white socks. How many must you take out, without looking, to be sure of a pair?
- 4
- 3
- 2
Show the answer
3
With 2 socks you could have one of each colour. There are only 2 colours, so the 3rd sock must match one of the first two.
Problem solving & puzzles, 2 marks
What is trial and error as a problem-solving strategy?
- Trying a solution, checking it and adjusting until it works
- Taking the first answer found and not checking it any further
- Solving the problem by working backwards from the goal
Show the answer
Trying a solution, checking it and adjusting until it works
Trial and error suits problems with few possible answers or no known method. Each failed attempt gives information for the next try.
Ordinary Level
Asked on 2 of the last 5 Ordinary Level papers, most recently in 2023.
Every paper, year by year
| Year | Where it came up |
|---|---|
| 2025 | Not asked |
| 2024 | Not asked |
| 2023 | B13 |
| 2022 | A12 |
| 2021 | Not asked |
Links open the State Examinations Commission’s paper for that year.
More Problem solving & puzzles questions
Problem solving & puzzles, 3 marks
Tower of Hanoi with 3 discs: fewest moves needed to move the whole tower?
- 6
- 9
- 7
Show the answer
7
The fewest moves for n discs is 2 to the power n, minus 1. For 3 discs: 8 - 1 = 7. Each extra disc roughly doubles the moves.
Problem solving & puzzles, 2 marks
Trying every possible answer until one works is called…
- Decomposition
- Brute force
- Abstraction
Show the answer
Brute force
Brute force checks every option, e.g. trying all PINs from 0000 to 9999. It always finds the answer in the end but can be very slow.
Problem solving & puzzles, 3 marks
How many different 3-digit PINs can be made using the digits 0 to 9?
- 1000
- 30
- 720
Show the answer
1000
Each of the 3 places has 10 choices: 10 × 10 × 10 = 1000 PINs (000 to 999). Adding one more digit makes it 10 times harder to guess.
Other Computer Science topics
- Abstraction & pattern recognition
- Binary & hexadecimal
- CPU, memory & storage
- Embedded systems & sensors
- Ethics & social impact
- Flowcharts & pseudocode
- Internet, WWW & protocols
- Loops & trace tables
- Selection & Boolean logic
- Universal design & accessibility
- Variables, data types & operators
- Algorithmic complexity
- Data analytics & data quality
- Functions & modules
- Logic gates & truth tables
- Roles, teams & stakeholders
- Searching algorithms
- Testing & debugging
- AI & machine learning
- ASCII & Unicode
- Design process & SDLC
- History & emerging trends
- Lists
- Privacy & cybersecurity
- Basic electronics
- Databases
- Modelling & simulation
- Operating systems
- Quicksort
- Recursion
- Sorting algorithms
- Strings & string methods
- Heuristics
- Turing machines