Cosc 2P03 Fall 2017

• Course OutLine
• Cover Page
• Test Solution
  

Mentoring and Supplemental Tutoring

• The normal course of action to follow when a student wishes to obtain help with the lecture or assignment material is to first see the lab teaching assistant (TA). The teaching assistants are there to help students formulate correct implementations of the lecture material, this is normally referred to as help on the assignments. The duties of the teaching assistant are limited to guiding the student to a better understanding of the material. The teaching assistant is often confused with one who will write a working implementation for the student. This is not the case. It is the student who must strive to learn the material, only that way will understanding come. The teaching assistant will be there to guide those students who make the effort to learn.
  
 
• If a problem with the understanding of lecture or assignment material is beyond the scope of the TA then the instructor will gladly help. Students who need help with material may come to the instructor during his office hours. There is normally an open door policy (when the door is open) in effect.
  
 
• If a serious problem with the understanding of the material persists, the student may wish to seek a tutorial session with the tutorial leader. The tutorial leader will spend some time with individual students to review the material and aid in understanding. Tutorial size is usually limited to 2 people per session. To arrange for help, please email the tutorial leader, who will then set time aside for your needs.
  
 

Resources

• Mark Allen Wiess Home Page

Lecture Material

• Lecture material will normally be available only at the lecture. It will be the student's responsibility to come to lecture and obtain the proper handout material and instruction. In addition, many of the hand outs and code fragments have been made available in the word document Dave's Notes. Students should print Dave's Notes as appropriate, and bring the relevant material to lecture. Many of these pages will be formally presented in lecture, with additions made as appropriate.  

• Dave's Notes - Warning: Material in this document is subject to change without notice.

Power Point Slides below - Most are animated slides and thus should be run in Power Point for the full effect. These will be updated as appropriate as the course progresses.
 
• Algorithm Analysis - Power Point presentation to supplement lecture material.
• Recursion: Power Point presentation - neat demo which should be run.
• Matrices: Power Point presentation. 
•   Specialty Stacks and Queue. Power Point presentation. 
• Trees Part 1: Traversals: Breadth, Recursive, Link Inversion, Threading - PPT - Animated slides that should be run.
• Trees Part 2: BST insertion (recursive & iterative), AVL Trees, Deletion from BST, PPT
• Tables: Binary Search, Hashing: Linear Probing, Double Hashing, Internal Chaining, Buckets, Deletion
• Heaps: Heaps and Heap Sort, Power Point presentation.
• Graphs: Topological Sort, Shortest Path, Dijkstra, Kruskal, Prim, Power Point presentation
• BTrees: Insertion and Deletion from 2-3 trees, Power Point presentation.
• Strings: Intro into strings and string representations, Power Point presentation. 
• Scan: C code which implements the scan function for KMP. 

Web Sites

        Java is a worry wort regarding security. You may have to follow the instructions given here to enable the applet to run.

• Site with Some Cool Animations dealing with Data Structures
• An Applet that does everything  (BST, AVL Btree, RB, Heaps, Splay) - the site is a wonderful resource for 2p03 and comes with a stand alone application which animates most of what we do in 2P03. The java application is provided here. Download and run on your machine.
  
• Utah State University has many apps which provide visualization for common algorithms. A must see.
  

• Exercises: Complexity Problem
• Recursive MyFill program source: Can you trace the recursion?
  

Text Book Readings (link to brock library)

Assignments - Assignments will be posted as they are finalized. Don't worry some of these links will be dead.

This Terms Assignments

• Assignment 1
  
• Assignment 2
• Assignment 3  
  
• Assignment 4
• Assignment 5
  
• Bonus Assignment
  

Exam