COURSE: 3240
TEXT BOOKs:
"C++ Plus Data Structures", 4th edition authored
by Dale.
INSTRUCTOR: Dr.
Grewe
OFFICE HOURS: By appointment Teusday/Thursday
11:50am-12:50pm, Via phone by appointment or other.
DESCRIPTION: See Catalog. Data Structures
and Algorithms (4) Definition, design, implementation of abstract
data structures, including stacks, queues, generalized lists;
implementation as contiguous or linked structures. Structures
include tables and hashing, trees, graphs. Algorithms for manipulating
structures, searching, sorting; introduction to the analysis of
these algorithms.
RESOURCES: Library is currently only open lab space on campus.
COMPUTERS, SKILLS AND PRE-REQUISITES: The
students will be asked to work on projects that require computer
access outside of class time. See catalog for pre-requisites:
MATH 2150, CS 2360, CS 2430. You should also feel comfortable
with using ftp. All Projects either turned in AS DIRECTED ON THE
project statement. This typically includes both print as well
as electronically. You must have your name, the date, and course
name at the top of the first page. Staple multiple pages and make
sure your work is neat and legible. Access to a web-site where
you can post work as requested is required.
GENERAL GUIDELINES: Projects either turned
in AS DIRECTED ON THE project statement. This typically includes
both print as well as electronically. You must have your name,
the date, and course name at the top of the first page. SEE LATE
POLICY BELOW. Staple multiple pages and make sure your work is
neat and legible. Access to a web-site where you can post work
as requested is required. As a graduate level course, you will
be expected to maintain a high degree of responsibility and preparedness
includingreading material beyond what is covered in the lectures
and participating actively in class discussions. I will be available
during office hours if you have any questions or concerns. Please
try to visit to me during office hours.
GRADING: The assignment of a grade is based
on the following (tentative) formula: 45% Project/Work, 45% Assessment(s)
and 10% Class Participation. Note this formula is for guidance
only. The instructor is to use her best judgment in assigning
final course grades. Attendance may be taken at random and used
towards class participation. Assessments will be in-class. These
assessments will be given regularly, like mini-quizes. They will
be unannounced but their frequency will be approximately once
a week and will cover material learned since the last assessment.
For each assessment, you will be allowed to have one 8.5"x11"
cribsheet (can write on both sides).
ACCOMODATIONS: If you need disability-related
accommodations in this class, please email, call, or visit me.
The Student Disability Resource Center(SDRC) is the campus office
responsible for verifying that students have disability-related
needs for academic accommodations, and for planning appropriate
accommodations in cooperation with the students themselves and
their instructors. The Student Disability Resource Center (SDRC)
is located in Library Complex 2400 and can be reached by phone
at (510)-885-3868. The Contra Costa SDRC can be reached by phone
at (925) 602-6716.
LATE POLICY: Projects are due as announced
in class. No late work will be accepted except for a documented
illness. As this course is project-based, and fast-paced you must
keep up with the work and this policy will be strictly adhered
to. Students may take part in the evaluations of others in addition
to instructor evaluations.
COURSE LEARNING MODULES: Each week you will
be going through different modules in the
outline of our web-based materials. For each numbered module
you will find materials including on-line lecture materials, reading
assignments, links to online resources, exercises to be completed,
as well as related projects. Projects ofcourse will utilize information
learned in earlier modules but, are placed in a module indicating
that at the completion of this module you will have the skills
to complete the project. Exercises are important as they can help
you complete a project. Sometimes exercises have solutions and
at other times, they do not.
TENTATIVE SCHEDULE:
- Lect 1: Introduction,
- Lect 2: SW Process and Engineering
- Lect 3,4: Data Design and basic C++ issues
- Lect 4: OOP Design
- Lect 5: Pointers and Memory
- Lecture 6: Lists, Binary Search of List
- Lect 7: Class templates, Stacks and Queues
- Lect 8: Linked Structures.
- Lect. 9: Computational Complexity
- Lecture 10: Recursion
- Lect 11: Binary search Tree
- Lect 12: Heaps and Priority Queues
- Lect 13: Graphs and Graph Algorithms
- Lect 14-15: Hashing, Sorting and Searching Algorithms
- Lect 16-19: Lab Time, Project Work
- Lect 20: Advanced
BLACKBOARD COURSE SITE ORGANIZATION
For the classes Q&A Discussion Board, to post your projects,
take assessments, get announcements, get fellow students email
addresses, check your current scores, you MUST REGULARLY log onto
our blackboard website.
On the left hand side of the blackboard site is our course menu
where you find the links to this website as well as the discussion
board, projects drop box, announcements, email, and tools.
DISCISSION BOARD: Our class's Blackboard
Discussion Board Q&A is where we post our questions
from the class. Here is where you ask questions and interact with
me and other students. You are to post your questions here unless
they are of a personal nature. I check the online discussion at
least two times every week. If you can answer someone else's questions
before I can, please do so. We'll all learn from one another.
COMMUNICATION: I may use blackboard announcements to notify
you of some new information. Whenever I post an announcement,
it appears at the top of the page as well as on your blackboard
site. I may instead email your horizon address information.
EMAIL: The blackboard email area is where you go to find
my address or the horizon address of others in the course. For
class related questions, you can post first to the discussion
board.
SCORES: The blackboard tools area is where you will find
your grades.
|