Computer Science 431
Algorithms
Spring 2015, The College of Saint Rose
Lecture 1: Introduction and Overview
Date: Monday, January 12, 2015
Agenda
- Welcome to Computer Science 431!
- Why take this course?
- Syllabus and administrative details
- SubmissionBox and mogul.strose.edu
- Pseudocode
- Problem Set 1: Data Structures [HTML] [PDF] out
Lecture 1 Assignment
Due at the start of class, Wednesday, January 14.
Please submit answers to these questions
in Submission
Box under "LA1" or in hard copy by the
start of our next class. We will discuss these questions at the
start of class, so no late submissions are accepted. Please be sure
that your name is clearly indicated in all submissions.
- Levitin Exercise 1.1.6, p. 8 (4 points).
- Levitin Exercise 1.1.8, p. 8 (4 points).
Terminology
- algorithm
- inputs/outputs
- precision
- deterministic/non-deterministic
- finiteness
- correctness/verification/proofs
- general
- efficiency
- theoretical and practical
- design and analysis of algorithms
- lower bounds
- optimality
- pseudocode