Moin Mostakim
Instructor member #1
From this course, students will learn about some basic types of algorithms used in computer science. They will mainly learn different sorting and searching algorithms, graph algorithms, greedy and dynamic programming algorithms. In addition, they will gather knowledge about analyzing the complexity of any algorithmic problem. This course will help the students to develop an understanding of how to solve a problem by first mapping it to any known algorithm or problem domain. .
Given the analytical nature of the course, most of the classes will be modeled as lectures given by the instructor, juxtaposed with questions and clarifications from the students. Students will be required to do a significant amount of reading. For best results, students should read the textbook prior to coming to class, actively listen in the lectures, and revise the topics once they go back from class. A list of topics to be covered, along with an expected timeline, will be provided in class in order to facilitate this.
Books to be followed:
#1 CLRS - Introduction to Algorithms, By Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. ISBN: 9780262033848
#2 HSR - Computer Algorithms, By Ellis Horowitz , Sartaj Sahni, Sanguthevar Rajasekaran. ISBN: 9780929306414
Students must pass CSE220 Data-Structures course.
Instructor member #1
Instructor member #2
Instructor member #3
Instructor member #4
Instructor member #5
Instructor member #6
Instructor member #7
Instructor member #8
Instructor member #9
Instructor member #10
Instructor member #11
The Open edX platform works best with current versions of Chrome, Edge, Firefox, Internet Explorer, or Safari.
See our list of supported browsers for the most up-to-date information.