Feb 6, 2025 · Learn about graphs: traversing, adding & removing data for your A Level Computer Science exam. This revision note includes operations and traversal methods.

For each of the papers below, there are revision notes, flashcards, videos and questions from past exam papers separated by topic.

Searching and sorting algorithms (bubble sort, insertion sort, merge sort, quick sort) are explained in an interactive and practical way, with reference to Big-O notation in terms of time and space …

Explain the difference between a depth-first (post-order) and breadth-first traversal. node X for the structure shown in the diagram above. d) Explain how you used backtracking in your answer …

Breadth-first traversal involves visiting all the adjoining nodes for each node in turn. Graphs are data structures used to represent data items which have connections between them, such as …

Compare the use of a breadth-first traversal and a depth-first (post-order) traversal on the binary search tree. You should include the following in your answer:

Understanding different types and structures of algorithms, as well as how to measure their efficiency, is essential for any effective programmer. Everything you need to know about …

Notes, flashcards, revision videos and past exam questions by topic for OCR Computer Science A-Level Algorithms topic.

Study with Quizlet and memorise flashcards containing terms like time complexity, permutation, big-o notation and others.

Get ready for your OCR A Level Computer Science exams with our revision resources. Find everything you need to revise this topic, so you can go into your exam confident and prepared. …