Hello, Everyone. Welcome to my YouTube channel, Cyber Enlightener. Here, I have provided lectures on various computer science subjects.
The playlist contains the following topics. This channel, previously known as Programming Circle.

1. Python Programming
2. C programming language series: Rags to riches
3. C -Pointer Series
4. Introduction to Machine Learning
5. Web Mining
6. DBMS
7. Design and Analysis of Algorithms
8. Data Structures and Algorithms
9. AWS Tutorial

Happy Learning!
The detailed information will be available at https://cyberenlightener.com/

Best Regards,

Mastering TSP with Dynamic Programming 🔥 | Solve the Ultimate Route Optimization Problem! 🚀
18:56
Mastering TSP with Dynamic Programming 🔥 | Solve the Ultimate Route Optimization Problem! 🚀
Job Sequencing with Deadline | Branch and Bound Method Explained!
11:25
Job Sequencing with Deadline | Branch and Bound Method Explained!
Bellman-Ford Algorithm Explained | Short & Simple
16:45
Bellman-Ford Algorithm Explained | Short & Simple
HASHING : QUADRATIC PROBING || Data Structure
7:38
HASHING : QUADRATIC PROBING || Data Structure
Quicksort algorithm ||Divide and Conquer Sorting Algorithm Quick Sort Algorithm Explained
13:04
Quicksort algorithm ||Divide and Conquer Sorting Algorithm Quick Sort Algorithm Explained
Dijkstra's algorithm
29:30
Dijkstra's algorithm
Polynomials representation and addition using Linked List|| Basic Intro
10:18
Polynomials representation and addition using Linked List|| Basic Intro
MERGE SORT
14:34
MERGE SORT
Deletion of NODES in AVL tree || Replace with in-order predecessors or in order successor
10:55
Deletion of NODES in AVL tree || Replace with in-order predecessors or in order successor
AVL Tree
15:21
AVL Tree
Binary Search Tree|| Inorder , Preorder and Postorder traversal| C code implementation
35:22
Binary Search Tree|| Inorder , Preorder and Postorder traversal| C code implementation
𝐄𝐂𝟐 𝐢𝐧𝐬𝐭𝐚𝐧𝐜𝐞𝐬, 𝐭𝐲𝐩𝐞𝐬, 𝐟𝐚𝐦𝐢𝐥𝐲, 𝐕𝐏𝐂 𝐟𝐨𝐫 𝐄𝐂𝟐;𝐏𝐫𝐢𝐯𝐚𝐭𝐞,𝐏𝐮𝐛𝐥𝐢𝐜 𝐒𝐮𝐛𝐧𝐞𝐭𝐬,𝐑𝐨𝐮𝐭𝐞𝐓𝐚𝐛𝐥𝐞𝐬&𝟎.𝟎.𝟎.𝟎/𝟎(𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟔)
16:25
𝐄𝐂𝟐 𝐢𝐧𝐬𝐭𝐚𝐧𝐜𝐞𝐬, 𝐭𝐲𝐩𝐞𝐬, 𝐟𝐚𝐦𝐢𝐥𝐲, 𝐕𝐏𝐂 𝐟𝐨𝐫 𝐄𝐂𝟐;𝐏𝐫𝐢𝐯𝐚𝐭𝐞,𝐏𝐮𝐛𝐥𝐢𝐜 𝐒𝐮𝐛𝐧𝐞𝐭𝐬,𝐑𝐨𝐮𝐭𝐞𝐓𝐚𝐛𝐥𝐞𝐬&𝟎.𝟎.𝟎.𝟎/𝟎(𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟔)
𝐀𝐖𝐒 𝐂𝐨𝐦𝐩𝐮𝐭𝐞 𝐒𝐞𝐫𝐯𝐢𝐜𝐞𝐬||𝐄𝐂𝟐 & 𝐨𝐭𝐡𝐞𝐫𝐬(𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟓)
14:44
𝐀𝐖𝐒 𝐂𝐨𝐦𝐩𝐮𝐭𝐞 𝐒𝐞𝐫𝐯𝐢𝐜𝐞𝐬||𝐄𝐂𝟐 & 𝐨𝐭𝐡𝐞𝐫𝐬(𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟓)
𝐀𝐖𝐒 𝐈𝐝𝐞𝐧𝐭𝐢𝐭𝐲 𝐚𝐧𝐝 𝐀𝐜𝐜𝐞𝐬𝐬 𝐌𝐚𝐧𝐚𝐠𝐞𝐦𝐞𝐧𝐭 (𝐈𝐀𝐌)(𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟒)
12:21
𝐀𝐖𝐒 𝐈𝐝𝐞𝐧𝐭𝐢𝐭𝐲 𝐚𝐧𝐝 𝐀𝐜𝐜𝐞𝐬𝐬 𝐌𝐚𝐧𝐚𝐠𝐞𝐦𝐞𝐧𝐭 (𝐈𝐀𝐌)(𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟒)
𝐀𝐖𝐒 𝐒𝐡𝐚𝐫𝐞𝐝 𝐑𝐞𝐬𝐩𝐨𝐧𝐬𝐢𝐛𝐢𝐥𝐢𝐭𝐲 𝐌𝐨𝐝𝐞𝐥(𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟑)
13:08
𝐀𝐖𝐒 𝐒𝐡𝐚𝐫𝐞𝐝 𝐑𝐞𝐬𝐩𝐨𝐧𝐬𝐢𝐛𝐢𝐥𝐢𝐭𝐲 𝐌𝐨𝐝𝐞𝐥(𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟑)
𝐀𝐖𝐒 𝐆𝐥𝐨𝐛𝐚𝐥 𝐈𝐧𝐟𝐫𝐚𝐬𝐭𝐫𝐮𝐜𝐭𝐮𝐫𝐞(𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟐)|| AWS
21:52
𝐀𝐖𝐒 𝐆𝐥𝐨𝐛𝐚𝐥 𝐈𝐧𝐟𝐫𝐚𝐬𝐭𝐫𝐮𝐜𝐭𝐮𝐫𝐞(𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟐)|| AWS
𝐈𝐧𝐭𝐫𝐨𝐝𝐮𝐜𝐭𝐢𝐨𝐧 𝐭𝐨 𝐂𝐥𝐨𝐮𝐝 𝐂𝐨𝐦𝐩𝐮𝐭𝐢𝐧𝐠 (𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟏)
22:12
𝐈𝐧𝐭𝐫𝐨𝐝𝐮𝐜𝐭𝐢𝐨𝐧 𝐭𝐨 𝐂𝐥𝐨𝐮𝐝 𝐂𝐨𝐦𝐩𝐮𝐭𝐢𝐧𝐠 (𝐓𝐮𝐭𝐨𝐫𝐢𝐚𝐥 #𝟏)
Freivalds’ Algorithm : a randomized algorithm to verify matrix multiplication || Monte Carlo
40:15
Freivalds’ Algorithm : a randomized algorithm to verify matrix multiplication || Monte Carlo
Miller Rabin Primality Test
12:52
Miller Rabin Primality Test
Theorem: Approx-Vertex-Cover is a polynomial time 2-approximation algorithm for Vertex Cover.
23:13
Theorem: Approx-Vertex-Cover is a polynomial time 2-approximation algorithm for Vertex Cover.
Learn About Approximation Algorithms for Bin Packing
12:16
Learn About Approximation Algorithms for Bin Packing
Randomized Algorithm & QuickSort : Average Case, Worst Case, & Imbalance partition
15:00
Randomized Algorithm & QuickSort : Average Case, Worst Case, & Imbalance partition
𝐑𝐚𝐧𝐝𝐨𝐦𝐢𝐳𝐞𝐝 𝐐𝐮𝐢𝐜𝐤 𝐒𝐨𝐫𝐭: 𝐄𝐱𝐩𝐥𝐨𝐫𝐢𝐧𝐠 𝐄𝐱𝐩𝐞𝐜𝐭𝐞𝐝 𝐑𝐮𝐧𝐧𝐢𝐧𝐠 𝐓𝐢𝐦𝐞 𝐢.𝐞 𝐄(𝐱)
27:36
𝐑𝐚𝐧𝐝𝐨𝐦𝐢𝐳𝐞𝐝 𝐐𝐮𝐢𝐜𝐤 𝐒𝐨𝐫𝐭: 𝐄𝐱𝐩𝐥𝐨𝐫𝐢𝐧𝐠 𝐄𝐱𝐩𝐞𝐜𝐭𝐞𝐝 𝐑𝐮𝐧𝐧𝐢𝐧𝐠 𝐓𝐢𝐦𝐞 𝐢.𝐞 𝐄(𝐱)
Doubly Linked List : Hands on C programming for inserting a node at the beginning Data Structures
27:41
Doubly Linked List : Hands on C programming for inserting a node at the beginning Data Structures
Branch and Bound for TSP(Travelling Sales Person Problem) || LC-Branch and Bound for LSP
26:41
Branch and Bound for TSP(Travelling Sales Person Problem) || LC-Branch and Bound for LSP
𝐁𝐫𝐚𝐧𝐜𝐡 𝐚𝐧𝐝 𝐁𝐨𝐮𝐧𝐝: 𝟒 𝐐𝐔𝐄𝐄𝐍𝐒|| 𝟎/𝟏 𝐊𝐧𝐚𝐩𝐬𝐚𝐜𝐤||𝐉𝐨𝐛 𝐀𝐬𝐬𝐢𝐠𝐧𝐦𝐞𝐧𝐭 𝐏𝐫𝐨𝐛𝐥𝐞𝐦, 𝐁𝐚𝐜𝐤𝐭𝐫𝐚𝐜𝐤𝐢𝐧𝐠 𝐯𝐬 𝐁𝐫𝐚𝐧𝐜𝐡 𝐚𝐧𝐝 𝐛𝐨𝐮𝐧𝐝.
1:05:08
𝐁𝐫𝐚𝐧𝐜𝐡 𝐚𝐧𝐝 𝐁𝐨𝐮𝐧𝐝: 𝟒 𝐐𝐔𝐄𝐄𝐍𝐒|| 𝟎/𝟏 𝐊𝐧𝐚𝐩𝐬𝐚𝐜𝐤||𝐉𝐨𝐛 𝐀𝐬𝐬𝐢𝐠𝐧𝐦𝐞𝐧𝐭 𝐏𝐫𝐨𝐛𝐥𝐞𝐦, 𝐁𝐚𝐜𝐤𝐭𝐫𝐚𝐜𝐤𝐢𝐧𝐠 𝐯𝐬 𝐁𝐫𝐚𝐧𝐜𝐡 𝐚𝐧𝐝 𝐛𝐨𝐮𝐧𝐝.
Mastering Singly Linked Lists in C: Implementation, Operations, and Best Practices
21:55
Mastering Singly Linked Lists in C: Implementation, Operations, and Best Practices
Longest Common Subsequence (LCS) : Dynamic programming solutions for
36:35
Longest Common Subsequence (LCS) : Dynamic programming solutions for
Tiling Problem using Divide and Conquer|| Defective chess board
13:12
Tiling Problem using Divide and Conquer|| Defective chess board
Solving Coin Change Problem using Greedy Algorithm
12:06
Solving Coin Change Problem using Greedy Algorithm