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
Ray Of Light [21]
3 years ago
7

What's the best way to plan an organized​

Engineering
1 answer:
Alekssandra [29.7K]3 years ago
5 0

Answer:

Get ready and comfortable.

List all of the tasks you need to accomplish over the next week. .

Next schedule everything.

Get a planner/calender.

Cut those tasks that do not fit into your

You might be interested in
Economics is the study of how individuals and societies make choices under the condition of
k0ka [10]

Answer:

ig scarcity

Explanation:

Hope it Helps!!!

3 0
1 year ago
A series of experiments is conducted in which a thin plate is subjected to biaxial tension/compression, σ1, σ2 , the plane surfa
Andrew [12]

Answer:

                                               

Explanation:

3 0
2 years ago
Explain how use of EGR is effective in reducing NOx emissions 4. In most locations throughout the U.S., the octane number of reg
TiliK225 [7]

Answer:please see attached file

Explanation:

3 0
3 years ago
What is the effect of the workpiece specific cutting energy on the cutting forces, and why?
ella [17]

Explanation:

Specific cutting energy:

   It the ratio of power required to cut the material to metal removal rate of material.If we take the force required to cut the material is F and velocity of cutting tool is V then cutting power will be the product of force and the cutting tool velocity.

Power P = F x V

Lets take the metal removal rate =MRR

Then the specific energy will be

    sp=\dfrac{F\times V}{MRR}

If we consider that metal removal rate and cutting tool velocity is constant then when we increases the cutting force then specific energy will also increase.

8 0
3 years ago
For this problem, you may not look at any other code or pseudo-code (even if it is on the internet), other than what is on our w
sergiy2304 [10]

Answer:

(a)

(i) pseudo code :-

current = i

// assuming parent of root is -1

while A[parent] < A[current] && parent != -1 do,

if A[parent] < A[current] // if current element is bigger than parent then shift it up

swap(A[current],A[parent])

current = parent

(ii) In heap we create a complete binary tree which has height of log(n). In shift up we will take maximum steps equal to the height of tree so number of comparison will be in term of O(log(n))

(b)

(i) There are two cases while comparing with grandparent. If grandparent is less than current node then surely parent node also will be less than current node so swap current node with parent and then swap parent node with grandparent.

If above condition is not true then we will check for parent node and if it is less than current node then swap these.

pseudo code :-

current = i

// assuming parent of root is -1

parent is parent node of current node

while A[parent] < A[current] && parent != -1 do,

if A[grandparent] < A[current] // if current element is bigger than parent then shift it up

swap(A[current],A[parent])

swap(A[grandparent],A[parent])

current = grandparent

else if A[parent] < A[current]

swap(A[parent],A[current])

current = parent

(ii) Here we are skipping the one level so max we can make our comparison half from last approach, that would be (height/2)

so order would be log(n)/2

(iii) C++ code :-

#include<bits/stdc++.h>

using namespace std;

// function to return index of parent node

int parent(int i)

{

if(i == 0)

return -1;

return (i-1)/2;

}

// function to return index of grandparent node

int grandparent(int i)

{

int p = parent(i);

if(p == -1)

return -1;

else

return parent(p);

}

void shift_up(int A[], int n, int ind)

{

int curr = ind-1; // because array is 0-indexed

while(parent(curr) != -1 && A[parent(curr)] < A[curr])

{

int g = grandparent(curr);

int p = parent(curr);

if(g != -1 && A[g] < A[curr])

{

swap(A[curr],A[p]);

swap(A[p],A[g]);

curr = g;

}

else if(A[p] < A[curr])

{

swap(A[p],A[curr]);

curr = p;

}

}

}

int main()

{

int n;

cout<<"enter the number of elements :-\n";

cin>>n;

int A[n];

cout<<"enter the elements of array :-\n";

for(int i=0;i<n;i++)

cin>>A[i];

int ind;

cout<<"enter the index value :- \n";

cin>>ind;

shift_up(A,n,ind);

cout<<"array after shift up :-\n";

for(int i=0;i<n;i++)

cout<<A[i]<<" ";

cout<<endl;

}

Explanation:

8 0
3 years ago
Other questions:
  • A 6cm OD, 2cm thick copper hollow sphere [k=386W/m.C] is uniformly heated at the inner surface at a rate of 150W/m2. The outside
    6·1 answer
  • HELP!
    8·1 answer
  • Make sure that the switch is on (if the drill is electric), the chuck key is not removed before you plug in the drill or turn it
    11·2 answers
  • The Cv factor for a valve is 48. Compute the head loss when 30 GPM of water passes through the valve.
    13·1 answer
  • The pressure forces on a submersed object will be (A)- Tangential to the objects body (B)- Parallel (C)- Normal (D)- None of the
    10·1 answer
  • A Water Amusement Park parking lot charges $24.00 minimum fee to park for up to 8 hours. The meter charges an additional $3.25 p
    5·2 answers
  • A signal containing both a 5k Hz and a 10k Hz component is passed through a low-pass filter with a cutoff frequency of 4k Hz. Wh
    9·1 answer
  • The host at the end of the video claims that ___________ is crucial to his success as a driver. A. Reaction time B. A safe space
    5·1 answer
  • Need help with these 3 ez questions pls help me will mark brainiest.
    15·1 answer
  • Christopher has designed a fluid power system that repeatedly gets clogs. Which of the following objects should he choose to add
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!