CSE 8833

ALGORITHMS

Prof. Ioana Banicescu.

HOURS:

CLASS: Tue/Thu 3:30 - 4:45, Butler 103.

OFFICE: 320 Butler Hall, Tue/Thu 2:30 - 3:30 PM by appointment only. Email: ioana at cse dot msstate dot edu

325-2756

OBJECTIVES:

The objective of this course is to provide a solid foundation for the classical theory of algorithms and to cover some of the most important recent algorithmic developments. The goal is to familiarize the students with the general methodology and specific techniques used in the analysis of algorithms. The course is focused on theoretical aspects of algorithms' complexity, as well as on the analysis and evaluation of their effectiveness and limitations. The course examines a variety of theoretical issues that have important practical consequences in the design of algorithms. We emphasize the importance of asymptotic analysis and the common methodology used in the analysis of algorithms. We analyze the factors that influence the time and space complexity of algorithms and their implications on applications of interest. We survey major strategies in algorithms' design and the complexity analysis of various algorithms. Models for computation will be studied, and critically evaluated. The complexity and limitations of these models will also be discussed. In view of the recent advances in computer and network technology, the students will also be exposed to main concepts from the theoretical foundations of parallel and distributed algorithms.

REFERENCE BOOK:

Handouts from these books, or other related books and papers, will be provided and/or recommended as references.

RECOMMENDED SELECTED READINGS FROM:

PREREQUISITES:

The required prerequisites are listed in the official university bulletin.

COURSE REQUIREMENTS:

There will be several assignments/quizzes, test exams, a final comprehensive exam and a research/term paper or project report of your choice. The final grade will be based on all of the above (assignments and/or test exams: 40%, comprehensive exam: 40%, research/term paper or project report: 20%).

COURSE OUTLINE:

The course will cover material from the following topics:

Fundamentals: asymptotic analysis,design and analysis of sequential algorithms(average case and amortized analysis, solving recurrences).

Major Design Strategies: divide-and-conquer, greedy method, dynamic programming, backtracking and branch-and-bound.

Analysis of a few sequential and parallel algorithms of interest (sorting, graph, matrix, search algorithms for discrete optimization, dynamic programming, and others).

Computational complexity (space-bounded class, time-bounded class, P-complete problems, NP-complete problems, NP-hard problems, nondeterministic algorithms, etc), and circuit complexity.

Probability and average complexity of algorithms; Heuristic and approximate algorithms.

Introduction to Lower Bound Theory.

Complexity analysis of parallel algorithms.

Models of parallel computation and their limitations.

Space-Time tradeoffs and Memory-Hierarchy tradeoffs.

ACADEMIC HONESTY, ETHICS IN RESEARCH AND SCHOLARLY ACTIVITIES:

Students are expected to follow MSU as well as the CS department's policies on academic misconduct and on academic honesty with regard to homeworks, projects, exams, papers. These policies can be found on the MSU ethics in research and other scholarly activities and Computer Science and Engineering Departmental policy regarding professional conduct pages, respectively. Also, as of fall semester 2007, Mississippi State University has an approved Honor Code that applies to all students, and reads as follows: As a Mississippi State University student I will conduct myself with honor and integrity at all times. "I will not lie, cheat, or steal, nor will I accept the actions of those who do". Upon accepting admission to Mississippi State University, a student immediately assumes a commitment to uphold the Honor Code, and accepts responsibility for learning and following the philosophy and rules of the Honor Code. For additional information, please see the following links:.

http://www.cse.msstate.edu/academic-honesty-policy-grads/

students.msstate.edu/honorcode/

ATTENDANCE AND ADD/DROP POLICIES:

Attendance is required. Roll will be taken, and absences will be listed on midterm and final grade reports. Attendance may influence grades at border line. Makeup exams are allowed only in special circumstances where absences are certified by the Dean of Students office. At the beginning of the semester, students are encouraged to also review the Add/Drop policy.

Students who are auditing this course must attend at least 75% of the class lectures to avoid a grade of F.