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;
Q. What do you understand by the term Binary Tree? What is the maximum number of nodes which are possible in a Binary Tree of depth d. Explain the terms given below with respect to
What is the best case complexity of quick sort In the best case complexity, the pivot is in the middle.
b) The user will roll two (six-sided) dices and the user will lose the game if (s)he gets a value 1 on either any of the two dices & wins otherwise. Display a message to the user w
We have discussed that the above Dijkstra's single source shortest-path algorithm works for graphs along with non-negative edges (like road networks). Given two scenarios can emerg
Explain CAM software CAD/CAM software has been recognized as an essential tool in the designing and manufacturing of a product due to its ability to depict the designs and tool
Q. Define the sparse metrics and also explain the representation of a 4X4 matrix using linked list. Ans: A matrix in which number of zero entries is quite h
Merging two sequence using CREW merge
Technique for direct search is Hashing is the used for direct search.
Q. How do we represent a max-heap sequentially? Explain by taking a valid example. Ans: A max heap is also called as a descending heap, of size n is an almos
Q. Write a procedure to the insert a node into the linked list at a particular position and draw the same by taking an example?
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