Data Structures in C Language Online Certification Course

Learn the basic data & memory management of all computer programs

Created By: Niranjan Kumar

Course Duration : 1 Month

Free

Ratings

2510 Ratings | 4786 Enrollments

Includes

  • Certificate of completion

What will I learn?

  • Knowledge Stacks, Arrays, Linked Lists, B Trees and much more!

  • Ability to make efficient programs

  • Ability to apply data structures in not just C but other languages as well

Description

Data Structures is at the core of all the computer programs of the world. There can be no efficient computer program without an efficient data structure in the first place.

This course will take you through the most popular data structures used in today's computer programs. Not just that, it will also ensure that by the end of this course, you are able to code the same in C language as well. 

Curriculum

Beginning of DS World & Linked List

  • Introduction

  • List as abstract data type

  • Introduction to linked list

  • Array vs Linked list

  • Implementation of linked list

  • Insertion at the beginning in linked list

  • Insertion at the Nth position in linked list

  • Deletion at the Nth position in linked list

  • Doubly linked list implementation

  • Insertion at Nth position in Doubly linked list

  • Deletion at Nth position in Doubly linked list

Stacks

  • Introduction to Stacks

  • Array implementation of stacks

  • Linkedlist Implementation of stack

  • Infix, Prefix, Postfix

  • Evaluation of Postfix

  • Evaluation of Prefix

  • Infix to Postfix using Stack - Part A

  • Infix to Postfix using Stack - Part B

Queues

  • Introduction to Queue

  • Array Implementation of Queue

  • Array Implementation of Queue

  • Linked List Implementation of Queue

Trees

  • Introduction to Trees

  • Binary Tree

  • Implementation of Binary Tree

  • Binary Tree Traversal

  • Bredth First Search

  • Time Complexity of a program

Time Complexity

  • Time complexity analysis - How to calcuate running time?

  • Time complexity analysis - asymptotic notations - big oh, theta, omega

  • Time complexity analysis - asymptotic notations - big oh, theta, omega

Sorting

  • Introduction to Sorting

  • Selection Sort

  • Bubble Sort

  • Insertion Sort

  • Merge Sort

  • Analysis of Merge Sort

  • Quick Sort

  • Analysis of Quick Sort

About Instructors

Niranjan Kumar

A BITS Pilani graudate, with experience of over 8 years. Over last couple of years, he has been associated with the top companies like Oracle, and eBay. He is a proficient softwae architect, with deep experience in building highly scalable systems distributed online systems. He has in-depth working knowledge of technologies like Node.js and C++.

FAQ

How will I learn?

When you get access to the course, you will be able to see the modules within the course. Watch the videos whenever you get time and complete the tests for each module. The self-paced videos have been created by subject matter experts to ensure you learn from the best.

Will I get a certificate?

Yes, when you complete all videos and tests in the course you will be eligible for certification. Your certificate will get unlocked. You can share the certificate with others on social media and add it to your profile.

Copyright © 2021 Imarticus Learning Inc, All right reserved