Comment
Author: Admin | 2025-04-28
Input Fractional Knapsack Problem Optimal File Merge Patterns Kruskal’s Minimum Spanning Tree Algorithm Prim’s Minimum Spanning Tree (MST) Prim’s MST for Adjacency List Representation Dijkstra’s shortest path algorithm Dijkstra’s Algorithm for Adjacency List Representation Introduction to Graph Algorithms Breadth First Traversal or BFS for a Graph Depth First Traversal or DFS for a Graph Applications of Depth First Search Detect Cycle in a Directed Graph Topological Sorting Bellman–Ford Algorithm Floyd Warshall Algorithm Shortest path with exactly k edges in a directed and weighted graph Biconnected graph Articulation Points (or Cut Vertices) in a Graph Check if a graph is strongly connected (Kosaraju’s Theoram) Bridges in a graph Transitive closure of a graph Dynamic Programming Introduction to Dynamic Programming Overlapping Subproblems Property Optimal Substructure Property Longest Common Subsequence Matrix Chain Multiplication 0-1 Knapsack Problem Min Cost Path Subset Sum Problem Bellman–Ford Algorithm Floyd Warshall Algorithm Total number of non-decreasing numbers with n digits Smallest power of 2 greater than or equal to n Searching, Sorting, Technique-based Theorem and Hashing Introduction to Searching Algorithms Introduction to Sorting Algorithm Linear Search Linear Search vs Binary Search Binary Search Selection Sort Bubble Sort Insertion Sort Merge Sort QuickSort Heap Sort Counting Sort Misc Top 20 Hashing Technique based Interview Questions CATEGORY ARCHIVES: ALGORITHMS Last Minute Notes – Algorithms Theory of Computation The syllabus or important topics of the Theory of Computation for the GATE CSE exam are provided below. Theory of Computation Notes for GATE CSE Regular Expression, Languages, Grammar, and Finite Automata Introduction of Theory of Computation Introduction to Finite Automata Designing Deterministic Finite Automata Set 1 Designing Deterministic Finite Automata Set 2 Designing Deterministic Finite Automata (Set 3) DFA machines accepting odd number of 0’s or/and even number of 1’s DFA for accepting the language L = {anbm | n+m=even} DFA for Strings not ending with “THE” Union process in DFA Concatenation process in DFA Minimization of DFA Designing Non-Deterministic Finite Automata (Set 1) Designing Non-Deterministic Finite Automata (Set 3) Conversion from NFA to DFA NFA with epsilon move to DFA Conversion Regular Expressions, Regular Grammar and Regular Languages How to write Regular Expressions? How to identify if a language is regular or not Generating regular expression from finite automata Designing Finite Automata from Regular Expression Closure properties of Regular languages Introduction To Grammar in Theory of Computation Chomsky Hierarchy Pumping Lemma Mealy and Moore Machines Difference between Mealy machine and Moore
Add Comment