CSC 326 Section
5678 Information Structures Dr.
Susan Imberman
|
Section |
Day
and Time |
Bldg/Rm |
|
5678
|
M
12:20 - 2:15 PM |
1N/111 |
Prerequisites: CSC211
Michael
Main Walter Savitch (ISBN 978-0-13-212948-0 $111.99
Reference:: C++ Programming: From Problem
Analysis To Program Design (From CSC
126, CSC 211)
D.
S. Malik, Course Technologies, (ISBN) 978-1133626381
82.33
Course Requirements
There will be 2 exams and a final exam. Lab assignments will be demonstrated and
graded in lab. A hard copy of your
source code will be handed into the professor as well.
ALL
Labs are graded on a scale of 0 - 10, with 10 as the highest grade. Long lab assignments are due 2 weeks after
they are assigned. Labs handed in the
third week will have 5 points taken off.
NO long term lab will be accepted after week three. Make a copy of each programming assignment
and keep for yourself. Things happen!
In the past
those who have conscientiously done their homework have done well in the
course.
SCHOOL POLICY on Academic
Integrity, Plagiarism, and Cheating - Integrity is fundamental to the academic enterprise.
It is violated by such acts as borrowing or purchasing assignments (including
but not limited to term papers, essays, and reports) and other written
assignments, using concealed notes or crib sheets during examinations, copying
the work of others and submitting it as one’s own, and misappropriating the
knowledge of others. The sources from which one derives one’s ideas,
statements, terms, and data, including Internet sources, must be fully and
specifically acknowledged in the appropriate form; failure to do so,
intentionally or unintentionally, constitutes plagiarism. Violations of
academic integrity may result in a lower grade or failure in a course and in
disciplinary actions with penalties such as suspension or dismissal from the
College.
MY Academic Integrity Policy –Copying
someone else’s computer code, even though you changed the variable names, is
called plagiarism and cheating. All cheating is rewarded with a 0 on the
assignment whether you are the copyer or the copyee.
The Breakdown!
·
Exams 40%
·
Labs, Class work, Homework: 30%
·
Final: 30%
Course Learning Goals At the end of the course, students
will be able to:
·
Analyze
a problem, and identify and define the computing requirements appropriate to
its solution
·
function
effectively on teams to accomplish a common goal
·
to use
current techniques, skills, and tools necessary for computing practice.
·
understand
and use several different data structures
·
understand
dynamic memory allocation
·
understand
pointers and how to use them to create dynamic data structures
·
understand
algorithmic efficiency
Course Outline
1.
Introduction to Data Structures;
2.
Abstract Data Types
3.
Dynamic Arrays
4.
Linked Lists
5.
Standard Template Library
6.
Stacks
7.
Queues and Deques
8.
Recursion
9.
Trees
10.
Sorting
11.
Searching
12.
Hashing