附录GW48EDA系统使用说明 第一节GW48教学实验系统原理与使用介绍 GW48系统使用注意事项 a:闲置不用GW48EDA系统时,关闭电源,拔下电源插头! b:EDA软件安装方法可参见光盘中相应目录中的中文 README. TXT:详细使用方法可

实验二波形输入与仿真实现 一、实验目的:通过本次实验掌握波形输入法制作元件的过程,掌握实验箱中时钟和扬声器的具体使用方法以及任意模值计数器的设计方法。 二、实验要求: 1、利用波开输入法设计非门电路模块。 2、利用VHDL语言输入方法设计数据选择器(参考二选一数据选择器程序),编译、定义引脚并下载到实验箱中验证

Solving recurrences The analysis of merge sort from Lecture I required us to solve a recurrence Recurrences are like solving integrals erential equations, etc o Learn a few tricks Lecture 3: Applications of recurrences

Quicksort Proposed by C. A.R. Hoare in 1962 Divide-and-conquer algorithm Sorts“ in place”( like insertion sort, but not like merge sort Very practical(with tuning)

Order statistics Select the ith smallest of n elements(the element with rank i i=l: minimum, .i=n: marimum, i=L(n+1)/2]or[(n+1)/2 median Naive algorithm: Sort and index ith element Worst-case running time =o(n Ig n)+o(1 o(nIg n using merge sort or heapsort(not quicksort) c 2001 by Charles E Leiserson

a weakness of hashing Problem: For any hash function h, a set of keys exists that can cause the average access time of a hash table to skyrocket An adversary can pick all keys from tkeU: h(k)=i for some slot i IDEA Choose the hash function at random independently of the keys

Balanced search trees Balanced search tree a search-tree data structure for which a height of o(g n)is guaranteed when implementing a dynamic set of n items

Computational geometry Algorithms for solving geometric problems in 2D and higher Fundamental objects: o point line segment

How large should a hash table be? Goal: Make the table as small as possible but large enough so that it wont overflow(or otherwise become inefficient Problem: what if we don 't know the proper size

Graphs(review) Definition. a directed graph(digraph G=(, E)is an ordered pair consisting of a set y of vertices(singular: vertex) a sete c× of edges. In an undirected graphG=(V, E), the edge set e consists of unordered pairs of vertices In either case, we have El=O(v2).Moreover if G is connected, then E2v-l, which