chapter1-Introducer课件.ppt

Data Structure;Chapter 1 Introducer; 1.1 Research Content of DS;Kind of problems numeric 总额为一元的硬币，问1,2,5分硬币各几枚？ no-numeric students select courses. ;“student” Table;“course” Table;sno;eg：File System in OS;2) Core of DS: Objects、Relation、 Operation 3) Station in CS Come of mathematics: Between mathematics and computer software. Essence of programming：choose a good DS, then design a good algorithms. program = ds + algorithms ;1) Data：Everything that computers could understand, it’s a symbol. Numeric：integer、real No-numeric：student info、sales order 2) Data Element：unit in data. Data ? set (collection). Element ? everyone in the set. 3) Data Item: unit in data element, it is the smallest unit consist in element（atomicity,原子性）. eg: student info ? sno，sex，name，age …;4) Data Structure: Collection of data elements, there are some relations between them . Data_Structure = {D, R} D: Data Element （数据元素） R: Relation （关系）;Logistic structure — The relation between data elements present in real world. There are 4 logistic structure in real world: Set （集合）： Linear（线性的） ： Tree ： Graph / Net（图 / 网）：; Physic structure — The storage way(format) of data elements and relations in computer(that means Memory). Operation — What can we do with a kind of DS? It’s associates with Data Elements and Relations. ;5) Data Type: Collection of values that having same attribute, and some operations can be put on them. Atomic Type：It’s can’t be divide any more. Structural Type：It’s can be divide into smaller type.;6) ADT(Abstract Data Types)：Defined by users, to describe the real problem’s Model and Operations on it. Notice: ADT just only described the Logistic Structure of itself, and Nothing about it’s Physic Structure. ADT=（D,S,P） D: Data Objects；S: Relations；P: Operations;本书抽象数据类型定义格式;例 :整数的抽象数据类型（ADT）定义;1.3 Algorithm;2) Algorithm Properties;1.4 Algorithm Analysis; If goal (2) is import