In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array in ascending/descending order); binary search: search whether an element is ...

The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search ...

The lecture notes of 129 L1 and L2 students were examined in terms of five indexes for the content of notes: (a) the total number of words and notations, (b) the number of information units, (c) the ...