Plus Group for course BOQF6WZC

In this class we will be looking at one the basic concepts in DSA, known as sorting and searching. We will be going over the common algorithms which are used to sort an array, and learning how to compare these with one another.

Introduction to sorting and searching

English

In this course, Suresh Upadhyay will provide in-depth knowledge of Discrete Mathematics. The course will be helpful for aspirants preparing for Competitive Programming. Learners at any stage of their preparation will be benefited from the course. All doubts related to the topic will be clarified during the doubt clearing sessions in the course. Class dates and timings along with topic details are given below. The course will be covered in Hinglish and the notes will be provided in English.

Course on Discrete Mathematics

In this session, we officially wrap up the IPC 2020 Programming Camp. We will share the experiences of the camp and take feedback on what went well and what could be improved for next time.

Closing Note for IPC 2020

Educator Nishchay Manwani is Seven star on Codechef and International Grandmaster on Codeforces. This session is oriented towards division 1 participants and is a part of a 3 day workshop, 'Indian Programming Camp', in which he will discuss the basics of Linear Algebra and how to use it in Competitive Programming. Specifically how to use linear algebra on XOR related queries.

Linear Algebra

In this class, Pulkit will give an introduction to trees, talk about different ways of representing trees and more. The session will be conducted in English.

Introduction to Trees

This class will cover the discussion of idea, problems based on Nim game and minimax algorithm. There will be variety of examples to deepen the understanding.

Nim game and Minimax algorithm

We will cover the basics of time and memory complexity from scratch. It will focus mainly on Big O analysis. It is meant for beginners and will help you understand how to quantify the efficiency of various algorithms.

Introduction to Complexity Theory

In this class one of the basic traversals of any graphs, breadth first search is taught with various examples. The course will be targeting people who are beginners.

Breadth First Search

The course will cover topics which are basic/intermediate in Number theory like modular arithmetic, Fermat's theorem, Euler totient function, finding GCD using Euclidean method.

Basic/Intermediate number theory

The class will cover basic topics related to Game Theory like two player complete information games, Sprague Grundy Theorem, etc. 

It will also include solving some sample problems.

Introduction to Game Theory

In this course, Nimisha Bansal will cover important concepts of English and this course would be helpful for aspirants preparing for Bank Exams. Learners at any stage of their preparation will be benefited from the course. The course will be covered in Hindi and the notes will be provided in English.

Complete Course on English for All Banking Exams - III

In this AMA session, Riya Bansal will share her journey into the world of programming and share tips and tricks to learn in the best way possible and answer any questions that the viewers might have.

AMA by Riya Bansal | Women in Programming

In this course, Sanket will cover important concepts of discrete mathematics. The course will be helpful for aspirants preparing for competitive programming exams. The language of communication will be Hindi and English.

We will discuss about some common mistakes that you can avoid in 1st and 2nd year of your college. Some important things that you can explore and how to manage a lot of things along with your academics.

Lists of Mistakes to avoid in 1st and 2nd Year

In this course, Pulkit Chhabra will provide in-depth knowledge of Number Theory. The course will be helpful for aspirants preparing for Competitive Programming. Learners at any stage of their preparation will be benefited from the course. All doubts related to the topic will be clarified during the doubt clearing sessions in the course. Class dates and timings along with topic details are given below. The course will be covered in Hindi and the notes will be provided in English/Hindi.

Course on Number Theory

This session is oriented towards Division 3 participants and is a part of a 3-day workshop, 'Indian Programming Camp'. In this class, we will take a problem-solving approach to learn the basic constructs of the C++ programming language.

Basic Programming Constructs & Problem Solving

This class will cover multiple game theory problems in competitive programming. Problems will be solved and sample coding will done in C++. It will have a brief summary of the topics learned in the previous game theory classes.

Solving, Coding of Game Theory problems in CP

Free Live Class

Competitive Programming

Miscellaneous

ICPC and IOI

More from Surya Kiran Adury

Solving Recurrence Relations And Applications In Time Complexity Analysis

Preposition - Part II

Solving Recurrence Relations

Prime Numbers: Primality Test and Factorization

Basic Data Structures

Intermediate

Graph Algorithms

Advanced

Beginner

Introduction to Programming in C++

Reading Comprehension

English Language

Bank Exams

Vocabulary

Grammar/Sentence Correction

Number Theory

Discrete Mathematics

ACM ICPC World finalist 2014, 2015.

Worked as software engineer at Google headquarters (MTV) for 3 years, at Google London for 1 year. 



Introduction to sorting and searching

Surya Kiran Adury

Similar Classes

Introduction to Complexity Theory

Arjun Arul

Basic Programming Constructs & Problem Solving

Sanket Singh

Introduction to Trees

Pulkit Chhabra

Introduction to Game Theory

Surya Kiran Adury

Closing Note for IPC 2020

Tanuj Khattar

AMA by Riya Bansal | Women in Programming

Riya Bansal

Lists of Mistakes to avoid in 1st and 2nd Year

Deepak Gour

Linear Algebra

Nishchay Manwani

More from Surya Kiran Adury

Breadth First Search

Surya Kiran Adury

Basic/Intermediate number theory

Surya Kiran Adury

Solving, Coding of Game Theory problems in CP

Surya Kiran Adury

Nim game and Minimax algorithm

Surya Kiran Adury

Similar Plus Courses

Course on Number Theory

Pulkit Chhabra

Course on Discrete Mathematics

Suresh Upadhyay

Course on Discrete Mathematics

Sanket Singh

Complete Course on English for All Banking Exams - III

Nimisha Bansal

No internet connection

Introduction to sorting and searching

Surya Kiran Adury

Similar Classes

Introduction to Complexity Theory

Arjun Arul

Basic Programming Constructs & Problem Solving

Sanket Singh

Introduction to Trees

Pulkit Chhabra

Introduction to Game Theory

Surya Kiran Adury

Closing Note for IPC 2020

Tanuj Khattar

AMA by Riya Bansal | Women in Programming

Riya Bansal

Lists of Mistakes to avoid in 1st and 2nd Year

Deepak Gour

Linear Algebra

Nishchay Manwani

More from Surya Kiran Adury

Breadth First Search

Surya Kiran Adury

Basic/Intermediate number theory

Surya Kiran Adury

Solving, Coding of Game Theory problems in CP

Surya Kiran Adury

Nim game and Minimax algorithm

Surya Kiran Adury

Similar Plus Courses

Course on Number Theory

Pulkit Chhabra

Course on Discrete Mathematics

Suresh Upadhyay

Course on Discrete Mathematics

Sanket Singh

Complete Course on English for All Banking Exams - III

Nimisha Bansal

.css-8tavlo-InternetInfoImg{width:20px;height:20px;vertical-align:middle;margin-right:8px;}No internet connection

No internet connection