Execute the following code.* SAMPLE OF C PROGRAM TO USE LINKED LIST AND ADDING ELEMENT OR NODE AT THEBEGINNING OF THE LINKED-LIST*/#include #include int main (){//declare the structure of a nodestruct Node{int data;struct Node *next;};//declare other name for the struct Nodetypedef struct Node Node;Node *head, *curr,newptr;//initialize head to NULL;head= NULL;//declare control variable and variable to receive input valueint i, value; //instruct user for inputprintf ("\nEnter number to be inserted into linked list\n");7/loop to prompt user to enter three valuesfor (i=0; i<3; i++){printf("\nEnter a number: ");scanf ("%d", &value);newptr = (Node*) malloc (sizeof (Node)); //to create new nodenewptr ->data = value; //assign value to data fieldnewptr -> next=NULL; //assign NULL to next pointerif (head==NULL)//if there are no existing node (s) in the linked//list{head=newptr;//the new node//linked listесes the first node in the}else//otherwise (if there are node (s) already{//the new node will be inserted at the//beginning,//right before the existing first nodenewptr->next=head;head=newptr;//head pointer will get the address of the newnode}}printf("\n\nDisplay content of the linked list\n\n");curr = head; //initiliaze current pointer similar to the head pointer//using loop to access each node in the linked listwhile (curr!= NULL)printf ("\n%d", curr->data);//printf("\n%d", curr->next);curr = curr->next;if (curr==NULL)printf("\nNULL");

Execute the following code. /* SAMPLE OF C PROGRAM TO USE LINKED LIST AND ADDING ELEMENT OR NODE AT THE BEGINNING OF THE LINKED-LIST* / #include #include int main() { //declare the structure of a node struct Node { int data; struct Node *next; }; //declare other name for the struct Node typedef struct Node Node; Node *head, *curr, * newptr; //initialize head to NULL; head= NULL; //declare control variable and variable to receive input value int i, value;

Execute the following code. /* SAMPLE OF C PROGRAM TO USE LINKED LIST AND ADDING ELEMENT OR NODE AT THE BEGINNING OF THE LINKED-LIST* / #include #include int main() { //declare the structure of a node struct Node { int data; struct Node next; }; //declare other name for the struct Node typedef struct Node Node; Node head, curr, newptr; //initialize head to NULL; head= NULL; //declare control variable and variable to receive input value int i, value;

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

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.
//give the output of the following program and draw the link list. struct node{ int info; struct node *link;};typedef struct node *nodePTR;void insort(nodePTR*,struct Info);nodePTR getnode();int main(void){nodePTR p=NULL,head=NULL,save;inti; for(i=0;i<3;i++){ insort (&head,i+5);}save=head;do{ printf("%d",save->info); save=save->link;}while(save!=NULL); return0;}nodePTR getnode(){nodePTR q;q=(nodePTR)malloc(sizeof(struct node));return q;}void insort(NODEPTR *head , int x){ NODEPTR p,q,r; q=NULL; for(p=*head; p!=NULL &&x>p->info; p=p->link) q=p; if(q=NULL) { p=getnode(); p->info=x; p->link=head; head=p; }else{ r=getnode(); q->link=r; r->info=x; r->link=p; }}
cout<<"List after isolation: "; display(head);.
#include <bits/stdc++.h> using namespace std; // Structure of a Node struct Node { int data;s struct Node *next; struct Node *prev; }; // Function to insert at the end void insertEnd(struct Node** start, int value) { // If the list is empty, create a single node // circular and doubly list if (*start == NULL) { struct Node* new_node = new Node; new_node->data = value; new_node->next = new_node->prev = new_node; *start = new_node; return; } // If list is not empty /* Find last node */ Node *last = (*start)->prev; // Create Node dynamically struct Node* new_node = new Node; new_node->data = value; // Start is going to be next of new_node new_node->next = *start; // Make new node previous of start (*start)->prev = new_node; // Make last preivous of new node new_node->prev = last; // Make new node next of old last last->next = new_node; } // Function to insert Node at the beginning // of the List, void insertBegin(struct…
3. What does the following function do for a given Linked List with first node as head? void fun1(struct node* head) { if(head fun1(head->next); printf("%d ", head->data); } NULL) return; == displays all the nodes of the linked list displays alternate nodes of the linked list displays all the nodes of the linked list in reverse order displays alternate nodes of the linked list in reverse order
Multiple choice in data structures void doo(node<int>*root){ if(root !=0) { node<int>*p=root; while(root->next!=0) root=root->next; p->data=root->data; } What is this code do? a. swap the first item with the last item in the linked list b. set the first item in the linked list as the last item c. doesn't do anything because the root parameter is passed by value d. change the root item in the binary tree with the farthest leaf item
struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };
struct insert_at_back_of_dll { // Function takes a constant Book as a parameter, inserts that book at the // back of a doubly linked list, and returns nothing. void operator()(const Book& book) { / // TO-DO (2) |||| // Write the lines of code to insert "book" at the back of "my_dll". // // // END-TO-DO (2) ||| } std::list& my_dll; };
Complete the following missing code: void insert_after(int key, int value) { node *myNode =new node; myNode=head; int flag = 0; while(myNode!=NULL) { } if(flag==0) cout<
Ocaml Mode Write a function mode : ’a list -> ’a = that given a (nonempty) list it returns an element that repeats the most times (if ties exist, return the element among them that appears first in the list). examples mode [1;2;1;4;2;5;1;2;6];; - : int = 1 mode [’a’;’b’;’c’;’b’;’a’;’b’;’d’;’c’;’d’];; - : char = ’b’
1. Start with analysing the problem by using a flowchart/pseudo code. 2. As mention above, build a C++ program based on the appropriate method/function. You are free to create your own menu and display. Consider the following case: You have been appointed as a teacher of 3 Gemilang class in SMK Tanjung Malim. Please create a program that can keep the name list of your students in the class. The list must consist of two lists, first list is for all female student's names and the second list is for all male student's names. You must also provide the list of all the student's name. In order to do that, you need to merge both of the list together. The name in the list needs to be sorted alphabetically. The program must consist of the following method function: a) menu() – as interface for the user b) add list(string) – to add name to the list c) sort list() – to sort the name in the list d) show list) – to display the lists e) search list(string) – to search a name in the list ) merge…
Please code in C language. Please use the starter code to help you solve the deleted node and the reverse list. Here is the starter code: #include <stdio.h> #include <ctype.h> #include <stdlib.h> #include <string.h> #include "linkedlist.h" // print an error message by an error number, and return // the function does not exit from the program // the function does not return a value void error_message(enum ErrorNumber errno) { char *messages[] = { "OK", "Memory allocaton failed.", "Deleting a node is not supported.", "The number is not on the list.", "Sorting is not supported.", "Reversing is not supported.", "Token is too long.", "A number should be specified after character d, a, or p.", "Token is not recognized.", "Invalid error number."}; if (errno < 0 || errno > ERR_END) errno = ERR_END; printf("linkedlist: %s\n", messages[errno]); } node *new_node(int v) { node *p =…