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!
Evaluate the frequency counts for all statements in the following given program segment.
for (i=1; i ≤ n; i ++)
for (j = 1; j ≤ i; j++)
for (k =1; k ≤ j; k++)
y ++;
Ans.
S1: for (i=1; i<= n; i++) S2: for (j=1; j,= i; j++)
S3 : for (k=1; k<= j; k++) S4 : y++;
Frequency counts of
S1=n
S2 = 1+ (1+2)+ (1+2+3) +....... (1+2+....n)
S3 = 1+ [ 1+ (1+2)] + .....[ 1+ (1+2) +....
(1+2+3+...n)]
S4= same as S3.
traverse the graph as BFS
Q. Describe the term array. How do we represent two-dimensional arrays in memory? Explain how we calculate the address of an element in a two dimensional array.
Q. Explain the insertion sort with a proper algorithm. What is the complication of insertion sort in the worst case?
Postorder traversal of a binary tree struct NODE { struct NODE *left; int value; /* can take any data type */ struct NODE *right; }; postorder(struct NODE
What are the conditions under which sequential search of a list is preferred over binary search? Sequential Search is a preferred over binary search when the list is unordered
Algorithm to Delete a given node from a doubly linked list Delete a Node from Double Linked List DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FOR
Merging 4 sorted files having 50, 10, 25 and 15 records will take time O (100)
With the help of a program and a numerical example explain the Depth First Traversal of a tree.
Complexity of an Algorithm An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorith
Ask question find frequency count of function- {for(i=1;i {for(j=1;j {for(k=1;k } } }
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