Register

Recent questions and answers

3 votes
1 answer
7
Number of possible permutations that can be obtained using stack for input seq
Number of possible permutations that can be obtained using stack if the input sequence is 1, 2, 3, 4, 5 (in the order) is
Number of possible permutations that can be obtained using stack if the input sequence is 1, 2, 3, 4, 5 (in the order) is
User Avatar
2 votes
2 answers
9
GATE 2017 EC
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?
User Avatar
0 votes
2 answers
13
Regular language
Can anyone explain how we can write this regular language for the following diagram ?(in depth)
Can anyone explain how we can write this regular language for the following diagram ?(in depth)
User Avatar
1 votes
2 answers
19
test series
int i,j,k,s=0; for(i=1; i<=n; i++) { for(j=1 ; j<=i; j=j*2) { for(k=n; k>1;k=k/2) { s++; } } } What will be the time complexity of the above code?
int i,j,k,s=0; for(i=1; i<=n; i++) { for(j=1 ; j<=i; j=j*2) { for(k=n; k>1;k=k/2) { s++; } } }What will be the time complexity of the above code?
User Avatar
0 votes
1 answer
20
Question on Quotient set
What will be quotient set for equivalence relation R={(x,y) ∣ x ≡ y mod 5} in set builder form?
What will be quotient set for equivalence relation R={(x,y) ∣ x ≡ y mod 5} in set builder form?
User Avatar
1 votes
2 answers
22
GATE CSE 2024 | Set 1 | Question: 50
The number of edges present in the forest generated by the $\text{DFS}$ traversal of an undirected graph $G$ with $100$ vertices is $40$. The number of connected components in $G$ is __________.
The number of edges present in the forest generated by the $\text{DFS}$ traversal of an undirected graph $G$ with $100$ vertices is $40$. The number of connected componen...
User Avatar
0 votes
1 answer
23
FIRST $ FOLLOW
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =
S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =
User Avatar
0 votes
1 answer
26
Constructors
A constructor cannot be explicitly called by the client program. true or false?
A constructor cannot be explicitly called by the client program. true or false?
User Avatar
0 votes
1 answer
28
Linear Algebra AX=B
Consider a matrix A (n×m) ,X(m×n) and B(n×n) such that AX=B . If A has k linearly independent columns then what conclusions can we nake about the number of linearly independent columns of B.
Consider a matrix A (n×m) ,X(m×n) and B(n×n) such that AX=B . If A has k linearly independent columns then what conclusions can we nake about the number of linearly in...
User Avatar
0 votes
0 answers
30

A program that includes the file containing a class declaration is called a ________ program of the class.
A program that includes the file containing a class declaration is called a ________ program of the class.
User Avatar
1 votes
0 answers
31
Arrays
Consider an integer upper triangular 2D array arr[–8 to +7][–8 to +7] having base address 1000. If the size of the integer is 4 bytes, the address of the element present at location arr[–6][4] is- ____________.
Consider an integer upper triangular 2D array arr[–8 to +7][–8 to +7] having base address 1000. If the size of the integer is 4 bytes, the address of the element pres...
User Avatar
0 votes
1 answer
35
FIRST & FOLLOR
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =
S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =
User Avatar
0 votes
1 answer
36
Number of Super Keys
R(A1, A2,A3,A4....AN). How many super keys possible in relation? If (A1 is candidate key, A2 is candidate key, A3 is candidate key)
R(A1, A2,A3,A4....AN). How many super keys possible in relation? If (A1 is candidate key, A2 is candidate key, A3 is candidate key)
User Avatar
0 votes
2 answers
39
Permutations
In how many ways can four letters from COFFEE be picked considering all permutations?
In how many ways can four letters from COFFEE be picked considering all permutations?
User Avatar
To see more, click for the full list of questions or popular tags.