Round 1: Recap and basic data structures

In this introductory round,

• ​ we review some data structures from earlier courses (especially CS-A1120 Programming 2), and

• ​ study some other simple linear data structures.

Our presentation is not limited to Scala but the same concepts apply to different programming languages as well.

In addition, we introduce basic algorithm analysis concepts and apply them to apriori running-time analysis of some simple algorithms. Furthermore, we also recap basics of experimental algorithm analysis.

Contents:

• Describing algorithms
• Basics of Analysis of Algorithms
• Experimental analysis
• Arrays
• Resizable arrays
• Linked lists
• Stacks
• Queues and Deques