This Course is designed for the Students who are preparing for the Following Examinations
- GATE Computer Science
- NTA UGC NET Computer Science
- ISRO SC – Computer Science
- BARC – Computer Science
- DRDO – Computer Science
Chapters Covered in this course are:
- Arrays, String
- Stacks, Queues
- Linked Lists
- Trees : Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL Tree
- Data Structure for Sets, Graphs
- Hashing
Course Curriculum
| 01 Linked List | |||
| 01 Introduction to Linked list – Data Structures Using C | 00:06:53 | ||
| 02 Create a Node Function – Data Structures Using C | 00:09:42 | ||
| 03 Add a Node in the beginning of Linked List – Data structures using C | 00:10:00 | ||
| 04 Add a Node in the End of a Linked List – Data structures using C | 00:09:59 | ||
| 05 Counting the Number of nodes in the linked list – Data structures using C | 00:06:29 | ||
| 06 Add A node in the Middle of the Linked List using Count node Function – Data structures using C | 00:11:42 | ||
| 07 Add a Node in the Middle of the linked list Using Pointers – Data structures Using C | 00:17:13 | ||
| 08 Print all the data from the linked list – Data Structures Using C | 00:04:31 | ||
| 09 Printing All the Data Present in the Linked List using Recursive function – Data Structures Using C | 00:13:09 | ||
| 10 Reversing a Linked list using Pointers (Non Recursive) – Data Structures & Algorithms using C | 00:24:00 | ||
| 11 Recursive program to reverse a linked list – Data structures using C | 00:07:06 | ||
| 12 Delete a Node from the beginning of the linked List – Data Structures Using C | 00:06:55 | ||
| 13 Delete a node from the End of the Linked List – Data Structures Using C | 00:08:30 | ||
| 14 GATE 2010 Question on Linked List – Data Structures Using C | 00:09:27 | ||
| 15 GATE 2005 Question on Linked List -Data Structures Using C | 00:09:27 | ||
| 16 Searching in Singly Linked List – Data Structures Using C | 00:08:45 | ||
| 17 Introduction to Doubly & Circular Linked List – Data Structures Using C | 00:10:56 | ||
| 18 Operations on Doubly and Circular Linked List – Data Structures Using C | 00:24:00 | ||
| 02 Stacks & Queues | |||
| 19 Stack Implementation Using Array – Data Structures Using C | 00:23:00 | ||
| 20 Stack Implementation Using Linked List – Data Structures Using C | 00:12:16 | ||
| 21 Stacks & Queues Animation – Data Structures Using C | 00:08:31 | ||
| 22 Towers of Hanaoi – Data Structures Using C | 00:40:40 | ||
| 23 Postfix to Infix – Data Structures Using C | 00:02:28 | ||
| 24 Evaluation of Postfix Expression – Data Structures Using C | 00:02:28 | ||
| 25 Infix to Postfix Notation – Data Structures Using C | 00:08:54 | ||
| 26 Infix to Prefix Notation – Data Structures Using C | 00:04:24 | ||
| 27 Postfix to Prefix Notation – Data Structures Using C | 00:01:50 | ||
| 28 Towers of Honoi – Data Structures Using C | 00:01:00 | ||
| 29 Stacks and Queues Animation – Data Structures Using C | 00:08:31 | ||
| 30 Stack Implementation Using Array – Data Structures Using C | 00:23:08 | ||
| 31 Queues – Data Structures Using C | 00:15:18 | ||
| 03 Trees | |||
| 32 Introduction to binary Trees Inorder, Preorder & Post Order in Binary Trees – Data Structures Using C | 00:44:58 | ||
| 33 Inorder, Preorder and Post Order Examples – Data Structures Using C | 00:23:39 | ||
| 34 Double Order and Triple Order – Data Structures Using C | 00:10:16 | ||
| 35 How Many Different Binary Trees Possible – Data Structures Using C | 00:06:47 | ||
| 36 Count the Number of Nodes in a Binary Tree – Data Structures Using C | 00:05:44 | ||
| 37 Count the Number of Leaf Nodes in the Binary Tree – Data Structures Using C | 00:07:57 | ||
| 38 Count the Number of Full Nodes in the Binary Tree – Data Structures Using C | 00:06:10 | ||
| 39 GATE Question on Binary Trees – Data Structures Using C | 00:20:14 | ||
| 40 Threaded Binary Tree – Data Structures Using C | 00:14:12 | ||
| 41 Introduction to Binary Search Trees – Data Structures Using C | 00:14:04 | ||
| 42 Binary Search Tree Insertion and Find Max Min Basics – Data Structures Using C | 00:15:00 | ||
| 43 BST Previous Year Gate Problems – Data Structures Using C | 00:18:37 | ||
| 44 Introduction to AVL Trees – Balanced Binary Search Trees in Data structures – Rotations | 00:27:50 | ||
| 04 Graphs | |||
| 45 Introduction to graphs – Adjacency List – Adjacency Matix – Shortest Path Problem – Data Structures Using C | 00:39:28 | ||
| 46 Depth First Search (DFS) – Data Structures Using C | 00:37:00 | ||
| 47 GATE 2003 QUESTION ON DFS – Data Structures Using C | 00:08:18 | ||
| 48 Breadth First Search (BFS) – Data Structures Using C | 00:16:29 | ||
| 05 Hashing | |||
| 49 Double Hashing – Linear Probing – Seprate Chaining – Rehashing – Data Structures Using C | 00:37:39 | ||
| 06 Live Classes | |||
| Class 01 Data Structures using C | 00:59:53 | ||
| Class 02 Data Structures using C | 01:04:00 | ||
| Class 03 Data Structures using C | 01:12:00 | ||
| Class 04 Data Structures using C | 01:43:00 | ||
| Class 05 Data Structures using C | 00:56:00 | ||
| Class 06 Data Structures using C | 01:07:00 | ||
| Class 07 Data Structures using C | 00:44:50 | ||
| Class 08 Data Structures using C | 01:15:00 | ||
| Class 09 Data Structures using C | 01:39:00 | ||
| Class 10 Data Structures using C | 01:17:00 | ||
| Class 11 Data Structures using C | 00:57:00 | ||
| Program Implementations | |||
| 1.1 Linear Search Implementation | 00:08:51 | ||
| 2.1 Comparison of Bubble Sort & Improved Bubble Sort on Actual Machine Running Time | 00:21:41 | ||
| 2.2 Selection Sort vs Bubble Sort on Actual Machine Running Time | 00:14:37 | ||
| 2.3 Insertion Sort vs Selection Sort & Bubble Sort Algorithm | 00:15:14 | ||
| 2.4 Quick Sort | 00:23:00 | ||
| 2.5 Merge Sort | 00:25:49 | ||
| 3.1 String Matching Algorithms Introduction | 00:06:42 | ||
| 3.2 Naive String Matching Algorithm | 00:12:22 | ||
| 3.3 Implementation of Naive String Matching Algorithm | 00:13:46 | ||
| 3.4 Introduction to Rabin Karp String Matching Algorithm Part 1 | 00:10:49 | ||
| 3.5 The Rabin Karp String Matching Algorithm Prelims – Part 2 | 00:12:34 | ||
| 3.6 The Rabin Karp String Matching Algorithm Preprocessing the Pattern – Part 3 | 00:18:11 | ||
| 3.7 The Rabin Karp String Matching Algorithm – Part 4 | 00:12:25 | ||
| UPPSC LT Grade Computer Teacher Answer Keys of 29 July 2018 Part 2 | 00:27:00 | ||
447 STUDENTS ENROLLED
