Anjali Luthra

This course will provide detailed study of linear and non linear data structures. It will cover all operations on Arrays, Linked List, Stack, Queues, Trees and Graphs.

Programming

English

Data Structures and Algorithms: Programming

Data Structures

Basics of Python

Python Language

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

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.

Introduction to Data Structures and Algorithms

This lesson explains the concept of arrays. You learn why arrays are needed , how to create and process an array. All primary features of arrays are discussed.

Introduction to 1D Arrays

This lesson explains how to initialize an array in C language. We also discuss the traversal of an array in detail.

Initializing and Traversing an Array

This lesson explains how and where we can use arrays to create meaningful applications. We create a bill statement using arrays in C language program.

Application of an Array

This video explains how deletion is performed from an array. Pseudocode /algorithm of deletion is explained along with program in C language.

Deleting an element from an array

This lesson explains the concept of inserting an element in an array. How the shifting has to be done and the pseudocode for insertion is discussed and explained.

Inserting an element in an Array

This lesson explains the working of Linear search algorithm on arrays. Complexity of Linear search is O(n) and how is that derived is also explained in the given lesson.

Searching in an array

This lesson is to explain how to write linear search program in C language.

C program for Linear Search

This lesson explains the concept of Binary Search. Working of Binary Search is discussed in detail with example and then pseudocode and complexity.

Binary Search in Arrays

This lesson explains how we can code for Binary Search in C language.  It shows the complete program and it's working.

Binary Search Program in C language

This lesson explains the working of Selection Sort. How the numbers are compared and moved to bring them in increasing order. Complexity of algorithm is O(n^2)

Sorting an Array - Selection Sort

This lesson explains the working of bubble sort on arrays. The complexity and pseudocode of algorithm is also explained.

Sorting an Array using BUBBLE Sort

This lesson explains what is shell sort, it's working with example and algorithm.

Sorting using Shell Sort

This lesson explains how to use insertion sort to sort an array.

Sorting an Array using Insertion Sort

This lesson show the execution of selection sort program.

C program for Selection Sort

This lesson explains how to combine two arrays to create a third one where the input arrays are already sorted and result array is also in sorted order.

Merging two arrays

This lesson explains how to write c program for merging of two arrays.

Program to merge arrays

This lesson explains how to use two dimensional arrays. It explains what 2d arrays are, and how they can be processed.

Two Dimensional Array - Matrices

This lesson explains what do we mean by transpose of a matrix. We discuss the procedure and also the pseudocode for the same.

Transpose of a Matrix

This lesson show how matrices can be added and how can we write a code to do the same.

Adding or subtracting two matrices

This video explains how to multiply two matrices , also the algorithm to multiply two matrices is discussed and explained

Multiplication of two matrices

In this lesson program for multiplying two matrices in C language is explained in detail.

C program to multiply two matrices

In this lesson purpose and usage of multidimensional array is explained. Pseudocode and C code to declare and input a 3d array is also explained.

Multidimensional Arrays

This video explains what are strings? How to declare strings, input / output strings and storage of strings in memory.

Introduction to Strings(Array of Characters)

This lesson explains how to calculate length of a string. We calculate number of characters in three different ways in the lesson.

Calculate length of a string

This lesson explains the program to count number of vowels. Also explains how to use ctype.h to change case of characters.

Processing Strings - Counting vowels

This lesson explains how to check if a string is a Palindrome or not and covers C program for the same.

Checking if string is a Palindrome or not.

This lesson explains what is an array of strings and how it can be processed using a C program.

Array of Strings or 2D array of characters

This lesson explains the various library functions available to work on strings in header file named string.h

String.h library functions

This lesson explains how to declare and use pointers in C. Pointers play a very important role in managing memory.

Pointers in C - Introduction

This lesson explains the difference between call by value and call by reference and demonstrates how to implement call by reference.

Call by Value Vs Call By Reference/Pointers

This video explains two programs using the concept of Call by Reference. The programs are :
Interchange value of three variables in a cyclic order.
To calculate area and circumference of a circle and return the same

Examples of Call By Reference

This lesson shows how an array and pointers are related.

Arrays and Pointers relationship

This lesson explains how can we pass an array to a function as an argument. Also explains why arrays are always treated to be passed by reference.

Passing arrays as arguments to functions

This lesson explains a very important concept of Data Structures I.e. Dynamic Memory Allocation.  Allocating memory during execution of the program as and when required is of great advantage.

Dynamic Memory Allocation

This lesson explains the concept of Stack. We discuss why stack is abstract data type and what are the possible operations to be performed on a Stack.

Introduction to stacks and its applications

This lesson explains how a stack can be implemented using arrays in C language

Implementing Stack using arrays in C language

This lesson is to understand the significance of Parenthesis matching, also explains the procedure. We write a program in C language to do the same.

Checking Parenthesis in Arithmetic expressions using Stack

The lesson explains how to convert infix expression to postfix with the help of a stack. We solve two expressions and discuss the rules in details using examples.

Infix to postfix conversion or reverse polish notation

The lesson explains how to convert an infix expression including Parenthesis to a postfix expression.
We solve a couple of examples to understand the concept.

Infix to Postfix conversion containing Parenthesis

This lesson explains how to evaluate a postfix expression to a get a final result with the help of stack.

