NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 906 - 909 of 2012

Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 906

» Computer Structure and Organisation » Interfacing Peripheral Devices, Interrupts

Edit

Appeared in Year: 2017

Match List-Ⅰ List-Ⅱ▾

Question

Match the following w. r. t. Input/output management: (January paper II)

List-Ⅰ (Column I) List-Ⅱ (Column II)

(A)

Device driver

(i)

Processing of I/O request

(B)

Interrupt handler

(ii)

I/O scheduling

(C)

Kernel I/O subsystem

(iii)

Extracts information from the controller register and store it in data buffer

(D)

Device controller

(iv)

Performs data transfer

Choices

Choice (4) Response
  • (A)
  • (B)
  • (C)
  • (D)

a.

  • (i)
  • (iv)
  • (ii)
  • (iii)

b.

  • (iv)
  • (iii)
  • (ii)
  • (i)

c.

  • (iii)
  • (i)
  • (ii)
  • (iv)

d.

  • (i)
  • (iii)
  • (ii)
  • (iv)

Question number: 907

» Software Engineering » Software Design » Detailed Design

Edit

Appeared in Year: 2014

MCQ▾

Question

Which one of the following is not a key process area in CMM level ? (June paper III)

Choices

Choice (4) Response

a.

Technology change management

b.

Process change management

c.

Defect prevention

d.

Software product engineering

Question number: 908

» Computer Arithmetic » Logic Families » TTL, ECL and C-MOS Gates

Edit

Appeared in Year: 2014

MCQ▾

Question

How many different truth tables of the compound propositions are there that involve the propositions p & q? (June paper II)

Choices

Choice (4) Response

a.

4

b.

16

c.

8

d.

2

Question number: 909

» Theory of Computation » Formal Language » Properties

Edit

Appeared in Year: 2017

True-False▾

Statements

  1. A class of languages that is closed under union and complementation has to be closed under intersection. (January Paper III)

  2. A class of languages that is closed under union and intersection has to be closed under complementation.

Choices

Choice (4) Response

a.

None of the statements is correct.

b.

Only statement Ⅰ is true.

c.

Only statement Ⅱ is true.

d.

All the statements are correct.

Developed by: