Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
thumb_up100%
Chapter 7.7, Problem 7.7.1CP
Suppose the following code is written to reverse the contents in an array, explain why it is wrong. How do you fix it?
int[] list;: {1 , 2 , 3 , 5 , 4 };
for (int i ;: 0 , j ;: list.length- 1 ; < 1ist. 1ength; i ++, j --) {
// Swap list[i] with list[j]
int temp;: list[i];
list[i] list[j] ;
list[j] ;: temp ;
}
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Write java code to do the following:
Implement the Quicksort algorithm for both generic lists and generic arrays: Please note you cannot make any additional FUNCTIONS OR METHODS, Everything must be housed within the functions I have provided below:
public static <T extends Comparable<T>> void quickSort(final List<T> list, final Comparator<T> comparator) {...}
public static <T extends Comparable<T>> void quickSort(final T[] array, final Comparator<T> comparator) {...}
Please develop well-documented pseudo code that finds all consecutive similar elements of a given array (of any size n) by using either a stack or a queue. The code must display the start indices where the values start to repeat, as well as the values of these elements. For instance, given the following array A: (22, 9, 61,61, 61, 21, 0, 9, 9, 9, 9, 35, 81,81, 9, 5, 5), the code should find and display something similar to the following (pls notice that this is just an example. The solution must not refer to this particular example):
Value 61 is repeated 3 times starting at Index 2 Value 9 is repeated 4 times starting at Index 7Value 81 is repeated 2 times starting at Index 12Value 5 is repeated 2 times starting at Index 15
a) Briefly justify the motive(s) behind your design. b) What is the Big-O time complexity of your solution? Explain clearly how you obtained such complexity. c) What is the Big-Ω time complexity of your solution? Explain clearly how you obtained such complexity. d)…
1- Start by writing your choice from the list given above.
Part a. Explain the important technical details about your choice.
2-(continued) Start by again writing your choice from the list given above.
Part b. Most of the ADTs in this class were implemented using arrays and linked lists. If appropriate for the ADT you chose in part a., explain which one (an array or a linked list) you would choose to implement it and why. If it doesn’t make sense to implement your ADT using an array or a linked list, explain which other data structure you would use to implement your ADT.
Chapter 7 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 7.2 - Prob. 7.2.1CPCh. 7.2 - Prob. 7.2.2CPCh. 7.2 - What is the output of the following code? int x =...Ch. 7.2 - Indicate true or false for the following...Ch. 7.2 - Which of the following statements are valid? a....Ch. 7.2 - Prob. 7.2.6CPCh. 7.2 - What is the array index type? What is the lowest...Ch. 7.2 - Write statements to do the following: a. Create an...Ch. 7.2 - What happens when your program attempts to access...Ch. 7.2 - Identify and fix the errors in the following code:...
Ch. 7.2 - What is the output of the following code? 1....Ch. 7.4 - Will the program pick four random cards if you...Ch. 7.5 - Use the arraycopy method to copy the following...Ch. 7.5 - Prob. 7.5.2CPCh. 7.7 - Suppose the following code is written to reverse...Ch. 7.8 - Prob. 7.8.1CPCh. 7.8 - Prob. 7.8.2CPCh. 7.9 - Prob. 7.9.1CPCh. 7.9 - Prob. 7.9.2CPCh. 7.10 - If high is a very large integer such as the...Ch. 7.10 - Prob. 7.10.2CPCh. 7.10 - Prob. 7.10.3CPCh. 7.11 - Prob. 7.11.1CPCh. 7.11 - How do you modify the selectionSort method in...Ch. 7.12 - What types of array can be sorted using the...Ch. 7.12 - To apply java.util.Arrays.binarySearch (array,...Ch. 7.12 - Show the output of the following code: int[] list1...Ch. 7.13 - This book declares the main method as public...Ch. 7.13 - Show the output of the following program when...Ch. 7 - (Assign grades) Write a program that reads student...Ch. 7 - (Reverse the numbers entered) Write a program that...Ch. 7 - (Count occurrence of numbers) Write a program that...Ch. 7 - (Analyze scores) Write a program that reads an...Ch. 7 - (Print distinct numbers) Write a program that...Ch. 7 - (Revise Listing 5.1 5, PrimeNumber.java) Listing...Ch. 7 - (Count single digits) Write a program that...Ch. 7 - (Average an array) Write two overloaded methods...Ch. 7 - (Find the smallest element) Write a method that...Ch. 7 - Prob. 7.10PECh. 7 - (Statistics: compute deviation) Programming...Ch. 7 - (Reverse an array) The reverse method in Section...Ch. 7 - Prob. 7.13PECh. 7 - Prob. 7.14PECh. 7 - 7 .15 (Eliminate duplicates) Write a method that...Ch. 7 - (Execution time) Write a program that randomly...Ch. 7 - Prob. 7.17PECh. 7 - (Bubble sort) Write a sort method that uses the...Ch. 7 - (Sorted?) Write the following method that returns...Ch. 7 - (Revise selection sort) In Listing 7 .8, you used...Ch. 7 - (Sum integers) Write a program that passes an...Ch. 7 - (Find the number of uppercase letters in a string)...Ch. 7 - (Game: locker puzzle) A school bas 100 lockers and...Ch. 7 - (Simulation: coupon collectors problem) Coupon...Ch. 7 - (Algebra: solve quadratic equations) Write a...Ch. 7 - (Strictly identical arrays) The arrays 1ist1 and...Ch. 7 - (Identical arrays) The arrays 1ist1 and 1ist2 are...Ch. 7 - (Math: combinations) Write a program that prompts...Ch. 7 - (Game: pick four cards) Write a program that picks...Ch. 7 - (Pattern recognition: consecutive four equal...Ch. 7 - (Merge two sorted Lists) Write the following...Ch. 7 - (Partition of a list) Write the following method...Ch. 7 - Prob. 7.33PECh. 7 - (Sort characters in a string) Write a method that...Ch. 7 - (Game: hangman) Write a hangman game that randomly...Ch. 7 - (Game: Eight Queens) The classic Eight Queens...Ch. 7 - Prob. 7.37PE
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Define each of the following terms: entity type entity-relationship model entity instance Attribute relationshi...
Modern Database Management
What is the difference between a machine-language program and a high-level language program?
Problem Solving with C++ (10th Edition)
Software Sales Software companies often offer their customers the option to lease the software yearly or purcha...
Starting Out With Visual Basic (7th Edition)
For each of the following activities, give a PEAS description of the task environment and characterize it in te...
Artificial Intelligence: A Modern Approach
Distinguish among data definition commands, data manipulation commands, and data control commands.
Modern Database Management (12th Edition)
Using pseudocode similar to the Java class syntax of Figure 8.27, sketch a definition of an abstract data type ...
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- 1) What is the Big O runtime of the addLast() method of a Singly Linked List, when the list has a tail reference? a) O(1) b) O(logn) c) O(n^2) d) None of these answers. e) O(n) 2) Why does retrieving a value from an array have a runtime of O(1)? (Select all that reasons that make this possible.) a) Arrays use simple math calculations to compute the requested index location. b) Arrays have to search through all the data to find the requested value. c) Arrays are allocated consecutive blocks of memory. d) None of these answers. 3) How can the size() method of a Dynamic List be implement such that its big O runtime is O(1)? a) By keeping track of the size as a data field whose value is updated its with each successful insertion and deletion. b) By counting and returning the number of all non-null values in the internal array. c) Simply returning the length of the internal array. d) None of these answers. 4) Which of the following statements are true about…arrow_forwardImplement the array based sorted integer list below in ascending order. class myList{ // sorted integer list class int *ptr; // storage body int size; // storage size int length; // length of list public: myList(int); // constructor ~myList(){free(ptr);} // destructor bool empty(){return length==0;} // empty or not bool full(){return length==size;} // full or not int length(){return length;} // get length void insert(int); // insert a value in ascending order int get();…arrow_forwardYou are given an array-like data structure Listy which lacks a size method. It does, however, have an elementAt ( i) method that returns the element at index i in 0( 1) time. If i is beyond the bounds of the data structure, it returns -1. (For this reason, the data structure only supports positive integers.) Given a Listy which contains sorted, positive integers, find the index at which an element x occurs. If x occurs multiple times, you may return any index. Write code with explanationarrow_forward
- Write java code to do the following: Implement the Quicksort algorithm for both generic lists and generic arrays public static <T extends Comparable<T>> void quickSort(final List<T> list, final Comparator<T> comparator) {...} public static <T extends Comparable<T>> void quickSort(final T[] array, final Comparator<T> comparator) {...}arrow_forwardImplement two out of three of the basic sorting algorithms - Bubble Sort, Selection Sort, and Insertion Sort - in a generic List. Initial code to be completed: #include <iostream>#include "linkedlist.h" void bubbleSort(List*);void selectionSort(List*);void insertionSort(List*); /** * This activity is focused on using Arrays and Linked Lists as two different * implementations of List. It follows that you are only to use the methods of * List and not of the specific array or linkedlist. */int main(void) { // WARNING! Do not modify main method! // Doing so will nullify your score for this activity. char li; cin >> li; List* list; if (li == 'A') { list = new ArrayList(); } else { list = new LinkedList(); } int length; cin >> length; int input; for (int i = 0; i < length; i++) { cin >> input; list->add(input); } char sym; cin >> sym; int arg1; switch (sym) {…arrow_forwardHello. Please add a toString() function to the Java class implementation of the singly-linked list which returns the contents of the singly-linked list. Also, does Java have a built-in class that implements singly-linked lists? Thank you. public class SinglyLinkedList<E>{ private static class Node<E> { private E element; private Node<E> next; public Node(E e, Node<E> n) { element = e; next = n; } public E getElement() { return element;} public Node<E> getNext() { return next;} public void setNext(Node<E> n) { next = n;} } private Node<E> head = null; private Node<E> tail = null; private int size = 0; public SinglyLinkedList() {} public int size() { return size;} public boolean isEmpty() { return size == 0;} public E first() { if(isEmpty()) return null; return head.getElement(); } public E last() {…arrow_forward
- Nedd help in this. Must be in java. make the code unique and no plagerism. write a program that prints out the lists in main after the following methods are called. removeOddLength: Takes an ArrayList of strings as a parameter and removes all of the strings that have an odd length (number of characters), from the list. Return the ArrayList to main and print. swapPairs: Takes an ArrayList and switches the order of values of strings in a pairwise fashion. Your method should switch the order of the first two values, then the next two, then the next two and so on. If the number of values in the list is odd, the method should not move the final element. For example, if the list stores [“madam”, “I”, “am”, “your”, “adam”] your method should change this lists content to [“I”, “madam”, “your”, “am”, “adam”] Return the ArrayList to main and print. intersect: Accepts two sorted ArrayList of integers as parameters and returns one containing only the elements that are found in both. For…arrow_forwardHello, thank you for helping with this. However, the code needed is a Linked list, not array-list. Any chance you can assist with that?arrow_forwardCan someone please explain whats going on in this code Can comments be added please? class twoDarray(list): def __init__(self, array): try: if(not isinstance(array[0],list)): raise TypeError x = len(array[0]) for i in array: if len(i)!=x: raise KeyError except TypeError: print("error Not a 2d array.") return except KeyError: print("error Lists are not of equal size.") return self.array = array def __str__(self): return '[' + "\n ".join([str(arr) for arr in self.array]) + ']' def shape(self): return (len(self.array), len(self.array[0]))arrow_forward
- Write the following generic method using selection sort and a comparator: public static <E> void selectionSort(E[] list, Comparator<? super E> comparator) Write a test program that creates an array of 10 GeometricObjects and invokes this method using the GeometricObjectComparator introduced in Listing 20.5 to sort the elements. Display the sorted elements. Use the following statement to create the array: GeometricObject[] list1 = {new Circle(5), new Rectangle(4, 5), new Circle(5.5), new Rectangle(2.4, 5), new Circle(0.5), new Rectangle(4, 65), new Circle(4.5), new Rectangle(4.4, 1), new Circle(6.5), new Rectangle(4, 5)}; Also in the same program, write the code that sorts six strings by their last character. Use the following statement to create the array: String[] list2 = {"red", "blue", "green", "yellow", "orange", "pink"}; GeometricObjects import java.util.Comparator; public class GeometricObjectComparator implements Comparator<GeometricObject>,…arrow_forwardWrite the following generic method using selection sort and a comparator: public static <E> void selectionSort(E[] list, Comparator<? super E> comparator) Write a test program that creates an array of 10 GeometricObjects and invokes this method using the GeometricObjectComparator introduced in Listing 20.5 to sort the elements. Display the sorted elements. Use the following statement to create the array: GeometricObject[] list1 = {new Circle(5), new Rectangle(4, 5), new Circle(5.5), new Rectangle(2.4, 5), new Circle(0.5), new Rectangle(4, 65), new Circle(4.5), new Rectangle(4.4, 1), new Circle(6.5), new Rectangle(4, 5)}; Also in the same program, write the code that sorts six strings by their last character. Use the following statement to create the array: String[] list2 = {"red", "blue", "green", "yellow", "orange", "pink"}; GeometricObjectComparator and GeometricObjects in pictures.arrow_forwardJava programming question: please jelp with C 7.29 C 7.29: Revise the array list implementation given in Section 7.2.1 so that when the ac- tual number of elements, n, in the array goes below N/4, where N is the array capacity, the array shrinks to half its size.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
9.1: What is an Array? - Processing Tutorial; Author: The Coding Train;https://www.youtube.com/watch?v=NptnmWvkbTw;License: Standard Youtube License