Lecture 1
Class webpage: http://users.cs.jmu.edu/adamses/web
Discuss syllabus
Discuss final exam time : look at your final exam schedules so we can pick a time on Wednesday
Discuss Monday afternoon/evening schedules : make-up class at 3:45 on Mon. the 10th
Discuss course content
Data structures we will learn about and implement using linked lists and arrays
Stack – LIFO
Queue - FIFO
Graphs
Trees
different kinds : binary, binary search, red-black, b
methods of traversing
Hash tables
Collision resolution methods
chaining
linear probing
Big Oh notation - evaluation of efficiency of algorithms
Algorithm definition :
unambiguous directions for solving a problem in finite time using finite space
Abstract data types - ADTs
What we will do with the data structures
manipulate their contents
fill them
retrieve data from them
search for data we want to retrieve
sort data to make searching easier
sort types: bubble, insertion, selection, heapsort, quicksort, mergesort
Language we will
program in :
Why
Handout on
Handout of example code to discuss