Scribd Logo
Upload

Welcome to Scribd!

  • Csc311 Analysis and Design of Algorithms

    Uploaded by

    Kamau Gabriel
    19 views1 page
    This document outlines the learning outcomes, content, prerequisites, and delivery for the CSC311 Analysis and Design of Algorithms course. The course aims to teach students how to analyze the time and space complexity of algorithms, solve algorithmic problems using techniques like divide-and-conquer and dynamic programming, and understand algorithm design approaches. Students will analyze sorting, searching, graph, and other algorithms and learn about complexity classes and algorithmic problem solving.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines the learning outcomes, content, prerequisites, and delivery for the CSC311 Analysis and Design of Algorithms course. The course aims to teach students how to analyze the time and space complexity of algorithms, solve algorithmic problems using techniques like divide-and-conquer and dynamic programming, and understand algorithm design approaches. Students will analyze sorting, searching, graph, and other algorithms and learn about complexity classes and algorithmic problem solving.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    19 views1 page

    Csc311 Analysis and Design of Algorithms

    Uploaded by

    Kamau Gabriel
    This document outlines the learning outcomes, content, prerequisites, and delivery for the CSC311 Analysis and Design of Algorithms course. The course aims to teach students how to analyze the time and space complexity of algorithms, solve algorithmic problems using techniques like divide-and-conquer and dynamic programming, and understand algorithm design approaches. Students will analyze sorting, searching, graph, and other algorithms and learn about complexity classes and algorithmic problem solving.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    CSC311 ANALYSIS AND DESIGN OF ALGORITHMS

    Learning Outcomes

    Appreciate the upper, lower and average running time and space complexity of
    algorithms.

    Represent the time and space complexity of algorithms using asymptotic notations.

    Derive the time and space complexity of algorithms.

    Deduce recurrence relations that describe the time complexity of recursively de.ned
    algorithms.

    Solve elementary recurrence relations.

    Understand different approaches to design of algorithms.

    Use different algorithm design techniques to solve problems.

    Content
    Worst and average case analysis; Asymptotic Notations; Standard complexity classes; Efficient
    algorithms for sorting, searching, and selection; Recurrences; binary search trees, heaps, hash
    tables, red-black trees; graph problems: Graph traversal minimum-cost spanning tree,
    connected components, topological sort, and shortest paths; Algorithm design techniques:
    BruteForce Algorithms, divide-and-conquer, dynamic programming; NP Complete problems
    Pre-requisites

    CSC113 Discrete Mathematics

    CSC211 Data structures and Algorithms

    Delivery
    Lectures, Tutorials and Labs.

    You might also like