Computer Science 501
Data Structures and Algorithm Analysis

Fall 2014, The College of Saint Rose

Home     Syllabus     Schedule     Style Guide

Agenda

• Welcome to Computer Science 501!
• Why take this course?
  • What is an algorithm?
  • Why study algorithms?
  • Sample problems
• Syllabus and administrative details
• Computer account setup on mogul.strose.edu
• SubmissionBox setup

  We will be using a system called "SubmissionBox," developed by software engineering students here at Saint Rose, for the submission of most of your work this semester. We'll start by making sure everyone can log in and submit a test assignment.

  Once your SubmissionBox account is ready to go, create a document (a plain text or Word document, for example) and save it somewhere on your computer. Then log into SubmissionBox, and submit this document under assignment "SBTest". Verify that you received an email confirmation for this submission.

• Example algorithm: Greatest Common Denominator
• Java and Object-Oriented Programming Review
• Pre-course evaluation
• Lab 1: Conway's Day of the Week Calculator [HTML] [PDF]

Readings and References

• Bailey Ch. 0, 1, 2

Terminology

• algorithm
• deterministic/non-deterministic
• finiteness
• correctness
• efficiency
• algorithm design
• algorithm analysis
• lower bound
• optimality
• Euclid's algorithm
• precision
• robustness
• adaptability
• reusability
• abstraction
• virtual machine
• Java application
• compilation
• Java bytecode
• Javadoc
• methods
• mutator
• accessor
• fields/instance variables
• encapsulation
• constructor
• helper method

Examples

• Late penalty graph:
  
• Hello
• UnitPrice

Links

• Hello, World! programs