6.1 Definition Definition: A queue is a linear list in which additions and deletions take place at different ends. It is also called a first-in-first-out list. The end at which new elements are added is called the rear. The end from which old elements are deleted is called the front

5.1 definition of stack Definition A stack is a linear list in which insertions and deletions take place at the same end. This end is called the top. The other end of the list is called the bottom. It is also called a LIFO(last-in-first-out) list

4.1 1D-Array 1. One-dimensional array 1D-array is a limited sequence composed of n (n20) elements which are of the same data type. For example:

3.1 Preface 1. data object--- a set of instances or values for example: Boolean={ false,true} Digit={0,1,2,3,4,5,6,7,8,9} Letter={A, B, ....., a,b, ..... Z} NaturalNumber= {0, 1,2, ..... Integer={0,+1,-1,+2,-2,+3,-3,} String={a,, ..... ,aa, ab, ac

2.1 Preface Performance of a program: the amount of computer memory and time needed to run a program We use two approaches to determine it: performance analysis performance measurement

The purpose and contents of the course Introduce most used data structures and algorithms Prerequisite of other courses Introduce algorithm analysis Review C++

Textbook Data structure, algorithms, and applications in C++, Sartaj Sahmi 数据结构(用面向对象方法与C++描述),殷人昆等

9.1宏的基本知识 9.2创建宏和宏组 9.3运行宏 9.4宏的应用实例 9.5习题

8.1 Access数据访问页的基本知识 8.2创建数据访问页 8.3数据访问页的编辑 8.4数据访问页的应用实例 8.5习题

7.1报表的基本知识 7.2创建报表 7.3报表的编辑 7.4高级报表设计 7.5报表应用实例 7.6习题