Gate Material Placement Ready Login Sign up Login Sign up

GATE CSE - Important Keywords

Algorithm
Notion
Notion of an Algorithm
Algorithmic Fundamentals
Problem Types
Algorithm Efficiency
Analysis of Algorithm Efficiency
Framework
Analysis Framework
Asymptotic
Asymptotic Notations
Recursive algorithms
Mathematical analysis
Non recursive algorithms
Brute Force
Closest Pair
Convex Hull
Exhaustive Search
Traveling Salesman
Knapsack Problem
conquer
conquer methodology
Merge sort
Quick sort
Binary search
Large Integers
Multiplication of Large Integers
Strassen s Matrix
Binomial Coefficient
Computing a Binomial Coefficient
algorithm
Warshall s algorithm
Floyd algorithm
Warshall s and Floyd algorithm
Search Trees
Binary Search Trees
Optimal Binary Search Trees
Knapsack
Knapsack Problem
Memory functions
Greedy Technique
Algorithm
Prim s
Prim s algorithm
Kruskals Algorithm
Dijkstra s Algorithm
Huffman Trees
iterative Method
Simplex iterative Method
Maximum Flow Problem
Bipartite Graphs
Maximm Matching in Bipartite Graphs
marriage Problem
Stable marriage Problem
Algorithm Power
Algorithm Power Limitations
Arguments
Lower Bound
Lower Bound Arguments
Decision Trees
P NP
NP Complete
Backtracking
Coping with the Limitations
Backtracking
n Queens
Hamiltonian
Hamiltonian Circuit
Subset
Branch and Bound
Knapsack
Approximation Algorithms
Algorithms for NP
Approximation Algorithms for NP
Hard Problems
Salesman problem
Knapsack
Knapsack problem
Any Queries, please contact us @ 09677117110 or mail to NPTEL.Bodhbridge@btechguru.com
Distributed under Creative Commons Attribution-Share Alike - CC BY-SA.
Back to top
View Cart & Pay (0)