Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged made-easy-test-series
0
votes
0
answers
1021
MadeEasy Test Series: Theory Of Computation - Finite Automata
Answer given is : 6 How to solve such questions?
Answer given is : 6How to solve such questions?
charul
363
views
charul
asked
Dec 6, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
0
votes
0
answers
1022
MadeEasy Test Series: Compiler Design - Code Optimization
I'm getting 4 nodes and 5 edges. But the answer given is : 6 nodes and 7 edges
I'm getting 4 nodes and 5 edges. But the answer given is : 6 nodes and 7 edges
charul
558
views
charul
asked
Dec 6, 2017
Compiler Design
made-easy-test-series
compiler-design
code-optimization
+
–
2
votes
2
answers
1023
made-easy
Consider the following productions along with their semantic rules Here ⋅ i and ⋅ s corresponds to inherited and synthesized attributes respectively. The value for expression 3 ∗ 4 __________.
Consider the following productions along with their semantic rulesHere ⋅ i and ⋅ s corresponds to inherited and synthesized attributes respectively. The value for exp...
Jaspreet Kaur Bains
1.1k
views
Jaspreet Kaur Bains
asked
Dec 6, 2017
Compiler Design
compiler-design
syntax-directed-translation
expression-evaluation
numerical-answers
made-easy-test-series
+
–
0
votes
0
answers
1024
MadeEasy Test Series: Algorithms - Asymptotic Notations
charul
393
views
charul
asked
Dec 6, 2017
Algorithms
made-easy-test-series
algorithms
asymptotic-notation
+
–
0
votes
1
answer
1025
MadeEasy Test Series: Algorithms - Time Complexity
a) θ(logn) b) θ(nlogn) c) θ(n) answer given is : b
a) θ(logn)b) θ(nlogn)c) θ(n)answer given is : b
charul
304
views
charul
asked
Dec 6, 2017
Algorithms
made-easy-test-series
algorithms
time-complexity
+
–
0
votes
3
answers
1026
Network
IP address of a computer is 202.19.49.116 what would be host on network( Marks: 1.00 ) 202.19.0.0 202.19.49.0 0.0.0.116 None of these
IP address of a computer is 202.19.49.116 what would be host on network( Marks: 1.00 ) 202.19.0.0 202.19.49.0 0.0.0.116 None of these
heena singh
603
views
heena singh
asked
Dec 5, 2017
Computer Networks
made-easy-test-series
computer-networks
ip-addressing
+
–
2
votes
1
answer
1027
MadeEasy Test Series: Databases - Transactions
Consider the following schedule: S:r1(a) r3(d) w1(B) r2(B) r4(B) w2(C) r5(C) w4(E) r5(E) w5(B) How many serial schedules conflict equal to schedules (S)?
Consider the following schedule:S:r1(a) r3(d) w1(B) r2(B) r4(B) w2(C) r5(C) w4(E) r5(E) w5(B)How many serial schedules conflict equal to schedules (S)?
shivangi5
1.8k
views
shivangi5
asked
Dec 4, 2017
Databases
transaction-and-concurrency
databases
made-easy-test-series
+
–
0
votes
2
answers
1028
MadeEasy Test Series: Algorithms - Hashing
S1 :- if load factor of hash table is less than 1 then there are no collision S2:- As the size of hash table increases, the number of collisions will decrease. True false?
S1 :- if load factor of hash table is less than 1 then there are no collisionS2:- As the size of hash table increases, the number of collisions will decrease.True false?
rahul sharma 5
1.6k
views
rahul sharma 5
asked
Dec 4, 2017
Algorithms
algorithms
made-easy-test-series
test-series
hashing
+
–
0
votes
0
answers
1029
MadeEasy Test Series: Databases - B Tree
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels? given ans is 2499 but I am getting 2450
Suppose size of block 1000 bytes search key of 12 bytes, pointer size 8 bytes. How many maximum records in DB file which can index by dense B+ tree of 2 levels?given ans ...
sunaina rawat
396
views
sunaina rawat
asked
Dec 4, 2017
Databases
made-easy-test-series
databases
b-tree
+
–
1
votes
0
answers
1030
MadeEasy Test Series: Databases - Indexing
Which of the following statement is/are true? For any data file it is possible to construct two separate sparse first level indexes on different keys. For any data file, it is possible to construct two separate dense first level indexes ... possible to construct a sparse first level index and a dense second level index,both should be useful. All the above
Which of the following statement is/are true?For any data file it is possible to construct two separate sparse first level indexes on different keys.For any data file, it...
shivangi5
581
views
shivangi5
asked
Dec 4, 2017
Databases
made-easy-test-series
databases
indexing
+
–
3
votes
1
answer
1031
MadeEasy Test Series: Databases - Er Diagram
In the solution they have merged E1 R4 E4 , E2 R3 E3 R5 , R6 E5. MY DOUBT IS , why cant we only merge R4 E4 instead of E1 R4 E4. since there is total participation on the E4 side of the relation and it would also decrease the number of attributes .
In the solution they have merged E1 R4 E4 , E2 R3 E3 R5 , R6 E5.MY DOUBT IS , why cant we only merge R4 E4 instead of E1 R4 E4. since there is total participation on the ...
shaurya vardhan
1.1k
views
shaurya vardhan
asked
Dec 4, 2017
Databases
databases
er-diagram
er-to-relational
rdbms
made-easy-test-series
+
–
1
votes
3
answers
1032
MadeEasy Test Series: Databases - B Tree
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node. B tree index has more levels than B+ tree index for large number of keys. B+ tree index has more levels than B ... records. B+ tree index nodes more than B tree for large number of keys I think a is correct but the given ans is b
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node.B tree index has more levels than B+ tree ...
shivangi5
1.8k
views
shivangi5
asked
Dec 4, 2017
Databases
made-easy-test-series
databases
b-tree
+
–
0
votes
3
answers
1033
MadeEasy Test Series: Digital Logic - Adder
A 1-bit full adder circuit takes 5 ns to generate the carry-out bit and 10 ns for the sum-bit. When 4, 1-bit full adders are cascaded, the maximum rate of additions per second will be _______ × 107.
A 1-bit full adder circuit takes 5 ns to generate the carry-out bit and 10 ns for the sum-bit. When 4, 1-bit full adders are cascaded, the maximum rate of additions per s...
shivangi5
1.3k
views
shivangi5
asked
Dec 4, 2017
Digital Logic
made-easy-test-series
digital-logic
adder
+
–
0
votes
1
answer
1034
MadeEasy Test Series: Computer Networks - Network Security
Consider the following statements with respect to digital signatures: S1: Digital signature ensures authenticity of the sender but not integrity of the message. S2: A single secret key can be used by the sender to sign multiple ... Both RSA cryptosystem and RSA digital signature scheme uses same set of keys. Which of the following is true?
Consider the following statements with respect to digital signatures:S1: Digital signature ensures authenticity of the sender but not integrity of the message.S2: A singl...
Appu B
1.8k
views
Appu B
asked
Dec 3, 2017
Computer Networks
made-easy-test-series
computer-networks
cryptography
network-security
rsa-security-networks
+
–
0
votes
2
answers
1035
MadeEasy Test Series: Digital Logic - Digital Counter
What is the best architecture of the ‘Logic gate’? a 3-bit input AND gate a 2-input AND gate a NOT gate a wire connection (no logic gate needed)
What is the best architecture of the ‘Logic gate’?a 3-bit input AND gatea 2-input AND gatea NOT gatea wire connection (no logic gate needed)
shivangi5
377
views
shivangi5
asked
Dec 3, 2017
Digital Logic
made-easy-test-series
digital-logic
digital-counter
+
–
0
votes
1
answer
1036
MadeEasy Test Series: Digital Logic - Adder
Jaspreet Kaur Bains
534
views
Jaspreet Kaur Bains
asked
Dec 3, 2017
Digital Logic
made-easy-test-series
digital-logic
adder
multiplexer
+
–
0
votes
0
answers
1037
MadeEasy Test Series: Digital Logic - Digital Counter
Jaspreet Kaur Bains
374
views
Jaspreet Kaur Bains
asked
Dec 3, 2017
Digital Logic
made-easy-test-series
digital-logic
digital-counter
multiplexer
+
–
0
votes
1
answer
1038
MadeEasy Test Series 2018: Theory Of Computation - Finite Automata
Let A be a NFA with epsilon transitions such that there are no transitions into q0 (start state) and no transitions out of qf (the accepting state). Let L be the language recognized by A. The above automata A' is modified by ... the modified A' in terms of L' will be : Same as L Accepts null Accepts universal language Accept L+
Let A be a NFA with epsilon transitions such that there are no transitions into q0 (start state) and no transitions out of qf (the accepting state). Let L be the language...
badmetevils
1.9k
views
badmetevils
asked
Dec 2, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
0
votes
1
answer
1039
MadeEasy Test Series 2017: Probability - Conditional Probability
Hi Guys, I think final answer of following question should be 0.47. Please correct me if i am wrong.
Hi Guys,I think final answer of following question should be 0.47. Please correct me if i am wrong.
Chhotu
474
views
Chhotu
asked
Dec 1, 2017
Probability
made-easy-test-series
engineering-mathematics
probability
+
–
1
votes
0
answers
1040
MadeEasy Test Series: Databases - Transactions
Deadlock prevention(wait-kill && wound-wait) is free from both starvation as well as deadlock? True or false?
Deadlock prevention(wait-kill && wound-wait) is free from both starvation as well as deadlock?True or false?
learner_geek
358
views
learner_geek
asked
Dec 1, 2017
Databases
transaction-and-concurrency
databases
test-series
made-easy-test-series
deadlock-prevention
+
–
1
votes
0
answers
1041
MadeEasy Subject Test: Databases - Transactions
In below schedule (S) it has cascading abort or not?
In below schedule (S) it has cascading abort or not?
learner_geek
411
views
learner_geek
asked
Dec 1, 2017
Databases
made-easy-test-series
databases
transaction-and-concurrency
+
–
4
votes
1
answer
1042
MadeEasy Subject Test: Theory of Computation - Decidability
1) L is undecidable 2) L is decidable 3) L is regular 4) none Answer given: 1) undecidable My solution: Since L(M) is reducible to a CFL language and since all CFL are recursive that means language accepted by M is ... halts on all inputs so this language will too and answer should be decidable. How to approach this type of question ?
1) L is undecidable2) L is decidable3) L is regular4) none Answer given: 1) undecidableMy solution: Since L(M) is reducible to a CFL language and since all CFL are recurs...
♥_Less
695
views
♥_Less
asked
Nov 30, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
decidability
+
–
0
votes
1
answer
1043
MadeEasy Subject Test: Algorithms - Graph Algorithms
complexity of kruskal algorithum for finding the minimum cost spanning tree of an undirected graph contain n vertices and m edges if the edge are already sorted.??
complexity of kruskal algorithum for finding the minimum cost spanning tree of an undirected graph contain n vertices and m edges if the edge are already sorted.??
aaru14
308
views
aaru14
asked
Nov 30, 2017
Algorithms
made-easy-test-series
algorithms
graph-algorithm
+
–
2
votes
0
answers
1044
MadeEasy Subject Test: Theory of Computation - Pushdown Automata
The language {w| the length of w is odd and it's middle symbol is 0, Wε(0+1)*} Why do we need a PDA for above language. I don't think we need a PDA for this language. I wrote the following RE. Tell me whats ... ]+ + (other small left over strings like 0,101,100,001,000..... which are not covered in first part of expression)
The language {w| the length of w is odd and it's middle symbol is 0, Wε(0+1)*}Why do we need a PDA for above language. I don't think we need a PDA for this language. I w...
♥_Less
392
views
♥_Less
asked
Nov 29, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
pushdown-automata
+
–
0
votes
1
answer
1045
MadeEasy Subject Test: Programming & DS - Programming in C
Answer given is : 36
Answer given is : 36
charul
223
views
charul
asked
Nov 29, 2017
Programming in C
made-easy-test-series
programming-in-c
programming
+
–
0
votes
4
answers
1046
MadeEasy Advance Level Test: Theory of Computation - Finite Automata
Answer given is 2,but shouldn't it be 3? State itself will be there in e-closure?
Answer given is 2,but shouldn't it be 3? State itself will be there in e-closure?
rahul sharma 5
1.1k
views
rahul sharma 5
asked
Nov 28, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
0
votes
1
answer
1047
OnlineTest Series
saxena0612
423
views
saxena0612
asked
Nov 28, 2017
Compiler Design
compiler-design
parsing
lr-parser
numerical-answers
made-easy-test-series
+
–
0
votes
0
answers
1048
MADE EASY TEST SERIES
Consider a CPU that executes at a clock rate of 200 MHz (5 ns per cycle) with a single level of cache. CPIexecution i.e. CPI with ideal memory is 1.1. Instruction mix are 50% arithmetic / logical, 30% load / store, 20% control instruction. Assume the ... rate is 15% and a miss penalty of 5 cycles. The number of times cpu with ideal memory is faster when no miss-occurs _______.
Consider a CPU that executes at a clock rate of 200 MHz (5 ns per cycle) with a single level of cache. CPIexecution i.e. CPI with ideal memory is 1.1. Instruction mix are...
shivangi5
264
views
shivangi5
asked
Nov 28, 2017
CO and Architecture
made-easy-test-series
+
–
1
votes
0
answers
1049
Made Easy: 2017-18: DISCRETE MATHEMATICS-2: Q: 14
Hi Guys, For the following question provided answer is 1(means 'h' ). But why is element 'g' can not complement of 'b' ?
Hi Guys,For the following question provided answer is 1(means 'h' ). But why is element 'g' can not complement of 'b' ?
Chhotu
1.2k
views
Chhotu
asked
Nov 28, 2017
Mathematical Logic
made-easy-test-series
discrete-mathematics
lattice
+
–
0
votes
0
answers
1050
MadeEasy Subject Test: Engineering Mathematics - Recurrence
Hi Guys, Why is option (C) wrong for the following question ? PS: One reason could be it is solution to the recurrence relation. is there any other reason ?
Hi Guys,Why is option (C) wrong for the following question ?PS: One reason could be it is solution to the recurrence relation. is there any other reason ?
Chhotu
248
views
Chhotu
asked
Nov 28, 2017
Combinatory
made-easy-test-series
discrete-mathematics
recurrence-relation
+
–
Page:
« prev
1
...
30
31
32
33
34
35
36
37
38
39
40
...
57
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register