Register
Filter

Answers by raja11sep

7 votes
32
Applied Grand Test 2
Consider the equivalence relation R induced by the partition P={{1},{3},{2,4,5,6}} of set A={1,2,3,4,5,6}. The number of ordered pairs in R is ____
Consider the equivalence relation R induced by the partition P={{1},{3},{2,4,5,6}} of set A={1,2,3,4,5,6}.The number of ordered pairs in R is ____
2 votes
36
Gate@Zeal Test series
How to calculate the sizeof(arr2)?
How to calculate the sizeof(arr2)?
2 votes
37
#self doubt
Every unambiguous grammar is LR(0) grammar?
Every unambiguous grammar is LR(0) grammar?
5 votes
39
Self doubt
int main() { float f=0.7; if(f==0.7) printf("equal"); else printf("not equal"); return 0; } what will be the o/p and why? plz explain
int main(){ float f=0.7; if(f==0.7) printf("equal"); else printf("not equal"); return 0;} ...
7 votes
40
Applied Test Series
Given the following undirected graph, the cost of the minimal spanning tree of the graph is ____.
Given the following undirected graph, the cost of the minimal spanning tree of the graph is ____.
4 votes
41
Applied Test Series
The time required to determine the minimum element from the max heap of size O(log(n)) is given by
The time required to determine the minimum element from the max heap of size O(log(n)) is given by
3 votes
43
Closure Properties of Languages
let L = “CFL but not REGULAR”, Can we get complement of L as CFL? Unlike in the case of Recursively Enumerable(RE) language where if L = “RE but not RECURSIVE”, its complement can never be RE.
let L = “CFL but not REGULAR”, Can we get complement of L as CFL?Unlike in the case of Recursively Enumerable(RE) language where if L = “RE but not RECURSIVE”, it...
2 votes
44
GATE CSE 1997 | Question: 1.10
Heap allocation is required for languages. that support recursion that support dynamic data structure that use dynamic scope rules None of the above
Heap allocation is required for languages.that support recursionthat support dynamic data structurethat use dynamic scope rulesNone of the above
3 votes
45
ace test series
number of 3 state dfa with designated initial stat can be constructed over the alphabet {0,1,2} with exactly 2 final states is a)3^8 b)3^9 c)3^10 d)3^11
number of 3 state dfa with designated initial stat can be constructed over the alphabet {0,1,2} with exactly 2 final states is a)3^8b)3^9c)3^10d)3^11
5 votes
46
GATE ACADEMY TEST SERIES
What is the minimum number of students, each of whom comes from one of the 50 states, who must be enrolled in a university to guarantee that there are at least 100 who come from the same state?
What is the minimum number of students, each of whom comes from one of the 50 states, who must be enrolled in a university to guarantee that there are at least 100 who co...
4 votes
47
Master Theorm
which formula to use in master theorm
which formula to use in master theorm
3 votes
48
GATE CSE 1989 | Question: 1-iv
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.
0 votes
49
GATE IT 2004 | Question: 5
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices? $n-1$ $n$ $n+1$ $2n-1$
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices?$n-1$$n$$n+1$$2n-1$
2 votes
51
NIELIT 2017 DEC Scientific Assistant A - Section B: 53
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be : $m^{*}n$ minimum of $m, n$ maximum of $m, n$ $m+n-1$
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be :$m^{*}n$minimum of $m,...
2 votes
53
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 29
Which of the following algorithm solve the all-pair shortest path problem? Dijakstra’s algorithm Floyd’s algorithm Prim’s algorithm Warshall’s algorithm
Which of the following algorithm solve the all-pair shortest path problem?Dijakstra’s algorithmFloyd’s algorithmPrim’s algorithmWarshall’s algorithm
2 votes
55
GATE CSE 1994 | Question: 25
An array $A$ contains $n$ integers in non-decreasing order, $A[1] \leq A[2] \leq \cdots \leq A[n]$. Describe, using Pascal like pseudo code, a linear time algorithm to find $i, j,$ such that $A[i]+A[j]=a$ given integer $M$, if such $i, j$ exist.
An array $A$ contains $n$ integers in non-decreasing order, $A \leq A \leq \cdots \leq A[n]$. Describe, using Pascal like pseudo code, a linear time algorithm to find $...
3 votes
59
GATE CSE 1998 | Question: 2.12
What value would the following function return for the input $x=95$? Function fun (x:integer):integer; Begin If x > 100 then fun = x – 10 Else fun = fun(fun (x+11)) End; $89$ $90$ $91$ $92$
What value would the following function return for the input $x=95$?Function fun (x:integer):integer; Begin If x 100 then fun = x – 10 Else fun = fun(fun (x+11)) End;$...
Page: