CSCI 311 Course Home Page

Data Structures and Algorithms in C++

Note - The old course number from Spring 2005 or earlier is CSCI 151

Prerequisite: Grade of C- or better in CSCI 112 (new number - old number is CSCI 15B) or equivalent

Teaching Assistant and Programming Lab Information

Your TA for this class is Shaun McCluskey with email address shaunmcc@gmail.com.

Shaun's web pages for this class can be found at www.smacfoo.net. Check his web site frequently for updates on your programming assignments and other key information related to satisfying the lab component of this course.

Shaun is the TA for all three sections. Here are the times and locations that the sections are held. You may attend any or all 3 labs -

SECTION 2 LAB: Tu 200PM- 250PM OCNL 340

SECTION 2 LAB: Wed 200PM- 250PM OCNL 244

SECTION 3 LAB: Th 200PM -250PM OCNL 340

Please note: In order to get into the WebCT home page for this course, you must purchase a student access code from WebCT for $15.00. This code provide access to an epack that the author had created specifically for the course. The epack is actually a "shell" that sits on top of my course. When the enter the course home page (on our WebCT server) it will ask for an access code. You actually purchase the code from a WebCT website (using a credit card) and get the code instantly.

If you cut and paste the URL below into your browser they will go directly to the place in WebCT to purchase the code -

http://www.webct.com/global/purchase/CourseInfo?PAGE=pgPINSearchResults&COMMAND=MORE_INFO&product=2522318

Or if you go to the WebCT website, you should click on the choice in the header menu of "Digital Content", then when a submenu comes up, click on Student Access Codes. You will go to a search page. If you type in the keyword Drozdek (the author of the textbook/epack) then 2 choices will come up. One choice is a C++ data structures epack and the other is Java. Choose C++. Now you are at the URL above and just need to give your credit card info and instantly get the code. Then you can log in to my course in WebCT and see the recorded lectures.

******************************************

First Homework on this page for Spring 2007 - Insert the following values into an initially empty Patricia Tree. Once you have completed the insertion of all the values then follow by deleting each one in the same order that you inserted them. Due on Thursday, March 8 at the beginning of class. Photocopy your assignment before you turn it in!

Values: 401, 101, 350, 901, 550, 750, 251, 887, 99, 300

Here is a web page with similar values to help you derive the binary representation of these values:

http://www.ecst.csuchico.edu/~melody/courses/Spring2003CSCI151/Powerpoints_of_Lessons/PatriciaHomework_files/frame.htm

FOR SPRING 2007 - HERE IS YOUR PRACTICE MIDTERM

SOME SOLUTIONS TO THE PROGRAMMING PROBLEM IN THE PRACTICE MIDTERM

OF FINDING THE MEDIAN VALUE IN A BINARY SEARCH TREE :

SOLUTION 1

SOLUTION 2

*************************************************

Homework on AVL Trees

Here is the solution to the Insertion Part of the Above Homework... use this tree to do part 2 of the HW, the deletions

Homework on order 3 B-Trees - DUE .... NO LATE ASSIGNMENTS ACCEPTED!!

Homework on heaps and heapsort:

SOLUTION TO SAMPLE MIDTERM PROGRAMMING PROBLEM!

Return to Melody's Home Page.