Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
shivangi5
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by shivangi5
1
votes
1
answer
1
MadeEasy Test Series: Programming & DS - Stack
Options are TI==(P/Q*i-1) Ti==(P/Q*i+1) Ti==(P/Q*(i-1)-1) Ti==(P/Q*(i+1)-1)
Options areTI==(P/Q*i-1)Ti==(P/Q*i+1)Ti==(P/Q*(i-1)-1)Ti==(P/Q*(i+1)-1)
633
views
asked
Dec 12, 2017
Programming in C
made-easy-test-series
data-structures
stack
array
+
–
2
votes
0
answers
2
Normalization
Which of the following statement false is relation R is in 3NF but not BCNF? A) Relation R must consist atleast two over-lapped candidate keys. B) Relation R must consist proper subset of candidate key determines proper subset of some other candidate key ... atleast two compound candidate keys. Someone please explain what does Option A refers here.......i.e overlapped candidate keys
Which of the following statement false is relation R is in 3NF but not BCNF?A) Relation R must consist atleast two over-lapped candidate keys.B) Relation R must consist p...
831
views
asked
Dec 6, 2017
Databases
database-normalization
databases
bcnf
+
–
3
votes
1
answer
3
2 Phase Locking
Consider the following schedule: S:R2(A) W1(B) W1(C) R3(B) R2(B) R1(A) C1 R2(C) C2 W3(A)C3 Please explain how it is allowed in 2 PL
Consider the following schedule:S:R2(A) W1(B) W1(C) R3(B) R2(B) R1(A) C1 R2(C) C2 W3(A)C3Please explain how it is allowed in 2 PL
1.2k
views
asked
Dec 6, 2017
Databases
-2phaselocking
serializability
databases
transaction-and-concurrency
+
–
3
votes
3
answers
4
VIEW SERIALIZABILITY
Consider the 2 transactions T1: R(A) W(A) W(B) T2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3
Consider the 2 transactionsT1: R(A) W(A) W(B)T2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0(B) 1(C) 2(...
2.9k
views
asked
Dec 6, 2017
Databases
view-serializable
databases
transaction-and-concurrency
concurrency
+
–
2
votes
1
answer
5
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)?
1.8k
views
asked
Dec 4, 2017
Databases
transaction-and-concurrency
databases
made-easy-test-series
+
–
1
votes
0
answers
6
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...
580
views
asked
Dec 4, 2017
Databases
made-easy-test-series
databases
indexing
+
–
1
votes
3
answers
7
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 ...
1.8k
views
asked
Dec 4, 2017
Databases
made-easy-test-series
databases
b-tree
+
–
0
votes
3
answers
8
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...
1.3k
views
asked
Dec 4, 2017
Digital Logic
made-easy-test-series
digital-logic
adder
+
–
0
votes
2
answers
9
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)
376
views
asked
Dec 3, 2017
Digital Logic
made-easy-test-series
digital-logic
digital-counter
+
–
0
votes
1
answer
10
DCFL or not
Consider the following languages: L1={abna2n|n>=0} L2={aabna3n|n>=0} Why L1UL2 is DCFL please explain?
Consider the following languages:L1={abna2n|n>=0}L2={aabna3n|n>=0}Why L1UL2 is DCFL please explain?
852
views
asked
Dec 2, 2017
Theory of Computation
theory-of-computation
dcfl
context-free-language
+
–
0
votes
0
answers
11
Push Down Automata
Consider the following statement: S: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property. Please explain as why this sentence is wrong....
Consider the following statement:S: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property.Please explain as why this sentence ...
449
views
asked
Dec 1, 2017
Theory of Computation
theory-of-computation
pushdown-automata
dpda
+
–
0
votes
0
answers
12
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...
264
views
asked
Nov 28, 2017
CO and Architecture
made-easy-test-series
+
–
2
votes
1
answer
13
MadeEasy Subject Test: Databases - Transactions
The number of concurrent schedules can be formed with 3 transactions having 3, 2 and 1 operations respectively _________ I am getting 54 but the given ans is 60. My doubt is are serial schedules counted or not in the concurrent schedules.
The number of concurrent schedules can be formed with 3 transactions having 3, 2 and 1 operations respectively _________I am getting 54 but the given ans is 60.My doubt i...
656
views
asked
Nov 24, 2017
Databases
made-easy-test-series
databases
transaction-and-concurrency
+
–
0
votes
0
answers
14
Made Easy Test Series
The number of ways possible to form injective function from set A set B where |A| = 3 and |B| = 5 such that pth element of set A cannot match with pth element of set B are _________.
The number of ways possible to form injective function from set A set B where |A| = 3 and |B| = 5 such that pth element of set A cannot match with pth element of set B ar...
435
views
asked
Nov 18, 2017
Set Theory & Algebra
made-easy-test-series
discrete-mathematics
+
–
2
votes
3
answers
15
Max Heap
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
3.0k
views
asked
Nov 7, 2017
DS
binary-heap
data-structures
+
–
1
votes
2
answers
16
Stack
Let S be a stack of size 4 ≥ 1 and it is initially empty. Suppose we push the numbers 1, 2, 3, 4 in sequence and then perform 4 pop operations. Let one push operation takes 5 ns; one pop operation takes 5 ns; the time between the end of one such stack ... to the start of the pop operation that removes p from the stack. The average stack-life of an element of this stack is ___________ (in ns).
Let S be a stack of size 4 ≥ 1 and it is initially empty. Suppose we push the numbers 1, 2, 3, 4 in sequence and then perform 4 pop operations. Let one push operation t...
769
views
asked
Nov 7, 2017
DS
data-structures
stack
+
–
3
votes
3
answers
17
Stack
Consider an efficient implementation of a data structure STACK-MAX that support an operation max( ) that reports the current maximum among all elements in the stack. Normal stack operations i.e., push, pop are also to be supported. The size of above data structure after performing ... (8), pop, pop, max, push (5) is ________ (in bytes). Assume that an integer can be stored in 4 bytes.
Consider an efficient implementation of a data structure STACK-MAX that support an operation “max( )” that reports the current maximum among all elements in the stack...
3.1k
views
asked
Nov 7, 2017
DS
data-structures
stack
+
–
1
votes
1
answer
18
Depth first search
Consider the following graph G. Modified DFS on G applied as follows: • Starting vertex is ‘p’. • Vertex is visited based on alphabetic order. • Vertices are visited in order p, q, r, s, t, v. • It works same as DFS except the visiting order restriction What is the number of back edges during the above DFS traversal on G ______________
Consider the following graph G.Modified DFS on G applied as follows:• Starting vertex is ‘p’.• Vertex is visited based on alphabetic order.• Vertices are visite...
1.5k
views
asked
Nov 6, 2017
Algorithms
depth-first-search
+
–
0
votes
0
answers
19
#Hashing
Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from 1 to 6. Which of the following locations will never be probed if a collision occurs at position 5? A). 4 B). 5 C). 8 D). 6
Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from 1 to 6. Which of the following locations will never be ...
333
views
asked
Oct 31, 2017
Programming in C
hashing
+
–
3
votes
1
answer
20
Compiler
Which of the following statements are correct and why.....? Every regular set has LR(1) grammar Every regular grammar is LR(1).
Which of the following statements are correct and why.....?Every regular set has LR(1) grammarEvery regular grammar is LR(1).
457
views
asked
Oct 30, 2017
Compiler Design
compiler-design
grammar
regular-grammar
lr-parser
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register