Канал: Anand Seetharam

Recursion and Methods

Recursion and Methods

Introduction to for loops in Java

Introduction to for loops in Java

Java programming: Determine if an integer is even or odd

Java programming: Determine if an integer is even or odd

Java Program: Divide two integers

Java Program: Divide two integers

Introduction to Java: Adding two integers

Introduction to Java: Adding two integers

Introduction to arrays in Java

Introduction to arrays in Java

Introduction to while loops in Java

Introduction to while loops in Java

Linear Search in Java

Linear Search in Java

Introduction to Jdoodle and CodingBat

Introduction to Jdoodle and CodingBat

Recursion: Finding the Nth number in a Fibonacci Series using Java

Recursion: Finding the Nth number in a Fibonacci Series using Java

Methods in Java

Methods in Java

Introduction to Strings in Java

Introduction to Strings in Java

Advanced Algorithms Course Introduction

Advanced Algorithms Course Introduction

Introduction to Algorithms

Introduction to Algorithms

Understanding Socio-Economic Impact of COVID-19: Research Study

Understanding Socio-Economic Impact of COVID-19: Research Study

COVID-19 Case Prediction: Regression and Machine Learning Models

COVID-19 Case Prediction: Regression and Machine Learning Models

Probability for Data Science - Course Introduction

Probability for Data Science - Course Introduction

Introduction to Computer Networks - Course Introduction

Introduction to Computer Networks - Course Introduction

Proving CLIQUE is NP-Complete

Proving CLIQUE is NP-Complete

How to prove NP-Completeness - The Steps

How to prove NP-Completeness - The Steps

NP Completeness Basics

NP Completeness Basics

3-CNF SAT (3 CNF Satisfiability)

3-CNF SAT (3 CNF Satisfiability)

Kruskal’s Algorithm for finding the Minimum Spanning Tree

Kruskal’s Algorithm for finding the Minimum Spanning Tree

Insertion Sort- Proof of correctness using loop invariance

Insertion Sort- Proof of correctness using loop invariance

Merge Sort - Proof of correctness using loop invariance

Merge Sort - Proof of correctness using loop invariance

Insertion Sort Explained: Example, Pseudocode and Runtime Analysis

Insertion Sort Explained: Example, Pseudocode and Runtime Analysis

Prim’s Algorithm for Minimum Spanning Trees Part II - Implementation Details

Prim’s Algorithm for Minimum Spanning Trees Part II - Implementation Details

Generic Algorithmic Design Approach for Minimum Spanning Trees

Generic Algorithmic Design Approach for Minimum Spanning Trees

Graphs Introduction (Adjacency Lists and Adjacency Matrix)

Graphs Introduction (Adjacency Lists and Adjacency Matrix)

Prim's Algorithm for Minimum Spanning Trees Part I - A Detailed Discussion

Prim's Algorithm for Minimum Spanning Trees Part I - A Detailed Discussion

Runtime of Red-black tree insertion

Runtime of Red-black tree insertion

Red Black Tree Insertion (part 2)

Red Black Tree Insertion (part 2)

Red Black Trees - Insertion (Part 1)

Red Black Trees - Insertion (Part 1)

Red Black Trees - Introduction

Red Black Trees - Introduction

Introduction to CSEdu4All

Introduction to CSEdu4All

Introducing CSEdu4All.org: Making computer science education accessible to all.

Introducing CSEdu4All.org: Making computer science education accessible to all.

Welcome to my channel

Welcome to my channel

DeepFit: Deep Learning Models for Fitness Center Equipment Use Prediction

DeepFit: Deep Learning Models for Fitness Center Equipment Use Prediction

Big-Oh, Theta and Omega notations

Big-Oh, Theta and Omega notations

What is an algorithm?

What is an algorithm?

Algorithmic Efficiency and Runtime of Algorithms

Algorithmic Efficiency and Runtime of Algorithms

Quicksort and Randomized Quicksort using Divide and Conquer

Quicksort and Randomized Quicksort using Divide and Conquer

Minimum Spanning Trees: An Introduction

Minimum Spanning Trees: An Introduction

Merge Sort using Divide and Conquer

Merge Sort using Divide and Conquer

Divide and Conquer Algorithms: An introduction

Divide and Conquer Algorithms: An introduction

Binary Search Trees: Introduction, search, insertion, deletion and traversal

Binary Search Trees: Introduction, search, insertion, deletion and traversal

