Question
Which of the following data structures offers O(1)
average-case time complexity for insertion, deletion, and search operations?Solution
Hash tables, when implemented with a good hash function and collision resolution strategy, provide average-case O(1) time complexity for these operations. Worst-case can be O(N) in case of many collisions.
The "Dirty Read" problem occurs when:
Which SQL statement is used to remove all rows from a table without logging individual row deletions?
What is the output of the following pseudo-code?Â
 ```
  count = 0
  for i from 1 to 3:
    for j from 1 t...
What is referential integrity?
Which deadlock prevention scheme allows older transactions to preempt younger ones?
What will be the output of the following Python code:
a=[1,2,3,4,5,6]
print(a[-1],a[-1:],a[:-1])
A software defect that causes a program to produce incorrect output without crashing or displaying an error message is typically classified as a:Â
Which of the following commands are used to put a restriction on the number of rows returned from a query?
Which of the following is a type of database index?
A relation is in 2NF if:
