Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence 1, 2, 3, 4, 5 in that order?

Linked lists are not suitable data structures of which one of the following problems?

State True or False with reason. There is always a decomposition into Boyce-codd normal form $$(BCNF)$$ that is lossless and dependency preserving.

An instance of a relational scheme R(A, B, C) has distinct values for attribute A. Can you conclude that A is a candidate key for R?