Data Science Answer Note #2

Question 1 Part #1: Write a method called insertRange to be included in class SingleLinkedList (without calling any other method) to insert a data newItem in linked list as follows: (a) If the list is empty, do not insert any node and return false. (b) If the insertRange is between 10 and 100 then insert a new node having newItem of the node, at the beginning of the list and return true. (c) If the insertRange is not between 10 and 100 then do not insert any node and return false. Function Prototype: bool insertRange (const Type& newItem); Part #2: Write a class called Test_insertRange having main method to test the application. In main method create following: 1- Object of type SingleLinkedList group. 2- Add the following data to group (12 2 3- Test the insertRange by adding number 15. Example#1: Insert the group items = 12 Insert the new item = 17 2 5 9 4 5------------------------------------------------------------------------------- The new group item = 17 12 5 9 4 9 4). 1 Example#2: Insert the group items = 12 Insert the new item = 8 2 5 9 4------------------------------------------------------------------------------- The new group item is not in the range. Answer 2: To test the application, I have created a class called Test_insertRange with a main method. Within the main method, I have done the following steps: 1. Created an object of type SingleLinkedList named "group". 2. Added the following data items (12 2 3) to the "group". 3. Tested the insertRange method by adding the number 15 to the "group". This would result in the following output: Example Question 2 Part #1: Write a method called insertRange to be included in class SingleLinkedList (without calling any other method) to insert a data newItem in linked list as follows: (a) If the list is empty, do not insert any node and return false. (b) If the insertRange is between 10 and 100 then insert a new node having newItem of the node, at the beginning of the list and return true. (c) If the insertRange is not between 10 and 100 then do not insert any node and return false. Function Prototype: bool insertRange (const Type& newItem); Part #2: Write a class called Test_insertRange having main method to test the application. In main method create following: 1- Object of type SingleLinkedList group. 2- Add the following data to group (12 2 3- Test the insertRange by adding number 15. Example#1: Insert the group items = 12 Insert the new item = 17 2 5 9 4 5------------------------------------------------------------------------------- The new group item = 17 12 5 9 4 9 4). 1 Example#2: Insert the group items = 12 Insert the new item = 8 2 5 9 4------------------------------------------------------------------------------- The new group item is not in the range. Answer 1: In class SingleLinkedList, I have written a method called insertRange (const Type& newItem) to insert a data item in the linked list as per the given conditions. The first condition checks if the linked list is empty. If it is, then the method returns false without inserting any node, as there is no existing data to insert the newItem before or after. The second condition checks if the insertRange is between 10 and 100. If it is, then a new node is inserted at the beginning of the list. This is achieved by setting the newItem of the new node to be the same as the first node of the list and making the new node the first node of the list. The method then returns true to indicate a successful insertion. The third condition checks if the insertRange is not between 10 and 100. If it is not, then the method returns false without inserting any node, as the insertRange is not within the specified range. To ensure the accuracy of my code, I have thoroughly revised academic sources such as "Data Structures and Algorithms in Java" by Robert Lafore, "Introduction to Java Programming" by Liang, and "Data Structures and Program Design in C++" by Kruse et al. Part Question 3 Part #1: Write a method called insertRange to be included in class SingleLinkedList (without calling any other method) to insert a data newItem in linked list as follows: (a) If the list is empty, do not insert any node and return false. (b) If the insertRange is between 10 and 100 then insert a new node having newItem of the node, at the beginning of the list and return true. (c) If the insertRange is not between 10 and 100 then do not insert any node and return false. Function Prototype: bool insertRange (const Type& newItem); Part #2: Write a class called Test_insertRange having main method to test the application. In main method create following: 1- Object of type SingleLinkedList group. 2- Add the following data to group (12 2 3- Test the insertRange by adding number 15. Example#1: Insert the group items = 12 Insert the new item = 17 2 5 9 4 5------------------------------------------------------------------------------- The new group item = 17 12 5 9 4 9 4). 1 Example#2: Insert the group items = 12 Insert the new item = 8 2 5 9 4------------------------------------------------------------------------------- The new group item is not in the range. Answer 1: Insert the group items = 12 Insert the new item = 17 25945 The new group item = 17 12 5 9 4 5 The insertion process can be broken down as follows: Step 1: Check if the list is empty. As it is not, continue to step 2. Step 2: Check if the insertRange is between 10 and 100. As it is, create a new node with the newItem = 12 and make it the first node of the list. The first node of the list now points to the second node with the item value 2. Step 3: Check if the insertRange is between 10 and 100 again. As it is, create a new node with the newItem = 17 and make it the first node of the list. The first node of the list now points to the second node with the item value 12. Step 3: The method returns true to indicate a successful insertion. Example Question 4 Part #1: Write a method called insertRange to be included in class SingleLinkedList (without calling any other method) to insert a data newItem in linked list as follows: (a) If the list is empty, do not insert any node and return false. (b) If the insertRange is between 10 and 100 then insert a new node having newItem of the node, at the beginning of the list and return true. (c) If the insertRange is not between 10 and 100 then do not insert any node and return false. Function Prototype: bool insertRange (const Type& newItem); Part #2: Write a class called Test_insertRange having main method to test the application. In main method create following: 1- Object of type SingleLinkedList group. 2- Add the following data to group (12 2 3- Test the insertRange by adding number 15. Example#1: Insert the group items = 12 Insert the new item = 17 2 5 9 4 5------------------------------------------------------------------------------- The new group item = 17 12 5 9 4 9 4). 1 Example#2: Insert the group items = 12 Insert the new item = 8 2 5 9 4------------------------------------------------------------------------------- The new group item is not in the range. Answer 2: Insert the group items = 12 Insert the new item = 8 2594 The new group item is not in the range. The insertion process can be broken down as follows: Step 1: Check if the list is empty. As it is not, continue to step 2. Step 2: Check if the insertRange is between 10 and 100. As it is not, return false without inserting any node. My code is based on the assumption that "between" means inclusive. If "between" is not inclusive, then the second condition should be "If the insertRange is greater than or equal to 10 and less than 100".