This document outlines a course on design and analysis of algorithms. It provides the course code, prerequisites, semester, description, objectives, and outlines chapters on algorithm analysis techniques, divide and conquer algorithms, greedy algorithms, dynamic programming, and backtracking.
This document outlines a course on design and analysis of algorithms. It provides the course code, prerequisites, semester, description, objectives, and outlines chapters on algorithm analysis techniques, divide and conquer algorithms, greedy algorithms, dynamic programming, and backtracking.
This document outlines a course on design and analysis of algorithms. It provides the course code, prerequisites, semester, description, objectives, and outlines chapters on algorithm analysis techniques, divide and conquer algorithms, greedy algorithms, dynamic programming, and backtracking.
This document outlines a course on design and analysis of algorithms. It provides the course code, prerequisites, semester, description, objectives, and outlines chapters on algorithm analysis techniques, divide and conquer algorithms, greedy algorithms, dynamic programming, and backtracking.
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 3
Course Title: Design and Analysis of Algorithms
Course Code: CoSc3094
Prerequisite: Data Structure and Algorithms (CoCs2095) Year: III Semester: I
Course Description The course focuses on the design and analysis of algorithms. Topics Include: Re- view of the basic data structures; Design techniques: divide-and-conquer, dynamic programming, greedy algorithms, And graph algorithms: Elementary graph algo- rithms, Breadth-first search (BFS), Depth-first search (DFS), Strongly-connected com- ponents, Minimum spanning tree, Shortest paths.
Course Objectives By the end of this course, students will be able to:
• Perform algorithm analysis using the different techniques;
• Demonstrate the use of algorithm design techniques; and • Describe the basics of computational complexity • Apply advanced searching and sorting algorithms • Develop, and reason about the correctness and performance of algorithms, in particular for string • Searching and graph manipulation
Course Outline Chapter 1: Introduction and Elementary Data Structures (6hr)
1.1 Introduction to Algorithm analysis
1.1.1. Asymptotic Notations 1.1.2. Analysis of Algorithm 1.2. Review of elementary Data Structures 1.2.1. Heaps 1.2.2. Hashing 1.2.3. Set Representation 1.2.3.1. UNION, FIND Operation
Chapter 2: Divide and Conquer (6hr)
2.1. The General Method of Divide and Conquer
2.2. Binary Search 2.3. Finding Maximum and Minimum 2.4. Merge Sort 2.5. Quick Sort 2.6. Selection Sort
Chapter 3: Greedy Algorithms (6hr)
3.1. General Characteristic of Greedy Algorithms
3.2. Graph Minimum Spanning Tree (MST) - Kruskal’s and Prims’s Algo- rithms 3.3. Shortest Paths 3.4. Scheduling
