Explanation

• Quick Sort is an in-place sorting algorithm.
• It does not require extra arrays, but uses recursion stack space.
• On average, recursion depth is log n, so space complexity is O(log n).

Additional information:

• Average space → O(log n)
• Best case → O(log n)
• Worst case → O(n) (unbalanced recursion)
• Time (average) → O(n log n)

Last verified on 24-03-2026

Explanation

• In Tuple Relational Calculus (TRC), queries are written using set-builder notation.
• The expression {S | F(S)} means “all tuples S such that condition F(S) is true”.
• It focuses on what to retrieve, not how to retrieve it.

Additional information:

• General form → {t | P(t)}
• t → Tuple variable
• P(t) → Predicate (condition)

Last verified on 24-03-2026

Explanation

• Best case occurs when the array is already sorted.
• With an optimized Bubble Sort (using a swap flag), no swaps are needed.
• The algorithm makes only one pass, resulting in O(n) time.

Additional information:

• Average case → O(n²)
• Worst case → O(n²)
• Comparisons in best case → (n − 1)
• Swaps → 0

Last verified on 24-03-2026

Explanation

• MAN (Metropolitan Area Network) covers a city or large town area.
• It is larger than LAN but smaller than WAN.
• It provides high-speed internet and connectivity across a city.

Additional information:

• PAN → Few meters (personal devices)
• LAN → Building / campus level
• MAN → City-wide (10–100 km range)
• WAN → Country / global level

Last verified on 24-03-2026

Explanation

• In a Deterministic Finite Automaton (DFA), δ (delta) represents the transition function.
• It defines how the automaton moves from one state to another.

Additional information:

• Q → Finite set of states
• Σ → Finite set of input symbols
• δ → Transition function (Q × Σ → Q)
• q₀ → Initial (start) state
• F → Set of final (accepting) states

Last verified on 24-03-2026

Explanation

• Compiled languages convert source code into machine code before execution.
• This makes programs run much faster than interpreted languages.
• Examples include C, C++, and Go.

Last verified on 24-03-2026

Explanation

• Best case occurs when the pivot divides the array into two equal halves each time.
• This leads to a balanced recursion tree.
• Hence, Quick Sort runs in O(n log n) time in the best case.

Additional information:

• Average case → O(n log n)
• Worst case → O(n²)
• Example size: n = 8 → log₂(8) = 3 levels
• Total comparisons ≈ n log n

Last verified on 24-03-2026

Explanation

• In C++, vector is used as a dynamic array.
• It automatically resizes itself when elements are added or removed.
• It is part of the Standard Template Library (STL).

Last verified on 24-03-2026

Explanation

• Merge Sort requires extra memory to merge sorted subarrays.
• It is not an in-place algorithm.
• Therefore, its space complexity is O(n) for an array of size n.

Additional information:

• Time complexity (Best) → O(n log n)
• Time complexity (Average) → O(n log n)
• Time complexity (Worst) → O(n log n)
• Recursion stack → O(log n)

Last verified on 24-03-2026

Explanation

• A Candidate Key is the smallest (minimal) set of attributes that uniquely identifies each record in a table.
• They are also called possible keys.
• It must be unique and cannot contain unnecessary attributes.
• A table can have multiple candidate keys, but only one is chosen as the primary key.

Last verified on 24-03-2026