Class hours: Fix in the class OT
Midterm & Final Examinations:
- Unserstand algorithm, abstract data type, and space/run-time complexity in the asymptotic sense.
- Design various algorithms using basic data structures.
- Evaluate the space and run-time complexities of algorithms.
- Determine and explain which data structure is a best choice for a given problem.
Previous ExaminationsPlease email to me
E. Horowitz, S. Sahni, and S. Anderson-Freed, Fundamentals of Data Structures in C, 2nd Edition, SLICON Press.
Other texts in the following will be very helpful:
A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, Addison-Wesley Publishing Company.
F. Carrano and T. Henry, Data Abstraction & Problem Solving with C++, 6nd, Pearson.