Lesson 1 of 63 • 164 upvotes • 9:09 mins

This lesson explains the concept of data structures and briefly tell the set of data structures to be covered in the course. Linear and Non Linear data structures are explained along with the possible set of operations to be performed on those.

63 lessons • 10h 36m

Introduction to Data Structures and Algorithms

9:09 mins

Introduction to 1D Arrays

13:28 mins

Initializing and Traversing an Array

9:09 mins

Application of an Array

14:45 mins

Deleting an element from an array

10:52 mins

Inserting an element in an Array

8:21 mins

Searching in an array

8:29 mins

C program for Linear Search

9:39 mins

Binary Search in Arrays

12:17 mins

Binary Search Program in C language

7:53 mins

Sorting an Array - Selection Sort

12:45 mins

Sorting an Array using BUBBLE Sort

12:04 mins

Sorting using Shell Sort

7:10 mins

Sorting an Array using Insertion Sort

12:31 mins

C program for Selection Sort

6:16 mins

Merging two arrays

12:20 mins

Program to merge arrays

7:27 mins

Two Dimensional Array - Matrices

11:33 mins

Transpose of a Matrix

9:31 mins

Adding or subtracting two matrices

7:17 mins

Multiplication of two matrices

12:05 mins

C program to multiply two matrices

10:30 mins

Multidimensional Arrays

8:34 mins

Introduction to Strings(Array of Characters)

10:39 mins

Calculate length of a string

9:29 mins

Processing Strings - Counting vowels

10:36 mins

Checking if string is a Palindrome or not.

8:29 mins

Array of Strings or 2D array of characters

9:24 mins

String.h library functions

10:40 mins

Pointers in C - Introduction

12:01 mins

Call by Value Vs Call By Reference/Pointers

13:37 mins

Examples of Call By Reference

8:40 mins

Arrays and Pointers relationship

9:44 mins

Passing arrays as arguments to functions

10:32 mins

Dynamic Memory Allocation

8:48 mins

Introduction to stacks and its applications

8:49 mins

Implementing Stack using arrays in C language

13:06 mins

Checking Parenthesis in Arithmetic expressions using Stack

12:22 mins

Infix to postfix conversion or reverse polish notation

14:07 mins

Infix to Postfix conversion containing Parenthesis

9:36 mins

Evaluation of Postfix expression using Stack

9:20 mins

Introduction to Queue and its Application

13:20 mins

Implementation of Queue using Arrays : Linear Queue

12:50 mins

Implementation of Queue using Circular Array

11:44 mins

Introduction to Linked List and Dynamic Memory Allocation

10:21 mins

Inserting a node at the end of linked list.

12:23 mins

Traversing a Linked List

8:28 mins

Adding a Node at the Beginning of a linked list.

7:46 mins

Inserting Node at a given position in linked list

10:04 mins

Deleting a Node from Beginning of a Linked List

8:03 mins

Deleting a Node from End of a Linked List

7:16 mins

Deletion from a given position in the Linked List

9:05 mins

Searching a Value in a Single Linked List

7:43 mins

Sorting a Linked List

7:55 mins

Merging two linked lists

11:00 mins

Implementing Stacks using Linked List

8:05 mins

Implementing Queue using Linked List

9:06 mins

Circular Linked List

10:24 mins

Insertion into a Circular Linked List

11:51 mins

Deletion from a Circular Linked List

9:09 mins

Introduction to Double Linked List

8:31 mins

Insertion at End in Double Linked List

8:26 mins

Insertion at Beginning of a Double Linked List

8:05 mins