ASSIGNMENT 2 Assignment 2 tests your knowledge of program complexity (Chapter 22), sorting methods (Chapter 23), and use

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899603
Joined: Mon Aug 02, 2021 8:13 am

ASSIGNMENT 2 Assignment 2 tests your knowledge of program complexity (Chapter 22), sorting methods (Chapter 23), and use

Post by answerhappygod »

Assignment 2 Assignment 2 Tests Your Knowledge Of Program Complexity Chapter 22 Sorting Methods Chapter 23 And Use 1
Assignment 2 Assignment 2 Tests Your Knowledge Of Program Complexity Chapter 22 Sorting Methods Chapter 23 And Use 1 (156.15 KiB) Viewed 7 times
ASSIGNMENT 2 Assignment 2 tests your knowledge of program complexity (Chapter 22), sorting methods (Chapter 23), and user-defined lists, stacks, queues, and priority queues (Chapter 24). Design a program/project/driver class YourNameAssignment2 and the following classes (with exact names, replace YourName with your actual first name or the name you go by, no spaces): Class YourNameArray YourNameList YourNameArrayList YourNameLinkedList YourNameQueue Description A new class that contains an array called Array of 10 integers, a constructor that takes an array as parameter to create the array Array, and the following sorting methods (see Chapter 23)²: • YourNameInsertionsort that sorts the array Array using insertion sort. ▪ YourNameBubbleSort that sorts the array Array using bubble sort. • YourNameMergeSort that sorts the array Array using merge sort. ▪ Your NameQuickSort that sorts the array Array using quick sort. YourNamePrint that prints the array Array to the console in this format: "ARRAY=[Elements, Element:, -, Elements-1)" where Elements is the number from position in the Array YourNameSortAlgorithm Complexity that outputs to the console for each of the 4 sorting algorithms above, their complexity in Big-O notation (see Chapter 22) and an explanation of which one of the sorting methods is better and why. This method does not compute anything, just outputs text. A complete version of user-defined MyList class from Chapter 24 (meaning you need to add the code for the methods that were not coded in the book and have an "// Left as an exercise" comment in the body. Add an additional YourName Print method that prints the list in the format: "[Elements, Elementi, -, Elements-1)" where Element is the number from position in the Your NameList A complete version of the user-defined MyArrayList class from Chapter 24 that code all the methods and uses the Your Name List instead of MyList. Add an additional Your Name Print method that prints the list in the format: "ARRAYLIST=[ Elements, Elementi, Elements-]" where Element is the number from position k in the YourNameArraylist A complete version of the user-defined MyLinkedList class from Chapter 24 that code all the methods and uses the YourNameList instead of MyList. Add an additional YourNamePrint method that prints the list in the format: "LINKEDLIST=[ Elemento, Elementi, Elementl" where Elements is the number from position in the YourNameLinkedList A complete version of the user-defined GenericQueue class from Chapter 24 that code all the methods and uses a YourNameLinkedList instead of the pre-defined LinkedList used in textbook. Add an additional YourName Print method that prints the list in the format: "QUEUE=[ Elemento, Elementi, -, Elements-1]" where Elements is the number from position in the Your NameQueue. YourNameAssignment2 Creates an array of 10 integers, read 10 values from the user/console, and build instances of the user- driver class main method defined lists above (YourNameArray, YourNameArrayList, YourNameLinkedList, and YourNameQueue) with the 10 values and test/demonstrate ALL their functionality/methods from the classes especially the Your Name Print and YourNameSort Algorithm Complexity, and the 4 sorting methods for YourNameArray. You can and should start with the examples from the textbook/presentation and adapt them to the assignment at hand and use the appropriate names and add the code and requirements above. You should not add any additional classes. Create a Microsoft Word screenshots document called YourNameAssignment2-Screenshot.docx (replace YourName with your actual name) that contains screenshots of the entire JAVA source code in the editor window, for each of the 6 classes (YourNameAssignment2, YourNameArray.java, YourNameList.java, YourNameArrayList.java, YourNameLinkedList.java, YourNameQueue.java) and the entire output (from the driver class). If the entire class JAVA source code or the output does not fit in one screenshot, create multiple screenshots and add them to the document. Please paste the screenshots in the document in logical (program) order. Submit the following 7 files: YourNameAssignment2.java, YourNameArray.java, YourNameList.java, YourNameArrayList.java, YourNameLinkedList.java, YourNameQueue.java Java source code files and YourNameAssignment2-Screenshots.docx screenshots document on eCampus under Assignment 2. Do not archive the files (no ZIP, RAR, etc) or submit other file formats (no JAR, TXT, PDF, etc). Please check all the files in the submissions confirmation page and if there are any problem opening them or missing anything, please use your second attempt to resubmit all the 7 files.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply