Computer Science

CS701 CS702 CS703 CS704 CS706 CS707 CS708 CS709 CS710 CS711 CS712 CS713 CS716 CS718 CS720 CS721 CS723 CS724 CS726 CS601 CS602 CS604 CS605 CS606 CS607 CS609 CS610 CS614 CS615 CS619 CS501 CS502 CS504 CS506 CS507 CS508 CS401 CS402 CS403 CS408 CS410 CS411 CS301 CS302 CS304 CS311 CS312 CS201 CS206 CS101

CS502 - Fundamentals of Algorithms
Course Page	Mcqs	Q & A	Video	Downloads

Course Category:	Computer Science/Information Technology
Course Level:	Imdregraduate
Credit Hours:	3
Pre-requisites:	CS401

Course Synopsis

This course is designed to provide students with an understanding of the principles and techniques used in the design and analysis of algorithms. The course is primarily theoretical and does not require programming, but it does require understanding of the notion of a mathematical proof and some knowledge of elementary discrete mathematics. We will discuss and analyze a variety of data structures and algorithms chosen for their importance and their illustration of fundamental concepts. We will emphasize analyzing the worst-case running time of an algorithm as a function of input size. We will also spend some time exploring the boundary between feasible computations, taken to be those doable in polynomial time, and infeasible computations

Course Learning Outcomes

At the end of this course you should be able to :

Analyze the worst-case running time of an algorithm as a function of input size
Solve Recurrence relations
Understand and implement Divide and Conquer strategy
Understand the concepts of Dynamic programming
Understand the concepts of Greedy Algorithm
Understand the concepts of Graph traversing
Understand and explain basics of Complexity theory

Course Contents

Analyzing the worst-case running time of an algorithm as a function of input size, solve recurrence relations, Basics of Divide and Conquer strategy, Understand the concepts of Dynamic programming, Understand the concepts of Greedy Algorithm, Understand the concepts of Graph traversing, Understand the concepts of MST and their algorithms, Understand the algorithms for computing shortest path, Basics of Complexity theory.