Application of Data Structures

Question 1

Structure of Data:

refers to the relationships among data elements

Answer 1

Logical structure

Question 2

Structure of Data:

pertains to how data is stored in computer memory

Answer 2

Physical Structure

Question 3

is described as a set of data elements with certain logical relationships, stored in computer memory with corresponding operations encapsulated

Answer 3

data structure

Question 4

Basic Principles in data structure design

Answer 4

Problem Analysis
Preliminary Design
Attention to Extensibility
Consideration of time and space cost of algorithm

Question 5

these structures include linear tables, stacks, and queues

Answer 5

Linear structures

Question 6

these structures encompass trees, sets, and graphs

Answer 6

Nonlinear structures

Question 7

A one-to-one relationship exists in the data elements of this structure

Answer 7

Linear structure

Question 8

is described as a finite sequence of instructions, representing specific and limited operation steps taken to solve a particular problem.

Answer 8

algorithm

Question 9

common storage
structures of different types of data structures

Answer 9

• sequential storage structure
• chain storage structure
• hash storage structure
• index storage structure

Question 10

two traversal modes in graph

Answer 10

depth-first traversal
breadth-first traversal

Question 11

Data elements stored one after another in contiguous memory

Answer 11

Sequential Storage Structure

Question 12

Data elements linked via pointers, allowing dynamic allocation

Answer 12

Chain Storage Structure

Question 13

Data elements stored based on hashed keys in a hash table

Answer 13

Hash Storage Structure

Question 14

Maintains an index mapping keys to data element positions

Answer 14

Index Storage Structure

Question 15

Traversal Modes:

It involves exploring a graph or tree by first visiting the starting node and then recursively visiting its adjacent nodes (children or neighbors) in depth, prioritizing exploration of deeper nodes before backtracking

Answer 15

Depth-First Traversal

Question 16

Traversal Modes:

In this method, exploration begins at the starting node, and all adjacent nodes at the current level are visited before moving to the next level. It involves systematically visiting all nodes at the same level before progressing to deeper levels, ensuring a broad exploration of the graph or tree.

Answer 16

Breadth-First Traversal

Question 17

two algorithms for generating minimum spanning trees in graphs

Answer 17

Prim’s Algorithm
Kruskal’s Algorithm

Question 18

Algorithms:

based on selecting the smallest edge to form a collection

Answer 18

Prim’s Algorithm

Question 19

Algorithms:

based on selecting the smallest edge until a unified connected component is obtained

Answer 19

Kruskal’s Algorithm

Question 20

involves removing nodes with zero in-degree and their adjacent edges until either the process ends or only one loop remains. It is used to solve problems related to partial order and total order in directed acyclic graphs

Answer 20

Topological Sorting

Question 21

two ways of expressing graphs

Answer 21

• adjacency matrix
• adjacency list

Question 22

implies that all elements can be compared

Answer 22

Total order

Question 23

indicates that only some elements can be compared

Answer 23

Partial order

Question 24

explores all neighboring nodes at the current depth level before moving to the next depth level, similar to hierarchical traversal of a tree using queues

Answer 24

Breadth-first traversal

Question 25

explores as far as possible along each branch before backtracking, resembling preorder traversal of a tree

Answer 25

Depth-first traversal