73%void showLinked()Linked_List "p;p=List;while(pl=NULL){cout<name< age<phoneN0<ID_NO<next;cout<>k;for(int i=0;i>nam;couts<"Enter student Age : ";cin>>ag:cout<<" Enter student PH NO:";cin>>ph:couts<"Enter student ID NO : ":cin>>id;InserFront(nam,ag.ph,id);couts<".--"<d;for (int i=0;i

#include <bits/stdc++.h> using namespace std; class Node { public: int data; Node *next;…

void showLinked() Linked_List "p; p=List; while(pl-NULL) cout<name age<phoneNO<ID_NOnext; } cout<>k; for(int l=0;1>nam; couts<"Enter student Age : "; cin>>ag; couts<" Enter student PH NO : "; cin>>ph; couts<"Enter student ID NO : "; cin>>id; InserFront(nam,ag.ph,id); couts<"- -"<d; for (int i=0;i

void showLinked() Linked_List "p; p=List; while(pl-NULL) cout<name age<phoneNO<ID_NOnext; } cout<>k; for(int l=0;1>nam; couts<"Enter student Age : "; cin>>ag; couts<" Enter student PH NO : "; cin>>ph; couts<"Enter student ID NO : "; cin>>id; InserFront(nam,ag.ph,id); couts<"- -"<d; for (int i=0;i

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

