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
Social Plugin