Which of the following is the greatest? \[ 0.6, \ 0.666, \ \frac{5}{6}, \ \frac{2}{3} \]
Which of the following is the greatest? \[ 0.6, \ 0.666, \ \frac{5}{6}, \ \frac{2}{3} \]
Show Hint
To compare repeating and terminating decimals, convert them to fractions and compare their values.
0.6
0.666
\( \frac{5}{6} \)
\( \frac{2}{3} \)
The Correct Option is B
Solution and Explanation
Step 1: Convert the decimals to fractions
- 0.6 is equivalent to \( \frac{2}{3} \).
- 0.666 is already a terminating decimal and equals \( \frac{2}{3} \).
- \( \frac{5}{6} \) is in its simplest fractional form.
- \( \frac{2}{3} \) is also in its simplest form.
Step 2: Comparison
- \( 0.6 = \frac{2}{3} \), which is less than 0.666.
- 0.666 is slightly greater than \( \frac{2}{3} \), and is the greatest among the values listed.
Thus, the correct answer is (B).
Top Questions on Trees
Consider the following code:
int a; int arr[] = {30, 50, 10}; int *ptr = arr[10] + 1; a = *ptr; (*ptr)++; ptr = ptr + 1; printf("%d", a + arr[1] + *ptr);What is the output of the following C code?
void foo(int *p, int x) { *p = x; } void main() { int *z; int a = 20, b = 25; z = a; // Incorrect: Should be z = a; foo(z, b); printf("%d", a); }Issue: The statement
z = a;is invalid becauseais an integer, andzis a pointer.Find the signed binary expansion of the number -6.
Given the following information:
The logical address (L.A.) is 32 bits. The physical address (P.A.) is 20 bits. The page size (P.S.) is 2048 bytes (2 KB). What is the maximum number of entries in the page table?Consider the following hierarchical cache system with the following access times:
\[ \begin{array}{|c|c|c|} \hline \textbf{Cache Level} & \textbf{Hit Rate} & \textbf{Access Time} \\ \hline L1 & 90\% & 1 \text{ ns} \\ L2 & 80\% & 10 \text{ ns} \\ L3 & 100\% & 100 \text{ ns} \\ \hline \end{array} \]Find \( T_{avg} \) for hierarchical or simultaneous access.
Questions Asked in GATE CS exam
Match the following layers with their corresponding functionalities:
\[ \begin{array}{|c|c|} \hline \textbf{Layer} & \textbf{Functionality} \\ \hline \text{Networking Layer} & \text{Data packet transfer} \\ \text{Transport Layer} & \text{Host-to-host communication} \\ \text{Data Link Layer} & \text{Error detection and correction} \\ \hline \end{array} \]- GATE CS - 2025
- Programming in C
Let \( A \) be a \( 3 \times 3 \) matrix defined as:
\[ A = \begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & -1 \end{bmatrix} \]Find the eigenvalues of \( A^{13} \).
- GATE CS - 2025
- Programming in C
What is the time complexity of the following algorithm?
int func(int n) {
for (int i = 1; i < = n; i++) {
for (int j = 1; j < = n; j++) {
printf("Hello");
}
}
}- GATE CS - 2025
- Programming in C
Given an array \( A[n] \) such that:
\[ A[0] \to A[i] \text{ is in non-decreasing order}, \quad A[i+1] \to A[n] \text{ is in non-increasing order}. \]Find the time complexity to find \( A[i] \).
- GATE CS - 2025
- Logical and Analytical Reasoning Skills
Given the matrix \( A = \begin{bmatrix} 1 & 2 \\ 2 & -1 \end{bmatrix} \), find \( A^8 \).
- GATE CS - 2025
- Logical and Analytical Reasoning Skills