Simple Snippets Courses

Circular Queue Data Structure with C++ Program Implementation - Data Structures & Algorithms

1 review

Learn to implement circular queue data structure in C++, overcoming limitations of simple queues by efficiently reusing memory locations through revolving front and rear pointers.

• YouTube
• 27 minutes
• On-Demand
• Free Video

Maximization LPP Problem Using Graphical Solution - Example 1 - Operational Research

1 review

Comprehensive tutorial on solving Linear Programming Problem maximization using graphical method, covering problem conversion, constraint plotting, feasible region identification, and profit maximization.

• YouTube
• 26 minutes
• On-Demand
• Free Video

Java Full Course for Beginners 2025 - Core Java and Object-Oriented Programming with Programs

1 review

Master Java fundamentals from variables to OOPs concepts with hands-on coding examples, exception handling, and collections framework in this comprehensive 10+ hour tutorial.

• YouTube
• 10 hours 52 minutes
• On-Demand
• Free Video

Closed Hashing - Linear Probing, Quadratic Probing & Double Hashing - Collision Control

Explore closed hashing techniques: linear probing, quadratic probing, and double hashing. Learn collision control strategies for efficient hash table implementation and data structure optimization.

• YouTube
• 31 minutes
• On-Demand
• Free Video

Deleting Key in B-Tree Data Structure - Deletion Process with Example

Comprehensive tutorial on deleting keys in B-Tree data structures, covering the deletion process with step-by-step examples and diagrams for better understanding.

• YouTube
• 28 minutes
• On-Demand
• Free Video

What Is Hashing - Why Do We Need It - What Is a Hash Function - Example - Array vs Hash Table

Explore hashing, hash functions, and hash tables. Learn their importance and benefits over arrays through practical examples and comparisons.

• YouTube
• 27 minutes
• On-Demand
• Free Video

M-way Search Tree Data Structure - Insertion and Deletion Operations

Learn insertion and deletion operations in M-way search trees through step-by-step examples. Gain practical understanding of this advanced data structure for efficient searching and organization.

• YouTube
• 24 minutes
• On-Demand
• Free Video

M-way Trees and M-way Search Trees - Comparison with Binary Search Trees

Explore M-way trees and M-way search data structures, comparing them to binary search trees. Learn their structure, benefits, and applications in data organization and retrieval.

• YouTube
• 24 minutes
• On-Demand
• Free Video

Graph Data Structure - Delete Edge Operation Using Adjacency List - Part 6

Learn to implement the delete edge operation in graph data structures using C++, focusing on adjacency list representation and practical coding techniques.

• YouTube
• 27 minutes
• On-Demand
• Free Video

Graph Data Structure - Update Edge Operation Using Adjacency List - Part 5

Learn to update edge weights in a graph using C++ with adjacency list implementation. Covers pseudocode, working principles, and practical coding for efficient graph manipulation.

• YouTube
• 34 minutes
• On-Demand
• Free Video

Graph DS - Print Graph Operation Using Adjacency List Implementation - Part 4

Learn to implement the print graph operation for adjacency list representation in C++, covering traversal techniques and efficient data structure usage.

• YouTube
• 27 minutes
• On-Demand
• Free Video

Graph Data Structures - Add Edge Operation Using Adjacency List Implementation - Part 3

Learn to implement the Add Edge operation in Graph Data Structures using C++. This tutorial covers pseudocode explanation and practical coding for efficient graph manipulation using adjacency lists.

• YouTube
• 43 minutes
• On-Demand
• Free Video

Graph Data Structure - Add Vertex Operation Using Adjacency List - Part 2

Learn to implement the Add Vertex operation in Graph Data Structure using C++ and adjacency list representation. Gain practical coding skills for efficient graph manipulation.

• YouTube
• 26 minutes
• On-Demand
• Free Video

Graph Traversal Techniques - Breadth First Search vs Depth First Search

Explore graph traversal techniques: BFS for level-wise exploration and DFS for deep path exploration. Learn implementation steps, applications, and differences between these fundamental algorithms.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Adjacency List in Graph Data Structure - Implementation and Concepts

Learn to implement adjacency lists for graph representation, covering array and linked list approaches. Gain practical insights into efficient graph data structure implementation.

• YouTube
• 22 minutes
• On-Demand
• Free Video