Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
1) The set of the algorithms whose order is O (1) would run in the identical time. True/False
2) Determine the complexity of the following program into big O notation:
printMultiplicationTable(int max){
for(int i = 1 ; i <= max ; i + +)
{
for(int j = 1 ; j <= max ; j + +) cout << (i * j) << " " ; cout << endl ;
} //for
3) Assume the following program segment:
for (i = 1; i <= n; i *= 2)
j = 1;
}
Find out running time of the above program segment into big O notation?
4) Prove that if f(n) = n2 + 2n + 5 and g(n) = n2 then f(n) = O (g(n)).
5) How several times does the given for loop will run
for (i=1; i<= n; i*2)
k = k + 1;
end;
any simple algoritham questions with answers
what do we use asymptotic notation in study of algorithm?Describe various asymptotic notation and give their significance.
Open addressing The easiest way to resolve a collision is to start with the hash address and do a sequential search by the table for an empty location.
The searching method are applicable to a number of places in current's world, may it be Internet, search engines, text pattern matching, on line enquiry, finding a record from data
The algorithm to delete any node having key from a binary search tree is not simple where as several cases has to be considered. If the node to be deleted contains no sons,
Explain Division Method Division Method: - In this method, key K to be mapped into single of the m states in the hash table is divided by m and the remainder of this division
HEAP A heap is described to be a binary tree with a key in every node, such that 1-All the leaves of the tree are on 2 adjacent levels. 2- All leaves on the lowest leve
What do we mean by algorithm? What are the characteristics of a good and relevant algorithm? An algorithm is "a step-by-step procedure for finishing some task'' An algorithm c
Write an assembly program to separate the number of positive numbers and negative numbers from a given series of signed numbers.
Q. Write down the recursive function to count the number of the nodes in the binary tree. A n s . R ecursive Function to count no. of Nodes in Binary Tree is writt
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd