Test 2
Chapters Covered
- ★ Chapter 5: Matrices
- * Terminology
- Square Matrices
- Symmetric Matrix
- Identity Matrix
- Matrix Inverse
- * Matrix Operations
- Scalar Multiplication
- Matrix Addition/Subtraction
- Matrix Multiplication
- * Gaussian Elimination
- Allowable elementary row operations
- i. Switch any two rows of the matrix.
- ii. Multiply all the elements in any one row of the matrix by a non-zero scalar.
- iii. Add a scalar multiple of any one row to another row.
- Solve the System of Equations
- Create Matrix Inverse
- * Boolean Matrices
- Boolean Multiplication
- Boolean Addition
- Boolean matrix multiplication
- ★ Chapter 6: Graphs and Trees
- * Graph Basics
- Graph (Formal Definition)
- Labeled Graph
- Weighted Graph
- * Graph Terminology
- Adjacent Vertices
- Adjacent Edges
- Loop
- Parallel Arcs
- Simple Graph
- Isolated Node
- Degree of a Vertex
- Complete Graph
- Path
- Length of a Path
- Connected Graph
- Cycle
- Bipartite Complete Graph
- Isomorphism Graphs
- *Representation of Graphs
- Adjacency Matrix
- Adjacency List
- * Tree Terminology
- Tree Formal Definition
- Root
- Depth of a node
- Depth (height) of the tree
- Leaf and internal nodes
- Forest
- Binary trees
- Full binary tree
- Complete binary tree
- *Binary Tree Representation
- Left Child-Right Child Array Reprentation
- Pointer Representation
- * Tree Traversal Algorithms: Preorder, Inorder, Postorder
- * Decision Tree Searching Lower Bound
- * Decision Tree Sorting Lower Bound
- * Huffman Code
- ★ Chapter 7: Graphs and Algorithms
- * Directed Graphs
- * Adjacency/Binary Relations
- * Reachability Matrix
- * Warshall's Algorithm
- * Euler Path and Hamiltonian Circuit for undirected graph
- * Dijkstra's Algorithm
- * Depth-First Search
- * Breadth-First Search
Format
- ★ Face to Face
- ★ Total points: 100
Demo Questions