CSCI 2270 Computer Science 2: Data Structures
Spring 2003
Karl Winklmann

Table of contents

Schedule and syllabus | Home Page | Bulletin Board | Current notes | Assad's Page | Programs | Table of contents | News archive | Dora

Entries are clickable.

On this page: Quick | Detailed

Quick

Assignment 1: “MovingObjects”

Assignment 2: “MovingObjects3D”

Notes for Assignment 2

Assignment 3: “PhoneBook”

Notes for Assignment 3

Stacks and Templates

Assignment 4: “Polynomials”

Notes for Assignment 4

Sample Lab Exam 1

Assignment 5: “GraphEditor+BFS”

Notes on sorting: linear vs O(n log n)

Sample Lab Exam 2

Topics for final exam, remaining lecture schedule

Detailed

Purpose of course

Data structures

Teaching Assistants

Schedule and syllabus

Grading policies

Due dates and late policy

Points and grades

Assignment 1: “MovingObjects”

Bring questions to class

Files to submit

Grading guidelines (added later)

Assignment 2: “MovingObjects3D”

Grading guidelines

Notes for Assignment 2

Pointers and dynamic arrays

Assignment operators, copy constructors, destructors

Using the sort function

Reading from a text file

Assignment 3: “PhoneBook”

Grading guidelines

Notes for Assignment 3

Looping through linked lists

Assignment operator, copy constructor, destructor

A suggested order of implementation

Stacks and Templates

Assignment 4: “Polynomials”

Grading guidelines

Files to turn in

Notes for Assignment 4

Sample Lab Exam 1

Assignment 5: “GraphEditor+BFS”

Command line parameters

Grading guidelines

Files to turn in

Notes on sorting: linear vs O(n log n)

Why we can't in general sort faster than O(n log n)

When we can sort faster than O(n log n)

Sample Lab Exam 2

Topics for final exam, remaining lecture schedule

List of topics for final exam

Remaining lecture schedule

© Karl Winklmann 7:10 PM, Friday, May 2, 2003