Term specifically describes small chunks of rocks and debris in space that burn up in Earth’s atmosphere is :
Meteors
Explanation:
- A meteor is a meteoroid or a particle broken off an asteroid or comet orbiting the Sun – that burns up as it enters the Earth's atmosphere, creating the effect of a "shooting star".
- Meteoroids that reach the Earth's surface without disintegrating are called meteorites.
- Due to Earth's escape velocity, the minimum impact velocity is 11 km/s with asteroid impacts averaging around 17 km/s on the Earth. The most probable impact angle is 45 degrees.
- Meteoroids have a pretty big size range. They include any space debris bigger than a molecule and smaller than about 330 feet space debris bigger than this is considered an asteroid.
- But most of the debris the Earth comes in contact with is "dust" shed by comets traveling through the solar system.
- The surface of a meteorite is generally very smooth and featureless, but often has shallow depressions and deep cavities resembling clearly visible thumbprints
- Most iron meteorites, like the example at right, have well-developed regmaglypts all over their surface.
Answer: it’s called a saw or see saw
Explanation: it works by cutting a tree, wood, tile, etc.
Answer:
The power is 
Explanation:
In order to obtain the power it consumes we need to first obtain the resistance of the hair dryer at 120 V
Now the power supplied in Europe at their voltage of 230V would be
Looking the power obtain we see that it is higher than 1530 W so this would cause the dryer to smoke.
Answer:
Using linkedlist on C++, we have the program below.
Explanation:
#include<iostream>
#include<cstdlib>
using namespace std;
//structure of linked list
struct linkedList
{
int data;
struct linkedList *next;
};
//print linked list
void printList(struct linkedList *head)
{
linkedList *t=head;
while(t!=NULL)
{
cout<<t->data;
if(t->next!=NULL)
cout<<" -> ";
t=t->next;
}
}
//insert newnode at head of linked List
struct linkedList* insert(struct linkedList *head,int data)
{
linkedList *newnode=new linkedList;
newnode->data=data;
newnode->next=NULL;
if(head==NULL)
head=newnode;
else
{
struct linkedList *temp=head;
while(temp->next!=NULL)
temp=temp->next;
temp->next=newnode;
}
return head;
}
void multiplyOddPosition(struct linkedList *head)
{
struct linkedList *temp=head;
while(temp!=NULL)
{
temp->data = temp->data*10; //multiply values at odd position by 10
temp = temp->next;
//skip odd position values
if(temp!= NULL)
temp = temp->next;
}
}
int main()
{
int n,data;
linkedList *head=NULL;
// create linked list
head=insert(head,20);
head=insert(head,5);
head=insert(head,11);
head=insert(head,17);
head=insert(head,23);
head=insert(head,12);
head=insert(head,4);
head=insert(head,21);
cout<<"\nLinked List : ";
printList(head); //print list
multiplyOddPosition(head);
cout<<"\nLinked List After Multiply by 10 at odd position : ";
printList(head); //print list
return 0;
}
