I think its the new age either that or end times
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: Yes
Explanation: Greedy algorithm is the algorithm that gives the solution to the problem on the basis of the piece by piece or step by step architecture. the next step of the solution is based on the aim of solving problem optimally.But the steps chosen can be correct or incorrect.
Non-deterministic nature is the feature that determines that the steps that is being chosen is not the most optimal one and no high surety is present.Thus, this nature is present in the greedy algorithm and it has non-deterministic nature.
Answer:
i don't think there is such thing as a quasi vpn
Explanation:
