COMPREHENSIVE TEST- DIGITAL & MICROCONTROLLER

COMPREHENSIVE TEST- DIGITAL & MICROCONTROLLER

University

63 Qs

quiz-placeholder

Similar activities

EDUC 105_ Quiz _ Finals

EDUC 105_ Quiz _ Finals

University

60 Qs

Curriculum and Assessment definition

Curriculum and Assessment definition

University

62 Qs

Instructional Pedagogy

Instructional Pedagogy

9th Grade - University

68 Qs

E157 (PRELIM) THERMODYNAMICS

E157 (PRELIM) THERMODYNAMICS

University

60 Qs

Modules 4-7

Modules 4-7

University

67 Qs

ECAD LAB

ECAD LAB

University

64 Qs

Prof Ed 5

Prof Ed 5

University

60 Qs

EDU 6653 Flashcards Study Guide

EDU 6653 Flashcards Study Guide

University

59 Qs

COMPREHENSIVE TEST- DIGITAL & MICROCONTROLLER

COMPREHENSIVE TEST- DIGITAL & MICROCONTROLLER

Assessment

Quiz

Education

University

Hard

Created by

Jessy John

Used 1+ times

FREE Resource

63 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

The logic family which consumes least power

ECL

TTL

MOS

CMOS

2.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Fastest saturated logic family
MOS
CMOS
ECL
TTL

3.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Logic Family which has highest fan out
CMOS
TTL
ECL
MOS

4.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

The output of clocked sequentail circuit is independent of the input. The circuit can be represented by
Both Mealy nor Moore Model
Mealy Model
Moore Model
Neither Mealy nor Moore Model

5.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

A sequential circuit with 10 states will have ________ number of Flip Flops
5
4
10
3

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Assume that a 4 bit ripple counter is holding the count 0100. What will be count after 29 pulses

0100

0110

0011

0001

7.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Maximum that can be obtained by ripple counter using five flip flops is
5
31
16
32

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?