Akhilesh Kumar Srivastava

GATE Questions on Context Free Languages - Part 4

Circular Queue: Comparison with Linear Queue, Insertion and Deletion Algorithm

Syntax Directed Translation - SDT for postfix, syntax tree, Decimal to Binary : Lecture 4

Linearly Bounded Automata (LBA)

TAFL Exam Preparation Strategy || Important Topics & Important Questions

11.5 Priority Queue using Linked List

Turing Machine for a^n b^n c^n - Example 2

Turing Machine for 2's Complement of Binary Number - Example 5

CFG to PDA Conversion - AKTU Exam question - Example 3

Universal Turing Machine || Theory of Computation

Turing Machine - AKTU 2018-19 Exam Question - Example 13

Push Down Automata (PDA) To Context Free Grammar (CFG) Conversion || Example 1

K-Closest Points to Origin || Leetcode || Problem Solving

Generate Parenthesis || Leetcode || Problem Solving

Turing Machine for Regular Languages

Sum of Array Element using Recursion || Problem Solving using C/C++

Context Free Grammar (CFG) to Push Down Automata (PDA) - Part 2

Closure Properties of Context Free Languages (CFL) || Union, Concatenation, Kleens Closure || Part1

Closure Properties of Regular Languages (Union, Intersection, Concatenation, Complement) - Part 1/4

Trie Insertion and Search || Advance Data Structure || Problem Solving

Closure Properties of Context Free Languages (CFL) || Intersection, Complementation || Part2

Context Free Grammar (CFG) to Push Down Automata (PDA) - Part 1

Church's Turing Thesis || Theory of Computation

Closure Properties of Regular Languages (Homomorphism) - Part 3/4

Closure Properties of Regular Languages (Reversal) - Part 2/4

Writing Comparator for Sorting in C++ STL || Problem Solving

Unique Paths || Leetcode || Problem Solving

Turing Machine - AKTU 2016-17 Exam Question - Example 12

PDA to CFG Conversion - AKTU 2015-16 Exam question - Example 3

Non Deterministic Push Down Automata (NPDA) || a^n b^n ∪ a^n b^2n || Example 2

11.4 Priority Queue - Linked List Implementation : Programming of Queue

Longest Common Sub-sequence (LCS): Dynamic Programming Solution

PDA - Push Down Automata || Example 4 || a^n b^m c^n

PDA - Push Down Automata || Example 2 || no of (a)=no of (b)

PDA - Push Down Automata || Definition and first Example || a^n b^n

2-Stack Push Down Automata (PDA) || a^n b^n c^n || Example 1

Syntax Directed Translation: SDT for arithmetic expression evaluation - Lecture 2

Turing Machine for Multiplication of Numbers - Example 8

GATE Questions on Context Free Languages - Part 6

11.4 Priority Queue using Array

Syntax Directed Translation (SDT): Synthesized and Derived Attributes - Lecture 5

15. Reverse doubly Linked List | Hackerrank Linked List Module

9.3 Address Calculation in 2 Dimensional Array(Row Major Order)-Index Formula Derivation & Numerical

3. Insert a node at the Head of a Linked List | Hackerrank Linked List Module

Closure Properties of Regular Languages (Inverse Homomorphism) - Part 4/4

1. Print the Elements of a Linked List | Hackerrank Linked List Module

Concept of Activation Record in Function Call

10.23 Recursion: Finding Time and Space Complexity of Recursive Functions

Syntax Directed Translation (SDT) - Lecture 1

Decimal to Binary, Octal, Hexadecimal Conversion using Stack: Algorithm Programming in C

9.4 Address Calculation in 2 Dimensional Array (Column Major Order) - Index Formula Derivation