Lecture Materials
Syllabus
Due Dates
Assignments
Lecture Materials
CS163 Homepage
Double click for:
html
power point
pdf
Lecture Slides and Notes
Other Notes
Getting Help:
Email the CS Tutors
Get help viewing videos
Email Karla Fant
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
Topic #5 Other LL
CS163 Announcements:
Computer Science at PSU
Computer Action Team (CAT)
Important Links:
Karla Fant's Home Page
Prep for the Final
Midterm Prep
Practice
Desire to Learn (D2L)
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.