1 votes 1 votes Two alternative package $A$ and $B$ are available for processing a database having $10^{k}$ records. Package $A$ requires $0.0001 n^{2}$ time units and package $B$ requires $10n\log _{10}n$ time units to process $n$ records. What is the smallest value of $k$ for which package $B$ will be preferred over $A$? $12$ $10$ $6$ $5$ Algorithms nielit2016mar-scientistc algorithms asymptotic-notation + – admin asked Apr 2, 2020 • recategorized Oct 28, 2020 by Krithiga2101 admin 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes This can be solved using substitution. Substituting the value of 6 in k we get that A takes more time (10^8) than B (6 * 10^7). making B more preferable than A. nostradamus answered Aug 11, 2021 nostradamus comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes I think answer should be D s_dr_13 answered Mar 28, 2022 s_dr_13 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes https://gateoverflow.in/2185/Gate-cse-2010-question-12 //asked in gate 2010. Rusty_01 answered Apr 8, 2022 Rusty_01 comment Share Follow See all 0 reply Please log in or register to add a comment.