[English]Đọc-hiểu: Data Structure

[neverland87]

Data Structure
In programming, the term data structure refers to a scheme for organizing related pieces of information. The basic types of data structures include:
- files
- lists
- arrays
- records
- trees
- tables
Arrays: In programming, a series of objects all of which are the same size and type. Each object in an array is called an array element. For example, you could have an array of integers or an array of characters or an array of anything that has a defined data type . The important characteristics of an array are:
- Each element has the same data type (although they may have different values).
- The entire array is stored contiguously in memory (that is, there are no gaps between elements).
Records: In database management systems, a complete set of information. Records are composed of fields , each of which contains one item of information. A set of records constitutes a file. For example, a personnel file might contain records that have three fields: a name field, an ađress field, and a phone number field.
In relational database management systems, records are called tuples.
Some programming languages allow you to define a special data structure called a record. Generally, a record is a combination of other data objects. For example, a record might contain three integers, a floating-point number , and a character string.
Trees: A type of data structure in which each element is attached to one or more elements directly beneath it. The connections between elements are called branches. Trees are often called inverted trees because they are normally drawn with the root at the top.
The elements at the very bottom of an inverted tree (that is, those that have no elements below them) are called leaves . Inverted trees are the data structures used to represent hierarchical file structures. In this case, the leaves are files and the other elements above the leaves are directories.
A binary tree is a special type of inverted tree in which each element has only two branches below it.
Each of these basic structures has many variations and allows different operations to be performed on the text-decoration: data.
Question
1. What are arrays?
a. An array element.
b. A defined data type
c. A series of objects.
2. What is a record called?
a. a file
b. tuples
c. a special data structure.
3. What elements are there in a tree?
a. root
b. leaf
c. branch
d. all of them
Vocabulary
data structure (n): cấu trúc dữ liệu
organizing (v): thiết lập
series (n): dãy
objects (n): đối tượng
array element (n) : phần tử của mảng
integers (n): số nguyên
characters (n): ký tự
data type (n): kiểu dữ liệu
contiguously (adv): liên tiếp, kề nhau
database management systems (n): hệ quản trị cơ sở dữ liệu
fields (n): trường
floating-point number:
character string (n): chuỗi ký tự
branches (n): nhánh
tuple(n): ống
inverted trees (n): cây ngược
root (n): gốc
leaves (n) : lá
binary tree(n): cây nhị phân

[Xcross87]

1.c - 2.b - 3.d ... Hope I am correct

[neverland87]

1.c - 2.b - 3.d ... Hope I am correct

he he, ^_^ pete was correct at all

[kidkid]

if this lesson have contain audio , i think will very good

[MyHieu]

I have serveral data stucture lessons in english , if you're eager on them , let try ...
Just start with the easiest one : Click here