Computer Science

Click Here to view videos related to this article.

This is the entry point for all the resources corresponding to computer science. Below are all the articles added so far:

Data Structures In Computer Science

Introduction
Array Data Structure
- Introduction
- Operations on an Array Data Structure
- Basic Examples of Array Data Structure Usage
- Multi-Dimensional Arrays, Matrices and 2D Arrays
- Dynamic Array Data Structure
Basics of Linked List Data Structure
Introduction to Hash Table Data Structure
- Introduction
- How Hash Tables Work: Step-by-Step Explanation
- Hash Functions: Types and Characteristics
- Operations on Hash Tables
  - Introduction
- Time and Space Complexity Analysis of Hash Tables
  - Introduction
- Load Factor and Rehashing in Hash Tables
- Collisions in hash tables and how to resolve them
  - Introduction
  - Collision Resolution By Separate Chaining
  - Collision Resolution By Open Addressing
  - Comparing Different Collision Resolution Techniques
- Hash Tables in Different Programming Languages
  - Introduction
- Basic Examples involving Hash Tables
- Advanced Hash Table Concepts
- Hash Tables vs Other Data Structures
- Real-world Applications of Hash Tables
- Common Pitfalls and Best Practices for Hash Tables
- QnA on Hash Tables
Stack Data Structure
- Introduction
- Implementing Stack using Array
- Implementing Stack using Linked List
- Basic Problems on Stack Data Structure
Queue Data Structure
- Introduction
- Implementing Queue using Array
- Implementing Queue using Linked List
- Basic Problems Involving Queue Data Structure
Binary Tree Data Structure
- Introduction
- Applications and Use Cases of Binary Trees
- Different Types of Binary Trees
- Implementing Binary Tree Data Structure
- Binary Tree Traversal Techniques
- Basic Problems and Solutions Involving Binary Trees
Binary Search Tree
Advanced Tree related data structures structures
Graph Data Structure
- Introduction
- Different ways to represent Graph Data Structure
  - Introduction
  - Representing Graph using Edge List
  - Representing Graph using Adjacency List
  - Representing Graph using Adjacency Matrix
  - Converting between Edge list, Adjacency List and Adjacency Matrices
- Search & Traversal Algorithms For Graphs
  - Introduction
  - Introduction to Depth First Search In a Graph
  - Breadth First Search (BFS) For a Graph
  - Depth First Search vs Breadth First Search
- Basic Problems on Graph Data Structure
- Directed Acyclic Graphs (DAGs)
- Topological Sorting
- Shortest Path Algorithms For Graphs
- Strongly Connected Components in Graph Data Structure
- Minimum Spanning Tree (MST) in Graph Data Structure
- Flow Network in Graph Data Structure
  - Introduction

Introduction to Algorithms

Introduction
Algorithmic Techniques
Array algorithms
Sorting Algorithms
- Introduction
- Introduction to Insertion Sort Algorithm
  - Introduction
  - How Insertion Sort Works: Step-by-Step Explanation
  - Insertion Sort Algorithm: Pseudocode and Explanation
    - Introduction
  - Implementations of Insertion Sort Algorithm
  - Common Mistakes in Insertion Sort and How to Avoid Them
  - Insertion Sort Algorithm: Time and Space Complexity
  - Advantages and Disadvantages of Insertion Sort Algorithm
  - Insertion Sort vs Other Sorting Algorithms
  - Insertion Sort Algorithm: Visualization and Animation
- Introduction to Bubble Sort Algorithm
- Introduction to Selection Sort Algorithm
- Introduction to Merge Sort Algorithm
- Introduction to Quick Sort Algorithm
- Counting Sort Algorithm
Union Find (Disjoint Set) Data Structure for Graphs
Introduction to binary search for beginners

Modular Arithmetic

Floyd's Tortise and Hare Cycle Finding Algorithm

Miscellaneous Computer Science Related Articles