CCCS 315: Data Structures and Algorithms Assignment 1 Type of Assignment Individual Work Estimated Time: 120...

 

Transcribed Image Text:

CCCS 315: Data Structures and Algorithms Assignment 1 Type of Assignment Individual Work Estimated Time: 120 minute Description In this Assignment, you will study, Analyze (Big-O), and implement a singly Linked List Arrays. You also compare an implementation of a method using recursive programming vs iterative programming. Learning Outcomes +Evaluation Points 10 40 Recognize the use of the linked-list and recursive programming Apply Big-O notation to analysis of an algorithm 15 4 69 Code formatting Part 1 Java implementation of a Linked List Part 2 Big-O Analysis Questions Part 3 Comparison of recursive vs iterative solution Total U Part 1: Java implementation of a Linked List For this part, you will be provided a set of skeleton classes for you to implement a singly linked list of type int. You will also be provided a minimal set of test cases. You are encouraged to augment the test suite. Import the eclipse project Assignment1.zip into your workspace. The package includes a complete Node class as well as a test suite MyLinked List Test. A skeleton MyLinked List class is provided with the following methods that need to be implemented: Points 1 2 3 3 Method public MyLinkedList() public void add(int data) constructor public void add(int[] data) public void add(MyLinkedList 12) 2 2 2 2 2 2 1 5 10 1 2 public int get(int index) public void remove(int data) public boolean contains (int needle) public static boolean equals (MyLinkedList 11, MyLinkedList 12) public boolean equals(MyLinkedList 12) public boolean equals(Object 02) public boolean isEmpty() public int findMinIterative() public int findMinRecursive() public int size() public String toString() Total 40 Note that each of the above method are thoroughly commented in the included assignment1 package and that additional methods may be required. Additionally, you may assume that methods are provided valid input. To submit this part of the assignment, you are required to export your project as an Archive ZIP file and compress it using the ZIP format for upload in MyCourses. See instructions posted on MyCourses for importing and exporting Eclipse Projects. Part 2: Big-O Analysis Please indicate the Big-O time-complexity of each method in your Linked List implementation in the comments of each method. One point for each method. Part 3: Comparison of recursive vs iterative solution In the comment header of the Linked List class, answer the following questions: . [2 points] Which findMin implementation is faster and why? [2 points] Which findMin implemtation has less lines of code and why? CCCS 315: Data Structures and Algorithms Assignment 1 Type of Assignment Individual Work Estimated Time: 120 minute Description In this Assignment, you will study, Analyze (Big-O), and implement a singly Linked List Arrays. You also compare an implementation of a method using recursive programming vs iterative programming. Learning Outcomes +Evaluation Points 10 40 Recognize the use of the linked-list and recursive programming Apply Big-O notation to analysis of an algorithm 15 4 69 Code formatting Part 1 Java implementation of a Linked List Part 2 Big-O Analysis Questions Part 3 Comparison of recursive vs iterative solution Total U Part 1: Java implementation of a Linked List For this part, you will be provided a set of skeleton classes for you to implement a singly linked list of type int. You will also be provided a minimal set of test cases. You are encouraged to augment the test suite. Import the eclipse project Assignment1.zip into your workspace. The package includes a complete Node class as well as a test suite MyLinked List Test. A skeleton MyLinked List class is provided with the following methods that need to be implemented: Points 1 2 3 3 Method public MyLinkedList() public void add(int data) constructor public void add(int[] data) public void add(MyLinkedList 12) 2 2 2 2 2 2 1 5 10 1 2 public int get(int index) public void remove(int data) public boolean contains (int needle) public static boolean equals (MyLinkedList 11, MyLinkedList 12) public boolean equals(MyLinkedList 12) public boolean equals(Object 02) public boolean isEmpty() public int findMinIterative() public int findMinRecursive() public int size() public String toString() Total 40 Note that each of the above method are thoroughly commented in the included assignment1 package and that additional methods may be required. Additionally, you may assume that methods are provided valid input. To submit this part of the assignment, you are required to export your project as an Archive ZIP file and compress it using the ZIP format for upload in MyCourses. See instructions posted on MyCourses for importing and exporting Eclipse Projects. Part 2: Big-O Analysis Please indicate the Big-O time-complexity of each method in your Linked List implementation in the comments of each method. One point for each method. Part 3: Comparison of recursive vs iterative solution In the comment header of the Linked List class, answer the following questions: . [2 points] Which findMin implementation is faster and why? [2 points] Which findMin implemtation has less lines of code and why?