Αποτελέσματα Αναζήτησης
The term data structure is used to denote a particular way of organizing data for particular types of operation. These notes will look at numerous data structures ranging from familiar arrays and lists to more complex structures such as trees, heaps and graphs, and we will see how their choice a ects the e ciency of the algorithms based upon them.
Chapters 4 through 8 contain the core material in any course on data structures. Specifically, Chapter 4 treats arrays and records, Chapter 5 is on linked lists, Chapter 6 covers stacks and queues and includes recursion, Chapter 7 is on binary trees and Chapter 8 is on graphs and theit applications.
1.Motivate a new abstract data type or data structure with some examples and reflection of previous knowledge. 2.Introduce a data structure, discussing both its mechanisms for how it stores data and how it implements operations on this data. 3.Justify why the operations are correct. 4.Analyse the running time performance of these operations.
We have 10 weeks to learn fundamental data structures and algorithms for organizing and processing information. “Classic” data structures / algorithms. How to rigorously analyze their efficiency. How to decide when to use them. Queues, dictionaries, graphs, sorting, etc. Today in class:
Data Structures. “Every program depends on algorithms and data structures, but few programs depend on the invention of brand new ones.” -- Kernighan & Pike. Help you learn (or refresh your memory) about: and . Why? Deep motivation: Common data structures serve as “high level building blocks” A mature programmer:
Abstract Data Types • An abstract data type (ADT) is a model of a data structure that specifies: • the characteristics of the collection of data • the operations that can be performed on the collection • It’s abstract because it doesn’t specify how the ADT will be implemented. • does not commit to any low-level details
data structure in a representation independent way one needs a syntax. This can be seen at the end of section 1.1 where we also precisely define the notions of data object and data structure.
