Answer:
Following are the program in Python langauge
person_name = input() # Read the person name by the user
person_age=0 #declared a vaiable person_age
person_age = int(input()) # read person_age by the user
person_age=person_age+5 # add 5 to person_age
print('In 5 years',person_name,'will be',person_age) # display the output
Output:
Amy
4
In 5 years Amy will be 9
Explanation :
Following is the description of code:
- Read the value of the "person_name" variable by the user by using the input function.
- Declared a variable person_age and initialized 0 with them.
- Read the value of "person_age" variable by user by using input function and convert into int by using int function
- Add 5 to "person_age" variable and store again them into the "person_age" variable.
- Finally, display the output which is mention in the question.
Answer:
D. javascript
Explanation:
use form validation method bro
Isopropyl is: CH3 - CH - CH3
|
Heptane is: CH3 - CH2 - CH2 - CH2 - CH2 - CH2 - CH3
Then 2,2 isopropyl heptane is:
CH3 - CH - CH3
|
CH3 - C - CH2 - CH2 - CH2 - CH2 - CH3
|
CH3 - CH - CH3.
There you can count that the longest carbon chain has 8 carbon atoms.
So the right name is of an octane.
I will rearrange the chain to show the 8 carbon chain in a row:
CH3 CH3
| |
CH3 - CH - C - CH2 - CH2 - CH2 - CH2 - CH3
|
CH3 - CH - CH3
Now, you can see that the right name is 3 isopropyl - 2, 3 dimethyl octane
Answer:
See explaination
Explanation:
#include<iostream>
#include<stack>
#include <algorithm> // std::make_heap, std::pop_heap, std::push_heap, std::sort_heap
#include <vector> // std::vector
using namespace std;
void StaticArray()
{
unsigned int array[64536];
for(unsigned int i=0;i<64536;i++)
array[i]=i;
}
void Stack()
{
stack<unsigned int> mystack;
for(unsigned int i=0;i<64536;i++)
mystack.push(i);
}
void Heap()
{
unsigned int myints[64536];
for(unsigned int i=0;i<64536;i++)
myints[i]=i;
vector<unsigned int> v(myints,myints+64535);
make_heap (v.begin(),v.end());
push_heap (v.begin(),v.end());
}
int main()
{
StaticArray();
Stack();
Heap();
return 0;
}
Answer:
The proof is in the explanation
Explanation:
is 
if 
for 
.
So, basically, we have to solve the following inequality
Dividing everything by 
to simplify, we have
I am going to use 
. So
There is a solution for the inequality, which proves that 
is
