What are the values of i and j obtained after the following code fragment is run?int i = 50;int j = 60;int count = 0;while (count < 5) {i = i + i;i = i + 1;j = j- 1;j = j - j;count++;}-cout << i<< endl << j;O a.i 50, j = 60O b.i 65, j= 45O C.i= 1631, j= 0O d. i = 1631, j 1DELL

To choose the correct output for the given program.

What are the values of i and j obtained after the following code fragment is run? int i = 50; %3D int j = 60; %3D int count = 0; while (count < 5){ i = i + i; i = i + 1; j = j - 1; j = j - j; %3D count++; }- cout << i<< endl << j; O a. i = 50, j = 60 O b.i = 65, j = 45 O C.i= 1631, j = 0 O d.i 1631, j 1

What are the values of i and j obtained after the following code fragment is run? int i = 50; %3D int j = 60; %3D int count = 0; while (count < 5){ i = i + i; i = i + 1; j = j - 1; j = j - j; %3D count++; }- cout << i<< endl << j; O a. i = 50, j = 60 O b.i = 65, j = 45 O C.i= 1631, j = 0 O d.i 1631, j 1

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

IN JAVA intends to auto generate test cases for a function foo that has k integers as input arguments, i.e., foo(int n1, int n2, …, int nk). Each argument belongs to a different equivalence class, which are stored in a downloadable Eq.txt file. The content is shown below and may be modified to handle more inputs and equivalence classes. 1, 15; 16, 30 1, 10; 11, 20; 21, 30 1, 5; 6, 10; 11, 15 1, 3; 4, 6; 7, 9; 10, 12 1, 12; 13, 24 For this file, the nth row describes the nth input. Take the second row for example. There are five input arguments. The data 1, 10; 11, 20; 21, 30 indicates that argument n2 has three equivalence classes separated by the semi-colons. Develop an internal method “private int check(int val)” that returns the equivalence class the val is in. The result of check(val = 3) for n2 will be 1 and check(val = 25) for n2 will be 3. Regarding the function foo, it computes the sum of the returned values by the check function for all input arguments. Follow the contents…
In Java: The program extends the representation for rational numbers Add a test class TestSimplifiedRational Define the simplified rationals r1..r4 and initialize them with 1/2, -3/9, 10/12 and 1 Compute sum=r1+r2 and diff=r4-r3 Simplify both results Check if they are equal, using equals and comparing their numerators and denominators. What do you observe? Compare r1 with r2, r3 and r4. Print all the rational numbers and partial results.
Rock-paper-scissors is a game for two players. Each player chooses an action without knowledge ofthe other’s choice. If the players choose the same action then there is a draw. Otherwise the winneris determined by the following rules: paper beats rock, rock beats scissors, and scissors beats paper. you are going to make a playable Rock-Paper-Scissors game and consider multiplayer tournaments. • Please make it a single Haskell file • Please put comments in your code to show which question you are answering with each piece ofcode. • You may create auxiliary functions if you like. You may use library functions from Haskell’sstandard library.• Please limit your line lengths to 100 characters max.Please use the following two data types which you can copy-and-paste into your code.data Action = Rock | Paper | Scissors deriving (Eq, Show)data Outcome = Player1Win | Player2Win | Draw deriving ShowAction represents a player’s chosen action and Outcome represents the outcome of playing a game
Consider the following Java-like program fragment. (There are line numbers to the left of each line of code that are not part of the program.)1 j = 1;2 y = 1.0;3 s = false;4 if (j < y) 5 { j = s; }6 else 7 { s = y; }8 y = j; Assume that the Java-like language uses dynamic typing and is strongly-typed. Widening conversions are allowed, but narrowing conversions are not. Which lines produce type errors?
This is for Java Write a recursive function that takes as a parameter a nonnegative integerand generates the following pattern of stars. If the nonnegative integer is 4,then the pattern generated is:**********Also, write a program that prompts the user to enter the number of lines inthe pattern and uses the recursive function to generate the pattern. Forexample, specifying 4 as the number of lines generates the above pattern. Java please
please put comments on these line of codes of what these do: private static void evenNumbersAboveDiagonal(int[][] arr) {for(int j=1;j<5;j++){for(int i=j-1;i>=0;i--){if(arr[i][j]%2 == 0)System.out.print(arr[i][j] + " ");}}System.out.println();}private static void oddNumbersBelowDiagonal(int[][] arr) {for(int i=0;i<5;i++){for(int j=0;i>j;j++){if(arr[i][j]%2==1)System.out.print(arr[i][j] + " ");}}System.out.println();}private static int sumOfElementsAboveDiagonal(int[][] arr) {int sum = 0;for (int j=1;j<5;j++) {for (int i=j-1;i>=0;i--) {sum += arr[i][j];}}return sum;}private static int sumOfElementsBelowDiagonal(int[][] arr) {int sum = 0;for(int i=0;i<5;i++){for(int j=0;i>j;j++) {sum += arr[i][j];}}return sum;}private static void elementsOfMainDiagonal(int[][] arr) {for (int i=0;i<5;i++) {for (int j=0; j<5;j++) {if(i == j)System.out.print(arr[i][j] + " ");}}System.out.println();}private static int sumOfPrime(int[][] arr) {int sum = 0;for(int…
Debug the following program and answer the following questions. #include <stdio.h> typedef struct node { int value; struct node *next; } node; int ll_has_cycle(node *first) { node * head = first; while (head->next) { head = head->next; if (head == first) return 1; } return 0; } void test_ll_has_cycle(void) { int i,j; node nodes[5]; for(i=0; i < sizeof(nodes)/sizeof(node); i++) { nodes[i].next = NULL; nodes[i].value = i; } nodes[0].next = &nodes[1]; nodes[1].next = &nodes[2]; nodes[2].next = &nodes[1]; printf("Checking first list for cycles. There should be a cycle, ll_has_cycle says it has %s cycle\n", ll_has_cycle(&nodes[1])?"a":"no"); printf("Checking length-zero list for cycles. There should be none, ll_has_cycle says it has %s cycle\n",…
What is wrong with the following code? int *p;. //Line 1int *q;. //Line 2 p = new int [5];. //Line 3 *p = 2; //Line 4 for (int i = 1; i < 5; i++). //Line 5p[i] = p[i-1] + i;. //Line 6 q = p;. //Line 7 delete [] p; //Line 8 for (int j = 0; j < 5; j++) //Line 9 cout << q[j] << " "; //Line 10 cout << endl; //Line 11
John Here Need correct java code for the following question
Java Question. I designed a function that is supposed to accept an int and return the int in reverse like so: Example 1: Input: x = 123 Output: 321 Example 2: Input: x = -123 Output: -321 Example 3: Input: x = 120 Output: 21 Example 4: Input: x = 0 Output: 0 My code appears to work for positive integers but returns an error when I enter a negative number. Any ideas how I can fix it? Thank you. import java.util.*; public class ReverseInteger{/**The Constructor sets @param var Description*/public static void main(String[] args){System.out.println("Please enter an integer: \n");Scanner keyboard = new Scanner(System.in);String input = keyboard.nextLine();int original = Integer.parseInt(input);int converted = reverse(original);System.out.println(converted);} public static int reverse(int x) // given in the problem set{ char[] chars = new char[String.valueOf(x).length()];String original1 = Integer.toString(x);boolean negative = false;int num_of_digits = 0;int reversed;for(int i = 0; i <…
I need some help with the analysisi of the following code: import java.util.*;public class Main { static void findSequence(int [] a, int l){ int x=1; int BNumber=a[0]; int y=0; int index=0; for(int n=1;n<l;n++){ if(a[n]!=a[n-1]){ if(x>y){ BNumber=a[n-1]; y=x; } x=1; }else { x++; } } if( x>y){ BNumber=a[l-1]; y=x; } index=y-1; System.out.println("The longest same number sequence starts at index "+index+" with "+y+" values of "+BNumber); } public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter a series of numbers ending with 0: "); String s=sc.nextLine(); String[] splitArr = s.split(" "); int[] array = new int[splitArr.length]; for (int i = 0; i <…
Consider the following C function or Java method (except for final printstatement the code is the same):void fun (int x) {int a, b, c, d;d = 1;for (a = 1 ; a <= x ; a ++) {b = a;c = 1;while (b > 0) {c &= b % 2;b /= 2;}d += c;}printf ("%d\n", d);}void fun (int x) {int a, b, c, d;d = 1;for (a = 1 ; a <= x ; a ++) {b = a;c = 1;while (b > 0) {c &= b % 2;b /= 2;}d += c;}System.out.println (d);} (a) What output will be printed for input value x = 8 ?(b) How many dierent input values x cause the function to print theresult 8 ?(c) Write a function with the same behavior but only one loop (of anytype) and no library call except for the print statement.