Data Structures and Algorithm Analysis (CSC317)

home
syllabus
problem sets
practicum


Fall 2019
Instructor: Odelia Schwartz (odelia at cs dot miami dot edu) and Dilip Sarkar.
NOTE: Taught by Dilip Sarkar until September 19th.
Information available on Blackboard.
Tues, Thurs 8am - 9:15AM; Whitten LC 170
TA: Jerry Bonnell (j dot bonnell at miami dot edu)
Jerry will run two 2-hour problem-solving sessions. Time and room TBA.
Xu Pan (xupan at miami dot edu)
(CSC401 TA: Brian Manolovitz, bmm157 at miami dot edu)

This is a course on algorithmic thinking. You will learn how to think about problems from the point of view of machine procedures to solve the problem. You will be given techniques to break a problem down, to notice its combinatorial difficulties, to reason about correctness, and to measure the efficiency of a solution. You will learn how to recognize the inherent complexity of a problem - the best possible efficiency that a problem can be solved.

The course does not require programing. The course is more about thinking about code, than writing code. However, the Practicum does Javascript programming and dynamic HTML to create creative animations of the algorithms presented in the course. The Practicum is self-study, and highly recommended. In the practicum you will learn the basis of in-browser programming, and exercise your coding skills for algorithms.

General:
  • The required textbook is Introduction to Algorithms (3rd edition), Cormen, Leiserson, Rivest and Stein.
  • Extracurricular (optional) reading: Algorithms to live by. The Computer Science of Human Decisions. Brian Christian and Tom Griffiths.
  • TA lab hours: TBA. Ungar 310T (Projects lab).
  • The course assigns weekly problem sets, posted and due on BlackBoard.
  • There are 6 quizzes and no final exam.
  • Grading is 40% homeworks, 60% quizzes.
 

KEY DATES:
 
+ web design: Ruben Coen Cagli _ last update by Odelia: 12.2014 +