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

» Management Information Systems » State Space Representation of Problems, a, a*, AO*

Edit

Appeared in Year: 2012

MCQ▾

Question

algorithm is guaranteed to find an optimal solution if (December Paper III)

Choices

Choice (4) Response

a.

h’ is always 0.

b.

g is always 1.

c.

h’ never overestimates h.

d.

h’ never underestimates h.

Question number: 521

» Computer Graphics » Animation

Edit

Appeared in Year: 2012

MCQ▾

Question

The Mandelbrot set used for the construction of beautiful images is based on the following transformation: (December Paper III)

Choices

Choice (4) Response

a.

are complex numbers.

b.

x is real & z is complex.

c.

x is complex & z is real.

d.

None of the above

Question number: 522

» Discrete Mathematics » Permutation and Combination

Edit

Appeared in Year: 2012

MCQ▾

Question

How many solution do the following equations have:

Where (December Paper III)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 523

» Relational Database Design and SQL » Fundamentals of Database » Keys

Edit

Appeared in Year: 2012

MCQ▾

Question

Which level of Abstraction describes how data are stored in the data base? (December Paper III)

Choices

Choice (4) Response

a.

Physical level

b.

View level

c.

Abstraction level

d.

Logical level

Question number: 524

» Programming in C and C Plus Plus » C Plus Plus Programming » Constructors and Destructors

Edit

Appeared in Year: 2012

MCQ▾

Question

Functions defined with class name are called as (December Paper III)

Choices

Choice (4) Response

a.

Static function

b.

Constructor

c.

Friend function

d.

Inline function

Question number: 525

» Encoding Decoding Error Correction Detection » Variable Length Codes » Prefix Codes, Huffmann Codes, Lempel-Ziev Codes

Edit

Appeared in Year: 2012

MCQ▾

Question

An example of a dictionary-based coding technique is (December Paper III)

Choices

Choice (4) Response

a.

Run-length coding

b.

Huffman coding

c.

Predictive coding

d.

LZW coding

Developed by: