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
mars1129 [50]
3 years ago
11

Describe a simple process

Engineering
1 answer:
Sunny_sXe [5.5K]3 years ago
8 0

Answer:

Use linking words.

Explanation:

You might be interested in
Refers to the capability to keep moving forward on a specified grade.
Mademuasel [1]

Answer:

maneuverability

Explanation:

needless to say, I took the quiz

6 0
3 years ago
Using Java..
uysha [10]

Answer:

The source code files for this question have been attached to this response.

Please download it and go through each of the class files.

The codes contain explanatory comments explaining important segments of the codes, kindly go through these comments.

Download java
<span class="sg-text sg-text--link sg-text--bold sg-text--link-disabled sg-text--blue-dark"> java </span>
<span class="sg-text sg-text--link sg-text--bold sg-text--link-disabled sg-text--blue-dark"> java </span>
<span class="sg-text sg-text--link sg-text--bold sg-text--link-disabled sg-text--blue-dark"> java </span>
<span class="sg-text sg-text--link sg-text--bold sg-text--link-disabled sg-text--blue-dark"> java </span>
<span class="sg-text sg-text--link sg-text--bold sg-text--link-disabled sg-text--blue-dark"> java </span>
7 0
3 years ago
The value of Rth is *
Vladimir79 [104]
Johnjjjjjjhhhhhhhhjjjjjjjjjjj
4 0
2 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
1. A rectangular fish tank measures 1.5 meters by 2 meters by 20 cm. When it is filled with water, how many kilograms will the w
chubhunter [2.5K]
20kg I’m pretty sure
7 0
3 years ago
Other questions:
  • In addition to bandages and gauze, it's recommended that a first aid kit also contain ___________. A) A finger splintB) Portable
    9·1 answer
  • Using the data from the table, what is P(3)?!
    9·1 answer
  • What building codes did Mega Corporation fail to follow?
    9·1 answer
  • An ideal Rankine cycle with reheat uses water as the working fluid. The conditions at the inlet to the first-stage turbine are p
    12·1 answer
  • The notation on one's license that the person must wear glasses
    9·1 answer
  • Coving is a curved edge between a floor and a wall.<br> O True<br> O False
    13·2 answers
  • 8. What is the purpose of the 300 Log?
    12·1 answer
  • In a morphological matrix, which of the following contains the parameters that are essential to a design?
    7·1 answer
  • Derive the expression ε=ln(1+e), where ε is the true strain and e is the engineering strain. Note that this expression is not va
    14·1 answer
  • A ___ is a type of purlin used as a horizontal stiffener between columns around the perimeter of a building.
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!