Scribd
Upload
32 views2 pages

Design and Analysis of Algorithm Uptodate

Uploaded by

t4zbrhcw6c
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
32 views2 pages

Design and Analysis of Algorithm Uptodate

Uploaded by

t4zbrhcw6c
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Institute of Computer Science/Information Technology (ICS&IT)

Faculty of Management Sciences & Computer Sciences (FMCS)


The University of Agricultural Peshawar

Program: BS(CS)-IV
Course Title Design & Analysis of Algorithms
Course Code: CSC-411
Credit Hours: 03
Course Week: 16
Total Credit Hours: 48

Course Objectives:

Desgin and Analysis of Algorithms (CSC-411) is a core course of Computer


Science, which aims to introduce the fundamental techniques for designing and
anlyzing different algorithms. After taking this course the students will be able to use
different techniques such as Divide and Conqure, Dynamic Programming, and Greedy
Approach to different types of algorithms. Moreover, they will be able to compare the
efficiency of different algorithms for a problem.

Week 1:
- Introduction to Algorithms
- What is a problem?
- How to write an algorithm?
- Analysis of algorithms

Week 2:
- Searching Algorithms
o Sequential Search
o Binary Search
- Importance of Developing Efficient Algorithms

Week 3 and 4:
- Analysis of Algorithms
o Time Complexity
o Basic Operation and Input Size
o Order of Complexity Functions
o Growth Rate of Complexity Functions
o Categories of Complexity Functions
o Asympotatic Notations

Week 5 and 6:
- Sorting Algorithms
o Insertion Sort
o Merge Sort
o Quick Sort
o Exchange Sort

Spring Semester 2022 Page 1 of 2


Week 7 and 8:
- Recurrence Algorithms
- Divide and Conqure
o Binary Search Algorithm
o Merge Sort Algorithm
o Quick Sort Algorithm

Week 9 and 10:


- Complexity of Recurrance Algorithms
o Recursion Tree Method
o Substitution Method
o Master Theorem Method

Week 11 and 12:


- Dynamic Programming
o Fibonacci Sequence
o Edit Distance Algorithm
o Matrix Chain Multiplication

Week 13 and 14
- Introduction to greedy approach
o Prim’s Algorithms
o Kruscal’s Algorithm
o Dijkstra’s Algorithm

Week-15
- Introduction to backtracking
o The sum of subset problem
o Graph coloring

Week-16
Revision

Total Marks: 100

Recommended Readings:
1. Foundation of Algorithms using C++ Pseudocode Second Edition
By: Richard E. Neapolitan, Kumarass Naimipour
2. Introduction to Algorithms
By: Thomas H. Coremen
3. Websites those contain algorithms and research papers

Spring Semester 2022 Page 2 of 2

You might also like