GATE (Graduate Aptitude Test in Engineering) Electronics: Questions 61 - 66 of 1076

Access detailed explanations (illustrated with images and videos) to 1076 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 450.00 -OR-

How to register? Already Subscribed?

Question 61

Logic Gates and Their Static CMOS Implementation

Appeared in Year: 2003

Question

MCQ▾

The circuit shown in figure converts

Choices

Choice (4)Response

a.

Gray to Binary code

b.

Binary to excess - 3 code

c.

BCD to binary code

d.

Excess -3 to gray code

Question 62

Appeared in Year: 2005

Question

MCQ▾

The Boolean function implemented in the figure using two input multiplexes is,

Choices

Choice (4)Response

a.

b.

c.

d.

Question 63

Boolean Algebra, Minimization of Functions

Appeared in Year: 2007

Question

MCQ▾

The Boolean function Y = AB + CD is to be realized using only 2 - input NAND gates. The minimum number of gates required is

Choices

Choice (4)Response

a.

2

b.

5

c.

3

d.

4

Question 64

Sample and Hold Circuits, ADCs and DACs

Appeared in Year: 2003

Question

MCQ▾

The minimum number of comparators required to build an 8-bits flash ADC is,

Choices

Choice (4)Response

a.

8

b.

255

c.

256

d.

63

Question 65

Shift-Registers and Finite State Machines

Appeared in Year: 2004

Question

MCQ▾

The minimum number of 2- to -1 multiplexers required to realize a 4- to -1 multiplexers is

Choices

Choice (4)Response

a.

1

b.

4

c.

2

d.

3

Question 66

Appeared in Year: 2005

Question

MCQ▾

Consider an 8085 microprocessor system. The following program starts at location 0100H.

1. `LXI SP, OOFF`
2. `LXI H, 0701`
3. `MVI A, 20H`
4. `SUB M`

The content of accumulator when the program counter reaches 0109 H is,

Choices

Choice (4)Response

a.

20 H

b.

FF H

c.

02 H

d.

00 H

Developed by: