instructor Ellen M. Zimmer
office: Doucette Hall 202
e-mail: zimmer@edinboro.edu
office phone: 732-1179
Course
Description &
Prerequisites

This course continues CSCI 130.  Topics include user-defined data types, data structures including lists, stacks and queues, several sorting and searching algorithms, pointers, and introduction to object oriented programming, the standard template library, and recursion.  Implementation of programs will be done in C++.  You must have a C or better in CSCI130 and CSCI125 to take this course.

Course
Objectives
  • Employ the principles of software engineering to design high quality, structured programs.
  • Utilize object oriented programming principles to develop and implement abstract data types.
  • Describe and implement the standard abstract data types.
  • Develop and implement recursive algorithms.
  • Develop and implement sorting and searching algorithms.
  • Solve and code interactive programming problems.
  • Solve and code batch-programming problems.
Texts &
Materials
Programming and Problem Solving with C++, 5th Edition
   by Nell Dale, Chip Weems, Mark Headington

C++ Backpack Reference Guide
   by DePasquale
          OR
C++ Pocket Reference
   by Loudon

You should purchase a program folder from the instructor: (002) green

useful
links
UML
     Kennesaw State Univ UNL Tutorials
     Pratical UML Tutorial
     Jeckle UML Tutorials
 

UML Tools
    
UMLet

Textbook Website

Makefile tutorial

Grading

Your grade will be based on

 

It's important to understand that if you complete all the requirements for an assignment, that entitles you to a grade of "B" (i.e. "satisfactory work"). To receive an A for an assignment, you must go beyond the basic requirements, and demonstrate creativity, initiative, and excellence--the grade of "A" is intended for work that is superior, rather than average.

"Incomplete" Grades: You may request an incomplete, or "I" grade, only in cases where exceptional conditions beyond your control, such as accidents, severe illness, family problems, etc., have kept you from completing the course. You must alert us to these circumstances as soon as possible--telling your instructor in November that you were sick in September is not acceptable. If your request for an incomplete is granted, you must complete the work for the course within the time limits set by the University.  Unfinished "I" grades automatically become "F". Incomplete grades are not given to students who have simply fallen behind in their work.
 

Course
Outline

The schedule is outlined below.  This may change as the semester progresses and I will update you on these modifications in class.

 

 

 

Topics Covered

Lab

Week 1

Intro, Review
Chapter 10 - simple user data types

Lab 1 - Review

Week 2

Chapter 10 - structs

Lab 1 revisited - structs

Week 3

Chapter 11 - arrays

Lab 2 - structs/unions
lab2 pics: a  b  c  d  e  f

Week 4

Ch11 - cstrings, multi dim arrays
Ch12 - classes

Lab 2r - arrays

Week 5

Chapter 12 - classes & abstraction

Lab 3 - intro to classes

Week 6

Chapter 12 - classes & abstraction Chapter 13 - list  

Lab 3 revisited
more on classes

Week 7

Exam 1 (March 2)
Chapter 13 - list  

Week 8

Chapter 13 - list, searching, sorting

Lab 4 - lists

Week 9

Chapter 13 - list, stacks

Lab 5 - lists

Week 10

Chapter 14 - pointers

Lab 6

Week 11

Exam 2 (April 9)
Chapter 14 - stacks

Lab 7

Week 12

Chapter 14 - linked lists

Lab 8

Week 13

Chapter 17 - stacks & queues

Lab 9

Week 14

Chapter 18 - recursion

Lab 10

Exam Week

Final (May 9 @ 8:00)
       in DH217

 
D2L We will be using D2L (Desire to Learn) this semester for this course.  You can connect to this learning management system by signing on to the MyEdinboro portal (available from EUP homepage).  

If you have any technical difficulties with D2L or the MyEdinboro portal please contact Edinboro's Technology and Communication help desk (814)732-2111 
 

Web page
updated

April 04, 2012