./llcpInt.cpp:12:33: error: no member named 'next' in 'Node'headPtr = curr->next;NNNN./llcpInt.cpp:16:23: error: no member named 'next' in 'Node'prev->next = curr->next;NNNN./llcpInt.cpp:16:36: error: no member named 'next' in 'Node'prev->next = curr->next;./llcpInt.cpp:18:30: error: no member named 'next' in 'Node'curr = prev->next;NNNN./llcpInt.cpp:21:29: error: no matching constructor for initialization of 'Node'Node* tmp = new Node(curr->data);សសសសសសសសសស./llcpInt.h:6:8: note: candidate constructor (the implicit copy constructor) not viable: no known conversion from 'int' to 'const Node' for 1st argumentstruct NodeNNNNNNN./llcpInt.h:6:8: note: candidate constructor (the implicit move constructor) not viable: no known conversion from 'int' to 'Node' for 1st argument./llcpInt.h:6:8: note: candidate constructor (the implicit default constructor) not viable: requires arguments, but 1 was provided./llcpInt.cpp:22:18: error: no member named 'next' in 'Node'tmp->next = curr->next;./llcpInt.cpp:22:31: error: no member named 'next' in 'Node'tmp->next = curr->next;NNNNNNNN./llcpInt.cpp:23:19: error: no member named 'next' in 'Node'curr->next = tmp;NNNN./llcpInt.cpp:25:26: error: no member named 'next' in 'Node'curr = curr->next; 1 #include 2 #include 3 #include "llcpInt.h"4 using namespace std;5 void DeloddCopEven (Node*& headptr) {Node* curr = headPtr;Node* prev = nullptr;1.067 ✓8 ✔9 ✓10111213141516171819202122232425262728 ✓O 0029 }Iwhile (curr != nullptr) {}if (curr->data % 2 == 1) {if (prev== nullptr) {}} else {}headPtr = curr->next;delete curr;curr = headPtr;} else {prev->next = curr->next;delete curr;curr = prev->next;Node* tmp = new Node(curr->data);tmp->next = curr->next;curr->next = tmp;prev = curr;curr = curr->next;

The code provided seems to have a few syntax errors and logical issues. However, to address the…

#include #include #include "llcpInt.h" using namespace std; void DelOddCopEven (Node*& headPtr) { Node* curr = headPtr; Node* prev = nullptr; } day while (curr != nullptr) { } if (curr->data % 2 == 1) { if (prev == nullptr) { headPtr = curr->next; delete curr; curr = headPtr; } else { prev->next = curr->next; delete curr; curr = prev->next; } } else { Node* tmp = new Node(curr->data); tmp->next = curr->next; curr->next = tmp; prev = curr; curr = curr->next;

#include #include #include "llcpInt.h" using namespace std; void DelOddCopEven (Node& headPtr) { Node curr = headPtr; Node* prev = nullptr; } day while (curr != nullptr) { } if (curr->data % 2 == 1) { if (prev == nullptr) { headPtr = curr->next; delete curr; curr = headPtr; } else { prev->next = curr->next; delete curr; curr = prev->next; } } else { Node* tmp = new Node(curr->data); tmp->next = curr->next; curr->next = tmp; prev = curr; curr = curr->next;

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

