Question4 (Linked List):1. Given the attached program code, answer the following:(a) Match each function name with its task.Function NameTaskF1Insert a node at the front of the list.F2Insert a node after a given node.F3Delete a node in a specific position.F4Insert a node at the end of the list.F5Create the first node in the list.F6Display all the nodes of the list.(b) What is the result of program execution with the data given in main().(c) Write a function to count the number of nodes in the list. The program code:#include // ***** F5 ****using namespacestd; struct Nodeint data;void F5 (int value, int position){* curr,*newNode,*succ, *head;newNode = new Node;newNode->data = value;newNode->next = NULL;Node*pred,Node* next;};// ***** F1 ****void F1 ( int n){Node *head%3new Node;head->data = n;curr=head;for (int i=1;i<=position; i++)head->next =NULL; }{pred=curr; curr = curr->next; }curr=head;// ***** F2 ****void F2 (int value)for (int i=1;i<=position+1;i++){succ=curr; curr = curr->next;}pred->next=newNode;= succ;Node *newNode, *head, *curr;newNode = new Node;newNode-newNode->next>data = value;newNode->next =NULL;if (head=-NULL)// ***** F6 ****head = newNode;F6(intelseposition)Node{ curr = head;while{*curr, *pred, *succ, *head;curr=head;(curr->next!=NULL)if (position==1){curr = curr->next; head%3curr;}curr = curr->next;curr->next = newNode;else{for (int i=1;i<=position-1;i++){pred=curr;curr curr->next; }curr=head;// ***** F3 ****void F3 (){Node *curr;Node*head;while (curr!=NULL){coutfor (int i=1;i<=position+1;i++)(succ=curr;curr = curr->next;}pred->next = succ;curr = head;くくcurr->dataくく->";currcurr->next;// ***** main**** int main ()coutくく"NULL";cout <<endl;{ F1 (5); F2 (10);F2 (15) ; F2 (20);F2 (25); F4 (-20);F3 () ;F5 (500, 3); F3 ();F5 (600,3); F3 ();F6 (1); F3 ();F6 (1); F3 ();F6 (4); F3 ();return 0;// **** * F4 ****void F4 (int value){ Node *newNode, *head,* curr;newNode = new Node;newNode->data = value;newNode->next = NULL; if(head!=NULL)>next=head;newNode-head=newNode;

All the 3 subparts of this question are solved below.

Answered: 1. Given the attached program code,…

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 1VE

See similar textbooks

Similar questions

struct Node { int data; Node * next; }; Node • head; a. Write a function named addNode that takes in a variable of type int and inserts it at the head of the list. b. Write a function named removeNode that removes a node at the head of the list.
22. A pointer variable whose sole purpose is to locate the first node in a linked list is called b. the node's link a. the list's top c. the list's link d. the list's head
Q3 Racket Number Function Suppose that into the Racket evaluator we enter the definition: (define dozen 12) Give the value of the Racket expression: (number? dozen). Note that the value should be consistent with the Racket language. Enter your answer here Save Answer Q4 Racket Empty Lists Give two ways to write a Racket expression of which the value is a one-element list with the empty list as its element. Enter your answer here Save Answer
The function that will a single items to the list is Oextend (...) Oadd(...) Oappend(...) Olengthen(...)
card_t * moveCardBack (card t *head); The moveCardBack function will take the card in front of the pile and place it in the back. In coding terms, you are taking the head of the linked list and moving it to the end. The function has one parameter which is the head of the linked list. After moving the card to the back, the function returns the new head of the linked list.
HELP Write C code that implements a soccer team as a linked list. 1. Each node in the linkedlist should be a member of the team and should contain the following information: What position they play whether they are the captain or not Their pay 2. Write a function that adds a new members to this linkedlist at the end of the list.
Write a function in_list that will take as its parameters an input list called mylist and a number. If the number is in the list the function should retun true, ottherwise, it should retun false. def in_list(mylist,number):
struct nodeType { int infoData; nodeType * next; }; nodeType *first; … and containing the values(see image) Using a loop to reach the end of the list, write a code segment that deletes all the nodes in the list. Ensure the code performs all memory ‘cleanup’ functions.
struct node{ int a; struct node * nextptr; }; Write two functions. One for inserting new values to a link list that uses the given node structure. void insert(struct node **head, int value); Second function is called to count the number of even numbers in the link list. It returns an integer that represents the number of even numbers. int countEvenNumbers(struct node *head); Write a C program that reads a number of integers from the user and insert those integers into a link list (use insert function). Later pass the head pointer of this link list to a function called countEvenNumbers. This function counts and returns the number of even numbers in the list. The returned value will be printed on the screen. Note 1: Do not modify the function prototypes. Sample Input1: Sample Output1: 45 23 44 12 37 98 33 35 -1 3 Sample Input2: Sample Output2: 11 33 44 21 22 99 123 122 124 77 -1 4
Domino cycledef domino_cycle(tiles):A single domino tile is represented as a two-tuple of its pip values, such as (2,5) or (6,6). This function should determine whether the given list of tiles forms a cycle so that each tile in the list ends with the exact same pip value that its successor tile starts with, the successor of the last tile being the first tile of the list since this is supposed to be a cycle instead of a chain. Return True if the given list of domino tiles form such a cycle, and False otherwise. tiles Expected result [(3, 5), (5, 2), (2, 3)] True [(4, 4)] True [] True [(2, 6)] False [(5, 2), (2, 3), (4, 5)] False [(4, 3), (3, 1)] False
6. A code segment is intended to transform the list utensils so that the last element of the list is moved to the beginning of the list. For example, if utensils initially contains ["fork", "spoon", "tongs", "spatula", "whisk"], it should contain ["whisk", "fork", "spoon", "tongs", "spatula"] after executing the code segment. Which of the following code segments transforms the list as intended? len + LENGTH(utensils) len LENGTH(utensils) REMOVE (utensils, len) temp utensils[len] REMOVE (utensils, len) APPEND(utensils, temp) temp utensils[len] entd INSERT (utensils, 1, temp) a. C. len + LENGTH(utensils) len + LENGTH(utensils) temp - utensils[len] REMOVE (utensils, len) INSERT(utensils, 1, temp) b. REMOVE (utensils, len) temp utensils[len] APPEND(utensils, temp) 4.
The mapped list pattern Our second pattern is the mapped list pattern, described in video 4 3 mapped list pattern. Often we need to write a function that takes a list as a parameter and returns a new list in which each item in the original list is "mapped" to a new item in the result list. For example, the following function takes a list of numbers as a parameter and returns a list of all the numbers squared, e.g. squares ( [1, 3, 7]) returns [1, 9, 49]. def squares (nums): "Returns the squares of the given numbers""" result = [] for num in nums: result.append (num * num) return result Although this is just a special case of the accumulator pattern, it is so common that we give it its own name: the mapped list pattern. Consider the following function: def squares(nums): ""Returns the squares of the given numbers""" result = [] for num in nums: result.append (num * num) return result If the main program calls print(squares ( [5, -3, 2, 7]) what is the state table for the function…

SEE MORE QUESTIONS

Recommended textbooks for you

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

SEE MORE TEXTBOOKS