Recursion and master theorem

Recursion and master theorem

Time complexity (runtime) of recursive algorithms

Time complexity (runtime) of recursive algorithms

Matrix Multiplication using divide and conquer and Strassen’s Algorithm

Matrix Multiplication using divide and conquer and Strassen’s Algorithm

AVL Trees: Balancing and Insertion

AVL Trees: Balancing and Insertion

Greedy Algorithm: Activity Selection

Greedy Algorithm: Activity Selection

Dynamic Programming: 0-1 Knapsack Problem

Dynamic Programming: 0-1 Knapsack Problem

Greedy Algorithm: Knapsack Problems

Greedy Algorithm: Knapsack Problems

Dynamic Programming: Longest Common Subsequence

Dynamic Programming: Longest Common Subsequence

Introduction to probability (part 2) - sets, sample spaces and axioms of probability

Introduction to probability (part 2) - sets, sample spaces and axioms of probability

Introduction to probability (part 1) - experiments, events and sample spaces

Introduction to probability (part 1) - experiments, events and sample spaces

Function of a Random Variable: explained with examples

Function of a Random Variable: explained with examples

Continuous Random Variables: An introduction

Continuous Random Variables: An introduction

Discrete Random Variables: An introduction

Discrete Random Variables: An introduction

Normal Random Variables: An Introduction

Normal Random Variables: An Introduction

Exponential distribution: simple example

Exponential distribution: simple example

Uniform distribution: Simple example

Uniform distribution: Simple example

Binomial Distribution: Simple example

Binomial Distribution: Simple example

Poisson Distribution: Simple Example

Poisson Distribution: Simple Example

Probability: Balls and Bins and Coupon Collector’s Problem

Probability: Balls and Bins and Coupon Collector’s Problem

Conditional probability - a simple example

Conditional probability - a simple example

Find expectation and variance of random variables - a simple example

Find expectation and variance of random variables - a simple example

How to conduct literature review for your research (a computer science example)?

How to conduct literature review for your research (a computer science example)?

How to review a research paper?

How to review a research paper?

How to read a computer science research paper?

How to read a computer science research paper?

How to write your first computer science research paper?

How to write your first computer science research paper?

Bayes Rule Explained

Bayes Rule Explained

Statistical Independence and Independent Random Variables

Statistical Independence and Independent Random Variables

Conditional Probability Example

Conditional Probability Example

Conditional Probability

Conditional Probability

TCP Congestion Control

TCP Congestion Control

TCP Congestion Control: How to set the TCP timer value

TCP Congestion Control: How to set the TCP timer value

Bernoulli and Binomial Random Variables (Probability Distributions)

Bernoulli and Binomial Random Variables (Probability Distributions)

Probability Basics: Properties of Expectation and Variance

Probability Basics: Properties of Expectation and Variance

Variance of a Discrete Random Variable

Variance of a Discrete Random Variable

Expectation of a Discrete Random Variable

Expectation of a Discrete Random Variable

Poisson Random Variable (Probability Distributions)

Poisson Random Variable (Probability Distributions)

Geometric Random Variable and Geometric Distribution

Geometric Random Variable and Geometric Distribution

Ford Fulkerson Maximum Flow Algorithm

Ford Fulkerson Maximum Flow Algorithm

Bipartite Graphs and Maximum Matching

Bipartite Graphs and Maximum Matching

Finding the Minimum Spanning Tree: Kruskal's Algorithm

Finding the Minimum Spanning Tree: Kruskal's Algorithm

Minimum Vertex Cover Problem: Brute Force Algorithm Explained with Example

Minimum Vertex Cover Problem: Brute Force Algorithm Explained with Example

Java: Finding factorial using recursion

Java: Finding factorial using recursion

RSA (Rivest, Shamir, Adleman) Algorithm explained with example

RSA (Rivest, Shamir, Adleman) Algorithm explained with example

Java: Using arrays with loops: Medium Difficulty

Java: Using arrays with loops: Medium Difficulty

Java Programming: Arrays with loops together

Java Programming: Arrays with loops together

Java: If else statement example

Java: If else statement example

Java program for beginners

Java program for beginners

My first Java program

My first Java program

Coding with Java: Simple example using Math.abs

Coding with Java: Simple example using Math.abs

Java Programming: How to use arrays (simple example)

Java Programming: How to use arrays (simple example)

Java programming: Arrays without loops example

Java programming: Arrays without loops example

Prim's Algorithm for finding the Minimum Spanning Tree in a Graph

Prim's Algorithm for finding the Minimum Spanning Tree in a Graph

Two Approximation Algorithm for Minimum Vertex Cover of a Graph

Two Approximation Algorithm for Minimum Vertex Cover of a Graph

Insertion Sort with Visualization and Animation

Insertion Sort with Visualization and Animation

Bubble Sort with Visualization and Animation

Bubble Sort with Visualization and Animation

Graphs in data structures: Introduction (Edge List, Adjacency Matrix)

Graphs in data structures: Introduction (Edge List, Adjacency Matrix)

Searching in a Binary Search Tree

Searching in a Binary Search Tree

Deleting Nodes from a Binary Search Tree: Illustrative Example

Deleting Nodes from a Binary Search Tree: Illustrative Example

Binary Search Tree Data Structure: Insertion Algorithm

Binary Search Tree Data Structure: Insertion Algorithm

Binary Search Trees: Introduction with Example and Visualization

Binary Search Trees: Introduction with Example and Visualization

Selection Sort with Visualization and Animation

Selection Sort with Visualization and Animation

Network Security - Secure Email System Design (How to explained)

Network Security - Secure Email System Design (How to explained)

Modular arithmetic example (useful for understanding RSA)

Modular arithmetic example (useful for understanding RSA)

Public Key Cryptography

Public Key Cryptography

Certification Authority

Certification Authority

Digital Signatures: Basics

Digital Signatures: Basics

How to Design an Authentication Protocol: Basics

How to Design an Authentication Protocol: Basics

Principles of Cryptography: Basics

Principles of Cryptography: Basics

Network Security Basics

Network Security Basics

Cellular Network: Introduction

Cellular Network: Introduction

WiFi tutorial for beginners

WiFi tutorial for beginners

Wireless Networks: Introduction

Wireless Networks: Introduction

Application Layer Introduction

Application Layer Introduction

Network Routing: Distance Vector Algorithm

Network Routing: Distance Vector Algorithm

Difference between Routing and Forwarding

Difference between Routing and Forwarding

Network Routing: Dijkstra's Algorithm

Network Routing: Dijkstra's Algorithm

Layers of the Protocol Stack

Layers of the Protocol Stack

Encapsulation: Network Packets

Encapsulation: Network Packets

Layers of Network Protocol Stack

Layers of Network Protocol Stack

Internet - A network of networks

Internet - A network of networks

Network Delay - Transmission and Propagation Delay

Network Delay - Transmission and Propagation Delay

TCP - Reliable Data Transfer

TCP - Reliable Data Transfer

TCP - Sequence Numbers and Acknowledgments

TCP - Sequence Numbers and Acknowledgments

TCP connection management

TCP connection management

The Network Core

The Network Core

Forwarding in Datagram Networks - Longest Prefix Matching

Forwarding in Datagram Networks - Longest Prefix Matching

Link Layer Introduction

Link Layer Introduction

Network Core

Network Core

Packet vs Circuit Switching

Packet vs Circuit Switching

User Datagram Protocol (UDP)

User Datagram Protocol (UDP)

Transport Layer Introduction

Transport Layer Introduction

The Network Edge

The Network Edge

Link Layer: Switches

Link Layer: Switches

Transport Layer - Multiplexing and Demultiplexing

Transport Layer - Multiplexing and Demultiplexing

Address Resolution Protocol (ARP) Explained

Address Resolution Protocol (ARP) Explained

IPv4 Addressing

IPv4 Addressing

IP Datagram

IP Datagram

Medium Access Control (MAC) protocols

Medium Access Control (MAC) protocols

Network Layer Introduction

Network Layer Introduction

Network Address Translation (NAT)

Network Address Translation (NAT)

What's inside a router?

What's inside a router?

Simple Mail Transfer Protocol (SMTP)

Simple Mail Transfer Protocol (SMTP)

File Transfer Protocol (FTP)

File Transfer Protocol (FTP)

Dynamic Host Configuration Protocol (DHCP)

Dynamic Host Configuration Protocol (DHCP)

Hypertext Transfer Protocol (HTTP)

Hypertext Transfer Protocol (HTTP)

Domain Name System (DNS): How it works explained

Domain Name System (DNS): How it works explained

Introduction to Computer Networking

Introduction to Computer Networking

Network Throughput

Network Throughput

Cookies and Web Caching

Cookies and Web Caching