cs163_winter2013002055.jpg

Lecture Materials

tabr_n.gif tabr_n.gif tabr_n.gif cs163_winter2013002053.gif
Double click for:
html
power point
pdf
cs163_winter2013002052.gif

Lecture Slides and Notes

cs163_winter2013002051.gif cs163_winter2013002050.gif cs163_winter2013002049.gif cs163_winter2013002048.gif cs163_winter2013002047.gif cs163_winter2013002046.gif cs163_winter2013002045.gif cs163_winter2013002044.gif
Other Notes
cs163_winter2013002043.gif cs163_winter2013002042.gif cs163_winter2013002041.gif cs163_winter2013002040.gif cs163_winter2013002039.gif cs163_winter2013002038.gif cs163_winter2013002037.gif cs163_winter2013002036.gif cs163_winter2013002035.gif cs163_winter2013002034.gif cs163_winter2013002033.gif cs163_winter2013002032.gif cs163_winter2013002031.gif cs163_winter2013002030.gif cs163_winter2013002029.gif cs163_winter2013002028.gif cs163_winter2013002027.gif cs163_winter2013002026.gif cs163_winter2013002025.gif cs163_winter2013002024.gif cs163_winter2013002023.gif cs163_winter2013002022.gif cs163_winter2013002021.gif

Getting Help:

Topic #1 Introduction
Topic #2 Data Abstraction
Topic #3 Ordered Lists
Topic #4 Stacks, Queues
Topic #6 Table ADTs
Topic #7 Efficiency
Topic #8 Intro to Trees
Topic #9 Tree Algorithms
Topic #10 Adv. Trees
Topic #11 Graphs
Topic #12 Sorting Algs
Topic #13 Sorting Algs
Getting started on Unix
cs163_winter2013002020.gif cs163_winter2013002019.gif cs163_winter2013002018.gif cs163_winter2013002017.gif cs163_winter2013002016.gif
Topic #5 Other LL
CS163 Announcements:
cs163_winter2013002015.gif cs163_winter2013002014.gif cs163_winter2013002013.gif cs163_winter2013002012.gif cs163_winter2013002011.gif cs163_winter2013002010.gif cs163_winter2013002009.gif cs163_winter2013002008.gif cs163_winter2013002007.gif cs163_winter2013002006.gif cs163_winter2013002005.gif cs163_winter2013002004.gif cs163_winter2013002003.gif cs163_winter2013002002.gif
Important Links:
Prep for the Final
Midterm Prep
Practice
CS163 Winter 2013
Welcome to Winter 2013!

Make sure to practice your C++, pointers, dynamic memory and linear linked lists as we begin the term. You should be proficient at building, traversing, and removing from linear linked lists to be prepared for this course.