一、掌握描述静电场的两个物理量电场强度和电势的概念,理解电场强度E是矢量点函数,而电势V则是标量点函数. 二、理解高斯定理及静电场的环路定理是静电场的两个重要定理,它们表明静电场是有源场和保守场 三、掌握用点电荷电场强度和叠加原理以及高斯定理求解带电系统电场强度的方法;并能用电场强度与电势梯度的关系求解较简单带电系统的电场强度. 四、掌握用点电荷和叠加原理以及电势的定义式求解带电系统电势的方法. 五、了解电偶极子概念,能计算电偶极子在均匀电场中的受力和运动

第十七章波动光学 一、光是一种电磁波 光矢量用E矢量表示光矢量,它在引起人眼视觉和底片感光上起主要作用

Shortest paths Single-source shortest paths nonnegative edge weights Dijkstra's algorithm: O(E+ vlg n General

麻省理工学院：《算法导论》（英文版） Lecture 21 Prof charles e. leiserson

Negative-weight cycles Recall: If a graph G=(V, E) contains a negative weight cycle then some shortest paths may not exist

Dynamic programming Design technique, like divide-and-conquer Example: Longest Common Subsequence (LCs) Given two sequences x[l.. m] and yll.n], find a longest subsequence common to them both a' not the

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

ynamic order statistics OS-SELECT(i, S): returns the i th smallest element in the dynamic set S. OS-RANK(, S): returns the rank ofx E S in the sorted order of s s elements IDEA: Use a red-black tree for the set S, but keep subtree sizes in the nodes

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

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