01 Jul c++ Programming (3)
Question Description
Follow the instructions and do the c++ programming.
Submission Details and give me the final MyList.h file.
-Using pointer-based linked List Alogorithms (see below)
struct Node
{
int value;
Node* next;
};
isFull(head)
n <- new Node
IF n = 0:
RETURN(true)
ELSE:
DELETE(n)
RETURN(false)
isEmpty(head)
IF head = null:
RETURN(true)
ELSE:
RETURN(false)
clear(head)
WHILE(head != null)
p <- head
head <- head.next
DELETE(p)
append(head, v)
IF isFULL():
RETURN
n <- new node
n.value <- v
n.next <- null
IF isEmpty():
head <- n
ELSE:
p <- head
WHILE p->next != null:
p <- p.next
p->next <- n
-Don't make the assignment too hard.
**********************************************Reequirements******************************************************************
Using the following UML diagram and class description, write a class named MyList which implements a linked list.
Class Attributes:
Node is a nested struct. It's members are:
value - stores an integer value.
next - stores the memory address of the next node in the list.
head - The head node. Stores the memory address of the first node in the list.
Constructor - initializes head to null.
Destructor - frees all memory used by the list.
isFull - returns true if there's enough memory to create a new node, false otherwise.
isEmpty - returns true if the list is empty, false otherwise.
find - searches the list for it's argument. Returns true if it's found, false otherwise.
remove - removes the first node found matching the argument passed to remove. Returns 0 if a node is removed, -1 otherwise.
append - attempts to append it's argument to the list in a new node. Returns 0 if successful, -1 otherwise.
clear - frees all memory used by the linked list, leaving head set to null.
print - displays the contents of the list to the screen.
Notes:
The class does not interact with the user in any way, so no cin or cout statements. (exception: print())
All accessors should be marked const.
struct Node is nested in class MyList and is private.
Hints:
Save yourself from writing duplicate code by having the class destructor call the clear method.
You can use this driver Preview the documentto get you started on testing.
Submission Details:
Place your class in it's own header file named MyList.h.
Submit only this file.
Be sure to include preprocess guards( #ifndef, #define, #endif).
Our website has a team of professional writers who can help you write any of your homework. They will write your papers from scratch. We also have a team of editors just to make sure all papers are of HIGH QUALITY & PLAGIARISM FREE. To make an Order you only need to click Ask A Question and we will direct you to our Order Page at WriteDemy. Then fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.
Fill in all the assignment paper details that are required in the order form with the standard information being the page count, deadline, academic level and type of paper. It is advisable to have this information at hand so that you can quickly fill in the necessary information needed in the form for the essay writer to be immediately assigned to your writing project. Make payment for the custom essay order to enable us to assign a suitable writer to your order. Payments are made through Paypal on a secured billing page. Finally, sit back and relax.
About Writedemy
We are a professional paper writing website. If you have searched a question and bumped into our website just know you are in the right place to get help in your coursework. We offer HIGH QUALITY & PLAGIARISM FREE Papers.
How It Works
To make an Order you only need to click on “Order Now” and we will direct you to our Order Page. Fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.
Are there Discounts?
All new clients are eligible for 20% off in their first Order. Our payment method is safe and secure.