Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Sub IIES() Dim i As Integer Dim f As String Dim exactf As String Range(\"B13:F65

ID: 3813816 • Letter: S

Question

Sub IIES()
Dim i As Integer
Dim f As String
Dim exactf As String
Range("B13:F65536").Clear

Range("B13:F65536").HorizontalAlignment = xlCenter

'Label x0, y0, xn
Cells(5, 2) = Cells(4, 3) & "0"
Cells(5, 2).Characters(Start:=2, Length:=2).Font.Subscript = True Cells(5, 3) = Cells(4, 4) & "0"
Cells(5, 3).Characters(Start:=2, Length:=2).Font.Subscript = True Cells(5, 7) = Cells(4, 3) & "n"
Cells(5, 7).Characters(Start:=2, Length:=2).Font.Subscript = True

'Label f(x,y)
Cells(7, 3) = "f(" & Cells(4, 3) & "," & Cells(4, 4) & ")"

'i0, x0, y0
Cells(13, 2) = 0

Cells(13, 3) = Cells(6, 2)

Cells(13, 4) = Cells(6, 3)

'column i, x
For i = 1 To Cells(6, 9)

Cells(13 + i, 2) = 0 + i

Cells(13 + i, 3) = Cells(12 + i, 3) + Cells(6, 8)

Next i

'column y
For i = 1 To Cells(6, 9)

f = Replace(Cells(7, 4), Cells(4, 4), Cells(12 + i, 4))

Cells(13 + i, 4) = Round(Cells(12 + i, 4) + Cells(6, 8) * Evaluate(Replace(f, Cells(4, 3), Cells(12 + i, 3))), Cells(7, 12))
Next i

'column exact y
For i = 1 To (Cells(6, 9) + 1)

exactf = Replace(Cells(6, 4), Cells(4, 4), Cells(12 + i, 4))

Cells(12 + i, 5) = Round(Evaluate(Replace(exactf, Cells(4, 3), Cells(12 + i, 3))), Cells(7, 12))

Next i

'|error|
For i = 1 To (Cells(6, 9) + 1)

Cells(12 + i, 6) = Abs(Cells(12 + i, 5) - Cells(12 + i, 4))

Next i

Range(Cells(13, 2), Cells(13 + Cells(6, 9), 6)).Borders.LineStyle = xlContinuous

Range(Cells(13, 2), Cells(13 + Cells(6, 9), 6)).ShrinkToFit = True

Range(Cells(13, 2), Cells(13 + Cells(6, 9), 6)).Interior.Color = RGB(255, 150, 150)

End Sub

A B EULER SPREADSHEET CALCULATOR 4 Variables t Exact 6 0 0 10/2501 Cos (100 t)+500/250 0.05 0.01 f(t,i) 20 cos (100 t-2 i Type your data in yellow cells. APPLY 4D Accuracy 10 k t i Exact lErrorl 12 13 0.01 14 0.2 0.1665 0.0335 2 41 15 0.02 0.3041 0.1763 0.1278 3 16 0.03 0.2148 0.0205 0.1943 17 4 004 0.0125 -0.1576 0.1701 5 18 0.05 -0.1185 -0.1942 0.0757 i

Explanation / Answer

#include <stdio.h>
#include <stdlib.h>

struct btnode
*root = NULL, *temp = NULL, *t2, *t1;

void delete1();
void insert();
void delete();
void inorder(struct btnode *t);
void create();
void search(struct btnode *t);
void preorder(struct btnode *t);
void postorder(struct btnode *t);
void search1(struct btnode *t,int data);
int smallest(struct btnode *t);
int largest(struct btnode *t);

int flag = 1;

void main()


/* To create a node */
void create()


/* recursive function to perform inorder traversal of tree */
void inorder(struct btnode *t)

else if ((data < t->value))
  
else if ((data==t->value))
  
}

/* To delete a node */
void delete1(struct btnode *t)

else
  
t = NULL;
free(t);
return;
}

/* To delete node having one left hand child */
else if ((t->r == NULL))
  
else if (t1->l == t)
  
else
  
t = NULL;
free(t);
return;
}

/* To delete node having manus kid */
else if (t->l == NULL)
  
else if (t1->r == t)
t1->r = t->r;
else
t1->l = t->r;
t == NULL;
free(t);
return;
}

/* To delete node having 2 kid */
else if ((t->l != NULL) && (t->r != NULL))
  
else
  
search1(root, k);
t->value = k;
}

}

/* to search out the littlest part within the right sub tree */
int smallest(struct btnode *t)

else
come (t->value);
}

/* to search out the biggest part within the left sub tree */
int largest(struct btnode *t)

else
return(t->value);
}