1
GATE CSE 2015 Set 3
Numerical
+2
-0
Let $$G$$ be a connected undirected graph of $$100$$ vertices and $$300$$ edges. The weight of a minimum spanning tree of $$G$$ is $$500.$$ When the weight of each edge of $$G$$ is increased by five, the weight of a minimum spanning tree becomes ________.
Your input ____
2
GATE CSE 2015 Set 3
Numerical
+1
-0
Consider a binary tree $$T$$ that has $$200$$ leaf nodes. Then, the number of nodes in $$T$$ that have exactly two children are ________.
Your input ____
3
GATE CSE 2015 Set 3
Numerical
+1
-0
Given a hash table $$š‘‡$$ with $$25$$ slots that stores $$2000$$ elements, the load factor $$\alpha $$ for $$š‘‡$$ is ____________ .
Your input ____
4
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Consider the following partial Schedule S involving two transactions $$T1$$ and $$T2.$$ Only the read and the write operations have been shown. The read operation on data item $$P$$ is denoted by read$$(P)$$ and the write operation on data item $$P$$ is denoted by write $$(P).$$ GATE CSE 2015 Set 3 Database Management System - Transactions and Concurrency Question 14 English

Suppose that the transaction $$T1$$ fails immediately after time instance $$9.$$ Which one of the following statements is correct?

A
$$T2$$ must be aborted and then both $$T1$$ and $$T2$$ must be re-started to ensure transaction atomicity
B
Schedule $$S$$ is non-recoverable and cannot ensure transaction atomicity
C
Only $$T2$$ must be aborted and then re-started to ensure transaction atomicity
D
Schedule $$S$$ is recoverable and can ensure atomicity and nothing else needs to be done
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12