There are no items in your cart
Add More
Add More
| Item Details | Price | ||
|---|---|---|---|
Master data structures, algorithms, and their implementation in programming.
Language: English
Instructors: Anand Mahajan
Why this course?
Description:
Data Structures Using C course covers the fundamentals of data structures and their implementation in C programming language.
Key Highlights:
What you will learn:
| Introduction to Data Structures | |||
| Introduction to Data Structures (5:00) | Preview | ||
| You Tube video on Introduction to data structures (58:00) | Preview | ||
| Brief intro to 1-D arrays (7:00) | Preview | ||
| Brief introduction to 2-D arrays (4:00) | |||
| Brief introduction to stacks (7:00) | Preview | ||
| Brief introduction to queues (6:00) | |||
| Brief introduction to linked lists (6:00) | |||
| Brief introduction to trees (3:00) | |||
| Brief introduction to graphs (4:00) | |||
| Brief introduction to computer memory (9:00) | |||
| Basics of algorithms | |||
| Learning to write algorithms (4:00) | |||
| Selection construct (5:00) | |||
| repeat while loop (6:00) | |||
| Repeat for loop (6:00) | Preview | ||
| Finding sum of array elements (9:00) | |||
| Finding the biggest in an array (4:00) | Preview | ||
| Difference between return and end statement (2:00) | |||
| Matrix addition algorithm (6:00) | |||
| Logic of matrix multiplication (8:00) | |||
| Matrix multiplication algorithm (8:00) | |||
| Introduction to complexity (3:00) | |||
| Big O notation (6:00) | |||
| Implementation of 1-d & 2-d arrays | |||
| Introduction to structure of C programs (3:00) | |||
| Downloading & installing Dev C++ IDE (7:00) | |||
| Declaring & initalising 1-D arrays (8:00) | |||
| Reading and accessing elements of 1-D Arrays (6:00) | |||
| Getting sum & average of array elements (4:00) | |||
| Getting the highest value among elements (11:00) | |||
| Reading & accessing 2-D array elements (8:00) | |||
| Matrix addition code (5:00) | Preview | ||
| Matrix multiplication code (8:00) | Preview | ||
| Implementation of searching techniques | |||
| Linear search explanation & algorithm (7:00) | |||
| Linear search code (5:00) | |||
| Explanation of binary search (10:00) | Preview | ||
| Binary search algorithm (5:00) | |||
| Binary search code (2:00) | |||
| Implementation of sorting techniques | |||
| Flow of logic of bubble sort (8:00) | |||
| Bubble sort code (7:00) | Preview | ||
| Bubble sort algorithm (2:00) | |||
| Flow of logic selection sort (7:00) | |||
| Selection sort code (7:00) | Preview | ||
| Selection sort algorithm (3:00) | |||
| Stacks & queues | |||
| Basics of stacks - Part 1 (4:00) | |||
| Basics of stacks - Part 2 (3:00) | |||
| Algorithm to push an element into a stack (2:00) | |||
| Algorithm to pop an element from a stack (1:00) | |||
| Basics of queues (11:00) | |||
| Algorithm to insert an element into a queue (3:00) | |||
| Algorithm to delete an element from a queue (4:00) | |||
| Revising pointers in C | |||
| Basics of pointers (7:00) | Preview | ||
| Pointers in action - Part 1 (5:00) | Preview | ||
| Pointers in action - Part 2 (4:00) | |||
| Pointers to pointer (5:00) | |||
| Pointer arithmetic (6:00) | Preview | ||
| Subtracting two pointer variables (2:00) | |||
| Arrays & pointers (7:00) | |||
| Dynamic memory allocation - Part 1 (7:00) | |||
| Dynamic memory allocation - Part 2 | |||
| Revising functions in C | |||
| Basics of functions (7:00) | Preview | ||
| Practical approach to functions - Part 1 (10:00) | |||
| Practical approach to functions - Part 2 (10:00) | |||
| Practical approach to functions - Part 3 (10:00) | |||
| Pointer to arithmetic (6:00) | |||
| Scope of variables - Part 1 (5:00) | |||
| Scope of variables - Part 2 (5:00) | |||
| Global variables (6:00) | |||
| Name clashing between local & global variables (5:00) | |||
| Some facts about return statement (4:00) | |||
| Call by value (5:00) | |||
| Call by reference (6:00) | |||
| Passing an array to a function (5:00) | |||
| Revising structures in C | |||
| Basics of structures (5:00) | |||
| Creating a structure & accessing members (5:00) | |||
| Working with multiple structures (6:00) | |||
| Pointer to structure (5:00) | |||
| Array of structures (7:00) | Preview | ||
| Alternative method of declaring structures (2:00) | |||
| Passing a structure to a function (5:00) | |||
| Passing a structure to a function by reference (4:00) | |||
| Implementation programs of stacks & queues | |||
| Programs of pushing & popping elements in a stack (12:00) | |||
| Programs of inserting & deleting elements in a queue (12:00) | |||
| Algorithms to insert nodes in a linear linked list | |||
| Revision of basics of linear linked lists (6:00) | |||
| Traversal of linear linked list (6:00) | |||
| Inserting a node in the beginning of a linear linked list - Part 1 (4:00) | |||
| Inserting a node in the beginning of a linear linked list - Part 2 (4:00) | |||
| inserting before a given node in a linear linked list - Part 1 (7:00) | |||
| inserting before a given node in a linear linked list - Part 2 (2:00) | |||
| Inserting after a given node in a linear linked list (6:00) | |||
| Algorithms to delete a node in a linear linked list | |||
| M8_T3_E1_deleting_first_node (5:00) | |||
| M8_T3_E2_deleting_a_given_node_PART_1 (9:00) | |||
| M8_T3_E3_deleting_a_given_node_PART_2 | |||
| Programs of creation, insertion & searching in a linear linked list | |||
| Creation of a linear linked list (12:00) | Preview | ||
| Inserting a node in the beginning of a linear linked list (8:00) | |||
| Searching a node in a linear linked list (9:00) | |||
| Inserting a node before a given node in a linear linked list (12:00) | Preview | ||
| Insert after a given node in a linear linked list (10:00) | |||
| Inserting a node at the end of a linear linked list (6:00) | |||
| Programs of deletion in a linear linked list | |||
| Deleting the first node in a linear linked list (5:00) | |||
| Deleting a particular node in a linear linked list (12:00) | |||
| Deleting a last node in a linear linked list (5:00) | |||
| Algorithms of traversal & insertion in a circular linked list | |||
| Traversal of a circular linked list (4:00) | |||
| Inserting a node in the beginning of a circular linked list (6:00) | |||
| Inserting a node before a given node in a circular linked list (5:00) | |||
| Inserting a node after a given node in a circular linked list (6:00) | |||
| Algorithms of deletion in circular linked list | |||
| Deleting the first node in a circular linked list (5:00) | |||
| Deleting a particular node in a circular linked list (5:00) | |||
| Implementation programs of traversal & insertion in a circular linked list | |||
| Creation & traversal of a circular linked list (14:00) | |||
| Inserting a node in the Beginning of a circular linked list (9:00) | |||
| Inserting a node after a given node in a circular linked list - Part 1 (11:00) | |||
| Inserting a node after a given node in a circular linked list - Part 2 (2:00) | |||
| Implementation programs of deletion in a circular linked list | |||
| Deleting a particular node in a circular linked list (19:00) | Preview | ||
| Algorithm of traversal & insertion into a doubly linked list | |||
| Traversal of a doubly linked list in both the directions (6:00) | |||
| Inserting before a given node in a doubly linked list (8:00) | |||
| Inserting after a given node in a doubly linked list (4:00) | |||
| Algorithms of deletion in a doubly linked list | |||
| Deletion of a particular node in a doubly linked list (2:00) | |||
| Implementation programs of creation & traversal of a doubly linked list | |||
| Creation of a doubly linked list (11:00) | |||
| Traversing a doubly linked list in both the directions (7:00) | |||
| Inserting at the beginning of a doubly linked list (7:00) | |||
| Inserting a node before a given node in a doubly linked list (13:00) | |||
| Inserting a node after a given node in a doubly linked list (11:00) | |||
| Implementation programs of deletion in a doubly linked list | |||
| Deletion of the first node in a doubly linked list - Part 1 (5:00) | Preview | ||
| Deletion of the first node in a doubly linked list - Part 2 (2:00) | Preview | ||
| Deletion of the last node in a doubly linked list (6:00) | |||
| Deletion of a particular node in a doubly linked list - Part 1 (11:00) | |||
| Deletion of a particular node in a doubly linked list - Part 2 (3:00) | |||
| Understanding trees | |||
| Revision of introduction to trees (3:00) | |||
| Two representations of a binary tree in memory (8:00) | |||
| Height of a binary tree (5:00) | |||
| Traversal of a binary tree - explanation & algorithms | |||
| Explanation of pre-order traversal of a binary tree (6:00) | |||
| Explanation of in-order traversal of a binary tree (6:00) | |||
| Explanation of post-order traversal of a binary tree (7:00) | |||
| Algorithm of pre-order traversal of a binary tree (14:00) | |||
| Algorithm of in-order traversal of a binary tree (11:00) | |||
| Algorithm of post-order traversal of a binary tree (16:00) | |||
| Binary Search Tree (BST) | |||
| Basics of binary search tree (4:00) | Preview | ||
| Second example of a BST (1:00) | |||
| Heaps | |||
| Basics of a heap (4:00) | Preview | ||
| Insertion in a heap (5:00) | |||
| Deletion of root node in a heap (4:00) | |||
| AVL tress (Height balanced tree) | |||
| Basics of a height balanced trees (AVL trees) (5:00) | Preview | ||
| Basics of graphs | |||
| Basics of graphs and their types (7:00) | |||
| Representation of graphs through adjacency matrix (5:00) | |||
| Representation of graphs through linked lists (4:00) | |||
| Introduction to maps and hashing | |||
| Basics of maps (2:00) | |||
| Basics of hash functions (7:00) | |||
After successful purchase, this item would be added to your courses.You can access your courses in the following ways :
Launch your Graphy
