This course introduces fundamental structures and algorithms for storing, managing, manipulating and analyzing data. Topics covered include structures, such as multidimensional arrays, linked lists, stacks, queues, deques, asymptotic notation, hash and scatter tables, trees and search trees, heaps and priority queues, graphs, and algorithms such as recursion, branch-and-bound methods, searching, sorting, and probabilistic algorithms. Microcontroller-based laboratory exercises will explore applications of data structures and algorithms, using examples drawn from mechatronics and robotics engineering.
(Lec: 3, Lab: 0.5, Tut: 0.5)