Your Skill Set as of Today (Week 02) Your Response Never heard of it before Heard of it but do not know

the details Know it, but have not code/use it Can code/use it, but not very confident to do it fast Can code/use it very fast and confident Score 1 2 3 4 5

Task: Give a score in Column B for each Keywords below, see the scoring table above, the graph on the right side will be gradua Data Structures, Algorithms, & Programming Keywords Sequence, Selection, Repetition Programming Constructs Recursion/Backtracking Ad Hoc Problem C++ STL (Standard Template Library) Java API (Application Programming Interface) Array/C++ STL vector/Java Vector LinkedList/C++ STL list/Java LinkedList Stack/Queue/C++ STL stack/queue/Java Stack/Queue Binary Search Tree/C++ STL map/set/Java TreeMap/TreeSet Balanced Binary Search Tree/AVL/Red-Black-Tree (with your own library) Hash Table/Java HashMap Heap/PriorityQueue/C++ STL priority_queue/Java PriorityQueue Graph/AdjacencyMatrix/AdjacencyList/EdgeList Union-Find Disjoint Sets Segment Tree Fenwick (Binary Indexed) Tree Bubble Sort Insertion Sort Selection Sort Merge Sort Quick Sort Heap Sort Multi-Field Sorting Counting Sort Inversion Index (with Merge Sort) Complete Search/Brute Force/Iterative/Recursive Backtracking A* Search Iterative-Deepening Technique Divide and Conquer Principles Binary Search Techniques Order Statistics: Linear Time Selection Algorithm Greedy Dynamic Programming Longest Increasing Subsequence (LIS) Coin Change (CC) Max Sum/2D/1D 0-1 Knapsack/Subset Sum My Subjective Score

Traveling Salesman Problem (TSP) Bitmask Technique Matrix Chain Multiplication (MCM) DP on DAG DP on Tree DP Optimization Technique Longest Common Subsequence (LCS) String Alignment/Edit Distance Depth First Search (Traversal) Flood Fill Finding Articulation Points/Bridges Finding Strongly Connected Component in Directed Graph Topological Sort Breadth First Search (Traversal) Kruskal's (Minimum Spanning Tree) Prim's (Minimum Spanning Tree) Dijkstra's (Single-Source Shortest Paths) Bellman Ford's (Single-Source Shortest Paths) Floyd Warshall's (All-Pairs Shortest Paths) Ford Fulkerson's/Edmonds Karp's (Max Flow, Min Cut) Shortest/Longest/All Pairs Paths in Tree Lowest Common Ancestor (LCA) Eulerian Graph/Path/Cycle Chinese Postman Problem Directed Acyclic Graph (DAG) Shortest/Longest Path in DAG Counting Paths in DAG Min Path Cover in DAG Bipartite Graph Max Cardinality Bipartite Matching (MCBM) Min Vertex Cover in Bipartite Graph (Konig Theorem) Max Independent Set/Dominating Set in Bipartite Graph Alternating Path Algorithm for finding Bipartite Matching Kuhn Munkres/Hungarian Algorithm (Bipartite Matching) Edmond's Blossom Shrinking Algorithm for General Matching Number Theory Prime Number Generation: Sieve Prime Testing Miller Rabin's Algorithm Prime Factoring by Trial Division Pollard Rho's Algorithm GCD/LCM/Euclid's Algorithm Extended Euclid/Linear Diophantine Equation Euler Phi Modulo Arithmetic Fibonacci/Factorial Divisibility Big Integer Base Number Combinatorics

Cycle Finding/Tortoise-Hare Algorithm Sequences and Number Systems Linear Algebra Polynomial Divide and Conquer Quick Exponentiation Factorial/Fibonacci Backus Naur Form (BNF) Grammar Knuth Morris Pratt (KMP) String Matching algorithm Aho Corasick Suffix Tree/Array Geometry Basics/Trigonometry Graham Scan (Convex Hull) CCW Test Incircle Test Area of Arbitrary Polygon Plane Sweep Paradigm Line Segment Intersection Area or Volume Intersection Triangulation Closest Pair Problem Classic Board games, Card games, Chess, popular AI games Fedora (Linux) OS environment

above, the graph on the right side will be gradually updated

1.2

0.8

0.6

0.4

0.2

0 1 4 7

My Skill

10 13 16 19 22 25 28 31 34 37 40 43 46 49 52 55 58 61 64 67 70 73

73 76 79 82 85 88 91 94 97 100 103 106 109