Hello guys welcome to my profile !
I am currently pursuing B.Tech in computer science and engineering  from KIIT university. HappyLearning!


Roli Verma

This course includes all the essential types of  analysis techniques and algorithms based on divide and conquer concept.It is designed for engineering students and GATE aspirants.

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

Design and Analysis of Algorithms - GATE(CS and IT)

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

It discusses concepts about asymptotic analysis and notations from the scratch and a few conceptual questions for clarity.

Asymptotic Notations

Growth rate and calculating frequency count for complex loops and non iterative functions and thereby finding time complexity.

Time Complexity (Non Recursive Functions )

Finding the recurrence relation and solving them (by Master's theorem and recurrence tree method) for recursive functions.

Time Complexity of Recursive Functions

Substitution method (including change of variables ) for solving recursive equations of time complexity.

Time Complexity of Recursive Functions - 2

Binary search algorithm (recursive ) using Divide and Conquer technique

Divide and Conquer (Binary Search)

Recursive Mergesort using Divide and Conquer technique.

Divide and Conquer (Merge Sort)

Want to outperform? I am there to help you out! I am a student of NIT Durgapur and an ardent follower of programming and Machine Learning

Abhishek Karn

This course is about Bit Manipulations. In my course Abhishek Karn will be teaching the concepts of bit manipulations and use them to solve some amazing problems with the help of those concepts. The topics learnt in this course will also help students to apply these concepts while solving programming contest's problems and will also prepare them for this topic for software companies' interviews.

Bit Manipulation

Engineer | Computer Science | Keeping things simple - O(1)

Shivangi Garg

Its about different binary trees, there properties, how to traverse them and many operations associated with binary tree.

Binary Tree

Currently pursuing  Btech in CSE from GGSIPU. Love coding, teaching and participating in many coding competitions. 

Nipun Vats

Covering the first topic "Asymptomatic Analysis of Algorithms" of the chapter "algorithms"

(Hindi) Asymptomatic Analysis of Algorithms for GATE/IES

Jyoti Jha

This course is for those students who are preparing for GATE and BSc in computer .

(Hindi) Data Structures and Algorithms: GATE

AWS Cloud Support Associate(Networking); B.Tech-IT from Maharaja Surajmal Institute of Technology.

Payal Gupta

Learning Sorting is a fundamental step in learning Algorithms. Here's your chance to learn how to perform: Introduction to Sorting Linear Search Binary Search Bubble Sort Insertion Sort Selection Sort Heap Sort Bucket Sort Radix Sort Count Sort Quick Sort

Sorting: GATE (CS and IT)

🌟 Bachelor’s degree in Computer engineering 🌟 CGPA 9.14 🌟 GATE qualified 🌟 Unacademy Verified Educator 🌟 Software engineer 🌟 CS Passionate 🌟

Nisha Sajnani

Understand Sorting algorithms using examples, find it's worst and best case complexity. Additionally we'll cover PYQs on Sorting

Lessons

6 lessons • 1h 9m

Invalid Date

NaN

Asymptotic Notations

Invalid Date

NaN

Time Complexity (Non Recursive Functions )

Invalid Date

NaN

Time Complexity of Recursive Functions

Invalid Date

NaN

Time Complexity of Recursive Functions - 2

Invalid Date

NaN

Divide and Conquer (Binary Search)

Invalid Date

NaN

Divide and Conquer (Merge Sort)