Department of Computer Science
CS501 – Foundations of Computer Science
Fall
2006 Syllabus
PLEASE, READ THIS SYLLABUS CAREFULLY. YOU ARE RESPONSIBLE FOR KNOWING THIS
INFORMATION!
Prerequisite: CS152 or permission of instructor.
Course Description: Software
design for structuring and manipulating data. Topics include stacks, queues,
hash tables, trees, graphs, advanced sorting, and analysis of algorithms.
Instructor: Irena
Pevac
Phone: 832-2721
Email: pevac at ccsu.edu
Office: Maria Sanford 219
Office Hours: MW
TR
Textbooks:
|
Aho, Ullaman: Foundations of Computer Science - C edition. Computer Science Press 1995 |
|
Lafore: Data Structures & Algorithms, SAMS 2003 |
|
Pevac: Recursive Examples in Java, XanEdu - OriginalWorks 2006 |
|
Jones: Java au Naturel, 2002 |
Topics Covered:
|
Abstraction |
|
Iteration, Induction, Recursion |
|
Running Times of Programs |
|
Big-Oh and Approximate Running Time |
|
Recurrence Relations |
|
Combinatorics and Probability |
|
List Data Model |
|
Tree Data Model |
|
Set Data Model |
|
Relational Data Model, Relational Algebra |
|
Hashing |
|
Dynamic Programming |
|
Graph Data Model, Kruskal's, Prim’s and Floyd's algorithms |
Tests There will be two tests during the semester, and final exam at the
end. All tests are cumulative.
Class Meeting Times:
TR
Course Requirements: Two
tests, four homeworks (projects), final exam,
research paper and oral presentation of the paper in the class.
“A general rule for
any college course is that you are expected to put in at least 2 hours of work
outside of class for every hour in class.” For
this course, the expectation is at least 6 hours per week outside of class.
University Policies:.
1. If you need course adaptations or
accommodations because of a disability, if you have emergency medical
information to share with me, or if you need special arrangements in case the
building must be evacuated, please make an appointment with me as soon as
possible. My telephone numbers and
office hours are given above.
2. In the
event of a weather emergency which requires curtailment or cancellation of
classes, listen to WTIC (1080 AM) or call (860) 832-3333 for the “general snow
message.”
3. The
last day to withdraw from a course is
After
4. You are responsible for understanding and abiding by the
University’s policy on academic integrity.
Information on the policy may be found at http://www.ccsu.edu/AcademicIntegrity/. This policy is rigorously enforced by the
Department of Mathematical Sciences.
Resources Available:
1. If you need help, take advantage of your
instructor's office hours. Do not wait
until just before the first test to do so.
2. The Computer Club meets regularly in MS 314.
Free tutoring is often available from Club members as well as from UPE
members. A schedule for hours the MS 314
lab is open will be posted soon after the beginning of the semester.
3. Form a study group with other students in
your section. Discussing approaches for
solutions to projects with each other is a good way to learn.
Evaluation
Minimum
averages have been established for each of these grades:
A 93% A– 90% B+ 87%
B 83% B– 80% C+ 77%
C 73% C– 70% D+ 67%
D 63% D– 60%
The
average for the course will be based on the following weights: 20 points for
each of the two tests, 10 points for the final exam, 10 points for each of the
four projects, and 10 points for the research paper and oral presentation.
Schedule of Important Dates
T1 -
T2 -
Research Paper and Oral report -
Nov 21 2006
Final Exam