GATE CS Core MSQ MCQs with Answers

GATE CS technical MSQ 4: Select all correct statements about a binary search tree with distinct keys.

A. An inorder traversal lists keys in sorted order. B. Search time is always O(log n), regardless of shape. C. Its height can be n−1. D. Every node must have exactly two children.

gate-cs GATE CS Core MSQ IndiaMedium

GATE CS technical MSQ 5: Select all correct statements about relational databases.

A. A primary key uniquely identifies a row. B. A foreign key can enforce referential integrity. C. Every relation must contain duplicate tuples. D. Normalization can reduce update anomalies.

gate-cs GATE CS Core MSQ IndiaMedium

GATE CS technical MSQ 6: Select all correct statements about deadlock.

A. Mutual exclusion is one Coffman condition. B. Circular wait is one Coffman condition. C. Preemption is always impossible in every resource system. D. Breaking hold-and-wait can prevent deadlock.

gate-cs GATE CS Core MSQ IndiaMedium

GATE CS technical MSQ 7: Select all correct statements about a binary search tree with distinct keys.

A. An inorder traversal lists keys in sorted order. B. Search time is always O(log n), regardless of shape. C. Its height can be n−1. D. Every node must have exactly two children.

gate-cs GATE CS Core MSQ IndiaMedium

GATE CS technical MSQ 8: Select all correct statements about relational databases.

A. A primary key uniquely identifies a row. B. A foreign key can enforce referential integrity. C. Every relation must contain duplicate tuples. D. Normalization can reduce update anomalies.

gate-cs GATE CS Core MSQ IndiaMedium

GATE CS technical MSQ 9: Select all correct statements about deadlock.

A. Mutual exclusion is one Coffman condition. B. Circular wait is one Coffman condition. C. Preemption is always impossible in every resource system. D. Breaking hold-and-wait can prevent deadlock.

gate-cs GATE CS Core MSQ IndiaMedium

GATE CS technical MSQ 10: Select all correct statements about a binary search tree with distinct keys.

A. An inorder traversal lists keys in sorted order. B. Search time is always O(log n), regardless of shape. C. Its height can be n−1. D. Every node must have exactly two children.

gate-cs GATE CS Core MSQ IndiaMedium

GATE CS technical MSQ 11: Select all correct statements about relational databases.

A. A primary key uniquely identifies a row. B. A foreign key can enforce referential integrity. C. Every relation must contain duplicate tuples. D. Normalization can reduce update anomalies.

gate-cs GATE CS Core MSQ IndiaMedium

GATE CS technical MSQ 12: Select all correct statements about deadlock.

A. Mutual exclusion is one Coffman condition. B. Circular wait is one Coffman condition. C. Preemption is always impossible in every resource system. D. Breaking hold-and-wait can prevent deadlock.

gate-cs GATE CS Core MSQ IndiaMedium

GATE CS technical MSQ 13: Select all correct statements about a binary search tree with distinct keys.

A. An inorder traversal lists keys in sorted order. B. Search time is always O(log n), regardless of shape. C. Its height can be n−1. D. Every node must have exactly two children.

gate-cs GATE CS Core MSQ IndiaMedium

GATE CS technical MSQ 14: Select all correct statements about relational databases.

A. A primary key uniquely identifies a row. B. A foreign key can enforce referential integrity. C. Every relation must contain duplicate tuples. D. Normalization can reduce update anomalies.

gate-cs GATE CS Core MSQ IndiaMedium

GATE CS technical MSQ 15: Select all correct statements about deadlock.

A. Mutual exclusion is one Coffman condition. B. Circular wait is one Coffman condition. C. Preemption is always impossible in every resource system. D. Breaking hold-and-wait can prevent deadlock.