NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 891 - 895 of 2104

Access detailed explanations (illustrated with images and videos) to 2104 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: 891

» Operating Systems with Unix » Basic Concepts » Interrupts,System Calls,Instructions

Edit

Appeared in Year: 2014

Match List-Ⅰ List-Ⅱ▾

Question

Match the following: (June paper II)

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

(A)

Multilevel feedback queue

(i)

Criteria to move process between queues

(B)

Round robin scheduling

(ii)

Batch processing

(C)

FCFS

(iii)

Exponential smoothening

(D)

Shortest process next

(iv)

Time-slicing

Choices

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

a.

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

b.

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

c.

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

d.

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

Question number: 892

» Networks, Virtualization, & Cloud Computing » Network Fundamentals » Local Area Networks (LAN)

Edit

Appeared in Year: 2017

MCQ▾

Question

The number of bits used for addressing in Gigabit Ethernet is ________. (November Paper II)

Choices

Choice (4)Response

a.

128 bits

b.

48 bits

c.

64 bits

d.

32 bits

Question number: 893

» Discrete Mathematics » Prepositional Logic

Edit

Appeared in Year: 2017

MCQ▾

Question

The first order logic (FOL) statement is equivalent to which of the following? (January Paper III)

Choices

Choice (4)Response

a.

b.

c.

d.

Question number: 894

» Analysis and Design of Algorithms » Introduction, Types, & Design of Algorithms

Edit

Appeared in Year: 2017

MCQ▾

Question

Dijkstra’s algorithm is based on (January Paper III)

Choices

Choice (4)Response

a.

Divide and conquer paradigm

b.

Dynamic programming

c.

Backtracking paradigm

d.

Greedy Approach

Question number: 895

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2016

MCQ▾

Question

The following numbers are inserted into an empty binary search tree in the given order:

What is the height of the binary search tree? (November Paper II)

Choices

Choice (4)Response

a.

5

b.

3

c.

4

d.

6

Developed by: