ItemNodeh include ltiostreamgt include ltstring.pdf
•
0 likes•2 views
ItemNode.h: #include <iostream> #include <string> using namespace std; class ItemNode { private: string item; ItemNode* nextNodeRef; public: // Constructor ItemNode() { item = ""; nextNodeRef = NULL; } // Constructor ItemNode(string itemInit) { this->item = itemInit; this->nextNodeRef = NULL; } // Constructor ItemNode(string itemInit, ItemNode *nextLoc) { this->item = itemInit; this->nextNodeRef = nextLoc; } // Insert node after this node. void InsertAfter(ItemNode &nodeLoc) { ItemNode* tmpNext; tmpNext = this->nextNodeRef; this->nextNodeRef = &nodeLoc; nodeLoc.nextNodeRef = tmpNext; } // Define InsertAtEnd() function that inserts a node // to the end of the linked list void InsertAtEnd(string item) { ItemNode* newNode = new ItemNode(item); if (nextNodeRef == NULL) { nextNodeRef = newNode; } else { ItemNode* current = nextNodeRef; while (current->nextNodeRef != NULL) { current = current->nextNodeRef; } current->nextNodeRef = newNode; } } // Get location pointed by nextNodeRef ItemNode* GetNext() { return this->nextNodeRef; } void PrintNodeData() { cout << this->item << endl; } }; int main() { int numItems; cin >> numItems; ItemNode head; ItemNode* current = &head; for (int i = 0; i < numItems; i++) { string item; cin >> item; current->InsertAtEnd(item); current = current->GetNext(); } current = head.GetNext(); while (current != NULL) { current->PrintNodeData(); current = current->GetNext(); } return 0; } main.cpp (only for viewing) #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; currNode = new ItemNode(item); lastNode->InsertAtEnd(currNode); lastNode = currNode; } // Print linked list currNode = headNode->GetNext(); while (currNode != NULL) { currNode->PrintNodeData(); currNode = currNode->GetNext(); } } in c++ please. Thank you! 18.18 LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main0, 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: begin{tabular}{|l} hline 4 Kale Lettuce Carrots Peanuts end{tabular} where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is:.
Report
Share
Report
Share
Download to read offline
Recommended
1818 LAB Grocery shopping list linked list inserting at .pdf
18.18 LAB: Grocery shopping list (linked list: inserting at the end of a 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:
where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of
the items to be added at the end of the list.
The output is:
ItemNode.h:
#include <iostream>
#include <string>
using namespace std;
class ItemNode {
private:
string item;
ItemNode* nextNodeRef;
public:
// Constructor
ItemNode() {
item = "";
nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit) {
this->item = itemInit;
this->nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit, ItemNode *nextLoc) {
this->item = itemInit;
this->nextNodeRef = nextLoc;
}
// Insert node after this node.
void InsertAfter(ItemNode &nodeLoc) {
ItemNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = &nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// TODO: Define InsertAtEnd() function that inserts a node
// to the end of the linked list
// Get location pointed by nextNodeRef
ItemNode* GetNext() {
return this->nextNodeRef;
}
void PrintNodeData() {
cout << this->item << endl;
}
};
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;
currNode = new ItemNode(item);
lastNode->InsertAtEnd(currNode);
lastNode = currNode;
}
// Print linked list
currNode = headNode->GetNext();
while (currNode != NULL) {
currNode->PrintNodeData();
currNode = currNode->GetNext();
}
}
in c++ please. Thank you!.
�ShoppingList.java�import java.util.Scanner;public class Sho.pdf
ShoppingList.java
import java.util.Scanner;
public class ShoppingList {
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
ItemNode headNode; // Create intNode objects
ItemNode currNode;
ItemNode lastNode;
String item;
int i;
// Front of nodes list
headNode = new ItemNode();
lastNode = headNode;
int input = scnr.nextInt();
for(i = 0; i < input; i++ ){
item = scnr.next();
currNode = new ItemNode(item);
lastNode.insertAtEnd(headNode, currNode);
lastNode = currNode;
}
// Print linked list
currNode = headNode.getNext();
while (currNode != null) {
currNode.printNodeData();
currNode = currNode.getNext();
}
}
}
ItemNode.java
public class ItemNode {
private String item;
private ItemNode nextNodeRef; // Reference to the next node
public ItemNode() {
item = "";
nextNodeRef = null;
}
// Constructor
public ItemNode(String itemInit) {
this.item = itemInit;
this.nextNodeRef = null;
}
// Constructor
public ItemNode(String itemInit, ItemNode nextLoc) {
this.item = itemInit;
this.nextNodeRef = nextLoc;
}
// Insert node after this node.
public void insertAfter(ItemNode nodeLoc) {
ItemNode tmpNext;
tmpNext = this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// TODO: Define insertAtEnd() method that inserts a node
// to the end of the linked list
ItemNode newNode = new ItemNode("Peanuts", null);
{
lastNode.insertAtEnd(newNode);
}
6.16 LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main() in the
ShoppingList class, define an insertAtEnd() method 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 where 4 is the number of items to be inserted; Kale, Lettuce, Carrots,
Peanuts are the names of the items to be added at the end of the list. The output is:.
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdf
#ifndef LINKED_LIST_
#define LINKED_LIST_
template
class LinkedList {
private:
std::shared_ptr> headPtr; // Pointer to first node in the chain;
// (contains the first entry in the list)
int itemCount; // Current count of list items
std::shared_ptr> getNodeAt(int position) const;
public:
LinkedList();
LinkedList(const LinkedList& aList);
virtual ~LinkedList();
bool isEmpty() const;
int getLength() const;
bool insert(int newPosition, const ItemType& newEntry);
bool remove(int position);
void clear();
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
ItemType getEntry(int position) const throw(PrecondViolatedExcept);
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
void replace(int position, const ItemType& newEntry)
throw(PrecondViolatedExcept);
// Operator Overloading
void operator = (const LinkedList& arg);
friend std::ostream& operator << (std::ostream& os, const LinkedList& arg)
{
os << \"There are \" << arg.getLength() << \" values in the list:\" << std::endl;
for (int i{ 1 }; i <= arg.getLength(); i++) {
os << arg.getEntry(i) << std::endl;
}
os << std::endl << std::endl << std::endl << std::endl;
return os;
}
};
// Returns a pointer to the Node at the given position.
template
std::shared_ptr> LinkedList::getNodeAt (int position) const {
std::shared_ptr> currPtr{ headPtr };
for (int i{ 1 }; i < position; i++)
currPtr = currPtr->getNext();
return currPtr;
}
// Default constructor.
template
LinkedList::LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Copy constructor.
template
LinkedList::LinkedList(const LinkedList& aList) {
itemCount = aList.getLength();
auto currPtr{ aList.headPtr };
auto newNodePtr{ headPtr = std::make_shared>(currPtr->getItem()) };
auto prevNodePtr{ newNodePtr };
currPtr = currPtr->getNext();
for (int i{ 2 }; i <= itemCount; i++) {
newNodePtr = std::make_shared>(currPtr->getItem());
prevNodePtr->setNext(newNodePtr);
prevNodePtr = newNodePtr;
currPtr = currPtr->getNext();
}
}
// Destructor.
template
LinkedList::~LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Accessor/Info Functions.
template
bool LinkedList::isEmpty() const {
return (itemCount > 0)?0:1;
}
template
int LinkedList::getLength() const {
return itemCount;
}
// Places a Node at a given position (element at the same position is now pos+1).
template
bool LinkedList::insert(const int newPosition,
const ItemType& newEntry)
{
bool ableToInsert{ (newPosition >= 1) &&
(newPosition <= itemCount + 1) };
if (ableToInsert)
{
// Create a new node containing the new entry
auto newNodePtr{ std::make_shared>(newEntry) };
// Attach new node to chain
if (newPosition == 1)
{
// Insert new node at beginning of chain
newNodePtr->setNext(headPtr);
headPtr = newNodePtr;
}
else
{
// Find node that will be before new node
auto prevPtr{ getNodeAt(newPosition - 1) };
// Insert new node after node to which prevPtr points
newNodePtr->setNext(prevPtr->getNext());
prevPtr->setNext(newNodePtr);
} // end if
itemCount++; // .
Given main() in the Inventory class, define an insertAtFront() metho.pdf
Given main() in the Inventory class, define an insertAtFront() method in the InventoryNode class
that inserts items at the front of a linked list (after the dummy head node).
Ex. If the input is:
the output is:
CODE:
public class InventoryNode {
private String item;
private int numberOfItems;
private InventoryNode nextNodeRef; // Reference to the next node
public InventoryNode() {
item = "";
numberOfItems = 0;
nextNodeRef = null;
}
// Constructor
public InventoryNode(String itemInit, int numberOfItemsInit) {
this.item = itemInit;
this.numberOfItems = numberOfItemsInit;
this.nextNodeRef = null;
}
// Constructor
public InventoryNode(String itemInit, int numberOfItemsInit, InventoryNode nextLoc) {
this.item = itemInit;
this.numberOfItems = numberOfItemsInit;
this.nextNodeRef = nextLoc;
}
// TODO: Define an insertAtFront() method that inserts a node at the
// front of the linked list (after the dummy head node)
// Get location pointed by nextNodeRef
public InventoryNode getNext() {
return this.nextNodeRef;
}
// Print node data
public void printNodeData() {
System.out.println(this.numberOfItems + " " + this.item);
}
}.
This is the main file include itemh include itemList.pdf
//This is the main file
#include "item.h"
#include "itemList.h"
int main()
{
//create a list of items
ItemList groceryList;
//create temp variables
Item anItem;
int count = 0, newNum = 0;
char newName[MAXCHAR], findName[MAXCHAR];
//read from user and add to list
cin >> count;
cin.ignore(100, 'n');
for(int i = 0; i < count; i++)
{
cin >> newName;
cin >> newNum;
cin.ignore(100, 'n');
anItem.setItemName(newName);
anItem.setNumItems(newNum);
groceryList.InsertAtFront(anItem);
}
groceryList.showList();
cin >> findName;
if(!groceryList.findItem(findName))
{
cout << "Item not found!";
}
return 0;
}
item.h
//Item header file
//
#pragma once
#include <iostream>
#include <cstring>
using namespace std;
//constant for char arrays
const int MAXCHAR = 101;
//class definition
class Item {
private:
char *itemName;
int numberOfItems;
public:
//Constructors
Item();
Item(char *, int);
//copy constructor
Item(const Item &anItem);
//destructor
~Item();
//mutators
void setItemName(char *);
void setNumItems(int);
//accessors
void getItemName(char *);
int getNumItems();
//print item
void printItem();
//assignment op overloading
Item& operator= (const Item& anItem);
};
item.cpp
//This is the implementation file for item.h (the Item class)
#include "item.h"
//default constructor
Item::Item()
{
//allocate memory for itemName
itemName = new char[MAXCHAR];
strcpy(this->itemName, "no name");
numberOfItems = 0;
}
//constructor with parameters
Item::Item(char tempItemName[], int tempNumItems)
{
//allocate memory for itemName
itemName = new char[strlen(tempItemName) + 1];
strcpy(itemName, tempItemName);
numberOfItems = tempNumItems;
}
//Copy Constructor
Item::Item(const Item &anItem)
{
//allocate memory for itemName
itemName = new char[strlen(anItem.itemName) + 1];
strcpy(itemName, anItem.itemName);
numberOfItems = anItem.numberOfItems;
}
//destructor
Item::~Item()
{
//deallocate the memory for itemName
if(itemName)
{
delete [] itemName;
itemName = NULL;
}
}
//mutator functions
void Item::setItemName(char *newItemName)
{
if(itemName)
{
delete [] itemName;
}
itemName = new char[strlen(newItemName) + 1];
strcpy(itemName, newItemName);
}
//for numberofitems
void Item::setNumItems(int newNum)
{
numberOfItems = newNum;
}
//accessor functions
void Item::getItemName(char *returnItemName)
{
strcpy(returnItemName, itemName);
}
int Item::getNumItems()
{
return numberOfItems;
}
//print the item
void Item::printItem()
{
cout << numberOfItems << ' ' << itemName << endl;
}
//assignment operator overload
Item& Item::operator= (const Item& anItem)
{
//if it is a self copy, don't do anything
if (this == &anItem)
return *this;
//make current object *this a copy of the passed in item
else
{
this->setItemName(anItem.itemName);
this->numberOfItems = anItem.numberOfItems;
return *this;
}
}
itemList.h
//This is the itemList header file.
//Class for a list of items
#pragma once
#include "item.h"
//define class for a list of items
class ItemList
{
private:
//struct for each Node
struct Node
{
Item d.
#includeiostream#includecstdio#includecstdlibusing names.pdf
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*last;
/*
* Class Declaration
*/
class circular_llist
{
public:
void create_node(int value);
void add_begin(int value);
void add_after(int value, int position);
void delete_element(int value);
void search_element(int value);
void display_list();
void update();
void sort();
circular_llist()
{
last = NULL;
}
};
/*
* Create Circular Link List
*/
void circular_llist::create_node(int value)
{
struct node *temp;
temp = new(struct node);
temp->info = value;
if (last == NULL)
{
last = temp;
temp->next = last;
}
else
{
temp->next = last->next;
last->next = temp;
last = temp;
}
}
/*
* Insertion of element at beginning
*/
void circular_llist::add_begin(int value)
{
if (last == NULL)
{
cout<<\"First Create the list.\"<info = value;
temp->next = last->next;
last->next = temp;
}
/*
* Deletion of element from the list
*/
void circular_llist::delete_element(int value)
{
struct node *temp, *s;
s = last->next;
/* If List has only one element*/
if (last->next == last && last->info == value)
{
temp = last;
last = NULL;
free(temp);
return;
}
if (s->info == value) /*First Element Deletion*/
{
temp = s;
last->next = s->next;
free(temp);
return;
}
while (s->next != last)
{
/*Deletion of Element in between*/
if (s->next->info == value)
{
temp = s->next;
s->next = temp->next;
free(temp);
cout<<\"Element \"<next;
}
/*Deletion of last element*/
if (s->next->info == value)
{
temp = s->next;
s->next = last->next;
free(temp);
last = s;
return;
}
/*
* Display Circular Link List
*/
void circular_llist::display_list()
{
struct node *s;
if (last == NULL)
{
cout<<\"List is empty, nothing to display\"<
Solution
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*last;
/*
* Class Declaration
*/
class circular_llist
{
public:
void create_node(int value);
void add_begin(int value);
void add_after(int value, int position);
void delete_element(int value);
void search_element(int value);
void display_list();
void update();
void sort();
circular_llist()
{
last = NULL;
}
};
/*
* Create Circular Link List
*/
void circular_llist::create_node(int value)
{
struct node *temp;
temp = new(struct node);
temp->info = value;
if (last == NULL)
{
last = temp;
temp->next = last;
}
else
{
temp->next = last->next;
last->next = temp;
last = temp;
}
}
/*
* Insertion of element at beginning
*/
void circular_llist::add_begin(int value)
{
if (last == NULL)
{
cout<<\"First Create the list.\"<info = value;
temp->next = last->next;
last->next = temp;
}
/*
* Deletion of element from the list
*/
void circular_llist::delete_element(int value)
{
struct node *temp, *s;
s = last->next;
/* If List has only one element*/
if (last->next == last && last->info == value)
{
temp = last;
last = NULL;
free(temp);
return;
}
if (s->info == value) /*First Element Deletion*/
{
temp = s;
last->next = s->next;
free(temp);
return;
}
while (s->next != .
Recommended
1818 LAB Grocery shopping list linked list inserting at .pdf
18.18 LAB: Grocery shopping list (linked list: inserting at the end of a 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:
where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of
the items to be added at the end of the list.
The output is:
ItemNode.h:
#include <iostream>
#include <string>
using namespace std;
class ItemNode {
private:
string item;
ItemNode* nextNodeRef;
public:
// Constructor
ItemNode() {
item = "";
nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit) {
this->item = itemInit;
this->nextNodeRef = NULL;
}
// Constructor
ItemNode(string itemInit, ItemNode *nextLoc) {
this->item = itemInit;
this->nextNodeRef = nextLoc;
}
// Insert node after this node.
void InsertAfter(ItemNode &nodeLoc) {
ItemNode* tmpNext;
tmpNext = this->nextNodeRef;
this->nextNodeRef = &nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// TODO: Define InsertAtEnd() function that inserts a node
// to the end of the linked list
// Get location pointed by nextNodeRef
ItemNode* GetNext() {
return this->nextNodeRef;
}
void PrintNodeData() {
cout << this->item << endl;
}
};
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;
currNode = new ItemNode(item);
lastNode->InsertAtEnd(currNode);
lastNode = currNode;
}
// Print linked list
currNode = headNode->GetNext();
while (currNode != NULL) {
currNode->PrintNodeData();
currNode = currNode->GetNext();
}
}
in c++ please. Thank you!.
�ShoppingList.java�import java.util.Scanner;public class Sho.pdf
ShoppingList.java
import java.util.Scanner;
public class ShoppingList {
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
ItemNode headNode; // Create intNode objects
ItemNode currNode;
ItemNode lastNode;
String item;
int i;
// Front of nodes list
headNode = new ItemNode();
lastNode = headNode;
int input = scnr.nextInt();
for(i = 0; i < input; i++ ){
item = scnr.next();
currNode = new ItemNode(item);
lastNode.insertAtEnd(headNode, currNode);
lastNode = currNode;
}
// Print linked list
currNode = headNode.getNext();
while (currNode != null) {
currNode.printNodeData();
currNode = currNode.getNext();
}
}
}
ItemNode.java
public class ItemNode {
private String item;
private ItemNode nextNodeRef; // Reference to the next node
public ItemNode() {
item = "";
nextNodeRef = null;
}
// Constructor
public ItemNode(String itemInit) {
this.item = itemInit;
this.nextNodeRef = null;
}
// Constructor
public ItemNode(String itemInit, ItemNode nextLoc) {
this.item = itemInit;
this.nextNodeRef = nextLoc;
}
// Insert node after this node.
public void insertAfter(ItemNode nodeLoc) {
ItemNode tmpNext;
tmpNext = this.nextNodeRef;
this.nextNodeRef = nodeLoc;
nodeLoc.nextNodeRef = tmpNext;
}
// TODO: Define insertAtEnd() method that inserts a node
// to the end of the linked list
ItemNode newNode = new ItemNode("Peanuts", null);
{
lastNode.insertAtEnd(newNode);
}
6.16 LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main() in the
ShoppingList class, define an insertAtEnd() method 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 where 4 is the number of items to be inserted; Kale, Lettuce, Carrots,
Peanuts are the names of the items to be added at the end of the list. The output is:.
#ifndef LINKED_LIST_ #define LINKED_LIST_ templateclass It.pdf
#ifndef LINKED_LIST_
#define LINKED_LIST_
template
class LinkedList {
private:
std::shared_ptr> headPtr; // Pointer to first node in the chain;
// (contains the first entry in the list)
int itemCount; // Current count of list items
std::shared_ptr> getNodeAt(int position) const;
public:
LinkedList();
LinkedList(const LinkedList& aList);
virtual ~LinkedList();
bool isEmpty() const;
int getLength() const;
bool insert(int newPosition, const ItemType& newEntry);
bool remove(int position);
void clear();
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
ItemType getEntry(int position) const throw(PrecondViolatedExcept);
/** throw PrecondViolatedExcept if position < 1 or
position > getLength(). */
void replace(int position, const ItemType& newEntry)
throw(PrecondViolatedExcept);
// Operator Overloading
void operator = (const LinkedList& arg);
friend std::ostream& operator << (std::ostream& os, const LinkedList& arg)
{
os << \"There are \" << arg.getLength() << \" values in the list:\" << std::endl;
for (int i{ 1 }; i <= arg.getLength(); i++) {
os << arg.getEntry(i) << std::endl;
}
os << std::endl << std::endl << std::endl << std::endl;
return os;
}
};
// Returns a pointer to the Node at the given position.
template
std::shared_ptr> LinkedList::getNodeAt (int position) const {
std::shared_ptr> currPtr{ headPtr };
for (int i{ 1 }; i < position; i++)
currPtr = currPtr->getNext();
return currPtr;
}
// Default constructor.
template
LinkedList::LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Copy constructor.
template
LinkedList::LinkedList(const LinkedList& aList) {
itemCount = aList.getLength();
auto currPtr{ aList.headPtr };
auto newNodePtr{ headPtr = std::make_shared>(currPtr->getItem()) };
auto prevNodePtr{ newNodePtr };
currPtr = currPtr->getNext();
for (int i{ 2 }; i <= itemCount; i++) {
newNodePtr = std::make_shared>(currPtr->getItem());
prevNodePtr->setNext(newNodePtr);
prevNodePtr = newNodePtr;
currPtr = currPtr->getNext();
}
}
// Destructor.
template
LinkedList::~LinkedList() {
headPtr = nullptr;
itemCount = 0;
}
// Accessor/Info Functions.
template
bool LinkedList::isEmpty() const {
return (itemCount > 0)?0:1;
}
template
int LinkedList::getLength() const {
return itemCount;
}
// Places a Node at a given position (element at the same position is now pos+1).
template
bool LinkedList::insert(const int newPosition,
const ItemType& newEntry)
{
bool ableToInsert{ (newPosition >= 1) &&
(newPosition <= itemCount + 1) };
if (ableToInsert)
{
// Create a new node containing the new entry
auto newNodePtr{ std::make_shared>(newEntry) };
// Attach new node to chain
if (newPosition == 1)
{
// Insert new node at beginning of chain
newNodePtr->setNext(headPtr);
headPtr = newNodePtr;
}
else
{
// Find node that will be before new node
auto prevPtr{ getNodeAt(newPosition - 1) };
// Insert new node after node to which prevPtr points
newNodePtr->setNext(prevPtr->getNext());
prevPtr->setNext(newNodePtr);
} // end if
itemCount++; // .
Given main() in the Inventory class, define an insertAtFront() metho.pdf
Given main() in the Inventory class, define an insertAtFront() method in the InventoryNode class
that inserts items at the front of a linked list (after the dummy head node).
Ex. If the input is:
the output is:
CODE:
public class InventoryNode {
private String item;
private int numberOfItems;
private InventoryNode nextNodeRef; // Reference to the next node
public InventoryNode() {
item = "";
numberOfItems = 0;
nextNodeRef = null;
}
// Constructor
public InventoryNode(String itemInit, int numberOfItemsInit) {
this.item = itemInit;
this.numberOfItems = numberOfItemsInit;
this.nextNodeRef = null;
}
// Constructor
public InventoryNode(String itemInit, int numberOfItemsInit, InventoryNode nextLoc) {
this.item = itemInit;
this.numberOfItems = numberOfItemsInit;
this.nextNodeRef = nextLoc;
}
// TODO: Define an insertAtFront() method that inserts a node at the
// front of the linked list (after the dummy head node)
// Get location pointed by nextNodeRef
public InventoryNode getNext() {
return this.nextNodeRef;
}
// Print node data
public void printNodeData() {
System.out.println(this.numberOfItems + " " + this.item);
}
}.
This is the main file include itemh include itemList.pdf
//This is the main file
#include "item.h"
#include "itemList.h"
int main()
{
//create a list of items
ItemList groceryList;
//create temp variables
Item anItem;
int count = 0, newNum = 0;
char newName[MAXCHAR], findName[MAXCHAR];
//read from user and add to list
cin >> count;
cin.ignore(100, 'n');
for(int i = 0; i < count; i++)
{
cin >> newName;
cin >> newNum;
cin.ignore(100, 'n');
anItem.setItemName(newName);
anItem.setNumItems(newNum);
groceryList.InsertAtFront(anItem);
}
groceryList.showList();
cin >> findName;
if(!groceryList.findItem(findName))
{
cout << "Item not found!";
}
return 0;
}
item.h
//Item header file
//
#pragma once
#include <iostream>
#include <cstring>
using namespace std;
//constant for char arrays
const int MAXCHAR = 101;
//class definition
class Item {
private:
char *itemName;
int numberOfItems;
public:
//Constructors
Item();
Item(char *, int);
//copy constructor
Item(const Item &anItem);
//destructor
~Item();
//mutators
void setItemName(char *);
void setNumItems(int);
//accessors
void getItemName(char *);
int getNumItems();
//print item
void printItem();
//assignment op overloading
Item& operator= (const Item& anItem);
};
item.cpp
//This is the implementation file for item.h (the Item class)
#include "item.h"
//default constructor
Item::Item()
{
//allocate memory for itemName
itemName = new char[MAXCHAR];
strcpy(this->itemName, "no name");
numberOfItems = 0;
}
//constructor with parameters
Item::Item(char tempItemName[], int tempNumItems)
{
//allocate memory for itemName
itemName = new char[strlen(tempItemName) + 1];
strcpy(itemName, tempItemName);
numberOfItems = tempNumItems;
}
//Copy Constructor
Item::Item(const Item &anItem)
{
//allocate memory for itemName
itemName = new char[strlen(anItem.itemName) + 1];
strcpy(itemName, anItem.itemName);
numberOfItems = anItem.numberOfItems;
}
//destructor
Item::~Item()
{
//deallocate the memory for itemName
if(itemName)
{
delete [] itemName;
itemName = NULL;
}
}
//mutator functions
void Item::setItemName(char *newItemName)
{
if(itemName)
{
delete [] itemName;
}
itemName = new char[strlen(newItemName) + 1];
strcpy(itemName, newItemName);
}
//for numberofitems
void Item::setNumItems(int newNum)
{
numberOfItems = newNum;
}
//accessor functions
void Item::getItemName(char *returnItemName)
{
strcpy(returnItemName, itemName);
}
int Item::getNumItems()
{
return numberOfItems;
}
//print the item
void Item::printItem()
{
cout << numberOfItems << ' ' << itemName << endl;
}
//assignment operator overload
Item& Item::operator= (const Item& anItem)
{
//if it is a self copy, don't do anything
if (this == &anItem)
return *this;
//make current object *this a copy of the passed in item
else
{
this->setItemName(anItem.itemName);
this->numberOfItems = anItem.numberOfItems;
return *this;
}
}
itemList.h
//This is the itemList header file.
//Class for a list of items
#pragma once
#include "item.h"
//define class for a list of items
class ItemList
{
private:
//struct for each Node
struct Node
{
Item d.
#includeiostream#includecstdio#includecstdlibusing names.pdf
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*last;
/*
* Class Declaration
*/
class circular_llist
{
public:
void create_node(int value);
void add_begin(int value);
void add_after(int value, int position);
void delete_element(int value);
void search_element(int value);
void display_list();
void update();
void sort();
circular_llist()
{
last = NULL;
}
};
/*
* Create Circular Link List
*/
void circular_llist::create_node(int value)
{
struct node *temp;
temp = new(struct node);
temp->info = value;
if (last == NULL)
{
last = temp;
temp->next = last;
}
else
{
temp->next = last->next;
last->next = temp;
last = temp;
}
}
/*
* Insertion of element at beginning
*/
void circular_llist::add_begin(int value)
{
if (last == NULL)
{
cout<<\"First Create the list.\"<info = value;
temp->next = last->next;
last->next = temp;
}
/*
* Deletion of element from the list
*/
void circular_llist::delete_element(int value)
{
struct node *temp, *s;
s = last->next;
/* If List has only one element*/
if (last->next == last && last->info == value)
{
temp = last;
last = NULL;
free(temp);
return;
}
if (s->info == value) /*First Element Deletion*/
{
temp = s;
last->next = s->next;
free(temp);
return;
}
while (s->next != last)
{
/*Deletion of Element in between*/
if (s->next->info == value)
{
temp = s->next;
s->next = temp->next;
free(temp);
cout<<\"Element \"<next;
}
/*Deletion of last element*/
if (s->next->info == value)
{
temp = s->next;
s->next = last->next;
free(temp);
last = s;
return;
}
/*
* Display Circular Link List
*/
void circular_llist::display_list()
{
struct node *s;
if (last == NULL)
{
cout<<\"List is empty, nothing to display\"<
Solution
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*last;
/*
* Class Declaration
*/
class circular_llist
{
public:
void create_node(int value);
void add_begin(int value);
void add_after(int value, int position);
void delete_element(int value);
void search_element(int value);
void display_list();
void update();
void sort();
circular_llist()
{
last = NULL;
}
};
/*
* Create Circular Link List
*/
void circular_llist::create_node(int value)
{
struct node *temp;
temp = new(struct node);
temp->info = value;
if (last == NULL)
{
last = temp;
temp->next = last;
}
else
{
temp->next = last->next;
last->next = temp;
last = temp;
}
}
/*
* Insertion of element at beginning
*/
void circular_llist::add_begin(int value)
{
if (last == NULL)
{
cout<<\"First Create the list.\"<info = value;
temp->next = last->next;
last->next = temp;
}
/*
* Deletion of element from the list
*/
void circular_llist::delete_element(int value)
{
struct node *temp, *s;
s = last->next;
/* If List has only one element*/
if (last->next == last && last->info == value)
{
temp = last;
last = NULL;
free(temp);
return;
}
if (s->info == value) /*First Element Deletion*/
{
temp = s;
last->next = s->next;
free(temp);
return;
}
while (s->next != .
In C++ I need help with this method that Im trying to write fillLi.pdf
In C++ I need help with this method that I'm trying to write: fillListFromFile( ) : void -- this
method will add elements to the list from a file called linkedListData1.txt HINT: this is where
you will keep track of the number of elements in the list
I have all of the other methods, but I'm stuck on this one and I've added it as the last method in
the application. The code I have so far is below.
.cpp file:
.h file:
main:
#include
#include
#include
#include "Node.h"
using namespace std;
void displayList(Node*);
void insertFront(Node** head, int value);
void insertBack(Node** ptrToHead, int value);
void insertAfter(Node* previous, int value);
void deleteAtN(Node** ptrToHead, int n);
void deleteNode(Node** ptrToHead, int searchVal);
void clearList(Node**);
bool searchVal(Node** head, int value);
int countFrequencyOf(Node** ptrTohead, int value);
int size(Node** ptrTohead);
void displayFromFrontToN(Node** ptrToHead, int n);
void displayFromNToEnd(Node** ptrToHead, int n);
void insertInOrder(Node** head, Node* ptrToHead);
void displayInRows(Node** ptrToHead);
int main()
{
Node* node1 = new Node();
node1->setValue(10);
Node* node2 = new Node();
node2->setValue(20);
Node* node3 = new Node();
node3->setValue(30);
node1->next = node2;
node2->next = node3;
Node* head = node1;
displayList(head);
insertFront(&head, 5);
displayList(head);
insertBack(&head, 50);
displayList(head);
insertBack(&head, 60);
displayList(head);
insertAfter(node2, 25);
displayList(head);
deleteAtN(&head, 2);
displayList(head);
deleteNode(&head, 50);
displayList(head);
clearList(&head);
displayList(head);
insertFront(&head, 5);
insertFront(&head, 10);
insertFront(&head, 20);
insertBack(&head, 50);
searchVal(&head, 50);
displayList(head);
countFrequencyOf(&head, 25);
displayList(head);
insertBack(&head, 25);
insertFront(&head, 25);
countFrequencyOf(&head, 25);
displayList(head);
size(&head);
cout << "add one item to list" << endl;
insertBack(&head, 25);
size(&head);
displayList(head);
cout << "Display From Front To N" << endl;
displayFromFrontToN(&head, 4);
cout << "Display From N To End" << endl;
displayFromNToEnd(&head, 3);
cout << "Display In Rows" << endl;
displayInRows(&head);
insertFront(&head, 12);
insertFront(&head, 17);
insertFront(&head, 22);
insertBack(&head, 58);
cout << "Display In Rows" << endl;
displayInRows(&head);//call displayInRows()
return 0;
}//end main()
void displayList(Node* ptr) {
if (ptr == nullptr)
cout << "empty list" << endl;
else {
while (ptr != nullptr) {
cout << ptr->getValue() << endl;
ptr = ptr->next;
}
}
cout << "---------------------------" << endl;
}//end displayList()
void insertFront(Node** head, int value) {
Node* newNode = new Node();
newNode->setValue(value);
//cout<< newNode->getValue() << endl;
newNode->next = *head;
*head = newNode;
}
void insertBack(Node** ptrToHead, int value) {
Node* newNode = new Node();
newNode->setValue(value);
newNode->next = nullptr;
if (*ptrToHead == nullptr)
{
*ptrToHead = newNode;
}//end if
else
{
Node* last .
Can you please debug this Thank you in advance! This program is sup.pdf
Can you please debug this? Thank you in advance! This program is supposed to use stacks and
find the paths of an airplane. It should tell you whether or not the plane goes from the requested
city to the requested destination. requestFile.txt contains the requests, flightFile.txt contains the
flights and cityFile.txt contains the city\'s that the airline serves.
My errors: my output is simply \"Hpair does not serve Los Angeles.\" Thats it and it stops.
It should look something like (these are not real values of the file just an example):
\"Request is to fly from cityA to CityB.
Hpair flight from cityA to CityB.
Request is to fly from cityC to cityD.
Sorry, HPAir does not serve City D
Request is to fly from cityE to CityF
Sorry, HPAir does not fly from cityE to CityF\"
**It said to use ispath.cpp but I got confused on how to implement it completely.\"
isPath.cpp
//***I did not include ispath.cpp in my program. Parts of it are in the map.h portion.
main.cpp
#include
#include
#include \"Map.h\"
using namespace std;
int main()
{
Map aMap;
aMap.readFlights();
aMap.verifyRequestedFile();
}
StackInterface.h
#ifndef StackInterface_h
#define StackInterface_h
template
class StackInterface
{
/** Checks if the stack is empty.
@return True if the stack is empty or false if the stack is not.*/
virtual bool isEmpty() const = 0;
/** Adds a new item to the stack
@post newEntry is at the top of the stack
@param newEntry is the object to be added to the stack
@return True if successfully added, otherwise false. */
virtual bool push(const ItemType& newEntry) = 0;
/** Removes item from stack
@post The top item in the stack is removed
@return True if the item was removed, false if it was not. */
virtual bool pop() = 0;
/** Returns the top item in the stack
@pre The stack is not empty
@post The top item in the stack is returned
@return The top of the stack */
virtual ItemType peek() const = 0;
};
#endif /* StackInterface_h */
Node.h
#ifndef node_h
#define node_h
template
class Node {
public:
Node();
Node (const ItemType &anItem);
Node(const ItemType &anItem, Node * nextNodePtr);
void setItem(const ItemType &anItem);
void setNext(Node * nextNodePtr);
ItemType getItem() const;
Node* getNext() const;
private:
ItemType item;
Node* next;
};
template
Node::Node():next(nullptr){}
template
Node::Node(const ItemType &anItem):item(anItem), next(nullptr){}
template
Node::Node(const ItemType &anItem, Node * nextNodePtr):item(anItem), next(nextNodePtr)
{
}
template
void Node::setItem(const ItemType &anItem){
item = anItem;
}
template
void Node::setNext(Node * nextNodePtr) {
next = nextNodePtr;
}
template
ItemType Node::getItem() const {
return item;
}
template
Node* Node::getNext()const{
return next;
}
#endif /* node_h */
LinkedStack.h
#include
#ifndef LinkedStack_h
#define LinkedStack_h
#include \"Node.h\"
#include \"StackInterface.h\"
template
class LinkedStack:public StackInterface{
public:
LinkedStack();
LinkedStack(const LinkedStack &aStack); //space matter?***********
virt.
Implement the following specification of UnsortedType using circular.pdf
Implement the following specification of UnsortedType using circular linked list as the
implementation structure.
*** I have seen this question answered here before but it is not a good answer. Can someone
please give me a original answer.***
// Deliverables:
// - A listing of the specification and implementation files for UnsortedType
// - A listing of the driver program for your test plan
// - A listing of the test plan as input to the driver.
// - A listing of the output from the driver.
template
struct NodeType;
/* Assumption: ItemType is a type for which the operators
\"<\" and \"==\" are defined-either an appropriate built-in type or a
class that overloads these operators. */
template
class UnsortedType
{
public:
// Class constructor, destructor, and copy constructor
UnsortedType();
~UnsortedType();
UnsortedType(const UnsortedType&);
void operator=(UnsortedType);
bool IsFull() const;
// Determines whether list is full.
//Post: Function value = (list is full)
int GetLength() const;
// Determines the number of elements in list.
// Post: Function value = number of elements in list.
void RetrieveItem(ItemType& item, bool& found);
// Retrieves list element whose key matches item\'s key
// (if present).
// Pre: Key member of item is initialized.
// Post: If there is an element someItem whose key matches
// item\'s key, then found = true and item is a copy of
// someItem; otherwise found = false and item is unchanged.
// List is unchanged.
void InsertItem(ItemType item);
// Adds item to list.
// Pre: List is not full.
// Item is not in list.
// Post: item is in list.
void DeleteItem(ItemType item);
// Deletes the element whose key matches item\'s key
// Pre: Key member of item is initialized.
// One and only one element in list has a key matching
// item\'s key.
// Post: No element in list has a key matching item\'s key.
void ResetList();
// Initializes current position for an iteration through the list.
// Post: Current position is prior to list.
void GetNextItem(ItemType&);
// Gets the next element in list.
// Pre: Current position is defined.
// Element at current position is not last in list.
// Post: Current position is updated to next position.
// item is a copy of element at current position.
private:
NodeType* listData;
int length;
NodeType* currentPos;
};
Solution
#include
#include
/* structure for a node */
struct node
{
int data;
struct node *next;
};
/* function to insert a new_node in a list in sorted way.
Note that this function expects a pointer to head node
as this can modify the head of the input linked list */
void sortedInsert(struct node** head_ref, struct node* new_node)
{
struct node* current = *head_ref;
// Case 1 of the above algo
if (current == NULL)
{
new_node->next = new_node;
*head_ref = new_node;
}
// Case 2 of the above algo
else if (current->data >= new_node->data)
{
/* If value is smaller than head\'s value then
we need to change next of last node */
while(current->next != *head_ref)
current = current->next;
cur.
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
Assignment is:
\"Page 349-350 #4 and #5 Use the \"Linked List lab\" you have been working on in class and add
the two functions the questions are asking you to develop: divideMid and divideAt. Be sure to
include comments Use meaningful identifier names (constants where appropriate) Turn in .cpp
file AND Turn in a \"print-screen\' of your output (press \"print-screen\' on keyboard, then
\'paste\' in MS-Word)\"
How do you solve QUESTION #4 in the book data structures using c++ by D.S. Malik in Visiual
Studios using the linked list below with what is being asked? Please need help
Linked list :
#include
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *first, *last;
int num;
createList(first, last);
int choice;
while(true)
{
cout<<\"1. Insert Front.\ 2. Insert Last.\ 3. Delete Front.\ 4. Delete Last.\ 5. Print List.\ 6. Exit.\
\";
cout<<\"Enter your choice: \";
cin>>choice;
switch(choice)
{
case 1: insertFront(first); break;
case 2: insertBack(last); break;
case 3: deleteFirst(first); break;
case 4: deleteLast(last, first); break;
case 5: printList(first); break;
case 6: return 0;
default: cout<<\"Invalid menu option. Try again.\"<>number;
while (number != -999)
{
newNode = new nodeType; // create new node
newNode->info = number;
newNode->link = NULL;
if (first == NULL)
{
first = newNode;
last = newNode;
}
else
{
last->link = newNode;
last = newNode;
}
cout<<\"Enter an integer (-999 to stop): \";
cin>>number;
} // end of while-loop
} // end of build list function
void deleteFirst(nodeType*& first)
{
nodeType *temp;
temp= first;
first= temp->link;
delete temp;
return;
}
void deleteLast(nodeType*& last, nodeType* current)
{
nodeType *temp;
while(current->link != NULL)
{
temp=current;
current=current->link;
}
temp=last;
current->link=NULL;
delete temp;
last = current;
return;
}
void insertFront(nodeType*& front)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= front;
front= newNode;
return;
}
void insertBack(nodeType*& last)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= NULL;
last->link= newNode;
last = newNode;
return;
}
void printList(nodeType*& first)
{
cout<<\"Inside printList...printing linked list...\ \"<info << \" \";
current = current->link;
}
cout<
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *firs.
How to do insertion sort on a singly linked list with no header usin.pdf
How to do insertion sort on a singly linked list with no header using C?
Solution
/* C program for insertion sort on a linked list */
#include
#include
/* Link list node */
struct node
{
int data;
struct node* next;
};
// Function to insert a given node in a sorted linked list
void sortedInsert(struct node**, struct node*);
// function to sort a singly linked list using insertion sort
void insertionSort(struct node **head_ref)
{
// Initialize sorted linked list
struct node *sorted = NULL;
// Traverse the given linked list and insert every
// node to sorted
struct node *current = *head_ref;
while (current != NULL)
{
// Store next for next iteration
struct node *next = current->next;
// insert current in sorted linked list
sortedInsert(&sorted, current);
// Update current
current = next;
}
// Update head_ref to point to sorted linked list
*head_ref = sorted;
}
/* function to insert a new_node in a list. Note that this
function expects a pointer to head_ref as this can modify the
head of the input linked list (similar to push())*/
void sortedInsert(struct node** head_ref, struct node* new_node)
{
struct node* current;
/* Special case for the head end */
if (*head_ref == NULL || (*head_ref)->data >= new_node->data)
{
new_node->next = *head_ref;
*head_ref = new_node;
}
else
{
/* Locate the node before the point of insertion */
current = *head_ref;
while (current->next!=NULL &&
current->next->data < new_node->data)
{
current = current->next;
}
new_node->next = current->next;
current->next = new_node;
}
}
/* BELOW FUNCTIONS ARE JUST UTILITY TO TEST sortedInsert */
/* Function to print linked list */
void printList(struct node *head)
{
struct node *temp = head;
while(temp != NULL)
{
printf(\"%d \", temp->data);
temp = temp->next;
}
}
/* A utility function to insert a node at the beginning of linked list */
void push(struct node** head_ref, int new_data)
{
/* allocate node */
struct node* new_node = new node;
/* put in the data */
new_node->data = new_data;
/* link the old list off the new node */
new_node->next = (*head_ref);
/* move the head to point to the new node */
(*head_ref) = new_node;
}
// Driver program to test above functions
int main()
{
struct node *a = NULL;
push(&a, 5);
push(&a, 20);
push(&a, 4);
push(&a, 3);
push(&a, 30);
printf(\"Linked List before sorting \ \");
printList(a);
insertionSort(&a);
printf(\"\ Linked List after sorting \ \");
printList(a);
return 0;
}
/* C program for insertion sort on a linked list */
#include
#include
/* Link list node */
struct node
{
int data;
struct node* next;
};
// Function to insert a given node in a sorted linked list
void sortedInsert(struct node**, struct node*);
// function to sort a singly linked list using insertion sort
void insertionSort(struct node **head_ref)
{
// Initialize sorted linked list
struct node *sorted = NULL;
// Traverse the given linked list and insert every
// node to sorted
struct node *current = *head_ref;
while (current != NULL)
{
// Store next for next iteration
struct.
take the following code and give details of what each line of code i.pdf
take the following code and give details of what each line of code is doing
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<info<<\"->\";
temp = temp->next;
}
cout<<\"NULL\"<
Solution
ANSWER ::
ASSMUING THE TOTAL LINE IN CODE ARE 158*(INCLUDING COMMENTS)
SO...
PROGRAM STARTS WITH SPECIFING HEADER FILES AND GLOBAL VARIABLE
DECLARATION
THEN Node Declaration USING STRUCTURES,
THEN WE WANT TO DECLARE THE CLASS USING SINGLE LINKED LIST AND THE
PROTOTYPE IS PUBLIC
IN THE PUBLIC WE WANT TO CREATE THE NODE AS INTEGER DATATYPE
THE NODE CONSIST OF insert_begin();
insert_pos();-> INDICATES THE CURRENT POSSITION
insert_last();->INSERT AT LAST
delete_pos();->TO DELETE THE NUMBER AT CURRENT POSITION
sort();->START THE SORTING
search();->USED TO SEARCH
update();->UPDATE THE NODE
reverse();->REVERSE NUMBERS
display();->TO DISPLAY THE NODE
single_llist()->FIFO
WE ARE STARTING TAKING NULL VALUE
AND THEN TAKE USER DEFIND FUNCTION MAIN()
CREATE THE DATATYPES choice, nodes, element, position, i
OBJECT CREATION OF SLL IS SL
USING WHILE LOOP THE NODE INSERT AT THE BEGINING OR ENDING STAGE
WE ARE USING SWITCH CASES TO PERFORM SLL ON NODE
NODE CREATION AS
node *single_llist::create_node(int value)
ALSO DECLARE THE TEMP IS TAKEN AS NULL VALUE
INSERT THE ELEMENT AT THE BEGINING
USING IF CONDITION WE CAN INSERT THE NODE AT THE BEGINING
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
AND THEN INSERT THE NODE AT THE LAST
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
USING WHILE LOOP WE ARE INSERTING THE NODE AT LAST
USING THIS BELLOW CODE WE CAN SEARCH THE ELEMENTS IN THE NODE
struct node *temp;
if (start == NULL)
{
cout<<\"The List is Empty\"<info<<\"->\";
temp = temp->next;
}
cout.
AnswerNote LinkedList.cpp is written and driver program main.cpp.pdf
Answer:
Note: LinkedList.cpp is written and driver program main.cpp is also given.
//ListInterface.h
#ifndef _LIST_INTERFACE
#define _LIST_INTERFACE
template
class ListInterface
{
public:
virtual bool isEmpty() const = 0;
virtual int getLength() const = 0;
virtual bool insert(int newPosition, const ItemType& newEntry) = 0;
virtual bool remove(int position) = 0;
virtual void clear() = 0;
virtual ItemType getEntry(int position) const = 0;
virtual void replace(int position, const ItemType& newEntry) = 0;
}; // end ListInterface
#endif
//Node.h
#ifndef NODE_
#define NODE_
template
class Node
{
private:
ItemType item; // A data item
Node* next; // Pointer to next node
public:
Node();
Node(const ItemType& anItem);
Node(const ItemType& anItem, Node* nextNodePtr);
void setItem(const ItemType& anItem);
void setNext(Node* nextNodePtr);
ItemType getItem() const ;
Node* getNext() const ;
}; // end Node
#endif
//Node.cpp
#include \"Node.h\"
template
Node::Node() : next(nullptr)
{
} // end default constructor
template
Node::Node(const ItemType& anItem) : item(anItem), next(nullptr)
{
} // end constructor
template
Node::Node(const ItemType& anItem, Node* nextNodePtr) :
item(anItem), next(nextNodePtr)
{
} // end constructor
template
void Node::setItem(const ItemType& anItem)
{
item = anItem;
} // end setItem
template
void Node::setNext(Node* nextNodePtr)
{
next = nextNodePtr;
} // end setNext
template
ItemType Node::getItem() const
{
return item;
} // end getItem
template
Node* Node::getNext() const
{
return next;
} // end getNext
//PrecondViolatedExcept.h
#ifndef PRECOND_VIOLATED_EXCEPT_
#define PRECOND_VIOLATED_EXCEPT_
#include
#include
class PrecondViolatedExcept : public std::logic_error
{
public:
PrecondViolatedExcept(const std::string& message = \"\");
}; // end PrecondViolatedExcept
#endif
//PrecondViolatedExcept.cpp
#include \"PrecondViolatedExcept.h\"
PrecondViolatedExcept::PrecondViolatedExcept(const std::string& message)
: std::logic_error(\"Precondition Violated Exception: \" + message)
{
} // end constructor
//LinkedList.h
#ifndef LINKED_LIST_
#define LINKED_LIST_
#include \"ListInterface.h\"
#include \"Node.h\"
#include
#include \"PrecondViolatedExcept.h\"
template
class LinkedList : public ListInterface
{
private:
Node* headPtr; // Pointer to first node in the chain;
// (contains the first entry in the list)
int itemCount; // Current count of list items
// Locates a specified node in this linked list.
Node* getNodeAt(int position) const;
public:
LinkedList();
LinkedList(const LinkedList& aList);
virtual ~LinkedList();
bool isEmpty() const;
int getLength() const;
bool insert(int newPosition, const ItemType& newEntry);
bool remove(int position);
void clear();
ItemType getEntry(int position) const;
void replace(int position, const ItemType& newEntry);
}; // end LinkedList
#endif
//LinkedList.cpp
#include \"LinkedList.h\"
#include
#include
#include
#include
//Default constructor
template
LinkedList::LinkedList() : headPtr(nullptr), itemCount(0)
{
.
C++ Please write the whole code that is needed for this assignment- wr.docx
Brianca plans to save $5,000, $1,000, and $42,000 a year over the next three years, respectively. How much would you need to deposit in one lump sum today to have the same amount as Brianca three years from now if you both earn 10.9 percent, compounded annually? $36,115 $35,192 $43,282 $41,635 $35,372
.
Using the provided table interface table.h and the sample linked lis.pdf
Using the provided table interface table.h and the sample linked list code linkedList.c, complete
an implementation of the Table ADT. Make sure that you apply the concepts of design by
contract (DbC) to your implementation.
Once you have fully implemented the table, create a main.c file that implements a testing
framework for your table.
Your table implementation must ensure that values inserted are unique, and internally sorted
within a linked list.
table.h
linkedList.c
Solution
khsdg
#include
#include
typedef enum BOOL { false, true } bool;
// Linked list node definition
typedef struct Node node;
struct Node
{
int number;
node *next;
};
static node *top = NULL;
// used to track where we are for the list traversal methods
static node *traverseNode = NULL;
// \"destroy\" will deallocate all nodes in a linked list object
// and will set \"top\" to NULL.
void destroy()
{
node *curr = top;
node *temp = NULL;
while ( curr != NULL )
{
// flip order to see it blow up...
temp = curr;
curr = curr->next;
free( temp );
}
top = NULL;
}
// \"build\" will create an ordered linked list consisting
// of the first \"size\" even integers.
void build( int size )
{
node *newNode = NULL;
int i = 0;
// make sure we don\'t have a list yet
destroy();
for ( i=size ; i>0 ; i-- )
{
newNode = malloc( sizeof( node ) );
newNode->number = i*2;
newNode->next = top;
top = newNode;
}
}
// starts a list traversal by getting the data at top.
// returns false if top == NULL.
bool firstNode( int *item )
{
bool result = false;
if ( top )
{
*item = top->number;
traverseNode = top->next;
result = true;
}
return result;
}
// gets the data at the current traversal node and increments the traversal.
// returns false if we\'re at the end of the list.
bool nextNode( int *item )
{
bool result = false;
if ( traverseNode )
{
*item = traverseNode->number;
traverseNode = traverseNode->next;
result = true;
}
return result;
}
// \"print\" will output an object\'s entire linked list
// to the standard output device -- one \"number\" per line.
void print()
{
int value;
if ( firstNode( &value ) )
{
do
{
printf( \"%d\ \", value );
} while ( nextNode( &value ) );
}
}
int main( int argc, char *argv[] )
{
build( 10 );
print();
destroy();
build( 5 );
build( 20 );
print();
destroy();
return 0;
}.
This assignment and the next (#5) involve design and development of a.pdf
This assignment and the next (#5) involve design and development of a sequential
non contiguous and dynamic datastructure called LinkedList. A linked list object is
a container consisting of connected ListNode objects. As before, we are not going
to use pre-fabricated classes from the c++ library, but construct the LinkedList
ADT from scratch.
The first step is construction and testing of the ListNode class. A ListNode object
contains a data field and a pointer to the next ListNode object (note the recursive
definition).
#This assignment requires you to
1. Read the Assignment 4 Notes
2. Watch the Assignment 4 Support video
3. Implement the following methods of the ListNode class
-custom constructor
-setters for next pointer and data
4. Implement the insert and remove method in the main program
5. Scan the given template to find the above //TODO and implement the code
needed
//TODO in ListNodecpp.h file
public: ListNode(T idata, ListNode<T> * newNext);
public: void setNext(ListNode<T> * newNext);
public: void setData(T newData);
// TODO in main program
void remove(ListNode<int> * &front,int value)
void insert(ListNode<int> * &front,int value)
# The driver is given ListNodeMain.cpp is given to you that does the following
tests
1. Declares a pointer called front to point to a ListNode of datatype integer
2. Constructs four ListNodes with data 1,2,4 and adds them to form a linked
list.
3. Inserts ListNode with data 3 to the list
4. Removes node 1 and adds it back to test removing and adding the first
element
5. Removes node 3 to test removing a middle node
6. Removes node 4 to test removing the last node
7. Attempt to remove a non existent node
8. Remove all existing nodes to empty the list
9. Insert node 4 and then node 1 to test if insertions preserve order
10.Print the list
Main.cpp
#include <iostream>
#include "ListNodecpp.h"
// REMEMBER each ListNode has two parts : a data field
// and an address field. The address is either null or points to the next node
//in the chain
//Requires: integer value for searching, address of front
//Effects: traverses the list node chain starting from front until the end comparing search value
with listnode getData. Returns the original search value if found, if not adds +1 to indicate not
found
//Modifies: Nothing
int search(ListNode<int> * front, int value);
//Requires: integer value for inserting, address of front
//Effects: creates a new ListNode with value and inserts in proper position (increasing order)in
the chain. If chain is empty, adds to the beginning
//Modifies: front, if node is added at the beginning.
//Also changes the next pointer of the previous node to point to the
//newly inserted list node. the next pointer of the newly inserted pointer
//points to what was the next of the previous node.
//This way both previous and current links are adjusted
//******** NOTE the use of & in passing pointer to front as parameter -
// Why do you think this is needed ?**********
void insert(ListNode<int> * &fr.
A)B) C++ program to create a Complete Binary tree from its Lin.pdf
A)
B)
// C++ program to create a Complete Binary tree from its Linked List
// Representation
#include
#include
#include
using namespace std;
// Linked list node
struct ListNode
{
int data;
ListNode* next;
};
// Binary tree node structure
struct BinaryTreeNode
{
int data;
BinaryTreeNode *left, *right;
};
// Function to insert a node at the beginning of the Linked List
void push(struct ListNode** head_ref, int new_data)
{
// allocate node and assign data
struct ListNode* new_node = new ListNode;
new_node->data = new_data;
// link the old list off the new node
new_node->next = (*head_ref);
// move the head to point to the new node
(*head_ref) = new_node;
}
// method to create a new binary tree node from the given data
BinaryTreeNode* newBinaryTreeNode(int data)
{
BinaryTreeNode *temp = new BinaryTreeNode;
temp->data = data;
temp->left = temp->right = NULL;
return temp;
}
// converts a given linked list representing a complete binary tree into the
// linked representation of binary tree.
void convertList2Binary(ListNode *head, BinaryTreeNode* &root)
{
// queue to store the parent nodes
queue q;
// Base Case
if (head == NULL)
{
root = NULL; // Note that root is passed by reference
return;
}
// 1.) The first node is always the root node, and add it to the queue
root = newBinaryTreeNode(head->data);
q.push(root);
// advance the pointer to the next node
head = head->next;
// until the end of linked list is reached, do the following steps
while (head)
{
// 2.a) take the parent node from the q and remove it from q
BinaryTreeNode* parent = q.front();
q.pop();
// 2.c) take next two nodes from the linked list. We will add
// them as children of the current parent node in step 2.b. Push them
// into the queue so that they will be parents to the future nodes
BinaryTreeNode *leftChild = NULL, *rightChild = NULL;
leftChild = newBinaryTreeNode(head->data);
q.push(leftChild);
head = head->next;
if (head)
{
rightChild = newBinaryTreeNode(head->data);
q.push(rightChild);
head = head->next;
}
// 2.b) assign the left and right children of parent
parent->left = leftChild;
parent->right = rightChild;
}
}
// Utility function to traverse the binary tree after conversion
void inorderTraversal(BinaryTreeNode* root)
{
if (root)
{
inorderTraversal( root->left );
cout << root->data << \" \";
inorderTraversal( root->right );
}
}
// Driver program to test above functions
int main()
{
// create a linked list shown in above diagram
struct ListNode* head = NULL;
push(&head, 36); /* Last node of Linked List */
push(&head, 30);
push(&head, 25);
push(&head, 15);
push(&head, 12);
push(&head, 10); /* First node of Linked List */
BinaryTreeNode *root;
convertList2Binary(head, root);
cout << \"Inorder Traversal of the constructed Binary Tree is: \ \";
inorderTraversal(root);
return 0;
}
c)
#include
#include
using namespace std;
template
class bintree
{
bintree *left;
T data;
bintree *right;
public :
bintree()
{
left=right=NULL;
}
void create();
void preorder();
void inorder();
void pos.
#include stdafx.h #include iostream using namespace std;vo.docx
#include stdafx.h #include iostream using namespace std;vo
Write a program to find the number of comparisons using the binary se.docx
Write a program to find the number of comparisons using the binary se
implement the ListLinked ADT (the declaration is given in ListLinked.pdf
implement the ListLinked ADT (the declaration is given in ListLinked.h)(60 points)
- implement the following operations:
- constructor, assignment operator, destructor
- insert, remove, replace, clear
- isFull, isEmpty
- gotoBeginning, gotoEnd, gotoNext, gotoPrior, getCursor
implement the function moveToBeginning() that removes the data item marked by the cursor and
reinserts it at the beginning of the list
- implement the function insertBefore(..) that will insert the new data item before the cursor or if
the list is empty as the first element of the list
#include \"ListLinked.h\"
// ListNode member functions
template
List::ListNode::ListNode(const DataType& nodeData, ListNode* nextPtr)
{
this->dataItem = nodeData;
this->next = nextPtr;
}
// List member functions
template
List::List(int ignored = 0)
{
}
template
List::List(const List& other)
{
}
template
List& List::operator=(const List& other)
{
}
template
List::~List()
{
}
template
void List::insert(const DataType& newDataItem) throw (logic_error)
{
}
template
void List::remove() throw (logic_error)
{
}
template
void List::replace(const DataType& newDataItem) throw (logic_error)
{
}
template
void List::clear()
{
}
template
bool List::isEmpty() const
{
return false;
}
template
bool List::isFull() const
{
return false;
}
template
void List::gotoBeginning() throw (logic_error)
{
}
template
void List::gotoEnd() throw (logic_error)
{
}
template
bool List::gotoNext() throw (logic_error)
{
return false;
}
template
bool List::gotoPrior() throw (logic_error)
{
return false;
}
template
DataType List::getCursor() const throw (logic_error)
{
DataType t;
return t;
}
template
void List::moveToBeginning () throw (logic_error)
{
}
template
void List::insertBefore(const DataType& newDataItem) throw (logic_error)
{
}
#include \"show5.cpp\"
Solution
#include
#include
#include
using namespace std;
struct Node
{
int data;
Node *next;
};
Node *tail=NULL;
Node* Insert_atHead(Node *head, int data)
{
Node *temp=new Node;
temp->data=data;
temp->next=head;
head=temp;
return head;
}
Node* Insert_atTail(Node *head, int data)
{
Node *tail=head;
if(tail==NULL)
{
Node *temp = new Node;
temp->data=data;
temp->next=NULL;
head=temp;
return head;
}
while(tail!= NULL)
{
if(tail->next==NULL)
{
Node *temp=new Node;
temp->data=data;
temp->next=NULL;
tail->next=temp;
return tail;
}
else
{
tail=tail->next;
}
}
}
Node *Insert_atPosition(Node *head, int data, int position)
{
int i=0;
int j=position-1;
if(position==0)
{
Node *temp = new Node;
temp->data=data;
temp->next=head;
head=temp;
return head;
}
else
{
Node *temp=head;
while(inext;
i++;
}
Node *temp1 = new Node;
temp1->data=data;
temp1->next=temp->next;
temp->next=temp1;
return head;
}
return head;
}
Node* Delete(Node *head, int position)
{
Node *temp=head;
int i=1;
int j=position;
if(j==0)
{
head=head->next;
return head;
}
Node *temp1 = new Node;
while(j>0)
{
temp1=temp;
temp=temp->next;
j--;
}
temp1->next=temp->next;
delete temp;
return head;
}
int GetNode(Node *head,int posi.
C code on linked list #include stdio.h #include stdlib.h.pdf
For the ethanol water graph the simple distillation should be a steady smooth
increase, the fractional distillation should look like an s, that sort of takes a straight up jump in
the middle. I am unsure about the other mixture though sorry, hope that helps
Solution
For the ethanol water graph the simple distillation should be a steady smooth
increase, the fractional distillation should look like an s, that sort of takes a straight up jump in
the middle. I am unsure about the other mixture though sorry, hope that helps.
Write a program that accepts an arithmetic expression of unsigned in.pdf
Write a program that accepts an arithmetic expression of unsigned integers in postfix notation
and builds the arithmetic expression tree that represents that expression. From that tree, the
corresponding fully parenthesized infix expression should be displayed and a file should be
generated that contains the three address format instructions. This topic is discussed in the week
4 reading in module 2, section II-B. The main class should create the GUI shown below:
Pressing the Construct Tree button should cause the tree to be constructed and using that tree, the
corresponding infix expression should be displayed and the three address instruction file should
be generated. The postfix expression input should not be required to have spaces between every
token. Note in the above example that 9+- are not separated by spaces. The above example
should produce the following output file containing the three address instructions:
Add R0 5 9
Sub R1 3
R0 Mul R2 2 3
Div R3 R1 R2
Inheritance should be used to define the arithmetic expression tree. At a minimum, it should
involve three classes: an abstract class for the tree nodes and two derived classes, one for
operand nodes and another for operator nodes. Other classes should be included as needed to
accomplish good object-oriented design. All instance data must be declared as private.
You may assume that the expression is syntactically correct with regard to the order of operators
and operands, but you should check for invalid tokens, such as characters that are not valid
operators or operands such as 2a, which are not valid integers. If an invalid token is detected a
RuntimeException should be thrown and caught by the main class and an appropriate error
message should be displayed. Three Adddress Generator Enter Postfix Expression 359 2 3
Construct Tree Infix Expression ((3-(5 9))/ (2* 3
Solution
#include
#include
#include
#include
#include
struct TREE //Structure to represent a tree
{
char data;
struct TREE *right,*left,*root;
};
typedef TREE tree; /* Stack Using Linked List */
struct Stack //Structure to represent Stack
{
struct TREE *data;
struct Stack *next,*head,*top; //Pointers to next node,head and top
};
typedef struct Stack node;
node *Nw; //Global Variable to represent node
void initialize(node *&n)
{
n = new node;
n -> next = n -> head = n -> top = NULL;
}
void create(node *n)
{
Nw = new node; //Create a new node
Nw -> next = NULL; //Initialize next pointer field
if(n -> head == NULL) //if first node
{
n -> head = Nw; //Initialize head
n -> top = Nw; //Update top
}
}
void push(node *n,tree *ITEM)
{
node *temp = n -> head;
if(n -> head == NULL) //if First Item is Pushed to Stack
{
create(n); //Create a Node
n -> head -> data = ITEM; //Insert Item to head of List
n -> head = Nw;
return; //Exit from Function
}
create(n); //Create a new Node
Nw -> data = ITEM; //Insert Item
while(temp -> next != NULL)
temp = temp -> next; //Go to Last Node
temp -> next = Nw; //Point New node
n -> top = Nw; //Upda.
What can we say about these results Smokers have a nonstat.pdf
What can we say about these results? Smokers have a non-statistically significant (p=.58) relative
hazard of death that is 37% greater than that of nonsmokers following root canal. HR=1.37 Cl
limits 0.45 to 4.22 All of the above.
We use the recursion xixi1+i1iN We use 00 You need to o.pdf
We use the recursion xi=xi1+i,1iN. We use 0=0. You need to obtain 10 figures showing xi,1iN in
the combinations of the following set ups: (i) N=50 (ii) i 's are standard normal (iii) i 's are t(5) (iv) =
.1 (v) =.5 (vi) =.9 (vii) =1 (viii) =1 (ix) =1.2 (x) =1.2. Comment on the shape of the sequences you
generated..
More Related Content
Similar to ItemNodeh include ltiostreamgt include ltstring.pdf
In C++ I need help with this method that Im trying to write fillLi.pdf
In C++ I need help with this method that I'm trying to write: fillListFromFile( ) : void -- this
method will add elements to the list from a file called linkedListData1.txt HINT: this is where
you will keep track of the number of elements in the list
I have all of the other methods, but I'm stuck on this one and I've added it as the last method in
the application. The code I have so far is below.
.cpp file:
.h file:
main:
#include
#include
#include
#include "Node.h"
using namespace std;
void displayList(Node*);
void insertFront(Node** head, int value);
void insertBack(Node** ptrToHead, int value);
void insertAfter(Node* previous, int value);
void deleteAtN(Node** ptrToHead, int n);
void deleteNode(Node** ptrToHead, int searchVal);
void clearList(Node**);
bool searchVal(Node** head, int value);
int countFrequencyOf(Node** ptrTohead, int value);
int size(Node** ptrTohead);
void displayFromFrontToN(Node** ptrToHead, int n);
void displayFromNToEnd(Node** ptrToHead, int n);
void insertInOrder(Node** head, Node* ptrToHead);
void displayInRows(Node** ptrToHead);
int main()
{
Node* node1 = new Node();
node1->setValue(10);
Node* node2 = new Node();
node2->setValue(20);
Node* node3 = new Node();
node3->setValue(30);
node1->next = node2;
node2->next = node3;
Node* head = node1;
displayList(head);
insertFront(&head, 5);
displayList(head);
insertBack(&head, 50);
displayList(head);
insertBack(&head, 60);
displayList(head);
insertAfter(node2, 25);
displayList(head);
deleteAtN(&head, 2);
displayList(head);
deleteNode(&head, 50);
displayList(head);
clearList(&head);
displayList(head);
insertFront(&head, 5);
insertFront(&head, 10);
insertFront(&head, 20);
insertBack(&head, 50);
searchVal(&head, 50);
displayList(head);
countFrequencyOf(&head, 25);
displayList(head);
insertBack(&head, 25);
insertFront(&head, 25);
countFrequencyOf(&head, 25);
displayList(head);
size(&head);
cout << "add one item to list" << endl;
insertBack(&head, 25);
size(&head);
displayList(head);
cout << "Display From Front To N" << endl;
displayFromFrontToN(&head, 4);
cout << "Display From N To End" << endl;
displayFromNToEnd(&head, 3);
cout << "Display In Rows" << endl;
displayInRows(&head);
insertFront(&head, 12);
insertFront(&head, 17);
insertFront(&head, 22);
insertBack(&head, 58);
cout << "Display In Rows" << endl;
displayInRows(&head);//call displayInRows()
return 0;
}//end main()
void displayList(Node* ptr) {
if (ptr == nullptr)
cout << "empty list" << endl;
else {
while (ptr != nullptr) {
cout << ptr->getValue() << endl;
ptr = ptr->next;
}
}
cout << "---------------------------" << endl;
}//end displayList()
void insertFront(Node** head, int value) {
Node* newNode = new Node();
newNode->setValue(value);
//cout<< newNode->getValue() << endl;
newNode->next = *head;
*head = newNode;
}
void insertBack(Node** ptrToHead, int value) {
Node* newNode = new Node();
newNode->setValue(value);
newNode->next = nullptr;
if (*ptrToHead == nullptr)
{
*ptrToHead = newNode;
}//end if
else
{
Node* last .
Can you please debug this Thank you in advance! This program is sup.pdf
Can you please debug this? Thank you in advance! This program is supposed to use stacks and
find the paths of an airplane. It should tell you whether or not the plane goes from the requested
city to the requested destination. requestFile.txt contains the requests, flightFile.txt contains the
flights and cityFile.txt contains the city\'s that the airline serves.
My errors: my output is simply \"Hpair does not serve Los Angeles.\" Thats it and it stops.
It should look something like (these are not real values of the file just an example):
\"Request is to fly from cityA to CityB.
Hpair flight from cityA to CityB.
Request is to fly from cityC to cityD.
Sorry, HPAir does not serve City D
Request is to fly from cityE to CityF
Sorry, HPAir does not fly from cityE to CityF\"
**It said to use ispath.cpp but I got confused on how to implement it completely.\"
isPath.cpp
//***I did not include ispath.cpp in my program. Parts of it are in the map.h portion.
main.cpp
#include
#include
#include \"Map.h\"
using namespace std;
int main()
{
Map aMap;
aMap.readFlights();
aMap.verifyRequestedFile();
}
StackInterface.h
#ifndef StackInterface_h
#define StackInterface_h
template
class StackInterface
{
/** Checks if the stack is empty.
@return True if the stack is empty or false if the stack is not.*/
virtual bool isEmpty() const = 0;
/** Adds a new item to the stack
@post newEntry is at the top of the stack
@param newEntry is the object to be added to the stack
@return True if successfully added, otherwise false. */
virtual bool push(const ItemType& newEntry) = 0;
/** Removes item from stack
@post The top item in the stack is removed
@return True if the item was removed, false if it was not. */
virtual bool pop() = 0;
/** Returns the top item in the stack
@pre The stack is not empty
@post The top item in the stack is returned
@return The top of the stack */
virtual ItemType peek() const = 0;
};
#endif /* StackInterface_h */
Node.h
#ifndef node_h
#define node_h
template
class Node {
public:
Node();
Node (const ItemType &anItem);
Node(const ItemType &anItem, Node * nextNodePtr);
void setItem(const ItemType &anItem);
void setNext(Node * nextNodePtr);
ItemType getItem() const;
Node* getNext() const;
private:
ItemType item;
Node* next;
};
template
Node::Node():next(nullptr){}
template
Node::Node(const ItemType &anItem):item(anItem), next(nullptr){}
template
Node::Node(const ItemType &anItem, Node * nextNodePtr):item(anItem), next(nextNodePtr)
{
}
template
void Node::setItem(const ItemType &anItem){
item = anItem;
}
template
void Node::setNext(Node * nextNodePtr) {
next = nextNodePtr;
}
template
ItemType Node::getItem() const {
return item;
}
template
Node* Node::getNext()const{
return next;
}
#endif /* node_h */
LinkedStack.h
#include
#ifndef LinkedStack_h
#define LinkedStack_h
#include \"Node.h\"
#include \"StackInterface.h\"
template
class LinkedStack:public StackInterface{
public:
LinkedStack();
LinkedStack(const LinkedStack &aStack); //space matter?***********
virt.
Implement the following specification of UnsortedType using circular.pdf
Implement the following specification of UnsortedType using circular linked list as the
implementation structure.
*** I have seen this question answered here before but it is not a good answer. Can someone
please give me a original answer.***
// Deliverables:
// - A listing of the specification and implementation files for UnsortedType
// - A listing of the driver program for your test plan
// - A listing of the test plan as input to the driver.
// - A listing of the output from the driver.
template
struct NodeType;
/* Assumption: ItemType is a type for which the operators
\"<\" and \"==\" are defined-either an appropriate built-in type or a
class that overloads these operators. */
template
class UnsortedType
{
public:
// Class constructor, destructor, and copy constructor
UnsortedType();
~UnsortedType();
UnsortedType(const UnsortedType&);
void operator=(UnsortedType);
bool IsFull() const;
// Determines whether list is full.
//Post: Function value = (list is full)
int GetLength() const;
// Determines the number of elements in list.
// Post: Function value = number of elements in list.
void RetrieveItem(ItemType& item, bool& found);
// Retrieves list element whose key matches item\'s key
// (if present).
// Pre: Key member of item is initialized.
// Post: If there is an element someItem whose key matches
// item\'s key, then found = true and item is a copy of
// someItem; otherwise found = false and item is unchanged.
// List is unchanged.
void InsertItem(ItemType item);
// Adds item to list.
// Pre: List is not full.
// Item is not in list.
// Post: item is in list.
void DeleteItem(ItemType item);
// Deletes the element whose key matches item\'s key
// Pre: Key member of item is initialized.
// One and only one element in list has a key matching
// item\'s key.
// Post: No element in list has a key matching item\'s key.
void ResetList();
// Initializes current position for an iteration through the list.
// Post: Current position is prior to list.
void GetNextItem(ItemType&);
// Gets the next element in list.
// Pre: Current position is defined.
// Element at current position is not last in list.
// Post: Current position is updated to next position.
// item is a copy of element at current position.
private:
NodeType* listData;
int length;
NodeType* currentPos;
};
Solution
#include
#include
/* structure for a node */
struct node
{
int data;
struct node *next;
};
/* function to insert a new_node in a list in sorted way.
Note that this function expects a pointer to head node
as this can modify the head of the input linked list */
void sortedInsert(struct node** head_ref, struct node* new_node)
{
struct node* current = *head_ref;
// Case 1 of the above algo
if (current == NULL)
{
new_node->next = new_node;
*head_ref = new_node;
}
// Case 2 of the above algo
else if (current->data >= new_node->data)
{
/* If value is smaller than head\'s value then
we need to change next of last node */
while(current->next != *head_ref)
current = current->next;
cur.
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
Assignment is:
\"Page 349-350 #4 and #5 Use the \"Linked List lab\" you have been working on in class and add
the two functions the questions are asking you to develop: divideMid and divideAt. Be sure to
include comments Use meaningful identifier names (constants where appropriate) Turn in .cpp
file AND Turn in a \"print-screen\' of your output (press \"print-screen\' on keyboard, then
\'paste\' in MS-Word)\"
How do you solve QUESTION #4 in the book data structures using c++ by D.S. Malik in Visiual
Studios using the linked list below with what is being asked? Please need help
Linked list :
#include
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *first, *last;
int num;
createList(first, last);
int choice;
while(true)
{
cout<<\"1. Insert Front.\ 2. Insert Last.\ 3. Delete Front.\ 4. Delete Last.\ 5. Print List.\ 6. Exit.\
\";
cout<<\"Enter your choice: \";
cin>>choice;
switch(choice)
{
case 1: insertFront(first); break;
case 2: insertBack(last); break;
case 3: deleteFirst(first); break;
case 4: deleteLast(last, first); break;
case 5: printList(first); break;
case 6: return 0;
default: cout<<\"Invalid menu option. Try again.\"<>number;
while (number != -999)
{
newNode = new nodeType; // create new node
newNode->info = number;
newNode->link = NULL;
if (first == NULL)
{
first = newNode;
last = newNode;
}
else
{
last->link = newNode;
last = newNode;
}
cout<<\"Enter an integer (-999 to stop): \";
cin>>number;
} // end of while-loop
} // end of build list function
void deleteFirst(nodeType*& first)
{
nodeType *temp;
temp= first;
first= temp->link;
delete temp;
return;
}
void deleteLast(nodeType*& last, nodeType* current)
{
nodeType *temp;
while(current->link != NULL)
{
temp=current;
current=current->link;
}
temp=last;
current->link=NULL;
delete temp;
last = current;
return;
}
void insertFront(nodeType*& front)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= front;
front= newNode;
return;
}
void insertBack(nodeType*& last)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= NULL;
last->link= newNode;
last = newNode;
return;
}
void printList(nodeType*& first)
{
cout<<\"Inside printList...printing linked list...\ \"<info << \" \";
current = current->link;
}
cout<
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *firs.
How to do insertion sort on a singly linked list with no header usin.pdf
How to do insertion sort on a singly linked list with no header using C?
Solution
/* C program for insertion sort on a linked list */
#include
#include
/* Link list node */
struct node
{
int data;
struct node* next;
};
// Function to insert a given node in a sorted linked list
void sortedInsert(struct node**, struct node*);
// function to sort a singly linked list using insertion sort
void insertionSort(struct node **head_ref)
{
// Initialize sorted linked list
struct node *sorted = NULL;
// Traverse the given linked list and insert every
// node to sorted
struct node *current = *head_ref;
while (current != NULL)
{
// Store next for next iteration
struct node *next = current->next;
// insert current in sorted linked list
sortedInsert(&sorted, current);
// Update current
current = next;
}
// Update head_ref to point to sorted linked list
*head_ref = sorted;
}
/* function to insert a new_node in a list. Note that this
function expects a pointer to head_ref as this can modify the
head of the input linked list (similar to push())*/
void sortedInsert(struct node** head_ref, struct node* new_node)
{
struct node* current;
/* Special case for the head end */
if (*head_ref == NULL || (*head_ref)->data >= new_node->data)
{
new_node->next = *head_ref;
*head_ref = new_node;
}
else
{
/* Locate the node before the point of insertion */
current = *head_ref;
while (current->next!=NULL &&
current->next->data < new_node->data)
{
current = current->next;
}
new_node->next = current->next;
current->next = new_node;
}
}
/* BELOW FUNCTIONS ARE JUST UTILITY TO TEST sortedInsert */
/* Function to print linked list */
void printList(struct node *head)
{
struct node *temp = head;
while(temp != NULL)
{
printf(\"%d \", temp->data);
temp = temp->next;
}
}
/* A utility function to insert a node at the beginning of linked list */
void push(struct node** head_ref, int new_data)
{
/* allocate node */
struct node* new_node = new node;
/* put in the data */
new_node->data = new_data;
/* link the old list off the new node */
new_node->next = (*head_ref);
/* move the head to point to the new node */
(*head_ref) = new_node;
}
// Driver program to test above functions
int main()
{
struct node *a = NULL;
push(&a, 5);
push(&a, 20);
push(&a, 4);
push(&a, 3);
push(&a, 30);
printf(\"Linked List before sorting \ \");
printList(a);
insertionSort(&a);
printf(\"\ Linked List after sorting \ \");
printList(a);
return 0;
}
/* C program for insertion sort on a linked list */
#include
#include
/* Link list node */
struct node
{
int data;
struct node* next;
};
// Function to insert a given node in a sorted linked list
void sortedInsert(struct node**, struct node*);
// function to sort a singly linked list using insertion sort
void insertionSort(struct node **head_ref)
{
// Initialize sorted linked list
struct node *sorted = NULL;
// Traverse the given linked list and insert every
// node to sorted
struct node *current = *head_ref;
while (current != NULL)
{
// Store next for next iteration
struct.
take the following code and give details of what each line of code i.pdf
take the following code and give details of what each line of code is doing
#include
#include
#include
using namespace std;
/*
* Node Declaration
*/
struct node
{
int info;
struct node *next;
}*start;
/*
* Class Declaration
*/
class single_llist
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos();
void sort();
void search();
void update();
void reverse();
void display();
single_llist()
{
start = NULL;
}
};
/*
* Main :contains menu
*/
main()
{
int choice, nodes, element, position, i;
single_llist sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<info = value;
temp->next = NULL;
return temp;
}
}
/*
* Inserting element in beginning
*/
void single_llist::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<info<<\"->\";
temp = temp->next;
}
cout<<\"NULL\"<
Solution
ANSWER ::
ASSMUING THE TOTAL LINE IN CODE ARE 158*(INCLUDING COMMENTS)
SO...
PROGRAM STARTS WITH SPECIFING HEADER FILES AND GLOBAL VARIABLE
DECLARATION
THEN Node Declaration USING STRUCTURES,
THEN WE WANT TO DECLARE THE CLASS USING SINGLE LINKED LIST AND THE
PROTOTYPE IS PUBLIC
IN THE PUBLIC WE WANT TO CREATE THE NODE AS INTEGER DATATYPE
THE NODE CONSIST OF insert_begin();
insert_pos();-> INDICATES THE CURRENT POSSITION
insert_last();->INSERT AT LAST
delete_pos();->TO DELETE THE NUMBER AT CURRENT POSITION
sort();->START THE SORTING
search();->USED TO SEARCH
update();->UPDATE THE NODE
reverse();->REVERSE NUMBERS
display();->TO DISPLAY THE NODE
single_llist()->FIFO
WE ARE STARTING TAKING NULL VALUE
AND THEN TAKE USER DEFIND FUNCTION MAIN()
CREATE THE DATATYPES choice, nodes, element, position, i
OBJECT CREATION OF SLL IS SL
USING WHILE LOOP THE NODE INSERT AT THE BEGINING OR ENDING STAGE
WE ARE USING SWITCH CASES TO PERFORM SLL ON NODE
NODE CREATION AS
node *single_llist::create_node(int value)
ALSO DECLARE THE TEMP IS TAKEN AS NULL VALUE
INSERT THE ELEMENT AT THE BEGINING
USING IF CONDITION WE CAN INSERT THE NODE AT THE BEGINING
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
AND THEN INSERT THE NODE AT THE LAST
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
USING WHILE LOOP WE ARE INSERTING THE NODE AT LAST
USING THIS BELLOW CODE WE CAN SEARCH THE ELEMENTS IN THE NODE
struct node *temp;
if (start == NULL)
{
cout<<\"The List is Empty\"<info<<\"->\";
temp = temp->next;
}
cout.
AnswerNote LinkedList.cpp is written and driver program main.cpp.pdf
Answer:
Note: LinkedList.cpp is written and driver program main.cpp is also given.
//ListInterface.h
#ifndef _LIST_INTERFACE
#define _LIST_INTERFACE
template
class ListInterface
{
public:
virtual bool isEmpty() const = 0;
virtual int getLength() const = 0;
virtual bool insert(int newPosition, const ItemType& newEntry) = 0;
virtual bool remove(int position) = 0;
virtual void clear() = 0;
virtual ItemType getEntry(int position) const = 0;
virtual void replace(int position, const ItemType& newEntry) = 0;
}; // end ListInterface
#endif
//Node.h
#ifndef NODE_
#define NODE_
template
class Node
{
private:
ItemType item; // A data item
Node* next; // Pointer to next node
public:
Node();
Node(const ItemType& anItem);
Node(const ItemType& anItem, Node* nextNodePtr);
void setItem(const ItemType& anItem);
void setNext(Node* nextNodePtr);
ItemType getItem() const ;
Node* getNext() const ;
}; // end Node
#endif
//Node.cpp
#include \"Node.h\"
template
Node::Node() : next(nullptr)
{
} // end default constructor
template
Node::Node(const ItemType& anItem) : item(anItem), next(nullptr)
{
} // end constructor
template
Node::Node(const ItemType& anItem, Node* nextNodePtr) :
item(anItem), next(nextNodePtr)
{
} // end constructor
template
void Node::setItem(const ItemType& anItem)
{
item = anItem;
} // end setItem
template
void Node::setNext(Node* nextNodePtr)
{
next = nextNodePtr;
} // end setNext
template
ItemType Node::getItem() const
{
return item;
} // end getItem
template
Node* Node::getNext() const
{
return next;
} // end getNext
//PrecondViolatedExcept.h
#ifndef PRECOND_VIOLATED_EXCEPT_
#define PRECOND_VIOLATED_EXCEPT_
#include
#include
class PrecondViolatedExcept : public std::logic_error
{
public:
PrecondViolatedExcept(const std::string& message = \"\");
}; // end PrecondViolatedExcept
#endif
//PrecondViolatedExcept.cpp
#include \"PrecondViolatedExcept.h\"
PrecondViolatedExcept::PrecondViolatedExcept(const std::string& message)
: std::logic_error(\"Precondition Violated Exception: \" + message)
{
} // end constructor
//LinkedList.h
#ifndef LINKED_LIST_
#define LINKED_LIST_
#include \"ListInterface.h\"
#include \"Node.h\"
#include
#include \"PrecondViolatedExcept.h\"
template
class LinkedList : public ListInterface
{
private:
Node* headPtr; // Pointer to first node in the chain;
// (contains the first entry in the list)
int itemCount; // Current count of list items
// Locates a specified node in this linked list.
Node* getNodeAt(int position) const;
public:
LinkedList();
LinkedList(const LinkedList& aList);
virtual ~LinkedList();
bool isEmpty() const;
int getLength() const;
bool insert(int newPosition, const ItemType& newEntry);
bool remove(int position);
void clear();
ItemType getEntry(int position) const;
void replace(int position, const ItemType& newEntry);
}; // end LinkedList
#endif
//LinkedList.cpp
#include \"LinkedList.h\"
#include
#include
#include
#include
//Default constructor
template
LinkedList::LinkedList() : headPtr(nullptr), itemCount(0)
{
.
C++ Please write the whole code that is needed for this assignment- wr.docx
Brianca plans to save $5,000, $1,000, and $42,000 a year over the next three years, respectively. How much would you need to deposit in one lump sum today to have the same amount as Brianca three years from now if you both earn 10.9 percent, compounded annually? $36,115 $35,192 $43,282 $41,635 $35,372
.
Using the provided table interface table.h and the sample linked lis.pdf
Using the provided table interface table.h and the sample linked list code linkedList.c, complete
an implementation of the Table ADT. Make sure that you apply the concepts of design by
contract (DbC) to your implementation.
Once you have fully implemented the table, create a main.c file that implements a testing
framework for your table.
Your table implementation must ensure that values inserted are unique, and internally sorted
within a linked list.
table.h
linkedList.c
Solution
khsdg
#include
#include
typedef enum BOOL { false, true } bool;
// Linked list node definition
typedef struct Node node;
struct Node
{
int number;
node *next;
};
static node *top = NULL;
// used to track where we are for the list traversal methods
static node *traverseNode = NULL;
// \"destroy\" will deallocate all nodes in a linked list object
// and will set \"top\" to NULL.
void destroy()
{
node *curr = top;
node *temp = NULL;
while ( curr != NULL )
{
// flip order to see it blow up...
temp = curr;
curr = curr->next;
free( temp );
}
top = NULL;
}
// \"build\" will create an ordered linked list consisting
// of the first \"size\" even integers.
void build( int size )
{
node *newNode = NULL;
int i = 0;
// make sure we don\'t have a list yet
destroy();
for ( i=size ; i>0 ; i-- )
{
newNode = malloc( sizeof( node ) );
newNode->number = i*2;
newNode->next = top;
top = newNode;
}
}
// starts a list traversal by getting the data at top.
// returns false if top == NULL.
bool firstNode( int *item )
{
bool result = false;
if ( top )
{
*item = top->number;
traverseNode = top->next;
result = true;
}
return result;
}
// gets the data at the current traversal node and increments the traversal.
// returns false if we\'re at the end of the list.
bool nextNode( int *item )
{
bool result = false;
if ( traverseNode )
{
*item = traverseNode->number;
traverseNode = traverseNode->next;
result = true;
}
return result;
}
// \"print\" will output an object\'s entire linked list
// to the standard output device -- one \"number\" per line.
void print()
{
int value;
if ( firstNode( &value ) )
{
do
{
printf( \"%d\ \", value );
} while ( nextNode( &value ) );
}
}
int main( int argc, char *argv[] )
{
build( 10 );
print();
destroy();
build( 5 );
build( 20 );
print();
destroy();
return 0;
}.
This assignment and the next (#5) involve design and development of a.pdf
This assignment and the next (#5) involve design and development of a sequential
non contiguous and dynamic datastructure called LinkedList. A linked list object is
a container consisting of connected ListNode objects. As before, we are not going
to use pre-fabricated classes from the c++ library, but construct the LinkedList
ADT from scratch.
The first step is construction and testing of the ListNode class. A ListNode object
contains a data field and a pointer to the next ListNode object (note the recursive
definition).
#This assignment requires you to
1. Read the Assignment 4 Notes
2. Watch the Assignment 4 Support video
3. Implement the following methods of the ListNode class
-custom constructor
-setters for next pointer and data
4. Implement the insert and remove method in the main program
5. Scan the given template to find the above //TODO and implement the code
needed
//TODO in ListNodecpp.h file
public: ListNode(T idata, ListNode<T> * newNext);
public: void setNext(ListNode<T> * newNext);
public: void setData(T newData);
// TODO in main program
void remove(ListNode<int> * &front,int value)
void insert(ListNode<int> * &front,int value)
# The driver is given ListNodeMain.cpp is given to you that does the following
tests
1. Declares a pointer called front to point to a ListNode of datatype integer
2. Constructs four ListNodes with data 1,2,4 and adds them to form a linked
list.
3. Inserts ListNode with data 3 to the list
4. Removes node 1 and adds it back to test removing and adding the first
element
5. Removes node 3 to test removing a middle node
6. Removes node 4 to test removing the last node
7. Attempt to remove a non existent node
8. Remove all existing nodes to empty the list
9. Insert node 4 and then node 1 to test if insertions preserve order
10.Print the list
Main.cpp
#include <iostream>
#include "ListNodecpp.h"
// REMEMBER each ListNode has two parts : a data field
// and an address field. The address is either null or points to the next node
//in the chain
//Requires: integer value for searching, address of front
//Effects: traverses the list node chain starting from front until the end comparing search value
with listnode getData. Returns the original search value if found, if not adds +1 to indicate not
found
//Modifies: Nothing
int search(ListNode<int> * front, int value);
//Requires: integer value for inserting, address of front
//Effects: creates a new ListNode with value and inserts in proper position (increasing order)in
the chain. If chain is empty, adds to the beginning
//Modifies: front, if node is added at the beginning.
//Also changes the next pointer of the previous node to point to the
//newly inserted list node. the next pointer of the newly inserted pointer
//points to what was the next of the previous node.
//This way both previous and current links are adjusted
//******** NOTE the use of & in passing pointer to front as parameter -
// Why do you think this is needed ?**********
void insert(ListNode<int> * &fr.
A)B) C++ program to create a Complete Binary tree from its Lin.pdf
A)
B)
// C++ program to create a Complete Binary tree from its Linked List
// Representation
#include
#include
#include
using namespace std;
// Linked list node
struct ListNode
{
int data;
ListNode* next;
};
// Binary tree node structure
struct BinaryTreeNode
{
int data;
BinaryTreeNode *left, *right;
};
// Function to insert a node at the beginning of the Linked List
void push(struct ListNode** head_ref, int new_data)
{
// allocate node and assign data
struct ListNode* new_node = new ListNode;
new_node->data = new_data;
// link the old list off the new node
new_node->next = (*head_ref);
// move the head to point to the new node
(*head_ref) = new_node;
}
// method to create a new binary tree node from the given data
BinaryTreeNode* newBinaryTreeNode(int data)
{
BinaryTreeNode *temp = new BinaryTreeNode;
temp->data = data;
temp->left = temp->right = NULL;
return temp;
}
// converts a given linked list representing a complete binary tree into the
// linked representation of binary tree.
void convertList2Binary(ListNode *head, BinaryTreeNode* &root)
{
// queue to store the parent nodes
queue q;
// Base Case
if (head == NULL)
{
root = NULL; // Note that root is passed by reference
return;
}
// 1.) The first node is always the root node, and add it to the queue
root = newBinaryTreeNode(head->data);
q.push(root);
// advance the pointer to the next node
head = head->next;
// until the end of linked list is reached, do the following steps
while (head)
{
// 2.a) take the parent node from the q and remove it from q
BinaryTreeNode* parent = q.front();
q.pop();
// 2.c) take next two nodes from the linked list. We will add
// them as children of the current parent node in step 2.b. Push them
// into the queue so that they will be parents to the future nodes
BinaryTreeNode *leftChild = NULL, *rightChild = NULL;
leftChild = newBinaryTreeNode(head->data);
q.push(leftChild);
head = head->next;
if (head)
{
rightChild = newBinaryTreeNode(head->data);
q.push(rightChild);
head = head->next;
}
// 2.b) assign the left and right children of parent
parent->left = leftChild;
parent->right = rightChild;
}
}
// Utility function to traverse the binary tree after conversion
void inorderTraversal(BinaryTreeNode* root)
{
if (root)
{
inorderTraversal( root->left );
cout << root->data << \" \";
inorderTraversal( root->right );
}
}
// Driver program to test above functions
int main()
{
// create a linked list shown in above diagram
struct ListNode* head = NULL;
push(&head, 36); /* Last node of Linked List */
push(&head, 30);
push(&head, 25);
push(&head, 15);
push(&head, 12);
push(&head, 10); /* First node of Linked List */
BinaryTreeNode *root;
convertList2Binary(head, root);
cout << \"Inorder Traversal of the constructed Binary Tree is: \ \";
inorderTraversal(root);
return 0;
}
c)
#include
#include
using namespace std;
template
class bintree
{
bintree *left;
T data;
bintree *right;
public :
bintree()
{
left=right=NULL;
}
void create();
void preorder();
void inorder();
void pos.
#include stdafx.h #include iostream using namespace std;vo.docx
#include stdafx.h #include iostream using namespace std;vo
Write a program to find the number of comparisons using the binary se.docx
Write a program to find the number of comparisons using the binary se
implement the ListLinked ADT (the declaration is given in ListLinked.pdf
implement the ListLinked ADT (the declaration is given in ListLinked.h)(60 points)
- implement the following operations:
- constructor, assignment operator, destructor
- insert, remove, replace, clear
- isFull, isEmpty
- gotoBeginning, gotoEnd, gotoNext, gotoPrior, getCursor
implement the function moveToBeginning() that removes the data item marked by the cursor and
reinserts it at the beginning of the list
- implement the function insertBefore(..) that will insert the new data item before the cursor or if
the list is empty as the first element of the list
#include \"ListLinked.h\"
// ListNode member functions
template
List::ListNode::ListNode(const DataType& nodeData, ListNode* nextPtr)
{
this->dataItem = nodeData;
this->next = nextPtr;
}
// List member functions
template
List::List(int ignored = 0)
{
}
template
List::List(const List& other)
{
}
template
List& List::operator=(const List& other)
{
}
template
List::~List()
{
}
template
void List::insert(const DataType& newDataItem) throw (logic_error)
{
}
template
void List::remove() throw (logic_error)
{
}
template
void List::replace(const DataType& newDataItem) throw (logic_error)
{
}
template
void List::clear()
{
}
template
bool List::isEmpty() const
{
return false;
}
template
bool List::isFull() const
{
return false;
}
template
void List::gotoBeginning() throw (logic_error)
{
}
template
void List::gotoEnd() throw (logic_error)
{
}
template
bool List::gotoNext() throw (logic_error)
{
return false;
}
template
bool List::gotoPrior() throw (logic_error)
{
return false;
}
template
DataType List::getCursor() const throw (logic_error)
{
DataType t;
return t;
}
template
void List::moveToBeginning () throw (logic_error)
{
}
template
void List::insertBefore(const DataType& newDataItem) throw (logic_error)
{
}
#include \"show5.cpp\"
Solution
#include
#include
#include
using namespace std;
struct Node
{
int data;
Node *next;
};
Node *tail=NULL;
Node* Insert_atHead(Node *head, int data)
{
Node *temp=new Node;
temp->data=data;
temp->next=head;
head=temp;
return head;
}
Node* Insert_atTail(Node *head, int data)
{
Node *tail=head;
if(tail==NULL)
{
Node *temp = new Node;
temp->data=data;
temp->next=NULL;
head=temp;
return head;
}
while(tail!= NULL)
{
if(tail->next==NULL)
{
Node *temp=new Node;
temp->data=data;
temp->next=NULL;
tail->next=temp;
return tail;
}
else
{
tail=tail->next;
}
}
}
Node *Insert_atPosition(Node *head, int data, int position)
{
int i=0;
int j=position-1;
if(position==0)
{
Node *temp = new Node;
temp->data=data;
temp->next=head;
head=temp;
return head;
}
else
{
Node *temp=head;
while(inext;
i++;
}
Node *temp1 = new Node;
temp1->data=data;
temp1->next=temp->next;
temp->next=temp1;
return head;
}
return head;
}
Node* Delete(Node *head, int position)
{
Node *temp=head;
int i=1;
int j=position;
if(j==0)
{
head=head->next;
return head;
}
Node *temp1 = new Node;
while(j>0)
{
temp1=temp;
temp=temp->next;
j--;
}
temp1->next=temp->next;
delete temp;
return head;
}
int GetNode(Node *head,int posi.
C code on linked list #include stdio.h #include stdlib.h.pdf
For the ethanol water graph the simple distillation should be a steady smooth
increase, the fractional distillation should look like an s, that sort of takes a straight up jump in
the middle. I am unsure about the other mixture though sorry, hope that helps
Solution
For the ethanol water graph the simple distillation should be a steady smooth
increase, the fractional distillation should look like an s, that sort of takes a straight up jump in
the middle. I am unsure about the other mixture though sorry, hope that helps.
Write a program that accepts an arithmetic expression of unsigned in.pdf
Write a program that accepts an arithmetic expression of unsigned integers in postfix notation
and builds the arithmetic expression tree that represents that expression. From that tree, the
corresponding fully parenthesized infix expression should be displayed and a file should be
generated that contains the three address format instructions. This topic is discussed in the week
4 reading in module 2, section II-B. The main class should create the GUI shown below:
Pressing the Construct Tree button should cause the tree to be constructed and using that tree, the
corresponding infix expression should be displayed and the three address instruction file should
be generated. The postfix expression input should not be required to have spaces between every
token. Note in the above example that 9+- are not separated by spaces. The above example
should produce the following output file containing the three address instructions:
Add R0 5 9
Sub R1 3
R0 Mul R2 2 3
Div R3 R1 R2
Inheritance should be used to define the arithmetic expression tree. At a minimum, it should
involve three classes: an abstract class for the tree nodes and two derived classes, one for
operand nodes and another for operator nodes. Other classes should be included as needed to
accomplish good object-oriented design. All instance data must be declared as private.
You may assume that the expression is syntactically correct with regard to the order of operators
and operands, but you should check for invalid tokens, such as characters that are not valid
operators or operands such as 2a, which are not valid integers. If an invalid token is detected a
RuntimeException should be thrown and caught by the main class and an appropriate error
message should be displayed. Three Adddress Generator Enter Postfix Expression 359 2 3
Construct Tree Infix Expression ((3-(5 9))/ (2* 3
Solution
#include
#include
#include
#include
#include
struct TREE //Structure to represent a tree
{
char data;
struct TREE *right,*left,*root;
};
typedef TREE tree; /* Stack Using Linked List */
struct Stack //Structure to represent Stack
{
struct TREE *data;
struct Stack *next,*head,*top; //Pointers to next node,head and top
};
typedef struct Stack node;
node *Nw; //Global Variable to represent node
void initialize(node *&n)
{
n = new node;
n -> next = n -> head = n -> top = NULL;
}
void create(node *n)
{
Nw = new node; //Create a new node
Nw -> next = NULL; //Initialize next pointer field
if(n -> head == NULL) //if first node
{
n -> head = Nw; //Initialize head
n -> top = Nw; //Update top
}
}
void push(node *n,tree *ITEM)
{
node *temp = n -> head;
if(n -> head == NULL) //if First Item is Pushed to Stack
{
create(n); //Create a Node
n -> head -> data = ITEM; //Insert Item to head of List
n -> head = Nw;
return; //Exit from Function
}
create(n); //Create a new Node
Nw -> data = ITEM; //Insert Item
while(temp -> next != NULL)
temp = temp -> next; //Go to Last Node
temp -> next = Nw; //Point New node
n -> top = Nw; //Upda.
Similar to ItemNodeh include ltiostreamgt include ltstring.pdf (20)
In C++ I need help with this method that Im trying to write fillLi.pdf
In C++ I need help with this method that Im trying to write fillLi.pdf
Can you please debug this Thank you in advance! This program is sup.pdf
Can you please debug this Thank you in advance! This program is sup.pdf
Implement the following specification of UnsortedType using circular.pdf
Implement the following specification of UnsortedType using circular.pdf
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
How to do insertion sort on a singly linked list with no header usin.pdf
How to do insertion sort on a singly linked list with no header usin.pdf
take the following code and give details of what each line of code i.pdf
take the following code and give details of what each line of code i.pdf
AnswerNote LinkedList.cpp is written and driver program main.cpp.pdf
AnswerNote LinkedList.cpp is written and driver program main.cpp.pdf
C++ Please write the whole code that is needed for this assignment- wr.docx
C++ Please write the whole code that is needed for this assignment- wr.docx
Using the provided table interface table.h and the sample linked lis.pdf
Using the provided table interface table.h and the sample linked lis.pdf
This assignment and the next (#5) involve design and development of a.pdf
This assignment and the next (#5) involve design and development of a.pdf
Data structures cs301 power point slides lecture 03
Data structures cs301 power point slides lecture 03
A)B) C++ program to create a Complete Binary tree from its Lin.pdf
A)B) C++ program to create a Complete Binary tree from its Lin.pdf
#include stdafx.h #include iostream using namespace std;vo.docx
#include stdafx.h #include iostream using namespace std;vo.docx
Write a program to find the number of comparisons using the binary se.docx
Write a program to find the number of comparisons using the binary se.docx
implement the ListLinked ADT (the declaration is given in ListLinked.pdf
implement the ListLinked ADT (the declaration is given in ListLinked.pdf
C code on linked list #include stdio.h #include stdlib.h.pdf
C code on linked list #include stdio.h #include stdlib.h.pdf
Write a program that accepts an arithmetic expression of unsigned in.pdf
Write a program that accepts an arithmetic expression of unsigned in.pdf
More from acmefit
What can we say about these results Smokers have a nonstat.pdf
What can we say about these results? Smokers have a non-statistically significant (p=.58) relative
hazard of death that is 37% greater than that of nonsmokers following root canal. HR=1.37 Cl
limits 0.45 to 4.22 All of the above.
We use the recursion xixi1+i1iN We use 00 You need to o.pdf
We use the recursion xi=xi1+i,1iN. We use 0=0. You need to obtain 10 figures showing xi,1iN in
the combinations of the following set ups: (i) N=50 (ii) i 's are standard normal (iii) i 's are t(5) (iv) =
.1 (v) =.5 (vi) =.9 (vii) =1 (viii) =1 (ix) =1.2 (x) =1.2. Comment on the shape of the sequences you
generated..
The lifespan of the Ebola virus on flat dry surfaces has a n.pdf
The lifespan of the Ebola virus on flat dry surfaces has a normal distribution with =2278.3 minutes
and =49.4 minutes. You monitor a random sample of size n=47. What is the mean of the
distribution of sample means? x= What is the standard deviation of the distribution of sample
means? (Report answer accurate to 2 decimal places.) x=.
Struter Partnership tiene un capital total de socios de 460.pdf
Struter Partnership tiene un capital total de socios de $460,000, que se compone de Main,
Capital, $322,000 y Frist, Capital, $138,000. Los socios comparten las utilidades y prdidas netas
en una proporcin de 77% con Main y 23% con Frist. El 1 de noviembre, Madison es admitida en la
sociedad y se le otorga una participacin del 20% en el capital social y una participacin del 20% en
cualquier ingreso y prdida. Prepare asientos de diario para registrar la admisin de Madison para
una participacin del 20% en el capital social y una participacin del 20% en cualquier ingreso y
prdida bajo los siguientes supuestos independientes. (1) Registre la admisin de Madison con una
inversin de $115,000 por una participacin del 20% en el capital y una participacin del 20% en
cualquier ingreso y prdida. (2) Registrar la admisin de Madison con una inversin de $150,000 por
una participacin del 20% en el capital y una participacin del 20% en cualquier ingreso y prdida. (3)
Registrar la admisin de Madison con una inversin de $85,000 por una participacin del 20% en el
capital y una participacin del 20% en cualquier ingreso y prdida..
Question 10 Which of the following cannot be said regardin.pdf
Question 10 - Which of the following cannot be said regarding the colonialism in Africa?
One of the UN objectives was to oversee the decolonization of European colonies.
European colonialism remained strong in Africa until the end of World War II.
The transition from colony to independent nation itself caused conflict.
Colonialism in Africa is completely over.
The first country to gain independence in Subsaharan Africa was Ghana in 1957.
Question 9 - What was the underlying reasons for the ethnic problems appeared after the colonial
era in Africa?
Warring groups were placed in the different colonies.
The Europeans always considered local people and their cultures in problem solving.
Ethnic boundaries were disregarded by the colonialists.
Colonialism always employed humanitarian measures to subdue local people.
Cultural boundaries were well observed in the Berlin Conference.
Question 7 - Which of the following is NOT considered as an empire or a kingdom established
between 790-1896 in the West Africa?
Kingdom of Dahomey
Kingdom of Niger
Songhai Empire
Ashanti Empire
Ghana Empire
Question 6 - The pressures on the natural environment in the realm include all of the following
except:
The carrying capacity of the resources has been exceeded.
Large game animals have been hunted or poached with devastating consequences.
Biodiversity is increasing rapidly.
Fast urbanization encroaching on the natural biodiversity.
Deforestations is an important problem for the realm.
Question 5 - Which one of the following is NOT a feature of The equator?
It has tropical A climates.
Its leached soils are highly productive.
Millet and corn are common.
The equator runs through the center of Subsaharan Africa.
It has more rainfall.
One of the UN objectives was to oversee the
decolonization of European colonies.
European colonialism remained strong in Africa
until the end of World War II.
The transition from colony to independent nation
itself caused conflict.
Colonialism in Africa is completely over.
The first country to gain independence in
Subsaharan Africa was Ghana in 1957..
Q5 5 marks For a natural number e let We denote the domai.pdf
Q5 [5 marks] For a natural number e, let We denote the domain of e (the eth partial computable
function). Consider the set Cof ={e:NWe is finite }. Show that Cof is 30, i.e. construct a computable
4-ary relation R such that Cof={x:y1,y2,y3,R(x,y1,y2,y3)}. Hint: If NWe is finite, then y1,y2>y1,y2W
e. Why?.
PF1224A Journalizing withdrawal of cash from partnership .pdf
P-F:12-24A Journalizing withdrawal of cash from partnership Learning Objectives 2, 3 2. Loiselle,
Capital $43,100 P-F:12-24A Accounting for partner contributions, allocating profits and losses to
the partners, preparing partnership financial statements Loiselle and Randall formed a partnership
on March 15, 2024. The partners agreed to contribute equal amounts of capital. Loiselle
contributed her sole proprietorships assets and liabilities (credit balances in parentheses) as
follows: Loiselles Business Accounts Receivable Merchandise Inventory Prepaid Expenses Store
Equipment, Net Accounts Payable Book Value $ 12,700 44,000 3,200 44,000 (24,000) Current
Market Value $ 10,400 30,000 2,700 24,000 (24,000) On March 15, Randall contributed cash in an
amount equal to the current market value of Loiselles partnership capital. The partners decided
that Loiselle will earn 60% of partnership profits because she will manage the business. Randall
agreed to accept 40% of the profits. During the period ended December 31, the partnership
earned net income of $79,000. Loiselles withdrawals were $41,000, and Randalls withdrawals
totaled $29,000. Requirements 1. Journalize the partners initial contributions. 2. Prepare the
partnership balance sheet immediately after its formation on March 15, 2024. 3. Journalize the
closing of the Income Summary and partner Withdrawal accounts on December 31, 2024.
Learning Objectives ..
Please answer the 3 questions below thank you in advance Wh.pdf
Please answer the 3 questions below, thank you in advance
Which character is NOT in the CapraTek: Leading for Change scenario?
Daniel Fox.
Brianne Twyha.
Anderson Cooper.
Janice Keller.
According to Haas (2022), two types of creativity are endangered by hybrid work. Perhaps the
most obvious one is collective creativity. What is the other?
Individual creativity.
Societal creativity.
Corporate creativity.
Professional creativity.
The categorization-elaboration model describes how ____ within a team can influence the
elaboration of information in teams, ultimately affecting team performance, including creativity and
innovation.
Salary.
Training.
Diversity.
None of these.
a. Daniel Fox.
b. Brianne Twyha.
c. Anderson Cooper.
d. Janice Keller..
please solve this Operators in the same row have the same pr.pdf
please solve this
Operators in the same row have the same precedence and down the table the precedence
decreases. Considering Assignment as a syntactic category that acts as the start symbol, write
extended BNF grammar rules for expressions containing these operators in both the (a)
Ambiginons and (b) Unaulbiguous forui: (ousider operauds as (Identifiers) and/ or (Literals) (3+5)
CO3.
a Suppose R is a partial order over set A Prove or disprov.pdf
a) Suppose R is a partial order over set A. Prove or disprove that R2 is a partial order.b) Let S={(a,
b):amod10=bmod10}. Prove or disprove that S is an equivalence relation over the integers.a) Let f:
AA and g:AA be bijective functions. (a) Prove or disprove whether gf is injective (b) Prove or
disprove whether gf is surjective.
please help me with the case study Read the case study .pdf
please help me with the case study
Read the case study below and answer the questions that follow: What Will Restaurants Look Like
After Covid? You don't know what you've got 'til it's gone. Covid-19 revealed the everyday
activities many people take for granted until they're no longer for an option-like eating out in a
restaurant. The pandemic has rocked the restaurant industry and showed just how agile it isn't.
Faced with challenges, more than 70,000 restaurants across the U.S. have permanently closed.
Restaurants had to quickly pivot to curb side pickup and delivery and adjust their menus and
staffing in hopes of staying afloat. Now, several months into the pandemic, we can see how the
restaurant industry will be permanently changed by Covid-19. In many cases, the pandemic is a
chance for restaurants to innovate and find new, creative ways to serve customers. These five
main changes show how restaurants must adapt to the Covid-19 era and how they can leverage
changes to improve the customer experience. Focus On Health and Safety Restaurants have
always had to pass health inspections, but a greater focus on cleanliness and health is forcing
restaurants to double-down on their efforts. Zagat's Future of Dining Study found that 3 in 4 diners
say health and safety concerns are their biggest deterrent to dining out in person. Diners are
looking for restaurants to be transparent about their cleanliness procedures, so restaurants must
use clear optics of what they are doing to keep diners safe. Customers are looking for things like
single-use menus, disposable silverware, signs placed on tables that have been sanitized, hand
sanitizing stations and employees wearing masks. How the food is served will also be affected,
with diners preferring individual or pre-packaged meals instead of family-style dining. Restaurants
will likely need to invest in new cleaning supplies and training to teach employees new
procedures, as well as marketing and signage to inform diners of the new procedures. Increased
Digital Offerings Like most other industries, restaurants have experienced rapid digital
acceleration. Throughout the pandemic, restaurants with a strong digital presence, such as easy
online or mobile ordering or a robust digital loyalty program, have seen increased engagement
with customers. Most signs point to customers staying digitally engaged after the pandemic.
Restaurants will continue to move to frictionless ordering and payment with an increase in online
and mobile orders for pickup and delivery. Even inside restaurants, diners will order their own food
on tablets or kiosks to limit their exposure to employees and payment devices. The restaurant
industry is ripe for technological innovation- anything from digital menus to tableside ordering and
guest engagement apps can transform the dining experience to match new customer trends. But
in order to accommodate these trends, restaurants must invest in new technology, which can be
costly. To preserv.
Note Use the Tax Tables to calculate the answers to the pro.pdf
Note: Use the Tax Tables to calculate the answers to the problems listed. Mary Matthews made
$1,150 during a biweekly pay period. Only social security (fully taxable) and federal income taxes
attach to her pay. Matthews contributes $100 from each biweekly pay to her company's 401k.
Determine Matthews' take home pay if she is married filing jointly. (Use wage bracket method)
Round your answer to two decimal places. $2022 Wage Bracket Method Tables for Manual
Payroll Systems With Forms W-4 From 2020 or Later BIWEEKLY Payroll Period.
Mayu is responsible for the security of her companys server.pdf
Mayu is responsible for the security of her company's server farm. She has some extra money left
in her budget that needs to be spent by the end of the fiscal year. She wants to find a technology
that could potentially alert her to any malicious traffic on the network, but she is concerned that it
might start blocking legitimate traffic. Which of the following should she consider implementing?
a. HIPS
b. NIPS
c. NIDS
d. HIDS
Giovanni has discovered that a number of local executives stop into a nearby coffee shop for
early-morning networking and business discussions. Many of them use their smartphones and
laptops to conduct business while they are there. Which of the following might Giovanni decide to
use as part of a reconnaissance plan?
a. NIDS
b. Packet analyzer
c. DMZ
d. NIPS
Kiki has just been hired to perform a penetration test for an organization as if she were an external
attacker. Which of the following might she do as part of the initial reconnaissance process?
a. Social media profiling
b. Router ACL review
c. Log analysis
d. WEP cracking
Anisa has discovered that a server in the data center has users connecting to it via Telnet to
perform certain tasks. She knows they should be using SSH to perform these tasks instead. Which
of the following should she do next?
a. Install a network intrusion detection system.
b. Perform a vulnerability scan.
c. Use a network topology discovery tool.
d. Perform a router/firewall ACL review..
Country Financial a financial services company uses survey.pdf
Country Financial, a financial services company, uses surveys of adults age 18 and older to
determine if personal financial fitness is changing over time (USA Today, April 4, 2012). In
February 2012, a sample of 1000 adults showed 410 indicating that their financial security was
more than fair. In February 2010, a sample of 900 adults showed 315 indicating that their financial
security was more than fair.
a) State the hypotheses that can be used to test for a significant difference between the population
proportions for the two years.
b) What is the sample proportion indicating that their financial security was more than fair in 2012?
In 2010?
c) Conduct the hypothesis test and compute the p-value. At a .05 level of significance, what is your
conclusion?
d) What is the 95% confidence interval estimate of the difference between the two population
proportions?.
Consulte la tabla a continuacin que muestra los datos de lo.pdf
Consulte la tabla a continuacin que muestra los datos de los estados financieros y los datos del
precio de las acciones de Mydeco Corp.
a. Cmo cambiaron los das de cuentas por cobrar de Mydeco durante este perodo?
b. Cmo cambiaron los das de inventario de Mydeco durante este perodo?
C. Segn su anlisis, Mydeco ha mejorado la gestin de su capital de trabajo durante este perodo?
(Nota: use un ao de 365 das).
a. Cmo cambiaron los das de cuentas por cobrar de Mydeco durante este perodo?
Los das de cuentas por cobrar para 2012 son _____________das. (Redondear a un decimal).
Los das de cuentas por cobrar para 2016 son __________das. (Redondear a un decimal).
b. Cmo cambiaron los das de inventario de Mydeco durante este perodo?
Los das de inventario para 2012 son _____________das. (Redondear a un decimal).
Los das de inventario para 2016 son _____________das. (Redondear a un decimal).
C. Segn su anlisis, Mydeco ha mejorado la gestin de su capital de trabajo durante este perodo?
(Seleccione la mejor opcin a continuacin).
Entre 2012 y 2016, la gestin del capital de trabajo de Mydeco _____________ empeor o mejor al
__________ reducir o aumentar los das de cuentas por cobrar y los das de inventario.
E
s
t
a
d
o
d
e 2 2 2 2 2
r 0 0 0 0 0
e 1 1 1 1 1
s 2 3 4 5 6
u
lt
a
d
o
s
G
a
4 3 4 5 6
n
0 6 2 1 0
a
0 4 5 2 2
n
. . . . .
c
6 4 8 8 1
i
a
C
o
s
t
( ( ( ( (
o
1 1 2 2 2
d
9 7 0 4 9
e
1 6 1 8 7
l
. . . . .
o
3 0 3 7 4
s
) ) ) ) )
b
i
e
n
e
s
v
e
n
d
i
d
o
s
B
e
n
e
fi 2 1 2 2 3
c 0 8 2 6 0
i 9 8 4 4 4
o . . . . .
b 3 4 5 1 7
r
u
t
o
V
e
n
t
a ( (
( ( (
s 1 1
6 6 8
y 0 1
6 6 2
m 0 9
. . .
a . .
3 6 7
r 5 3
) ) )
k ) )
e
ti
n
g
A
d
m
i ( ( ( ( (
n 6 6 6 6 7
i 0 0 0 7 7
s . . . . .
tr 4 4 7 1 1
a ) ) ) ) )
c
i
n
D
e
p
r
e
c
i
a
c ( ( ( ( (
i 2 2 3 3 3
n 9 7 4 9 7
y . . . . .
a 1 4 6 2 6
m) ) ) ) )
o
rt
i
z
a
c
i
n
E 5 4 5 7
B 3 3 6 7 0
I . 4 . . .
T 5 5 3 7
I
n
t
e
r
e
s
e
s
I
( ( ( ( (
n
3 3 3 3 4
g
2 2 3 6 0
r
. . . . .
e
6 3 6 4 2
s
) ) ) ) )
o
s
(
G
a
s
t
o
s
)
I
n
g
r
e
s
o 2 1 2 3
1
s 0 2 0 0
.
a , . , .
7
n 9 9 9 5
t
e
s
d
e
i
m
p
u
e
s
t
o
s
I
m
p
u
e
s
t
o (
( ( ( (
s 1
7 0 4 7
o 0
. . . .
b .
3 6 5 3
r 7
) ) ) )
e )
l
a
r
e
n
t
a
L
n
g
r
1 1 1
1 8
e
3 3 9
. .
s
. . .
1 4
o
6 6 8
s
n
e
t
o
s
A
c
c
i
o
n
e
s
e
n
c
ir
c 5 5 5 5 5
u 6 6 6 6 6
l . . . . .
a 4 4 4 4 4
c
i
n
(
m
il
l
o
n
e
s
)
G
a
$ $ $ $ $
n
0 0 0 0 0
a
. . . . .
n
2 0 1 2 3
c
4 2 5 4 5
i
a
s
p
o
r
a
c
c
i
n
H
o
j
a
d
2 2 2 2 2
e
0 0 0 0 0
b
1 1 1 1 1
a
2 3 4 5 6
l
a
n
c
e
A
c
ti
v
o
s
D
i 4 6 8 7 8
n 7 3 5 7 7
e . , . . .
r 4 9 8 3 6
o
C 8 6 7 7 8
u 9 9 0 6 4
e
n
t
a
s
p
o . . . , .
r 2 8 6 9 5
c
o
b
r
a
r
I
n
v
3 3 2 3 3
e
2 2 7 3 5
n
, . , . .
t
9 6 8 7 7
a
ri
o
T
o
t
a
l
d
1 1 1 1 2
e
6 6 8 8 0
a
9 6 4 7 7
c
. . . . .
ti
5 3 2 9 8
v
o
s
c
o
r
ri
e
n
t
e
s
P
r
o
p
i
e
d
a
d
e
s
,
p
2 2 3 3 3
l
4 4 0 4 4
a
2 0 8 2 6
n
. . . . .
t
9 3 4 1 1
a
y
e
q
u
i
p
o
n
e
t
o
s
F 3 3 3 3 3
o 6 6 6 6 6
n 0 0 0 0 0
d
o
d
e
c
o
m
e
r
c
i
o . . . . .
e 7 7 7 7 7
i
n
t
a
n
g
i
b
l
e
s
L
o
s
a
c
ti
7 7 8 8 .
I cant seem to figure out what I am doing wrong in my PyCha.pdf
I can't seem to figure out what I am doing wrong in my PyCharm when creating a python file. I
appear to only have one output when I run the program I can't figure out why. Can any one help?
File Ecit Yieur Navigate Code Refactor Run Iools vCS Whindow Help Myproject-Namehge.py
Project Namegepy Re NameAngepy x from datetime import date def main(): * ain function name =
input('lhat is your name? ') age = int(input(' How old are you? ')) current_year = date.today().year #
Get curpent year birth_year = current_year - age # Calculate birth year print('Hello {} ! You were
bonn in {}, . format(name, birth_year)) I main().
fill in the blank What is incorrect about an SCorp a Owne.pdf
fill in the blank What is incorrect about an S-Corp? a. Owners have limited personal liability for
business debts b. An S-Corp cannot have more than 100 owners c. All owners must be residents
of the United States d. If you are a shareholder and employee of a company, you must pay
yourself a reasonable salary e. In an S-Corp profits don't need to be distributed according to the
ownership percentage of the owners QUESTION 13 Why is having executive directors on a
corporation's board of directors problematic? a. Executive directors are not as knowledgeable
about operations as non-executive directors. b. Executive directors will basically be taking on the
role of overseeing themselves. r. Executive directors will not have the time to dedicate to board
activities. QUESTION 14 Only _._._. can issue stock. a. Partnerships b. Corporations c. Sole
proprietorships d. LLCs.
An estimated regression equation was developed to predict th.pdf
An estimated regression equation was developed to predict the average number of runs given up
per inning pitched (R/IP) given the average number of strikeouts per inning pitched (SO/IP) and
the average number of home runs per inning pitched (HR/IP).
(a)
Use the F test to determine the overall significance of the relationship.
State the null and alternative hypotheses.
H : = = 0
0 1 2
H : One or more of the parameters is not equal to zero.
aH:
= 0
0 0
H : 0
a 0
H : = = 0
0 1 2
H : All the parameters are not equal to zero.
aH:
0
0 0
H : = 0
a 0
H : One or more of the parameters is not equal to zero.
0H:
= = 0
a 1 2
Calculate the test statistic. (Round your answer to two decimal places.)
t stat =
Calculate the p-value. (Round your answer to three decimal places.)
p-value =
What is your conclusion at the 0.05 level of significance?
Do not reject H . There is insufficient evidence to conclude that there is a significant overall
0
relationship.
Do not reject H . There is sufficient evidence to conclude that there is a significant overall
0
relationship.
Reject H . There is sufficient evidence to conclude that there is a significant overall relationship.
0
Reject H . There is insufficient evidence to conclude that there is a significant overall relationship.
0
(b)
Use the t test to determine the significance of SO/IP.
State the null and alternative hypotheses.
H : = 0
0 1
H : > 0
a 1
H : 0
0 1
H : < 0
a 1
H : 0
0 1
H : = 0
a 1
H : 0
0 1
H : > 0
a 1
H : = 0
0 1
H : 0
a 1
Find the value of the test statistic for . (Round your answer to two decimal places.)
1
t stat =
Find the p-value for . (Round your answer to three decimal places.)
1
p-value =
What is your conclusion at the 0.05 level of significance?
Reject H . There is insufficient evidence to conclude that SO/IP is a significant factor.
0
Do not reject H . There is insufficient evidence to conclude that SO/IP is a significant factor.
0
Reject H . There is sufficient evidence to conclude that SO/IP is a significant factor.
0
Do not reject H . There is sufficient evidence to conclude that SO/IP is a significant factor.
0
Use the t test to determine the significance of HR/IP.
State the null and alternative hypotheses.
H : 0
0 2
H : > 0
a 2
H : 0
0 2
H : = 0
a 2
H : 0
0 2
H : < 0
a 2
H : = 0
0 2
H : 0
a 2
H : = 0
0 2
H : > 0
a 2
Find the value of the test statistic for . (Round your answer to two decimal places.)
2
t stat =
Find the p-value for . (Round your answer to three decimal places.)
2
p-value =
What is your conclusion at the 0.05 level of significance?
Do not reject H . There is sufficient evidence to conclude that HR/IP is a significant factor.
0
Reject H . There is insufficient evidence to conclude that HR/IP is a significant factor.
0
Reject H . There is sufficient evidence to conclude that HR/IP is a significant factor.
0
Do not reject H . There is insufficient evidence to conclude that HR/IP is a significant factor.
0
Player Team W L ERA SO/IP HR/IP R/IP
Verlander,
DET 24 5 2.40 1.00 0.1.
Far from being rigid and inflexible the doctrine of precede.pdf
Far from being rigid and inflexible, the doctrine of precedent enables judges to develop legal
principles and respond to broader historical and institutional developments in and outside the legal
system. The doctrine of Judicial Precedent ... a doctrine which compels judges to synthesize
present decisions (or at least articulate the reasons for such decisions) out of the accumulated
wisdom (or folly) of their judicial forebears.,, David Vong (*) Far from being rigid and inflexible, the
doctrine of precedent enables judges to develop
legalprinciplesandrespondtobroaderhistoricalandinstitutionaldevelopmentsinandoutsidethelegalsys
tem.
i) Discuss the role and importance of the doctrine of judicial precedent in English legal system.
Provide reference and citation.
Exhibit Multiplier The marginal propensity to consume is 0.pdf
Exhibit: Multiplier The marginal propensity to consume is 0.8 , and potential output is $800 billion.
Reference: Ref 12-6 (Exhibit: Multiplier) If current real GDP is $850, which of the following policies
would bring the economy to potential output? Increase transfers by $12.5 billion. Increase taxes by
$50 billion. Increase taxes by $12.5 billion. Increase taxes by $10 billion.Suppose that Canadian
government debt is $700 billion dollars at the beginning of the fiscal year. During the fiscal year,
government spending and government transfers are $200 billion and tax revenues equal $150
billion. At the end of the fiscal year, the debt is: $1,050 billion. $750 billion. $900 billion. $650
billion..
More from acmefit (20)
What can we say about these results Smokers have a nonstat.pdf
What can we say about these results Smokers have a nonstat.pdf
We use the recursion xixi1+i1iN We use 00 You need to o.pdf
We use the recursion xixi1+i1iN We use 00 You need to o.pdf
The lifespan of the Ebola virus on flat dry surfaces has a n.pdf
The lifespan of the Ebola virus on flat dry surfaces has a n.pdf
Struter Partnership tiene un capital total de socios de 460.pdf
Struter Partnership tiene un capital total de socios de 460.pdf
Question 10 Which of the following cannot be said regardin.pdf
Question 10 Which of the following cannot be said regardin.pdf
Q5 5 marks For a natural number e let We denote the domai.pdf
Q5 5 marks For a natural number e let We denote the domai.pdf
PF1224A Journalizing withdrawal of cash from partnership .pdf
PF1224A Journalizing withdrawal of cash from partnership .pdf
Please answer the 3 questions below thank you in advance Wh.pdf
Please answer the 3 questions below thank you in advance Wh.pdf
please solve this Operators in the same row have the same pr.pdf
please solve this Operators in the same row have the same pr.pdf
a Suppose R is a partial order over set A Prove or disprov.pdf
a Suppose R is a partial order over set A Prove or disprov.pdf
please help me with the case study Read the case study .pdf
please help me with the case study Read the case study .pdf
Note Use the Tax Tables to calculate the answers to the pro.pdf
Note Use the Tax Tables to calculate the answers to the pro.pdf
Mayu is responsible for the security of her companys server.pdf
Mayu is responsible for the security of her companys server.pdf
Country Financial a financial services company uses survey.pdf
Country Financial a financial services company uses survey.pdf
Consulte la tabla a continuacin que muestra los datos de lo.pdf
Consulte la tabla a continuacin que muestra los datos de lo.pdf
I cant seem to figure out what I am doing wrong in my PyCha.pdf
I cant seem to figure out what I am doing wrong in my PyCha.pdf
fill in the blank What is incorrect about an SCorp a Owne.pdf
fill in the blank What is incorrect about an SCorp a Owne.pdf
An estimated regression equation was developed to predict th.pdf
An estimated regression equation was developed to predict th.pdf
Far from being rigid and inflexible the doctrine of precede.pdf
Far from being rigid and inflexible the doctrine of precede.pdf
Exhibit Multiplier The marginal propensity to consume is 0.pdf
Exhibit Multiplier The marginal propensity to consume is 0.pdf
Recently uploaded
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Introduction to Quality Improvement Essentials
This is a presentation by Dada Robert in a Your Skill Boost masterclass organised by the Excellence Foundation for South Sudan (EFSS) on Saturday, the 25th and Sunday, the 26th of May 2024.
He discussed the concept of quality improvement, emphasizing its applicability to various aspects of life, including personal, project, and program improvements. He defined quality as doing the right thing at the right time in the right way to achieve the best possible results and discussed the concept of the "gap" between what we know and what we do, and how this gap represents the areas we need to improve. He explained the scientific approach to quality improvement, which involves systematic performance analysis, testing and learning, and implementing change ideas. He also highlighted the importance of client focus and a team approach to quality improvement.
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
Home assignment II on Spectroscopy 2024 Answers.pdf
Answers to Home assignment on UV-Visible spectroscopy: Calculation of wavelength of UV-Visible absorption
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
Class 11 CBSE Business Studies Project ( AIDS TO TRADE - INSURANCE)
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
The approach at University of Liverpool.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
The Roman Empire A Historical Colossus.pdf
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is prepared for master's students (MIFB & MIBS) UUM. May it be useful to all.special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
The Art Pastor's Guide to Sabbath | Steve Thomason
What is the purpose of the Sabbath Law in the Torah. It is interesting to compare how the context of the law shifts from Exodus to Deuteronomy. Who gets to rest, and why?
The geography of Taylor Swift - some ideas
Geographical themes connected with Taylor Swift's ERAS tour - coming to the UK in June 2024
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Event Link:-
https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-exploring-gemini-ai-and-integration-with-mulesoft/
Agenda
● Java 17 Upgrade Overview
● Why and by when do customers need to upgrade to Java 17?
● Is there any immediate impact to upgrading to Mule Runtime 4.6 and beyond?
● Which MuleSoft products are in scope?
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/
YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Shyam Raj Prasad-
https://www.linkedin.com/in/shyam-raj-prasad/
Palestine last event orientationfvgnh .pptx
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Recently uploaded (20)
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Home assignment II on Spectroscopy 2024 Answers.pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
CLASS 11 CBSE B.St Project AIDS TO TRADE - INSURANCE
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
Basic phrases for greeting and assisting costumers
Basic phrases for greeting and assisting costumers
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
The Art Pastor's Guide to Sabbath | Steve Thomason
The Art Pastor's Guide to Sabbath | Steve Thomason
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
ItemNodeh include ltiostreamgt include ltstring.pdf
- 1. ItemNode.h: #include <iostream> #include <string> using namespace std; class ItemNode { private: string item; ItemNode* nextNodeRef; public: // Constructor ItemNode() { item = ""; nextNodeRef = NULL; } // Constructor ItemNode(string itemInit) { this->item = itemInit; this->nextNodeRef = NULL; } // Constructor ItemNode(string itemInit, ItemNode *nextLoc) { this->item = itemInit; this->nextNodeRef = nextLoc; } // Insert node after this node. void InsertAfter(ItemNode &nodeLoc) { ItemNode* tmpNext; tmpNext = this->nextNodeRef; this->nextNodeRef = &nodeLoc; nodeLoc.nextNodeRef = tmpNext; } // Define InsertAtEnd() function that inserts a node // to the end of the linked list void InsertAtEnd(string item) { ItemNode* newNode = new ItemNode(item); if (nextNodeRef == NULL) { nextNodeRef = newNode; } else { ItemNode* current = nextNodeRef; while (current->nextNodeRef != NULL) { current = current->nextNodeRef;
- 2. } current->nextNodeRef = newNode; } } // Get location pointed by nextNodeRef ItemNode* GetNext() { return this->nextNodeRef; } void PrintNodeData() { cout << this->item << endl; } }; int main() { int numItems; cin >> numItems; ItemNode head; ItemNode* current = &head; for (int i = 0; i < numItems; i++) { string item; cin >> item; current->InsertAtEnd(item); current = current->GetNext(); } current = head.GetNext(); while (current != NULL) { current->PrintNodeData(); current = current->GetNext(); } return 0; } main.cpp (only for viewing) #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;
- 3. cin >> input; for (i = 0; i < input; i++) { cin >> item; currNode = new ItemNode(item); lastNode->InsertAtEnd(currNode); lastNode = currNode; } // Print linked list currNode = headNode->GetNext(); while (currNode != NULL) { currNode->PrintNodeData(); currNode = currNode->GetNext(); } } in c++ please. Thank you! 18.18 LAB: Grocery shopping list (linked list: inserting at the end of a list) Given main0, 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: begin{tabular}{|l} hline 4 Kale Lettuce Carrots Peanuts end{tabular} where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: