1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
bulgar [2K]
3 years ago
5

Why should you not perform any personal grooming task while driving?

Computers and Technology
2 answers:
VLD [36.1K]3 years ago
8 0

Answer:

Drivers most capable of multitasking effectively are not those who are most likely to engage in multiple tasks simultaneously. Instead, people who score high on a test of actual multitasking ability tend not to multitask because they are better able to focus attention on the task at hand.

Explanation:

aivan3 [116]3 years ago
7 0

Because drivers should not be distracted

You might be interested in
Write a program that reads numbers from a file (or allow user to input data) and creates an ordered binary tree. The program sho
IgorLugansk [536]

Answer:

See explaination

Explanation:

include<bits/stdc++.h>

using namespace std;

typedef struct Node

{

int data;

struct Node *left,*right;

}Node;

bool search(Node *root,int data)

{

if(root==NULL)

return false;

if(root->data==data)

return true;

queue<Node*> q;

q.push(root);

while(!q.empty())

{

Node *temp=q.front();

q.pop();

if(temp->data==data)

return true;

if(temp->left)

q.push(temp->left);

if(temp->right)

q.push(temp->right);

}

return false;

}

Node *insert(Node *root,int data)

{

if(root==NULL)

{

Node *temp=new Node();

temp->data=data;

temp->left=NULL;

temp->right=NULL;

return temp;

}

if(data < root->data)

root->left=insert(root->left,data);

if(data>root->data)

root->right=insert(root->right,data);

return root;

}

Node *get_smallest_element_right_subtree(Node *root)

{

while(root && root->left!=NULL)

root=root->left;

return root;

}

Node *delete_node(Node *root,int data)

{

if(root==NULL)

return root;

if(data < root->data)

root->left=delete_node(root->left,data);

else if(data > root->data)

root->right=delete_node(root->right,data);

else

{

if(root->left==NULL) //If right only presents means - delete the curr node and return right node

{

Node *temp=root->right;

free(root);

return temp;

}

else if(root->right==NULL) //If left only presents means - delete the curr node and return let node

{

Node *temp=root->left;

free(root);

return temp;

}

else

{

Node *temp=get_smallest_element_right_subtree(root->right);

root->data=temp->data;

root->right=delete_node(root->right,temp->data);

}

return root;

}

}

void inorder(Node *root)

{

if(root!=NULL)

{

inorder(root->left);

cout<<root->data<<" ";

inorder(root->right);

}

}

void postorder(Node *root)

{

if(root!=NULL)

{

inorder(root->left);

inorder(root->right);

cout<<root->data<<" ";

}

}

void preorder(Node *root)

{

if(root!=NULL)

{

cout<<root->data<<" ";

inorder(root->left);

inorder(root->right);

}

}

int main()

