Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Snapshot sequence
Hi guys, having problems understand what exactly this means :
Write a snapshot sequence for the computation 12 mod 5 of the following
algorithm
MOD
Input: a non-negative integer a and a positive integer b
Output: the remainder when a is divided by b
1. while a is greater than or equal to b
2. replace a with a - b
3. return a
The first snapshot is
(1. a = 12, b = 5)
I'm not too sure what a snapshot sequence is, hopefully I can get some help with this question guys
Related threads:
Re: Snapshot sequence
Can you ask whoever wrote that description what a "snapshot sequence" is?
I've never heard of it.
If you don't understand my answer, don't ignore it, ask a question.
Re: Snapshot sequence
The lecturer has posted it on the course website and as a question for an assignment. I have sent him 3 e-mails over the course of the last month he has still not replied
Reply With Quote