Skip to content

Latest commit

 

History

History
74 lines (65 loc) · 1.84 KB

File metadata and controls

74 lines (65 loc) · 1.84 KB

organizing, processing, retrieving, storing data

data problem

  • how are data structures used?
  • characteristics of data structures
  • data types
  • types of data structures
  • how to choose a data structure
  • five factors to consider

how are data structures used?

  • storing data
    • database management system
  • managing resources and services
    • core operating system
      • memory allocation
      • file directory management
      • file structure trees
      • process scheduling queues
  • data exchange
    • TCP/IP
  • ordering and sorting
    • binary search trees
    • priority queues
  • indexing
    • B-trees
  • searching
    • binary search trees
    • B-trees
    • hash tables
  • scalability
    • distributed storage locations

characteristics of data structures

  • linear or non-linear
  • homogeneous or heterogeneous(同质或异质)
  • static or dynamic

data types

  • boolean
  • interger
  • floating-point numbers(浮点数)
  • fixed-point numbers(定点数)
  • character
  • pointers
  • string

types of data structures

  • array
  • linked list
  • stack
  • heap
  • queue
  • tree
  • graph
  • hash table

how to choose a data structure?

  • supported operations
  • computational complexity(计算复杂度)
  • programming elegance(编程优雅)

five factors to consider

数据形式,使用,位置,关系,扩展;
可类比职位的作用:
    职位描述,职责,在哪发挥作用,和其它职业如何互动,将来可以有何种发展;
  • what kind of information will bo sorted?
  • how will that information be used?
  • where should data persist, or be kept, after it is created?
  • what is the best way to organize the data?
  • what aspects of memory and storage reservation management should be considered?