Register
Filter

Questions by charul

1 votes
1 answer
1
gateforum test series
isn't the answer is directly speedup = number of stages * efficiency please confirm
isn't the answer is directly speedup = number of stages * efficiencyplease confirm
2 votes
1 answer
9
gate 2012 cs
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to (A) 3 (B) 4 (C) 5 (D) 6
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is ...
1 votes
1 answer
10
gateforum test series
answer given is : 0.153
answer given is : 0.153
1 votes
0 answers
11
gate forum test series
1 votes
0 answers
12
gate forum test series
I'm getting 9.8 Bytes in such question can we answer in float, as utilization is given not its range?
I'm getting 9.8 Bytesin such question can we answer in float, as utilization is given not its range?
2 votes
0 answers
13
gate forum test series
Answer given is : B according to me it should be D please verify
Answer given is : Baccording to me it should be Dplease verify
1 votes
0 answers
14
gate forum test series
given answer is won't there be an edge b/w (E and =) and (= and the uppermost node)
given answer is won't there be an edge b/w (E and =) and (= and the uppermost node)
2 votes
1 answer
15
gate forum test series
How to make sure that the answer we got is the minimum one in such questions? answer for this question : 6 (3 or gate , 3 not gate)
How to make sure that the answer we got is the minimum one in such questions?answer for this question : 6 (3 or gate , 3 not gate)
1 votes
1 answer
16
MadeEay Test Series 2018: Databases - Relational Algebra
here for 1st relation algebra operation the join operation is given without condition , will it be considered as natural join or cartesian product?
here for 1st relation algebra operation the join operation is given without condition , will it be considered as natural join or cartesian product?
1 votes
0 answers
20
MadeEasy Test Series 2018: Algorithms - Time Complexity
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers? a) O(logn) b) O(nlogn) c) O(n^2) d) O(n^2logn)
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers?a) O(logn)b) O(nlogn)c) O(n^2)d) O(n^2logn...
Page: