Main topics Definition of graphs and some terminology Three common graph representations Some algorithms

11.1 Binary Search Trees 1.Definition: A binary search tree is a binary tree that may be empty. nonempty binary search tree satisfies the following properties: 1)Every element has a key and no two elements have the same key: therefore,all keys are distinct

Two kinds of data structure Linear: list, stack, queue, string Non-linear: tree, graph

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

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:

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

一、概念的引入 二、线性微分方程的解的结构 三、降阶法与常数变易法 四、小结、思考题

第一节切削运动和切削要素 第二节刀具的几何角度和结构 第三节切削层参数 第四节刀具材料

2直接映象及其变换 (1)规则:主存中每一块只能映像到 Cache中唯一一个特定位置,如图所示,主存的第i块只能映像到第imod2cb块位置上。如图4.35所示:

(1)当中断响应先后次序为1、2、3、4时,其中断处理次序是什么? (2)如果所有的中断处理都各需要3个时间单位t,中断响应和中断返回时间相对中断处理时间少的很多,当机器正在运行用户程序时,同时发生第2、3级中断请求,过两个时间单位,又同时发生第1、4级中断请求,请画出程序运行过程示意图