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

» Neural Networks and AI » Application

Edit

Appeared in Year: 2013

MCQ▾

Question

In alpha-beta pruning, ________ is used to cut off the search at minimizing level only and ________ is used to cut off the search at maximizing level only. (December paper III)

Choices

Choice (4)Response

a.

alpha, beta

b.

beta, alpha

c.

alpha, alpha

d.

beta, beta

Question number: 856

» Computer Arithmetic » Logic Families » Flip-Flops-Types, Race Condition and Comparison

Edit

Appeared in Year: 2013

MCQ▾

Question

What will be the output of the following logic diagram?

The logic diagram

The Logic Diagram

(December paper III)

Choices

Choice (4)Response

a.

b.

c.

d.

Question number: 857

» Software Engineering » Coding and Testing » Types of Testing

Edit

Appeared in Year: 2013

MCQ▾

Question

One weakness of boundary value analysis and equivalence partitioning is (December paper III)

Choices

Choice (4)Response

a.

they are not effective.

b.

they do not explore combinations of input circumstances.

c.

they explore combinations of input circumstances.

d.

None of the above

Question number: 858

» Operating Systems with Unix » Memory Management » Virtual Memory

Edit

Appeared in Year: 2013

MCQ▾

Question

Translation Look-aside Buffer (TLB) is (December paper III)

Choices

Choice (4)Response

a.

a cache-memory in which item to be searched is compared with all the keys simultaneously.

b.

a cache-memory in which item to be searched is compared one-by-one with the keys.

c.

an associative memory in which item to be searched is compared with all the keys simultaneously.

d.

an associative memory in which item to be searched is compared one-by-one with the keys.

Developed by: