Messages
- Oct. 26, 2017: webpage draft created.
Learning outcomes and competences
After attending this course, participants should be able to
Given an algorithm, analyze its correctness and running time.
Given a problem, design a correct and efficient algorithm for it, express it in a form that a programmer can easily convert into code.
Have an idea about what problems are intractable, and basic algorithms for those that are tractable.
Know the mathematical techniques that you will need to analyze your algorithms.
Course summary
In this course we will discuss some basic techniques for algorithm design and analysis, including:
1. Sorting and searching
2. Divide-and-conquer
3. Dynamic programming
4. Greedy algorithms
5. Graph algorithms
6. NP-completeness
Detailed list of topics is available in the course schedule below.
Lecturer
Qin Zhang
Office hour: Wednesday 3pm-4pm, LH430A
Email: qzhangcs@indiana.edu
Time and place
1:00pm-2:15pm Monday/Wednesday, Ballantine Hall 305
Texbooks
Required Textbook: [KT] Algorithm Design, J. Kleinberg, E. Tardos. Pearson Education.
Supplementary Textbook: [CLRS] Introduction to algorithms, T. Cormen, C.Leiserson, R. Rivest, C. Stein. 3rd edition. MIT
Course schedule
(subject to adjustments as we go along; [KT] denotes the textbook by Kleinberg and Tardos).
Grading
Assignments 20%
About six written assignments. Assignments are posted in Canvas, and are due before class on the due date, in hard copy. If you can, typeset in your favorite software and bring printed hard copy to class. If you are handwriting, make sure it is legible.
No extensions or late homeworks will be granted.
Projects 15%
You will be asked to solve a question from HackerRank website. You will have the choice over which programming language to use. You will write a report for your experience. Details can be found in this instruction.
Exams 65%
(1) Mid-term 30%
(2) Final 35%
There will be NO make-up exams. If students have to miss the in-class midterm exam due to family/medical emergencies (and/or other reasons which will be granted on a case by case basis), they need to contact the instructor before the exams for permission, and their other exam grades will be re-weighted. Internship and job application interviews and paper deadlines are NOT proper reasons to miss an exam.
Course policies
For assignments, students may discuss answers with anyone, including problem approaches and proofs. But all students must write their own proofs, and write-ups. The names of all people that you have talked to should be listed at the beginning of the first page. If a solution comes from existing papers/web/books, they must be properly cited, and you must write the solution in a way that demonstrates your understanding (simply copying the solution will be considered as plagiarism, and will result an "F" for the entire course). All deadlines are firm. No late assignments will be accepted unless there are legitimate circumstances.
For more details, see Indiana University Code of Student Rights, Responsibilities, and Conduct.
Prerequisites
CSCI-C241 "Discrete Structures for Computer Science", CSCI-C343 "Data Structures", and MATH-M 216 "Analytic Geometry and Calculus II" (or MATH-M 212 CALCULUS II). The prerequisites are enforced.