Commonly used abstract data types such as lists, stacks, queues, sets and trees and their applications and efficient implementations. Fast sorting, matching and graph algorithms. Algorithm analysis. One lecture (three hours); one term Prerequisite(s): COMPTECH 3PD3
