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

java program: If in the ArrayStack, the first element that we push to the stack, is stored in location capacity – 1 (capacity is the capacity of the array theData) in the array theData and the subsequent elements that we push, we keep on adding before the last element added in the array. That is, in the constructor of class ArrayStack, we initialize the topOfStack to capacity and we write the push method as follows: public E push(E obj) { if (topOfStack == 0) reallocate(); topOfStack--; theData[topOfStack] = obj; return obj; } This push method can work but the if statement should be: if (topOfStack == theData.length - 1) reallocate(); This push method will work provided we modify the reallocate method. This push method can work, but topOfStack-- ; should come after theData[topOfStack] = obj; This push method can work, but topOfStack-- ; should be topOfStack++;
/*** CircularArrayQueue represents an array implementation of a queue in * which the indexes for the front and rear of the queue circle back to 0* when they reach the end of the array.* * @author ITSC2214* @version 4.0*/public class CircularArrayQueue<T> implements QueueADT<T>{private final static int DEFAULT_CAPACITY = 100;private int front, rear, count;private T[] queue; /*** Creates an empty queue using the specified capacity.* @param initialCapacity the initial size of the circular array queue*/public CircularArrayQueue (int initialCapacity){front = rear = count = 0;queue = (T[]) (new Object[initialCapacity]);}/*** Creates an empty queue using the default capacity.*/public CircularArrayQueue(){this(DEFAULT_CAPACITY);} /*** Adds the specified element to the rear of this queue, expanding* the capacity of the queue array if necessary.* @param element the element to add to the rear of the queue*/public void enqueue(T element){if (size() == queue.length)…
Implement generic class ArrayStack as discussed in the lectures having following methods: constructor, push, pop, peek, isEmpty, copy constructor, reallocate (private method). Also add following methods to this class: size: returns number of elements in the stack. contains: Search an element in the stack. If found returns true, else returns false. clear: Deletes all elements of the stack and make it empty stack.
java program: Implement generic class ArrayStack as discussed in the lectures having following methods: constructor, push, pop, peek, isEmpty, copy constructor, reallocate (private method). Also add following methods to this class: size: returns number of elements in the stack. contains: Search an element in the stack. If found returns true, else returns false. clear: Deletes all elements of the stack and make it empty stack. Implement generic class ArrayQueue as discussed in the lectures having following methods: constructor, copy constructor, offer, poll, peek, isEmpty, reallocate(private), iterator. Inner class Iter that implements interface Iterator having methods: constructor, hasNext, next. Also add following methods to the ArrayQueue class: size: returns number of elements in the queue. contains: Search an element in the stack. If found returns true, else returns false. clear: Deletes all elements of the stack and make it empty stack. Write a class called PalindromeChecker…
java program : What does this method do? public class StackTest { public static<E> void question(ArrayStack<E> s1, ArrayStack<E> s2) { if(s1.isEmpty() || !s2.isEmpty()) return; while(! s1.isEmpty()) { s2.push(s1.pop()); if (!s1.isEmpty()) s1.pop(); } } } s2 will contain the alternate elements of s1 in the reverse order. s2 will contain the same copy of s1 in the reverse order. s2 will contain the same copy of s1 in the original order. s2 will contain the alternate elements of s1 in the original order
Java 1. Implement ArrayUnorderedList<T> class which will extend ArrayList<T> by defining the following additional methods(i) public void addToFront(T element); //Adds the specified element to the front of the list.(ii) public void addToRear(T element); //Adds the specified element to the rear of the list.(iii) public void addAfter(T element, T target); //Adds the specified element after the specified target element.a. Create an object of ArrayUnorderedList<T> class and perform some add, remove, and search operations and finally print the entire Stack.
Requirements: Use Java Programming only. Show screenshots of your work. this is the second time I posted this since the previous answer is very wrong. 6. Write method public static int linearSearch(int [] arr, ine key) which returns the largest index such that arr[index] matches the key. If there is match, returns -1. 7. Write method public static double average(int [] arr) which returns the average of all elements in given array arr. Assume that arr has length at least 1. 8. Write method public void crazyPrint(String sentence, int n) which print out the given sentence n times. Assume n is positive integer.
Problem (class MergeSalary)First, write a Java method merge that takes as parameter a non-empty double array representingemployees’ salaries. The method merges the values of every 2 adjacent elements. put themerged values at the beginning of the array, and put 0 in the remaining positions. Suppose thatthe original array will contain an even number of elements.Second, write two java methods readArray(int[]a) and printArray(int[]a) thatreads/writes the elements of an array passed in parameter from/to the standard input/output.Finally, Use the following main method to test your different methods:public class MergeSalary{ private static Scanner input = new Scanner(System.in); public static void main(String[] args) { double[] salaries = new double[10]; System.out.print("Enter 10 salaries: "); readArray(salaries); merge(salaries); System.out.print("Salaries after merge: "); printArray(salaries); }}
2. Using the Hashtable class, write a spelling checker program that readsthrough a text file and checks for spelling errors. You will, of course, haveto limit your dictionary to several common words.3. Create a new Hash class that uses an arraylist instead of an array for thehash table. Test your implementation by rewriting (yet again) the computerterms glossary application.
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…
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…
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: