C Programming LanguageIf you have the following node declaration:Homework 3struct Node {int number;struct Node * next;};typedef struct Node node;node *head,*newNode;Write a C program that contains the following functions to manipulate this linked list :1. First function: Adding the odd numbers to the beginning of the list and even numbers to theend of the list until -1 is entered from keyboard.2. Second function using given prototype below. This function cuts the last node of the list andadds it to the beginning as first node. It takes beginning address of the list as a parameter andreturns the updated list.node* cutlastaddhead(node* head);3. 3rd function deletes the element in the middle of the list (free this memory location) (if the listhas 100 or 101 elements, it will delete the 50th element). The function will take a list as aparameter and return the updated list.4. 4th function named changeFirstAndLast that swaps the node at the end of the list and thenode at the beginning of the list. The function will take a list as a parameter and return theupdated list.5. 5th function using given prototype below. This function cuts the first node of the list and addsit to the end as last node. It takes beginning address of the list as a parameter and returns theupdated list.node* cutheadaddlast(node* head); If you have the following node declaration:struct Node {int number;struct Node * next;};typedef struct Node node;node *head,*newNode;Write a C program that contains the following functions to manipulate this linked list :1. First function: Adding the odd numbers to the beginning of the list and even numbers to theend of the list until -1 is entered from keyboard.2. Second function using given prototype below. This function cuts the last node of the list andadds it to the beginning as first node. It takes beginning address of the list as a parameter andreturns the updated list.node* cutlastaddhead(node* head);3. 3rd function deletes the element in the middle of the list (free this memory location) (if the listhas 100 or 101 elements, it will delete the 50th element). The function will take a list as aparameter and return the updated list.4. 4th function named changeFirstAndLast that swaps the node at the end of the list and thenode at the beginning of the list. The function will take a list as a parameter and return theupdated list.5. 5th function using given prototype below. This function cuts the first node of the list and addsit to the end as last node. It takes beginning address of the list as a parameter and returns theupdated list.node* cutheadaddlast(node* head);

In this question we have to write a program for linked list. The definition of the function given…

C Programming Language If you have the following node declaration: Homework 3 struct Node { int number; struct Node * next; }; typedef struct Node node; node head,newNode; Write a C program that contains the following functions to manipulate this linked list : 1. First function: Adding the odd numbers to the beginning of the list and even numbers to the end of the list until -1 is entered from keyboard. 2. Second function using given prototype below. This function cuts the last node of the list and adds it to the beginning as first node. It takes beginning address of the list as a parameter and returns the updated list. node* cutlastaddhead(node* head); 3. 3rd function deletes the element in the middle of the list (free this memory location) (if the list has 100 or 101 elements, it will delete the 50th element). The function will take a list as a parameter and return the updated list. 4. 4th function named changeFirstAndLast that swaps the node at the end of the list and the node at the beginning of the list. The function will take a list as a parameter and return the updated list. 5. 5th function using given prototype below. This function cuts the first node of the list and adds it to the end as last node. It takes beginning address of the list as a parameter and returns the updated list.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.5: Case Studies

Problem 3E

See similar textbooks

Related questions

Question

100%

C Programming Language

If you have the following node declaration:
Homework 3
struct Node {
int number;
struct Node * next;
};
typedef struct Node node;
node *head,*newNode;
Write a C program that contains the following functions to manipulate this linked list :
1. First function: Adding the odd numbers to the beginning of the list and even numbers to the
end of the list until -1 is entered from keyboard.
2. Second function using given prototype below. This function cuts the last node of the list and
adds it to the beginning as first node. It takes beginning address of the list as a parameter and
returns the updated list.
node* cutlastaddhead(node* head);
3. 3rd function deletes the element in the middle of the list (free this memory location) (if the list
has 100 or 101 elements, it will delete the 50th element). The function will take a list as a
parameter and return the updated list.
4. 4th function named changeFirstAndLast that swaps the node at the end of the list and the
node at the beginning of the list. The function will take a list as a parameter and return the
updated list.
5. 5th function using given prototype below. This function cuts the first node of the list and adds
it to the end as last node. It takes beginning address of the list as a parameter and returns the
updated list.
node* cutheadaddlast(node* head);

If you have the following node declaration:
struct Node {
int number;
struct Node * next;
};
typedef struct Node node;
node *head,*newNode;
Write a C program that contains the following functions to manipulate this linked list :
1. First function: Adding the odd numbers to the beginning of the list and even numbers to the
end of the list until -1 is entered from keyboard.
2. Second function using given prototype below. This function cuts the last node of the list and
adds it to the beginning as first node. It takes beginning address of the list as a parameter and
returns the updated list.
node* cutlastaddhead(node* head);
3. 3rd function deletes the element in the middle of the list (free this memory location) (if the list
has 100 or 101 elements, it will delete the 50th element). The function will take a list as a
parameter and return the updated list.
4. 4th function named changeFirstAndLast that swaps the node at the end of the list and the
node at the beginning of the list. The function will take a list as a parameter and return the
updated list.
5. 5th function using given prototype below. This function cuts the first node of the list and adds
it to the end as last node. It takes beginning address of the list as a parameter and returns the
updated list.
node* cutheadaddlast(node* head);

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 7 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.