Slides from the web (Chinese) Showing 21 - 40 of 117203 items
Foundations of Computer Science Chapter 9
Programming Languages
Foundations of Computer Science Chapter 9 Programming Languages |
|
www.csie.isu.edu.tw
Foundations of Computer Science Chapter 6
Computer Networks
Foundations of Computer Science Chapter 6 Computer Networks |
|
www.csie.isu.edu.tw
Mandrake 安裝過程
Mandrake 安裝過程 |
|
freefall.csie.isu.edu.tw
Object oriented programming
Object oriented programmingWhat is Class? What is Object? From object-oriented point of view Class is a user-defined data type which contains relevant data and functions Object is a variable declared under some class data type From philosophy concept Class is an abstract concept that describes the attributes of a collection of objects |
|
www.csie.isu.edu.tw
Binomial Heaps
Binomial Heaps |
|
www.csie.isu.edu.tw
Priority Queues Two kinds of priority queues:
Min priority queue.
Max priority queue.
Priority Queues Two kinds of priority queues: Min priority queue. Max priority queue. |
|
www.csie.isu.edu.tw
Minimum-Cost Spanning Tree weighted connected undirected graph
spanning tree
cost of spanning tree is sum of edge costs
find spanning tree that has minimum cost
Minimum-Cost Spanning Tree weighted connected undirected graph spanning tree cost of spanning tree is sum of edge costs find spanning tree that has minimum cost |
|
www.csie.isu.edu.tw
B-Tree – Delete
B-Tree – DeleteDelete 3. Delete 8. Delete 7. 15 20 4 5 6 30 40 13 16 17 7 12 9 8 10 3 |
|
www.csie.isu.edu.tw
Binary Tree Properties & Representation
Binary Tree Properties & Representation |
|
www.csie.isu.edu.tw
Trees
TreesTrees are a very useful data structure. Many different kinds of trees are used in Computer Science. We shall study just a few of these. |
|
www.csie.isu.edu.tw
Graphs
Graphsu v G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are also called arcs and lines. Directed edge has an orientation (u,v). |
|
www.csie.isu.edu.tw
Graphs
Graphsu v G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are also called arcs and lines. Directed edge has an orientation (u,v). |
|
www.csie.isu.edu.tw
Initializing A Max Heap input array = [-, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
Initializing A Max Heap input array = [-, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]8 4 7 6 7 8 9 3 7 10 1 11 5 2 |
|
www.csie.isu.edu.tw
Binary Search Trees
Binary Search TreesDictionary Operations: search(key) insert(key, value) delete(key) Additional operations: ascend() IndexSearch(index) (indexed binary search tree) IndexDelete(index) (indexed binary search tree) |
|
www.csie.isu.edu.tw
Divide And Conquer A large instance is solved as follows:
Divide the large instance into smaller instances.
Solve the smaller instances somehow.
Combine the results of the smaller instances to obtain the result for the original large instance.
A small instance is solved in some other way.
Divide And Conquer A large instance is solved as follows: Divide the large instance into smaller instances. Solve the smaller instances somehow. Combine the results of the smaller instances to obtain the result for the original large instance. A small instance is solved in some other way. |
|
www.csie.isu.edu.tw
Graph Operations And Representation
Graph Operations And Representation |
|
www.csie.isu.edu.tw
| Sorting Selection Sort Bubble Sort Insertion Sort Merge Sort (chap. 14) Quick Sort (chap. 14) Heap Sort (chap. 9) | |
www.csie.isu.edu.tw
Binary Tree Properties & Representation
Binary Tree Properties & Representation |
|
www.csie.isu.edu.tw
Dictionaries
DictionariesCollection of items. Each item is a pair. (key, element) Pairs have different keys. Operations. Search(Key,Element) Insert(Element) Delete(Key, Element) The word item is used as a synonym for element to avoid the confusion that would otherwise result by saying that a dictionary is a collection of elements and each element is a pair (key, element). A linear list is an ordered sequence of elements. A dictionary is just a collection of elements/items. Interface Dictionary has these 3 methods. |
|
www.csie.isu.edu.tw
第七代電視遊樂器 The 7th Generation Video Game Console
第七代電視遊樂器 The 7th Generation Video Game Console24XXX / 21XXX 台南新光三越百貨 角逐競爭的成員: Microsoft – XBOX 360(推出最早)2005 Christmas – USA corp. Sony – Playstation 3 2006 Christmas – Japan corp. Nintendo – Wii (Revolution) 2006 Christmas – Japan corp. 建議售價排比: (純主機) Xbox 360 – 12980 / 9970 (官方)標準版 / 核心系統版 PS3 – 14980 / 17980 (官方)基礎版 / 優質版 *搭其他配件更高 Wii – 199美金 (折合 6500 台幣) >> 聖誕節行情 |
|
freefall.csie.isu.edu.tw