{

fstream f;

string filename;

cout<<"\n\n1 - Input through File ";

cout<<"\n\n2 - Input through your Hand";

int h;

cout<<"\n\n\nEnter Your Choice : ";

cin>>h;

Node *root=NULL; // Tree Declaration

if(h==1)

{

cout<<"\n\nEnter the Input File Name : ";

cin>>filename;

f.open(filename.c_str());

if(!f)

cout<<"\n\nError in Opening a file !";

else

{

cout<<"\n\nFile is Being Read ........";

string num;

int value;

int node=0;

while(f>> num)

{

value=stoi(num);

root=insert(root,value);

node++;

}

cout<<"\n\nTree has been successfully created with : "<<node<<" Nodes"<<endl;

}

}

if(h==2)

{

int y;

cout<<"\n\nEnter the Total No of Input :";

cin>>y;

int i=1,g;

while(i!=y+1)

{

cout<<"\n\nEnter Input "<<i<<" : ";

cin>>g;

root=insert(root,g);

i++;

}

cout<<"\n\nTree has been successfully created with : "<<y<<" Nodes"<<endl;

}

if(h>=3)

{

cout<<"\n\nInvalid Choice !!! ";

return 0;

}

int n=0;

while(n!=6)

{

cout<<"\n\n\n1 - Insert Element";

cout<<"\n\n2 - Remove Element";

cout<<"\n\n3 - Inorder (LNR) Display ";

cout<<"\n\n4 - Pre (NLR) Order Display";

cout<<"\n\n5 - Post (LRN) Order Display";

cout<<"\n\n6 - Quit";

cout<<"\n\nEnter Your Choice : ";

cin>>n;

switch(n)

{

case 1:

{

int k;

cout<<"\n\nEnter Element to insert : ";cin>>k;

root=insert(root,k);

cout<<"\n\nElement Sucessfully Inserted !!!!!";

break;

}

case 2:

{

int k;

cout<<"\n\nEnter Element to Remove : ";

cin>>k;

if(search(root,k))

{

root=delete_node(root,k);

cout<<"\n\nValue Successfully Deleted !!!";

}

else

cout<<"\n\n!!!!!!!!!!!!!!!!!!!! No Such Element !!!!!!!!!!!!!!!!!!!!!!";

break;

}

case 3:

{

cout<<"\n\nThe Elements (LNR) are : ";

inorder(root);

break;

}

case 4:

{

cout<<"\n\nThe Elements (NLR) are : ";

preorder(root);

break;

}

case 5:

{

cout<<"\n\nThe Elements (LRN) are : ";

postorder(root);

break;

}

case 6:

{

break;

}

}

}

cout<<"\n\nBye!!!! See You !!!"<<endl;

7 0
3 years ago
List three differences between word and excel
34kurt

Answer:

Word: A word processor

           File extension is .doc

          Images, texts, and graphic styles can be added

Exel: A spreadsheet software

       Comprises rows and columns which combine to form cells

       File extension is .xls

I hope i helped! xoxo

4 0
2 years ago
What are the types of technology that is use in education and what are their usages​
hjlf
Computers and Tablets I think
5 0
3 years ago
What is the initial condition in this set of code?
marissa [1.9K]

Answer:An initial condition is an extra bit of information about a differential equation that tells you the value of the function at a particular point. Differential equations with initial conditions are commonly called initial value problems.

The video above uses the example

{

d

y

d

x

=

cos

(

x

)

y

(

0

)

=

−

1

to illustrate a simple initial value problem. Solving the differential equation without the initial condition gives you  

y

=

sin

(

x

)

+

C

.

Once you get the general solution, you can use the initial value to find a particular solution which satisfies the problem. In this case, plugging in  

0

for  

x

and  

−

1

for  

y

gives us  

−

1

=

C

, meaning that the particular solution must be  

y

=

sin

(

x

)

−

1

.

So the general way to solve initial value problems is: - First, find the general solution while ignoring the initial condition. - Then, use the initial condition to plug in values and find a particular solution.

Two additional things to keep in mind: First, the initial value doesn't necessarily have to just be  

y

-values. Higher-order equations might have an initial value for both  

y

and  

y

′

, for example.

Second, an initial value problem doesn't always have a unique solution. It's possible for an initial value problem to have multiple solutions, or even no solution at all.

Explanation:

5 0
2 years ago
This Command to insert copied text anywhere in your document
harina [27]

Answer:

Paste

Explanation:

6 0
3 years ago
Read 2 more answers
Other questions:
  • Which of the acronyms listed below refers to a series of basic hardware diagnostic tests performed by the startup BIOS after the
    13·1 answer
  • Find the 65th percentile from the data. The data consist of class interval from 0-10, 10-20, 20-30, 30-40, 40-50, 50-60 and freq
    8·1 answer
  • An advertiser who sells coffee beans adds the keyword “Java'” to an ad group. After two weeks, she runs a placement performance
    8·1 answer
  • The Cisco IOS automatically modifies the dead interval when the _____ interval is changed. (Points : 2) hello
    13·1 answer
  • Write a program that uses for loops to perform the following steps: Prompt the user to input two integers: firstNum and secondNu
    15·1 answer
  • Componets of computer
    5·1 answer
  • What are some of the ways you can use bitlocker encryption? (choose all that apply?
    10·1 answer
  • Write a c program using loops to generate following output.
    11·1 answer
  • 1.
    13·1 answer
  • Any one know :) please
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!