Mathematics · Quantitative Aptitude

Logarithms

246 Questions

Logarithms are mathematical operations that determine the exponent required for a base to reach a specific number. This topic tests the application of logarithmic properties, changing bases, and solving complex equations. It is a high-yield topic for quantitative aptitude in competitive exams.

Logarithmic expressionsBase change propertiesSolving log equationsInfinite series logsCharacteristic values

Logarithms Questions

Multiple choice
  1. A = 1050 B = 2055 C = 720

  2. A = 957 B = 2055 C = 720

  3. A = 957 B = 2055 C = 640

  4. None of these

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

When the system comes back, the operation redo to is performed since the record. Appears in the log on the disk after this operation is executed, the values of account A and B are $957 and $2055, respectively. The value of account C remains $720 because T1 has not been committed yet.

Multiple choice
  1. $\frac{343}{125}$
  2. $\frac{125}{343}$
  3. $\frac{-25}{49}$
  4. $\frac{-49}{25}$
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

$log x \Big(\frac{5}{7}\Big) = - \frac{1}{3} \\ \Big(\frac{5}{7}\Big) = (x^{\frac{-1}{3}})$

Or, $x^{\frac{1}{3}}=(\frac{7}{5})$
Hence, x = $(\frac{7}{5})^3 = \frac{343}{125}$

Multiple choice
  1. O(n2)

  2. O(n log n)

  3. O(n)

  4. O(log n)

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

This recurrence adds log n at each of n steps. Summing log 1 + log 2 + ... + log n = log(n!) ≈ n log n - n + O(log n) by Stirling's approximation. Therefore T(n) = O(n log n). The O(n) option would require constant work per step, and O(n²) would require linearly growing work.