GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 916 - 919 of 2080

Access detailed explanations (illustrated with images and videos) to 2080 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 550.00 -OR-

How to register? Already Subscribed?

Question 916

Appeared in Year: 2017 (UGC-NET)

Question

MCQ▾

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 917

Question

MCQ▾

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 918

Appeared in Year: 2014 (UGC-NET)

Question

MCQ▾

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

Choices

Choice (4)Response

a.

b.

)

c.

d.

Question 919

Appeared in Year: 2014 (UGC-NET)

Question

MCQ▾

What does the following expression means?

(December Paper II)

Choices

Choice (4)Response

a.

A function return array of N pointers to functions returning pointers to characters

b.

A pointer to a function returning array of n pointers to function returning character pointers.

c.

An array of n pointers to function returning pointers to functions returning pointers to characters.

d.

An array of n pointers to function returning pointers to characters

Developed by: