Course Plan: Algorithm Analysis and Design

‫جامعة األمير سطام بن‬
Prince Sattam bin Abdulaziz

University
College of Arts and Science
Department of Computer
Wadi Al Dawasir, Riyadh, Saudi Arabia
Course Plan
CS 413
Algorithm Analysis and Design
Dr. A.Mohd. Mustaq mustaqm55@yaho

o.co.in
COURSE PLAN\PSAU\WADI-ARTS & SCIENCE\COMPUTER SCIENCE ©-SEPTEMBER 2017 1
Algorithm Analysis and Design
I. Course Identification
Credit Group Level Hours Office Hours
3 419 8 Sun 10- 12Noon Sun 1-3 PM
Tues 8-9 AM Mon8-10 AM
Tues 9-11 AM
Wed 10-12 Noon
Thurs10-12 Noon
II. Course Description

Curriculum Description
This course introduces formal techniques to support the design and analysis of
algorithms, focusing on both the underlying mathematical, theory and practical
considerations of efficiency. Topics include asymptotic complexity bounds,
techniques of analysis, and algorithmic strategies.
Course Objectives
The aim of this module is to learn how to develop efficient algorithms for
simple computational tasks and reasoning about the correctness of them.
Through the complexity measures, different range of behaviors of algorithms
and the notion of tractable and intractable problems will be understood.
Prerequisites
CS 383 – Definite Structures
III. Course Tentative Schedule

Week Topic Assessment
Week 1 Analysis of Algorithm Test 1, Final Exam
Week 2 Insertion Sort, Merge Sort Quiz -1 , Test -1 Final Exam
PAGE 2
Week 3 Correctness of algorithm, Asymptotic Quiz-2, Test-2, Final Exam
Notations, Recurrences
Week 4 Divide and Conquer, Sloppiness Assignment -1, Test-2, Final Exam
Week 5 Quick Sort, Randomized Algorithms Test 2, Final Exam
Week 6 Median, Order Statistics, Heap Sort Test 2, Final Exam
Week 7 Dynamic sets and Priority Queues Test 3, Final Exam
Week 8 Linear-time Sorting, Lower Bounds, Test 3, Quiz 3, Final Exam
Counting Sort and Radix Sort
Week 9 Competitive Analysis. Dynamic Quiz 4, Final Exam
Programming
Week 10 Greedy Algorithms, Graphs, Minimum Test 4,Assignment-2,Final Exam
Spanning Trees
Week 11 Shortest Paths: Dijkstra's Algorithm, Test 5, Final Exam
Breadth-first Search
Week 12 Bellman-Ford, Shortest Paths in Dags, Test 5, Oral-1, Final Exam
Difference Constraints
Week 13 Depth-first Search, Edge Classification, All- Test 6, Final Exam
pairs Shortest Paths.
Week 14 Computational Geometry. Network Flow. Test 6, Final Exam
String Matching, Rabin-Karp Algorithm, NP-
completeness, Approximation Algorithms
IV. Learning Resources

Required Text
 “Introduction to algorithms”, by Thomas H. Coreman,3rd edition, MIT
press London. .
Reference Materials
 “Algorithm’s in C++”, Robert Sedgwick, Christopher, 3rd edition, peter
S. Gordon publications
 “An introduction to the analysis of algorithms”, Robert Sedgwick,
Philippe flajot, Addison Wesley publications.
 Anany Levitin, Introduction to the Design and Analysis of Algorithms,
Pearson Education, 2007
 Sara Baase, Computer Algorithms: Introduction to Design and Analysis,
