Introduction to Backtracking || Backtracking General Method || Algorithm for Backtracking || DAA

Branch and Bound – Introduction & General Method | FIFO vs LC |Control Abstraction for LC Search|DAA

Ford-Fulkerson's Algorithm in DAA || Ford-Fluckerson's Algorithm || Design and Analysis of Algorithm

Graph Coloring Problem using Backtracking || Design and Analysis of Algorithms || Ex 3 || M Coloring

Graph Coloring Problem using Backtracking || Design and Analysis of Algorithms || Ex 2 || M Coloring

OBST Example || p(1 : 4 ) =( 1/20, 1/5, 1/10, 1/20) q(0: 4) = ( 1/5,1/10, 1/5,1/20,1/20 )

Introduction to Optimal Binary Search Tree | Design and Analysis of algorithms | Dynamic Programming

0/1 Knapsack Problem Using Dynamic Programming || Tabulation Method || DAA || Algorithms || Example2

0/1 Knapsack Problem Using Dynamic Programming || Tabulation Method || DAA || Algorithms || Example1

0/1 Knapsack Problem Using Dynamic Programming | Set method | Design and Analysis of Algorithms

Develop algorithm for Finding Sum of Array Elements | Smallest(Min) | Largest(Max) | Sorting | DAA

Develop an Algorithm to find Reverse of a number || Palindrome number or not || Factorial || DAA

[New] Single Source Shortest Path Algorithm | Dijkstra Algorithm | Greedy Method | DAA | Algorithms

[New] Job Sequencing with Deadlines || Greedy Method || Design & Analysis of Algorithms || DAA

Knapsack Problem | All Greedy Strategies & Feasible Solutions | Greedy Method | Fractional | DAA

T(n)=2T(n/2)+n | T(n)=2T(n/2)+2 | Recurrence Relations | Substitution Method | DAA

T(n) = 2T(n-1) + 1 | Recurrence Relation using Substitution Method | Design & Analysis of Algorithm

Recurrence Relations – Substitution Method || T(n)=T(n−1)+1| || T(n)=T(n−1)+2 || |T(n)=T(n−1)+n |DAA

Master’s Theorem || Solve Recurrence Relations || 20 Examples || Design & Analysis of Algorithms

Rabin Karp String Matching Algorithm with 2 Examples || Algorithm || Time Complexity || DAA

Naive String Matching Algorithm with Example || Brute Force Approach || Time Complexity || DAA

Towers of Hanoi Problem Algorithm | Time & Space Complexity | Design & Analysis of Algorithms | DS

Sum of Array Elements Algorithm || Recursive vs Iterative || Time & Space Complexity || DAA || DS

Fibonacci Algorithm | Recursive vs Iterative | Time and Space Complexity | DAA | DS |

Factorial Algorithm | Recursive vs Iterative | Time and Space Complexity | DAA | DS | Analysis

Calculating Time & Space Complexity for Matrix Addition and Multiplication | Same & Different Order

How to Calculate Time Complexity with Examples | Data Structures | Design and Analysis of Algorithms

Algorithm Specification in DAA with Pseudocode Conventions || Design & Analysis of Algorithms

Types of Files in Java || File Handling in Java || OOP

Map in Java || HashMap in Java || Collections || Core Java || Java Programming

Set in Java || HashSet in Java || Collections || Core Java || Java Programming

ArrayList vs LinkedList in Java || Differences between ArrayList and LinkedList (Collections)

Linked List Class in Java || Collections in Java || List Interface in Java

ArrayList in Java || List Interface in java || Collections in Java

Java Priority Queue Tutorial || PriorityQueue Implementation of Queue Interface || Collections

ArrayDeque in Java || ArrayDeque Implementation of Queue Interface in Java || Java Collections Frame

Queue Interface in Collections Part 1 || Queue in Java ||LinkedList Class & Queue Methods Explained

Collections Overview in Java || Introduction to Collections || Core Java || Java Programming

Collections - Difference between Arrays and Collections in Java

Methods in Java || OOPS

C Versus Java || Difference Between C, Java || Programming Languages Comparison

StringBuffer versus StringBuilder in Java || OOPs || Object Oriented Programming

Dirty Read Problem or Write-Read Conflict || Database Management System || Transaction Management

Schedule in DBMS || Serial Vs Parallel Schedule || Database Management System

Conversion of Mealy Machine to Moore Machine || Theory of computation || Formal language & Automata

Transaction States in DBMS || Database Management System || Transaction Management

ACID Properties of a Transaction || Database Management System || DBMS

Conversion of Moore Machine to Mealy Machine || Example 2

Beam Search Algorithm in Artificial Intelligence || Local Beam Search Algorithm ||Heuristic Search

Four Color Problem in Discrete mathematics || 4 - Color Problem || DMS || DM

Pseudo Graph || Simple Directed Graph || Multi Directed Graph || Discrete Mathematics

Goal Stack Planning ll Pickup, Putdown,Stack,Unstack,Precondition And Actions Explained With Example

Design a Moore Machine that counts occurrences of substring bab in any string || TOC || FLAT

Design a Moore Machine to Determine residue modulo 5 of a given binary number || TOC || FLAT

Johnson Counter in Digital Logic Design || Twisted Ring Counter || Switch tail || DLD | Electronics

Heuristic Search and Heuristic Function in Artificial Intelligence

Unification Algorithm || Knowledge Representation || Artificial Intelligence || Resolution

Uninformed Vs Informed Search in Artificial Intelligence | Search Strategies| Algorithms|Techniques

Resolution in Predicate logic || Is John like peanuts || Artificial Intelligence

Design a Moore Machine to find 2's Complement of a given Binary number || Theory of Computation