Register
Filter

Answers by vipsharmavip

0 votes
2
Recursion
#define LIMIT 1000 void fun2(int n) { if (n <= 0) return; if (n > LIMIT) return; printf("%d ", n); fun2(2*n); printf("%d ", n); } Will it be non terinating recursion if n is negative,if so then why?
#define LIMIT 1000void fun2(int n){ if (n <= 0) return; if (n LIMIT) return; printf("%d ", n); fun2(2*n); printf("%d ", n);} Will it be non terinating recur...
3 votes
4
probability
Out of (2n + 1) tickets consecutively numbered three are drawn at random. Find the probability that the numbers on them are in arithmetic progression? 3n/4n2-1 2n/4n2-1 2n/4n2+1 2n/2n2+1
Out of (2n + 1) tickets consecutively numbered three are drawn at random. Find the probability that the numbers on them are in arithmetic progression?3n/4n2-12n/4n2-12n/4...
3 votes
5
External fragmentation
The available main memory for loading processes is 128 MB which is divided into fixed number of partitions each of size 16 MB. If the processes of size 12 MB,18MB and 20 MB are loaded into memory. The percentage of the external fragmentation is ____________ (upto two decimal places)
The available main memory for loading processes is 128 MB which is divided into fixed number of partitions each of size 16 MB. If the processes of size 12 MB,18MB and 20 ...
3 votes
6
MadeEasy Subject Test: Algorithms - Time Complexity
A program takes input of a binary tree with N nodes and computes a function f(x)=max height of left subtree-max height of right subtree what is the time complexity?
A program takes input of a binary tree with N nodes and computes a function f(x)=max height of left subtree-max height of right subtreewhat is the time complexity?
1 votes
7
test series
2 votes
8
Graph Theory
How to learn and understand graph theory in 23 days i mean before gate exam? Can anybody help in this.Like there are many new terms bipartite graph etc etc i m not able to learn some complicated names ? Any video lectures or anything please help :)
How to learn and understand graph theory in 23 days i mean before gate exam? Can anybody help in this.Like there are many new terms bipartite graph etc etc i m not able ...
5 votes
9
time complexity
given a N-bit string. what is the time complexity to find out all subsets of that string which is parlindrome?
given a N-bit string.what is the time complexity to find out all subsets of that string which is parlindrome?
0 votes
10
doubt
3 votes
12
discrete
How many solutions are there to the equation: $X_1+X_2+X_3+X_4+X_5=21$ ? If $0 \leq X1 \leq 3 , 1 \leq X2 < 4 , X3 \geq 15$
How many solutions are there to the equation: $X_1+X_2+X_3+X_4+X_5=21$ ?If $0 \leq X1 \leq 3 , 1 \leq X2 < 4 , X3 \geq 15$
1 votes
14
DS-CLL
Time complexity to insert a node in the end of circular linked list, if the pointer to the 1st node is given and number of nodes in list is N is A)O(1) B)O(log N) C)O(N) D)O(N log N)
Time complexity to insert a node in the end of circular linked list, if the pointer to the 1st node is given and number of nodes in list is NisA)O(1)B)O(log N)C)O(N)D)O(N...
1 votes
16
DS-BFS
a)(d,c) b)(d,b) c)(e,b) d)(e,f)
a)(d,c)b)(d,b)c)(e,b)d)(e,f)
5 votes
17
DS-Programming
Consider the following code
Consider the following code
1 votes
18
insert_front_linkedlist
1 votes
20
algo. book
Running time of following program? function(n) { for( i = 1 ; i <= n ; i + + ) for( j = 1 ; j <= n ; j+ = i ) print("*") ; }
Running time of following program? function(n) { for( i = 1 ; i <= n ; i + + ) for( j = 1 ; j <= n ; j+ = i ) print("*") ; }
5 votes
23
Combinatorics
The answer given is n-k+1C2 but couldn't understand how both are related
The answer given is n-k+1C2 but couldn't understand how both are related
4 votes
24
Recurrence Relation
The recurrence relation for the number of n-digit quaternary sequences that have an even number of zeros (quaternary sequences use only 0,1,2,3 for digits) is- (A) an = an-1 + 4n-1 (B) an = 3an-1 + 4n-1 (C) an = 2an-1 + 4n-1 (D) an = an-1 + 4n-2
The recurrence relation for the number of n-digit quaternary sequences that have an even number of zeros (quaternary sequences use only 0,1,2,3 for digits) is-(A) an = an...
1 votes
26
self doubta
please explain these few point: how is longest path between any pair of vertices different from diameter of a agraph.? in dijkstra algorithm,each edge is relaxed eaxtly one time..is it true or false?
please explain these few point:how is longest path between any pair of vertices different from diameter of a agraph.?in dijkstra algorithm,each edge is relaxed eaxtly one...
Page: