public static int[] goodResize(int[] list, int newSize) { assert list != null && newSize >= 0 : "failed precondition"; int[] result = new int[newSize]; int limit = Math.min(list.length, newSize); for(int i = 0; i < limit; i++) { result[i] = list[i]; } return result; } **Note: Software testing & quality assurance Question: Create a control flow graph based on the coding above and find all these paths: Statement coverage Branch coverage Predicate coverage

public static int[] goodResize(int[] list, int newSize) { assert list != null && newSize >= 0 : "failed precondition"; int[] result = new int[newSize]; int limit = Math.min(list.length, newSize); for(int i = 0; i < limit; i++) { result[i] = list[i]; } return result; } **Note: Software testing & quality assurance Question: Create a control flow graph based on the coding above and find all these paths: Statement coverage Branch coverage Predicate coverage

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

An array list is sortedwith a constant interval if its elements are arranged in an ascending order and thereis a constant difference between adjacent elements. Write a method that returnstrue if list is sorted with a constant interval, using the following header:public static boolean isSortedConstantInterval(int[] list)Write a test program that prompts the user to enter a list of integers. Note the firstnumber in the input indicates the number of elements in the list. This number isnot part of the list. Enter list: 5 2 5 6 9 10 ↵EnterThe list is not sorted with a constant intervalEnter list: 5 2 4 6 8 10 ↵EnterThe list is sorted with a constant interval.
public class CustomLinkedList { public static int findMax(IntNode headObj) { /* Type your code here */ } public static void main(String[] args) { IntNode headObj; IntNode currObj; IntNode lastObj; int i; int max; // Create head node headObj = new IntNode(-1); lastObj = headObj; // Add nodes to the list for (i = 0; i < 20; ++i) { currObj = new IntNode(i); lastObj.insertAfter(currObj); lastObj = currObj; } max = findMax(headObj); System.out.println(max); }}
import java.util.ArrayList;import java.util.Arrays; public class PS07A{/*** Write the method named mesh.* * Start with two ArrayLists of String, A and B, each with * its elements in alphabetical order and without any duplicates. * Return a new list containing the first N elements from the two * lists. The result list should be in alphabetical order and without * duplicates. A and B will both have a size which is N or more. * Your solution should make a single pass over A and B, taking * advantage of the fact that they are in alphabetical order, * copying elements directly to the new list.* * Remember, to see if one String is "greater than" or "less than" * another, you need to use the compareTo() method, not the < or > * operators. * * Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]* * @param a an ArrayList of String in alphabetical…
An array list is required to be sorted in ascendingorder. Write a method that returns true if list is sorted, using the following header:public static Bboolean isSorted(int[] list)Write a test program that prompts the user to enter a list of integers. Note the firstnumber in the input indicates the number of elements in the list. This number isnot part of the list. Enter list: 5 2 5 6 9 10 ↵EnterThe list is sorted Enter list: 5 2 5 6 1 6↵EnterThe list is not sorted.
import java.util.ArrayList;import java.util.Arrays;public class PS{/*** Write the method named mesh.** Start with two ArrayLists of String, A and B, each with* its elements in alphabetical order and without any duplicates.* Return a new list containing the first N elements from the two* lists. The result list should be in alphabetical order and without* duplicates. A and B will both have a size which is N or more.* Your solution should make a single pass over A and B, taking* advantage of the fact that they are in alphabetical order,* copying elements directly to the new list.** Remember, to see if one String is "greater than" or "less than"* another, you need to use the compareTo() method, not the < or >* operators.** Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]** @param a an ArrayList of String in alphabetical order.* @param b an…
Consider the interface below:import java.util.NoSuchElementException; public interface MyList<E> { public int getSize(); public void insert(E data) throws ListOverflowException; public E getElement(E data) throws NoSuchElementException; public boolean delete(E data); // returns false if the data is not deleted in the list public boolean search(E data); // returns index of data, else -1 is return}a. Use an array object to store the elements of the list object. The program should be able to show its size, get element, delete, and search from the array. b. This array object will have a fixed size of five (5) and that an attempt to insert an element into the array when full will result to a ListOverflowException.
Consider the interface below:import java.util.NoSuchElementException; public interface MyList<E> { public int getSize(); public void insert(E data) throws ListOverflowException; public E getElement(E data) throws NoSuchElementException; public boolean delete(E data); // returns false if the data is not deleted in the list public boolean search(E data); // returns index of data, else -1 is return}a. Use an array object to store the elements of the list object. The program should be able to show its size, get element, delete, and search from the array. b. If the array is full and an element is to be inserted, a new array object with a size that is twice than the “old” array will be created. All the elements of the “old” array will be copied to the new array before inserting the new element.
Write a Java class Course for dealing with courses. Your class must have the following features: Course - name: String - lineNumber: int - symbol: String - sections: ArrayList + Course() + Course(name: String, lineNumber: int, symbol: String) + getName(): String + getLineNumber(): int + getSymbol(): String + getSections(): ArrayList + addSection(section: Section): void + Override toString() method: you have to return needed data Fields values. addSection(section: Section) method add a section (number and the teacher for this section) to the array list of sections. Note: sectionNumber will be generated automatically. Write a Java class Section for dealing. Your class must have the following features: Section - number: int - teacher: Teacher - students: ArrayList + Section() + Section(number: int, techer: Teacher) + getNumber(): int + getTeacher(): Teacher + getStudents(): ArrayList + addStudent(student: Student): void + Override toString() method: you have to return needed data…
Lab Goal : This lab was designed to teach you more about sorting data with the built-in java sorts. Lab Description : Take a list of words and output the list in ascending order. Use Arrays.sort().Sample Data : abc ABC 12321 fred alexandera zebra friendly acrobatics 435 TONER PRinTeRb x 4 r s y $123 ABC abc 034 dog cat sally sue bob 2a2Sample Output : word 0 :: 12321word 1 :: ABCword 2 :: abcword 3 :: alexanderword 4 :: fred word 0 :: 435word 1 :: PRinTeRword 2 :: TONERword 3 :: aword 4 :: acrobaticsword 5 :: friendlyword 6 :: zebra word 0 :: $word 1 :: 4word 2 :: bword 3 :: rword 4 :: sword 5 :: xword 6 :: y word 0 :: 034word 1 :: 123word 2 :: 2a2word 3 :: ABCword 4 :: abcword 5 :: bobword 6 :: catword 7 :: dogword 8 :: sallyword 9 :: sue I need a code class and a runner class
def get_column_sum(index: int, stations: List["Station"]) -> int: """Return the sum of the values at the given index from each inner list of stations. Precondition: the items in stations at the position that index refers to are ints. >>> get_column_sum(BIKES_AVAILABLE, SAMPLE_STATIONS) 23 >>> get_column_sum(DOCKS_AVAILABLE, SAMPLE_STATIONS) 34 """
1. Write a Java program to create a new array list, add some colors (string) and print out the collection. The list should contain color "green". 2. Change the previous program to insert an element into the array list at the first position. 3. Change the application to print out the index of color "green". 4. Change the previous application to replace "green" value with "yellow". 5. Change the previous application to remove the third element from the list. 6. Change the application to sort the list of colors. 7. Change the application to shuffle the list of colors. 8. Change the application such that it swaps colors "Orange" and "Red". 9. Change the application to copy the current list into a new list. 10. Change the application to trim the capacity of the initial array list to the current list size. 11. Change the application to empty the second list. 12. Change the application to test (print out a message) if the second list is empty. 13. Change the application to increase the…
in python class name: Runner function within a class: def __getitem__(self, lhs: Union[int. list[bool]]) -> Union[float, Runner]: The function should take a list[bool] and will return a new Runner object containing only the filtered values Example : c = Runner([1.0, 2.0, 3.0, 4.0, 2.0, 1.0]) filter = c > 2.0 print(filter) # Output: [False, True, True, False, False]) d = c[filter] print(d) # Output: Runner([3.0, 4.0])