Umesh Chandra

Blog

  • Dijsktra’s Algorithm:

    Dijkstra’s algorithm allows us to find the shortest path between any two vertices of a graph. How Dijkstra’s Algorithm works Dijkstra’s Algorithm works on the basis that any subpath B ->… Read more

  • Kruskal’s Algorithm:

    Kruskal’s algorithm is a minimum spanning tree algorithm that takes a graph as input and finds the subset of the edges of that graph which How Kruskal’s algorithm works Kruskal’s algorithm is… Read more

  • Prims Algorithm:

    Prim’s algorithm is a minimum spanning tree algorithm that takes a graph as input and finds the subset of the edges of that graph which How Prim’s algorithm works It falls… Read more

  • Graph Traversal

    A graph is a non-linear data structure, which is represented by vertices(nodes) and edges. Every pair of vertices is connected with one edge between them. In simple words, traversal means the process of visiting every… Read more

  • Linked List

    Linked list is a linear data structure that includes a series of connected nodes. Here each node stores the data and the address of the next node. Code: Read more

  • Queue Implementation using Linked List

    Queue is a linear data structure, which follows the First In First Out(FIFO) fashion. It is the collection of similar data types Queue contains two pointers namely, *front , *rear.… Read more

  • Stack Implementation using Linked List

    Stack is a linear data structure, which is collection of items of the same data type. Stack follows the Last-In-First-Out (LIFO) fashion, where the last element inserted first will be… Read more

  • Hashing

    Hashing is a technique which is used to search for an element in the less time complexity. Already we have Linear search and Binary search which uses the O(n) and… Read more

  • Difference between Graph and Tree

    Graph: A graph is a collection of two sets V and E where V is a finite non-empty set of vertices and E is a finite non-empty set of edges. For… Read more

  • Graphs

    A graph named G can be defined as ordered set G(V,E) where V(G) represents the set of vertices and E(G) represents the set of Edges which are used to connect… Read more

Welcome to my blog!

I’m Umesh, a student at Vellore Institute of Technology, Chennai, navigating the exciting realm of Computer Science Engineering. Beyond the world of algorithms and code, I’m passionate about leveraging technology for innovation.

Join me on this journey as we explore the intersection of technology and a purpose. As a third-year student at VIT Chennai, my commitment to leveraging technology for innovation has been a driving force

Find me on:

Join the fun!

Stay updated with the news by joining our newsletter.