CuriousTab
Search
CuriousTab
Home
Aptitude
Computer
C Programming
C# Programming
C++ Programming
Database
Java Programming
Networking
Engineering
Biochemical Engineering
Biochemistry
Biotechnology
Chemical Engineering
Civil Engineering
Computer Science
Digital Electronics
Electrical Engineering
Electronics
Electronics and Communication Engineering
Mechanical Engineering
Microbiology
Technical Drawing
GK
Current Affairs
General Knowledge
Reasoning
Data Interpretation
Logical Reasoning
Non Verbal Reasoning
Verbal Ability
Verbal Reasoning
Exams
AIEEE
Bank Exams
CAT
GATE
IIT JEE
TOEFL
Jobs
Analyst
Bank PO
Database Administrator
IT Trainer
Network Engineer
Project Manager
Software Architect
Discussion
Home
‣
Digital Electronics
‣
Digital Arithmetic Operations and Circuits
Comments
Question
The carry propagation delay in full-adder circuits:
Options
A. is normally not a consideration because the delays are usually in the nanosecond range.
B. decreases in a direct ratio to the total number of FA stages.
C. is cumulative for each stage and limits the speed at which arithmetic operations are performed.
D. increases in a direct ratio to the total number of FA stages but is not a factor in limiting the speed of arithmetic operations.
Correct Answer
is cumulative for each stage and limits the speed at which arithmetic operations are performed.
Digital Arithmetic Operations and Circuits problems
Search Results
1. Find the 2's complement of ?110110
2
.
Options
A. 110100
2
B. 101010
2
C. 001001
2
D. 001010
2
Show Answer
Scratch Pad
Discuss
Correct Answer: 001010
2
2. The 2's-complement system is to be used to add the signed binary numbers 11110010 and 11110011. Determine, in decimal, the sign and value of each number and their sum.
Options
A. ?113 and ?114, ?227
B. ?14 and ?13, ?27
C. ?11 and ?16, ?27
D. ?27 and ?13, ?40
Show Answer
Scratch Pad
Discuss
Correct Answer: ?14 and ?13, ?27
3. Subtract the following binary numbers.
0101 1000
1010 0011
1101 1110
?0010 0011
?0011 1000
?0101 0111
Options
A. 0011 0100 0110 1010 1000 0110
B. 0011 0101 0110 1011 1000 0111
C. 0011 0101 0110 1010 1000 0111
D. 0011 0101 0110 1010 1000 0110
Show Answer
Scratch Pad
Discuss
Correct Answer: 0011 0101 0110 1011 1000 0111
4. Convert each of the following signed binary numbers (two's-complement) to a signed decimal number.
00000101 11111100 11111000
Options
A. ?5 +4 +8
B. +5 ?4 ?8
C. ?5 +252 +248
D. +5 ?252 ?248
Show Answer
Scratch Pad
Discuss
Correct Answer: +5 ?4 ?8
5. The truth table for a full adder is shown below. What are the values of
X
,
Y
, and
Z
?
Options
A.
X
= 0,
Y
= 1,
Z
= 1
B.
X
= 1,
Y
= 1,
Z
= 1
C.
X
= 1,
Y
= 0,
Z
= 1
D.
X
= 0,
Y
= 0,
Z
= 1
Show Answer
Scratch Pad
Discuss
Correct Answer:
X
= 1,
Y
= 1,
Z
= 1
6. Why is a fast-look-ahead carry circuit used in the 7483 4-bit full-adder?
Options
A. to decrease the cost
B. to make it smaller
C. to slow down the circuit
D. to speed up the circuit
Show Answer
Scratch Pad
Discuss
Correct Answer: to speed up the circuit
7. Convert each of the signed decimal numbers to an 8-bit signed binary number (two's-complement).
+7 ?3 ?12
Options
A. 0000 0111 1111 1101 1111 0100
B. 1000 0111 0111 1101 0111 0100
C. 0000 0111 0000 0011 0000 1100
D. 0000 0111 1000 0011 1000 1100
Show Answer
Scratch Pad
Discuss
Correct Answer: 0000 0111 1111 1101 1111 0100
8. What are constants in VHDL code?
Options
A. Fixed numbers represented by a name
B. Fixed variables used in functions
C. Fixed number types
D. Constants do not exist in VHDL code.
Show Answer
Scratch Pad
Discuss
Correct Answer: Fixed numbers represented by a name
9. What distinguishes the look-ahead-carry adder?
Options
A. It is slower than the ripple-carry adder.
B. It is easier to implement logically than a full adder.
C. It is faster than a ripple-carry adder.
D. It requires advance knowledge of the final answer.
Show Answer
Scratch Pad
Discuss
Correct Answer: It is faster than a ripple-carry adder.
10. Which of the statements below best describes the given figure?
Options
A. Half-carry adder; Sum = 0, Carry = 1
B. Half-carry adder; Sum = 1, Carry = 0
C. Full-carry adder; Sum = 1, Carry = 0
D. Full-carry adder; Sum = 1, Carry = 1
Show Answer
Scratch Pad
Discuss
Correct Answer: Half-carry adder; Sum = 0, Carry = 1
Comments
There are no comments.
Enter a new Comment
Save
More in Digital Electronics:
Boolean Algebra and Logic Simplification
Code Converters and Multiplexers
Combinational Logic Analysis
Combinational Logic Circuits
Computers
Counters
Describing Logic Circuits
Digital Arithmetic Operations and Circuits
Digital Concepts
Digital Design
Digital Signal Processing
Digital System Projects Using HDL
Ex-OR and Ex-NOR Gates
Flip-Flops
Integrated-Circuit Logic Families
Integrated Circuit Technologies
Interfacing to the Analog World
Logic Families and Their Characteristics
Logic Gates
Memory and Storage
Microprocessor Fundamentals
MSI Logic Circuits
Multivibrators and 555 Timer
Number Systems and Codes
Programmable Logic Device
Shift Registers
Signals and Switches
The 8051 Microcontroller