• HOME
  • QUIZ
  • CONTACT US
EXAMIANS
  • COMPUTER
  • CURRENT AFFAIRS
  • ENGINEERING
    • Chemical Engineering
    • Civil Engineering
    • Computer Engineering
    • Electrical Engineering
    • Mechanical Engineering
  • ENGLISH GRAMMAR
  • GK
  • GUJARATI MCQ

Digital Electronics

Digital Electronics
In LSI, the number of gate circuits per chip is

 1000 to 10,000
 100 to 999
 < 10,000
 100 to 9,999

ANSWER DOWNLOAD EXAMIANS APP

Digital Electronics
When will be the output of an AND gate is LOW ?

 When all inputs are HIGH
 When any input is LOW
 When any input is HIGH
 When all input is LOW

ANSWER DOWNLOAD EXAMIANS APP

Digital Electronics
A NAND gate is called a universal logic element because

Many digital computers use NAND gates.
It is used by everybody
All the minization techniques are applicable for optimum NAND gate realization
Any logic function can be realized by NAND gates alone

ANSWER DOWNLOAD EXAMIANS APP

Digital Electronics
In the boolean algebra, a variable has ________ different state(s)/value(s).

 4
 3
 1
 2

ANSWER DOWNLOAD EXAMIANS APP

Digital Electronics
A computer has a word length of 8 bits (including sign). It is required to determine the range of integers that can be stored in the computer. If 1’s complement is used to represent the numbers, then the range will be

 -256 to 256
 -127 to 127
 -128 to 127
 -256 to 255

ANSWER DOWNLOAD EXAMIANS APP

Digital Electronics
Which one of the following is correct sequence of the numbers represented in the series(2)3, (10)4, (11)5, (14)6, (22)7,…………….

 2, 4, 6, 8, 10, …..
 2, 4, 6, 10, 16……..
 2, 4, 6, 10, 12, …
 2, 3, 4, 5, 6, ….

ANSWER DOWNLOAD EXAMIANS APP
MORE MCQ ON Digital Electronics

DOWNLOAD APP

  • APPLE
    from app store
  • ANDROID
    from play store

SEARCH

LOGIN HERE


  • GOOGLE

FIND US

  • 1.70K
    FOLLOW US
  • EXAMIANSSTUDY FOR YOUR DREAMS.
  • SUPPORT :SUPPORT EMAIL ACCOUNT : examians@yahoo.com

OTHER WEBSITES

  • GUJARATI MCQ
  • ACCOUNTIANS

QUICK LINKS

  • HOME
  • QUIZ
  • PRIVACY POLICY
  • DISCLAIMER
  • TERMS & CONDITIONS
  • CONTACT US
↑