Embedded Files
(a) Analysis and design of algorithms for a given situation.
(b) The suitability of different algorithms for a given task and data set, in terms of execution time and space.
(c) Measures and methods to determine the efficiency of different algorithms, Big O notation (constant, linear, polynomial, exponential and logarithmic complexity).
(d) Comparison of the complexity of algorithms.
(e) Algorithms for the main data structures, (stacks, queues, trees, linked lists, depth-first (post-order) and breadth-first traversal of trees).
(f) Standard algorithms (bubble sort, insertion sort, merge sort, quick sort, Dijkstra’s shortest path algorithm, A* algorithm, binary search and linear search).
a) Analysis and design of algorithms for a given situation.
a) Analysis and design of algorithms for a given situation.
Lesson Presentation
Lesson Presentation
Videos
Videos
A level Analysis and design of algorithms.mp4(b) The suitability of different algorithms for a given task and data set, in terms of execution time and space.
(b) The suitability of different algorithms for a given task and data set, in terms of execution time and space.
Lesson Presentation
Lesson Presentation
Videos
Videos
(c) Measures and methods to determine the efficiency of different algorithms, Big O notation (constant, linear, polynomial, exponential and logarithmic complexity).
(c) Measures and methods to determine the efficiency of different algorithms, Big O notation (constant, linear, polynomial, exponential and logarithmic complexity).
Videos
Videos
A Level Big O notation in practice.mp4A Level Measures and methods to determine the efficiency of different algorithms, Big O notation.mp4(d) Comparison of the complexity of algorithms.
(d) Comparison of the complexity of algorithms.
Lesson Presentation
Lesson Presentation
Videos
Videos
A Level Comparison of the complexity of algorithms.mp4(e) Algorithms for the main data structures, (stacks, queues, trees, linked lists, depth-first (post-order) and breadth-first traversal of trees).
(e) Algorithms for the main data structures, (stacks, queues, trees, linked lists, depth-first (post-order) and breadth-first traversal of trees).
Lesson Presentation
Lesson Presentation
Videos
Videos
A Level Algorithms for the main data structures.mp4A level Representing, add and removing from queues and stacks (1).mp4(f) Standard algorithms (bubble sort, insertion sort, merge sort, quick sort, Dijkstra’s shortest path algorithm, A* algorithm, binary search and linear search).
(f) Standard algorithms (bubble sort, insertion sort, merge sort, quick sort, Dijkstra’s shortest path algorithm, A* algorithm, binary search and linear search).
Lesson Presentation
Lesson Presentation
Videos
Videos
A Level Implement bubble sort.mp4A Level Implement insertion sort.mp4A Level Merge sort.mp4A Level Quick sort.mp4A Level Dijkstra's shortest path.mp4A Level Implement binary search.mp4A Level Implement linear search (1).mp4Exam Q & As
Exam Q & As
Report abuse