Abhijit Pande

Network ID and Host ID Calculation (Computer Network)

Traversing an Array (Algorithm)

Representation of Arrays in Memory

Kruskal's Algorithm | Minimum Spanning Tree | Greedy Approach | Data Structure

Classification of Data Structure (Primitive, Non Primitive) in Detail

Program for Traversing an Array

Multidimensional Trees: Deletion

Multidimentional Tree: Insertion

Insertion at the end (Array) with Algorithm

Introduction to Graph

Data Structure and Its Operations (Need of Data Structure)

Graph Traversal: BFS

Compressed Tries and its representation

Standard Tries

Graph Traversal: DFS

Two and Three level Classful Addressing

Naive Pattern Matching

Prim's Algorithm for Minimum Spanning Tree (Data Structure)

Minimum Spanning Tree (Data Structure)

Data Communication Components (Computer Network)

Dijkstra's Algorithm | Single Source Shortest Path | Data Structure

Network ID and Host ID Calculation (Computer Network)

Suffix Tries

Representation of Graph