This course aims to introduce students some basic data structures and algorithms which are to be used as tools in designing solutions to problems. It will make students familiar with the specification, usage, implementation and analysis of these data structures and algorithms, Introduction of Data Structures (Linear, non-Linear Data Structures) mainly focused and Algorithm Analysis Concept, Measuring Complexity, Complexity of; Algorithm Big-O Notation. Simple Sorting and Searching Algorithms (Bubble Sort, Insertion Sort, Selection Sort, Sequential Searching, Binary Searching; Abstract Data Types, Structures, Pointers, Arrays, Linked Lists, Stacks, Queues, Trees, Graphs. Advanced Sorting and Searching Algorithms (Shell Sort, Quick Sort, heap Sort, Merge Sort, and Hashing); Laboratory exercises are dedicated to practice the basics on concepts on data structures like Abstract Data Types, Structures, Pointers, Arrays, Linked Lists
- Teacher: Tariku Worku