Bissoy.com
Doctors Medicines MCQs Q&A

Let f: N->N be a step counting function. Then for some constant C, Time(f) is a proper subset of Time(_______)

Let f: N->N be a step counting function. Then for some constant C, Time(f) is a proper subset of Time(_______) Correct Answer O(n2f2)

Using the encoding function, it is possible to show that if the function f is a step counting function, then the function Cn2(f(n))2 is the total number of moves required.

Related Questions

An electronic device rearranges numbers step-by-step in a particular order according to set of rules. The device stops when the final result is obtained.
Input: 84 15 35 04 18 96 62 08
Step 1: 96 84 15 35 04 18 62 08
Step 2: 96 84 62 15 35 04 18 08
Step 3: 96 84 62 35 15 04 18 08
Step 4: 96 84 62 35 18 15 04 08
Step 5: 96 84 62 35 18 15 08 04
And Step 5 is the last step for this input. Now, find out an appropriate step in the following question following the above rule. Question:
Input: 16 09 24 28 15 04
What will be the third step for this input ?
An electronic device when fed with the numbers, rearranges them in a particular order following certain rules. The following is a step-by-step process of rearrangement for the given input of numbers. Input :- 85 16 36 04 19 97 63 09 Step I :- 97 85 16 36 04 19 63 09 Step II :- 97 85 63 16 36 04 19 09 Step III :- 97 85 63 36 16 04 19 09 Step IV :- 97 85 63 36 19 16 04 09 Step V :- 97 85 63 36 19 16 09 04 (for the given input step V is the last step). Which of the following will be the last step for the given input ? Input :- 03 31 43 22 11 09
A device rearranges numbers step by step in a particular order according to a set of rules. The device stops when the final result is obtained. Step V is the final for this device. Input: 86 17 35 03 20 99 64 08 Step I: 99 86 17 35 03 20 64 08 Step II: 99 86 64 17 35 03 20 08 Step III: 99 86 64 35 17 03 20 08 Step IV: 99 86 64 35 20 17 03 08 Step V: 99 86 64 35 20 17 08 03 Study the above arrangement carefully and answer this question. Which one of the following would be the last step for the input below? Input: 02 30 40 20 11 08 
A word arrangement machine, When given an input line of words, rearranges it in every step following a certain rule. Following is an illustration of an input line of words and various steps of rearrangement.
Input: gone are take enough brought station
Step 1: take gone are enough brought station
Step 2: take are gone enough brought station
Step 3: take are station gone enough brought
Step 4: take are station brought gone enough
And Step 4 is the last step for this input. Now, find out an appropriate step in the following question following the above rule. Question:
Input: car on star quick demand fat
What will be the third step for this input ?
A word arranging device rearranges words step-by-step in a particular order according to set of rules. The device stops when the final result is obtained.
Input: but going for crept te light sir
Step 1: crept but going for te light sir
Step 2: crept going light but for te sir
Step 3: crept going light but for sir te
And Step 3 is the last step for this input. Now, find out an appropriate step in the following question following the above rules. Question:
Input: more fight cats cough sough acts idea
What will be the last step for this input ?
Consider the following relation on subsets of the set ? of integers between 1 and 2014. For two distinct subsets U and V of S we say U < V if the minimum element in the symmetric difference of the two sets is in U. Consider the following two statements: S1: There is a subset of S that is larger than every other subset. S2: There is a subset of S that is smaller than every other subset. Which one of the following is CORRECT?
Let A(1), A(2), A(3),…….., A(100) be 100 sets such that number of elements in A(i)=i+1 and A(1) is subset of A(2), A(2)is subset of A(3),….., A(99) is subset of A(100). The number of elements in union of the all the sets are: n(A(1) U A(2) U A(3) …..U A(100)).
Nitin is counting the numbers in descending order from 32. Shashank is counting the numbers in ascending order from 1 and he pronounces only the odd numbers. If they are counting with the same speed which same number will they pronounce together?
Counting number ‘1’ doesn’t have a predecessor because of which of the following? I. Counting of objects always start from 1 II. 1 is the smallest counting number
Refer to the figure given below. AB, CD and EF are three parallel paths. A person starts from AB to reach EF by moving in four steps - moving from AB to O1 in step 1, from O1 to CD in step 2, from CD to O2 in step 3 and from O2 to EF in step 4. If he takes a curved path in one step, he cannot take a curved path in the next step. In how many ways the person can reach EF from AB?