At a glance
- 3 lecture hours per week
- 1 tutorial hour per week
- 4 credits
Prerequisites
ES 201 – Programming II
Topics Covered
- Mathematical background – logarithms and exponents
- Use of Big O notation to calculate running time of programs
- Abstract data types
- Linear data structures – list, stack, and queue
- Hierarchical data structures – general tree, binary tree, and binary search tree
- Search algorithms – linear and binary search
- Sort techniques – bubble, selection, insertion, and bin
Learning Resources
- Aho, A. V., Hopcroft, H. E., & Ullman, J. D. (1983). Data Structures and Algorithms (2nd Edition). Pearson.
- Horowitz, E., & Sahni, S. (1982). Fundamentals of Data Structures (1st Edition). Computer Science Press.
- Weiss, M.A. (1997). Data Structures and Algorithm Analysis in C (1st Edition). Pearson.