OCR A level Computer Science - Data structures

Hi, does anyone know if we have to memorise/know the implementations for all the data structures (1.4.2), or if it's just specific ones? I'm also not sure if we need to know them in Python/our programming language or if pseudocode is fine. Tried looking online but I can't find anything specific :frown:

Thank you!

Reply 1

MacTr11

What you need to know:

•

How each data structure works (stacks, queues, graphs, trees, linked lists, hash tables)

•

The key operations (push/pop, enqueue/dequeue, traversals, etc.)

•

When to use each data structure

•

Time complexity considerations

Implementation details:

•

You should be able to write pseudocode or code snippets showing how operations work

•

Exam questions typically accept pseudocode, Python, or your chosen language - they're not fussy about syntax

•

Focus on demonstrating understanding rather than perfect code

Exam tip: Paper 1 tends to ask you to explain concepts or trace through algorithms, while Paper 2 (programming project) is where implementation skills really matter.

If you want structured revision on data structures with clear explanations and practice questions, compsciwizard.com has free resources that break down each data structure with examples in pseudocode - really helpful for seeing how the concepts translate to actual code.

Quick Reply

Related discussions

Latest

Trending

Articles for you

Students react after GCSE Computer Science Paper 1 on 19th May 2023

How The Student Room is moderated

To keep The Student Room safe for everyone, we moderate posts that are added to the site.

Try out the app

Continue on web