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
GATE
Hpsc lecturer paper solution(3)
Q1 The Floyd-Warshall algorithm for all-pair shortest paths computation is based on [A] Greedy paradigm [B] Divide-and-Conquer paradigm [C] Dynamic …
Read more
GATE
Hpsc lecturer paper solution(2)
Q1 Suppose, a circular queue of capacity (n–1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation…
Read more
GATE
Hpsc lecturer paper solution (1)
Q1 The binary equivalent of (1011·011)10 is equal to [A] 11·375 [B] 10·123 [C] 11·175 [D] 9·234 Solution 1*2^3+0*2^2+1*2^1+1*2^0 =8+2+1=11 0*1/2+1*1…
Read more
python
Program to find complement of a number
Program def fc(num): bina=bin(num)[2:] complement='' for b in bina: if b=='1': complement+='0…
Read more
python
Program for finding pair of highest product.
Program arr=eval(input("enter list element")) a=arr[0] b=arr[1] for i in range(0,len(arr)): for j in range(i+1,len(arr)): if …
Read more
python
Program to find string start from given prefix
l=["cat","dog","doll","rat"] prefix="do" output=[] for word in l: if prefix==word[0:len(prefix…
Read more
python
Program to find number is twin prime or not
If two prime difference is 2 then number is called twin prime number. So to check number is twin prime or not First check number is prime or not. Se…
Read more
python
Program to print name 10 times without using for loop
Program to repeat name without using for loop is possible using self recursive function calling condition is set inside the function .function is cal…
Read more
python
Program to find number is perfect or not
Positive integer that is equal to sum of its positive divisor excluding the number itself. Program n=int(input("enter number")) sum=0 for…
Read more
python
Program to find armstrong number between 1 to 1000
Number of n digits which are equal to sum of nth power of digit. Program for i in range(1,1000): num=i n=len(str(i)) sum1=0 i=str(i)…
Read more
python
Diff b/w list and tuple in python
Difference1 List: List is comma seperated value in square bracket and bracket is mandatory. L=[1,2,3] Tuple: Tuple is comma seperated value in paren…
Read more
TOC
Turing machine for a^nb^nc^n
In this turing machine number of a that equal to the number of b and c .pda cannot do this because in pda only one comparision is possible using st…
Read more
html and javascript
Random image generator using html and javascript
<html> <head> var pic=new Array("b.jpg","c.jpg","d.jpg"); function aa() { var rn=Math.floor(Math.random()*…
Read more
Social Plugin