Course Information
Registration period
Year-round Recruitment
Course Level
Study Mode
Duration
15 Hour(s) 41 Minute(s)
Language
English
Taught by
Shibaji Paul
Certificate
- Available
- *The delivery and distribution of the certificate are subject to the policies and arrangements of the course provider.
Rating
2 views
Course Overview
Learn Data Structures and algorithms for Stack, Queue, Linked List, Binary Search Tree and Heap ( using C Programming ).
This course will help the students ability to grasp the knowledge of data structures and algorithm using the C programming language. Knowledge of Data Structures and Algorithms are essential in developing better programming skills.
This course is based on the standard curriculum of Universities across the globe for graduate level engineering and computer application course.
Apart from step by step development of concepts students will also learn how to write algorithms and then how to write programs based on the algorithms in this course.
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.
Course Content
- 14 section(s)
- 124 lecture(s)
- Section 1 Introduction to the course.
- Section 2 All about Stack
- Section 3 Step-by-step developing a parenthesis checking program using Stack.
- Section 4 Polish notation and Reverse Polish Notation.
- Section 5 All about Queue
- Section 6 Linked List
- Section 7 Singly Linked List
- Section 8 Doubly Linked List
- Section 9 Circular Linked List.
- Section 10 Efficiency of Algorithm
- Section 11 Binary Search
- Section 12 Recursion
- Section 13 Additional Learning - Binary Tree and Binary Search Tree.
- Section 14 Heap
What You’ll Learn
- Recursion, Stack, Polish Notations, infix postfix, FIFO, Circular & Double Ended Queue, Linked List - Linear, Double & Circular, Stack & Queue using Linked List
- What is stack, algorithms for Push and Pop operation. Implementation of Stack data structure using C.
- Using Stack - checking parenthesis in an expression
- Using Stack - Understanding Polish notations, algorithm and implementation of infix to postfix conversion and evaluation of postfix expression
- What is a FIFO Queue, understanding Queue operations - Insert and delete, implementing FIFO Queue
- Limitations of FIFO queue, concept of Circular Queue - Implementation of Circular queue.
- Concept of Double ended queue, logic development and implementation of double ended queue.
- Concept of Linked List - definition, why we need linked list.
- Singly Linked List - developing algorithms for various methods and then implementing them using C programming
- Doubly Linked List - developing algorithm of various methods and then implementing them using C programming
- Circular 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.
- Recursion, concept of Tail recursion, Recursion Vs Iteration.
- Binary Tree, definition, traversal (in-order, pre-order and post-order), binary search tree, implementation.
- Heap - concept, definition, almost complete binary tree, insertion into heap, heap adjust, deletion, heapify and heap sort.
Skills covered in this course
Reviews
-
RRavi Padasalagi
good
-
AAvik Mondal
Thank you for explaining me this so simple in our DS class I couldn't able to understand as much easier like this here they are providing all notes so well ya I am study from 2days before exam and ya its recommended notes if someone one to clear basics in DSA in C ya I think it would be better and quicker if you have provided searching and sorting in this course because the way you explain us I can't explain atleast I can able to write any code and ya no matter whatever the result I got but truth is they explain me tree,stack and queue in so simple and easy way
-
AAswani E
Good
-
CChitturi Anita
It was informative.
