COT 5407 Introduction to Algorithms
Fall 2018 Tuesday/Thursday 5:00PM - 6:15PM Green Library 139

Instructor:
Leonardo Bobadilla
Assistant Professor
bobadillacs.fiu.edu
Office:ECS 212b
Phone: 305-348-7565
Office Hours:
Tuesday/Thursday 3:30 pm-4:45 pm or by appointment.


Teaching Assistant:

cs.fiu.edu
Office: ECS
Phone:
Office Hours:

(Disclaimer: All information on this page about the course is tentative and subject to further changes.)

Prerequisites

SCIS Graduate Standing, useful classes: Data Structure, Computer Programming, Probability

Course Outline

  • Recurrence relations and Analysis of Algorithms
  • Divide and Conquer
  • Randomized Algorithms
  • Sorting and Order Statistics
  • Data Structures: Trees, Hash Tables
  • Graph and Graph Algorithms
  • Dynamic Programming and Greedy Algorithms
  • NP Completeness (Optional)

Textbooks and Materials

Required Book:

  • Title: Introduction to Algorithms
    Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
    Edition: Third Edition
    Publisher: MIT Press, 2009
Other Recommended Books
  • Algorithm Design by Jon Kleinberg and Eva Tardos (Addison-Wesley, 2005).
  • Algorithms by Sanjoy Dasgupta, Christos Papadimitriou, and Umesh Vazirani (McGraw-Hill, 2006)
  • Jeff Erickson's Algorithms Notes: link

Grading

Class attendance is highly encouraged. In addition, occasional quizzes may be given in class. You should read the corresponding sections on the book and be able to actively participate in class discussions. There will two midterm exams and one final exam. You will be responsible for all material covered in lectures, homeworks, and assigned readings. The various components of the course will be weighted as follows:

Homework assignments 15%
First midterm 25%
Second midterm 25%
Final exam 30%
Quizzes and class participation 5%

Exams

The only excuse for missing an midterm exam is verifiable cases of illness and emergencies and religious holidays. Please check the dates for exams and inform me at the earliest of any conflict due to the above-mentioned reasons. Final exams dates are asigned by the University.

Homeworks

Solving problems is a fundamental part of the course. Success in the class depend on the effort put in solving the homework problems. Try to think about the problems individually before discussing them with a group partner. Also, I would encourage you to think about other problems in the text whether they are assigned or not.
There will be a homework assignments every other week during the semester. Homeworks are due at the start of the class . For the homeworks, you can work in pairs or individually. Please put your name and panther ID at the top of the homework. If you work in a pair, submit one copy with both names at the top.
Please cite all the sources (books, webpages, etc) that you use for solving your homework.

Attendance

I expect you to regularly attend class and participate in discussions.

Assignments

Announcements

  • August 21: Class website is up.

Schedule:

  • Lecture 1 (Aug. 21): Introduction, Insertion Sort (Chapter 1, 2)

Code of Academic Integrity:

University Policies:

For academic misconduct, sexual harassment, religious holidays, and information on services for students with disabilities, see :
  • Make-up Exam Policy. The midterms are an important component of the class. If for some grave circumstances you can not attend, you must contact me beforehand (email is OK) and later provide documentation of why you could not attend the exam. Only serious personal circumstances will be accepted as valid excuses. The make-up exam will be given on the final's week.