analysis

I am completely new in analysis and design..... please some one tell me : what is the difference between System use case and Business use case ? As far as I know, there is only one diagram in UML called use case diagram.. Now, what about them ? Do they have separate diagram? Thank you Abdur Rahman Business Use-Case A Business Use-Case is a way in which a customer or some other interested party can make use of the business to get the result they want whether it’s to buy an item, to get a new driving licence, to pay an invoice, or whatever. An important point is that a single execution of a

This problem is based on a puzzle by Joel Spolsky from 2001. A guy "gets a job as a street painter, painting the dotted lines down the middle of the road." On the first day he finishes up 300 yards, on the second - 150, and on the 3rd even less so. The boss is furious and demands an explanation. "I can't help it," says the guy. "Every day I get farther and farther away from the paint can!" My question is, can you estimate the distance he covered in the 3rd day? One of the comments in the linked thread does derive a precise solution, but my question is about a precise enough estimation - say,

Could someone help me out with the time complexity analysis on this pseudocode? I'm looking for the worst-case complexity here, and I can't figure out if it's O(n^4), O(n^5) or something else entirely. If you could go into detail into how you solved it exactly, it would be much appreciated. sum = 0 for i = 1 to n do for j = 1 to i*i do if j mod i == 0 then for k = 1 to j do sum = sum + 1 First loop: O(n) Second loop: i is in average n/2 , you could have an exact formula but it's O(n²) Third loop happens i times inside the second loop, so an average of n/2 times. And it's O(n²) as well,

Hey guys, I have a quick question. Does anyone know of any software that can help with understanding client-server logs? I have 3 huge logs of 1 server & 2 clients that are time stamped, but only if I could arrange all 3 of them in a UI side by side in a chronological order, it would be so easy for me to understand them. Thanks for any tips on such a software. (Or maybe some ideas to help me with this.)3 Edit: the mockup image has blue line partitions to separate out time in milliseconds. That is just for visualization. You didn't say what platform but Microsoft Log Parser is something that

function alg1(n) 1 a=0 2 for o=1 to n do 3 for t=1 to o do 4 for k=t to o+t do 5 a=a+1 6 return(a) If anyone could guide me to how you would find the worst-case here, and how to get the output a of alg1 as a function of n, I would be very grateful. Thanks! We can compute the exact number of increments this code executes. First, let's replace for k=t to o+t do with for k=1 to o+1 do After this change, two inner loops looks like this for t=1 to o do for k=1 to o+1 do The number of iterations of these loops is obviously o*(o+1) . The overall number of iterations can be calculated in the following

Analysing time complexity of this pseudocode. On the right my take on the number of times each line runs. I'm not sure whether to use log n , n log n , or simply n for the while-loop..please help times 1 sum = 0 1 2 i = 1 1 3 while i ≤ n log n + 1 4 for j = 1 to n n log n 5 sum = sum + j n log n 6 i = 2i log n 7 return sum 1 this results in: 2 n log + 2log n + 4 and thereby : O(n log n) is this correct ? If your while loop is: 3 while i < n log n + 1 4 for j = 1 to n n log n 5 sum = sum + j n log n 6 i = 2i log n Then yes, you are correct in calculating the complexity. The complexity of the