Bill Pringle - [email protected]

|  Home  |  News  |  Downloads  |  LDS  |  Talks  |  Famly History  |  Facebook  |  Games  |  Mobile  |  About Me  |

CSE465 Data Structures & Algorithms

CSE 465 Home Bill Pringle [email protected] http://BillPringle.com

Schedule of Classes

Date # Topic Chapter(s)
Oct 23 1 Introduction & course overview 1
Oct 25 2 Analyzing Algorithms, Basic Structures 2
Oct 30 3 Elementary Data Structures 3.1-3.3
Nov 1   Project Time - no class
Nov 6 4 Elementary Data Structures 3.4-3.7
Nov 8   Test (open book, open notes)
Nov 13 5 Abstract Data Types Team Presentation: Project Overview 4.1-4.5
6 Abstract Data Types 4.6-4.8,4.10
Nov 15 7 Recursion Draft Individual or Group Paper (optional) 5.1-5.3
8 Trees 5.4-5.9
Nov 20   Optional Class - Questions & Answers, Project Time
Nov 22   Thanksgiving Break (no class)
Nov 27 9 Sorting Team Presentation: Structures & Algorithms 6
10 Sorting 7-11
Nov 29 11 Symbol Tables, BSTs, and Balanced Trees 12-13
12 Hashing 14
13 External Searching 16
  Group papers due
Dec 4   Project Workshop - Questions & Answers, Project Time
Dec 6   Project Workshop - Questions & Answers, Project Time
Dec 11 14 Team Presentations: Project Results, Individual Papers due. N/A

Grading

Grading is based on a test the semester project. The test is worth 10%, and is open book / open notes. The group submission counts for 30% of a student's grade, while the individual submission counts for 60%. There is a maximum 10 point penalty for "surprise problems" in the final report that weren't mentioned in the status reports.
A
94-100
A-
90-93.99
B+
87-89.99
B
84-86.99
B-
80-83.99
C+
77-79.99
C
70-76.99
D
60-69.99
F
Below 60

Standard addenda

Valid XHTML 1.0 Transitional Valid CSS!

© 1999-2014 Bill Pringle.      Hosting courtesy of CHCS Consulting.      This site best viewed with FireFox. Get Firefox!