notes25

notes25 - will influence the performance in space and time...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS251: Data Structures Lecture 01 - questions about course/projectss to CS251_ta@ cs.purdue.edu - course web page http://www.cs.purdue.edu/homes/cs251 - lectures - 3 times/week MWF PSO's - Explain projects/ Answer Questions. - Grades 25% Midterm 25% Final 50% Projects - Languages C++, Java Goal + In this cours you will learn how to represent problems using data structures in the computer and some basic algorithms. Algorithms+Dat a Structures=Prog ram Niclaus Wirth + you will improve your programming skills + you will learn how choosing the right data structure/algorithm
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: will influence the performance in space and time as the size of the input grows. (scalability). Class Notes on line- you volunteer to take class notes for a week. (3 lectures). Type them in HTML w/GIF, JPEG and mail them to me as a attachement (ZIP file).- you will gen 1% extra in the final grade.- I will bring a list of available Wednesday later so you can register Content- Analysis Tools- Stacks Questions- Vectors, Lists and Sequences- Trees- Priority Trees- Dictionaries- Search Trees- Sorting- Text Processing- Graphs...
View Full Document

This note was uploaded on 02/02/2012 for the course CS 251 taught by Professor Staff during the Fall '08 term at Purdue.

Page1 / 2

notes25 - will influence the performance in space and time...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online