![]() |
Dr. Jody Paul – Education – MSCD Courses Algorithms & Algorithm Analysis |
| jody@acm.org | ||
| Title: | Algorithms & Algorithm Analysis |
| Institution: | Metropolitan State College of Denver |
| Course ID: | CS 4050 |
| Semester [CRN]: | Fall 2006 [55217] |
| Meeting Times: | MW 7:00 PM - 8:50 PM |
| Location: | SI-136 |
| Credit Hours: | 4 |
| Prerequisites: | CS 3210, CS 3240, MTH 3210 Students are expected to know the basic concepts of programming (e.g. loops, pointers, recursion), discrete mathematics (e.g., proof methods, sets), basic data structures (e.g., lists, stacks, queues, trees, heaps, graphs), algorithm analysis techniques, computational theory (e.g., automata, grammars, computability, complexity) and calculus (e.g., logarithms, differentiation, integration). |
| Course Website: | http://www.jodypaul.com/cs/alg |
| Course Support: | http://www.jodypaul.com/moodle/ |
| Instructor: | Dr. Jody Paul (schedule & office hours) |
| E-mail: | jody@cse.mscd.edu |
| Office: | Science 133C (x68435) |
| Campus Mail: | Campus Box 38 |
| The emphasis of this course is on the design, analysis, and evaluation of efficient algorithms for a wide variety of computing problems. |
Algorithm Design
by J. Kleinberg & E. Tardos
Addison Wesley, 2006
ISBN 0321295358
[Amazon.com]
Java Resources:
Java 5.0 API Documentation —— Java 5.0 (J2SE/JDK 5.0)
Code Conventions for Java (Sun)
Connectivity:
You must have World Wide Web access, an MSCD student e-mail account and computing facilities for developing programs in Java. Note that you receive an e-mail account, Internet/Web access and appropriate computing facilities by virtue of being a student at MSCD (see: http://www.mscd.edu).
| You are expected to participate in class discussions and
in-class exercises. There are no "make-ups" for missed in-class activities and exercises.
Significant information will be disseminated during class sessions or on course web pages that you will be responsible for knowing whether or not you attended the sessions or accessed the website. That is, not all information necessary to successfully complete the assignments or examinations is covered in the textbook. Your final course grade is determined by combining your scores on exams. Your letter grade will be no lower than that computed by the following distribution of points and weighted average conversion to letter grade:
Missing the final exam will result in a course grade of F. Make-up exams will not be accommodated without prior arrangement and written agreement. Unforeseeable crises and emergency situations will be dealt with on a case-by-case basis in accordance with MSCD, College, and Departmental policies. CollaborationI encourage collaboration and regard it as essential aspect of Computer Science. Collaboration and discussion with fellow students concerning course information, materials, assignments, and studying for exams is encouraged. You are not expected to learn the course content or work on assignments in isolation on your own. Note that collaboration is not acceptable during any exam. |