This syllabus and schedule are subject to change.

ITSD 4312            Algorithms II (Spring 2005) – CRN 23039

http://cims.clayton.edu/itsd4312

 

Jeff Chastine

E-mail: jeffchastine@mail.clayton.edu

Phone: 770 960 4309

Office: U305

Office hours: “Open door policy” and by appointment – use this!

Course Description

 

An advanced course in the specification and development of complex data structures. Programming projects address the cross-platform nature required of today's business solutions, with emphasis on the graphical user interface and development project using a variety of tools and techniques.

Course Outcomes

 

Students will obtain a proficient level of master in analyzing the efficiency of data structures (2, 3, 4), simulations (10), graph theory (6), greedy algorithms (7), recursion (1), artificial intelligence (5, 8, 9), path planning (7) and how these topics relate to everyday problems.  To demonstrate a superior level of knowledge and understanding, students will design, analyze and implement their own algorithms (10, 12).  Students will be working both individually and in groups.

Course Objectives

Students will obtain a proficient level of master through lecture and programming in the following topics:

  1. Searching
  2. Balanced (red-black) trees
  3. B-trees
  4. Min-max trees
  5. Alpha-beta pruning
  6. Graphs and graph structure
  7. Minimum spanning trees
  8. Single-source shortest path algorithms
  9. A* path planning
  10. Simulations
  11. NP-complete
  12. Approximation algorithms

Prerequisites

 

ITSD4301 (see the DUCK for more info)

 

Meeting Times

 

Lecture             7:30 pm – 10:30 pm Tuesday (U314)

Lab                   On your own time (U314/U315 a useful place to "lurk")

 

Final Exam            Tuesday, 5/4/2003, 8:30 pm – 10:30 pm in U314 (tentative)

Required Textbooks

 

            Introduction to Algorithms 2nd Edition, Cormen, Leiserson, Rivest, & Stein (2001)

ISBN 0-07-013151-1

Assessment

 

You will have numerous opportunities to practice and demonstrate mastery of the materials covered in this course.  It is up to you to keep current on all readings and assignments (including in-class announcements).  If you fall behind, you will most assuredly fail this course!

 

Grading will be based upon the following scale:

 

            A            >= 90%

            B            80% - 90%

            C            70% - 80%

            D            60% - 70%

            F            < 60%

 

Assignment                  Portion of Grade

Final                             30%

Tests (2)                       20% (10% each)

Programs                      50% (I encourage you to use a modern programming environment; Studio.NET & C# are recommended)

 

Midterm Grade - given the schedule and when midterm falls (see schedule), the first 3 homework assignments and test 1 will be graded; thus 35% of your overall grade will be determined by midterm.

 

Programs will be demonstrated in class, in the traditional fashion.

 

Random, in-class pop quizzes may be given if it appears that you are not keeping up with the material and aren’t doing your part.  These will be counted in borderline cases (akin to extra credit).

 

Programs that don’t compile cleanly (no warnings or errors) or halt/crash will receive no credit; the programming assignments will be graded on a progressive scale, so it’s almost always possible to get most credit if you follow good programming practices, building your solution piecewise with verification testing.

 

Please be advised that no credit will be given for late assignments.  If you have a problem that arises during the course of the semester, please contact me as soon as possible.

 

Words of Wisdom (TAKE THIS PART SERIOUSLY!)

 

I expect your active participation in class.  Class attendance is expected because it’s much easier to learn if you’re coming to class and asking questions in lecture about things that confuse you. 

 

Start assignments early.  This way, you can ask questions and clarify things that are confusing.  Often, I’ll make assignments intentionally “open” so that you can come up with creative solutions, but this also means it’s often easy to misread what I’m looking for in the correct solution.  Better to ask and learn than to get a low grade!

 

Your grade in this course is determined completely on performance, not on effort. 

 

Academic Misconduct

 

If a student is found obtaining or granting inappropriate help in this course on any assignment (test, quiz, exam, homework, etc.) he will receive an F in the course.  The offense will go on permanent record with the university.  If this is not the student’s first academic misconduct offense at CCSU, he will be recommended for suspension from the university for two full terms.  This is in full accord with CCSU’s policy, and we encourage you to read and review the university’s policy in your student handbook.

 

ITP Choice Information

See http://itpchoice.clayton.edu/ for more information. 

 

Individuals with disabilities who need to request accommodations should contact the Disability Services Coordinator, Student Center 214, 770-961-3719, disabilityservices@mail.clayton.edu.

 

Additional Common Syllabus Information