Computer Sciences > Gate 2015 Set-3 > English Grammer

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

If ROAD is written as URDG, then SWAN should be written as

A

VXDQ

B

VZDQ

C

VZDP

D

UXDQ

Check Answer

Explanation

Correct : English Grammar

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science