CS 2133: Data Structures

1
CS 2133 Data Structures

• Introduction and Semester Plan
• R. P. Simpson

2
Class Information

• Instructor Richard P. Simpson, BSH 126E, EXT
  4191
• Assistant Thuy Ngo
• Texts Algorithms in C Parts 1-4, Algorithms in
  C Part 5, Robert Sedgewick
• Prerequisites A grade of C or better in CS II
  and Discrete Math

3
Grading and Content
Course Content In this course you will continue
a study of data structures and object oriented
design. The class will include analysis of
algorithms and an indepth look at trees, graphs,
sorting and searching. Projects will involve the
simulation/implementation of several of these
data structures. Grading Projects and
Homework 40 3 Exams and Quizzes 40 1
Final 20 The relative importance of homework
and quizzes will be a function of the number
given.
4
Projects
This course is project intensive and expect up to
4 or 5 programs to be given during the course.
Use MVS 2008. Each project, unless otherwise
specified is to be turned in within an envelope
with your name and project number printed on the
outside. Include a printout of your source and
associated output, if appropriate, together with
a tested CD containing the programs .exe, .cpp
and other necessary files such as data or
necessary libraries. Make sure that your
program runs from the .exe off the CD before
turning it in.
5
Header Files
Use the following header wrapper to prevent
multiple inclusion errors on every header file(ie
.h)
ifndef _MYHEADER_H define _MYHEADER_H /
Interface declarations go here / endif /
_MYHEADER_H / The header and associated .h file
will automatically be created when you insert a
class in the Microsoft compiler! This is the WAY
to do it.
6
Project Suggestions
You want a copy ? Ahhh ????

• Start on the project as soon as it is given
• Keep backups of your project as you are
  developing it.
• Keep copies of the project for the entire course.
  I may ask for a new copy from you.

7
Documentation
Your programs are expected to be documented
professionally. This implies that each and every
function be documented as to its purpose, I/O
requirements and other interesting features.
Include a general program heading at the top of
your application that clearly defines the purpose
of the program, method of execution, your name
and project . Please use s to delineate your
comments. 10 Percent of each projects grade will
be documentation
8
Example Documentation
//
// Project 2 Rank and Range //
Name Richard Simpson // Data Structures Date
Feb 10, 2009 //
// Place your
general program documentation here. It should //
be quite a few lines explaining the programs duty
carefully. // It should also indicate how to run
the program and data // input format, filenames
etc //
//
//
ObjectNameMethodName() // Parameters List
them here and comment // Complexity O(N) // A
discussion of what the method/function does and
required // parameters as well as return value.
Also indicate the compexity // of this function
(worst case) //

9
Ethics
Each student is expected to write, enter, test
and validate his own programs. To submit another
persons program (even if it is partly copied,
names changed to protect the innocent etc.) is
considered plagiarism and is subject to severe
action as stated in the MSU Student Handbook. If
you have trouble with any project please come see
me as early as possible and I will help you. If
you do poorly on the quizzes and the first exam
and I do not see you in my office I will assume
you do not care ( so I want either! )
10
Some words of wisdom

• Remember
• The path to self-confidence can never be found
  through cheating!

11
Web Interface
This semester all projects and homework will be
presented on my web page. The site is
http//cs.mwsu.edu/simpson/ Check this site
regularly for fixes to projects etc. Your first
project is already listed on my web page. You
should start on it now!