I want to use the mod and div functions properly in pascal for a college project
Can anyone help?
This Question has been solved and asker verified All Experts Exchange premium technology solutions are available to subscription members.
Experts Exchange has been collecting answers to technology questions since 1996…3 million and counting! If you have a question, chances are we already have your answer.
If you can't find the exact answer you're looking for, ask our exclusive community of 50,000 experts. You’ll get a personalized answer from a trusted professional.
Thousands of free tech tips, tricks, how-to’s and tutorials are available in our peer reviewed articles section. See for yourself how smart our experts are, no login required.
Save solutions to your questions, answers you’ve discovered through searching plus helpful articles in your personal knowledgebase for easy future access.
Access the answers to your technology questions today.
30-day free trial. Register in 60 seconds.
Members of the expert community talk about why the experience at Experts Exchange is different than what you will find anywhere else.
Try it out and discover for yourself.
30-day free trial. Register in 60 seconds.
Join the community of experts here and help other tech pros by answering question in your area of expertise. You can earn FREE access to all Experts Exchange's premium features and resources.
Hi
What exactly do you need help to?
Mod
var
a,b : integer;
begin
a:=123;
b:=a mod 50;
(** gives you B = 23 = the
rest when 123 are divided by 50
50 * 2 = 100 + rest(23) = 123*)
b:=a div 50;
(**gives you b=2 = what whole
number you could divide 123 by(the dividend).
50 = 123 : 50 = 2,.... everything
behind the comma are taken away
then we can say that
(a mod 50) + (a div 50)*50 = 123 **)
Regards
Batalf
Copy of the help for these operators :
"Arithmetic operators, which take real or integer operands, include +, –, *, /, div, and mod.
Operator Operation Operand types Result type Example
+ addition integer, real integer, real X + Y
– subtraction integer, real integer, real Result - 1
* multiplication integer, real integer, real P * InterestRate
/ real division integer, real real X / 2
div integer division integer integer Total div UnitSize
mod remainder integer integer Y mod 6
Operator Operation Operand type Result type Example
+ (unary) sign identity integer, real integer, real +7
– (unary) sign negation integer, real integer, real -X
The following rules apply to arithmetic operators.
The value of x/y is of type Extended, regardless of the types of x and y. For other arithmetic operators, the result is of type Extended whenever at least one operand is a real; otherwise, the result is of type Int64 when at least one operand is of type Int64; otherwise, the result is of type Integer. If an operand’s type is a subrange of an integer type, it is treated as if it were of the integer type.
The value of x div y is the value of x/y rounded in the direction of zero to the nearest integer.
The mod operator returns the remainder obtained by dividing its operands. In other words, x mod y = x – (x div y) * y.
A runtime error occurs when y is zero in an expression of the form x/y, x div y, or x mod y."
This is basically a currency conversion problem. You know what you are going to do:
- change between pennies to notes and notes to pennies
But to change from one form to another, you need to know how to convert it. At this point, programming is not needed yet. Consider how you will convert money in pennies to notes in real life. As you had already known, to convert money in pennies to notes:
1500 pennies = 1 £10 pound note and one £5 pound note
From this, we get the following information:
£10 pound note = 1000 pennies
£5 pound note = 500 pennies
Since this is the information we have, we will assume that only 2 types of notes are available, the £10 pound note and £5 pound note.
Basically we want to have as little notes as possible, so that we don't have to handle so many notes. Hence, we want to use the £10 pound note when we can represent the same amount of pennies with £10 pound note and £5 pound notes. So we will find out the maximum number of £10 pound notes we can use to represent as much of the pennies as possible. Then we will represent rest of the pennies with £5 pound notes. However, the £5 notes may not represent all of the rest of the pennies. So we will leave the rest of the pennies as it is.
Here is what we have to do:
- Use as much £10 notes as possible to represent as much of the pennies
- Use as much £5 notes as possible to represent as much of the remainder of pennies
- Keep the rest of the pennies as it is
By simple arithmetic, we know that to maximize the number of £10 notes used, we divide the number of pennies by 1000 and round down. In Pascal, we use / and div for division purposes. The / is the same as what we usually do in arithmetic, that is it will give the decimals. The div however, does the division only until the ones' place. Hence you can say that div, is the normal division followed by rounding down the result. We use it as how we normally use a division in arithmetic:
c:= a div b
with the exception that we have to assign the result to a variable.
Hence to find the number of £10 notes needed:
tenpound_num := numofpennies div 1000;
The modulo function complements the div function, it gives the remainder when you divide by a number, like what you do in normal arithmetic.
Hence to find the number of pennies left:
numofpennies := numofpennies mod 1000;
Do not be confuse by this statement, the 2nd numofpennies is the original value, we take the remainder of this value divided by 1000 and store it in numofpennies. Numofpennies is updated at the last step.
Next we will convert the remainder of the pennies into £5 notes using the same method:
fivepound_num := numofpennies div 500;
numofpennies := numofpennies mod 500;
Hence we have tenpound_num of £10 notes, fivepound_num of £5 notes and numofpennies of pennies.
Similarly, converting it back is a reverse of what we have done. All we have to know is the value of a £10 note and £5 note in terms of pennies.
So we know,
£10 = 1000 pennies
£5 = 500 pennies
So if we do not want to use notes, we have to use the equivalent amount of pennies to represent the same amount of money. Hence to find out how many pennies needed for then £10 notes, we multiply tenpound_num by 1000. Then we add it to the number of pennies we have:
numofpennies := numofpennies + tenpound_num * 1000;
Notice we add it to numofpennies, not put it in the variable numofpennies. This is so because numofpennies contains the remainder of the pennies that are not converted to notes, hence may not be zero.
Similarly, we convert the £5 notes to pennies:
numofpennies := numofpennies + fivepound_num * 500;
Now we will have 0 £10 notes, 0 £5 notes and numofpennies of pennies.
Cheers dreamvb
Business Accounts
Answer for Membership
by: BatalfPosted on 2000-01-14 at 05:38:59ID: 2352781
Hi
What exactly do you need help to?
Mod
var
a,b : integer;
begin
a:=123;
b:=a mod 50;
(** gives you B = 23 = the
rest when 123 are divided by 50
50 * 2 = 100 + rest(23) = 123*)
b:=a div 50;
(**gives you b=2 = what whole
number you could divide 123 by(the dividend).
50 = 123 : 50 = 2,.... everything
behind the comma are taken away
then we can say that
(a mod 50) + (a div 50)*50 = 123 **)
Regards
Batalf