SCT Lecture 04: Basic Data Structs

On October 28, 2011, I gave a lecture on Basic Data Structures.

In computer science theory, data structures are the building blocks for all algorithms. Use of the correct structure is essential in getting code that is not only simple, but also efficient. Most lower level contests will deal with the most basic data structures – primitives, strings, arrays, arraylists, lists, stacks, and queues. Sometimes, it’s useful to create your own data structures. The lecture can be found on the Senior Computer Team website, or viewed here: