栈和队列是两种特殊的线性表,它们是运算时要受到某些限制的线性表,故也称为限定性的数据结构

2.1 概述 2.2 线性表

第四章串 4.1串的基本概念 4.2串存储结构 4.3串的基本运算实现 4.3串的匹配算法

本章介绍序列比对时常用的几个概念,包括同一性identity)、相似性(《dcnysimilaiy《)同 源性( homology)等。这些概念,在蛋白质和核酸序列比对时经常使用。双序列比对(pairwise alignement)是指通过一定的算法对两个DNA或蛋白质序列进行比对分析,从而找出两者 之间最大相似性匹配。双序列比对是序列分析常用方法之一,是多序列比对和数据库搜索的 基础

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

9.1 Introduction A priority queue is a collection of zero or more elements. Each element has a priority or value

7.1 Dictionaries A dictionary is a collection of elements each element has a field called key, and no two elements have the same key value. Operations: Insert(x): insert an element with a specified key value Search(k,x): search an element with a specified key

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

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

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