一、了解数据库的基本概念。 二、会建立 Access数据库,会添加表和查询 三、掌握最基本的SQL语句,尤其是 Select、 Insert、 Delete和 Update语句 四、会给 Access数据库设置数据源
文件格式: PPT大小: 188KB页数: 29
第一章网络程序设计概述 第二章ASP初步 第三章ASP脚本语言- VBScript 第四章ASP常用内部对象 第五章数据库基础知识 第六章ASP数据库编程 第七章文件存取组件及其它组件 第八章网络程序开发实例
文件格式: PPT大小: 80.5KB页数: 3
Main topics Definition of graphs and some terminology Three common graph representations Some algorithms
文件格式: PPT大小: 152KB页数: 31
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
文件格式: PPT大小: 363KB页数: 80
9.1 Introduction A priority queue is a collection of zero or more elements. Each element has a priority or value
文件格式: PPT大小: 111.5KB页数: 36
Two kinds of data structure Linear: list, stack, queue, string Non-linear: tree, graph
文件格式: PPT大小: 180KB页数: 73
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
文件格式: PPT大小: 133.5KB页数: 29
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
文件格式: PPT大小: 120.5KB页数: 30
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
文件格式: PPT大小: 114.5KB页数: 23
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:
文件格式: PPT大小: 181KB页数: 58