1
GATE CSE 2025 Set 1
Numerical
+2
-0

Consider the given sequential circuit designed using D-Flip-flops. The circuit is initialized with some value (initial state). The number of distinct states the circuit will go through before returning back to the initial state is _________ . (Answer in integer)

GATE CSE 2025 Set 1 Digital Logic - Sequential Circuits Question 2 English

Your input ____
2
GATE CSE 2025 Set 1
MCQ (Single Correct Answer)
+1
-0.33

$g(.)$ is a function from A to B, $f(.)$ is a function from B to C, and their composition defined as $f(g(.))$ is a mapping from A to C.

If $f(.)$ and $f(g(.))$ are onto (surjective) functions, which ONE of the following is TRUE about the function $g(.)$ ?

A
$g(.)$ must be an onto (surjective) function.
B
$g(.)$ must be a one-to-one (injective) function.
C
$g(.)$ must be a bijective function, that is, both one-to-one and onto.
D
$g(.)$ is not required to be a one-to-one or onto function.
3
GATE CSE 2025 Set 1
MCQ (More than One Correct Answer)
+1
-0

Consider the given system of linear equations for variables $x$ and $y$, where $k$ is a realvalued constant. Which of the following option(s) is/are CORRECT?

$$\begin{aligned} & x+k y=1 \\ & k x+y=-1 \end{aligned}$$

A
There is exactly one value of $k$ for which the above system of equations has no solution.
B
There exist an infinite number of values of $k$ for which the system of equations has no solution.
C
There exists exactly one value of $k$ for which the system of equations has exactly one solution.
D
There exists exactly one value of $k$ for which the system of equations has an infinite number of solutions.
4
GATE CSE 2025 Set 1
Numerical
+1
-0

Let $S$ be the set of all ternary strings defined over the alphabet $\{a, b, c\}$. Consider all strings in $S$ that contain at least one occurrence of two consecutive symbols, that is, "aa", "bb" or "cc". The number of such strings of length 5 that are possible is __________ (Answer in integer)

Your input ____
EXAM MAP