Ayush Singhal

In this course, Ayush shall be discussing certain shortcut tricks for Modular Arithmetic. The course is useful for engineering students

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

Arithmetic Concepts

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Algebraic Structure

Calculating GCD for two positive integers which are very large

Eucledian Algorithm for finding GCD of two numbers

Shortcut for finding two factors only of a very large number. This concept is used when we will be learning about RSA algorithm.

Fermat Factorization Method

Shortcut for Finding Multiplicative Inverse in Cryptography

To find the value of one variable which have the modulii that are relative prime to each other.

Chinese Remainder Theorem

III year UG. Information Science Student. Love teaching. 

Sanjetha K S

The various problems solved using the branch and bound method

Branch and Bound

B.tech graduate in computer science 
Ex. Banker (officer in bank of baroda )
Presently software developer (Web, android, desktop application

Nidhi Gupta

in this we discuss about  what is stack and  queue , operation on stack and queue and its algorithm, representation of stack and queue

(Hindi) Stack and Queue

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

5 lessons • 44m

Invalid Date

NaN

Algebraic Structure

Invalid Date

NaN

Eucledian Algorithm for finding GCD of two numbers

Invalid Date

NaN

Fermat Factorization Method

Invalid Date

NaN

Shortcut for Finding Multiplicative Inverse in Cryptography

Invalid Date

NaN

Chinese Remainder Theorem