Data Structures and Algorithms Through C In-Depth Course Site


  • Basic knowledge of programming in any language

Subtitles are available for the first section only. Closed Captioning for the rest of the sections is in progress and is available as [Auto-generated].

This “Data Structures and Algorithms in C” tutorial will help you develop a strong background in Data Structures and Algorithms.

This course provides a comprehensive explanation of data structures like linked lists, stacks, and queues, binary search trees, heap, searching, hashing.

This course covers the following topics with C language implementation :

Algorithm Analysis, Big O notation, Time complexity, Singly linked list, Reversing a linked list, Doubly linked list, Circular linked list, Linked list concatenation, Sorted linked list.

Stack, Queue, Circular Queue, Dequeue, Priority queue, Polish Notations, Infix to Postfix, Evaluation of Postfix, Binary Tree, Binary Search Tree, Tree Traversal (inorder, preorder, postorder, level order), Recursion, Heap, Searching, Hashing

Sorting: Selection, Bubble, Insertion, Shell, Merging, Recursive Merge, Iterative Merge, Quick, Heap, Binary tree, Radix, Address calculation sort

Through this course, you can build a strong foundation and it will help you to crack Data Structures and Algorithms coding interview questions and work on projects. A good foundation on Data Structures and Algorithms interview topics helps you to attempt tricky interview questions.

In this Data Structures and Algorithms course, C language programs are used for implementing various concepts, but you can easily code them in any other programming languages like C++, C#, Java, Python.

Who this course is for:

  • Programmers looking for jobs
  • Programmers wanting to write efficient code
  • Computer Science students having Data Structures as part of their curriculum
  • Non-Computer Science students wanting to enter the IT industry
  • Content From:
  • C Programming Basics For Microcontrollers

Leave a Reply

Your email address will not be published. Required fields are marked *