In the case of a 4-bit ripple counter, if the time period of the waveform at the last flip-flop is 64 microseconds, what is the input frequency?
Show Hint
- 250 KHz
- 125 KHz
- 500 KHz
- 2 KHz
The Correct Option is A
Solution and Explanation
In a ripple counter, the output of each flip-flop is connected to the clock input of the next flip-flop. A 4-bit ripple counter will have 4 flip-flops, and each flip-flop toggles its state at half the frequency of the previous one.
Step 2: Relationship between the input and output frequency.
If the time period of the waveform at the last flip-flop is 64 microseconds, it means the frequency of the last flip-flop is: \[ f_{last} = \frac{1}{64 \, \mu\text{s}} = \frac{1}{64 \times 10^{-6}} = 15.625 \, \text{kHz} \]
Since each flip-flop divides the frequency by 2, the input frequency is: \[ f_{input} = 15.625 \, \text{kHz} \times 2^4 = 15.625 \, \text{kHz} \times 16 = 250 \, \text{kHz} \]
Thus, the correct answer is \( 250 \, \text{KHz} \).
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
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.
- GATE CS - 2025
- Programming and Data Structures
- Programming in C
Questions Asked in GATE CS exam
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.Which of the following is the greatest? \[ 0.6, \ 0.666, \ \frac{5}{6}, \ \frac{2}{3} \]
- Given the sequence: \( 5, 6, 15, \_, 89, 170, 291 \), find the missing number.
- GATE CS - 2025
- Logical and Analytical Reasoning Skills
- In a binary search tree with the following elements: \( 10, -4, 15, 13, 20, 5, 16, 19 \), the number of edges from node 19 to the root is?
Consider the following C code:
int main() { sum = 0; for (n = 1; n < 3; n++) { n++; sum += g(f(n)); } printf("%d", sum); } int g(n) { return 10 + n; } int f(n) { return g(2 * n); }What is the output?