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

Your TA for this class is  -

Fred Vogt with email address admiral@ecst.csuchico.edu or fvogt@mail.csuchico.edu

I will later create a link to Fred's own web pages should he have any updates or information to share with you on the course assignments.

 Fred 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 1 : Mon. 500PM- 550PM OCNL 133
  • Section 2 : Wed. 200PM -250PM OCNL 133
  • Section 3: Thur. 200PM -250PM OCNL 133
  • 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.

    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 BEFORE THE BEGINNING OF CLASS ON MARCH 7, 2006 - NO LATE ASSIGNMENTS ACCEPTED!!

    Here are some notes on B-Star Trees to assist you with your Program 2!

    Homework on calculating node sizes for B-Star Trees - DUE BEFORE THE BEGINNING OF CLASS ON MARCH 9, 2006 - NO LATE ASSIGNMENTS ACCEPTED!!!


    Return to Melody's Home Page.