c++ Programming (3)

in /by

c++ Programming (3)

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;
};_x000D_
_x000D_
isFull(head)_x000D_
    n <- new Node_x000D_
    IF n = 0:_x000D_
        RETURN(true)_x000D_
    ELSE:_x000D_
        DELETE(n)_x000D_
        RETURN(false)_x000D_
_x000D_
isEmpty(head)
IF head = null:
    RETURN(true)
ELSE:
    RETURN(false)_x000D_
_x000D_
clear(head)
WHILE(head != null)
    p <- head
    head <- head.next
    DELETE(p)_x000D_
_x000D_
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 to 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).

"You need a similar assignment done from scratch? Our qualified writers will help you with a guaranteed AI-free & plagiarism-free A+ quality paper, Confidentiality, Timely delivery & Livechat/phone Support.


Discount Code: CIPD30



Click ORDER NOW..

order custom paper