NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 494 - 497 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: 494

» Discrete Mathematics » Predicate Logic-Fundamental Proof Procedure

Edit

Appeared in Year: 2012

MCQ▾

Question

Let be the statement and let there be two quantifications given as

(i)

(ii)

Where are real numbers. Then which one of the following is correct?

(December Paper III)

Choices

Choice (4) Response

a.

(i) is true and (ii) is true

b.

(i) is true and (ii) is false

c.

(i) is false and (ii) is true

d.

(i) is false and (ii) is false

Question number: 495

» Windows Programming » Windows Environment

Edit

Appeared in Year: 2012

MCQ▾

Question

Which of the following operating system is better for implementing client-server network? (December Paper III)

Choices

Choice (4) Response

a.

Windows 2000

b.

Windows 95

c.

Windows 98

d.

Question does not provide sufficient data or is vague

Question number: 496

» System Software and Compilers » Assembly Language Fundamentals

Edit

Appeared in Year: 2012

MCQ▾

Question

Given the following statements:

(i) Recursive enumerable sets are closed under complementation.

(ii) Recursive sets are closed under complementation.

Which is/are the correct statements? (December Paper III)

Choices

Choice (4) Response

a.

Only (i)

b.

Only (ii)

c.

(i) and (ii)

d.

Neither (i) nor (ii)

Question number: 497

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

Edit

Appeared in Year: 2012

Match List-Ⅰ List-Ⅱ▾

Question

The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity? (n and m are no. of nodes and edges respectively) (December Paper III)

List-Ⅰ (Graph Algorithms) List-Ⅱ (Complexities)

(A)

Bellman Ford algorithm

(i)

(B)

Floyd Warshall algorithm

(ii)

(C)

Topological sorting

(iii)

O (mn)

(D)

Kruskals algorithm

(iv)

Choices

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

a.

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

b.

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

c.

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

d.

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

Developed by: