Data Structures and Algorithms (CISC 610)

Harrisburg University

This course emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis and implementation. This class overs techniques used to analyze problems and algorithms (including asymptotic, upper/lower bounds, best/average/worst case analysis, amortized analysis, complexity), basic techniques used to design algorithms (including divide and conquer/greedy/dynamic programming/heuristics, choosing appropriate data structures) and important classical algorithms (including sorting, string, matrix, and graph algorithms) and data structures.


Essential Algorithms: A Practical Approach to Computer Algorithms by Rod Stephens

Topic List

  • Arrays, Linked Lists, Stacks, Queues
  • Graphs and Trees
  • Hash Tables and Hashing Functions
  • Sorting and Searching
  • Graph and Tree algorithms
  • Algorithmic Complexity and Analysis of Algorithms
  • Assorted Algorithms (String Processing, Cryptography, etc.)
Douglas Rumbaugh
Douglas Rumbaugh
Lecturer of Computer Science