Suppose each set is represented as a linked list with elements in arbitrary…

GATE · 2004 · CS

Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be the slowest?

A.
union only
B.
intersection, membership
C.
membership, cardinality
D.
union, intersection

Attempted by 547 students.

Show answer

Correct answer: D

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2