Bihar STET Computer Science – Full-Length Mock Test 5

Questions 41-45 of 150

0% completed (0/150 answered)
Your score 0/150 0 answered
Correct 0 Incorrect 0 Unanswered 150 Accuracy 0%

Question 41

MCQ · Single Correct 1 mark

Which normal form requires that a relational table is in 3NF and every non-trivial functional dependency X -> Y has X as a super key?

Answers for question 41

Question 42

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 07.11.2025 (Shift-I) PYQ

Which normal form eliminates partial dependencies on a composite primary key?

Answers for question 42

Question 43

MCQ · Single Correct 1 mark

In ACID properties of database transactions, 'A' stands for:

Answers for question 43

Question 44

MCQ · Single Correct 1 mark

Which concurrency control protocol guarantees Serializability by forcing transactions to acquire locks in two distinct phases?

Answers for question 44

Question 45

MCQ · Single Correct 1 mark

What type of key uniquely identifies a record in a table and cannot contain NULL values?

Answers for question 45
Scroll to Top