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

» Computer Arithmetic » Predicate Logic

Edit
MCQ▾

Question

Consider the following left associative operators in decreasing order of precedence:

– Subtraction (highest precedence)

* Multiplication

$ Exponentiation (lowest precedence)

What is the result of the following expression?

Choices

Choice (4) Response

a.

1372

b.

512

c.

64

d.

Question number: 865

» Analysis and Design of Algorithms » Analysis of Algorithms

Edit

Appeared in Year: 2017

MCQ▾

Question

Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take ________ time in the worst case. (January Paper III)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 866

» Computer Graphics » 2D Geometry

Edit

Appeared in Year: 2014

MCQ▾

Question

Consider a window bounded by the lines: .

The line segment joining and , if clipped against this window will connect the points (June paper III)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 867

» Relational Database Design and SQL » Concurrency and Recovery in Centralised and Distributed Database Systems

Edit
MCQ▾

Question

In the Optimistic Methods of Concurrency Control, a transaction goes through which of the following phases?

Choices

Choice (4) Response

a.

Read

b.

Write

c.

Certification

d.

All a. , b. and c. are correct

Question number: 868

» Discrete Mathematics » Prepositional Logic

Edit

Appeared in Year: 2014

MCQ▾

Question

Equivalent logical expression for the Well Formed Formula (WFF), is (December Paper III)

Choices

Choice (4) Response

a.

b.

)

c.

d.

Developed by: