Class and Lab Schedule
Section 050: Monday and Wednesday,
6:00 PM to 7:50 PM, Room
B 226
Prerequisites
CSC 125 with a grade of C or higher.
Purpose
This course is the third course of the core sequence in Parkland's Computer Science transfer
program. It covers complex data structures and algorithms, including queues, stacks, linked lists,
trees, memory management, searching, sorting, hashing, and graphs with an emphasis on algorithm
analysis.
Structure
Lectures,
readings, graded projects and
tests. The lectures and readings will cover
theory. The projects will
vary in difficulty and will require C++ solutions using good Object Oriented
Design. Some of the projects will be started in
class during the time set aside for labs. The tests
will assure mastery of specific knowledge and skills covered in the lectures,
labs, and readings.
Texts
Data Structures and Algorithms in C++,
Second or Third Edition, by
Adam Drozdek, Brooks Cole, 2001 and 2005,
Second Edition: ISBN 0-534-37597-9,
Third Edition ISBN .
Storage
(Flash Drives or Disks)
You must have a USB Flash Drive, a Zip
disk or a number of 3.5" diskettes for use
with this class. Store all of your code files on these
disks, even if you have to use C:\temp during
class. (This will be explained in class). You always
must have back ups of all your work. Be sure to fully label all your
storage
with your name and contact information so the they can be returned to you
easily if lost.