Evaluation of Postfix expression using Stack

This lesson explains what is a Queue?, what are its applications, how is it implemented,  why queue is called abstarct data type.
We also discuss the pseudocode for insertion and deletion operations on the Queue.

Introduction to Queue and its Application

This lesson is to explain how to write a C program to implement Queue using Arrays.

Implementation of Queue using Arrays : Linear Queue

This lesson explains why we need circular array to implement queue. It provides the pseudocode for insertion and deletion in a queue using circular array.

Implementation of Queue using Circular Array

This lesson explains what is a linked list, what is dynamic memory allocation and how linked list maintains non contiguous memory allocation.

Introduction to Linked List and Dynamic Memory Allocation

This lesson is to show how to insert a node at the end of a linked list, explains the procedure and provides the pseudocode for the same.

Inserting a node at the end of linked list.

This video explains the traversal of a linked list. Pseudocode included are 
Display contents of a linked list.
To find greatest number out of the linked list.
Code to try : Sum of all elemnets of a linked list.

Traversing a Linked List

This video is to explain how to insert a node at the beginning of a linked list.

Adding a Node at the Beginning of a linked list.

This lesson explains how a new node can be inserted at a given position in a linked list. The pseudocode is also provided.

Inserting Node at a given position in linked list

This lesson explains how can we delete the first node from the linked list. The pseudocode deallocates the first node and modifies the start pointer to reflect the changes after deletion.

Deleting a Node from Beginning of a Linked List

This lesson explains the deletion of a node from end of a linked list. The pseudocode moves the pointer to second last node to detach the last node from existing linked list.

Deleting a Node from End of a Linked List

This lesson explains how to delete a node from a given position in a Single Linked List.

Deletion from a given position in the Linked List

This lesson explains how to search an element in a single linked list. Also explains why linear search is more appropriate than binary search when we search in a linked list

Searching a Value in a Single Linked List

This lesson is to show how selection sort can be applied to Linked List. It also provides the pseudocode to sort a linked list using selection sort.

Sorting a Linked List

This lesson explains how to merge two lists to get third list. 
The pseudocode takes two sorted lists arranged in increasing order and merge them to create third list in increasing order.

Merging two linked lists

This lesson is to show how Stack can be implemented using Linked List. It provides Pseudocode for Push, Pop and Display modules for the Stack.

Implementing Stacks using Linked List

This lesson shows how to implement a Queue using a Linked List. Pseudocode is provided for enqueue, dequeue and display operations

Implementing Queue using Linked List

This lesson explains what is a Circular Linked List?  Why Circular linked list is required, its applications .

Circular Linked List

This lesson explains the pseudocode to insert a node in a Circular linked list.

Insertion into a Circular Linked List

This lesson is to explain how deletion can be performed in a  Circular linked list.

Deletion from a Circular Linked List

This video explains the concept of Doubly Linked List. The node structutre and purpose of its elements like Data, Next pointer and previous pointer is discussed in detail.

Introduction to Double Linked List

This video explains the procedure of inserting an element at the end of a double linked list. Also provides the pseudocode for the same.

Insertion at End in Double Linked List

This video explains the insertion of a node at the beginning of a linked list.

Insertion at Beginning of a Double Linked List

A final year student of btech CSE in DIT UNIVERSITY, Dehradun. 

Astha Goyal

This course covers the functions and other important aspects of Python programming language.

Python For Beginners: Part 2

I am currently pursuing B.Tech in CSE from The NorthCap University, Gurgaon Currently learning Web Dev. and teaching Python at Unacademy.com

Aakash Sardana

In this course, Aakash will discuss various data structures in Python like Lists, Dictionaries and Tuples and their applications.

Learning Data Structures in Python

I am a B.tech student pursuing Information Technology branch at B.I.T SINDRI 
and i am passionate about coding.

Somnath Pandey

Python is a widely used high-level programming language for general-purpose programming, created by Guido van Rossum and first released in 1991. This course deals with data types like list, tuples and discuss the various operators in python.

Python - List, Tuples, Dictionary and Operators

An enthusiastic learner, having great interest in programming languages. A student of computer science in SJCE Mysore.

Neeta Hegde

This course is about loops, control flows and functions in python.

Python for Beginners Part 2

I am an undergraduate currently pursuing B.Tech in IT branch.

Ayush Garg

This course is on control flow statements in the programming language Python.

(Hindi) Continuing with Python (Control Flow)

BITSian. Here to spread the joy of education. 

Lipi Deepaakshi Patnaik

This course is a stepping stone in the world of Python. Discussed in Hindi, it covers intermediate information and talks about decision making, loops and various examples from daily life.

Lessons

63 lessons • 10h 36m

Invalid Date

NaN

Introduction to Data Structures and Algorithms

Invalid Date

NaN

Introduction to 1D Arrays

Invalid Date

NaN

Initializing and Traversing an Array

Invalid Date

NaN

Application of an Array

Invalid Date

NaN

Deleting an element from an array

Invalid Date

NaN

Inserting an element in an Array

Invalid Date

NaN

Searching in an array

Invalid Date

NaN

C program for Linear Search

Invalid Date

NaN

Binary Search in Arrays

Invalid Date

NaN

Binary Search Program in C language

+ See all lessons