ohtml> CS302: Data Structures

Department of Computer Science and Engineering

CS302: Data Structures (Fall 2008)

Meets: TR 1:00 - 2:15 pm (SEM 347)

Instructor: Dr. George Bebis

Email: bebis@cse.unr.edu
Phone: (775) 784-6463
Office : 235 SEM
Office Hours: MW 1pm -2:30pm or by appointment

Teaching Assistant:Talha Oz

E-mail: toz@cse.unr.edu
Office: SEM 255A-4
Office Hours: F 9:30AM-11:30AM

Text: N. Dale C++ Plus Data Structures Jones and Bartlett Publishers, 4th edition, 2007.

Other Texts:

A. Ford and T. Teorey, Practical Debugging in C++, Prentice Hall, 2002.
W. Ford and W. Topp, Data Structures with C++, Prentice Hall, 1996.

R. Kruse and A. Ryba Data Structures and Program Design in C++ , Prentice Hall, 1999.

M. Main and W. Savitch Data Structures and Other Objects Using C++., Addison-Wesley, 1997

Prerequisites

C or above in CS202. If you do not meet the prerequisite requirements for this course, you should see me immediately.

Description/Objectives

The purpose of this course is to introduce you to the exciting world of data structures, an issue central to the art of computer programming. At the end of the course you will be equipped with the tools of data organization to enable you to write simple, clear, and efficient programs. The course will be structured around a comprehensive set of computer assignments to enable you to get hands on experience. Our programming language of choice will be C++.

Course Outline (tentative)

Software Engineering Principles
C++ Review
Comparison of Algorithms
Stacks and Templates
Queues
Unsorted and Sorted Lists
Linked Structures
Lists Plus
Recursion
Inheritance
Binary Search Tree
Heaps and Priority Queues
Graphs
Sorting and Searching (if time permits)

Exams and Assignments

Grading will be based on two exams, 6-8 quizzes, 6-8 homework assignments, and 5-6 programming assignments. Specifically, quizzes will be announced at least one class period in advance. Homework problems will be assigned and collected for grading on a regular basis. Homework solutions will be made available within a week of the due date for the assignment. There will be two exams: a midterm and a final. The material covered in the exams will be drawn from the lectures, the quizzes, and the homework. There will be several programming assignments which will be done in groups of two. The goal of the assignments is to provide you with hands-on experience with handling various kinds of data structures. In the lectures, you will be introduced to data structures at an abstract level and in the assignments you will write code to implement and use these data structures. Specific details and due dates will be announced in class.

Course Policies

Slides, assignments, and other useful information will be posted on the course web page. Regular attendance is highly recommended. If you miss a class, you are responsible for all material covered or assigned in class. You should carefully read the section on Academic Dishonesty found in the UNR Student Handbook (copies of this section are available on-line) Your continued enrollment in this course implies that you have read it, and that you subscribe to the principles stated therein. The programming assignments are to be completed in groups of two, however, both members of a team are expected to fully understand the structure of the code and the implemented algorithms. Discussion of the programming assignments is allowed and encouraged. However, each team is expected to do its own work. Assignments which are too similar will receive a zero. No late homework or programming assignments will be accepted unless there is an extreme emergency. If you are unable to hand in an assignment by the deadline, you must discuss it with me before the deadline in order to avoid the late penalty. No incomplete grades (INC) will be given in this course and a missed quiz/exam may be made up only if it was missed due to an extreme emergency.

Disability Statement

Any student with a disability needing academic accomodations is requested to speak with me or contact the Disability Resource Center (Thompson Building, Suite 101), as soon as possible to arrange for appropriate accomodations.

Useful Information

Research
Data Structures
- Java applets showing data structures at work
C++ information
- C++ Archive
Unix information
- UNIX Concepts and Commands
Makefiles
- Makefiles (presentation slides)
- Using Makefiles
- Separate Compilation and the UNIX make Program
Debugging
- Debuggers (presentation slides)
- ddd: GNU debugger

Syllabus

Fall 2008 syllabus

Sample Exams

Midterm Exam Guide

Spring 2002 Midterm Exam(solutions, click here)
Spring 2003 Midterm Exam(solutions, click here)

Final Exam Guide

Fall 2000 Final Exam(solutions, click here)
Spring 2003 Final Exam(solutions, click here)

Helpful Material Related to Images

Image Representation
Irfanview (freeware graphic viewer for Windows)

Source Code for Reading/Writing Images

To find out how to time your programs, click here
The image class: image.h and a simple implementation image.cpp
The rgb type (for color images): rgb.h
C++ routine to read a PGM image: ReadImage.cpp
C++ routine to read a PPM (color) image:ReadImage.cpp
C++ routine to read the header of a PGM image: ReadImageHeader.cpp
C++ routine to read the header of a PGM or PPM image: ReadImageHeader.cpp
C++ routine to write a PGM image: WriteImage.cpp
C++ routine to write a PPM (color) image: WriteImage.cpp
An example: Threshold.cpp
A makefile for this example
You can try the code using this image dimes.pgm
Example output using threshold=128 th.pgm

Lectures

Software Engineering Principles (Chapter 1 - reading assignment)

C++ Review
Computer Vision and Image Processing(tutorial)
Demo 1 (Humanoids for autonomous operations) Demo 2(Winning The DARPA Grand Challenge)

Comparison of Algorithms (supplement: Time Complexity)
Stacks and Templates
Queues
Unsorted Lists
Sorted Lists
Linked Stacks
Linked Queues

Homework Assignments

Due date: 9/16/2008

Homework 2

Due date: 9/23/2008

Homework 3

Due date: 10/2/2008

Programming Assignments

How will the assignments be graded?

Demos Schedule

Assignment 1 (for powerpoint presentation, click here) (Due date: 9/25/2008)
Image Gallery 1
Assignment 2 (for powerpoint presentation, click here) (Due date: 10/16/2008)
Image Gallery 2

You would need to overload the read/write functions; their prototypes would look like this:
Department of Computer Science and Engineering, University of Nevada, Reno, NV 89557
Page created and maintained by: Dr. George Bebis (bebis@cse.unr.edu)