I&C SCI 46 Lecture Notes - Lecture 1: Priority Queue, Increment And Decrement Operators, Empty Set

• School: UC-Irvine
• Department: Information and Computer Science
• Course: I&C SCI 46
• Professor: Richard Pattis

Document Summary

In this lecture we will discuss the five standard data types: stack, queue, priority queue, set, and. The code (templated classes) for concrete implementations of these data type appears in the courselib you downloaded, in files named like array_queue. hpp. For now, we will focus on the information appearing at the top of these . hpp files: code that declares all the operations applicable to these data types. In the next lecture we will focus on how to implement these classes: define their methods and operators using some actual data structure. This code appears in the courselib you downloaded, in files named like array_set. hpp. We will briefly look at the complexity classes of this code (and expand on this topic later in the quarter). These pair of lectures are followed by programming assignment #1, which asks you to represent and solve various problems using combinations of these data types.