I am currently pursuing B. Tech. in Computer Science and Information Technology from Symbiosis University of Applied Sciences.

Avani Agrawal

This course includes various algorithms, sorting techniques and data structures

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

English

Algorithms and Data Structures: GATE

C Programming

Programming & Data Structure

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

This is an overview of the course and an introduction of algorithms and data structures.

Introduction

Here we talk about the running time of a program using the empirical and analytical methods.

Running Time - Empirical And Analytical Method

Here we are discussing the best case, worst case and the average case time complexity.

Time Complexity Analysis

Here we learn to find time complexity using the asymptotic notations.

Asymptotic Notations

Here we learn about the properties of asymptotic notations and how to compare two functions.

Properties of Asymptotic Notations

We are studying about data structures and performing operations on 1-dimensional array.

Data Structures - 1-D Array

Here we learned about 2-D arrays, matrix multiplication and strings.

2 Dimensional Array

Here we got to know about different sorting methods and the working and analysis of bubble sort.

Sorting - Bubble Sort

We learn about the selection sort algorithm and its analysis.

Selection Sort

We learn about the insertion sort algorithm and its analysis.

Insertion Sort

Here we take a look at merge sort algorithm and its analysis.

Merge Sort

We learn the quick sort algorithm, write the code for quick sort and analyse it.

Quick Sort

Here we take a look at the counting sort technique.

Counting Sort

Here we learn about the radix sort and bucket sort algorithms.

Radix & Bucket Sort

We get to know about searching techniques like linear search and binary search.

Linear & Binary Search

We learn about the linked list and how to insert and display data in the linked list.

Linked List - I

We continue the discussion on deleting the node in linked list, searching the linked list and a comparison between arrays and linked list.

Linked List - II

Here we have doubly linked list - about, insertion, traversing, deletion and comparison.

Doubly Linked List

Code HELLOSONU01 | 8+ Years Teaching Exp. in GATE CS IT & GATE DS AI on Unacademy | Mentored 2 Lakh+ Students | Produced Rankers Under 500

Sweta Kumari

This course will cover Stack in Data Structures with operations, Algorithm and its implementation and is beneficial for GATE(CS IT) preparation.

(Hindi) Stack in Data Structures - GATE (CS and IT)

In this course, I will discuss Arrays in C with some GATE PYQs along with the basic concepts. The course will be beneficial for GATE Aspirants.

(Hindi) Array in C With Concepts and PYQs: GATE (CS and IT)

This course will cover Queue in Data Structures for GATE (CS & IT) Aspirants. In this course, I will be explaining Queue Operations and its implementation using Array & Linked List.

(Hindi) Queue in Data Structures - GATE (CS & IT)

This course will cover total Previous Year Questions From Tree topic of Data structures asked in GATE Exam.

Lessons

18 lessons • 3h 11m

Invalid Date

NaN

Introduction

Invalid Date

NaN

Running Time - Empirical And Analytical Method

Invalid Date

NaN

Time Complexity Analysis

Invalid Date

NaN

Asymptotic Notations

Invalid Date

NaN

Properties of Asymptotic Notations

Invalid Date

NaN

Data Structures - 1-D Array

Invalid Date

NaN

2 Dimensional Array

Invalid Date

NaN

Sorting - Bubble Sort

Invalid Date

NaN

Selection Sort

Invalid Date

NaN

Insertion Sort

+ See all lessons