Given the following cache parameters:
\[
\begin{array}{|c|c|}
\hline
\textbf{Tag} & 4 \, \text{bits} \\
\textbf{Index} & 12 \, \text{bits} \\
\textbf{Block Size} & 1 \, \text{byte} \\
\hline
\end{array}
\]
Find the size of the main memory and the size of the cache memory.
Given the following cache parameters:
\[ \begin{array}{|c|c|} \hline \textbf{Tag} & 4 \, \text{bits} \\ \textbf{Index} & 12 \, \text{bits} \\ \textbf{Block Size} & 1 \, \text{byte} \\ \hline \end{array} \]Find the size of the main memory and the size of the cache memory.
Show Hint
- 64 KB, 4 KB
- 128 KB, 8 KB
- 256 KB, 16 KB
- 512 KB, 32 KB
The Correct Option is A
Solution and Explanation
The cache size is given by the formula: \[ \text{Cache Size} = \text{Number of Sets} \times \text{Block Size} \] - The number of sets is \( 2^{\text{Index bits}} = 2^{12} = 4096 \).
- The block size is 1 byte.
Thus, the cache size is: \[ \text{Cache Size} = 4096 \times 1 = 4096 \, \text{bytes} = 4 \, \text{KB}. \]
Step 2: Calculate the size of the main memory.
The size of the main memory is calculated as: \[ \text{Main Memory Size} = 2^{\text{Tag bits} + \text{Index bits} + \text{Block size bits}} = 2^{4 + 12 + 0} = 2^{16} = 65536 \, \text{bytes} = 64 \, \text{KB}. \]
Thus, the main memory size is \( 64 \, \text{KB} \) and the cache memory size is \( 4 \, \text{KB} \).
Top Questions on Programming in C
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 and Data Structures
- 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 and Data Structures
- 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 and Data Structures
- Programming in C
Consider the following process information for Shortest Remaining Time First (SRTF) scheduling:
\[ \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time (AT)} & \textbf{Burst Time (BT)} \\ \hline P1 & 0 & 10 \\ P2 & 1 & 13 \\ P3 & 2 & 6 \\ P4 & 8 & 9 \\ \hline \end{array} \]Find the turnaround time for each process.
- GATE CS - 2025
- Programming and Data Structures
- Programming in C
Consider the following code:
main() { int x = 126, y = 105; { if (x > y) x = x - y; else y = y - x; } while (x != y) printf("%d", x); }- GATE CS - 2025
- Programming and Data Structures
- Programming in C
Questions Asked in GATE CS exam
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.
Which of the following is the greatest? \[ 0.6, \ 0.666, \ \frac{5}{6}, \ \frac{2}{3} \]
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?