here is my code: link: #include <iostream>#include <ctype.h>using namespace std; int main (){struct hat{string brand;int size;}; void printQueue(queue<hat> q){while(!q.empty()){struct hat h = q.front();cout<<h.brand<<" "<<h.size<<endl;q.pop();}}; void showStack(stack<hat> i){while(!i.empty()){struct hat h = i.top();cout<<h.brand<<" "<<h.size<<endl;i.pop();}}; queue<hat> squeue;stack<hat> st; int main(){char selection;int option;do{cout << "\n Main Menu";cout << "\n =========";cout << "\n Q - Queue";cout << "\n S - Stack";cout << "\n X - Exit \n";cout << "\n Enter selection: ";cin >> selection;struct hat h;switch (toupper(selection)){case 'Q':do{cout << "\n Queue List Menu";cout << "\n =========";cout << "\n 1 - Enqueue";cout << "\n 2 - Dequeue";cout << "\n 3 - Queue front";cout << "\n 4 - Queue rear";cout << "\n 5 - View…
Question 1 The code below defines a singly-linked list. This consists of the following definition of node: 1 struct node { int val; struct node * next; 4 } Also, it uses the following insert function: struct node * insert(struct node * first, const int val) { 6 struct node * pred = NULL, * succ = first; 7 while (succ != NULL) { 8 if (succ->val val > val) 10 11 break; 12 succ = succ->next; 13 } struct node * this = malloc(sizeof (struct node)); this->val = val; 14 15 16 this->next = succ; 17 if (pred != NULL) { pred->next return first; } else { 18 this; %3D 19 20 21 return this; 22 } 23 } Note that the code above compiles correctly. (a) Give an implementation in C for a function that prints all values in the singly-linked starting from the first node and following the next node one by one along the list. Use the following signature: void print (struct node * first);
Use the following node definition for this problem.struct NodeInt32{int32_t value; NodeInt32* next;} Write a function which searches a non-empty linked list for a target value. Its exact signature should be: NodeInt32* find(NodeInt32* head, int32_t target); The function should return the first node whose value equals target. If the target is not found in the list, then the function should return NULL.
C++ Given code #include <iostream>using namespace std; class Node {public:int data;Node *pNext;}; void displayNumberValues( Node *pHead){while( pHead != NULL) {cout << pHead->data << " ";pHead = pHead->pNext;}cout << endl;} //Option 1: Search the list// TODO: complete the function below to search for a given value in linked lsit// return true if value exists in the list, return false otherwise. ?? linkedlistSearch( ???){ } //Option 2: get sum of all values// TODO: complete the function below to return the sum of all elements in the linked list. ??? getSumOfAllNumbers( ???){ } int main(){int userInput;Node *pHead = NULL;Node *pTemp;cout<<"Enter list numbers separated by space, followed by -1: "; cin >> userInput;// Keep looping until end of input flag of -1 is givenwhile( userInput != -1) {// Store this number on the listpTemp = new Node;pTemp->data = userInput;pTemp->pNext = pHead;pHead = pTemp;cin >> userInput;}cout <<"…
Topic: Doubly Linked List Deque Implement the following problem in the main case 0 (see attached photo) Your algorithm for the hierarchy problem should follow this: Evaluate the final set of operations first given the set of rules. Then, do the remove operations. Finally, do the add operations. DO NOT MIND THE #include "dlldeque.h" it is already implemented only the case 0 needs to be solved #include <iostream> #include <cstring> #include "dlldeque.h" using namespace std; int main(int argc, char** argv) { DLLDeque* deque = new DLLDeque(); int test; cin >> test; switch (test) { case 0: // perform your Hierarchy implementation here // utilize the deque initialized, // initialize variables you need before switch // you can use the print() method to debug, but not the final_print() // do not modify from this point onwards deque->final_print();…
program by using C language In the struct structure given below, the data of a student is stored in a singly linear linked list. Write a function named "secondHighest" that takes the starting address of the list as a parameter and returns the student number with the second highest grade? typedef struct node { int OgrNo; int not; struct node *next; };
#include <iostream>#include <assert.h> using namespace std; /*The structure to be used for representing a doubly-linked link. This structdeclaration should not be modified in any way.*/template <class E>struct DLink{E theElement;DLink<E> *nextPtr;DLink<E> *prevPtr;}; /*Complete this implementation variant of the doubly-linked list. Use the same convention. The DLink declaration to be used here is just a struct and should not be modified in any way. All of the operations ofthe original DLink class must be done in the methods of this class. Useassertions to ensure the correct operation of this ADT. All memory allocations should be checked with assertions and all discarded memory must be properly deallocated.*/template <class E>class DList{DLink<E> *head;DLink<E> *tail;DLink<E> *curr;int cnt; public:// Return the size of the listint length(){return cnt;} // The constructor with initial list sizeDList(int size){this();} // The default…
WRTIE ANY C++ PROGRAM IN WHICH YOU HAVE TO CREATE A LINKLIST AND ADD NODE INTO THAT LINKLIST AND THEN DELETE THAT NODE FROM THE LINKLIST.
#ifndef NODES_LLOLL_H#define NODES_LLOLL_H #include <iostream> // for ostream namespace CS3358_SP2023_A5P2{ // child node struct CNode { int data; CNode* link; }; // parent node struct PNode { CNode* data; PNode* link; }; // toolkit functions for LLoLL based on above node definitions void Destroy_cList(CNode*& cListHead); void Destroy_pList(PNode*& pListHead); void ShowAll_DF(PNode* pListHead, std::ostream& outs); void ShowAll_BF(PNode* pListHead, std::ostream& outs);} #endif #include "nodes_LLoLL.h"#include "cnPtrQueue.h"#include <iostream>using namespace std; namespace CS3358_SP2023_A5P2{ // do breadth-first (level) traversal and print data void ShowAll_BF(PNode* pListHead, ostream& outs) { cnPtrQueue queue; CNode* currentNode; queue.push(lloLLPtr->getHead()); while (!queue.empty()) { currentNode = queue.front(); queue.pop(); if…
Having trouble with creating the InsertAtEnd function in the ItemNode.h file below. " // TODO: Define InsertAtEnd() function that inserts a node // to the end of the linked list" Given main(), define an InsertAtEnd() member function in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts ------------------------------------------------------- main.cpp -------------------------------------------------------- #include "ItemNode.h" int main() { ItemNode *headNode; // Create intNode objects ItemNode *currNode; ItemNode *lastNode; string item; int i; int input; // Front of nodes list headNode = new ItemNode(); lastNode = headNode; cin >> input; for (i = 0; i < input; i++) { cin >> item;…
in c language program, write a code that display the information of all products o display the names and price per unit for allproducts in the linked list with the quantity less than two calculate the total price of all products in the all of the code is in different function or segemnt
Given the following C code: atruct Node int data: struct Node previ struct Node next: Which of the following statements deletes the node pointed by X? Assume that X points to the first node of linked list and head points to the head of linked list. a) X->prev-x->next; X->next-X->prev; b) Head-X->next; Head >prev-NULL; c) Head-X->prev; X->next-NULL; d) X->prev->prev - X->prev; X->next->next-X->next;