Create a Node Class Which will Hold Two Fields - IT Assignment Help

Assignment Task:

Task:

Task 1: i) Create a Node class which will hold two fields i.e an integer element and a reference to the next Node.

ii) Create a Linked list Abstract Data Type (ADT)named MyList.The elements in the list are Nodes consisting of an integer type key (all keys are unique) and a reference to the next node. [You are not allowed to use any class variable other than head.]

Task 2: (Basic operations) 20 marks

1. Constructors:(3)

a. MyList ( ) Pre-condition: None. Post-condition:

This is the default constructor of MyList class.

This constructor creates an empty list.

b. MyList (int [] a) or Myst(a) Pre-condition: Array cannot be empty. Post-condition:This is the default constructor of MyList class. This constructor creates a list from an array.

c. MyList (MyList a) or MyList(a) Pre-condition: List cannot be empty. Post-condition: This is the default constructor of MyList class. This constructor creates a list from another list.

2. void showList ( ) or def showList(self) (2) Precondition: None. Postcondition: Outputs the keys of the elements of the order list. If the list is empty, outputs “Empty list”.

3. boolean isEmpty ( ) or def isEmpty(self) (1) Pre-condition: None. Post-condition: Returns true if a list is empty. Otherwise, returns false.

4. void clear ( ) or def clear(self) (1) Pre-condition: The list is not empty. Post-condition: Removes all the elements from a list.

5. void insert (Node newElement) or def insert(self, newElement) (3) Pre-condition: None. Post-condition: This method inserts newElement at the tail of the list. If an element with the same key as newElement already exists in the list, then it concludes the key already exists and does not insert the key.

6. void insert (int newElement, int index) or def insert(self, newElement, index) (4) Pre-condition: The list is not empty. Post-condition: This method inserts newElement at the given index of the list. If an element with the same key as newElement value already exists in the list, then it concludes the key already exists and does not insert the key. [You must also check the validity of the index].

7. Node remove (int deleteKey) or def remove(self, deletekey) (4) Pre-condition: List is not empty. Post-condition: Removes the element from a list that contains the deleteKey and returns the deleted key value.

Task 3: (Advanced operations) 

1. Write a function to find out the even numbers that are present in the list and output another list with those numbers. (3)

Sample Input Sample Output 1 -> 2 -> 5 -> 3 -> 8 2 -> 8 101 -> 120 -> 25 -> 91-> 87 -> 1 120

2. Write a function to find out if the element is in the list or not. (3)

Sample Input Sample Output 1 -> 2 -> 5 -> 3-> 8 and 7 False 101 -> 120 -> 25 -> 91-> 87 -> 1 and 87 True

3. Write a function to reverse the list. [You are not allowed to create any other list] (3)

Sample Input Sample Output 1 -> 2 -> 5 -> 3-> 8 8 -> 3 -> 5 -> 2 -> 1

4. Write a function to sort the list. [You are not allowed to create any other list] (3)

Sample Input Sample Output 1 -> 2 -> 5 -> 3-> 8 1 -> 2 -> 3 -> 5 -> 8

5. Write a function that prints the sum of the values in the list. (4)

Sample Input Sample Output 1 -> 2 -> 5 -> 3-> 8 19 6. Write a function that rotates the elements of the list k times. [You are not allowed to create any other list]. (4) Sample Input Sample Output 3 -> 2 -> 5 -> 1-> 8, left, 2 5 -> 1 -> 8 -> 3 -> 2 3 -> 2 -> 5 -> 1-> 8, right, 2 1 -> 8 -> 3 -> 2 -> 5

This IT Assignment has been solved by our IT Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.