HELLO! HOW DO I ADD/ INSERT NEW NODE AFTER THE NODE(DATA) OR ADDING A NODE AFTER VALUE BASED ON THIS C PROGRAMWRITE ME A NEW CODE FOR THE TASK PLEASE. THANK YOU Adding of New Node at the Start.cHinclude Hinclude struct node {int data;struct node *next;}*head;void creation (int n);add (int data);void display();101112int main()13141516int n, data;printf("\n***** This program shows the List of your Daily Expenses *****\n");printt("\nHow many expenses do you want to input? ");scant ("%d", 8n);creation(n);171819202122printt("\n" "\tList of Daily Expenses \n");display();2324printf("\n\nEnter the amount you want to insert at the start of the list: PHP ");scanf ("zd", adata);add (data);252627282930printf("\n" "\tUpdated List of Daily Expenses \n");display();3132return e;33343536void creation (int n)struct node *newNode, *temp;int data, i;37383940head = (struct node *)malloc(sizeof(struct node));if(head == NULL)41I printt("Unable to allocate memory.");4445else46printf("\nEnter the amount for your daily expenses no. 1: PHP ");scant ("sa", sdata);474849se5152head ->data = data;head->next = NULL;temp = head;53for (i=2; ic=n; i++)newNode = (struct node *)malloc (sizeof (struct node));if(newNode == NULL)58596e61print+("Unable to allocate memory.");break;62elseprintt("Enter the amount for your daily expenses no. Xd: PHP ", 1); printf("Enter the amount for your daily expenses no. %d: PHP ", 1);scanf ("a", 8data);646566newNode - >data = data;6768newNode ->next = NULL;%3D6970temp ->next = newNode;temp = temp->next;717273747576void add(int data)7778struct node *neNode;newNode = (struct node*)malloc (sizeof (struct node));79se8182if(newNode - NULL)8384printt("Unable to allocate memory.");else85868788newNode - >data = data;newNode - >next = head;head = newNode;89se9192void display()939495struct node *temp ;969798if(head == NULL)99100I printf("The Daily Expenses List is empty.");else101102103104temp = head;while(temp i= NULL)105106printt("\tDaily Expenses = PHP Xa\n", temp->data);temp = temp->next;10710810911e

program: #include<stdio.h> #include<stdlib.h> struct node { int data;…

Answered: HELLO! HOW DO I ADD/ INSERT NEW NODE…

Engineering

Computer Science

