Preparing for Excellence...
Master your MCA entrance preparation with over 17 years of solved PYQs from NIMCET, CUET PG, and top universities. Get detailed step-by-step solutions and expert insights—all 100% free.
Don't just practice questions—simulate the real exam. Browse our interactive Full Year-wise Question Papers to build your speed and accuracy.
Browse Full Papers →Jump directly into topic-wise PYQs with exam details — marks, time, and negative marking.
The number of possible Boolean function that can be defined for n Boolean variables over n- valued Boolean algebra is _______.
The function represented by the k-map given below is
|
k-map |
||||
|
C/AB |
00 |
01 |
11 |
10 |
|
0 |
0 |
1 |
1 |
1 |
|
1 |
0 |
0 |
1 |
0 |
Consider the following statements.
(A). Combinational logic circuits do not have memory, while sequential logic circuits have memory elements,
(B). Sequential logic circuits depend only on the current inputs, while combinational logic circuits depend on both current and past inputs.
(C). Flip-flops and latches are examples of combinational logic circuit.
(D). Multiplexer is an example of combinational logic circuit.
Choose the correct statement/statements from the options given below:
Minimum number of 2:1 Multiplexers required to design a 16:1 Multiplexer is?
Yes. We continuously update question tags and solutions to reflect the latest pattern and syllabus.
All listed questions include detailed step-by-step solutions, and many also include short video explanations.
Use the filters for exam and subject, and the search box for topics, keywords, or formula names.
No, Mathem Solvex Offers you everything for free, you do not need to pay anything for question bank You will get NIMCET and CUET PYQ and all the information for free.