This unit follows directly from the Pascal programming course, and provides a series of complete examples which illustrate a range of standard algorithmic techniques for manipulating data held in sequential storage, as well as reinforcing understanding of Pascal itself.  Use of an algorithm animation software system will be employed to facilitate understanding and demonstrate operations such as:

 
• manipulation of data within arrays 
• implementation of hash tables 
• stacks, queues and deques 
• sorting and searching data 
• lists and sets