http://newcollege.clayton.edu/itsd4312
Jon
A. Preston
E-mail:
jonpreston@mail.clayton.edu
Phone:
770 960 4354
Office:
IT109
Office
hours: “Open door policy” and by appointment – use this!
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.
Students will obtain a proficient level of master in analyzing the efficiency of data structures, simulations, graph theory, greedy algorithms, recursion, artificial intelligence, path planning 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. Students will be working both individually and in groups.
ITSD4301
(see the DUCK for more info)
Lecture 7:30
pm – 9:20 pm Tuesday (T214)
Lab 9:30
pm – 10:20 pm Tuesday (T109D)
Final
Exam Wednesday, 5/7/2003, 8:30
pm – 10:30 pm in T214
Introduction to Algorithms 2nd
Edition, Cormen, Leiserson, Rivest, & Stein (2001)
ISBN 0-07-013151-1
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%
Final 30%
Tests
(2) 20% (10% each)
Programs 50%
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.
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.
Beginning Fall Semester 2001, all students at CCSU
are required to state that they have on-demand access to a notebook computer
that meets the recommended hardware/software specifications that have been
established by Clayton State faculty. Academic penalties may be incurred for
not meeting this requirement. See
http://itpchoice.clayton.edu/ for more information.
MINIMUM REQUIREMENTS FOR IT MAJORS – 800 MHz PIII;
Display: 14.1 TFT; Memory: 256MB/Expandable to 512; Floppy Drive recommended;
Hard Drive: 20GB minimum; OS: Windows 2000 Pro; NIC: 10/100 internal strongly
considered; Modem: Internal 56kb; CDRW preferred, CDR OK; Office XP Pro
Individuals with disabilities who need to request
accommodations should contact the Disability Services Coordinator, Student
Center 214, 770-961-3719, disabilityservices@mail.clayton.edu.