Programming Techniques

Course number: 
CIS 5511
Fall 2015
Name E-mail Office location
Jim Korsh (James Korsh)
Science Education and Research Center (SERC) , Room 322

CIS 3223

Topics covered: 
  • Topological Sorting
  • Maximum Subsequence Sum Problem
  • Garwick's Stack Management Algorithm
  • Asymptotic Analysis and Proof of Correctness
  • Binary Tree Traversals using Stacks, Linked Inversion Traversal, Robson Traversal
  • Parenthesis and Binary Trees
  • Counting Techniques
  • Heaps
  • Path Length and Huffman Codes
  • Binary Search Trees and Optimal Binary Search Trees
  • Strahler and Pruning Numbers
  • Find and Union
  • Amortized Analysis
  • Minimum Spanning Trees
  • Graphs and Applications
Course goals: 

The purpose of this course is to gain a basic knowledge of fundamental data structures and an understanding of their relationship to the performance of algorithms and programs. This includes an introduction to execution time analysis and to the proof of program correctness.

Attendance policy: 
Attendance at all meetings of the class is expected.
Accomodations for Students with Disabilities: 
Any student who has a need for accommodation based on the impact of a documented disability, including special accommodations for access to technology resources and electronic instructional materials required for the course, should contact me privately to discuss the specific situation by the end of the second week of classes or as soon as practical. If you have not done so already, please contact Disability Resources and Services (DRS) at 215-204-1280 in 100 Ritter Annex to learn more about the resources available to you. I will work with DRS to coordinate reasonable accommodations for all students with documented disabilities. (
Student and Faculty Academic Rights and Responsibilities: 
Freedom to teach and freedom to learn are inseparable facets of academic freedom. The University has a policy on Student and Faculty and Academic Rights and Responsibilities (Policy #03.70.02) which can be accessed through the following