Interested to Buy Any Domain ? << Click Here >> for more details...
Algorithm in O(2n)
Presently we can solve in our hypothetical machine problem
instances of size 100 in 1 minute using algorithm A, which
is a O(2n). We would like to solve instances of size 200 in
1 minute using algorithm A on a new machine.
What is the speed of the new machine should be?
- 2 Answers
- 7023 Views
- ABC, Qatar University, I also Faced
- E-Mail Answers
Answer Posted / nerd
This thing is rubbish
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
write a program that prompt the user to enter his height and weight,then calculate the body mass index and show the algorithm used
Given a table of the form: Product Sold on A 1/1/1980 B 1/1/1980 C 1/1/1980 A 1/1/1980 B 1/1/1980 C 2/1/1980 A 2/1/1980 There are 30 products and 10,000 records of such type. Also the month period during which sales happened is given to u. Write the program to display the result as: Product Month No. of copies A January 12 A February 15 A March 27 B January 54 B February 15 B March 10 C January 37
Write a program that print in screen a tree with its height taken from user by entering number of 4 digits and find the odd numbers then calculate the sum of odd numbers so he get the height of tree?
write a program that reads a series of strings and prints only those strings begging with letter "b"
write a program to calculate the amount of investment after a period n years if the principal investors was p and interest is calculated using compound interest,formular=a=p(1+r)^n
Performance Algorithm A performs 10n2 basic operations and algorithm B performs 300 lg n basic operations. For what value of n does algorithm B start to show its better performance?
Code for Easily Using Hash Table?
Write a simple encryption program using string function which apply the substitution method.
Ask the user to input three positive integers M, N and q. Make the 2 dimensional array of integers with size MxN, where all the elements of I (I = 1,…,M) line will be members of geometrical progression with first element equal to the number of line (I) and denominator q.
Write a C++ program without using any loop (if, for, while etc) to print prime numbers from 1 to 100 and 100 to 1 (Do not use 200 print statements!!!)
1+1/2!+1/3!+...+1/n!
i really need help about this.. write a program to display the set of odd and even numbers separately. find the highest and lowest value of the given numbers.
What output does the following code generate? Why? What output does it generate if you make A::Foo() a pure virtual function? class A { A() { this->Foo(); } virtual void Foo() { cout << "A::Foo()" << endl; } }; class B : public A { B() { this->Foo(); } virtual void Foo() { cout << "A::Foo()" << endl; } }; int main(int, char**) { A objectA; B objectB; return 0; }
A suduco given & u hv 2 check if it is incomplete(blanks left),or correct or incorrect
How to swap two ASCII numbers?
