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

» Image Processing » Image Registration

Edit

Appeared in Year: 2012

MCQ▾

Question

You are given four images represented as

The value of entropy is maximum for image (December Paper III)

Choices

Choice (4)Response

a.

b.

c.

d.

Question number: 513

» Linear Programming Problem » LPP Standard Form, LPP in Canonical Form

Edit

Appeared in Year: 2012

MCQ▾

Question

In a Linear Programming Problem, suppose there are 3 basic variables and 2 non-basic variables, then the possible number of basic solutions are (December Paper III)

Choices

Choice (4)Response

a.

6

b.

8

c.

10

d.

12

Question number: 514

» Data and File Structures » Trees & Graphs

Edit

Appeared in Year: 2012

MCQ▾

Question

58 lamps are to be connected to a single electric outlet by using an extension board each of which has four outlets. The number of extension boards needed to connect all the light is (December Paper III)

Choices

Choice (4)Response

a.

29

b.

19

c.

20

d.

28

Question number: 515

» Programming in C and C Plus Plus » O-O Programming Concepts » Inheritance, Polymorphism, Abstraction, Encapsulation and Overloading

Edit

Appeared in Year: 2012

MCQ▾

Question

When a programming Language has the capacity to produce new datatype, it is called as, (December Paper III)

Choices

Choice (4)Response

a.

Extensible Language

b.

Abstraction Language

c.

Overloaded Language

d.

Encapsulated Language

Question number: 516

» Neural Networks and AI » Application

Edit

Appeared in Year: 2012

Match List-Ⅰ List-Ⅱ▾

Question

Match the following: (December Paper III)

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

(A)

Inductive learning

(i)

Manual labels of inputs are used.

(B)

Unsupervised learning

(ii)

Manual labels of inputs are not used.

(C)

Supervised learning

(iii)

The decision system receives rewards for its action at the end of a sequence of steps

(D)

Re- inforcement learning

(iv)

System learns by example

Choices

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

a.

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

b.

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

c.

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

d.

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

Developed by: