• CRN 10837 and IVE CRN 17546 Course Administration

Programming II Programming Projects

• p01: Median
• p02: Bracket matching
• p03: Postfix evaluation
• p04: Simple simualtion
• p05: Checkout line simulation
• p06: Integer set 1
• p07: Integer set 2 and Operator Overloading
• p08: Binary tree traversals
• p09: Time complexity
• p10: Heap sort

Submitting projects

• Project Submission Instructions
• Project Template pdf
• Project Template docx
• p09 Project Template pdf
• p09 Project Template docx

Reports

• r01: Library research
• r02: Postfix evaluation

• Report Submission Instructions
• r01 Report Template pdf
• r01 Report Template docx
• r02 Report Template pdf
• r02 Report Template docx

• Lecture 0: Submitting projects
• Lecture 1: Command Line Arguments
• Lecture 2: Structures and Classes
• Lecture 3: Formatted Output
• Lecture 4: References
• Lecture 5: Dynamic Memory Allocation
• Lecture 6: Program Structure and makefiles
• Lecture 7: Selection Sort
• Lecture 8: Stacks and Palindromes
• Lecture 9: class Stack (array implementation)
• Lecture 10: template class Stack (array implementation)
• Lecture 11: Postfix Evaluation
• Lecture 12: class Stack (element implementation)
• Lecture 13: template class Stack (element implementation)
• Lecture 14: Simple Simulation
• Lecture 15: Simple Simulation Mechanics
• Lecture 16: class Queue (array implementation)
• Lecture 17: template class Queue (array implementation)
• Lecture 18: Intermediate Simulation
• Lecture 19: Intermediate Simulation Mechanics
• Lecture 20: class Queue (element implementation)
• Lecture 21: template class Queue (element implementation) (not available)
• Lecture 22: class List (element implementation)
• Lecture 23: List Iterators (element implementation)
• Lecture 24: template class List (element implementation) (not available)
• Lecture 25: class Set (element implementation)
• Lecture 26: template class Set (element implementation) (not available)
• Lecture 27: class List (array implementation)
• Lecture 28: Binary Search
• Lecture 29: List Iterators (array implementation) (under construction)
• Lecture 30: template class List (array implementation) (under construction)
• Lecture 31: class Set (array implementation) (under construction)
• Lecture 32: template class Set (array implementation) (under construction)
• Lecture 33: Operator Overloading
• Lecture 34: Trees
• Lecture 35: class Tree (element implementation) (under construction)
• Lecture 36: template class Tree (element implementation) (not available)
• Lecture 37: Time Complexity
• Lecture 38: Time Complexity Examples
• Lecture 39: Project p09 Example
• Lecture 40: Binary Search Time Complexity
• Lecture 41: Priority Queue (Heap)
• Lecture 42: class Heap
• Lecture 43: template class Heap (under construction)
• Lecture 44: Heap Sort (under construction)
• Lecture 45: Heap Sort Time Complexity

Tests

• Test 3, Version 1, Spring 2017: Test 3, Version 1, Spring 2017

References

• Stroustrup, B. J. The C++ Programming Language, 3rd Ed. Addison Wesley 1997 ISBN 0-201-88954-4
• Harbison, S. P. and Steele, G. L. C, A Reference Manual, 4th Ed. Prentice Hall 1995 ISBN 0-13-326224-3

Tests