EBK STARTING OUT WITH C++
9th Edition
ISBN: 9780134996066
Author: GADDIS
Publisher: PEARSON CUSTOM PUB.(CONSIGNMENT)
expand_more
expand_more
format_list_bulleted
Question
Chapter 18, Problem 28RQE
Program Plan Intro
Linked list:
Linked list is a linear and dynamic data structure which is used to organize data; it contains sequence of elements which are connected together in memory to form a chain. The every element of linked list is called as a node.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Computer Science
lab3.h
-------------
#include<stdio.h>
#include<stdlib.h>
#ifndef LAB3_H
#define LAB3_H
// A linked list node
struct Node
{
int data; //Data
struct Node *next; // Address to the next node
};
//initialize: create an empty head node (whose "data" is intentionally missing); This head node will not be used to store any data;
struct Node *init () {
//create head node
struct Node *head = (struct Node*)malloc(sizeof(struct Node));
}
//Create a new node to store data and insert it to the end of current linked list; the head node will still be empty and data in the array in "main.c" are not stored in head node
void insert(struct node *head, int data) {
struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));
new_node->data = data;
new_node->next= head;
}
//print data for all nodes in the linked list except the head node (which is empty)
void display (struct Node *head) {
struct Node *current_node = head;
while ( current_node != NULL) {
printf("%d ",…
File System: It is highly useful in file system handling where for example
the file allocation table contains a sequential list of locations where the files
is split up and stored on a disk. Remember that overtime it is hard for an
OS to find disk space to cover the entire file so it usually splits these up into
chunks across the physical hard drive and stores a sequential list of links
together as a linked list.
Write an algorithm for the above problem and analyse the efficiency of
the algorithm.
1
Singly Linked List
A linked list is a data structure where elements are connected to form a chain where each node points to
the next one in the order.
Exercise:
Given the code of the Node struct, implement a singly linked list with the following functionalities:
• addFront: add an integer key to the front of the list.
• remove: deletes the smallest number larger than or equal the passed integer and returns the deleted
value. If no number is found, returns -1.
All cases must be handled. You can define any helper method as needed.
#include
#include
#define INF INT_MAX // indicates infinity value
using namespace std;
struct Node
int key;
Node next;
Node(int key)
{
this->key - key;
this->next- NULL;
};
class SinglyLinkedList
public:
SinglyLinkedList ()
head - NULL;
void addFront (Node* node)
1
int remove(int val)
{
private:
Node head;
};
int main()
{
SinglyLinkedList sLL - neu SinglyLinkedList ();
Node* nodel = new Node (5);
Node node2 - neu Node (13);
Node node3 - nev Node(7);…
Chapter 18 Solutions
EBK STARTING OUT WITH C++
Ch. 18.1 - Prob. 18.1CPCh. 18.1 - Prob. 18.2CPCh. 18.1 - Prob. 18.3CPCh. 18.1 - Prob. 18.4CPCh. 18.2 - Prob. 18.5CPCh. 18.2 - Prob. 18.6CPCh. 18.2 - Prob. 18.7CPCh. 18.2 - Prob. 18.8CPCh. 18.2 - Prob. 18.9CPCh. 18.2 - Prob. 18.10CP
Ch. 18 - Prob. 1RQECh. 18 - Prob. 2RQECh. 18 - Prob. 3RQECh. 18 - Prob. 4RQECh. 18 - Prob. 5RQECh. 18 - Prob. 6RQECh. 18 - Prob. 7RQECh. 18 - Prob. 8RQECh. 18 - Prob. 9RQECh. 18 - Prob. 10RQECh. 18 - Prob. 11RQECh. 18 - Prob. 12RQECh. 18 - Prob. 13RQECh. 18 - Prob. 14RQECh. 18 - Prob. 15RQECh. 18 - Prob. 16RQECh. 18 - Prob. 17RQECh. 18 - Prob. 18RQECh. 18 - Prob. 19RQECh. 18 - Prob. 20RQECh. 18 - Prob. 21RQECh. 18 - Prob. 22RQECh. 18 - Prob. 23RQECh. 18 - Prob. 24RQECh. 18 - Prob. 25RQECh. 18 - T F The programmer must know in advance how many...Ch. 18 - T F It is not necessary for each node in a linked...Ch. 18 - Prob. 28RQECh. 18 - Prob. 29RQECh. 18 - Prob. 30RQECh. 18 - Prob. 31RQECh. 18 - Prob. 32RQECh. 18 - Prob. 33RQECh. 18 - Prob. 34RQECh. 18 - Prob. 35RQECh. 18 - Prob. 1PCCh. 18 - Prob. 2PCCh. 18 - Prob. 3PCCh. 18 - Prob. 4PCCh. 18 - Prob. 5PCCh. 18 - Prob. 6PCCh. 18 - Prob. 7PCCh. 18 - List Template Create a list class template based...Ch. 18 - Prob. 9PCCh. 18 - Prob. 10PCCh. 18 - Prob. 11PCCh. 18 - Prob. 12PCCh. 18 - Prob. 13PCCh. 18 - Prob. 14PCCh. 18 - Prob. 15PC
Knowledge Booster
Similar questions
- java data structure Queue: Q4: A program performs the following operations on an empty queue Q: Q.enqueue(24) Q.enqueue(74) Q.enqueue(34) Q.first() Q.dequeue() Q.enqueue(12) Q.dequeue() Please show the queue contents at the end of these operations. Clearly show the front of the queue.arrow_forwardQ15. . requires more memory space than.. Doubly Linked List Doubly Circular Linked List They are all the samearrow_forward2-) In a double linked list, the structure of a node is defined as follows: struct node { int employeeNo; char name[20]; struct node *next; structnode *prev; }node; the nodes in the list are sorted according to employeeNo in ascending order (from smaller to larger ). Write a function to insert a node with a given name and employeeNo into the list so that the list will remain the sorted. employeeNo değerine göre kiüçükten büyüğe sıralanmış bir çift bağlı liste olsun. Verilen bir isim ve employeeNo değerine sahip düğümü listeye sıra bozulmayacak şekilde ekleyen bir fonksyion yazınız.arrow_forward
- Double pointers: Describe how this operation can be done in O(1) time if there are pointers in each node to both the previous and the next node.arrow_forwardstruct 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.arrow_forward2-) In a double linked list, the structure of a node is defined as follows: struct node { int employeeNo; char name[20]: struct node *next; structnode *prev; }node; the nodes in the list are sorted according to employeeNo in ascending order (from smaller to larger ). Write a function to insert a node with a given name and employeeNo into the list so that the list will remain the sorted. employeeNo değerine göre kiüçüikten büyüğe sıralanmış bir çift bağlı liste olsun. Verilen bir isim ve employeeNo değerine sahip düğümü listeye sıra bozulmayacak şekilde ekleyen bir fonksyion yazınız.arrow_forward
- the queues of processes are implemented as ___ a) memory adress b) indexed pointers c) inked lists d) tablesarrow_forwarddata structure Create a Java program using a Linked list by adding 5 nodes and then removing 1 node from the list. The node entries can be either Numbers (Int) or Characters (String).arrow_forwardThis code for: 1) Add five integer values into a queue. 2) Delete the values from the queue then store the popped values in a sorted linked list and print it on the screen I need details comments for each line ... Thank you. The code: (Programming Language is C): #define MAXELEMENTS 5 #define MIN 0 struct queue { int items[MAXELEMENTS]; int front, rear; }; struct node { int data; struct node *next; }; typedef struct node *NODEPTR; void cqinsert(struct queue*,int); int cqdelete(struct queue*); void insert(node *head,int); int main(void) { struct queue q; int x; q.front= q.rear=-1; for(int i=0;i<5;i++) { printf("Enter input Number \n"); scanf("%d",&x); cqinsert(&q,x); } x=cqdelete(&q); NODEPTR head=(NODEPTR)malloc(sizeof(struct node)); head->data=x; head->next=NULL; for(int i=0;i<5;i++) { x=cqdelete (&q); insert(head, x); } NODEPTR save = head; do { printf("%d\n",save->data); save-save->next; } while(save!=NULL); return 0; }//end of main int…arrow_forward
- ASSUMING C LANGUAGE True or False: You can have the data portion of a Linked List be a Struct containing a Linked List itselfarrow_forwardSubject-Object oriented programing Write a program which:• creates a new Array List• adds 5 decimal numbers to it• prints the list to the screen In the same program, remove the element at the last index of the Array List. Print the resulting list tothe screen.arrow_forwardData Structures , Code C++ Suppose that p, q, and r are all pointers to nodes in a linked list with 15 nodes. The pointer p points to the first node, q points to the 8th node, and r points to the last node. Write a few lines of code that will make a new copy of the list. You code should set THREE new pointers called x, y, and z so that: x points to the first node of the copy, y points to the 8th node of the copy, and z points to the last node of the copy.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning