Electrical Engineering > GATE 2015 SET-1 > Verbal Ability

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Didn't you buy ________ when you went shopping?

A

any paper

B

much paper

C

no paper

D

a few paper

Check Answer

Explanation

Correct : a

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