1
GATE CSE 1999
MCQ (Single Correct Answer)
+2
-0.6
For the schedule given below, which of the following is correct: GATE CSE 1999 Database Management System - Transactions and Concurrency Question 25 English
A
This schedule is serialized and can occur in a scheme using 2PL protocol
B
This schedule is serializable but cannot occur in a scheme using 2PL protocol
C
This schedule is not serializable but can occur in a scheme using 2PL protocol
D
This schedule is not serializable and cannot occur in a scheme using 2PL protocol.
2
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is correct?
A
B-trees are for storing data on disk and B+ trees are for main memory.
B
Range queries are faster on B+ trees.
C
B-trees are for primary indexes and B+ trees are for secondary indexes.
D
The height of a B+ tree is independent of the number of records.
3
GATE CSE 1999
MCQ (More than One Correct Answer)
+2
-0.6
Zero has two representations in:
A
Sign magnitude
B
$$1's$$ complement
C
$$2's$$ complement
D
None of the above
4
GATE CSE 1999
MCQ (More than One Correct Answer)
+2
-0.6
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?
A
$$XOR$$ gates, $$NOT$$ gates
B
$$2$$ to $$1$$ multiplexers
C
$$AND$$ gates, $$XOR$$ gates
D
Three-input gates that output $$(A.B) + C$$ for the inputs $$A. B$$ and $$C.$$
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12