Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
This topic will describe the storage of objects in containers, we will focus on linear orderings: Implicitly defined linear orderings (sorted lists), explicitly defined linear orderings. We will summarize this information and look briefly at: Hierarchical orderings, partial orderings, equivalence relations, adjacency relations. | 50 WATERLOO ENGINEERING 2006-2013 University of Waterloo O Containers Relations and Abstract Data Types m Harder M.Math. L ctrical and Computer El Xda VATER LO ENGINEERING Containers Relations and Abstract Data Types 2 Outline This topic will describe - The storage of objects in containers - We will focus on linear orderings Implicitly defined linear orderings sorted lists Explicitly defined linear orderings - We will summarize this information - We will also look briefly at Hierarchical orderings Partial orderings Equivalence relations Adjacency relations VATER LO ENGINEERING Containers Relations and Abstract Data Types 3 2.1 Outline Any form of information processing or communication requires that data must be stored in and accessed from either main or secondary memory There are two questions we should ask - What do we want to do - How can we do it This topic will cover Abstract Data Types - Models of the storage and access of information The next topic will cover data structures and algorithms - The concrete methods for organizing and accessing data in the .
