MTM2511 · Algorithms and Data Structures

3. Semester · Required · 3+0+0 · 5 ECTS

About the Course

Introduction of Algorithm Analysis; Mathematical Functions;Running Time Calculations of C Programs (examples); Algorithms Analysis Functions (Big Oh, Little Oh, Theta, Omega); Divide & Conquer Algorithm; Euclid’s Algorithm; Binary Search(C codes and examples); Sorting Algorithms (C codes and examples);Introduction of Data Structures; Lists (C codes and examples); Stacks and Queues (C codes and examples);Trees ; Binary Trees (C codes and examples); Search Trees (C codes and examples); AVL Trees (examples); B & B+ Trees (its algorithms and examples)

Resources

“Data Structures, Past, Present, and Future, ” Mark Allen Weiss, Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015
"Data Structures and Algorithm Analysis in C++", Mark Allen Weiss, Addison Wesley, Reading, MA., 1994, 498 pgs. Second edition, 1999, 588 pgs. Third edition, 2007, 586 pgs. Fourth edition, 2014, 656 pgs.
"Data Structures and Algorithm Analysis in Java", Mark Allen Weiss, Addison Wesley, Reading, MA., 1999, 542 pgs. Second edition, 2007, 546 pgs. Third edition, 2012, 614 pgs.
"Data Structures, and Problem Solving with C ", Mark Allen Weiss, Addison Wesley, Reading, MA., 1996, 820 pgs. Second edition, 2000, 944 pgs.
"Data Structures and Algorithm Analysis in C", Mark Allen Weiss, Addison Wesley, Reading, MA., 1993, 461 pgs. Second edition, 1997, 512 pgs.

Assessment System

In-term

60%

Homework Assignments10%
Mid-Terms50%

Final

40%

End-of-term exam