Recent posts
View all
C language
Program to find single source shortest path using bellman Ford in C
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <limits.h> struct Edge { // This structure is equal …
Read more
C language
Program to find minimum spanning tree using kruskal in C
# include <stdio.h> #include <stdlib.h> int i, j, k, a, b, u, v, n, ne = 1; int min, mincost = 0, cost[9][9], parent[9]; in…
Read more
C language
Program to find all pair shortest path using warshall algorithm in C
#include <stdio.h> // defining the number of vertices #define nV 4 #define INF 999 void printMatrix(int matrix[][nV]); // Implementing floyd w…
Read more
C language
Program to find shortest path using dijkstra algorithm c code
#include <stdio.h> #include <limits.h> // Number of vertices in the graph #define V 9 // A utility function to find the vertex with mini…
Read more
C language
Program to detect cycle in graph using dfs
#include <stdio.h> #include <stdlib.h> #define MAX_VERTICES 100 // Function to add an edge to the graph void addEdge(int graph[MAX_VERTI…
Read more
C language
Program to add two matrix in C
#include <stdio.h> int main() { int r, c, a[10][10], b[10][10], sum[10][10], i, j; printf("\nEnter elements of 1st matrix:\n"); …
Read more
GATE
Hpsc lecturer paper solution(4)
Q1 Which one of the following is a top-down parser? [A] Recursive descent parser [B] Operator precedence parser [C] An LR(k) parser [D] An LALR(k) p…
Read more
Social Plugin