In class lab 3 - Exercise 18.3 GCD – page 729Write a class, ComputeGCD, which will do thefollowing:The main method will:Prompt the user for two numbers.• Call the gcd method:public int gcd (int m, int n)- The gcd method will use the definition below torecursively return the gcd of m and n:gcd(m, n) = n if m % n =gcd(m, n) = gcd(n, m % n); otherwise;0;40

Program approach - Import the essential java libraries. Declare the class named ComputeGCD. Define…

Answered: In class lab 3 - Exercise 18.3 GCD –…

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

Need help writing the method: getWaitlistedIDs() – returns an array of type int[], namely the ids of students in the waitlist. public int[] getWaitlistedIDs() { // insert solution here and modify the return statement return null; } For context public class Course { public String code; public int capacity; public SLinkedList<Student>[] studentTable; public int size; public SLinkedList<Student> waitlist; public Course(String code) { this.code = code; this.studentTable = new SLinkedList[10]; this.size = 0; this.waitlist = new SLinkedList<Student>(); this.capacity = 10; } public Course(String code, int capacity) { this.code = code; this.studentTable = new SLinkedList[capacity]; this.size = 0; this.waitlist = new SLinkedList<>(); this.capacity = capacity; }
Write a Java class called ContainsInRange. This class defines a method called contains(), which takes as parameters an integer array a, an integer x, an int called start, as well as an int called end, and returns a boolean which is true if and only if x occurs in a at a position which is greater than or equal to start, and less than end. You must validate that start is less than or equal to end, and that both start and end are greater than or equal to 0, and less than or equal to a.length. Repeat the operation often.
•Write a class, ComputeGCD, which will do the following: –The main method will: •Prompt the user for two numbers. •Call the gcd method: public int gcd (int m, int n) –The gcd method will use the definition below to recursively return the gcd of m and n: gcd(m, n) = n if m % n = 0; gcd(m, n) = gcd(n, m % n); otherwise; Enter the first number 10 Enter the second number 15 The greatest common divisor is 5
Complete the following method in java that takes an array and a key(int value) that traverses the input parameter array with a nested for loop and finds the number of pairs of the numbers in the array that add up to the val(key) parameter. I'm not sure if this is correct: public static int nestedLoopsTwoSum(int[] X, int val) {int count = 0;for (int i = 0; i < X.length; i++){int k;for (k = 0; k < i ; k++){if ((X[i] + X[k]) == val){count++;}}}return count;}
class TenNums {private: int *p; public: TenNums() { p = new int[10]; for (int i = 0; i < 10; i++) p[i] = i; } void display() { for (int i = 0; i < 10; i++) cout << p[i] << " "; }};int main() { TenNums a; a.display(); TenNums b = a; b.display(); return 0;} Write a copy constructor for the above class TenNums. Make sure it performs deep copy. Group of answer choices TenNums(const TenNums& b) { p = b.p;} TenNums(const TenNums& b) { p = new int[10]; for (int i = 0; i < 10; i++) p[i] = b.p[i];} TenNums(const TenNums b) { p = new int[10]; for (int i = 0; i < 10; i++) p[i] = b.p[i];} TenNums(const TenNums b) { p = b.p;}
pet shop wants to give a discount to its clients if they buy one or more pets and at least five other items. The discount is equal to 20 percent of the cost of the other items, but not the pets.Use a class Item to describe an item, with any needed methods and a constructor public Item(double price, boolean isPet, int quantity)An invoice holds a collection of Item objects; use an array list to store them. In the Invoice class, implement methods public void add(Item anItem)public double getDiscount()Write a program that prompts a cashier to enter each price and quantity, and then a Y for a pet or N for another item. Use a price of –1 as a sentinel. In the loop, call the add method; after the loop, call the getDiscount method and display the returned value.
The Utilities class contains three independent static methods and contains no fields (none should be added).The Utilities class contains the following 3 static methods that you must implement:1. QWERTY – If the argument is null, the length is anything other than 6, or if the element values are outside the inclusive boundof 1 to 7 throw the IllegalArgumentException with the message "Invalid parameter". Otherwise return a char array that hasinput[0] instances of 'Q', followed by input[1] instance of 'W', ....followed by input[5] instances of 'Y'. The length ofthe returned array should be the exact size needed to accommodate all the letters (no smaller or larger).2. turnTo1D – You can assume that the parameter array has at least 1 row and all rows are int array (might be an empty int array)and the parameter delta is a positive integer. The method returns a 1D array (possibly empty array) with all the values inarray that are in the range of the inclusive bound [value – delta to value +…
class TenNums {private: int *p; public: TenNums() { p = new int[10]; for (int i = 0; i < 10; i++) p[i] = i; } void display() { for (int i = 0; i < 10; i++) cout << p[i] << " "; }};int main() { TenNums a; a.display(); TenNums b = a; b.display(); return 0;} Continuing from Question 4, let's say I added the following overloaded operator method to the class. Which statement will invoke this method? TenNums TenNums::operator+(const TenNums& b) { TenNums o; for (int i = 0; i < 10; i++) o.p[i] = p[i] + b.p [i]; return o;} Group of answer choices TenNums a; TenNums b = a; TenNums c = a + b; TenNums c = a.add(b);
JAVA PROGRAM Write a program that asks the user to input two integers a and b. Then create an array that has all integer from a to b. Print out the array. (Don’t forget to consider the situation of a=b, a<b, and a>b.) Example 1: Input two numbers: 6 2 Array is [6, 5, 4, 3, 2] Example 2: Input two numbers: 4 8 Array is [4, 5, 6, 7, 8] Pass the above array as a parameter to a method called average and return the average and print it out in the main method. (Do not use Math library to get the average.)
Write a Java class called MostOftenOccurring. This class defines a method called occursMostOften(), which takes as its only parameter an array of int called a and returns an int representing the value which occurs most often in a. If there is a tie, display the value which occurs first in a among those that occur most often. Repeat the operation often.
WITE JAVA CODE JUST TO THE GIVEN CODE BELOW! TESTS GIVE ERROR FOR SHRINK AND add remove 100 values ALSO, DO IT BY CHECKING THE MAIN CLASS WITHOUT CHANGING IT class Queue<T> { private T[] a = (T[]) new Object[1]; private int N = 0; public boolean isEmpty() { return N == 0; } public int size() { return N; } private void resize(int capacity) { T[] temp = (T[]) new Object[capacity]; for (int i = 0; i < N; i++) { temp[i] = a[i]; } a = temp; } public void enqueue(T item) { if (N == a.length) resize(2*a.length); a[N++] = item; } public T dequeue() { T item = a[--N]; a[N] = null; if (N > 0 && N == a.length/4) resize(a.length/2); return item; } // this method is for unit testing; don't touch public int getArraySize(){ return a.length; }} public class Main { public static void main(String[] args) { Queue<Integer> myQueue = new Queue<Integer>(); int i; i = 1; myQueue.enqueue(i);…
A Java Program Write a method called samePosition in a class called StackExt that receives two parameters st1 and st2 of type ArrayStack and a third parameter pos of type int. The method returns true, if stack st1 and st2 contains the same value in position pos. Otherwise, the method returns false. Assume that both stacks st1 and st2 contain same number of elements. Assume that the position of the top element is 0 and increases by 1 for each subsequent element. The elements of both stacks st1 and st2 must remain in the original relative positions in the stacks at the end of the method. Use common stack operations only such as push, pop, peek, isEmpty, constructor and copy constructor. You can create temporary objects of type ArrayStack in your method. Example: top st1: 4 5 3 10 8 st1: 5 9 4 10 1 If the pos is 3, then both stacks contain 10 in position 3. The method returns true. If the pos is 1, then st1 contains 5 and st2…

SEE MORE QUESTIONS

Recommended textbooks for you

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

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

SEE MORE TEXTBOOKS