• 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
The field, which is never present in an assembly language statement, is

 Operand
 Opcode
 Comment
 Continue

ANSWER DOWNLOAD EXAMIANS APP

Digital Electronics
Truth table is used to express

 Boolean matrix
 Boolean expression
 Boolean map
 Boolean addition

ANSWER DOWNLOAD EXAMIANS APP

Digital Electronics
In signed magnitude representation, the binary equivalent of 22.5625 is (the bit before comma represents the sign)

 1,10101.1001
 0,10110.1011
 0,10110.1001
 1,10110.1001

ANSWER DOWNLOAD EXAMIANS APP

Digital Electronics
A new Binary Coded Pantry (BCP) number system is proposed in which every digit of a base-5 number is represented by its corresponding 3-bit binary code. For example, the base-5 number 24 will be represented by its BCP code 010100. In this numbering system,the BCP code 100010011001 corresponds to the following number in base-5 system

 423
 1324
 2201
 4231

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 2’s complement is used to represent the numbers, then the range will be

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

ANSWER DOWNLOAD EXAMIANS APP

Digital Electronics
The 1’s complement of 11010111 is

 10101000
 11101000
 10101000
 00101000

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
↑