A Computer Science Student at IIT Roorkee. 

Aviral Verma

This course will aim to cover all important algorithms asked in interviews and most used ones in competitive programming as well.This is a foundation course on algorithms. You will learn from basic to advanced level. You will also solve a problem to understand implementation of logic.

Programming

English

Algorithms for Beginners and Programmers

Competitive Programming

Miscellaneous

Crash Course

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.

An introduction to algorithms is provided along with the insertion sort for the viewer to understand the functionality of courses

Introduction

We discuss the concept of Time complexity and loop invariant in Algorithms. We also apply these two to insertion sort.

Time complexity and Loop Invariant

We discuss the very important algorithm known as merge sort, we take a look at its time complexity with  the help of examples and code.

Merge Sort

We study the needs for more sorting algorithms. We learn about space complexity and learn with the help of code and examples about quick sort.

Quick Sort

We discuss the homework of the last lesson. We learn about prime numbers and various checks that can be performed on them.

Prime Tests

We learn about the very important prime number concept of sieve through examples and dry run of code

Sieve of Eratosthenes

We learn about various concepts of matrices, we see various methods of multiplying matrices and then we learn about the topic algo.

Strassen's Algorithm

We learn various graph theory concepts and then we see how to implement topic algorithm along with code and dry run

Dijkstra's Algorithm

We learn about the most interesting data structure known as hash tables. We learn what are collisions and we also look on various ways to solve them.

Hash Table - 1

We continue to grow our knowledge on this topic by learning the searching,inserting and deleting functions. We also see and dry run the code for all these.

Hash Table - 2

We learn how to apply our logics and algorithms to real time problem. We learn how to generate a real solution by various methods.

Practice Problem


Done graduation from Thakur college of science and commerce,
Master in computer science ,
Educator in Unacademy.

Pratiksha Tripathi

How to implement  big data in programming world and features of it.

Introduction to Big Data for Beginners

Top Educator 2017 • Verified from Dec 2017 to Nov 2018 • Quora Top Writer 2018 • B.Tech ME (Gold Medalist) • Autodesk & SimScale Trainer

Tania Alam

In this course, Tania teaches the basic rules and instructions one should follow to write a document in LaTeX. LaTeX is an advanced way of writing your research document, rather than using Word, where you get to focus on your content rather than on the formatting of the document.

English and Hindi versions of the course also available.

(Bengali) Introduction to LaTeX for Beginners

Himachal Pradesh |
Let's Secure The World Together :)

Akshay Kishor Chauhan

In this course, Akshay Kishor Chauhan has discussed Basics of Linux. He has extensively covered the introduction, VMware, Ubuntu, Wildcards, Linking, file manipulation, pipes In Linux, sorting in Linux etc.

(Hindi) Introduction to Linux Operating System

Will graduate in 2020(CSE)a self taught techie,Software Dev,Competitive Programmer,Mathematician,writer on Quora with endless energy to code

Adarsh Agarwal

We are going to study about one of the famous PHP framework.

Lessons

11 lessons • 1h 28m

Invalid Date

NaN

Introduction

Invalid Date

NaN

Time complexity and Loop Invariant

Invalid Date

NaN

Merge Sort

Invalid Date

NaN

Quick Sort

Invalid Date

NaN

Prime Tests

Invalid Date

NaN

Sieve of Eratosthenes

Invalid Date

NaN

Strassen's Algorithm

Invalid Date

NaN

Dijkstra's Algorithm

Invalid Date

NaN

Hash Table - 1

Invalid Date

NaN

Hash Table - 2

+ See all lessons