HELLO! HOW DO I ADD/ INSERT NEW NODE AFTER THE NODE(DATA) OR ADDING A NODE AFTER VALUE BASED ON THIS C PROGRAM

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Question #2: Study the following C program and answer the below questions Hint: you might run it in Dev C++ before starting answering the questions! a) Show a sample output of the program. b) Extract a function declaration (prototype) for: 1) void functions with void argument 2) void function with a single input argument 3) function with a single input argument and return 4) a recursive function c) What is the difference between normal functions and recursive functions? d) How many times are the function print_stars() called in the program? (mention the line number of each call).
#include #include #include #define SIZE 5 int nums [SIZE] = [5,0,6,1,2); int main() { int i; pid_t pid; pid= fork(); if (pid == 0) { for (i = 0; i 0) { wait (NULL); } for (i = 0; i < SIZE; i++) printf("PARENT: %d\n", nums [i] + 1); /* LINE Y */ return 0; From the above-given program, please state what will be the output at lines X and Y. Explanation in detail required for output at both lines X and Y.
Multiples(): Takes an int (n) as parameter and prints first 10 multiples n in a single line using for loop. Example: 5 5,10,15,20,25,30,35,40,45,50 class Main {public static void main(String[] args) {}}
int FindSmallestVal() { int num = 0, min = 0; // reads num until the num > 0 while (num <= 0) { cin >> num; // finds the min value in the min,num min = num < min ? num : min; } // returns min return min; }
2. int count(1); while(count <5) { } --count; std::cout << count << endl; Maal
Double trouble def double_trouble(items, n): Suppose, if just for the sake of argument, that the following operation is repeated n times for the given list of items: remove the first element, and append that same element twice to the end of items. Which one of the items would be removed and copied in the last operation performed?Sure, this problem could be finger-quotes “solved” by actually performing that operation n times, but the point of this exercise is to come up with an analytical solution to compute the result much faster than actually going through that whole rigmarole. To gently nudge you towards thinking in symbolic and analytical solutions, the automated tester is designed so that anybody trying to brute force their way through this problem by performing all n operations one by one for real will run out of time and memory long before receiving the answer, as will the entire universe.To come up with this analytical solution, tabulate some small cases (you can implement the…
Double trouble def double_trouble(items, n): Suppose, if just for the sake of argument, that the following operation is repeated n times for the given list of items: remove the first element, and append that same element twice to the end of items. Which one of the items would be removed and copied in the last operation performed? Sure, this problem could be finger-quotes “solved” by actually performing that operation n times, but the point of this exercise is to come up with an analytical solution to compute the result much faster than actually going through that whole rigmarole. To gently nudge you towards thinking in symbolic and analytical solutions, the automated tester is designed so that anybody trying to brute force their way through this problem by performing all n operations one by one for real will run out of time and memory long before receiving the answer, as will the entire universe. To come up with this analytical solution, tabulate some small cases (you can implement the…
Python: 2048 games Board = list[list[str]]# Checks whether a given board has any# possible move left. If no more moves,# return True. Otherwise return False.def isGameOver(board: Board) -> bool:return False# Returns a tuple (changed, new_board)# where:# changed - a boolean indicating if# the board has changed.# new_board - the board after the user# presses the 'Up' key.def doKeyUp(board: Board) -> tuple[bool, Board]:return False, board# Returns a tuple (changed, new_board)# where:# changed - a boolean indicating if# the board has changed.# new_board - the board after the user# presses the 'Down' key.def doKeyDown(board: Board) -> tuple[bool, Board]:return False, board# Returns a tuple (changed, new_board)# where:# changed - a boolean indicating if# the board has changed.# new_board - the board after the user# presses the 'Left' key.def doKeyLeft(board: Board) -> tuple[bool, Board]:return False, board# Returns a tuple (changed, new_board)# where:# changed - a boolean…
Alphabet Random Walk• Write a program to generate a random walk that spans a 10*10 character array (The initial values of the elements are all.). The program must randomly walk from one element to another, moving one element position up, down, left or right each time. The elements that have been visited are labeled with the letters A through Z in the order in which they were visited
73% void showLinked() Linked_List "p; p=List; while(pl=NULL) { coutname agephoneN0ID_NOnext; cout>k; for(int i=0;i>nam; couts>ag: cout>ph: couts>id; InserFront(nam,ag.ph,id); coutsd; for (int i=0;i
Q: Convert this to sorted array #include<iostream> #include"Student.cpp" class StudentList { private: struct ListNode { Student astudent; ListNode *next; }; ListNode *head; public: StudentList(); ~StudentList(); int IsEmpty(); void Add(Student newstudent); void Remove(); void DisplayList(); }; StudentList::StudentList() { head=NULL; }; StudentList::~StudentList() { cout <<"\nDestructing the objects..\n"; while(IsEmpty()!=0) Remove(); if(IsEmpty()==0) cout <<"All students have been deleted from a list\n"; }; int StudentList::IsEmpty() { if(head==NULL) return 0; else return 1; }; void StudentList::Add(Student newstudent) { ListNode *newPtr=new ListNode; if(newPtr==NULL) cout <<"Cannot allocate memory"; else { newPtr->astudent=newstudent; newPtr->next=head; head=newPtr; } }; void StudentList::Remove() { if(IsEmpty()==0) cout <<"List empty on remove"; else { ListNode *temp=head;…
#include <stdio.h>#include <string.h>#define SIZE 6struct Student{char name[50];int id;float mark;};int Search1(char input[], struct Student data[]);int Search2(int input, struct Student data[]);int main() {char search_name[30];int search_id;int result1, result2;struct Student list[SIZE] = {{"Amylia", 544199, 75.4},{"Cheong", 143566, 92.3},{"Harry", 109774, 65.5},{"Krishnan", 334514, 86.7},{"Melissa", 257890, 55.4},{"Timothy",144656, 77.8}};printf("Enter Student Name: ");gets(search_name);result1 = Search1(search_name, list);//Answer for part (a)(ii) – Display the matching index of result1printf("Enter Student ID: ");scanf("%d",&search_id);result2 = Search2(search_id,list);//Answer for part (a)(iii)- Display the matching index of result2return 0;}//Answer for part (a)(i) – function definition for Search1//Answer for part (a)(iii) – function definition for Search2