GATE CSE 2002 | IO Interface Question 12 | Computer Organization

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

In serial data transmission, every byte of data is padded with a $$‘0’$$ in the beginning and one or two $$‘1’s$$ at the end of byte because

Receiver is to be synchronized for byte reception

Receiver recovers lost $$‘0’s$$ and $$‘1’s$$ from these padded bits

Padded bits are useful in purity computation

None of the above

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

A processor needs software interrupt to

Test the interrupt system of the processor

Implement co-routines

Obtain system services which need execution of privileged instructions

Return from subroutine

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

Which of the following device should get higher priority on assigning interrupts?

Hard disk

Printer

Keyboard

Floppy disk

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

Which of the following is true?

Unless enabled, a $$CPU$$ will not be able to process interrupts.

Loop instructions cannot be interrupted till they complete.

A processor checks for interrupts before executing a new instruction.

Only level triggered interrupts are possible on microprocessors.

PREVIOUS NEXT

GATE CSE Subjects

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

Algorithms

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

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

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

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

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

Computer Organization

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