Someone please help ASAP!!!!! This is in Python! Beautiful people help please Th

Question

Someone please help ASAP!!!!! This is in Python! Beautiful people help please

Thank you, thank you, thank you very much

gamma = 0.736190574589610
u0 = 1.0
t0 = 0.0
t_end = 20.0/gamma

Now let's solve the ordinary differential equation du/dt = -gamma u with gamma > 0. The solution is u(t) = u_0 e^gamma t, where u_0 = u(t = 0). As t rightarrow infinity, u rightarrow 0. We can use forward Euler: u(t + h) = u(t) + h du/dt|_t = u(t) - h gamma u(t) = u(t)[1 - h gamma]. In our iteration, u_n+1 = u_n (1 - h gamma). Click in the cell below, and then run it (shift-enter). If it prints gamma = followed by a number and t end = followed by a number, then the variables gamma and t end are defined and you can use them. Otherwise, go back to the top of the notebook and rerun the first cell. [2]: try: print('gamma = {0:6.4f}'format(gamma)) print('t end = {0:6.4f}'.format(t end)) except: print('You did not run the first cell') gamma = 0.7362 t end = 27.1669 Write a function to perform the iteration u_n+1 = (1 - h gamma)u_n, t_n+1 = t_n + h Use starting values u_0 = 1, t_0 = 0. Take enough steps to reach t_end = 20/gamma, and store the intermediate values of t_n, u_n. This function should take step size h as a parameter. []: # code for exercise 1.1 goes here Use the function from Exercise 1.1 to integrate for h = 0.3/gamma, 0.9/gamma, 1.5/gamma, 2.1/gamma. For each h, make a plot of u_n versus t_n, along with the exact solution u_n = u_0 e^-gamma t_n. []: # code for plot with h = 0.3/gamma goes here []: # code for plot with h = 0.9/gamma goes here []: # code for plot with h 1.5/gamma goes here []: # code for plot with h = 2.1/gamma goes here

Explanation / Answer

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

struct node
;
typedef struct node n;

n* create_node(int);
void add_node();
void insert_at_first();
void insert_at_end();
void insert_at_position();
void delete_node_position();
void sort_list();
void update();
void search();
void display_from_beg();
void display_in_rev();

n *new, *ptr, *prev;
n *first = NULL, *last = NULL;
int variety = 0;

void main()
come new;
}
/*
*ADDS NEW NODE
*/
void add_node()
next = new;
new->prev = last;
last = new;
last->next = first;
first->prev = last;
" id="tip_19">
}
/*
*INSERTS part initially
*/
void insert_at_first()
currently new node is inserted however at first");
initial = last = new;
first->next = last->next = NULL;
first->prev = last->prev = NULL;
}
else
  
}
/*
*INSERTS THE part AT GIVEN POSITION
*/
void insert_at_position()
{
int info, pos, len = 0, i;
n *prevnode;

printf(" enter the worth that you simply would love to insert:");
scanf("%d", &info);
printf(" enter the position wherever you have got to enter:");
scanf("%d", &pos);
new = create_node(info);

if (first == last && initial == NULL)
{
if (pos == 1)
{
initial = last = new;
first->next = last->next = NULL;
first->prev = last->prev = NULL;
}
else
printf(" empty coupled list you cant insert at that specific position");
}
else
  
}
}
for (ptr = initial, i = 0;i < number;ptr = ptr->next,i++)
printf(" %d", ptr->val);
}
}
/*
*DELETION is completed
*/
void delete_node_position()
zero, key, i, f = 0;

printf(" enter the worth to be searched:");
scanf("%d", &key);

if (first == last && initial == NULL)
printf(" list is empty no elemnets in list to search");
else
{
for (ptr = initial,i = 0;i < number;i++,ptr = ptr->next)
{
count++;
if (ptr->val == key)
{
printf(" the worth is found at position at %d", count);
f = 1;
}
}
if (f == 0)
printf(" the worth isn't found in linkedlist");
}
}
/*
*DISPLAYING IN starting
*/
void display_from_beg()
{
int i;
if (first == last && initial == NULL)
printf(" list is empty no elemnts to print");
else
{
printf(" %d variety of nodes square measure there", number);
for (ptr = initial, i = 0;i < number;i++,ptr = ptr->next)
printf(" %d", ptr->val);
}
}
/*
* DISPLAYING IN REVERSE
*/
void display_in_rev()
{
int i;
if (first == last && initial == NULL)
printf(" list is empty there aren't any elments");
else
  

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.