GATE 2010 CS/IT ALGORITHMS|TIME COMPLEXITY|Two alternative packages A and Bfor processing a database

GATE | GATE CS 2010 Two alternative packages A and B are available for processing a database having 10k records.Package A requires 0.0001n2 time units and package B requires 10nlog10n time units to process n records. What is the smallest value of k for which package B will be preferred over A? (A) 12 (B) 10 (C) 6 (D) 5 GATE 2010 ALGORITHMS TIME AND SPACE COMPLEXITY DOUBLE HASHING QUADRATIC PROBING linked list for gate PYQ LINEAR PROBING COLLISION HASHING net B.tech university placement preparation doubly linked list