Scribd Logo
Upload

Welcome to Scribd!

  • 79 views

    4.3 Fundamentals of Algorithms

    Uploaded by

    louistestevens
    This document outlines fundamental algorithms including graph traversal, tree traversal, reverse Polish notation, searching, sorting, and optimization algorithms. It describes breadth-first and depth-first search, pre-order, post-order and in-order tree traversal, and linear, binary, and binary tree searching. It also covers linear sorting, merge sorting, and Dijkstra's shortest path algorithm. The document provides examples of uses for each algorithm and analyzes their time complexities.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    4.3 Fundamentals of Algorithms

    Uploaded by

    louistestevens
    79 views3 pages
    This document outlines fundamental algorithms including graph traversal, tree traversal, reverse Polish notation, searching, sorting, and optimization algorithms. It describes breadth-first and depth-first search, pre-order, post-order and in-order tree traversal, and linear, binary, and binary tree searching. It also covers linear sorting, merge sorting, and Dijkstra's shortest path algorithm. The document provides examples of uses for each algorithm and analyzes their time complexities.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines fundamental algorithms including graph traversal, tree traversal, reverse Polish notation, searching, sorting, and optimization algorithms. It describes breadth-first and depth-first search, pre-order, post-order and in-order tree traversal, and linear, binary, and binary tree searching. It also covers linear sorting, merge sorting, and Dijkstra's shortest path algorithm. The document provides examples of uses for each algorithm and analyzes their time complexities.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    79 views3 pages

    4.3 Fundamentals of Algorithms

    Uploaded by

    louistestevens
    This document outlines fundamental algorithms including graph traversal, tree traversal, reverse Polish notation, searching, sorting, and optimization algorithms. It describes breadth-first and depth-first search, pre-order, post-order and in-order tree traversal, and linear, binary, and binary tree searching. It also covers linear sorting, merge sorting, and Dijkstra's shortest path algorithm. The document provides examples of uses for each algorithm and analyzes their time complexities.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    🔁

    4.3 Fundamentals of algorithms


    Status

    4.3.1 Graph-traversal
    4.3.1.1 Simple graph-traversal algorithms
    Be able to trace breadth-first and depth-first search algorithms and describe
    typical applications of both.

    Breadth-first: shortest path for an unweighted graph.

    Depth-first: Navigating a maze.

    4.3.2 Tree-traversal
    4.3.2.1 Simple tree-traversal algorithms
    Be able to trace the tree-traversal algorithms:

    pre-order

    post-order

    in-order

    4.3 Fundamentals of algorithms 1


    Be able to describe uses of tree-traversal algorithms.

    Pre-Order: copying a tree.

    In-Order: binary search tree, outputting the contents of a binary search tree
    in ascending order.

    Post-Order: Infix to RPN (Reverse Polish Notation) conversions, producing a


    postfix expression from an expression tree, emptying a tree.

    4.3.3 Reverse Polish


    4.3.3.1 Reverse Polish – infix transformations
    Be able to convert simple expressions in infix form to Reverse Polish notation
    (RPN) form and vice versa. Be aware of why and where it is used.

    ℹ Eliminates need for brackets in sub-expressions.

    Expressions in a form suitable for evaluation using a stack.

    Used in interpreters based on a stack for example Postscript and


    bytecode.

    4.3.4 Searching algorithms


    4.3.4.1 Linear search
    Know and be able to trace and analyse the complexity of the linear search
    algorithm.

    Time complexity is O(n).

    4.3.4.2 Binary search


    Know and be able to trace and analyse the time complexity of the binary search
    algorithm.

    Time complexity is O(log n).

    4.3.4.3 Binary tree search

    4.3 Fundamentals of algorithms 2


    Be able to trace and analyse the time complexity of the binary tree search
    algorithm.

    Time complexity is O(log n).

    4.3.5 Sorting algorithms


    4.3.4.1 Linear search
    Know and be able to trace and analyse the complexity of the linear search
    algorithm.

    This is included as an example of a particularly inefficient sorting algorithm, time-


    wise. Time complexity is O(n2 ).

    4.3.4.2 Binary search


    Know and be able to trace and analyse the time complexity of the binary search
    algorithm.

    The 'merge' sort is an example of 'Divide and Conquer' approach to problem


    solving. Time complexity is O(n log n).

    4.3.6 Optimisation algorithms


    4.3.6.1 Dijkstra’s shortest path algorithm
    Understand and be able to trace Dijkstra’s shortest path algorithm.

    Be aware of applications of shortest path algorithm.

    ℹ Students will not be expected to recall the steps in Dijkstra's shortest path
    algorithm.

    4.3 Fundamentals of algorithms 3

    You might also like