Third Edition, Addison-Wesley, 2000.
PAGE 3
V. Course Learning Outcomes
No Domain Learning Outcomes
CO 1 Knowledge Clarify the need for using big(O),
omega and theta notation for
performance description. Use these
notation for giving asymptotic lower,
upper and tight bounds on time-
based and space complexity and
determine simple algorithms
complexity and timing.
CO 2 Cognitive Skills Find recurrence-relations that depict
the complicated nature of time about
recursively characterized algorithms.
Portray the idea of recursion and
give samples of its utilization.
Investigate the recursive capacities
and methodology. Identify the time
for the requirement of a recursive
arrangement suitable for an issue.
CO 3 Interpersonal Skills Implement different types of
algorithms and applied them (savage
and Responsibility
power, covetous, partition &
overcome, back-tracking, branch &
bound, and heuristic) by taking
example of common human behavior.
Procedure for numerical estimate to
take care of mathematical issues, for
example, discovering the foundations
of a polynomial.
CO 4 Communication, Plan and execute a fitting hashing
capacity for an application and its
Information
impact on determination algorithm.
Technology, Numerical Discourse about the computational
productivity of the central
Skills
algorithms for categorizing, looking,
and hashing. Find solutions of issues
utilizing the crucial diagram
algorithms, including profundity first
and expansiveness first search,
single source and all-sets most brief
ways, transitive conclusion,
topological sort, and no less than one
PAGE 4
base spreading over tree calculation.
CO 5 Psychomotor skills Case Studies –Converting any
sorting algorithm to programs and
verified in computers.
VI. LEARNING OUTCOMES OF COMPUTER SCIENCE PROGRAM
No. LEARNING OUTCOMES
A Apply the fundamental principles and methods of Computer Science to a wide range of
applications
B Design, Analyze and compare alternative solutions to computing problems
C Apply advanced algorithmic and mathematical concepts to the design and analysis of software
D Describe the principles, concepts, and structured techniques to assess, evaluate, and synthesize
current information and trends in various fields.
E Perform effectively in teams to design and implement solutions to computational problems
F Recognize the social and ethical responsibilities of a professional working in the discipline
G Communicate effectively with a range of audiences
H Locatethe need and an ability to engage in continuing professional development
I Choose current techniques, skills and tools necessary for computing practice
J An ability to apply mathematical foundations, algorithmic principles, and computer science theory
in the modeling and design of computer-based systems in a way that demonstrates
comprehension of the tradeoffs involved in design choices
K An ability to apply design and development principles in the construction of software systems of
varying complexity.
PAGE 5
VII. Assessment Methods
Type CO1 CO2 CO3 CO4 CO5 Distribu

tion
Test 1 2 3 2 2 0 9
Test 2 2 3 2 2 0 9
Test 3 2 3 2 2 0 9
Test 4 2 3 2 2 0 9 VIII.
Test 5 2 3 2 2 0 9
Test 6 2 3 2 2 0 9
Class 1 0 1 1 2 5
Performanc
e
Final Test 7 15 8 10 0 50
Total 100
Relationship to Program Outcomes

No Leaning Program Outcomes
. Outcome A B C D E F G H I J K
1 CO1
2 CO2
3 CO3
4 CO4
5 CO5
Course Outcome
Analysis
Prepared by Checked by
Name:Dr.Mohamed. DrAbdallaAlAmeen
Mustaq
Position:Lecturer Head of the
Department
PAGE 6
Prepared by Checked by
Date:27/Jan/2018 Date:
PAGE 7

Course Plan: Algorithm Analysis and Design

Uploaded by

Copyright:

Available Formats

Course Plan: Algorithm Analysis and Design

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Course Plan: Algorithm Analysis and Design

Uploaded by

Copyright:

Available Formats

‫جامعة األمير سطام بن‬

Prince Sattam bin Abdulaziz

Algorithm Analysis and Design

Dr. A.Mohd. Mustaq mustaqm55@yaho

II. Course Description

III. Course Tentative Schedule

IV. Learning Resources

VI. LEARNING OUTCOMES OF COMPUTER SCIENCE PROGRAM

No. LEARNING OUTCOMES

B Design, Analyze and compare alternative solutions to computing problems

E Perform effectively in teams to design and implement solutions to computational problems

G Communicate effectively with a range of audiences

H Locatethe need and an ability to engage in continuing professional development

Type CO1 CO2 CO3 CO4 CO5 Distribu

Relationship to Program Outcomes

You might also like