GATE CS Digital Logic questions
Practise Digital Logic questions for GATE CS. Explore official PYQs and original subject-wise quizzes, check answers and view available solutions. Free, no sign-in.
Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.
20 on this page
The amount of ROM needed to implement a multiplier is
The decimal value in IEEE single precision floating point representation has
The truth table represents the Boolean function
Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration. If all the flip-flops were reset to at power on, what is the total number of distinct outputs (states) represented by generated by the counter?
Consider the following circuit involving three D-type flip-flops used in a certain type of counter configuration. If at some instance prior to the occurrence of the clock edge, and have a value , and respectively, what shall be the value of after the clock edge?
The minimum number of flip-flops needed to design a mod-258 counter is
The simplified SOP (Sum of Product) from the Boolean expression is
In the sequential circuit shown below, if the initial value of the output is . What are the next four values of ?
What is the boolean expression for the output of the combinational logic circuit of NOR gates given below?
The Boolean expression of the output of the multiplexer shown below is
is a -bit signed integer. The 's complement representation of is . The 's complement representation of is
The main memory unit with a capacity of is built using DRAM chips. Each DRAM chip has rows of cells with cells in each row. The time taken for a single refresh operation is . The time required to perform one refresh operation on all the cells …
The minterm expansion of is
Given the following state table of an FSM with two states and ,one input and one output. …
How many RAM chips are needed to provide a memory capacity of bytes?
What is the minimum number of gates required to implement the Boolean function if we have to use only gates?
is equivalent to
If are Boolean variables, then simplifies to
Given , and in canonical sum of products form (in decimal) for the circuit then is
Let denote number system radix. The only value(s) of that satisfy the equation is/are
