You will learn the following in this course: (All implemented using C programming)
Fundamental of Data Structure concept
Why we need Data Structures
Stack - Idea, definition, algorithm, implementations.
Using Stack - Parenthesis checking, Polish Notation, Infix to postfix conversion and evaluation.
FIFO Queue - Idea, definition, algorithm, implementation.
Circular Queue using array - Idea, definition, algorithm, implementation.
Double ended queue using array - Idea, definition, algorithm, implementation.
Linked List - Idea, definition, why we need linked list. Comparison with array.
Singly Linked List - Development of algorithm for various operations and then Implementation of each of them
Creating Stack and Queue using Singly Linked list - Implementation.
Doubly Linked List - Idea, definition, algorithm of various operations and implementations.
Circular Linked List - Idea, definition, algorithm and implementations.
14. Calculating efficiency of algorithms, Worst Case (Big Oh), Average Case (Big Theta) and Best case (Big omega) complexities. How to calculate them for different algorithms.
15. Binary Searching
16. Recursion in detail. Example program using recursion and the critical comparison between Recursive approach and Iterative approach of problem solving.
17. Binary Tree, definition, traversal (In, Pre and Post Order), Binary Search Tree implementation.
18. Heap data structure, definition, heap insertion, deletion, heap adjust, Heapify and heap sort.
✔14section ✔ 122lectures ✔ 15h 42m total length
✔ Recursion, Stack, Polish Notations, infix to postfix, FIFO Queue, Circular Queue, Double Ended Queue, Linked List - Linear, double and Circular - all operations, Stack and Queue using Linked List
✔ Using Stack - checking parenthesis in an expression
✔ What is a FIFO Queue, understanding Queue operations - Insert and delete, implementing FIFO Queue
✔ Concept of Double ended queue, logic development and implementation of double ended queue.
✔ Singly Linked List - developing algorithms for various methods and then implementing them using C programming
✔ Circular Linked List - developing algorithm of various methods and then implementing them using C programming
✔ Recursion, concept of Tail recursion, Recursion Vs Iteration.
✔ What is stack, algorithms for Push and Pop operation. Implementation of Stack data structure using C.
✔ Using Stack - Understanding Polish notations, algorithm and implementation of infix to postfix conversion and evaluation of postfix expression
✔ Limitations of FIFO queue, concept of Circular Queue - Implementation of Circular queue.
✔ Concept of Linked List - definition, why we need linked list.
✔ Doubly Linked List - developing algorithm of various methods and then implementing them using C programming
✔ How to estimate time complexity of any algorithm. Big Oh, Big Omega and Big Theta notations.
✔ Binary Tree, definition, traversal (in-order, pre-order and post-order), binary search tree, implementation.
You will get best quality content in this course. After getting through this course your fundamentals concepts will be super clear.
Get certified by Tutedude. You can ask for the certificate after completing the course in chat section.
If you have any doubt while learning, just type your doubt on the chat option and you will get connected to the mentor as soon as possible to clear all your doubts
✔ Students who want to prepare themselve for interview of top companies like Google, Amazon or Microsoft.
✔ Students who are looking forward to be an efficient programmer, who are having data structures in their syllabus.
✔ Students who wants to have in dept knowledge about the Stack, Queue and Linked List, Efficiency of Algorithm, Binary Tree, Heap