In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
Let f(n) = n2 log n and g(n) = n(log n)10 be two positive functions of n. Which of the following statements is correct?
The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit number is
The concatenation of two lists is to be performed on 0(1) time. Which of the following implementations of a list should be used?
GATE CSE Subjects
Theory of Computation
Database Management System