CS 312 Home Page

Introduction to Algorithms

Fall 2020

This course covers the design, operation, and running time analysis of a wide array of algorithms. This includes the study of algorithms that follow these paradigms: divide-and-conquer, dynamic programming, randomized algorithms, and greedy algorithms. Algorithms examined include many for searching and sorting; insertions, lookups, and deletions in various data structures; and common graph algorithms. Prerequisites: CS 221 and CS 171.

Further Information

The Course Syllabus
Textbook errata
MIT's freely available 2005 algorithms course
MIT's freely available 2015 algorithms course
Online Text: Software Design Using C++
Guidelines on Formatting and Documenting C++ Programs
The 2018 newly-revised ACM Code of Ethics and Professional Conduct
See especially sections 1.6 on privacy issues.
Software for Saint Vincent CIS Students includes information on obtaining Microsoft software such as Visual Studio.
CPlusPlus.com is a good place to look up various C++ functions, etc.
VisualGo, an algorithm visualization site.
Other items of interest:
- Anita Borg Institute (women in technology)
- Hidden Figures the book and movie show early computers -- people -- who calculated orbits and learned to program -- in Fortran.
- Documents, homilies, and speeches of Pope Francis

Studying and Homework

Take a few minutes to watch these short videos: How to Study by cognitive psychogist Stephen Chew. It could help you in this class and others!
Assignments will be posted in Schoology.
Log into Schoology often to see what you have due soon.

Exams

Information on exams, such as when they will be and what they will cover, will be posted in Schoology.

Instructor: Br. David Carlson

Maintained by: Br. David Carlson
Last updated: August 07, 2020
Disclaimer


Computing & Information Systems Department		Search CIS Site Tutorials