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
Zero has two representations in
The number of full and half-adders required to add -bit numbers is
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?
Consider the circuit shown below. In a certain steady state, the line is at . What are the possible values of and in this state?
The maximum gate delay for any output to appear in an array multiplier for multiplying two bit numbers is
Booth's coding in bits for the decimal number is:
Which of the following functions implements the Karnaugh map shown below?
Which of the following expressions is not equivalent to ?
Suppose the domain set of an attribute consists of signed four digit numbers. What is the percentage of reduction in storage space of this attribute if it is stored as an integer rather than in character form?
Which of the following operations is commutative but not associative?
The function represented by the Karnaugh map given below is
The octal representation of an integer is . If this were to be treated as an eight-bit integer in an based computer, its decimal equivalent is
The threshold level for logic 1 in the TTL family is
A multiplexer with a data select input is a
What happens when a bit-string is XORed with itself -times as shown:
Let Express as the minimal sum of products. Write only the answer. If the output line is stuck at , for how many input combinations will the value of be correct?
Consider a logic circuit shown in figure below. The functions (in canonical sum of products form in decimal notation) are : The function is
Given . The value of the radix is:
Let be a switching function. Which one of the following is valid?
An N-bit carry lookahead adder, where is a multiple of , employs ICs ( bit ALU) and ( bit carry lookahead generator). The minimum addition time using the best architecture for this adder is
