0% found this document useful (0 votes)
156 views

Your Skill Set As of Today (Week 02) Your Response

The document provides a self-assessment of the respondent's skills in various data structures, algorithms, programming concepts, and problem domains. It includes a table with over 100 items to score from 1-5 based on the respondent's familiarity, from never hearing of it to being able to code/use it very fast. The graph on the right will be updated based on the scores provided.

Uploaded by

Amzad Hossain
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
156 views

Your Skill Set As of Today (Week 02) Your Response

The document provides a self-assessment of the respondent's skills in various data structures, algorithms, programming concepts, and problem domains. It includes a table with over 100 items to score from 1-5 based on the respondent's familiarity, from never hearing of it to being able to code/use it very fast. The graph on the right will be updated based on the scores provided.

Uploaded by

Amzad Hossain
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
You are on page 1/ 12

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

Task: Give a score in Column B for each Keywords below, see the scoring table above, t

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
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
Score
1
2
3
4
5

see the scoring table above, the graph on the right side will be gradually updated

My Subjective Score

12

10

0
3 7 11 15 19 23 27 31 35 39 43 47
1 5 9 13 17 21 25 29 33 37 41 45
y updated

Column B
31 35 39 43 47 51 55 59 63 67 71 75 79 83 87 91 95 99 103
29 33 37 41 45 49 53 57 61 65 69 73 77 81 85 89 93 97 101 105
87 91 95 99 103 107
5 89 93 97 101 105 109

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy