Course Information
Course Code
BCS401
Credits
03
Total Hours
40 hours
Examination
Theory (3 hours)
Sponsored Advertisement
Course Objectives
- To learn the methods for analyzing algorithms and evaluating their performance.
- To demonstrate the efficiency of algorithms using asymptotic notations.
- To learn the concepts of P and NP complexity classes.
- To solve problems using various algorithm design methods, including brute force,
Course Modules
Exam Paper Scheme Of Valuation
Design and Analysis of Algorithm - BCS401
Module 1: INTRODUCTION
Topics: What is an Algorithm?, Fundamentals of Algorithmic Problem Solving..
Module 2: BRUTE FORCE APPROACHES (contd..)
Topics: Exhaustive Search (Travelling Salesman probem and Knapsack Problem).
Module 3: TRANSFORM-AND-CONQUER
Topics: Balanced Search Trees, Heaps and Heapsort..
Module 4: DYNAMIC PROGRAMMING
Topics: Three basic examples, The Knapsack Problem and Memory Functions,.
Module 5: LIMITATIONS OF ALGORITHMIC POWER
Topics: Decision Trees, P, NP, and NP-Complete Problems.