main.cc file #include <iostream>#include <memory> #include "customer.h" int main() { // Creates a line of customers with Adele at the front. // LinkedList diagram: // Adele -> Kehlani -> Giveon -> Drake -> Ruel std::shared_ptr<Customer> ruel = std::make_shared<Customer>("Ruel", 5, nullptr); std::shared_ptr<Customer> drake = std::make_shared<Customer>("Drake", 8, ruel); std::shared_ptr<Customer> giveon = std::make_shared<Customer>("Giveon", 2, drake); std::shared_ptr<Customer> kehlani = std::make_shared<Customer>("Kehlani", 15, giveon); std::shared_ptr<Customer> adele = std::make_shared<Customer>("Adele", 4, kehlani); std::cout << "Total customers waiting: "; // =================== YOUR CODE HERE =================== // 1. Print out the total number of customers waiting // in line by invoking TotalCustomersInLine. //…
main.cc file #include <iostream>#include <memory> #include "customer.h" int main() { // Creates a line of customers with Adele at the front. // LinkedList diagram: // Adele -> Kehlani -> Giveon -> Drake -> Ruel std::shared_ptr<Customer> ruel = std::make_shared<Customer>("Ruel", 5, nullptr); std::shared_ptr<Customer> drake = std::make_shared<Customer>("Drake", 8, ruel); std::shared_ptr<Customer> giveon = std::make_shared<Customer>("Giveon", 2, drake); std::shared_ptr<Customer> kehlani = std::make_shared<Customer>("Kehlani", 15, giveon); std::shared_ptr<Customer> adele = std::make_shared<Customer>("Adele", 4, kehlani); std::cout << "Total customers waiting: "; // =================== YOUR CODE HERE =================== // 1. Print out the total number of customers waiting // in line by invoking TotalCustomersInLine. //…
C++: Consider the following code: struct node { int data; node *next; }; node myNode; node *p = &myNode; Which of these will set member variable data of myNode to the value 7? A) node->data = 7; B) p->node = 7; C) p.node = 7; D) myNode.data = 7;
#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode { struct treeNode* leftPtr; int data; struct treeNode* rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode* TreeNodePtr; void insertNode(TreeNodePtr* treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr);} void insertNode(TreeNodePtr* treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if…
#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode { struct treeNode *leftPtr; int data; struct treeNode *rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode *TreeNodePtr; void insertNode(TreeNodePtr *treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr);} void insertNode(TreeNodePtr *treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if (*treePtr != NULL) { (*treePtr)->data = value;…
#include <iostream> #include <iomanip> #include <string> using namespace std; struct Teletype { string name; string phonenum; Teletype *nextaddr; }; void populate(Teletype *); void displayrecord(Teletype *); //void insertrecord(Teletype *); // create //void removerecord(Teletype *); //create //void modifyrecord(Teletype *); // create //int find(TeleType *, string); // Extra Credit create bool check(); int main() { int location = 0; int count = 0; char answery_n; Teletype *list, *current; list = new Teletype; current = list; cout << "Please "; do { count++; populate(current); if (check() == false) { cout << " Not storage available" << endl; } else { current->nextaddr = new Teletype; current = current->nextaddr;…
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #define NAME_LEN 25 #define MAX_PARTS 100 struct part { int number; char name[NAME_LEN + 1]; int on_hand; double price; } inventory[MAX_PARTS]; int num_parts = 0; int find_part(int number); void insert(void); void search(void); void update(void); void print(void); int read_line(char str[], int n); int main(void) { char code; for (;;) { printf("Enter operation code: "); scanf(" %c", &code); while (getchar() != '\n') /* skips to end of line */ ; switch (code) { case 'i': insert(); break; case 's': search(); break; case 'u': update(); break; case 'p': print(); break; case 'q': return 0; default: printf("Illegal code\n"); } printf("\n"); } } int find_part(int number) { int i; for (i = 0; i < num_parts; i++) if…
Question4 (Linked List): 1. Given the attached program code, answer the following: (a) Match each function name with its task. Function Name Task F1 Insert a node at the front of the list. F2 Insert a node after a given node. F3 Delete a node in a specific position. F4 Insert a node at the end of the list. F5 Create the first node in the list. F6 Display 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.
C programming pseudocode pointers help. { totalInAGivenHour+=*(rawReadings+ monthNo*30*14*4 + 14*4*nThDateOfMonth+ 4*nThHourOfDateFrom7AM + nThReadingTimeOfHour); // the pointer is to assign the values in the bracket and storing them in totalInAGivenHour }
main.cc file #include <iostream>#include <memory> #include "train.h" int main() { // Creates a train, with the locomotive at the front of the train. // LinkedList diagram: // Locomotive -> First Class -> Business Class -> Cafe Car -> Carriage 1 -> // Carriage 2 std::shared_ptr<Train> carriage2 = std::make_shared<Train>(100, 100, nullptr); std::shared_ptr<Train> carriage1 = std::make_shared<Train>(220, 220, carriage2); std::shared_ptr<Train> cafe_car = std::make_shared<Train>(250, 250, carriage1); std::shared_ptr<Train> business_class = std::make_shared<Train>(50, 50, cafe_car); std::shared_ptr<Train> first_class = std::make_shared<Train>(20, 20, business_class); std::shared_ptr<Train> locomotive = std::make_shared<Train>(1, 1, first_class); std::cout << "Total passengers in the train: "; // =================== YOUR CODE HERE…
#include #include #include "Product.h". using namespace std; int main() { vector productList; Product currProduct; int currPrice; string currName; unsigned int i; Product resultProduct; cin >> currPrice; while (currPrice > 0) { cin >> currName; currProduct.SetPriceAndName (currPrice, currName); productList.push_back (currProduct); cin >> currPrice; } resultProduct = productList.at(0); for (i = 0; i resultProduct.GetPrice()) { resultProduct = productList.at(i); } CS re 0; ultProduct.GetName() << " " << result Product.GetPrice() << endl; Input 10 Berries 8 Paper 7 Socks -1 Output ||^
Find errors / syntax error. Write line number