CSCI 311
Course Home Page
Data Structures and Algorithms in C++
Prerequisite: Grade of C- or better in CSCI 112 or
equivalent
Teaching Assistant and Programming Lab Information
Your
current TA/grader for this class is -
·
Pratik Mehta with email pratik008@gmail.com.
·
Attendance at all labs and lectures is
mandatory. If you have programming
questions you need rapid answers to, be sure to email them to Pratik with a cc
to Dr. Stapleton at melodystapleton@digitalpath.net
·
There is an assignment “Dropbox” in
Blackboard Vista on the CSCI 311 course page there. Click on this link and you can submit
your assignments there. You will
want to zip up each submission into a single zip file.
· Pratik will have a web site on which he will post updates and important information on your assignments. Check his web site frequently for updates on your programming assignments and other key information related to satisfying the lab component of this course.
Pratik is
the TA for all sections. Here are the times and locations that the
sections are held. You may attend either of the labs -
SECTION 2 LAB:
Tu 200PM- 250PM OCNL 340
SECTION 3
LAB: Th 200PM -250PM
OCNL 340
NOTE: THIS COURSE HAS BEEN RECORDED AS A SERIES OF VIDEOSTREAMED
LECTURES. YOU CAN WATCH THESE
ARCHIVES BY GOING TO THE VISTA/WEBCT SITE FOR THIS COURSE AND CLICKING ON THE
RECORDED SESSIONS ICON.
- Course
Syllabus:
- Course
Topics, Reading Assignments, related Powerpoints:
- Programming
Assignments and Due Dates – TO BE UPDATED SHORTLY:
- Instructions
on How to Compile your C++ Programs in Unix or Windows:
- Here
is a Good Example of Documentation - Follow this as a standard!
- Link to
Kruse's chapters, e.g.s
- Link
to old 311 materials, etc.
- OLD:Use
this solution to your B-tree HW to assist you in studying for the
midterm!!!
- OLD:Some
Materials to Help in Studying for the Final:
- OLD:HERE ARE THE
SCANNED SOLUTIONS TO THE PRACTICE FINAL EXAM PASSED OUT IN LECTURE!!!
******************************************
BELOW THIS POINT ARE OLD SPRING 2008 HOMEWORK
ASSIGNMENTS AND OTHER COURSE HELP MATERIALS!!!
Check this section of your course home page frequently
since this is where new homework assignments for the Spring 2008 semester will
be posted!
Homework One, assigned Feb. 12,
2008, due on Feb. 14, 2008:
1)Using the diagram and the
code on Page 367 of Kruse’s Course notes (slide 47 of 81 in the Chapter
10 notes), draw the symmetric diagram and write the code for the case of a
right rotation
2) Using the deletion example
on Page 372 of Kruse’s Course notes (slide 52 of 81 in Chapter 10 notes),
draw the intermediate rotation and the final rotation in the double rotation
case that fixes the root m of the tree after m has become critical with a -2
balance factor
Homework Two, assigned Feb. 28, 2008, due on Thursday, March 6 at the beginning of class. Photocopy your assignment before you turn it in!
Insert
the following values into:
1) an initially empty Digital Search
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. Note - use the same order for deletion - NOT the
reverse order!!!
2) an initially empty Radix Search Trie.
Once you have completed the insertion of all the values then follow by deleting
each one in the same order that you inserted them.
3) 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.
Values: 441, 102, 931, 552, 753, 250, 888, 199, 320, 350
Here
is a web page with similar values to help you derive the binary representation
of these values and to see how some Patricia Tree inserts and deletes would
work:
*************************
Homework Three: Work the following practice midterm and turn in:
FOR
SPRING 2008 - 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 :
Homework Four: Perform Breadth first and Depth first Traversal on the two graphs off of the link below. (Use vertex 0 as the start vertex for both graphs and both types of traversals) You should turn in 4 total "traversals" or lists of the output. Due Tuesday, April 29:
http://www.ecst.csuchico.edu/~melody/courses/Fall2004CSCI151/FinalStudy.htm
*************************************************
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.