Scribd
Upload
47 views2 pages

Fundamentals of Algorithums-Outline BCS 2016

This document outlines the course Fundamentals of Algorithms, Spring 2016. It provides information on the instructor, course content, topics, books, and evaluation. The objective is to teach students structures and schemes to efficiently manipulate, store, and retrieve data as well as concepts of time and space complexity. Topics include basic data structures, algorithms, complexity analysis, and graph algorithms. Evaluation will be based on assignments, a midterm, and final exam. The course policies specify requirements for attendance, assignments, and academic honesty.

Uploaded by

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

Fundamentals of Algorithums-Outline BCS 2016

This document outlines the course Fundamentals of Algorithms, Spring 2016. It provides information on the instructor, course content, topics, books, and evaluation. The objective is to teach students structures and schemes to efficiently manipulate, store, and retrieve data as well as concepts of time and space complexity. Topics include basic data structures, algorithms, complexity analysis, and graph algorithms. Evaluation will be based on assignments, a midterm, and final exam. The course policies specify requirements for attendance, assignments, and academic honesty.

Uploaded by

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

Fundamentals of Algorithms, Spring 2016

Course Outline

Instructor: Afsah Imtiaz Elahi email: [email protected]


Office Hours: 10:00 am to 3:00 pm . Monday to Thursday
Course Content: https://sites.google.com/site/fundofalgoiub

Objective of the Course


The course is designed to teach students structures and schemes, which allow them to write programmes to
efficiently manipulate, store, and retrieve data. Students are exposed to the concepts of time and space complexity of
computer programmes.

Books and References

Text Books:
Introduction to Algorithms
by T.H. Cormen, C.E. Leiserson, and R.L. Rivest, 3rd edition, McGraw-Hill, 2001.
Reference Books:
Introduction to the design and analysis of algorithms, by Anany Levitin 2nd Edition , Pearson.
Fundamentals of Algorithms, by G.Brassard and P.Bratley, Prentice Hall, 1996.
Computer Algorithms, by Horowitz, Sahni, and Rajasekaran, Computer Science Press, 1996.
Algorithms, by Sedgewick, Addison-Wesley.

Course Topics

 Introduction to basics of algorithms


 Introduction/Mathematical Foundations (Chapters 1, 3, Appendix A)
 Introduction to Flowcharts & pseudopods
 Basic Data Structures
o arrays,
o stacks,
o queues,
o priority queues,
o link lists,
o trees,
o spanning trees)
 Graphs and Traversals.
 Recursion, sorting and searching algorithms,
 Intro to Sorting Algorithms (Chapter 2)
 More on Sorting Algorithms (Chapters 6-9)
 Searching Algorithms (Chapters 11-14)
 Shortest path algorithms,
 Hashing, Storage and retrieval properties and techniques for the various data structure
 Algorithm Complexity,
 Polynomial and Intractable Algorithms,
 Classes of Efficient Algorithms,
 Recurrences (Chapter 4)
 Divide and Conquer, Dynamic, Greedy
 Dynamic Programming (Chapter 15)
 Greedy Algorithms (Chapters 16)
 Graph Algorithms (Appendix B4, Chapters 22-25)

Course Outline Page 1 of 2


Evaluation:

Assignments/Quizzes/Presentation: 20 Mid Semester Evaluation: 30 Final Semester Evaluation: 50


Total: 100 points

Course Policies

Lecture slides, homework assignments, and other useful information will be posted on the course web page. Regular
attendance is highly recommended. If you miss a class, you are responsible for all material covered or assigned in
class. Discussion of the assignments is allowed and encouraged between students. However, each student would be
expected to do his/her own work. All deliverables (Assignments) are expected 100% on time. If the deliverable is not
submitted on due date, there will be a penalty of 20%. It will not be accepted once the deliverable has been
returned / discussed in class. Please discuss any issues in a timely manner – no consideration will be given at the end
of the course. Assignments which are too similar will receive a zero. No late homework or project report will be
accepted. If you are unable to hand in your homework or project report by the designated deadline, you must notify
me before the deadline. No incomplete grades will be given, missed quiz/exam may be made up only if it was missed
due to an extreme emergency.

Important Note: Plagiarism will result in an F.

Course Outline Page 2 of 2

You might also like