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

Table of contents

 


Latest page | Schedule and syllabus | Home Page | Programs | Table of contents | News archive | Dora

Entries are clickable.

On this page: Quick | Detailed


Quick

CSCI 2270: Home page

Assignment 1: “MovingObjects”

Assignment 2: “MovingObjects3D”

Assignment operator, copy constructor, destructor

Reading from a text file, sorting objects

Linked lists

Assignment 3: “CatalogBrowser”

Linked lists, continued

Assignment 3, issues discussed in class

Stacks and Templates

Assignment 4: “Directory Trees”

Recursive size function

Assignment 4 Discussion

Tree copy constructor, assignment operator, destructor

Sample Exam Problems

Assignment 5: Graph 3-Coloring

Recent Topics

Graph Algorithms

Project Description

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

Sample Lab Exam 2

Binary numbers, bit operations, etc

Trying to summarize ...

Sample Final Exam

Projects

Sample final with sample solutions

Final

Solutions for final

Programs

News archive

Detailed

CSCI 2270: Home page

Purpose of course

Data structures

C++ 

Staff

Instructor

Teaching Assistants

Recitations

Textbooks

Required:

Recommended:

Schedule and syllabus

Grading policies and such

Due dates and late policy

Points and grades

Academic misconduct

Assignment 1: “MovingObjects”

Description

Details

Bring questions to class

Files to submit

Challenge

Grading guidelines

Assignment 2: “MovingObjects3D”

Description

Details

Files

Getting Java

Grading guidelines

Assignment operator, copy constructor, destructor

Destructor

Assignment operator

Copy constructor

Reading from a text file, sorting objects

Reading from a text file

Sorting an array of objects

Linked lists

Assignment 3: “CatalogBrowser”

Description

Data

Details

A good half-way point

Files to turn in

Grading guidelines

Linked lists, continued

Assignment 3, issues discussed in class

Member variables

What you always need

How a Catalog::read function can be used in the main program

Using a stack to 'undo' operations

Looking for substrings

Stacks and Templates

Stacks and Templates

Assignment 4: “Directory Trees”

Description

How to get the directory information

Grading guidelines

Files to turn in

Recursive size function

Assignment 4 Discussion

Tree copy constructor, assignment operator, destructor

A copy constructor

An assignment operator

A destructor

Parse trees and derivatives

Sample Exam Problems

Description

Sample problems for the written exam

Sample problems for the lab exam

Assignment 5: Graph 3-Coloring

Description

Details

A note of caution

Grading guidelines

Files to turn in

Recent Topics

Randomized binary search trees

2-D dynamic arrays

Line Intersection

Graph Algorithms

Traversals

Shortest paths

Project Description

Description

Files to turn in

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

Textbook on sorting

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

Binary numbers, bit operations, etc

Hexadecimal (“hex”) notation

Negative integers

Trying to summarize ...

Organizing data

Sorting

Hash tables

Trees

Trees and recursion

Combining trees and hash tables

Priority queues

Programming issues

Dynamically allocated memory

Arrays and pointers

Making it all work

And some miscellaneous advice ...

Choose the right data structure to fit the task

Special cases, optimizing ...

Use existing software

Running times

Sample Final Exam

Projects

Sample final with sample solutions

Final

Solutions for final

Programs

News archive  


© 2003 Karl Winklmann 3:08 PM, Tuesday, December 16, 2003