Data and data structures

This is a mind map about data and data structure. The main contents include: Chapter 6: Composition of data in the era of big data, Chapter 5: Data structure and algorithm, Chapter 4: Tree, Chapter 3: String , queue and stack, Chapter 2: Arrays and linked lists, Chapter 1: Data and data organization.

Edited at 2024-02-13 18:50:35

PlotWizard

Recent works View more works>>

Key Timeline of African American History
This infographic, created using EdrawMax, outlines the pivotal moments in African American history from 1619 to the present. It highlights significant events such as emancipation, key civil rights legislation, and notable achievements that have shaped the social and political landscape. The timeline serves as a visual representation of the struggle for equality and justice, emphasizing the resilience and contributions of African Americans throughout history.
Timeline of the Development of Voting Rights and Citizenship in the United State
This infographic, designed with EdrawMax, presents a detailed timeline of the evolution of voting rights and citizenship in the U.S. from 1870 to the present. It highlights key legislative milestones, court decisions, and societal changes that have expanded or challenged voting access. The timeline underscores the ongoing struggle for equality and the continuous efforts to secure voting rights for all citizens, reflecting the dynamic nature of democracy in America.
African American Cultural Heritage and Excellence
This infographic, created using EdrawMax, highlights the rich cultural heritage and outstanding contributions of African Americans. It covers key areas such as STEM innovations, literature and thought, global influence of music and arts, and historical preservation. The document showcases influential figures and institutions that have played pivotal roles in shaping science, medicine, literature, and public memory, underscoring the integral role of African American contributions to society.

Data and data structures

PlotWizard

Recent works View more works>>

Recommended to you
Outline

Duplicate
Information Systems and Society
- 24
- 0
- 0
- 0
PlotWizard
Duplicate
Data and Computing
- 40
- 0
- 0
- 0
PlotWizard

Data and data structures

Chapter 1: Data and Data Organization

data

Numbers: They have no meaning in themselves and have no quantitative meaning. They only have specific practical meaning in specific situations.

Numeric value: data composed of numerical symbols, with quantitative meaning, and capable of arithmetic operations

Data organization

Data element: the basic unit of data

Data types: basic data types and structural data types

Data structure: the relationship between data, that is, the organization form of data

Chapter 2: Arrays and Linked Lists

array

Concept: a sequence composed of variables of the same type

One-dimensional array: suitable for representing data sequences with linear characteristics

characteristic

Array elements have the same data type

Access the value of array elements through array name and subscript

Store empty fixed space

linked list

Concept: A data structure that connects data objects that need to be processed in the form of nodes through pointers.

characteristic

The structure of each node in the same linked list is the same

Each linked list must have a head pointer to implement reference and boundary processing of the linked list

The space occupied by the linked list is not fixed

Chapter 3: Strings, Queues and Stacks

string

Concept: A finite sequence of zero or more characters

characteristic

finite seriality

String comparability

queue

Concept: A first-in, first-out linear list. The end that allows insertion is called the tail of the queue, and the end that allows deletion is called the head of the queue.

characteristic

First in, first out, last in, last out

finite seriality

stack

Concept: A linear table with restricted operations, allowing insertion or deletion only at one end of the table

characteristic

First in, last out, last in, first out

finite seriality

Chapter 4: Tree

Trees and Binary Trees

The concept of tree: It can be described as a finite set composed of n (n>=0) nodes and a node relationship defined on the set.

The concept of a binary tree: it is a finite set with n nodes

Binary tree properties

There are at most 2 k-1 power nodes on the kth layer.

A binary tree with depth k has at most 2 k - 1 nodes.

n0=n2 1

Basic operations of binary trees

Complete binary tree and incomplete binary tree

Traverse

Preorder traversal: around the root

In-order traversal: left root right

Postorder traversal: left and right roots

abstract data type

Chapter 5: Data Structures and Algorithms

Iteration and recursion

The concept of iteration; an activity that repeats a feedback process, usually with the goal of bringing results in line with goal expectations

Data sorting

Bubble Sort

Data lookup

sequential search

binary search

Chapter 6: Composition of data in the era of big data

Organization of data in real-time query systems

Organization and application of POI data