GATE CSE 1999 | Computer Arithmetic Question 13 | Computer Organization

GATE CSE 1999

MCQ (Single Correct Answer)

-0.6

The number of full and half-adders required to add 16-bit numbers is:

8 half-adders, 8 full-adders

1 half-adder, 15 full-adders

16 half-adders, 0 full-adders

4 half-adders, 12 full-adders

GATE CSE 1999

MCQ (Single Correct Answer)

-0.6

Booth’s coding in $$8$$ bits for the decimal number –$$57$$ is:

$$0\, - \,1\,0\,0\, + \,1\,0\,0\,0$$

$$0\, - \,1\,0\,0\, + \,1\,0\,0\, - \,1$$

$$0\, - \,1\, + \,1\,0\,0\, - \,1\,0\, + \,1$$

$$0\,0\, - \,1\,0\, + \,1\,0\,0\, - \,1$$

GATE CSE 1996

MCQ (Single Correct Answer)

-0.6

Consider the following floating point number representation GATE CSE 1996 Computer Organization - Computer Arithmetic Question 12 English

The exponent is in $$2’s$$ complement representation and mantissa is in the sign magnitude representation. The range of the magnitude of the normalized mantissa in this representation is

$$0$$ to $$1$$

$$0.5$$ to $$1$$

$${2^{ - 23}}$$ to $$0.5$$

$$0.5$$ to $$\left( {1 - {2^{ - 23}}} \right)$$

GATE CSE Subjects

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Verbal Ability Numerical Ability

Discrete Mathematics

Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Computer Organization

Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory