Simple Snippets Courses

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

2 ratings

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
• Self-Paced
• Free Video

What Is Big O Notation and Time Complexity of Algorithms - Algorithm Analysis in Data Structures

1 rating

Comprehensive tutorial on Big O notation, time complexity, and algorithm analysis in data structures. Covers key concepts, practical examples, and calculation methods.

• YouTube
• 39 minutes
• Self-Paced
• Free Video

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

1 rating

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
• Self-Paced
• Free Video

Introduction to Computer Graphics - Course Overview

1 rating

Explore key concepts and definitions in computer graphics, laying the foundation for understanding this dynamic field and its applications in visual computing and digital media.

• YouTube
• 27 minutes
• Self-Paced
• Free Video

Fuzzy Logic and Fuzzy Set Theory - Concepts and Examples

1 rating

Discover fuzzy logic fundamentals, membership functions, and inference systems for AI applications in uncertain environments.

• YouTube
• 1 hour 20 minutes
• Self-Paced
• Free Video

Critical Path Method (CPM) - Solved Example for Project Management

1 rating

Comprehensive tutorial on Critical Path Method (CPM) in project management, covering key concepts, calculations, and a solved example to illustrate its practical application.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

Digital Electronics and Logic Design Full Course - Boolean Algebra, Logic Gates, K-Maps and Circuits

1 rating

Master Boolean algebra, logic gates, K-maps, and combinational circuits through comprehensive examples, truth tables, and practice problems for CS and electronics students.

• YouTube
• 6 hours 57 minutes
• Self-Paced
• 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
• Self-Paced
• 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
• Self-Paced
• 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
• Self-Paced
• 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
• Self-Paced
• 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
• Self-Paced
• 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
• Self-Paced
• 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
• Self-Paced
• 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
• Self-Paced
• Free Video