Computer Science 385
Design and Analysis of Algorithms

Spring 2019, Siena College

Home     Syllabus     Schedule

Agenda

• Welcome to Algorithms!
• Announcements
  • Please bring laptop computers, to labs if you have them, sometimes helpful for lectures too
  • Please complete Lab 0: GitHub Setup as soon as you have a chance, and before you watch the video mentioned below about the start of our graph implementations since you'll need your GitHub account for that - feel free to ask when you're stuck
  • Before class on Friday: read Levitin sections 1.2, 1.3, 1.4, 2.3 and watch the video about the start of our discussion of graph data structures (see your email for the links to create your repository and to access the video)
• What is this course about?
• Syllabus and roll call
• A quick Kahoot-based review "quiz"
• Pseudocode

Terminology

• algorithm
• inputs/outputs
• precise
• deterministic
• non-deterministic
• finiteness
• correctness
• verifying correctness
• proofs
• generality
• efficiency
• theoretical
• practical
• design and anaylsis
• lower bounds
• optimal
• impossible
• pseudocode