Đề thi cấu trúc dữ liệu và giải thuật dsa ch4 lists

Lists Dr Nguyen Ho Man Rang Linear list concepts Array implementation Singly linked list Other linked lists Comparison of implementations of list 4 1 Chapter 4 Lists Data Structures and Algorithms Dr[.]

Trang 1

Dr Nguyen HoMan Rang

Linear list conceptsArray

implementationSingly linked listOther linked listsComparison ofimplementations oflist

Chapter 4

Lists

Data Structures and Algorithms

Dr Nguyen Ho Man Rang Faculty of Computer Science and Engineering

University of Technology, VNU-HCM

Trang 2

Outcomes

• L.O.2.1 - Depict the following concepts: (a) array list

and linked list, including single link and double links,

and multiple links.

• L.O.2.2 - Describe storage structures by using

pseudocode for: (a) array list and linked list, including

single link and double links, and multiple links.

• L.O.2.3 - List necessary methods supplied for list and

describe them using pseudocode.

• L.O.2.4 - Implement list using C/C++.

Trang 3

Outcomes

• L.O.2.5 - Use list for problems in real-life, and choose

an appropriate implementation type (array vs link).

• L.O.2.6 - Analyze the complexity and develop

experiment (program) to evaluate the efficiency of

methods supplied for list.

• L.O.8.4 - Develop recursive implementations for

methods supplied for the following structures: list.

• L.O.1.2 - Analyze algorithms and use Big-O notation to

characterize the computational complexity of algorithms

composed by using the following control structures:

sequence, branching, and iteration (not recursion).

Trang 4

Contents

1 Linear list concepts

3 Singly linked list

4 Other linked lists

5 Comparison of implementations of list

Trang 5

Linear list concepts

Trang 6

Definition

A linear list is a finite, ordered sequence of

data items known as elements "Ordered" in

this definition means that each element has a

position in the list.

Trang 7

Trang 8

General list:

used on the list.

Trang 9

Restricted list:

list.

ends of the list.

Trang 10

Trang 11

operation on each element.

Trang 12

List ADT

Extended operations:

Trang 13

Insertion

position p in the list

Trang 14

Insertion

made at any position in the list (at the

beginning, in the middle, at the end).

inserted so that the ordering of the list

is maintained (searching appropriate

position is needed).

definition (FIFO or LIFO).

Trang 15

Removal

Sorted List.

Trang 16

Retrieval

Sorted List.

All elements remain unchanged.

Trang 17

Removal, Retrieval

given data

Sorted List: Searching is needed in

order to locate the data being deleted/

retrieved.

Trang 18

Success of Basic Operations

full.

the list is not empty.

Trang 19

Array implementation

Trang 20

Dynamically Allocated Array

Trang 21

Dynamic Array: Implementation in C++

Trang 22

Trang 23

Trang 24

Trang 25

Trang 26

Trang 27

Trang 28

Trang 29

Trang 30

Dynamic Array: Using

Trang 31

Contiguous Implementation of List

In processing a contiguous list with n elements:

physical shifting ).

Tiêu đề	Lists
Tác giả	Dr. Nguyen Ho Man Rang
Trường học	University of Technology, VNU-HCM
Chuyên ngành	Computer Science and Engineering
Thể loại	Tài liệu

Định dạng
Số trang	31
Dung lượng	519,58 KB