D. Transfer information from one type of program to another.
The<u> WEBSITE STORYBOARD</u> is a visual or textual storyboard that will assist in determining the type of web pages on your site.
Explanation:
- A Website storyboard is a visual representation of your websites structure. It relates out all the components of your site and how they related.
- Creating a website storyboard can help you plan and organise your website and even plan the internal linking structure between pages.
- A storyboard is a graphic organizer that consists of illustrations or images displayed in sequence for the purpose of pre-visualizing a motion picture, animation, motion graphic or interactive media sequence.
- The storyboard is a very important part of the pre production process as it clearly conveys how the story will flow
- Storyboard allows you to see potential problems that would not go unnoticed saving time and money.
- Storyboards are more useful when trying to articulate to someone else what the shot should look like so they know how to make it work.
Answer:
1.
class TIME
{
int hour , min , sec ;
public :
TIME()
{
hour=min=sec=0;
}
TIME( int h , int m , int s )
{
hour = h;
min = m;
sec = s;
}
void change ( int Hour)
{
hour = Hour;
}
void stdtime()
{
if(hour>12)
cout<<"The Standard time is"<<(hour-12)<<":"<<min<<":"<<sec<<"P.M\n";
else
cout<<"The Standard time is"<<hour<<":"<<min<<":"<<sec<<"A.M\n";
}
void miltime()
{
cout<<"The Military time is"<<hour<<":"<<min<<":"<<sec<<" hours\n";
}
};
void main()
{
TIME A , B(13,25,30);
A .stdtime();
A.change(23);
A.miltime();
B.stdtime();
B.change(9);
B.miltime();
}
2.
class elevator
{
int CurrentFloor;
int GoingUp;
int GoingDown;
public:
elevator()
{
CurrentFloor=0;
GoingUp=1;
GoingDown=-1;
}
elevator(int floor)
{
CurrentFloor=floor;
GoingUp=1;
GoingDown=-1;
}
void goUp(int y)
{
if( CurrentFloor>3)
cout<<"\nNO MORE FLOORS\n";
else
CurrentFloor=CurrentFloor+y*GoingUp;
}
void goDown(int x)
{
if(CurrentFloor<0)
cout<<"\nNO MORE FLOORS";
else
CurrentFloor=CurrentFloor+x*GoingDown;
}
};
void main()
{
elevator A(1);
A.goUp(1);
A.goUp(1);
A.goUp(1);
A.goDown(1);
A.goDown(1);
}
Answer:
Flowchart of an algorithm (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" or "true" (more accurately, the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A. (Algorithm derived from Scott 2009:13; symbols and drawing style from Tausworthe 1977).
Explanation:
Flowchart of an algorithm (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" or "true" (more accurately, the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A. (Algorithm derived from Scott 2009:13; symbols and drawing style from Tausworthe 1977).
