Register

GO Classes DPP | Algorithm |UGC NET

• edited by
336 views
2 2 votes

If algorithm $A$ and another algorithm $B$ take $\log _2(n)$ and $\sqrt{ } n$ microseconds, respectively, to solve a problem, then the largest size $n$ of a problem these algorithms can solve is, respectively. in one second are __________ and ________.

  1. $2^{10^6}$ and $10^6$
  2. $2^{10^6}$ and $10^{12}$
  3. $2^{10^6}$ and $6.10^6$
  4. $2^{10^6}$ and $6.10^{12}$

2 Answers

Voting & Accepting an answer helps improve the community
← Previous · GO Classes DPP | Alg...Next → · GO Classes DPP | Alg...
← Previous in category · GO Classes DPP | Alg...Next in category → · GO Classes DPP | Alg...
Position:
Show:

Related questions

2 2 votes
2 2 answers
373
373 views
GO Classes asked Sep 9, 2025
373 views
GO Classes DPP | Algorithm |UGC NET
Consider the following functions:$$\begin{aligned}& \mathrm{f}(\mathrm{n})=3 \mathrm{n}^{\sqrt{\mathrm{n}}} \\& \mathrm{~g}(\mathrm{n})=2^{\sqrt{\mathrm{n}}\log _2{\mathr...
4 4 votes
3 3 answers
624
624 views
GO Classes asked Sep 9, 2025
624 views
GO Classes DPP | Algorithm |Greedy algorithm
Consider the weights and values of items listed below. Note that there is only one unit of each item.\[\begin{array}{|l|c|c|}\hline\text{Item number} & \text{Weight (in K...
3 3 votes
2 2 answers
369
369 views
GO Classes asked Sep 9, 2025
369 views
GO Classes DPP | Algorithm |Greedy algorithm
We are given 8 tasks $T_1, T_2, \ldots, T_8$. The execution of each task requires one unit of time. We can execute one task at a time. Each task $T_i$ has a profit $P_i$ ...
1 1 vote
2 2 answers
452
452 views
GO Classes asked Sep 9, 2025
452 views
GO Classes DPP | Algorithm |Asymptotic Analysis
Given a 2-D array mat where the elements of each row are sorted in non-decreasing order and the first element of a row is greater than the last element of the previous ro...