Coding & Skills
161 articles in this topic
Graph Theory: Euler and Hamiltonian Paths, Coloring and Connectivity
Graph theory for GATE CS: degree and handshaking, Euler vs Hamiltonian paths, planarity and Euler's formula, chromatic number, trees and spanning trees.
Dynamic Programming Explained: optimal substructure and a worked knapsack
Dynamic programming explained: optimal substructure, overlapping subproblems, memoization vs tabulation, and a fully worked 0/1 knapsack DP table example.
Sorting Algorithms Compared: complexity, stability, and the n log n lower bound
Sorting algorithms compared: bubble, insertion, selection, merge, quick and heap sort with best, average and worst time, stability, and the n log n bound.
Graph Algorithms: BFS, DFS, and shortest paths worked out
Graph algorithms explained: adjacency matrix vs list, BFS and DFS traversal order, edge classification, topological sort, and Dijkstra shortest paths.
Binary trees and binary search trees: traversals, operations, and the exam angle
Binary trees and binary search trees: terminology, all four traversals worked on a tree, BST insert, search and delete, balance, plus the exam angle.