Chapter 15 Graphs
Multiple
Long Question Short Question Algorithm Definition
Choice
Graph Properties? Cycle, Theorem 15.4
Dijkstra’s Algorithm 15.2
path Isomorphic
Breadth First Search Spanning Tree 15.3 Digraph
Adjacency matrix,
Theorem 15.8 Eulerian
Depth First Search Incidence Matrix,
Graphs
Adjacency List
Problems 15.1, 15.2, 15.3, 15.13, 15.15, 15.20
Chapter 10 Trees
Long Question Short Question Algorithm Definition Multiple Choice
Decision Tree Traversal ၃ မ ျိုး 10.1 Algorithm
Tree
Decision Tree
Review Questions 10.2, 10.3, 10.4, 10.5, 10.6, 10.7, 10.8
Chapter 11 Binary Trees
Multiple
Long Question Short Question Algorithm Definition
Choice
Evaluating
Counting binary tree 11.7 Binary Tree
expression tree
Traversal 4 မ ျိုး
Natural Mapping
Draw Expression Tree
Prefix → Infix → Postfix
Mapping a Forest into Binary Tree
Review Questions
Problems 11.2, 11.3, 11.4, 11.5, 11.6, 11.7, 11.9, 14, 21
Chapter 12 Search Trees
Long Question Short Question Algorithm Definition Multiple Choice
AVL Tree Binary Search Tree Review Questions 2
(Insertion) ပုဒ ်
Chapter 5 Stacks
Problems 5.1, 5.2, 5.3, 5.4, 5.5, 5.6, 5.7
Definition: Review Questions 5.1, 5.2
Chapter 6 Queues
Problems 6.1
Definition: Queue Operations (page 117)
Chapter 2 Arrays
Multiple Choices
Chapter 3 Linked List
Multiple Choices