NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 636 - 638 of 2013

Access detailed explanations (illustrated with images and videos) to 2013 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Unlimited Access for Unlimited Time! View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 636

» Networks, Virtualization, & Cloud Computing » Routing » Routing Algorithms

Edit

Appeared in Year: 2013

MCQ▾

Question

The count-to-infinity problem is associated with (September Paper II)

Choices

Choice (4)Response

a.

Flooding algorithm

b.

Hierarchical routing algorithm

c.

Distance vector routing algorithm

d.

Link state routing algorithm

Question number: 637

» Windows Programming » Windows Environment

Edit

Appeared in Year: 2013

Match List-Ⅰ List-Ⅱ▾

Question

Match the following for windows operating system: (September Paper-III)

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

(A)

Win32 sub-system

(i)

Export a virtual memory interface, support for symmetric multiprocessing, administration, details of mapping memory, configuring I/O buses, setting up DMA.

(B)

Kernel

(ii)

Starting all process, emulation of different operating systems, security functions, transform character based applications to graphical representation

(C)

Executive

(iii)

Thread scheduling, interrupt and exception handling recovery after power failure.

(D)

Hardware abstraction layer

(iv)

Object manager, virtual memory manager, process manager, plug-and-play and power manager.

Choices

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

a.

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

b.

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

c.

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

d.

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

Question number: 638

» Operating Systems with Unix » Multiprogramming, Multiprocessing, and Multitasking

Edit

Appeared in Year: 2013

Match List-Ⅰ List-Ⅱ▾

Question

Match the following: (September Paper II)

List-Ⅰ (Process State Transition)List-Ⅱ (Reason for Transition)

(A)

Blocked Ready

(i)

Request made by the process is satisfied or an event for which it was waiting occurs.

(B)

Running Blocked

(ii)

Process wishes to wait for some action by another process.

(C)

Running Ready

(iii)

The process is dispatched.

(D)

Ready Running

(iv)

The process is preempted.

Choices

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

a.

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

b.

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

c.

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

d.

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

Developed by: