0% found this document useful (0 votes)
30 views11 pages

OCR A Level (H046-H446) Algorithms For Main Data Structures

The document discusses algorithms for common data structures including stacks, queues, trees, and linked lists. It provides an overview of algorithms for creating, adding/removing items from, and traversing each data structure. These include stack push/pop algorithms, queue enqueue/dequeue algorithms, tree depth-first and breadth-first traversal algorithms, and linked list insertion/deletion algorithms. The exam board expects students to understand when and how to apply different data structures and their associated algorithms.

Uploaded by

moran14tom
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
30 views11 pages

OCR A Level (H046-H446) Algorithms For Main Data Structures

The document discusses algorithms for common data structures including stacks, queues, trees, and linked lists. It provides an overview of algorithms for creating, adding/removing items from, and traversing each data structure. These include stack push/pop algorithms, queue enqueue/dequeue algorithms, tree depth-first and breadth-first traversal algorithms, and linked list insertion/deletion algorithms. The exam board expects students to understand when and how to apply different data structures and their associated algorithms.

Uploaded by

moran14tom
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

OCR AS Level

(H046)
SLR25-26 Algorithms OCR A Level
(H446)

• Algorithms for main data structures – stacks,


queues, trees, linked lists, depth-first and
breadth-first tree traversal

Teacher site: craigndave.org | Student site: student.craigndave.org | Smart revise: smartrevise.co.uk


SLR25-26 Algorithms | Overview of algorithms for main data structures OCR H046/H466

Algorithms for main data structures


• As well as the standard algorithms
we covered in the last video, you
also need to be familiar with a range
of algorithms that can be used in
conjunction with the main data
structures covered in the course.

• For most data structures, you need


to understand how to:
o Create them
o Add items to them
o Remove items from them
o Traverse them

• Many of these actions are associated


with well-known algorithms – we
covered these in detail in our videos
on data structures back in SLR14.
SLR25-26 Algorithms | Overview of algorithms for main data structures OCR H046/H466

Algorithms for main data structures

Data structure Read Trace Write Add Remove Traverse Other knowledge

Stacks       Implementation using


static and dynamic
methods – e.g., linked lists
vs static array
Queues      

Trees Depth-first traversal


Binary trees       Breadth-first traversal

Understanding as a
Linked list       dynamic data structure
SLR25-26 Algorithms | Overview of algorithms for main data structures OCR H046/H466

A note from the exam board


From the OCR specification:

“Candidates need to have an understanding of the


situations where queues, stacks, trees, etc. can be used and
be able to recommend and justify their use in specific
scenarios or programs.

Candidates’ code is not expected to be syntactically perfect


but must use appropriate structures and techniques.”

So, be aware that even though you learned about these


data structures and algorithms back in component one,
they will crop up again in your component two exam on
algorithms and programming.
SLR25-26 Algorithms | Overview of algorithms for main data structures OCR H046/H466

Having watched this video, you should be


able to answer the following key question.

• What are the names of the algorithms that can be used to


create, traverse, add data to and remove data from the main
data structures?
OCR AS Level
(H046)
SLR25-26 Algorithms OCR A Level
(H446)

Essential algorithms for


A Level Computer Science

Teacher site: craigndave.org | Student site: student.craigndave.org | Smart revise: smartrevise.co.uk


SLR25-26 Algorithms | Overview of algorithms for main data structures OCR H046/H466
SLR25-26 Algorithms | Overview of algorithms for main data structures OCR H046/H466
SLR25-26 Algorithms | Overview of algorithms for main data structures OCR H046/H466
SLR25-26 Algorithms | Overview of algorithms for main data structures OCR H046/H466

You might also like