Register
Filter

Questions by Ram Swaroop

3 votes
2 answers
2
Made easy mock test 1 DBMS super keys
Consider the following relation R(A1, A2,...A15) with (A1,A2, ... A6) of relation R are simple candidate key. The number of possible superkey in relation R is_
Consider the following relation R(A1, A2,...A15) with (A1,A2, ... A6) of relation R are simple candidate key. The number of possible superkey in relation R is_
1 votes
1 answer
3
MadeEasy Test Series 2019: Algorithms - Spanning Tree
Consider a simple undirected weighted graph G(V, E) with 10 vertices and 45 edge, assume (u, v) are two vertices weight of a edge is =4lu- vl then the minimum cost of the spanning tree of G_ 36
Consider a simple undirected weighted graph G(V, E) with 10 vertices and 45 edge, assume (u, v) are two vertices weight of a edge is =4lu- vl then the minimum cost of the...
2 votes
1 answer
7
MadeEasy Test Series: Programming & DS - Programming in C
Consider the following C code: include <stdio.h> int fun() { static int num=25; return num--; } int main() { for(fun( ); fun();fun()) printf("%d", fun( )); return O; } The sum of the values printed by the above program will be
Consider the following C code:include <stdio.h>int fun(){static int num=25;return num ;}int main(){for(fun( ); fun();fun())printf("%d", fun( ));return O;}The sum of the v...
1 votes
1 answer
9
Made easy tree height
The height of a binary tree is defined as the number of nodes in the longest path from root to the leaf node. Let X be the height of a complete binary tree with 256 nodes. Then the value of X will be Answer 9
The height of a binary tree is defined as the number of nodes in the longest path from root to the leaf node. Let X be the height of a complete binary tree with 256 nodes...
0 votes
1 answer
10
MadeEasy Test Series 2019: Programming & DS - Hashing
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is_ Answer 1.647
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search...
0 votes
1 answer
11
MadeEasy Test Series : Probability - Probability
A dice is tossed thrice. A success is getting ‘1 or 6' on a toss. Find the variance of number of successes _. Answer 0.66
A dice is tossed thrice. A success is getting ‘1 or 6' on a toss. Find the variance of number of successes _. Answer 0.66
0 votes
0 answers
15
Gate 2018 ME set 1 question 9
Which of the following functions describe the graph shown in the below figure? (A) y=||x|+1|−2 (B) y=||x|−1|−1 (C) y=||x|+1|−1 (D) y=||x|−1|−1|
Which of the following functions describe the graph shown in the below figure? (A) y=||x|+1|−2(B) y=||x|−1|−1(C) y=||x|+1|−1(D) y=||x|−1|−1|
0 votes
1 answer
16
made easy theory of computation regular expression
which one of the following regular expression describe the language over {a,b} consist of no pair of consecutive a’s? a. (b*abb*) (a+€) b. (b+ab)* (a+€) c. (b*abb*)*(a+€)+b* d. (b*ab*)*(a+€)+b*(a+€)
which one of the following regular expression describe the language over {a,b} consist of no pair of consecutive a’s?a. (b*abb*) (a+€)b. (b+ab)* (a+€)c. (...
1 votes
3 answers
17
Subject Topic- Programming & DS
Which operator has higher priority between *and / in any expression how to evaluate them
Which operator has higher priority between *and / in any expression how to evaluate them