SYLLABUS

 

COURSE: CMSC 208 DM1 Computer Science II

(Pre-requisites: Math 211 Calculus I and CMSC 207 Computer Science I)

MEETS: 11:00--12:50 T R in A310 (4 credits)

INSTRUCTOR: Mrs. Sylvia Sorkin

OFFICE: A321 PHONE: (410) 780-6768

EMAIL: ssorkin@ccbc.cc.md.us

OFFICE HOURS for Spring 1999: Tues. and Thurs. 1:00--3:30 PM

and also by appointment

TEXTS: Data Abstraction and Structures Using C++,

by Headington and Reilly, D.C. Heath Publ.(1994)

and, Data Structures in C++: A Laboratory Course,

by Roberge, D.C. Heath Publ.(1995)

 ( NOTE: PowerPoint slides for CMSC 207 text are downloadable from publisher's website at: http://www.jbpub.com/C++/dalecd/ for review of C++ basics.)

COMMENTS: Bring your textbook to class with you. If you miss a class, you are responsible for obtaining all classwork and assignments missed. Make-up tests are not generally given. Your grade for any test missed will be filled-in by 70% of the score you obtain on the final exam. However, if you will be unable to take a test at the announced time, let the instructor know why as soon as possible, preferably beforehand.

In case the college is closed due to inclement weather on a test date, the test will be held on the next class session.

PROGRAMS: You will need to use a C++ compiler to write and run the assigned programs. This will require your time outside of class. Occasionally, we will use Borland's C++ in A316 during classtime as new material is introduced for a lab session. Data files for programming assignments will be in a subdirectory.

Each program you turn in is to be your own work, submitted in an indented, well-commented style, with meaningful variable and constant names. Students may verbally discuss programming assignments. However, sharing code in hard or soft copy is a violation of the Academic Honesty Policy and will be treated as such. (See ECC 98-99 catalog p.27) To receive full credit, the program must be turned in on, or before, the date it is due. Programs may be turned in at any time on the due date.

Because programming assignments will contain 300-1000 lines, the importance of beginning assignments early cannot be over-emphasized. When turned in after the due date, 20% per weekday will be deducted for each day that the assignment is late. No assignment will be accepted more than one week after its due date, so turn in what you have done at that time.

The listing of each program should contain your name, due date, and description of the problem. In addition, each function you write must make appropriate use of parameters. Only variables which have been passed as parameters, or declared as local variables, are to be used by functions.

Include the program's input requirements, a description of the algorithm you used, and intended output. All output must be labeled and include your name. If your program gets data from a text file, you must include a copy of the text file you used with your program.

GRADING: Your grade in this course will be the average of your scores in these areas weighted as follows:

Classlabs

20%

(about 5 of these)

Programming projects

20%

(about 4 of these)

Tests

40%

(2 of these)

Exam

20%

 

 

CALENDAR:

DAY(S)

DATE

 EVENT

Mon.-Mon.

Mar. 29 -Apr. 5

ECC closed--Spring Break

Tues.

Apr. 6

ECC reopens -- Classes resume

Thurs.

Apr. 15

Last day to file for August diploma

Fri.

Apr. 16

Last day to withdraw with W grade

Fri.

May 14

Last day of Spring 99 classes

Sat.

May 15

Study Day

Sun. - Sat.

May 16 - May 22

Final Exams

EXAM: Tues. 5/18 10:30 AM - 12: 30 PM

 

TIME LINE FOR COMPUTER SCIENCE II Spring 1999 Headington & Reilly text

Topic

Chapter to read

# of Weeks

Loops and Functions

Assertions, Invariants,

Pre and Postconditions

1

.5

Modules and Information Hiding

Multifile programs

Specification (.h) files

Implementation (.cpp) files

Library routines

2

.5

ADT Classes in C++

Constructors, Friends

Overloading

3

1

Introduction to Data Structures

Properties

4

1

C++ Records

struct

arrays of structs

(skip 5.4 and 5.5)

5

.5

TEST #1 on Chapters 1 - 5 Tues. Mar. 9

 

 

Recursion

base and recursive parts

functions

6

1

Pointers

pointer types and reference types

dynamic data allocation

operators new and delete

class destructors

7

1.5

Linked lists

inserting and deleting nodes

8

1.5

Template classes

Roberge Laboratory 5 p. 88-89

 

.5

TEST #2 on Chapters 6 - 8 Thurs. Apr. 15

 

 

ADTs

stacks and queues

9

1

Trees

binary trees

13

1.5

Algorithm Efficiency

searching, sorting, big-O notation

12

1

OOD (if time permits)

objects, operations, driver

10

1

OOP (if time permits)

inheritance

11

1

[ CCBC-Essex Home Page | Sylvia Sorkin's Homepage ]
Last updated: Nov. 4, 1999