03-10-2008
Algorithm In Pseudocode
A) produce an algorithm in pseudocode and a flowchart that gets n from the user and calculate their sum.
B) Write an algorithm in pseudocode and a flowchart that gets number x from he user and calculates x5 ( X to the power of %5). Calculate by using multiplication.
Thanks y'all.
9 More Discussions You Might Find Interesting
1. Programming
Hi
I search an exemple of scheduling Feedback algorithm, or help about how to create one.
Thanks (0 Replies)
Discussion started by: messier79
0 Replies
2. Solaris
I am tryin to change the sort fields in mainframes to the equivalent in Unix. I have a large datafile of which i extract only the specified fields ... cut them ... write it into another file with a delimiter... and sort based on these fields... then match these fields to those from input file ...... (1 Reply)
Discussion started by: bourne
1 Replies
3. Shell Programming and Scripting
PID USERNAME SIZE RSS STATE PRI NICE TIME CPU PROCESS/NLWP
21444 tomusr 213M 61M sleep 29 10 1:20:46 0.1% java/43
21249 root 93M 44M sleep 29 10 1:07:19 0.2% java/56
is there anyway i can use a command to get the total of the SIZE? 306M (Derive from... (5 Replies)
Discussion started by: filthymonk
5 Replies
4. Programming
Hi guys , in my study book from which I re-learn C is task to generate all possible characters combination from numbers entered by the user. I know this algorithm must use combinatorics to calculate all permutations. Problem is how to implement algortihm.
// This program reads the four numbers... (0 Replies)
Discussion started by: solaris_user
0 Replies
5. Programming
Can you help to adjust the void dijkstra(int s) function to find a path from source to every node so that the minimum cost on that path is maximum.
Ex:
From 1 to 2 we have 1 - 3 - 4 - 2 , costs(2+3+4+5)
From 1 to 2 we have 1 - 5 - 6 - 2 , costs(3+3+4+5)
I need the algorithm to choose path 1... (4 Replies)
Discussion started by: ali2011
4 Replies
6. Homework & Coursework Questions
Give a counter example such that the following heuristic algorithm, for the 2-tape problem, doesn't always produce the best solution:
Algorithm:
Sort {Xi} in descending order.
Place files in tapes one at a time.
For a file being considered, assign the file to the smaller tape.
Thanks in... (1 Reply)
Discussion started by: sureshcisco
1 Replies
7. UNIX for Dummies Questions & Answers
i'm doing banker's algorithm..
got some error there but i cant fix it..
please help!!
#!/bin/bash
echo "enter no.of resources: "
read n1
echo -n "enter the max no .of resources for each type: "
for(( i=0; i <$n1; i++ ))
do
read ${t}
done
echo -n "enter no .of... (1 Reply)
Discussion started by: syah
1 Replies
8. Homework & Coursework Questions
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
shell scripts to simulate Banker’s algorithm on a collection of processes (process details are entered as inputs... (4 Replies)
Discussion started by: syah
4 Replies
9. Shell Programming and Scripting
Hi gurus,
My boss has asked me to create a unix script to check header files vs data files and to send an email in case of any failure.
I have very little unix scripting experience and it was now long ago so I'm a bit concerned I wont be able to turn this around by end of day tomorrow.
... (4 Replies)
Discussion started by: Leedor
4 Replies
LEARN ABOUT CENTOS
mail::dkim::algorithm::base
Mail::DKIM::Algorithm::Base(3) User Contributed Perl Documentation Mail::DKIM::Algorithm::Base(3)
NAME
Mail::DKIM::Algorithm::Base - base class for DKIM "algorithms"
SYNOPSIS
my $algorithm = new Mail::DKIM::Algorithm::rsa_sha1(
Signature => $dkim_signature
);
# add headers
$algorithm->add_header("Subject: this is the subject 15 12");
$algorithm->finish_header;
# add body
$algorithm->add_body("This is the body. 15 12");
$algorithm->add_body("Another line of the body. 15 12");
$algorithm->finish_body;
# now sign or verify...
# TODO...
CONSTRUCTOR
You should not create an object of this class directly. Instead, use one of the DKIM algorithm implementation classes, such as rsa_sha1:
my $algorithm = new Mail::DKIM::Algorithm::rsa_sha1(
Signature => $dkim_signature
);
METHODS
add_body() - feeds part of the body into the algorithm/canonicalization
$algorithm->add_body("This is the body. 15 12");
$algorithm->add_body("Another line of the body. 15 12");
The body should be fed one "line" at a time.
add_header() - feeds a header field into the algorithm/canonicalization
$algorithm->add_header("Subject: this is the subject 15 12");
The header must start with the header field name and continue through any folded lines (including the embedded <CRLF> sequences). It
terminates with the <CRLF> at the end of the header field.
finish_body() - signals the end of the message body
$algorithm->finish_body
Call this method when all lines from the body have been submitted. After calling this method, use sign() or verify() to get the results
from the algorithm.
finish_header() - signals the end of the header field block
$algorithm->finish_header;
Call this method when all the headers have been submitted.
sign() - generates a signature using a private key
$base64 = $algorithm->sign($private_key);
signature() - get/set the signature worked on by this algorithm
my $old_signature = $algorithm->signature;
$algorithm->signature($new_signature);
verify() - verifies a signature
$result = $algorithm->verify();
Must be called after finish_body().
The result is a true/false value: true indicates the signature data is valid, false indicates it is invalid.
For an invalid signature, details may be obtained from $algorithm->{verification_details} or $@.
SEE ALSO
Mail::DKIM
AUTHOR
Jason Long, <jlong@messiah.edu>
COPYRIGHT AND LICENSE
Copyright (C) 2005-2007 by Messiah College
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.8.6 or,
at your option, any later version of Perl 5 you may have available.
perl v5.16.3 2010-11-14 Mail::DKIM::Algorithm::Base(3)