Scribd
Upload
45 views

Csc311 Analysis and Design of Algorithms

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.

Uploaded by

Kamau Gabriel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
45 views

Csc311 Analysis and Design of Algorithms

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.

Uploaded by

Kamau Gabriel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 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