Register

Recent questions tagged made-easy-test-series

1 votes
1 answer
121
Made Easy Test Series
p ->(q->r). Could you please tell me how it is a tautology?
p ->(q->r). Could you please tell me how it is a tautology?
User Avatar
0 votes
1 answer
122
OS
By default the memory address starts with 0. But they have considered from 1. What should I consider when nothing is mentioned?
By default the memory address starts with 0. But they have considered from 1.What should I consider when nothing is mentioned?
User Avatar
5 votes
3 answers
123
Made easy Gate mock test -1
A Boolean Function must satisfy the condition f(a,b,c) = f(c,b,a). how many such functions are possible?
A Boolean Function must satisfy the condition f(a,b,c) = f(c,b,a). how many such functions are possible?
User Avatar
0 votes
0 answers
124
Made Easy Gate Mock -1
Let L be a language over {a,b} that contains the same number of occurrences of a and b. which of the following is non-regular? a. b. c. d. MSQ & answer is a,c,d
Let L be a language over {a,b} that contains the same number of occurrences of a and b. which of the following is non-regular? a. b. c. d. MSQ & answer is a,c,d
User Avatar
0 votes
0 answers
126
SQL
consider following relation How many number of records resulted by following SQL query? Select $T_{1}.A$ From R Where Exists (Select Count (*) From S Where R .C<S.F and S. E > 10 ); A 3 B 2 C 1 D 0
consider following relation How many number of records resulted by following SQL query?Select $T_{1}.A$From RWhere Exists (Select Count (*) From S Where R .C<S.F and S....
User Avatar
0 votes
2 answers
127
Made Easy Test Series | 3NF | True/False
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of R TRUE FALSE
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of RTRUEFALSE
User Avatar
0 votes
0 answers
129
made easy test series
The minimum number of SMALLEST PIECES of rod should be 32 of (length 9)as the others will be bigger than this i.e. of lenght 16 and 24??
The minimum number of SMALLEST PIECES of rod should be 32 of (length 9)as the others will be bigger than this i.e. of lenght 16 and 24??
User Avatar
0 votes
0 answers
131
#madeeasy
User Avatar
1 votes
0 answers
133
Made Easy Full Syllabus Test 3 Probability
can anyone verify if options are correct i am not satisfied with the solution given.
can anyone verify if options are correct i am not satisfied with the solution given.
User Avatar
1 votes
1 answer
134
Made Easy Full Syllabus Test 3 Logic
Could anyone give an example why 2nd and 3rd were false.
Could anyone give an example why 2nd and 3rd were false.
User Avatar
0 votes
1 answer
137
Made Easy Mock -1
how to approach this question?
how to approach this question?
User Avatar
2 votes
3 answers
138
Made Easy Mock -1
how does the program is working..? answer – 8
how does the program is working..?answer – 8
User Avatar
0 votes
0 answers
141
Made easy test series question
Any one please let me know if there is any other way to this output?
Any one please let me know if there is any other way to this output?
User Avatar
0 votes
1 answer
145
Number Of Substrings | Made Easy Test Series
The number of subwords for w=’SCALABLE” is equal to: 34 35 37
The number of subwords for w=’SCALABLE” is equal to:343537
User Avatar
0 votes
1 answer
148
MADEEASY TESTSERIES
To justify the OPTION B they gave an example of 2*2 matrix. However we can see that row 2 is linearly dependent on row1. Even though the 2nd row looks non-zero it can be made into zero. SO am I wrong or the explanation is wrong?
To justify the OPTION B they gave an example of 2*2 matrix. However we can see that row 2 is linearly dependent on row1. Even though the 2nd row looks non-zero it can be ...
User Avatar
1 votes
1 answer
150
TOC | Made Easy Test Series | Q.13
Consider the following statement S: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFL The above statement is: TRUE FALSE
Consider the following statementS: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFLThe above statement is:TRU...
User Avatar
Page: