please start working on this assignment
please help me about this assignmentView more random threads:
- CS507 Assignment No. 02 SEMESTER Spring 2011 Information...
- CS609 System Programming Assignment No.4 Fall 2012 Due Date...
- CS614 Data Warehousing Assignment No 2 Solution Fall...
- cs301
- CS504 Software Engineering-1 Assignment 3 solution fall...
- CS501 Advance Computer Architecture assignment no 5 idea...
- CS 610 Computer Networks Assignment no 03 Spring 2011
- CS403 Database Management Systems assign Assignment No. 04...
- CS506 Web Design and Development Assignment No. 2 Solution...
- CS615 assignment no 4 fall 3 January 2012 virtual...
Sponsored Links
please start working on this assignment
working working and working
Urgent call: 03455242488. | Virtual University Assignments
Virtual University GDBs | Virtual University Papers | Vu Projects | Vu Handouts
About Expert
please please please
GGGG moon what do u do?
Urgent call: 03455242488. | Virtual University Assignments
Virtual University GDBs | Virtual University Papers | Vu Projects | Vu Handouts
About Expert
Question 1
Rule 0
The condition that stops a loop executes ONE MORE time than the loop itself
(the last time is when it is evaluated false)
Rule 1
for (i=0;i<n;i=i+k) Anything inside the loop will run approximately n/k times
Rule 2
for (i=n;i>0;i=i-k) Anything inside the loop will run approximately n/k times
Rule 3
for (i=1;i<n;i=i*k) Anything inside the loop will run approximately logkn times
Rule 4
for(i=1;i<=n;++i)
for (j=1;j<=i;++j)
The above nested loop approximately runs ½ n(n+1) times.
The variable j depends upon the value of i
Rule 5
for(i=1;i<=n;i=i*2)
for (j=1;j<=i;++j)
The statements in the above nested loop approximately run
2n-1 times.
The variable j depends upon the value of i
Rule 6
If the loop variables are independent then the total times a statement inside a
nested loop is executed is equal to the product of the times the individual loops
run
e.g. for (i=0;i<n;++i)
for (j=0;j<m;++j)
A statement inside the above nested loop will run n*m times
Question 2 (10)
Arrange the following in the Most to Least complexity order. Here “n “is the input size
for the some complexity function and k< j and j & k are numbers greater than 2.Every
function is separated by “comma” and note these are 20 functions to arrange.
2
2 4 8
5 6
n, n / 2, n j/2, nlgn, nn, 1,100, 2n, lgn, n!,(n! ) / ,
/ ,n! log / , / log ,10000,n / , (log ) ,
n / , (log ) ,1000
k n n n
n n n n n n n nn n n
n n n n
plz check and if corection is required then tell me. thanks
(Remember in prayers)
sorry but it is not related with current assignment
moon shaib kabhi thanks nahi kaha app nay solution lay akr.
Urgent call: 03455242488. | Virtual University Assignments
Virtual University GDBs | Virtual University Papers | Vu Projects | Vu Handouts
About Expert
CS502 Question No. 2 Hazir Hai.
See the attachment.
There are currently 1 users browsing this thread. (0 members and 1 guests)