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

» Programming » Prolog and C Plus Plus and C and Java

Edit

Appeared in Year: 2013

Match List-Ⅰ List-Ⅱ▾

Question

Match the following control strategies of prolog: (December paper III)

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

(A)

Forward movement

(i)

Variable can be done with a constant, another variable or a function.

(B)

Unification

(ii)

The entire conjunctive goal is executed.

(C)

Shallow back-tracking

(iii)

Previous sub goal to find alternative solutions.

(D)

Deep back-tracking

(iv)

Choose sub goal with possible unifier.

Choices

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

a.

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

b.

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

c.

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

d.

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

Question number: 818

» Software Engineering » Software Design » Object Oriented Design

Edit

Appeared in Year: 2013

Match List-Ⅰ List-Ⅱ▾

Question

Match the following style rules for reusability (December paper III)

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

(A)

Keep methods coherent

(i)

Maintain parallel structure when possible

(B)

Keep methods

(ii)

Performs a single function or a group of closely related functions.

(C)

Keep methods small

(iii)

Write a method to get the last element of a list

(D)

Provide uniform coverage

(iv)

Breaking a method into smaller parts

Choices

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

a.

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

b.

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

c.

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

d.

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

Developed by: