Assume that the following method is added to class ArrayStack. If stack "this object" contains the following values in the array theData:2index135Value2471012What will be the contents of stack s?public void question(ArrayStack s){if(topOfstack = = -1 || (topOfstack + 1) %2 !=0) return;E all = (E[) new Object[topOfstack + 1];for (int i = 0; i <= topOfstack/2; i++){a[i]= theData[i] + theData[topOfStack - i];}for (int i = topOfstack/2; i>= 0; i-)5.push(a[i]);}a. Stack s will contain:[top] 14 12 17.b. Stack s will contain:[top] 6 17 20.O. Stack s will contain:O d. Stack s will contain:[top] 20 17 6.[top] 17 12 14.

A stack is an Abstract Data Type (ADT), typically utilized in maximum programming languages. It is…

Assume that the following method is added to class ArrayStack. If stack "this object" contains the following values in the array theData: index 1 2 5 Value 4 7 10 8 12 What will be the contents of stack s? public void question(ArrayStack s) { if(topOfstack == -1 || (topOfstack + 1) %2 !=0) return; E al] = (E[]) new Object[topOfStack + 1]; for (int i = 0; i <= topOfstack/2; i++) { ali) = theData[i] + theData[topOfStack - i]; } for (int i = topOfstack/2; i >= 0; i--) s.push(a[i]); } a. Stack s will contain: b. Stack s will contain: [top] 14 12 17. [top] 6 17 20. O c. Stack s will contain: [top] 20 17 6. d. Stack s will contain: [top] 17 12 14.

Assume that the following method is added to class ArrayStack. If stack "this object" contains the following values in the array theData: index 1 2 5 Value 4 7 10 8 12 What will be the contents of stack s? public void question(ArrayStack s) { if(topOfstack == -1 || (topOfstack + 1) %2 !=0) return; E al] = (E[]) new Object[topOfStack + 1]; for (int i = 0; i <= topOfstack/2; i++) { ali) = theData[i] + theData[topOfStack - i]; } for (int i = topOfstack/2; i >= 0; i--) s.push(a[i]); } a. Stack s will contain: b. Stack s will contain: [top] 14 12 17. [top] 6 17 20. O c. Stack s will contain: [top] 20 17 6. d. Stack s will contain: [top] 17 12 14.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

TEST23 If(j< array.length)return(array[j] + Test 23(array ; j+1) else return 0; } 6,11,2,7,3 What is returned by TEST23(array,0)?
Write a loop that counts how many elements in an array are equal to zero. arrays.cpp 1 #include // sizet 2 int countZeros (const int values[], size_t size) { int count = 0; 3 4 for (int i; i using namespace std; 3 2 4 int countZeros(const int values[], size_t size); 5 int main() { int a[] = {1, 2, 0, 3}; cout <« countZeros (a, 4) <« endl; cout « "Expected: 1" « endl; 6 7 8 9 10 11 int b[] = {0, 2, 0, 3}; cout <« countZeros (b, 4) <« endl; cout « "Expected: 2" « endl; 12 13 14 15 int cl] -{1, 0, θ, 0, 0 ; cout <« countZeros (c, 5) <« endl; cout « "Expected: 4" « endl; 16 17 18 19 } CodeCheck Reset Testers Running Tester.cpp pass fail fail 1 Expected: 1 Expected: 2 Expected: 4 Score 1/3
The ArrayList is created using the following syntax: String[] array = {"red", "green", "blue"}; ArrayList list Display all the elements of this list using: a) foreach loop b) foreach method with lambda := new ArrayList(java.util.Arrays.asList(array));
The CopyTo method copies the contents of a stack into an array. The arraymust be of type Object since that is the data type of all stack objects. Themethod takes two arguments: an array and the starting array index to beginplacing stack elements. The elements are copied in LIFO order, as if they werepopped from the stack. write a short code fragment demonstrating a CopyTomethod call:
X40: sum3 Given an array containing three ints, return the sum of all the elements. Examples: sum3({1, 2, 3}) -> 6 sum3({5, 11, 2}) -> 18 Your Answer: 1 public int sum3(int[] nums) 2{ 3 4} Check my answer! Reset Next exercise
public ArrayList<Bus> loadBuses(String bfile) { ArrayList<Bus> buses = new ArrayList<>(); try { Scanner scanner = new Scanner(new File(bfile)); while (scanner.hasNextLine()) { String[] line = scanner.nextLine().split(" "); if (line.length < 4 || line.length > 7) { throw new IllegalArgumentException("Invalid input format"); } String name = line[1]; int size = Integer.parseInt(line[1]); int price = Integer.parseInt(line[2]); int level = Integer.parseInt(line[3]); Ministry ministry = null; if (line.length > 5) { ministry = new Ministry(line[5]); } int competitorArea, numSecurity, barArea; Bus bus; SportsBus sportsBus; PartyBus partyBus;…
I have implemented a stack using arrays. The array is 5 elements long and is called examstack. The contents are: examstack[0] = 36 examstack[1] = 49 examstack[2] = 7 examstack[3] = 67 examstack[4] = 9 If I did a Pop what would be returned? 9 or 36 09 07 O 67 O 9 or 67 36 or 49 O 36 49
Java coding Can you create a remove method that removes and returns an element from an index in an array? Thanks.
Assume that Mylist is an object of class type ArrayList of Java (similar to KWArrayList class) and it has the following values: "A1" "B1" "C1" "D1" "E1" the instruction Mylist.remove(3); will change the list to A) "A1" "B1" "D1" "E1" в) "А1" "B1" "C1" "E1" (c) "B1" "C1" "D1" "E1"
Mergesort is a method that takes an integer array and returns a sorted copy of the same array. It first sorts the left half of the input array, then the right half of the input array, and finally merges the two sorted halves together into a sorted version of the input array. Implement the mergesort method public static int[] mergesort(int[] arr) { return new int[] {-1}; } *must be in this layout and done in java
6. the grade is under 20 which is outlier, remove it from the array list. 7. Print array list using System.out.println() 8. Use indexOf to print index of 80. 9. Use get function. 10. What is the difference between get and index of? 11. Print the values of the array list using Iterator class. 12.. Delete all the values of the array list using clear function. 13. Print all the values of the array after you execute clear using System.out.println(). what is the result of using clear function? 14. What is the shortcoming of using array List?
Write a function that is passed an array of numbers and returns a hash table containing the minimum, maximum and average value. @{min=????; max-???; average=???} Test by passing the function 3 different arrays of randomly generated numbers. If the array is empty set all 3 values to zero. (3)