Lecture13 - Computational Optimization ISE 407 Lecture 13...

Info icon This preview shows pages 1–7. Sign up to view the full content.

Computational Optimization ISE 407 Lecture 13 Dr. Ted Ralphs
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

ISE 407 Lecture 13 1 Reading for This Lecture Horowitz and Sahni, Chapter 2 Aho, Hopcroft, and Ullman, Chapter 2
Image of page 2
ISE 407 Lecture 13 2 What is a Data Structure? We will define data structures to be schemes for organizing and storing sets, though this is a slightly limiting definition. Examples of set operations. add delete find union sort We also want to be able to efficiently enumerate the items in a set.
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

ISE 407 Lecture 13 3 Choosing the Right Data Structure Data structures consist of a scheme for storing the set(s), and algorithms for performing the desired operations Hence, each set operation has an associated complexity To choose a data structure, you should know something about the elements of the set, and what operations you will want to perform on the set.
Image of page 4
ISE 407 Lecture 13 4 Data Structures and Algorithms Typically, data structures are part of a larger algorithm. In order to choose a data structure, you should also know something about the algorithm. The data structure should be efficient for the operations that will be performed most often. The same algorithm can have different running times using different data structures. Alternatively, the same data structures can perform differently in different algorithms.
Image of page 5

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

ISE 407 Lecture 13 5 Data Structures and Data Types A data structure is an abstraction typically specified independent of any particular programming environment. We analyze data structures in the context of a particular model of computation, just as we do algorithms. The term is typically used to indicate a compete scheme, including implementation details. A data type is the analogue of a data structure in the context of a particular computing system. In object-oriented languages, a data type is typically defined independent of the implementation. Inheritance allows us to separate the definitions from the implementation. It also allows us to define hierarchies of data types.
Image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern