GATE CSE 2014 Set 1 | Number Systems Question 15 | Digital Logic

GATE CSE 2014 Set 1

Numerical

-0

The base (or radix) of the number system such that the following equation holds is __________
$${{312} \over {20}} = 13.1$$

Your input ____

GATE CSE 2013

MCQ (Single Correct Answer)

-0.3

The smallest integer that can be represented by an $$8$$-bit number in $$2's$$ complement form is

$$-256$$

$$-128$$

$$-127$$

$$0$$

GATE CSE 2010

MCQ (Single Correct Answer)

-0.3

$$P$$ is a $$16$$-bit signed integer. The $$2's$$ complement representtation of $$P$$ is $${\left( {F87B} \right)_{16}}$$ . The $$2's$$ complement representation of $$8{}^ * \,P$$ is

$${\left( {C3D8} \right)_{16}}$$

$${\left( {187B} \right)_{16}}$$

$${\left( {F878} \right)_{16}}$$

$${\left( {987B} \right)_{16}}$$

GATE CSE 2009

MCQ (Single Correct Answer)

-0.3

$${\left( {1217} \right)_8}$$ is equivalent to

$${\left( {1217} \right)_16}$$

$${\left( {028F} \right)_{16}}$$

$${\left( {2297} \right)_{10}}$$

$${\left( {0B17} \right)_{16}}$$

PREVIOUS NEXT

GATE CSE Subjects

Discrete Mathematics

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

Programming Languages

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

Theory of Computation

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

Operating Systems

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

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Computer Organization

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

Database Management System

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

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

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

Algorithms

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

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Numerical Ability Verbal Ability