Type of Assignment - Individual Work - Evaluated: This assignment is marked out of 100 points and is worth 10% of your final grade - Estimated Time: 120-400 minutes. Description In this Assignment, you will study, analyze (Big-O), and implement different LinkedLists and Arrays. You also start with a simple recursive programming and compare it with loops. Learning outcomes being met through this assessment: - Recognize the use of the linked-list, array, and recursive programming, - Apply Big-O notation to analysis of an algorithm, Steps to complete the assignment. This assignment is designed similarly to job interview. First, we will introduce a problem. You then need to apply critical thinking, design a solution, evaluate the solution (Big-O), then improve it if needed. Lastly, you will implement your solution. Part 1: LinkedList If you remember, we have already completed a Linked List in class. For this assignment, create your own code. (Do not use the build in function or classes of Java or from the textbook). - Create a LinkedList class: Call the class MyLinkedList, - (hint) Create a second class called Node.java and use it, remember in the class I put the Node class inside the LinkedList Class, but you should do it outside. This class should have - Variables you may need for a Node, - (optional) Constructor - Your linked list is of an int type. (you may do it as General type as
) - For this Linked List you need to have the following methods: McGill SchoolofContinuingStudiesdeducationpermanenteEcole - Write a main function or Main class to test all the methods, Create a 2 linked list and test all your methods. (Including the compare) Part2: Array Here we will create a method to find the smallest value in an array: - We provided the code for you to start, - Main is done, you need to create minFinder function, - First do it with loops - Create another function minFinder_recursive, and use recursive function to create the code to find the min value (you may add more functions/methods as needed) - Write the Pseudocode (https://en.wikipedia.org/wiki/Pseudocode ) for BOTH functions and do a time analysis in Big-O for both (This step is really important) For the pseudocode, you do not need to be super detailed but in steps by steps tell us how your code works. The Sample Pseudocode will be shown in class Submit it in PDF. Code can also be downloaded in our GitHub: McGill SchoolofContinuingStudiesEcolededucationpermanente For folder: https://github.com/farhadrclass/CCCS315/tree/main/2023- Winter/Assingment/Assignment 1 For the code: https://github.com/farhadrclass/CCCS315/blob/main/2023- Winter/Assingment/Assignment_1/src/App.java Evaluation Criteria - Format Requirements (20\%) - Comments and CamelCase is important - Style - Part 1(40%) - Each method has 3\% =24% - Testing them and main =6% - Part 2 (40\%) - Recursive method: 10% - Loop method: 10% - Pseudocodes: 5% (each 2.5\%) Big-O analysis: 15% Submitting your Work - You have to zip all the Java code for part 1 and part 2 (.java codes and if missing you will lose 85\%) - PDF for Pseudocode Notes: - Copying online without referencing correctly or explaining your code before and after online source has automatic failure as a grade. If your references are not correct, you will lose marks. (In Comments) Show your code before searching online AND showing what the issue was. (In Comments) The reference. (In Comments) How the online or book reference helped you change your code. Copying 80% from online with reference still results in ZERO! - Modify it to fit your code, do not blindly copy it and remember you are here to learn! - Do NOT share your code with anyone except your TA and me
