1- GivenaclassnamedTicketDB- whichwillbeusedtoprovidetheresponsibility.docx
•Download as DOCX, PDF•
0 likes•2 views
TicketDB is a class that uses an ArrayList to manage Ticket objects. It provides methods to add tickets, calculate the average price, retrieve tickets by ID, obtain tickets within a price range, and write all tickets to a text file called 'tickets-report.txt' using printf formatting. The class implements methods for core ticket data management and reporting functionality.
Report
Share
Report
Share
Recommended
Amusement Park Programming ProjectProject Outcomes1. Use the Jav.docx
Amusement Park Programming Project
Project Outcomes
1. Use the Java selection constructs (if and if else).
2. Use the Java iteration constructs (while, do, for).
3. Use Boolean variables and expressions to control iterations.
4. Use arrays or ArrayList for storing objects.
5. Proper design techniques.
Project Requirements
Your job is to implement a simple amusement park information system that keeps track of admission tickets and merchandise in the gift shop. The information system consists of three classes including a class to model tickets, a class to model gift shop merchandise, the amusement park, and the amusement park tester. The gift shop supports access to specific merchandise in the park’s gift shop and to purchase the merchandise or to order new merchandise for the gift shop. The UML diagram for each class (except the tester class) is given below.
1) Develop a simple class that models admission tickets. Each admission is described by several instance fields:
a. A ticket number as a long integer to identify the unique ticket,
b. A ticket category represented as a String to store the category of the ticket (i.e. adult, child, senior),
c. A ticket holder represented as a String to store the name of the person who purchased the ticket,
d. A date represented as a Date to store the admission date for the ticket,
e. A price represented as a double to store the price of the ticket,
f. A purchase status represented as a boolean to indicate if the ticket has been purchased (or is reserved).
Ticket
-number : long
-category : String
-holder : String
-date : Date
-price : double
In addition to these fields, the class has the following constructors and
methods:
a. A parameterized constructor that initializes the attributes of a ticket.
b. setPrice(double price) to change the price of a textbook.
c. changePurchaseStatus(boolean newStatus) to change the
purchase status of the ticket.
d. Accessor methods for all instance fields.
e. toString() to return a neatly formatted string that contains all the
information stored in the instance fields.
2) Develop a simple class that models merchandise available in the gift shop
such as t-shirts, sweatshirts, and stuffed animals. The class has several
instance fields:
a. An ID as a long integer to identify the specific merchandise item,
b. A category as a String to store the specific type of merchandise,
c. A description as a String to store the description of the merchandise,
d. A price represented as a double to store the price of the merchandise,
e. An instock as a boolean to indicate if the merchandise is instock or onorder.
Valid values for category include "T-Shirt", "Sweatshirt", and "Stuffed Animal",
as well as any additional category you choose to support. If invalid values are
entered, an error message must be printed and the category instance field
must be set to "UNKNOWN".
In addition to these attributes, the class has the following constructors and
methods:
f. A parameterized constructor that initi.
Cs 210 introduction to programming java programming
FOR MORE CLASSES VISIT
tutorialoutletdotcom
Regis University CC&ISCS210 Introduction to ProgrammingJava Programming Assignment 8: Array ImplementationNOTE: This assignment will be more challenging than the previous assignments, so make sure tostart early and allocate enough time to complete it, including time you might need to seek
12.9 Program Online shopping cart (continued) (C++)This program e.pdf
12.9 Program: Online shopping cart (continued) (C++)
This program extends the earlier \"Online shopping cart\" program. (Consider first saving your
earlier program).
(1) Extend the ItemToPurchase class per the following specifications:
Parameterized constructor to assign item name, item description, item price, and item quantity
(default values of 0). (1 pt)
Public member functions
SetDescription() mutator & GetDescription() accessor (2 pts)
PrintItemCost() - Outputs the item name followed by the quantity, price, and subtotal
PrintItemDescription() - Outputs the item name and description
Private data members
string itemDescription - Initialized in default constructor to \"none\"
Ex. of PrintItemCost() output:
Ex. of PrintItemDescription() output:
(2) Create three new files:
ShoppingCart.h - Class declaration
ShoppingCart.cpp - Class definition
main.cpp - main() function (Note: main()\'s functionality differs from the warm up)
Build the ShoppingCart class with the following specifications. Note: Some can be function
stubs (empty functions) initially, to be completed in later steps.
Default constructor
Parameterized constructor which takes the customer name and date as parameters (1 pt)
Private data members
string customerName - Initialized in default constructor to \"none\"
string currentDate - Initialized in default constructor to \"January 1, 2016\"
vector < ItemToPurchase > cartItems
Public member functions
GetCustomerName() accessor (1 pt)
GetDate() accessor (1 pt)
AddItem()
Adds an item to cartItems vector. Has parameter ItemToPurchase. Does not return anything.
RemoveItem()
Removes item from cartItems vector. Has a string (an item\'s name) parameter. Does not return
anything.
If item name cannot be found, output this message: Item not found in cart. Nothing removed.
ModifyItem()
Modifies an item\'s description, price, and/or quantity. Has parameter ItemToPurchase. Does not
return anything.
If item can be found (by name) in cart, check if parameter has default values for description,
price, and quantity. If not, modify item in cart.
If item cannot be found (by name) in cart, output this message: Item not found in cart. Nothing
modified.
GetNumItemsInCart() (2 pts)
Returns quantity of all items in cart. Has no parameters.
GetCostOfCart() (2 pts)
Determines and returns the total cost of items in cart. Has no parameters.
PrintTotal()
Outputs total of objects in cart.
If cart is empty, output this message: SHOPPING CART IS EMPTY
PrintDescriptions()
Outputs each item\'s description.
Ex. of PrintTotal() output:
Ex. of PrintDescriptions() output:
(3) In main(), prompt the user for a customer\'s name and today\'s date. Output the name and
date. Create an object of type ShoppingCart. (1 pt)
Ex.
(4) Implement the PrintMenu() function. PrintMenu() has a ShoppingCart parameter, and
outputs a menu of options to manipulate the shopping cart. Each option is represented by a single
character. Build and output the menu within the function.
If the an inval.
Arrays
This document discusses various linear data structures in C including arrays, records, pointers, and related operations. It describes declaring and initializing one-dimensional and two-dimensional arrays. Records are used to store related data elements using structures. Pointer arrays and dynamic arrays allocated at runtime are also covered. Searching algorithms like linear search and binary search, and sorting algorithms like bubble sort are summarized.
Everything needs to be according to the instructions- thank you! SUPPO.pdf
Everything needs to be according to the instructions, thank you!
SUPPORTING CODE:
MyList.java
/**
This interface specifies the basic operations of any list-like object.
This interface contains a variation of the methods of the
standard java.util.List interface.
*/
public interface MyList {
/**
Adds an element at the end of the list.
*/
public void addToEnd(Object o);
/**
Inserts an element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void insertAt(int index, Object o);
/**
Removes the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void removeAt(int index);
/**
Returns the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public Object getAt(int index);
/**
Returns the size of the list.
@return the number of elements in the list
*/
public int getSize();
/**
Returns a list iterator for this list.
@return a list iterator for this list
*/
public MyListIterator getIterator();
}
MyListIterator.java
/**
A list iterator allows access of a position in a list.
This interface contains a subset of the methods of the
standard java.util.ListIterator interface. The methods for
backward traversal are not included.
*/
public interface MyListIterator
{
/**
Moves the iterator past the next element.
@return the traversed element
*/
Object next();
/**
Tests if there is an element after the iterator
position.
@return true if there is an element after the iterator
position
*/
boolean hasNext();
}
Main.java
// you may use this file to write and run code to test your MyArrayList class
public class Main {
public static void main(String[] args) {
}
}
FILE THAT NEEDS THAT NEEDS CODE:
MyArrayList.java
// Complete the implementation of your MyArrayList class in this file
public class MyArrayList implements MyList {
// Implement the required fields and methods here
private int capacity = 8;
private Object[ ] array = new Object [capacity];
private int size = 0;
@Override
public void add(Object o) {
if (size >= capacity){
Object[] temp = new Object[2*array.length];
for(int i=0;i<size;++i){
temp[i] = array[i];
}
this.capacity = 2*array.length;
array = temp;
array[size++] = o;
return;
}
else
{
array[size++] = o;
}
}
@Override
public int size() {
return size;
}
@Override
public Object at(int index) {
if (index >= capacity)
return null;
else
return array[index];
}
@Override
public void insertAt(int index, Object o) {
if (index >= capacity)
return;
else
{
size++;
for (int x = size - 1; x > index; x--) {
array[x] = array[x - 1];
}
array[index] = o;
}
}
@Override
public void removeAt(int index) {
if (index >= size || size == 0)
return;
else {
Object e = array[index];
for (int x = index; x < this.array.length - 1; x++) {
array[x] = array[x + 1];
}
size--;
}
}
public void ensureCapacity(int minCapacity) {
}
public void trimToSize() {
ensureCapacity(size);
}
// Do not alter the code below
@Override
public MyListIterator getIterator() {
return new MyA.
Please the following is the currency class of perious one- class Curre.pdf
Please the following is the currency class of perious one.
class Currency {
protected:
int whole;
int fraction;
virtual std::string get_name() = 0;
public:
Currency() {
whole = 0;
fraction = 0;
}
Currency(double value) {
if (value < 0)
throw "Invalid value";
whole = int(value);
fraction = std::round(100 * (value - whole));
}
Currency(const Currency& curr) {
whole = curr.whole;
fraction = curr.fraction;
}
/* This algorithm gets the whole part or fractional part of the currency
Pre: whole, fraction - integer numbers
Post:
Return: whole or fraction
*/
int get_whole() { return whole; }
int get_fraction() { return fraction; }
/* This algorithm adds an object to the same currency
Pre: object (same currency)
Post:
Return:
*/
void set_whole(int w) {
if (w >= 0)
whole = w;
}
void set_fraction(int f) {
if (f >= 0 && f < 100)
fraction = f;
}
/* This algorithm adds an object to the same currency
Pre: object (same currency)
Post:
Return:
*/
void add(const Currency* curr) {
whole += curr->whole;
fraction += curr->fraction;
if (fraction > 100) {
whole++;
fraction %= 100;
}
}
/* This algorithm subtracts an object to the same currency
Pre: object (same currency)
Post:
Return:
*/
void subtract(const Currency* curr) {
if (!isGreater(*curr))
throw "Invalid Subtraction";
whole -= curr->whole;
if (fraction < curr->fraction) {
fraction = fraction + 100 - curr->fraction;
whole--;
}
else {
fraction -= curr->fraction;
}
}
/* This algorithm compares the an object of the same currency for equality or inequality
Pre: object (same currency)
Post:
Return: whole/fraction
*/
bool isEqual(const Currency& curr) {
return curr.whole == whole && curr.fraction == fraction;
}
/* This algorithm compares the an object of the same currency to determine which is greater or
smaller
Pre: object (same currency)
Post:
Return: true/false
*/
bool isGreater(const Currency& curr) {
if (whole < curr.whole)
return false;
if (whole == curr.whole && fraction < curr.fraction)
return false;
return true;
}
/* This algorithm prints the name and value of the currency object
Pre: value of whole, fraction, and the name
Post: whole, fraction, get_name()
Return:
*/
void print() {
std::cout << whole << "." << fraction << " " << get_name() << std::endl;
}
};
class Krone : public Currency {
protected:
/*
This algorithm gets the name for the Currency.
Pre: name - declared as string and initialized as Krone
Post:
Return: name
*/
std::string name = "Krone";
std::string get_name() {
return name;
}
public:
Krone() : Currency() { }
Krone(double value) : Currency(value) { }
Krone(Krone& curr) : Currency(curr) { }
};
class Soum : public Currency {
protected:
/* This algorithm gets the name for the Currency.
Pre: name - declared as string and initialized as Soum
Post:
Return: name
*/
std::string name = "Soum";
std::string get_name() {
return name;
}
public:
Soum() : Currency() { }
Soum(double value) : Currency(value) { }
Soum(Krone& curr) : Currency(curr) { }
};
A LinkNode structure or class which will have two attrib.
C++ help finish my code Phase 1 - input phase. Main reads the fi.pdf
C++ help finish my code
Phase 1 - input phase. Main reads the file and populates one Grocery element in the array for
each input
record. This is a standard .txt file and is delimited by new line (\n) characters at the end of every
input record.
This allows you to use getline. See the Canvas assignment and copy the file named a4data.txt to
your
machine. Do not change the name of the file it must be a4data.txt. Assume that the input will be
correct.
The input record format is:
6 characters - item UPC
20 characters - item description
6 characters - cost (999.99 format)
6 characters - selling price (999.99 format)
3 characters - inventory on hand
1 character - status (o on order; d discontinued; s on shelf)
Use correct read loop logic as discussed in class.
There is no constructor. The Grocery array is statically allocated, so if there was a constructor, it
would be
executed when the array was first defined, once per element.
The maximum number of grocery items is 100, and youll need a counter to keep track of how
many there
actually are. Define that counter as a static variable in the Grocery class, and use it throughout
your code as
needed.
At the end of phase 1, main has built a set of Grocery objects.
Next, main should display all the Grocery objects to ensure that the array has been built
correctly. Examine
the input data and determine if your code is processing all the records, and each record correctly.
Display
them after you have processed the input file; do not list each object as its created within the read
loop. Use
some appropriate column formatting so that you can make sense of the output, and so that you
can verify
that the objects have all been created and populated correctly. At this point, there is no price
history data,
that will be added in the next phase. Your display should look something like this:
=====================================================================
=
UPC Description Cost Price Inventory Status
=====================================================================
=
123456 Peas, canned, 12 oz 1.23 1.89 100 s
234567 Tomatoes, sundried 2.25 3.75 25 s
345676 Pineapple, whole 2.99 4.25 0 o
Phase 2 Transaction processing phase. Main asks the console user for transactions. Use getline;
do
not use some other form of input. There are four different types of transactions. Assume the
transaction data
is valid (no error checking needed). There are four types of transactions:
D
Display a list of all Grocery items, one item at a time, something like this:
=====================================================================
=
UPC Description Cost Price Inventory Status
=====================================================================
=
123456 Peas, canned, 12 oz 1.23 1.89 100 s
Price history: 2021-03-17 1.11
2021-04-17 1.45
2022-06-14 1.89
234567 Tomatoes, sundried 2.25 3.75 25 s
Price history: 2021-03-17 1.98
2021-04-17 2.25
345676 Pineapple, whole 2.99 4.25 0 o
Price history: there is no price history for this item.
Create a Queue class that implements a queue abstraction. A queue is.docx
Create a Queue class that implements a queue abstraction. A queue is a FIFO list (First In First Out queue). A simple example is waiting in line, where the first person in the line is the first served. New arrivals are added to the back of the line, the next person served is (removed) from the front of the line.
The Queue class needs to implement the following operations:
adding to the queue at one end (the tail)
removing from the queue at the other end (the head)
printing all items the queue (from head to tail)
erasing all items in the queue (leaving the queue empty).
destructor to empty the queue before it's destroyed (to release all memory)
Additions and removals always occur at the opposite ends of the queue.
You should create the following methods in your Queue class to implement the above operations
addItem
removeItem
print
erase
Your Queue class must implement a linked list. Linked lists are implemented using individual items which contain a pointer to the next item in the list, as well as the information to be stored.
Your Queue implementation uses a companion QueueItem class to represent each element in the list. A QueueItem contains character string as the data value, a unique (among all QueueItems in a Queue) integer item identifier, and a pointer to the next QueueItem in the list. The following is the definition for the QueueItem class.
class QueueItem {
public:
QueueItem(char *pData, int id); // ctor
void setNext(QueueItem *pItem);
QueueItem* getNext() const;
int getId() const;
const char* getData() const;
private:
char _data[30]; // or, use a char* if you want to dynamically alloc memory
const int _itemId; // unique id for item in queue
QueueItem* _pNext; // next item in queue
};
The QueueItem member functions are very basic, just setting or getting data members of the class. All the linked list manipulation is done by the Queue class member functions.
The Queue class member functions manipulate the linked list of QueueItem's, creating and destroying QueueItem objects as needed using the C++ new and delete operators. The Queue class member data includes a pointer to the head and and pointer to the tail of the linked list of QueueItems, and an integer item counter used to provide a unique item ID for every newly created QueueItem (incremented each time a new QueueItem is added, and passed as a parameter to the QueueItem constructor. It is never decremented).
The following is a partial example of the Queue class; you will need to fill in the remaining methods.
class Queue {
public:
Queue(); // ctor inits a new empty Queue
~Queue(); // dtor erases any remaining QueueItems
void addItem(char *pData);
void removeItem();
...
private:
QueueItem *_pHead; // always points to first QueueItem in .
Recommended
Amusement Park Programming ProjectProject Outcomes1. Use the Jav.docx
Amusement Park Programming Project
Project Outcomes
1. Use the Java selection constructs (if and if else).
2. Use the Java iteration constructs (while, do, for).
3. Use Boolean variables and expressions to control iterations.
4. Use arrays or ArrayList for storing objects.
5. Proper design techniques.
Project Requirements
Your job is to implement a simple amusement park information system that keeps track of admission tickets and merchandise in the gift shop. The information system consists of three classes including a class to model tickets, a class to model gift shop merchandise, the amusement park, and the amusement park tester. The gift shop supports access to specific merchandise in the park’s gift shop and to purchase the merchandise or to order new merchandise for the gift shop. The UML diagram for each class (except the tester class) is given below.
1) Develop a simple class that models admission tickets. Each admission is described by several instance fields:
a. A ticket number as a long integer to identify the unique ticket,
b. A ticket category represented as a String to store the category of the ticket (i.e. adult, child, senior),
c. A ticket holder represented as a String to store the name of the person who purchased the ticket,
d. A date represented as a Date to store the admission date for the ticket,
e. A price represented as a double to store the price of the ticket,
f. A purchase status represented as a boolean to indicate if the ticket has been purchased (or is reserved).
Ticket
-number : long
-category : String
-holder : String
-date : Date
-price : double
In addition to these fields, the class has the following constructors and
methods:
a. A parameterized constructor that initializes the attributes of a ticket.
b. setPrice(double price) to change the price of a textbook.
c. changePurchaseStatus(boolean newStatus) to change the
purchase status of the ticket.
d. Accessor methods for all instance fields.
e. toString() to return a neatly formatted string that contains all the
information stored in the instance fields.
2) Develop a simple class that models merchandise available in the gift shop
such as t-shirts, sweatshirts, and stuffed animals. The class has several
instance fields:
a. An ID as a long integer to identify the specific merchandise item,
b. A category as a String to store the specific type of merchandise,
c. A description as a String to store the description of the merchandise,
d. A price represented as a double to store the price of the merchandise,
e. An instock as a boolean to indicate if the merchandise is instock or onorder.
Valid values for category include "T-Shirt", "Sweatshirt", and "Stuffed Animal",
as well as any additional category you choose to support. If invalid values are
entered, an error message must be printed and the category instance field
must be set to "UNKNOWN".
In addition to these attributes, the class has the following constructors and
methods:
f. A parameterized constructor that initi.
Cs 210 introduction to programming java programming
FOR MORE CLASSES VISIT
tutorialoutletdotcom
Regis University CC&ISCS210 Introduction to ProgrammingJava Programming Assignment 8: Array ImplementationNOTE: This assignment will be more challenging than the previous assignments, so make sure tostart early and allocate enough time to complete it, including time you might need to seek
12.9 Program Online shopping cart (continued) (C++)This program e.pdf
12.9 Program: Online shopping cart (continued) (C++)
This program extends the earlier \"Online shopping cart\" program. (Consider first saving your
earlier program).
(1) Extend the ItemToPurchase class per the following specifications:
Parameterized constructor to assign item name, item description, item price, and item quantity
(default values of 0). (1 pt)
Public member functions
SetDescription() mutator & GetDescription() accessor (2 pts)
PrintItemCost() - Outputs the item name followed by the quantity, price, and subtotal
PrintItemDescription() - Outputs the item name and description
Private data members
string itemDescription - Initialized in default constructor to \"none\"
Ex. of PrintItemCost() output:
Ex. of PrintItemDescription() output:
(2) Create three new files:
ShoppingCart.h - Class declaration
ShoppingCart.cpp - Class definition
main.cpp - main() function (Note: main()\'s functionality differs from the warm up)
Build the ShoppingCart class with the following specifications. Note: Some can be function
stubs (empty functions) initially, to be completed in later steps.
Default constructor
Parameterized constructor which takes the customer name and date as parameters (1 pt)
Private data members
string customerName - Initialized in default constructor to \"none\"
string currentDate - Initialized in default constructor to \"January 1, 2016\"
vector < ItemToPurchase > cartItems
Public member functions
GetCustomerName() accessor (1 pt)
GetDate() accessor (1 pt)
AddItem()
Adds an item to cartItems vector. Has parameter ItemToPurchase. Does not return anything.
RemoveItem()
Removes item from cartItems vector. Has a string (an item\'s name) parameter. Does not return
anything.
If item name cannot be found, output this message: Item not found in cart. Nothing removed.
ModifyItem()
Modifies an item\'s description, price, and/or quantity. Has parameter ItemToPurchase. Does not
return anything.
If item can be found (by name) in cart, check if parameter has default values for description,
price, and quantity. If not, modify item in cart.
If item cannot be found (by name) in cart, output this message: Item not found in cart. Nothing
modified.
GetNumItemsInCart() (2 pts)
Returns quantity of all items in cart. Has no parameters.
GetCostOfCart() (2 pts)
Determines and returns the total cost of items in cart. Has no parameters.
PrintTotal()
Outputs total of objects in cart.
If cart is empty, output this message: SHOPPING CART IS EMPTY
PrintDescriptions()
Outputs each item\'s description.
Ex. of PrintTotal() output:
Ex. of PrintDescriptions() output:
(3) In main(), prompt the user for a customer\'s name and today\'s date. Output the name and
date. Create an object of type ShoppingCart. (1 pt)
Ex.
(4) Implement the PrintMenu() function. PrintMenu() has a ShoppingCart parameter, and
outputs a menu of options to manipulate the shopping cart. Each option is represented by a single
character. Build and output the menu within the function.
If the an inval.
Arrays
This document discusses various linear data structures in C including arrays, records, pointers, and related operations. It describes declaring and initializing one-dimensional and two-dimensional arrays. Records are used to store related data elements using structures. Pointer arrays and dynamic arrays allocated at runtime are also covered. Searching algorithms like linear search and binary search, and sorting algorithms like bubble sort are summarized.
Everything needs to be according to the instructions- thank you! SUPPO.pdf
Everything needs to be according to the instructions, thank you!
SUPPORTING CODE:
MyList.java
/**
This interface specifies the basic operations of any list-like object.
This interface contains a variation of the methods of the
standard java.util.List interface.
*/
public interface MyList {
/**
Adds an element at the end of the list.
*/
public void addToEnd(Object o);
/**
Inserts an element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void insertAt(int index, Object o);
/**
Removes the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void removeAt(int index);
/**
Returns the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public Object getAt(int index);
/**
Returns the size of the list.
@return the number of elements in the list
*/
public int getSize();
/**
Returns a list iterator for this list.
@return a list iterator for this list
*/
public MyListIterator getIterator();
}
MyListIterator.java
/**
A list iterator allows access of a position in a list.
This interface contains a subset of the methods of the
standard java.util.ListIterator interface. The methods for
backward traversal are not included.
*/
public interface MyListIterator
{
/**
Moves the iterator past the next element.
@return the traversed element
*/
Object next();
/**
Tests if there is an element after the iterator
position.
@return true if there is an element after the iterator
position
*/
boolean hasNext();
}
Main.java
// you may use this file to write and run code to test your MyArrayList class
public class Main {
public static void main(String[] args) {
}
}
FILE THAT NEEDS THAT NEEDS CODE:
MyArrayList.java
// Complete the implementation of your MyArrayList class in this file
public class MyArrayList implements MyList {
// Implement the required fields and methods here
private int capacity = 8;
private Object[ ] array = new Object [capacity];
private int size = 0;
@Override
public void add(Object o) {
if (size >= capacity){
Object[] temp = new Object[2*array.length];
for(int i=0;i<size;++i){
temp[i] = array[i];
}
this.capacity = 2*array.length;
array = temp;
array[size++] = o;
return;
}
else
{
array[size++] = o;
}
}
@Override
public int size() {
return size;
}
@Override
public Object at(int index) {
if (index >= capacity)
return null;
else
return array[index];
}
@Override
public void insertAt(int index, Object o) {
if (index >= capacity)
return;
else
{
size++;
for (int x = size - 1; x > index; x--) {
array[x] = array[x - 1];
}
array[index] = o;
}
}
@Override
public void removeAt(int index) {
if (index >= size || size == 0)
return;
else {
Object e = array[index];
for (int x = index; x < this.array.length - 1; x++) {
array[x] = array[x + 1];
}
size--;
}
}
public void ensureCapacity(int minCapacity) {
}
public void trimToSize() {
ensureCapacity(size);
}
// Do not alter the code below
@Override
public MyListIterator getIterator() {
return new MyA.
Please the following is the currency class of perious one- class Curre.pdf
Please the following is the currency class of perious one.
class Currency {
protected:
int whole;
int fraction;
virtual std::string get_name() = 0;
public:
Currency() {
whole = 0;
fraction = 0;
}
Currency(double value) {
if (value < 0)
throw "Invalid value";
whole = int(value);
fraction = std::round(100 * (value - whole));
}
Currency(const Currency& curr) {
whole = curr.whole;
fraction = curr.fraction;
}
/* This algorithm gets the whole part or fractional part of the currency
Pre: whole, fraction - integer numbers
Post:
Return: whole or fraction
*/
int get_whole() { return whole; }
int get_fraction() { return fraction; }
/* This algorithm adds an object to the same currency
Pre: object (same currency)
Post:
Return:
*/
void set_whole(int w) {
if (w >= 0)
whole = w;
}
void set_fraction(int f) {
if (f >= 0 && f < 100)
fraction = f;
}
/* This algorithm adds an object to the same currency
Pre: object (same currency)
Post:
Return:
*/
void add(const Currency* curr) {
whole += curr->whole;
fraction += curr->fraction;
if (fraction > 100) {
whole++;
fraction %= 100;
}
}
/* This algorithm subtracts an object to the same currency
Pre: object (same currency)
Post:
Return:
*/
void subtract(const Currency* curr) {
if (!isGreater(*curr))
throw "Invalid Subtraction";
whole -= curr->whole;
if (fraction < curr->fraction) {
fraction = fraction + 100 - curr->fraction;
whole--;
}
else {
fraction -= curr->fraction;
}
}
/* This algorithm compares the an object of the same currency for equality or inequality
Pre: object (same currency)
Post:
Return: whole/fraction
*/
bool isEqual(const Currency& curr) {
return curr.whole == whole && curr.fraction == fraction;
}
/* This algorithm compares the an object of the same currency to determine which is greater or
smaller
Pre: object (same currency)
Post:
Return: true/false
*/
bool isGreater(const Currency& curr) {
if (whole < curr.whole)
return false;
if (whole == curr.whole && fraction < curr.fraction)
return false;
return true;
}
/* This algorithm prints the name and value of the currency object
Pre: value of whole, fraction, and the name
Post: whole, fraction, get_name()
Return:
*/
void print() {
std::cout << whole << "." << fraction << " " << get_name() << std::endl;
}
};
class Krone : public Currency {
protected:
/*
This algorithm gets the name for the Currency.
Pre: name - declared as string and initialized as Krone
Post:
Return: name
*/
std::string name = "Krone";
std::string get_name() {
return name;
}
public:
Krone() : Currency() { }
Krone(double value) : Currency(value) { }
Krone(Krone& curr) : Currency(curr) { }
};
class Soum : public Currency {
protected:
/* This algorithm gets the name for the Currency.
Pre: name - declared as string and initialized as Soum
Post:
Return: name
*/
std::string name = "Soum";
std::string get_name() {
return name;
}
public:
Soum() : Currency() { }
Soum(double value) : Currency(value) { }
Soum(Krone& curr) : Currency(curr) { }
};
A LinkNode structure or class which will have two attrib.
C++ help finish my code Phase 1 - input phase. Main reads the fi.pdf
C++ help finish my code
Phase 1 - input phase. Main reads the file and populates one Grocery element in the array for
each input
record. This is a standard .txt file and is delimited by new line (\n) characters at the end of every
input record.
This allows you to use getline. See the Canvas assignment and copy the file named a4data.txt to
your
machine. Do not change the name of the file it must be a4data.txt. Assume that the input will be
correct.
The input record format is:
6 characters - item UPC
20 characters - item description
6 characters - cost (999.99 format)
6 characters - selling price (999.99 format)
3 characters - inventory on hand
1 character - status (o on order; d discontinued; s on shelf)
Use correct read loop logic as discussed in class.
There is no constructor. The Grocery array is statically allocated, so if there was a constructor, it
would be
executed when the array was first defined, once per element.
The maximum number of grocery items is 100, and youll need a counter to keep track of how
many there
actually are. Define that counter as a static variable in the Grocery class, and use it throughout
your code as
needed.
At the end of phase 1, main has built a set of Grocery objects.
Next, main should display all the Grocery objects to ensure that the array has been built
correctly. Examine
the input data and determine if your code is processing all the records, and each record correctly.
Display
them after you have processed the input file; do not list each object as its created within the read
loop. Use
some appropriate column formatting so that you can make sense of the output, and so that you
can verify
that the objects have all been created and populated correctly. At this point, there is no price
history data,
that will be added in the next phase. Your display should look something like this:
=====================================================================
=
UPC Description Cost Price Inventory Status
=====================================================================
=
123456 Peas, canned, 12 oz 1.23 1.89 100 s
234567 Tomatoes, sundried 2.25 3.75 25 s
345676 Pineapple, whole 2.99 4.25 0 o
Phase 2 Transaction processing phase. Main asks the console user for transactions. Use getline;
do
not use some other form of input. There are four different types of transactions. Assume the
transaction data
is valid (no error checking needed). There are four types of transactions:
D
Display a list of all Grocery items, one item at a time, something like this:
=====================================================================
=
UPC Description Cost Price Inventory Status
=====================================================================
=
123456 Peas, canned, 12 oz 1.23 1.89 100 s
Price history: 2021-03-17 1.11
2021-04-17 1.45
2022-06-14 1.89
234567 Tomatoes, sundried 2.25 3.75 25 s
Price history: 2021-03-17 1.98
2021-04-17 2.25
345676 Pineapple, whole 2.99 4.25 0 o
Price history: there is no price history for this item.
Create a Queue class that implements a queue abstraction. A queue is.docx
Create a Queue class that implements a queue abstraction. A queue is a FIFO list (First In First Out queue). A simple example is waiting in line, where the first person in the line is the first served. New arrivals are added to the back of the line, the next person served is (removed) from the front of the line.
The Queue class needs to implement the following operations:
adding to the queue at one end (the tail)
removing from the queue at the other end (the head)
printing all items the queue (from head to tail)
erasing all items in the queue (leaving the queue empty).
destructor to empty the queue before it's destroyed (to release all memory)
Additions and removals always occur at the opposite ends of the queue.
You should create the following methods in your Queue class to implement the above operations
addItem
removeItem
print
erase
Your Queue class must implement a linked list. Linked lists are implemented using individual items which contain a pointer to the next item in the list, as well as the information to be stored.
Your Queue implementation uses a companion QueueItem class to represent each element in the list. A QueueItem contains character string as the data value, a unique (among all QueueItems in a Queue) integer item identifier, and a pointer to the next QueueItem in the list. The following is the definition for the QueueItem class.
class QueueItem {
public:
QueueItem(char *pData, int id); // ctor
void setNext(QueueItem *pItem);
QueueItem* getNext() const;
int getId() const;
const char* getData() const;
private:
char _data[30]; // or, use a char* if you want to dynamically alloc memory
const int _itemId; // unique id for item in queue
QueueItem* _pNext; // next item in queue
};
The QueueItem member functions are very basic, just setting or getting data members of the class. All the linked list manipulation is done by the Queue class member functions.
The Queue class member functions manipulate the linked list of QueueItem's, creating and destroying QueueItem objects as needed using the C++ new and delete operators. The Queue class member data includes a pointer to the head and and pointer to the tail of the linked list of QueueItems, and an integer item counter used to provide a unique item ID for every newly created QueueItem (incremented each time a new QueueItem is added, and passed as a parameter to the QueueItem constructor. It is never decremented).
The following is a partial example of the Queue class; you will need to fill in the remaining methods.
class Queue {
public:
Queue(); // ctor inits a new empty Queue
~Queue(); // dtor erases any remaining QueueItems
void addItem(char *pData);
void removeItem();
...
private:
QueueItem *_pHead; // always points to first QueueItem in .
Algorithms devised for a google interview
Google interviewer asked for an algorithm to extract the k smallest elements from a set of ordered arrays. I suggested a vectorised bucket sort and merge sort approach. I took the problem offline and produced this analysis and C++.
Part 1 - Written AnswersDownload the GridWriter.zip file and exami.pdf
Abstract methods could have been used in the GridItem class to make the code cleaner. Specifically, the getArea() method could have been declared as an abstract method since the actual implementation depends on the specific shape class. This would have enforced shape classes like MyCircle and MyRectangle to provide their own implementation of getArea() tailored to each shape's calculation of area.
Please solve the following problem using C++- Thank you Instructions-.docx
Please solve the following problem using C++. Thank you
Instructions: ----
A LinkNode structure or class which will have two attributes -
a data attribute, and
a pointer attribute to the next node.
The data attribute of the LinkNode should be a reference/pointer of the Currency class of Lab 2.
Do not make it an inner class or member structure to the SinglyLinkedList class of #2 below.
A SinglyLinkedList class which will be composed of three attributes -
a count attribute,
a LinkNode pointer/reference attribute named as and pointing to the start of the list and
a LinkNode pointer/reference attribute named as and pointing to the end of the list.
Since this is a class, make sure all these attributes are private.
The class and attribute names for the node and linked list are the words in bold in #1 and #2.
For the Linked List, implement the following linked-list behaviors as explained in class -
getters/setters/constructors/destructors, as needed, for the attributes of the class.
createList method in addition to the constructor - this is optional for overloading purposes.
destroyList method in place of or in addition to the destructor - this is optional for overloading purposes,
addCurrency method which takes a Currency object and a node index value as parameters to add the Currency to the list at that index.
removeCurrency method which takes a Currency object as parameter and removes that Currency object from the list and may return a copy of the Currency.
removeCurrency overload method which takes a node index as parameter and removes the Currency object at that index and may return a copy of the Currency.
findCurrency method which takes a Currency object as parameter and returns the node index at which the Currency is found in the list.
getCurrency method which takes an index values as a parameter and returns the Currency object.
printList method which returns a string of all the Currency objects in the list in the order of index, tab spaced.
isListEmpty method which returns if a list is empty or not.
countCurrency method which returns a count of Currency nodes in the list.
Any other methods you think would be useful in your program.
A Stack class derived from the SinglyLinkedList but with no additional attributes and the usual stack methods -
constructor and createStack (optional) methods,
push which takes a Currency object as parameter and adds it to the top of the stack.
pop which takes no parameter and removes and returns the Currency object from the top of the stack.
peek which takes no parameter and returns a copy of the Currency object at the top of the stack.
printStack method which returns a string signifying the contents of the stack from the top to bottom, tab spaced.
destructor and/or destroyStack (optional) methods.
Ensure that the Stack objects do not allow Linked List functions to be used on them.
A Queue class derived from the SinglyLinkedList but with no additional attributes and the usual queue methods -
constructor and creat.
An object of class StatCalc can be used to compute several simp.pdf
/*
An object of class StatCalc can be used to compute several simple statistics
for a set of numbers. Numbers are entered into the dataset using
the enter(double) method. Methods are provided to return the following
statistics for the set of numbers that have been entered: The number
of items, the sum of the items, the average, the standard deviation,
the maximum, and the minimum.
*/
public class Stats {
private int count; // Number of numbers that have been entered.
private double sum; // The sum of all the items that have been entered.
private double squareSum; // The sum of the squares of all the items.
private double max = Double.NEGATIVE_INFINITY; // Largest item seen.
private double min = Double.POSITIVE_INFINITY; // Smallest item seen.
int[] myList;
public int getCount() {
System.out.println(myList.size());
count = myList.size().
// Return number of items that have been entered.
return count;
}
public double getSum() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
return sum;
}
public double getMean() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
if(count > 0)
return sum / count;
else
return -1;
}
public double getMin() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return smallest;
}
public double getMax() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return largetst;
}
stats(int [] data)
{
if(data.count <= count)
{
if(myList.size() > 0)
System.arraycopy( myList, 0, data, 0, count );
}
}
stats()
{
Scanner s = new Scanner(System.in);
int count = s.nextInt();
s.nextLine(); // throw away the newline.
int [] numbers = new int[count];
Scanner numScanner = new Scanner(s.nextLine());
for (int i = 0; i < count; i++) {
if (numScanner.hasNextInt()) {
numbers[i] = numScanner.nextInt();
} else {
System.out.println(\"You didn\'t provide enough numbers\");
break;
}
}
System.arraycopy( myList, 0, numbers, 0, count );
}
stats(int size)
{
setValue(size);
}
private void setValue(int size)
{
count = size;
myList = new int[size];
}
} // end class StatCalc
public class SimpleStats {
public static void main(String[] args) {
Stat calc; // Computes stats for numbers entered by user.
calc = new Stat(100);
int arry[] = {20.20.40,30.80,,70,4,5,6,7,10}
calc.setvalue(array);
double item; // One number entered by the user.
TextIO.putln(\"Enter your numbers. Enter 0 to end.\");
TextIO.putln();
do {
TextIO.put(\"? \");
item = TextIO.getlnDouble();
if (item != 0)
calc.enter(item);
} while ( item != 0 );
TextIO.putln(\"\ Statistics about your calc:\ \");
TextIO.putln(\" Count: \" + calc.getCount());
TextIO.putln(\" Sum: \" + calc.getSum());
TextIO.putln(\" Minimum: \" + calc.getMin());
TextIO.putln(\" Maximum: \" + ca.
Write a program that mimics the operations of several vending machin.pdf
The document describes a program that simulates the operations of two vending machines - one for drinks and one for snacks. The program reads item data from text files, allows a user to select an item from a displayed menu, processes a purchase by checking funds and updating balances, and returns change or messages about insufficient funds or out of stock items. The document outlines the required classes and methods to implement this program, including Item, VendingMachine, and VendingMachineDriver classes.
Write ItemList.h and ItemList.cItemList is used to store a list .pdf
Write ItemList.h and ItemList.c
ItemList is used to store a list of Items by their item number. In ItemList.h, use typedef to
define the ItemList type which contains the following information:
ItemList:
int items[MAX_ITEM_LIST]; // the itemNumbers in the list
int count; // the number of items in the list
Make sure that MAX_ITEM_LIST is defined with a suitable size in your ItemList.h. Add the
following interface definitions to ItemList.h:
void ItemListInit(ItemList *pItemList);
Initializes the ItemList structure pointed to by pItemList as an empty list.
int ItemListAddItem(ItemList *pItemList, int itemNumber);
Adds item identified by itemNumber to the end of the list. Have the function
return the current count of items in the list.
int ItemListRemoveItem(ItemList *pItemList,
int itemNumber);
Removes item identified by itemNumber from the list. Have the function return
the current number of items in the list.
bool ItemListHasItem(ItemList *pItemList, int itemNumber);
Determines if the list pointed to by pItemList contains the item identified by
itemNumber.
Implement the above functions in the ItemList.c file. Use the provided main program to test
your implementation.
hello- please dont just copy from other answers- the following is the.docx
hello. please dont just copy from other answers, the following is the code that is already have and can u modified it for the following instructions.
instructions ----A LinkNode structure or class which will have two attributes -
a data attribute, and
a pointer attribute to the next node.
The data attribute of the LinkNode should be a reference/pointer of the Currency class of Lab 2.
Do not make it an inner class or member structure to the SinglyLinkedList class of #2 below.
A SinglyLinkedList class which will be composed of three attributes -
a count attribute,
a LinkNode pointer/reference attribute named as and pointing to the start of the list and
a LinkNode pointer/reference attribute named as and pointing to the end of the list.
Since this is a class, make sure all these attributes are private.
The class and attribute names for the node and linked list are the words in bold in #1 and #2.
For the Linked List, implement the following linked-list behaviors as explained in class -
getters/setters/constructors/destructors, as needed, for the attributes of the class.
createList method in addition to the constructor - this is optional for overloading purposes.
destroyList method in place of or in addition to the destructor - this is optional for overloading purposes,
addCurrency method which takes a Currency object and a node index value as parameters to add the Currency to the list at that index.
removeCurrency method which takes a Currency object as parameter and removes that Currency object from the list and may return a copy of the Currency.
removeCurrency overload method which takes a node index as parameter and removes the Currency object at that index and may return a copy of the Currency.
findCurrency method which takes a Currency object as parameter and returns the node index at which the Currency is found in the list.
getCurrency method which takes an index values as a parameter and returns the Currency object.
printList method which returns a string of all the Currency objects in the list in the order of index, tab spaced.
isListEmpty method which returns if a list is empty or not.
countCurrency method which returns a count of Currency nodes in the list.
Any other methods you think would be useful in your program.
A Stack class derived from the SinglyLinkedList but with no additional attributes and the usual stack methods -
constructor and createStack (optional) methods,
push which takes a Currency object as parameter and adds it to the top of the stack.
pop which takes no parameter and removes and returns the Currency object from the top of the stack.
peek which takes no parameter and returns a copy of the Currency object at the top of the stack.
printStack method which returns a string signifying the contents of the stack from the top to bottom, tab spaced.
destructor and/or destroyStack (optional) methods.
Ensure that the Stack objects do not allow Linked List functions to be used on them.
A Queue class derived from the SinglyLink.
Getting StartedCreate a class called Lab8. Use the same setup for .pdf
Getting Started
Create a class called Lab8. Use the same setup for setting up your class and main method as you
did for the previous assignments. Be sure to name your file Lab8.java. Additionally, make
another file called Arrays.java. This file will be an object, so simply start it off by declaring an
Arrays class. You can copy the following skeleton and fill in the appropriate code below each of
the comments:
public class Arrays {
/ Instance Variables
// Constructors
// findMin 1
// findMax
// calcSum
// calcAverage
// toString
}
Task Overview
Your task for this lab is to create a class called Arrays with some array processing methods. This
class will maintain an array and the number of elements present in it. Additionally, methods will
be available to display the current min and max elements along with the average of all of them.
Finally, a toString() method will be available to cleanly display all the array elements. Finally,
you will write a simple driver class to test out the above Arrays class.
Part 1: Instance Variables for Arrays
The first thing to do for the Arrays class is to set up its instance variables. Declare the following
(private) instance variables:
• An int array called array ? this will be the array we will be writing methods for.
• An int called count - this represents the number of valid elements in the array.
Part 2:
Constructors for Arrays The Arrays class will have two constructors. The first constructor takes
the maximum size of the array as input as a parameter and initializes the array instance variable
appropriately. It also sets count to size. Finally, it will initialize all of the array elements to some
values between 0 and 10, inclusive. To create this constructor, follow these steps:
• Import java.util.Random to make use of the random number generator.
• Create a constructor with the following header: public Arrays(int size)
• Initialize your array variable and set its size to size (see the chart on page 252 for reference on
initializing arrays). Be very careful that you are setting the value of your array instance variable,
as opposed to creating a new variable called array.
• Set the value of the count variable to size because we will be populating the entire array.
• Copy the following code to the constructor in order to generate random values between 0 and
10, inclusive:
Random rand = new Random();
for (int i = 0; i < count; i++)
{
array[i] = (rand.nextInt(10));
}
Next, create another constructor with the following header: public Arrays(int[] arr). This
constructor will initialize the class by using the passed arr argument in order to fill its instance
variables. The following things need to be done inside of this constructor:
• Set the array variable equal to arr.
• Set the count variable equal to the length of the array.
Part 3: Displaying the Output findMin()
The first method of this class will search the array for the minimum element. Copy the following
code for the findMin method. Note how the count i.
ASP.NET 08 - Data Binding And Representation
This document discusses different ways to represent and bind data in ASP.NET applications. It covers data binding controls to data sources, using .NET collections like ArrayList and Dictionary to store data, using generic collections, populating and using DataTable and DataSet objects to store and manipulate tabular data, and integrating data with XML.
5 array
This document discusses arrays in C/C++. It defines an array as a collection of identical data objects stored in consecutive memory locations under a common name. It describes array declaration syntax, initialization, single and multi-dimensional arrays, and provides examples of using arrays to find the largest number, sort numbers, and calculate a sum. It also covers pointers, pointer arithmetic, and passing arrays to functions by value and reference.
in c languageTo determine the maximum string length, we need to .pdf
in c language
To determine the maximum string length, we need to create a new callback function that utilizes
an alternative user data structure. This callback function should adhere to the same format as
demonstrated in the example.
The data provided to our callback consists of:
A node containing the node->data pointer, which will store our string.
A userdata argument, represented as (void *), capable of holding any desired content. We
possess complete control over the content at this pointer location, as it will be whatever value we
have passed. Consequently, we can:
Establish a structure to store any pertinent values we require.
Transmit the address of this structure into the function.
use this code and just add your code where it says TO DO
#include
#include
#include
#include
#include "LLGeneric.h"
/** define the maximum length of a line that we can read */
#defineLINE_BUFFER_SIZE1024
/**
* We can use this as our "user data" to help us calculate the maximum
* length string
*
* Add anything else to this structure that you wish
*/
struct maxData {
size_t maxLenSoFar;
char *maxStringSoFar;
};
/**
* our "user function" or "callback" for printing.
*
* We know what "void *userdata" is going to be because it is
* simply what we pass in at the call below, so it is safe to
* cast back to a FILE * as that is what we passed it.
*
* This is called a "callback" as it "call back into" our own
* code from within a generic routine.
*/
int myFindLongestStringNode(GenericListNode *node, int index, void *userdata)
{
/**
* Add more code here. You will need to:
* - convert the GenericListNode payload in the field "data" to your
* known (char *) type
* - conver the (void *) userdata into your known (struct maxData *)
* type
* - use the fact that you can examine and store the values provided
* through the userdata to see what has been calculated by earlier
* calls to this function and update based on what you see here,
* in order to determine what the longest string is in the whole
* set of nodes.
*/
return 1;
}
int
doListActivities(GenericListNode *list)
{
/** create an instance of our structure for use as the user data */
struct maxData maxDataWorkingStruct;
int nProcessed = 0;
/** initialize our structure -- if you added fields, set them up here */
maxDataWorkingStruct.maxLenSoFar = 0;
maxDataWorkingStruct.maxStringSoFar = NULL;
/**
* TO DO: Iterate using the callback, which should calculate what
* the longest string in the list is
*/
nProcessed = lstPerformIterativeAction(
list, /* pointer to the first list node */
myFindLongestStringNode, /* pointer to our function */
(void *) &maxDataWorkingStruct);
/** print out the result */
printf("The longest string has %ld characters\n",
maxDataWorkingStruct.maxLenSoFar);
printf("The longest string is: %s\n",
maxDataWorkingStruct.maxStringSoFar);
return nProcessed;
}
/**
**Tools provided below here you won't need to edit -- they
**simply process the command line, and load and free the
**generic linked list and the st.
Write a program that will test a name) method no sorting routine from.docx
The document describes a Java program that uses an ArrayList to test a selection sort algorithm. It prompts the user to enter a number, fills the ArrayList with that many randomly generated integers from 1 to 50, prints the original ArrayList, calls a selection sort method to sort the ArrayList, and prints the sorted ArrayList. The selection sort method uses nested for loops to find the minimum element in the unsorted section and swap it with the current element being considered.
Ds
1. A stack is a linear data structure that follows the LIFO (Last In First Out) principle, where the last item inserted is the first item removed. It allows insertion and removal of items from one end only.
2. Stacks have many applications including function calls, memory allocation, undo operations, and parsing expressions. They use push and pop operations to insert and remove items.
3. A queue is a linear data structure that follows the FIFO (First In First Out) principle, where the first item inserted is the first item removed. It allows insertion at one end (rear) and removal from the other (front). Queues are useful for scheduling processes.
Histograms: Pre-12c and now
Published in the Summer 2015 edition of Oracle Scene. Republished with permission of UK Oracle User Group.
Program Specifications in c++ Develop an inventory management system f.docx
Program Specifications in c++
Develop an inventory management system for an electronics store. The inventory system should have the following functionalities:
BuildInventory: read a text file containing electronics products information and dynamically store them in an array of pointers.
ShowInventory: display all inventory items.
UpdateInventory: ask for item id and quantity. If found display cost and update Product object info (reduce Product's quantity and potentially update restocking flag).
Terminate: save current inventory to a text file.
This programming assignment illustrates the following concepts:
Text file reading and writing.
Arrays of pointers and dynamic memory allocations with new and delete.
Inheritance.
C++ type casting: static_cast.
NOTE: This assignment is not about polymorphism or dynamic_cast! Your program should not contain any virtual function and/or use of dynamic_cast mechanism or point deductions will apply. You will have opportunity to use polymorphism in the next assignment.
Class Design
You need at least three classes.
class InventoryItem (minimum implementation specified below) - This is the base class.
Protected member data: item id (integer) and restocking (bool).
Public static data:
const integer (item id): initialize to 9999.
const bool (restocking): initialize to false.
Constructors
Default constructor: initialize item id and restocking using the default static data with member initializer syntax.
Non-default constructor: take 2 parameters.
Destructor: output "InventoryItem <item id> with <true/false> restocking destroyed ..."
Public member functions:
mutator/accessor for restocking, item id.
Display : to show InventoryItem item id and restocking (true/false). item id must be displayed as a 4-digit integer with leading 0s if < 1000.
class Product : derived from InventoryItem class (minimum implementation specified below).
Private member data: name (string), quantity (integer) and price (double).
Public static data:
const string (name): "No Product".
const int (quantity): 0
const double (price): 0.99
Constructors (use member initializer syntax)
Default constructor: set member data to static data's default values above. Must explicitly invoke the base class' default constructor.
Non-default constructor: take five parameters (id, restocking, name, quantity and price). Must explicitly invoke the base class' non-default constructor.
Destructor: output "Product: <item id>, Name<name>, quantity<quantity>, price <price>, restocking<true/false> destroyed ...".
Public member functions:
accessors/mutators for name, quantity, price.
Display: invoke Display from base class, then display its own data. NOTE: If the product restocking is true somehow indicate it using "special effects" such as ***** or whatever effect you'd like.
Cost : take an integer as its only parameter representing the quantity (how many product to be sold) and return the total cost (price * quantity parameter).
class InventorySystem: (minimum implement.
Program Specifications in c++ Develop an inventory management syste.docx
Program Specifications in c++
Develop an inventory management system for an electronics store. The inventory system should have the following functionalities:
BuildInventory: read a text file containing electronics products information and dynamically store them in an array of pointers.
ShowInventory: display all inventory items.
UpdateInventory: ask for item id and quantity. If found display cost and update Product object info (reduce Product's quantity and potentially update restocking flag).
Terminate: save current inventory to a text file.
This programming assignment illustrates the following concepts:
Text file reading and writing.
Arrays of pointers and dynamic memory allocations with new and delete.
Inheritance.
C++ type casting: static_cast.
NOTE: This assignment is not about polymorphism or dynamic_cast! Your program should not contain any virtual function and/or use of dynamic_cast mechanism or point deductions will apply. You will have opportunity to use polymorphism in the next assignment.
Class Design
You need at least three classes.
class InventoryItem (minimum implementation specified below) - This is the base class.
Protected member data: item id (integer) and restocking (bool).
Public static data:
const integer (item id): initialize to 9999.
const bool (restocking): initialize to false.
Constructors
Default constructor: initialize item id and restocking using the default static data with member initializer syntax.
Non-default constructor: take 2 parameters.
Destructor: output "InventoryItem <item id> with <true/false> restocking destroyed ..."
Public member functions:
mutator/accessor for restocking, item id.
Display : to show InventoryItem item id and restocking (true/false). item id must be displayed as a 4-digit integer with leading 0s if < 1000.
class Product : derived from InventoryItem class (minimum implementation specified below).
Private member data: name (string), quantity (integer) and price (double).
Public static data:
const string (name): "No Product".
const int (quantity): 0
const double (price): 0.99
Constructors (use member initializer syntax)
Default constructor: set member data to static data's default values above. Must explicitly invoke the base class' default constructor.
Non-default constructor: take five parameters (id, restocking, name, quantity and price). Must explicitly invoke the base class' non-default constructor.
Destructor: output "Product: <item id>, Name<name>, quantity<quantity>, price <price>, restocking<true/false> destroyed ...".
Public member functions:
accessors/mutators for name, quantity, price.
Display: invoke Display from base class, then display its own data. NOTE: If the product restocking is true somehow indicate it using "special effects" such as ***** or whatever effect you'd like.
Cost : take an integer as its only parameter representing the quantity (how many product to be sold) and return the total cost (price * quantity parameter).
class InventorySystem: (minimum implement.
C++ - UNIT_-_IV.pptx which contains details about Pointers
Pointer is a variable in C++ that holds the address of another variable. Pointers allow accessing the memory location of other variables. There are different types of pointers based on the data type they are pointing to such as integer, character, class etc. Pointers are declared using an asterisk * before the pointer variable name. The address of a variable can be assigned to a pointer using the & address of operator. Pointers can be used to access members of a class and pass arrays to functions. The this pointer represents the address of the object inside member functions. Virtual functions allow dynamic binding at runtime in inheritance.
C++ help finish my code Topics class definitions, arrays of objec.pdf
C++ help finish my code
Topics: class definitions, arrays of objects, static variables, friends, public member functions,
class
composition, transaction processing
Overview: Develop code that reads a supplied input file and populates a set of Grocery objects.
Once the
input process is complete, the code reads user transactions from the console to query and report
on the
grocery items in several ways.
Data structures: Grocery items are stored in a static array of 100 Grocery objects. Your code
reads a file, one
record per grocery item, and builds the array. You dont know in advance how many Grocery
items there will
be. Each Grocery item may have had multiple selling prices during its lifetime. The selling
prices are recorded
in an array of PriceHistory objects contained in each Grocery object. The price histories are
added by the user
after the initial data has been read. The number of price histories per item could vary, from
none, up to 25.
Class definitions
Create a class, called Grocery, that defines a Grocery item.
Members:
UPC - int
description - string
cost - float
selling price - float
inventory - int
status - char
price history - array of 25 PriceHistory objects
number of used history elements - int
Public member functions:
as needed
Static members:
number of Grocery items - int
Create a class, called PriceHistory, that defines a price that was used for a grocery item.
Private members:
date - date price went into effect. YYYY-MM-DD format.
historical price - float
Your main routine has two parts.
Phase 1 - input phase. Main reads the file and populates one Grocery element in the array for
each input
record. This is a standard .txt file and is delimited by new line (\n) characters at the end of every
input record.
This allows you to use getline. See the Canvas assignment and copy the file named a4data.txt to
your
machine. Do not change the name of the file it must be a4data.txt. Assume that the input will be
correct.
The input record format is:
6 characters - item UPC
20 characters - item description
6 characters - cost (999.99 format)
6 characters - selling price (999.99 format)
3 characters - inventory on hand
1 character - status (o on order; d discontinued; s on shelf)
Use correct read loop logic as discussed in class.
There is no constructor. The Grocery array is statically allocated, so if there was a constructor, it
would be
executed when the array was first defined, once per element.
The maximum number of grocery items is 100, and youll need a counter to keep track of how
many there
actually are. Define that counter as a static variable in the Grocery class, and use it throughout
your code as
needed.
At the end of phase 1, main has built a set of Grocery objects.
Next, main should display all the Grocery objects to ensure that the array has been built
correctly. Examine
the input data and determine if your code is processing all the records, and each record correctly.
Display
them after you have processed the input file; do not.
please help implement the following in C. below are instructions and.pdf
please help implement the following in C. below are instructions and partial code below that,
step one is completed in the image.
double getMean(const int *arr, int size) {
//TODO: implement
}
int getMin(const int *arr, int size) {
//TODO: implement
}
int getIndexOfMin(const int *arr, int size) {
//TODO: implement
}
int getMax(const int *arr, int size) {
//TODO: implement
}
int getIndexOfMax(const int *arr, int size) {
//TODO: implement
}
int * filterThreshold(const int *arr, int size, int threshold, int *resultSize) {
//TODO: implement
}
int **createMultiplicationTable(int n, int m) {
//TODO: implement
}
1. Write documentation in the array_util.h file in your own words so you have an understanding
of what it does. 2. Implement the function in the array_util.c file. 3. Test your function in the
arrayMain.c file to verify it works. Look for ways to make your life easier: some functions may
be able to utilize others. - double getMean(const int *arr, int size) - computes the average of
elements in arr - int getmin (const int *arr, int size) - returns the minimum element in arr - int
getindexofmin(const int *arr, int size) - returns the index of the the minimum element in arr - int
getmax(const int *arr, int size) - returns the maximum element in arr - int getIndexofmax (const
int *arr, int size) - returns the index of the the maximum element in arr - int *
filterthreshold(const int *arr, int size, int threshold, int *resultsize) - creates and returns a new
array that contains elements in arr that are greater than or equal to threshold. The size of the
returned array is communicated through the pass-by-reference variable, resultSize. For example,
if we pass the array [10,5,32,8,7, 28,15,12] with threshold =10 then the returned array should be
[10,32,28,15,12] and the resultSize would be set to 5 . - int **createMultiplicationTable (int n,
int m ) - creates and returns a new (nx m) 2-D array that contains the values in a multiplication
table. For example, if n=3,m= 5 then the result should look like:.
I received answers to 2 App requests and paid. The JAVA Apps are not.docx
I received answers to 2 App requests and paid. The JAVA Apps are not working. They are both due at noon tomorrow Eastern time.I need serious and no-BS tutor that can have this working tonight since I have to get them in. I paid 40 to get this far and would pay another $50 to get the work completed and working. I want to see the output from the netbeans IDE directly.
Ticket
import java.util.Date;
public class Ticket {
/** Ticket number */
private long number;
/** Category of Ticket */
private String category;
/**Ticket Holder*/
private String holder;
/** Purchase date */
private Date date;
/** Ticket Price */
private double price;
private boolean status;
/***
*
* @param num
* @param cat
* @param hold
* @param d
* @param p
* @param newstatus
*/
Ticket (String num, String cat,String hold, Date d, double p, boolean newstatus){
number =Long.parseLong(num);
category =cat;
holder =hold;
date =d;
price=p;
status =newstatus;
}
/**
* @return the number
*/
public long getNumber() {
return number;
}
/**
* @return the category
*/
public String getCategory() {
return category;
}
/**
* @return the date
*/
public Date getDate() {
return date;
}
/**
* @param price
* the price to set
*/
public void setPrice(double price) {
this.price = price;
}
/**
* @return the price
*/
public double getPrice() {
return price;
}
/***
*
* @return
*/
public void changePurchaseStatus(boolean newStatus) {
status= newStatus;
}
/***
*
*/
public String toString() {
return "Ticket Number: "+number +"\nCategory: "+category +"\nHolder: "+holder+"\nDate: "+date.toString()+"\nPrice: "+price+"\n";
}
/**
* @return the holder
*/
public String getHolder() {
return holder;
}
}
Merchandise
import java.util.Scanner;
public class Merchandise {
private long id;
private String category;
private String description;
private double price;
private boolean instock;
public Merchandise() {
this.id = 0;
this.category = null;
this.description = null;
this.price = 0;
this.instock=true;
}
public Merchandise(long nid, String nCate, String nDesc, double nPri, boolean instck) {
this.id = nid;
this.category = nCate;
this.description = nDesc;
this.price = nPri;
this.instock=instck;
}
public void setPrice(Double newPrice) {
this.price = newPrice;
}
public void setStock(boolean newStatus) {
this.instock= newStatus;
}
public long getId() {
return id;
}
public String getCategory() {
S.
1- What is the evidence that all life on 1- What is a mutation- and wh.docx
1. What is the evidence that all life on 1. What is a mutation, and what Barth has a common origin? determines whether it contributes to evolutionary change? 2. How did photosynthesis make life on land possible? 2. What are two possible explanations for why very similar genes can be found in 3. What is the relationship between a bacteria and plants? population and an ecosystem? 3. Explain the molecular genetios meaning of transcription and translation.
.
1- What is the definition of money- a- Anything made of gold b- Anythi.docx
1. What is the definition of money? a. Anything made of gold b. Anything that is generally accepted and used as a medium of payment c. Only those things declared money by the government d. Any good or service that is traded for another good or service 2. Which of the following have not served as money in the past? a. seashells b. copper c. grain d. paper e. all of these have served as money in the past 3. Which one of these is not a function of money? a. medium of exchange b. a measure of value c. a store of value d. a status symbol
.
More Related Content
Similar to 1- GivenaclassnamedTicketDB- whichwillbeusedtoprovidetheresponsibility.docx
Algorithms devised for a google interview
Google interviewer asked for an algorithm to extract the k smallest elements from a set of ordered arrays. I suggested a vectorised bucket sort and merge sort approach. I took the problem offline and produced this analysis and C++.
Part 1 - Written AnswersDownload the GridWriter.zip file and exami.pdf
Abstract methods could have been used in the GridItem class to make the code cleaner. Specifically, the getArea() method could have been declared as an abstract method since the actual implementation depends on the specific shape class. This would have enforced shape classes like MyCircle and MyRectangle to provide their own implementation of getArea() tailored to each shape's calculation of area.
Please solve the following problem using C++- Thank you Instructions-.docx
Please solve the following problem using C++. Thank you
Instructions: ----
A LinkNode structure or class which will have two attributes -
a data attribute, and
a pointer attribute to the next node.
The data attribute of the LinkNode should be a reference/pointer of the Currency class of Lab 2.
Do not make it an inner class or member structure to the SinglyLinkedList class of #2 below.
A SinglyLinkedList class which will be composed of three attributes -
a count attribute,
a LinkNode pointer/reference attribute named as and pointing to the start of the list and
a LinkNode pointer/reference attribute named as and pointing to the end of the list.
Since this is a class, make sure all these attributes are private.
The class and attribute names for the node and linked list are the words in bold in #1 and #2.
For the Linked List, implement the following linked-list behaviors as explained in class -
getters/setters/constructors/destructors, as needed, for the attributes of the class.
createList method in addition to the constructor - this is optional for overloading purposes.
destroyList method in place of or in addition to the destructor - this is optional for overloading purposes,
addCurrency method which takes a Currency object and a node index value as parameters to add the Currency to the list at that index.
removeCurrency method which takes a Currency object as parameter and removes that Currency object from the list and may return a copy of the Currency.
removeCurrency overload method which takes a node index as parameter and removes the Currency object at that index and may return a copy of the Currency.
findCurrency method which takes a Currency object as parameter and returns the node index at which the Currency is found in the list.
getCurrency method which takes an index values as a parameter and returns the Currency object.
printList method which returns a string of all the Currency objects in the list in the order of index, tab spaced.
isListEmpty method which returns if a list is empty or not.
countCurrency method which returns a count of Currency nodes in the list.
Any other methods you think would be useful in your program.
A Stack class derived from the SinglyLinkedList but with no additional attributes and the usual stack methods -
constructor and createStack (optional) methods,
push which takes a Currency object as parameter and adds it to the top of the stack.
pop which takes no parameter and removes and returns the Currency object from the top of the stack.
peek which takes no parameter and returns a copy of the Currency object at the top of the stack.
printStack method which returns a string signifying the contents of the stack from the top to bottom, tab spaced.
destructor and/or destroyStack (optional) methods.
Ensure that the Stack objects do not allow Linked List functions to be used on them.
A Queue class derived from the SinglyLinkedList but with no additional attributes and the usual queue methods -
constructor and creat.
An object of class StatCalc can be used to compute several simp.pdf
/*
An object of class StatCalc can be used to compute several simple statistics
for a set of numbers. Numbers are entered into the dataset using
the enter(double) method. Methods are provided to return the following
statistics for the set of numbers that have been entered: The number
of items, the sum of the items, the average, the standard deviation,
the maximum, and the minimum.
*/
public class Stats {
private int count; // Number of numbers that have been entered.
private double sum; // The sum of all the items that have been entered.
private double squareSum; // The sum of the squares of all the items.
private double max = Double.NEGATIVE_INFINITY; // Largest item seen.
private double min = Double.POSITIVE_INFINITY; // Smallest item seen.
int[] myList;
public int getCount() {
System.out.println(myList.size());
count = myList.size().
// Return number of items that have been entered.
return count;
}
public double getSum() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
return sum;
}
public double getMean() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
if(count > 0)
return sum / count;
else
return -1;
}
public double getMin() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return smallest;
}
public double getMax() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return largetst;
}
stats(int [] data)
{
if(data.count <= count)
{
if(myList.size() > 0)
System.arraycopy( myList, 0, data, 0, count );
}
}
stats()
{
Scanner s = new Scanner(System.in);
int count = s.nextInt();
s.nextLine(); // throw away the newline.
int [] numbers = new int[count];
Scanner numScanner = new Scanner(s.nextLine());
for (int i = 0; i < count; i++) {
if (numScanner.hasNextInt()) {
numbers[i] = numScanner.nextInt();
} else {
System.out.println(\"You didn\'t provide enough numbers\");
break;
}
}
System.arraycopy( myList, 0, numbers, 0, count );
}
stats(int size)
{
setValue(size);
}
private void setValue(int size)
{
count = size;
myList = new int[size];
}
} // end class StatCalc
public class SimpleStats {
public static void main(String[] args) {
Stat calc; // Computes stats for numbers entered by user.
calc = new Stat(100);
int arry[] = {20.20.40,30.80,,70,4,5,6,7,10}
calc.setvalue(array);
double item; // One number entered by the user.
TextIO.putln(\"Enter your numbers. Enter 0 to end.\");
TextIO.putln();
do {
TextIO.put(\"? \");
item = TextIO.getlnDouble();
if (item != 0)
calc.enter(item);
} while ( item != 0 );
TextIO.putln(\"\ Statistics about your calc:\ \");
TextIO.putln(\" Count: \" + calc.getCount());
TextIO.putln(\" Sum: \" + calc.getSum());
TextIO.putln(\" Minimum: \" + calc.getMin());
TextIO.putln(\" Maximum: \" + ca.
Write a program that mimics the operations of several vending machin.pdf
The document describes a program that simulates the operations of two vending machines - one for drinks and one for snacks. The program reads item data from text files, allows a user to select an item from a displayed menu, processes a purchase by checking funds and updating balances, and returns change or messages about insufficient funds or out of stock items. The document outlines the required classes and methods to implement this program, including Item, VendingMachine, and VendingMachineDriver classes.
Write ItemList.h and ItemList.cItemList is used to store a list .pdf
Write ItemList.h and ItemList.c
ItemList is used to store a list of Items by their item number. In ItemList.h, use typedef to
define the ItemList type which contains the following information:
ItemList:
int items[MAX_ITEM_LIST]; // the itemNumbers in the list
int count; // the number of items in the list
Make sure that MAX_ITEM_LIST is defined with a suitable size in your ItemList.h. Add the
following interface definitions to ItemList.h:
void ItemListInit(ItemList *pItemList);
Initializes the ItemList structure pointed to by pItemList as an empty list.
int ItemListAddItem(ItemList *pItemList, int itemNumber);
Adds item identified by itemNumber to the end of the list. Have the function
return the current count of items in the list.
int ItemListRemoveItem(ItemList *pItemList,
int itemNumber);
Removes item identified by itemNumber from the list. Have the function return
the current number of items in the list.
bool ItemListHasItem(ItemList *pItemList, int itemNumber);
Determines if the list pointed to by pItemList contains the item identified by
itemNumber.
Implement the above functions in the ItemList.c file. Use the provided main program to test
your implementation.
hello- please dont just copy from other answers- the following is the.docx
hello. please dont just copy from other answers, the following is the code that is already have and can u modified it for the following instructions.
instructions ----A LinkNode structure or class which will have two attributes -
a data attribute, and
a pointer attribute to the next node.
The data attribute of the LinkNode should be a reference/pointer of the Currency class of Lab 2.
Do not make it an inner class or member structure to the SinglyLinkedList class of #2 below.
A SinglyLinkedList class which will be composed of three attributes -
a count attribute,
a LinkNode pointer/reference attribute named as and pointing to the start of the list and
a LinkNode pointer/reference attribute named as and pointing to the end of the list.
Since this is a class, make sure all these attributes are private.
The class and attribute names for the node and linked list are the words in bold in #1 and #2.
For the Linked List, implement the following linked-list behaviors as explained in class -
getters/setters/constructors/destructors, as needed, for the attributes of the class.
createList method in addition to the constructor - this is optional for overloading purposes.
destroyList method in place of or in addition to the destructor - this is optional for overloading purposes,
addCurrency method which takes a Currency object and a node index value as parameters to add the Currency to the list at that index.
removeCurrency method which takes a Currency object as parameter and removes that Currency object from the list and may return a copy of the Currency.
removeCurrency overload method which takes a node index as parameter and removes the Currency object at that index and may return a copy of the Currency.
findCurrency method which takes a Currency object as parameter and returns the node index at which the Currency is found in the list.
getCurrency method which takes an index values as a parameter and returns the Currency object.
printList method which returns a string of all the Currency objects in the list in the order of index, tab spaced.
isListEmpty method which returns if a list is empty or not.
countCurrency method which returns a count of Currency nodes in the list.
Any other methods you think would be useful in your program.
A Stack class derived from the SinglyLinkedList but with no additional attributes and the usual stack methods -
constructor and createStack (optional) methods,
push which takes a Currency object as parameter and adds it to the top of the stack.
pop which takes no parameter and removes and returns the Currency object from the top of the stack.
peek which takes no parameter and returns a copy of the Currency object at the top of the stack.
printStack method which returns a string signifying the contents of the stack from the top to bottom, tab spaced.
destructor and/or destroyStack (optional) methods.
Ensure that the Stack objects do not allow Linked List functions to be used on them.
A Queue class derived from the SinglyLink.
Getting StartedCreate a class called Lab8. Use the same setup for .pdf
Getting Started
Create a class called Lab8. Use the same setup for setting up your class and main method as you
did for the previous assignments. Be sure to name your file Lab8.java. Additionally, make
another file called Arrays.java. This file will be an object, so simply start it off by declaring an
Arrays class. You can copy the following skeleton and fill in the appropriate code below each of
the comments:
public class Arrays {
/ Instance Variables
// Constructors
// findMin 1
// findMax
// calcSum
// calcAverage
// toString
}
Task Overview
Your task for this lab is to create a class called Arrays with some array processing methods. This
class will maintain an array and the number of elements present in it. Additionally, methods will
be available to display the current min and max elements along with the average of all of them.
Finally, a toString() method will be available to cleanly display all the array elements. Finally,
you will write a simple driver class to test out the above Arrays class.
Part 1: Instance Variables for Arrays
The first thing to do for the Arrays class is to set up its instance variables. Declare the following
(private) instance variables:
• An int array called array ? this will be the array we will be writing methods for.
• An int called count - this represents the number of valid elements in the array.
Part 2:
Constructors for Arrays The Arrays class will have two constructors. The first constructor takes
the maximum size of the array as input as a parameter and initializes the array instance variable
appropriately. It also sets count to size. Finally, it will initialize all of the array elements to some
values between 0 and 10, inclusive. To create this constructor, follow these steps:
• Import java.util.Random to make use of the random number generator.
• Create a constructor with the following header: public Arrays(int size)
• Initialize your array variable and set its size to size (see the chart on page 252 for reference on
initializing arrays). Be very careful that you are setting the value of your array instance variable,
as opposed to creating a new variable called array.
• Set the value of the count variable to size because we will be populating the entire array.
• Copy the following code to the constructor in order to generate random values between 0 and
10, inclusive:
Random rand = new Random();
for (int i = 0; i < count; i++)
{
array[i] = (rand.nextInt(10));
}
Next, create another constructor with the following header: public Arrays(int[] arr). This
constructor will initialize the class by using the passed arr argument in order to fill its instance
variables. The following things need to be done inside of this constructor:
• Set the array variable equal to arr.
• Set the count variable equal to the length of the array.
Part 3: Displaying the Output findMin()
The first method of this class will search the array for the minimum element. Copy the following
code for the findMin method. Note how the count i.
ASP.NET 08 - Data Binding And Representation
This document discusses different ways to represent and bind data in ASP.NET applications. It covers data binding controls to data sources, using .NET collections like ArrayList and Dictionary to store data, using generic collections, populating and using DataTable and DataSet objects to store and manipulate tabular data, and integrating data with XML.
5 array
This document discusses arrays in C/C++. It defines an array as a collection of identical data objects stored in consecutive memory locations under a common name. It describes array declaration syntax, initialization, single and multi-dimensional arrays, and provides examples of using arrays to find the largest number, sort numbers, and calculate a sum. It also covers pointers, pointer arithmetic, and passing arrays to functions by value and reference.
in c languageTo determine the maximum string length, we need to .pdf
in c language
To determine the maximum string length, we need to create a new callback function that utilizes
an alternative user data structure. This callback function should adhere to the same format as
demonstrated in the example.
The data provided to our callback consists of:
A node containing the node->data pointer, which will store our string.
A userdata argument, represented as (void *), capable of holding any desired content. We
possess complete control over the content at this pointer location, as it will be whatever value we
have passed. Consequently, we can:
Establish a structure to store any pertinent values we require.
Transmit the address of this structure into the function.
use this code and just add your code where it says TO DO
#include
#include
#include
#include
#include "LLGeneric.h"
/** define the maximum length of a line that we can read */
#defineLINE_BUFFER_SIZE1024
/**
* We can use this as our "user data" to help us calculate the maximum
* length string
*
* Add anything else to this structure that you wish
*/
struct maxData {
size_t maxLenSoFar;
char *maxStringSoFar;
};
/**
* our "user function" or "callback" for printing.
*
* We know what "void *userdata" is going to be because it is
* simply what we pass in at the call below, so it is safe to
* cast back to a FILE * as that is what we passed it.
*
* This is called a "callback" as it "call back into" our own
* code from within a generic routine.
*/
int myFindLongestStringNode(GenericListNode *node, int index, void *userdata)
{
/**
* Add more code here. You will need to:
* - convert the GenericListNode payload in the field "data" to your
* known (char *) type
* - conver the (void *) userdata into your known (struct maxData *)
* type
* - use the fact that you can examine and store the values provided
* through the userdata to see what has been calculated by earlier
* calls to this function and update based on what you see here,
* in order to determine what the longest string is in the whole
* set of nodes.
*/
return 1;
}
int
doListActivities(GenericListNode *list)
{
/** create an instance of our structure for use as the user data */
struct maxData maxDataWorkingStruct;
int nProcessed = 0;
/** initialize our structure -- if you added fields, set them up here */
maxDataWorkingStruct.maxLenSoFar = 0;
maxDataWorkingStruct.maxStringSoFar = NULL;
/**
* TO DO: Iterate using the callback, which should calculate what
* the longest string in the list is
*/
nProcessed = lstPerformIterativeAction(
list, /* pointer to the first list node */
myFindLongestStringNode, /* pointer to our function */
(void *) &maxDataWorkingStruct);
/** print out the result */
printf("The longest string has %ld characters\n",
maxDataWorkingStruct.maxLenSoFar);
printf("The longest string is: %s\n",
maxDataWorkingStruct.maxStringSoFar);
return nProcessed;
}
/**
**Tools provided below here you won't need to edit -- they
**simply process the command line, and load and free the
**generic linked list and the st.
Write a program that will test a name) method no sorting routine from.docx
The document describes a Java program that uses an ArrayList to test a selection sort algorithm. It prompts the user to enter a number, fills the ArrayList with that many randomly generated integers from 1 to 50, prints the original ArrayList, calls a selection sort method to sort the ArrayList, and prints the sorted ArrayList. The selection sort method uses nested for loops to find the minimum element in the unsorted section and swap it with the current element being considered.
Ds
1. A stack is a linear data structure that follows the LIFO (Last In First Out) principle, where the last item inserted is the first item removed. It allows insertion and removal of items from one end only.
2. Stacks have many applications including function calls, memory allocation, undo operations, and parsing expressions. They use push and pop operations to insert and remove items.
3. A queue is a linear data structure that follows the FIFO (First In First Out) principle, where the first item inserted is the first item removed. It allows insertion at one end (rear) and removal from the other (front). Queues are useful for scheduling processes.
Histograms: Pre-12c and now
Published in the Summer 2015 edition of Oracle Scene. Republished with permission of UK Oracle User Group.
Program Specifications in c++ Develop an inventory management system f.docx
Program Specifications in c++
Develop an inventory management system for an electronics store. The inventory system should have the following functionalities:
BuildInventory: read a text file containing electronics products information and dynamically store them in an array of pointers.
ShowInventory: display all inventory items.
UpdateInventory: ask for item id and quantity. If found display cost and update Product object info (reduce Product's quantity and potentially update restocking flag).
Terminate: save current inventory to a text file.
This programming assignment illustrates the following concepts:
Text file reading and writing.
Arrays of pointers and dynamic memory allocations with new and delete.
Inheritance.
C++ type casting: static_cast.
NOTE: This assignment is not about polymorphism or dynamic_cast! Your program should not contain any virtual function and/or use of dynamic_cast mechanism or point deductions will apply. You will have opportunity to use polymorphism in the next assignment.
Class Design
You need at least three classes.
class InventoryItem (minimum implementation specified below) - This is the base class.
Protected member data: item id (integer) and restocking (bool).
Public static data:
const integer (item id): initialize to 9999.
const bool (restocking): initialize to false.
Constructors
Default constructor: initialize item id and restocking using the default static data with member initializer syntax.
Non-default constructor: take 2 parameters.
Destructor: output "InventoryItem <item id> with <true/false> restocking destroyed ..."
Public member functions:
mutator/accessor for restocking, item id.
Display : to show InventoryItem item id and restocking (true/false). item id must be displayed as a 4-digit integer with leading 0s if < 1000.
class Product : derived from InventoryItem class (minimum implementation specified below).
Private member data: name (string), quantity (integer) and price (double).
Public static data:
const string (name): "No Product".
const int (quantity): 0
const double (price): 0.99
Constructors (use member initializer syntax)
Default constructor: set member data to static data's default values above. Must explicitly invoke the base class' default constructor.
Non-default constructor: take five parameters (id, restocking, name, quantity and price). Must explicitly invoke the base class' non-default constructor.
Destructor: output "Product: <item id>, Name<name>, quantity<quantity>, price <price>, restocking<true/false> destroyed ...".
Public member functions:
accessors/mutators for name, quantity, price.
Display: invoke Display from base class, then display its own data. NOTE: If the product restocking is true somehow indicate it using "special effects" such as ***** or whatever effect you'd like.
Cost : take an integer as its only parameter representing the quantity (how many product to be sold) and return the total cost (price * quantity parameter).
class InventorySystem: (minimum implement.
Program Specifications in c++ Develop an inventory management syste.docx
Program Specifications in c++
Develop an inventory management system for an electronics store. The inventory system should have the following functionalities:
BuildInventory: read a text file containing electronics products information and dynamically store them in an array of pointers.
ShowInventory: display all inventory items.
UpdateInventory: ask for item id and quantity. If found display cost and update Product object info (reduce Product's quantity and potentially update restocking flag).
Terminate: save current inventory to a text file.
This programming assignment illustrates the following concepts:
Text file reading and writing.
Arrays of pointers and dynamic memory allocations with new and delete.
Inheritance.
C++ type casting: static_cast.
NOTE: This assignment is not about polymorphism or dynamic_cast! Your program should not contain any virtual function and/or use of dynamic_cast mechanism or point deductions will apply. You will have opportunity to use polymorphism in the next assignment.
Class Design
You need at least three classes.
class InventoryItem (minimum implementation specified below) - This is the base class.
Protected member data: item id (integer) and restocking (bool).
Public static data:
const integer (item id): initialize to 9999.
const bool (restocking): initialize to false.
Constructors
Default constructor: initialize item id and restocking using the default static data with member initializer syntax.
Non-default constructor: take 2 parameters.
Destructor: output "InventoryItem <item id> with <true/false> restocking destroyed ..."
Public member functions:
mutator/accessor for restocking, item id.
Display : to show InventoryItem item id and restocking (true/false). item id must be displayed as a 4-digit integer with leading 0s if < 1000.
class Product : derived from InventoryItem class (minimum implementation specified below).
Private member data: name (string), quantity (integer) and price (double).
Public static data:
const string (name): "No Product".
const int (quantity): 0
const double (price): 0.99
Constructors (use member initializer syntax)
Default constructor: set member data to static data's default values above. Must explicitly invoke the base class' default constructor.
Non-default constructor: take five parameters (id, restocking, name, quantity and price). Must explicitly invoke the base class' non-default constructor.
Destructor: output "Product: <item id>, Name<name>, quantity<quantity>, price <price>, restocking<true/false> destroyed ...".
Public member functions:
accessors/mutators for name, quantity, price.
Display: invoke Display from base class, then display its own data. NOTE: If the product restocking is true somehow indicate it using "special effects" such as ***** or whatever effect you'd like.
Cost : take an integer as its only parameter representing the quantity (how many product to be sold) and return the total cost (price * quantity parameter).
class InventorySystem: (minimum implement.
C++ - UNIT_-_IV.pptx which contains details about Pointers
Pointer is a variable in C++ that holds the address of another variable. Pointers allow accessing the memory location of other variables. There are different types of pointers based on the data type they are pointing to such as integer, character, class etc. Pointers are declared using an asterisk * before the pointer variable name. The address of a variable can be assigned to a pointer using the & address of operator. Pointers can be used to access members of a class and pass arrays to functions. The this pointer represents the address of the object inside member functions. Virtual functions allow dynamic binding at runtime in inheritance.
C++ help finish my code Topics class definitions, arrays of objec.pdf
C++ help finish my code
Topics: class definitions, arrays of objects, static variables, friends, public member functions,
class
composition, transaction processing
Overview: Develop code that reads a supplied input file and populates a set of Grocery objects.
Once the
input process is complete, the code reads user transactions from the console to query and report
on the
grocery items in several ways.
Data structures: Grocery items are stored in a static array of 100 Grocery objects. Your code
reads a file, one
record per grocery item, and builds the array. You dont know in advance how many Grocery
items there will
be. Each Grocery item may have had multiple selling prices during its lifetime. The selling
prices are recorded
in an array of PriceHistory objects contained in each Grocery object. The price histories are
added by the user
after the initial data has been read. The number of price histories per item could vary, from
none, up to 25.
Class definitions
Create a class, called Grocery, that defines a Grocery item.
Members:
UPC - int
description - string
cost - float
selling price - float
inventory - int
status - char
price history - array of 25 PriceHistory objects
number of used history elements - int
Public member functions:
as needed
Static members:
number of Grocery items - int
Create a class, called PriceHistory, that defines a price that was used for a grocery item.
Private members:
date - date price went into effect. YYYY-MM-DD format.
historical price - float
Your main routine has two parts.
Phase 1 - input phase. Main reads the file and populates one Grocery element in the array for
each input
record. This is a standard .txt file and is delimited by new line (\n) characters at the end of every
input record.
This allows you to use getline. See the Canvas assignment and copy the file named a4data.txt to
your
machine. Do not change the name of the file it must be a4data.txt. Assume that the input will be
correct.
The input record format is:
6 characters - item UPC
20 characters - item description
6 characters - cost (999.99 format)
6 characters - selling price (999.99 format)
3 characters - inventory on hand
1 character - status (o on order; d discontinued; s on shelf)
Use correct read loop logic as discussed in class.
There is no constructor. The Grocery array is statically allocated, so if there was a constructor, it
would be
executed when the array was first defined, once per element.
The maximum number of grocery items is 100, and youll need a counter to keep track of how
many there
actually are. Define that counter as a static variable in the Grocery class, and use it throughout
your code as
needed.
At the end of phase 1, main has built a set of Grocery objects.
Next, main should display all the Grocery objects to ensure that the array has been built
correctly. Examine
the input data and determine if your code is processing all the records, and each record correctly.
Display
them after you have processed the input file; do not.
please help implement the following in C. below are instructions and.pdf
please help implement the following in C. below are instructions and partial code below that,
step one is completed in the image.
double getMean(const int *arr, int size) {
//TODO: implement
}
int getMin(const int *arr, int size) {
//TODO: implement
}
int getIndexOfMin(const int *arr, int size) {
//TODO: implement
}
int getMax(const int *arr, int size) {
//TODO: implement
}
int getIndexOfMax(const int *arr, int size) {
//TODO: implement
}
int * filterThreshold(const int *arr, int size, int threshold, int *resultSize) {
//TODO: implement
}
int **createMultiplicationTable(int n, int m) {
//TODO: implement
}
1. Write documentation in the array_util.h file in your own words so you have an understanding
of what it does. 2. Implement the function in the array_util.c file. 3. Test your function in the
arrayMain.c file to verify it works. Look for ways to make your life easier: some functions may
be able to utilize others. - double getMean(const int *arr, int size) - computes the average of
elements in arr - int getmin (const int *arr, int size) - returns the minimum element in arr - int
getindexofmin(const int *arr, int size) - returns the index of the the minimum element in arr - int
getmax(const int *arr, int size) - returns the maximum element in arr - int getIndexofmax (const
int *arr, int size) - returns the index of the the maximum element in arr - int *
filterthreshold(const int *arr, int size, int threshold, int *resultsize) - creates and returns a new
array that contains elements in arr that are greater than or equal to threshold. The size of the
returned array is communicated through the pass-by-reference variable, resultSize. For example,
if we pass the array [10,5,32,8,7, 28,15,12] with threshold =10 then the returned array should be
[10,32,28,15,12] and the resultSize would be set to 5 . - int **createMultiplicationTable (int n,
int m ) - creates and returns a new (nx m) 2-D array that contains the values in a multiplication
table. For example, if n=3,m= 5 then the result should look like:.
I received answers to 2 App requests and paid. The JAVA Apps are not.docx
I received answers to 2 App requests and paid. The JAVA Apps are not working. They are both due at noon tomorrow Eastern time.I need serious and no-BS tutor that can have this working tonight since I have to get them in. I paid 40 to get this far and would pay another $50 to get the work completed and working. I want to see the output from the netbeans IDE directly.
Ticket
import java.util.Date;
public class Ticket {
/** Ticket number */
private long number;
/** Category of Ticket */
private String category;
/**Ticket Holder*/
private String holder;
/** Purchase date */
private Date date;
/** Ticket Price */
private double price;
private boolean status;
/***
*
* @param num
* @param cat
* @param hold
* @param d
* @param p
* @param newstatus
*/
Ticket (String num, String cat,String hold, Date d, double p, boolean newstatus){
number =Long.parseLong(num);
category =cat;
holder =hold;
date =d;
price=p;
status =newstatus;
}
/**
* @return the number
*/
public long getNumber() {
return number;
}
/**
* @return the category
*/
public String getCategory() {
return category;
}
/**
* @return the date
*/
public Date getDate() {
return date;
}
/**
* @param price
* the price to set
*/
public void setPrice(double price) {
this.price = price;
}
/**
* @return the price
*/
public double getPrice() {
return price;
}
/***
*
* @return
*/
public void changePurchaseStatus(boolean newStatus) {
status= newStatus;
}
/***
*
*/
public String toString() {
return "Ticket Number: "+number +"\nCategory: "+category +"\nHolder: "+holder+"\nDate: "+date.toString()+"\nPrice: "+price+"\n";
}
/**
* @return the holder
*/
public String getHolder() {
return holder;
}
}
Merchandise
import java.util.Scanner;
public class Merchandise {
private long id;
private String category;
private String description;
private double price;
private boolean instock;
public Merchandise() {
this.id = 0;
this.category = null;
this.description = null;
this.price = 0;
this.instock=true;
}
public Merchandise(long nid, String nCate, String nDesc, double nPri, boolean instck) {
this.id = nid;
this.category = nCate;
this.description = nDesc;
this.price = nPri;
this.instock=instck;
}
public void setPrice(Double newPrice) {
this.price = newPrice;
}
public void setStock(boolean newStatus) {
this.instock= newStatus;
}
public long getId() {
return id;
}
public String getCategory() {
S.
Similar to 1- GivenaclassnamedTicketDB- whichwillbeusedtoprovidetheresponsibility.docx (20)
Part 1 - Written AnswersDownload the GridWriter.zip file and exami.pdf
Part 1 - Written AnswersDownload the GridWriter.zip file and exami.pdf
Please solve the following problem using C++- Thank you Instructions-.docx
Please solve the following problem using C++- Thank you Instructions-.docx
An object of class StatCalc can be used to compute several simp.pdf
An object of class StatCalc can be used to compute several simp.pdf
Write a program that mimics the operations of several vending machin.pdf
Write a program that mimics the operations of several vending machin.pdf
Write ItemList.h and ItemList.cItemList is used to store a list .pdf
Write ItemList.h and ItemList.cItemList is used to store a list .pdf
hello- please dont just copy from other answers- the following is the.docx
hello- please dont just copy from other answers- the following is the.docx
Getting StartedCreate a class called Lab8. Use the same setup for .pdf
Getting StartedCreate a class called Lab8. Use the same setup for .pdf
in c languageTo determine the maximum string length, we need to .pdf
in c languageTo determine the maximum string length, we need to .pdf
Write a program that will test a name) method no sorting routine from.docx
Write a program that will test a name) method no sorting routine from.docx
Program Specifications in c++ Develop an inventory management system f.docx
Program Specifications in c++ Develop an inventory management system f.docx
Program Specifications in c++ Develop an inventory management syste.docx
Program Specifications in c++ Develop an inventory management syste.docx
C++ - UNIT_-_IV.pptx which contains details about Pointers
C++ - UNIT_-_IV.pptx which contains details about Pointers
C++ help finish my code Topics class definitions, arrays of objec.pdf
C++ help finish my code Topics class definitions, arrays of objec.pdf
please help implement the following in C. below are instructions and.pdf
please help implement the following in C. below are instructions and.pdf
I received answers to 2 App requests and paid. The JAVA Apps are not.docx
I received answers to 2 App requests and paid. The JAVA Apps are not.docx
More from toddr5
1- What is the evidence that all life on 1- What is a mutation- and wh.docx
1. What is the evidence that all life on 1. What is a mutation, and what Barth has a common origin? determines whether it contributes to evolutionary change? 2. How did photosynthesis make life on land possible? 2. What are two possible explanations for why very similar genes can be found in 3. What is the relationship between a bacteria and plants? population and an ecosystem? 3. Explain the molecular genetios meaning of transcription and translation.
.
1- What is the definition of money- a- Anything made of gold b- Anythi.docx
1. What is the definition of money? a. Anything made of gold b. Anything that is generally accepted and used as a medium of payment c. Only those things declared money by the government d. Any good or service that is traded for another good or service 2. Which of the following have not served as money in the past? a. seashells b. copper c. grain d. paper e. all of these have served as money in the past 3. Which one of these is not a function of money? a. medium of exchange b. a measure of value c. a store of value d. a status symbol
.
1- What is our current- commonly accepted conclusion on who invented c.docx
1. What is our current, commonly accepted conclusion on who invented calculus? Why?
2. What have you learned about the nature of science through this historical controversy?
3. Who defended Newton's "priority" (i.e. first to invent)?
A. The King of England
B. Hooke
C.The Royal Society
D. Bernoulli
.
1- What is meant by the Columbian Exchange- Who was affected the most.docx
1. What is meant by the Columbian Exchange? Who was affected the most by the exchange? 2. What were the various goals of the colonial European powers in the expansion of their empires? To what extent were they able to achieve these goals? In your opinion, where did they fail? 3. On the whole, what was the impact of early European explorations on the New World? What was the impact of the New World on Europeans?
.
1- What is FALSE about this animal- ANT- A- Insecta B- Protostome C-.docx
1. What is FALSE about
this animal? ANT.
A. Insecta
B. Protostome
C. Lophotrochozoan
D. Ecdysozoan
E. Arthropoda
1. Name two embryonic characteristics that this animal shares with an octopus.
-?
-?
2. All these animals fall
under the group? animals: Cocodriles, Birds, and Dinosaurs
A. Amphibia
B. Lepidosauria
C. Mammalia
D. Archosauria
E. Protostomy
2. In the skulls of these animals, we would expect to find at least __#?___
holes beside the orbital (the one of the eye).
3. Birds, reptiles, and amphibians
Name two characteristics that they all share with a
Cephalochordate:
4. A CORAL Evolutionary advance?
A. coelom
b. tissues
C. cephalization
D. triploblasty
E. metamerism
Mention two characteristics that are associated with the body symmetry of these animals?
.
1- What are the elements of goal-setting theory- Explain and provides.docx
1. What are the elements of goal-setting theory? Explain and provides personal Reflections
2. What are some important characteristics of each of the following generations?
Traditionalist
Baby Boomer
Generation X
Generation Y
Please add references and Subject name is Engeneering Management
.
1- What are the major differences between ELISA and ELISpot 2- The ELI.docx
1. What are the major differences between ELISA and ELISpot 2. The ELISpot assay can assist you in determining the type of adaptive T cell response involved during a particular infection or disease state. How can you use the ELISpot assay to measures specific T cell responses to HIV infection? Think about the unique cytokines released by specific cell types 3. EUSA assays typically use a standard curve. Does the ELISpot assay? why/why not? 4. How would you interpret results of an ELISpot in 1 in which in sample A you found 500 tiny little spots, versus sample B in which you found 100 big spots (about 4 times bigger that the size of sample A)?
.
1- What are the characteristics of the culture medium- LB and YPD cult.docx
1. What are the characteristics of the culture medium? LB and YPD culture medium to be used in this experiment?
2. What are the autoclave handling conditions? and Describe its probable use?
3. How do you ensure that the culture media are sterile?
4. What are the 3 conditions that must be met the method of conservation of microbial strains?
.
1- What are the advantages and disadvantages of getting tattoos and bo.docx
1. What are the advantages and disadvantages of getting tattoos and body piercings?
2. Do you think having tattoos is an indicator of other risk-taking behavior?
3. What are the different types of health-risk and high-risk behaviors associated with tattoos, body piercing, and other body art?
.
1- What are the Similarities between Futures agreements and Forward ag.docx
1. What are the Similarities between Futures agreements and Forward agreements? a. b. c. 2. What are the differences between Futures agreements and Forward agreements? a. b. c. 3. What are the Similarities between Futures agreements and Option agreements? a. b. c. 4. What are the differences between Futures agreements and Forward agreements? a. b. c.
.
1- What are some of the greatest risks businesses face when connecting.docx
1. What are some of the greatest risks businesses face when connecting to the web? Why? 2. Why is it critical to perform periodic web-application vulnerability assessments and penetration tests? 3. Why might connecting your web servers and web applications to the Internet be like opening Pandora's Box?
.
1- What do you think the very first living microorganism used for nutr.docx
1. What do you think the very first living microorganism used for nutrition (carbon, energy, nitrogen, etc)? 2. What is the advantage of being a facultative anaerobe vs. an aerotolerant anaerobe? Why do you think Streptococci are aerotolerant anaerobes but Escherichia coli are facultative anaerobes? 3. Can you think of a reason that bacteria might need to use active transport to move small molecules OUT of themselves? 4. How would you use an enrichment and isolation experiment to find new previously undiscovered biochemical reactions?
.
1- What are the 3 types of cloud delivery models- briefly explain them.docx
1. What are the 3 types of cloud delivery models, briefly explain them with examples 2. List the top benefits of cloud computing, briefly describing each of them? 3. Briefly describe Replication and its types? 4. What is cloud deployment and cloud migration? 5. What are the considerations for Network deployment in the cloud? 6. Describe different Types of Server Migrations (data center-to-cloud)? 7. List the types of best security practices to be followed? 8. What is CIA triad in data encryption? 9. Briefly describe data classification and its types? 10. What is cloud segmentation? 11. List and briefly describe cloud-based security services?
.
1- Watch the following videos at ITFreeTraining-com- Basics of how RAM.docx
1. Watch the following videos at ITFreeTraining.com.
Basics of how RAM worksLinks to an external site.
Optical MediaLinks to an external site.
SCSILinks to an external site.
IDE/PATALinks to an external site.
Hybrid Drives & Dual-DriveLinks to an external site.
Installing MemoryLinks to an external site.
Laptop MemoryLinks to an external site.
Network Speeds and LimitationsLinks to an external site.
DDR MemoryLinks to an external site.
USB to EthernetLinks to an external site.
How RAM Caches, Buses and Virtual Memory WorkLinks to an external site.
Parity and Error CorrectionLinks to an external site.
Unbuffered, registered, buffered and fully buffered RAMLinks to an external site.
Asynchronous and Synchronous DRAMLinks to an external site.
2. Describe what you learned.
3. If any, describe the concept(s) you do not understand.
***Requirement: minimum 400 words.
.
1- Understanding the implications of taxes on welfare Tbe following gr.docx
1. Understanding the implications of taxes on welfare Tbe following graph represents the demand and supply for blinkies (an imaginary product). The black point (olus symbol) indicates the pre-tax equilibrium, suppose the government has fust decided to impese a tax on this market; the grey points (star symbol) indicate the after-tax scenario. Homework (Ch 08) Complete the following table, given the information presented on the graph. In the following table, indicate which areas on the previous graph correspond to each concept. Check all that appy.
.
1- Understanding the implications of taxes on welfare The following gr.docx
1. Understanding the implications of taxes on welfare The following graph represents the demand and supply for blinkles (an imaginary product). The black point (plus symbol) indicates the pre-tax equilibrium. Suppose the government has just decided to impose a tax on this market; the grey points (star symbol) indicate the after-tax scenario. Complete the following table, given the information presented on the graph. In the following table, indicate which areas on the previous graph correspond to each concept. Check all that apply.
.
1- use different markets to minimize or eliminate a particular risk th.docx
1. use different markets to minimize or eliminate a particular risk that they face from the potential future movements in the market variables. Their mian aim is not to make a huge gain but moderately to protect their existing position against the price fluctuations. A. Speculator B. Hedger C. Arbitrageur D. All the above 2. was introduced on January 1, 1999 as official currency of member states of the European Union. A. Korean Won B. Euro C. Malaysian Ringgit D. Swiss Franc 3. Which currency pairs have nickname Barney and Betty? A. Euro / British Pound and Euro / Japanese Yen B. US Dollar / Russian Ruble and Euro / Russian Ruble C. British Pound / US Dollar and British Pound/Japanese Yen D. EURO/Bitcoin and Euro/ U.S Dollar 4. Process of aligning a country's currency with the US Dollar is called as A. industrialize B. dollarization C. seignorage D. integration 5. Buying and selling of goods and services between businesses in neighbouring countries is known as A. Cross border trade B. Foreign exchange rate C. Capital market D. Multinational Enterprise
.
1- The minimum requirements for health and safety that institutions mu.docx
1. The minimum requirements for health and safety that institutions must meet to be considered a certified Medicare provider are referred to as ? A patient specific discharge plan can serve as a guide for successful transfer from acute care to an alternative setting. 2. What are the key elements to discharge protocols?
.
1- The means through which data is transmitted and received- 2- A pers.docx
1. The means through which data is transmitted and received. 2. A personal computer which may or may not be connected to a network. 3. A computer on the network that requests resources or services from another computer on a network. 4. The scheme for assigning a unique identifying number to every node on the network. 5. The device inside a computer connects a computer to the network media. 6. The physical layout of a computer network. 7. The distinct units of data that are exchanged between nodes on a network. 8. A standard method or format for communication between networked devices. 9. The part of a network to which segments and significant shared devices connect. Short Answer ( 4 points each question) 1. Describe the advantages and disadvantages of using peer-to-peer networks and client-server networks. 2. What is OSI Model? Describe each layer. 3. A network consists of 10 computers, all running Windows 7 Professional. One computer acts as a file server and serves up data to other computers on the network. Which networking model does the network use? 4. Describe LAN, MAN and WAN. 5. Describe network troubleshooting steps. 1. A ( n ) is a computer that is not connected to other computers and that uses software applications and data stored on its local disks. 2. In a ( n ) network, every computer can communicate directly with every other computer. 3. To function as a server, a computer must be running a(n) 4. A network that connects two or more geographically distinct LANs or MANs is called a(n) 5. refers to the centralized management of multiple network-based communications. 6. The seven layers of the OSI model are 7. Some switches operate at the layer and routens operate at the 8. A is a network of computers and other devices that ean directly address all other nodes. 9. A manages traffic between two or more LANS. 10. Networks provide a wide range of services, including. applications, services, and services 11. The model for access control relies on a centrally administered server using a NOS that munages shared resources for multiple clienta
.
1- The gene for tall is dominant over dwarf in the garden pea plant us.docx
The gene for tall is dominant over dwarf in pea plants. When a tall pea plant is crossed with a dwarf pea plant, the F1 generation will all be tall. The F1 generation will be heterozygous for the tall gene, with genotype Tt.
More from toddr5 (20)
1- What is the evidence that all life on 1- What is a mutation- and wh.docx
1- What is the evidence that all life on 1- What is a mutation- and wh.docx
1- What is the definition of money- a- Anything made of gold b- Anythi.docx
1- What is the definition of money- a- Anything made of gold b- Anythi.docx
1- What is our current- commonly accepted conclusion on who invented c.docx
1- What is our current- commonly accepted conclusion on who invented c.docx
1- What is meant by the Columbian Exchange- Who was affected the most.docx
1- What is meant by the Columbian Exchange- Who was affected the most.docx
1- What is FALSE about this animal- ANT- A- Insecta B- Protostome C-.docx
1- What is FALSE about this animal- ANT- A- Insecta B- Protostome C-.docx
1- What are the elements of goal-setting theory- Explain and provides.docx
1- What are the elements of goal-setting theory- Explain and provides.docx
1- What are the major differences between ELISA and ELISpot 2- The ELI.docx
1- What are the major differences between ELISA and ELISpot 2- The ELI.docx
1- What are the characteristics of the culture medium- LB and YPD cult.docx
1- What are the characteristics of the culture medium- LB and YPD cult.docx
1- What are the advantages and disadvantages of getting tattoos and bo.docx
1- What are the advantages and disadvantages of getting tattoos and bo.docx
1- What are the Similarities between Futures agreements and Forward ag.docx
1- What are the Similarities between Futures agreements and Forward ag.docx
1- What are some of the greatest risks businesses face when connecting.docx
1- What are some of the greatest risks businesses face when connecting.docx
1- What do you think the very first living microorganism used for nutr.docx
1- What do you think the very first living microorganism used for nutr.docx
1- What are the 3 types of cloud delivery models- briefly explain them.docx
1- What are the 3 types of cloud delivery models- briefly explain them.docx
1- Watch the following videos at ITFreeTraining-com- Basics of how RAM.docx
1- Watch the following videos at ITFreeTraining-com- Basics of how RAM.docx
1- Understanding the implications of taxes on welfare Tbe following gr.docx
1- Understanding the implications of taxes on welfare Tbe following gr.docx
1- Understanding the implications of taxes on welfare The following gr.docx
1- Understanding the implications of taxes on welfare The following gr.docx
1- use different markets to minimize or eliminate a particular risk th.docx
1- use different markets to minimize or eliminate a particular risk th.docx
1- The minimum requirements for health and safety that institutions mu.docx
1- The minimum requirements for health and safety that institutions mu.docx
1- The means through which data is transmitted and received- 2- A pers.docx
1- The means through which data is transmitted and received- 2- A pers.docx
1- The gene for tall is dominant over dwarf in the garden pea plant us.docx
1- The gene for tall is dominant over dwarf in the garden pea plant us.docx
Recently uploaded
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Physical pharmaceutics notes for B.pharm students
BBR 2024 Summer Sessions Interview Training
Qualitative research interview training by Professor Katrina Pritchard and Dr Helen Williams
How to Manage Your Lost Opportunities in Odoo 17 CRM
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
How to Add Chatter in the odoo 17 ERP Module
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...Nguyen Thanh Tu Collection
https://app.box.com/s/y977uz6bpd3af4qsebv7r9b7s21935vdNatural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityAkanksha trivedi rama nursing college kanpur.
Natural birth techniques are various type such as/ water birth , alexender method, hypnosis, bradley method, lamaze method etcPengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
clinical examination of hip joint (1).pdf
described clinical examination all orthopeadic conditions .
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
Hindi varnamala | hindi alphabet PPT.pdf
हिंदी वर्णमाला पीपीटी, hindi alphabet PPT presentation, hindi varnamala PPT, Hindi Varnamala pdf, हिंदी स्वर, हिंदी व्यंजन, sikhiye hindi varnmala, dr. mulla adam ali, hindi language and literature, hindi alphabet with drawing, hindi alphabet pdf, hindi varnamala for childrens, hindi language, hindi varnamala practice for kids, https://www.drmullaadamali.com
The Diamonds of 2023-2024 in the IGRA collection
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
PCOS corelations and management through Ayurveda.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
How to Build a Module in Odoo 17 Using the Scaffold Method
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
Librarians are leading the way in creating future-ready citizens – now we need to update our spaces to match. In this session, attendees will get inspiration for transforming their library spaces. You’ll learn how to survey students and patrons, create a focus group, and use design thinking to brainstorm ideas for your space. We’ll discuss budget friendly ways to change your space as well as how to find funding. No matter where you’re at, you’ll find ideas for reimagining your space in this session.
Recently uploaded (20)
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
RHEOLOGY Physical pharmaceutics-II notes for B.pharm 4th sem students
Film vocab for eal 3 students: Australia the movie
Film vocab for eal 3 students: Australia the movie
How to Manage Your Lost Opportunities in Odoo 17 CRM
How to Manage Your Lost Opportunities in Odoo 17 CRM
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
BÀI TẬP BỔ TRỢ TIẾNG ANH 8 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2023-2024 (CÓ FI...
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Liberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdf
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
Digital Artefact 1 - Tiny Home Environmental Design
Digital Artefact 1 - Tiny Home Environmental Design
How to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold Method
Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
Reimagining Your Library Space: How to Increase the Vibes in Your Library No ...
1- GivenaclassnamedTicketDB- whichwillbeusedtoprovidetheresponsibility.docx
- 1. 1. GivenaclassnamedTicketDB, whichwillbeusedtoprovidetheresponsibilityofdata management of a set of Ticket objects. Internally, it should use an Arraylist of Ticket as follows: Public class TicketDB { private ArrayList < Ticket > ticket List = new ArrayList < Ticket > ( ); - implementation for a method to add a not null Ticket object into the ticketlist. - implementation for a method to report the average price of the tickets. - implementation for a method to retrieve a specific ticket by id. - implementation for a safe way method to obtain an Array List of all the Ticket objects within a given range of prices. - implementation for a method called reportTickets() which should write the Ticket objects stored in the ticketList to a text file named "tickets-report.txt". You should use the printf() method to format your data in the following structure: public void reportTickets ();