20% OFF C / C++ Courses

Data Structures and Algorithms in C for Beginners

Instructor
Shuvam Sahoo
Last Update January 17, 2024
4.38 /5
(8)
0 already enrolled

About This Course

Hey there! Welcome to the course Data Structures and Algorithms in C for Beginners. This course gives all the necessary content on various data structures like Arrays, Stacks, Linkedlists, Queues, Trees and Graphs and how to implement them using C Programming. This course is also concentrated for beginners and so, we will start our lectures with the basic operations of arrays.

Post this couse, you will be able to

1. Explain all the operations of data structures.

2. Choose which data structure is apt to solve a particular problem.

3. Analyse the algorithm and find it's time complexity (Big O)

4. Understand the workflow of various searching and sorting algorithms.

5. Understand and explain all the basic terminologies and traversals of Binary Tree, Binary Search Tree and Graphs.

6. Solve problems on data structures.

7. Apply Stacks and Queue to solve most of the coding contests.

8. Take up multiple choice questions on DSA in competitive exams.

A basic knowledge in C Programming is preferred. If you find DSA to be difficult, this course has content to make you comfortable in the data structures and algorithms.

A computer program is a set of instructions designed to carry out a certain activity. A computer program may need to store, retrieve, and compute data in order to accomplish this.

A specified location that can be used to store and arrange data is called a data structure. Additionally, an algorithm is a series of procedures used to solve a certain problem. We may create computer programmes that are effective and optimised by learning data structures and algorithms.

Curriculum

10 Lessons 1 Month
Introduction
Types of Data Structures
Analysis of Algorithms I
Introduction to Asymptotic Notations and Big O
How to find time complexity ?
Problems on Time Complexities - Very Important
Introduction to Arrays
Giving array as user input
Storing and retrieving in an array
Inserting an element to the array
Insertion in an array - Coding!
Introduction to Stacks
Top of the stack
Last in First Out
Stack overflow and Stack underflow
Push and Pop code in c
Reversing a string using stack - Algorithm
Reversing a string using stack - C Code
Balanced Paranthesis Algorithm
Balanced Paranthesis Algorithm II
Balanced Paranthesis Algorithm III
Balanced Paranthesis checking using stack in c
Manual Conversion from Infix to Postfix
Algorithm for Infix to Postfix
Tracing Infix to Postfix Algorithm
Coding the algorithm for Infix to Postfix
Introduction to Linkedlists
Self referential structures
Review on Pointers
Structure of a Node
Linking the nodes in c
Inserting at the beginning - Algorithm
Insertion at the beginning - C code
Insertion at End - Algorithm
Insertion at end - C code
Insertion after a specific node - Algorithm
Inserting a new node after a specific node - C Code
Deletion at the beginning - Algorithm
Deletion at beginning - C code
Deletion at end - Algorithm
Deleting a specific node - C code
Circular Singly Linked Lists
Introduction to Queue
Disadvantage of Linear Queue
Basic Queue Operations
Introduction to Non Linear Data Structures
Tree Terminologies
Introduction to Binary Trees
Pre Order Traversal of BT
Post Order Traversal
Inorder Traversal
Binary Search Trees
Graph Terminologies
Representation of a Graph
Implementation of Binary Trees in C/C++
Implementation of Binary Trees in C,C++ - II
Program for Binary Trees - III
Introduction to Searching and Sorting Algorithms
Linear Search - Explanation
Linear Search - Code
Binary Search - Explanation
Implementing Binary Search
Bubble Sort
Implementation of Bubble Sort
Insertion Sort
QuickSort - Easy Explanation
Djikstra's algorithm - shortest path in a graph

Your Instructors

instructor

Shuvam Sahoo

4.75 /5
9 Courses 4 Reviews 73 Students
See more

Student Feedback

Reviews (3)

Write a review

Live Chat Section