(a) Based on the following program segment, state what is wrong for finding the smallest input value. double smallest = 0; double input; while (cin >> input) { if (input < smallest) smallest = input; (b) Based on the following program segment, state what is wrong with the statements. int* p= new int(10]; P(10] = 5; delete(] p; (c) Based on the following program segment, state what is wrong with the statements. if (score_a = score_b) cout << "Tie" << endl;

(a) Based on the following program segment, state what is wrong for finding the smallest input value. double smallest = 0; double input; while (cin >> input) { if (input < smallest) smallest = input; (b) Based on the following program segment, state what is wrong with the statements. int* p= new int(10]; P(10] = 5; delete(] p; (c) Based on the following program segment, state what is wrong with the statements. if (score_a = score_b) cout << "Tie" << endl;

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 each of the following code snippets, data is copied from x to y. How many bytes of data arecopied? The answer should be a C expression.Example: int x[10], y[10];...for (int i=0; i<10; i++)x[i] = y[i];Answer: 10*sizeof(int)Example: int *x, *y; ...; y = x;Answer: sizeof(int*) (e) int x=10, y=x;(f) int x[10]; int *y = x;(g) int x[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};void f(int y[5]) { ... }int main() { f(x); }(h) int x[10], y[10];...memcpy(y, x, 5*sizeof(int));
Write down the output on the screen, when the following c program fragments of code are executed: 1st code int i,sum=0; for(i=10 ; i>0 ; i++){ sum+=i*i; i++; } printf("%d\n",sum); 2. code int a[3][3]={{1, 2, 3}, {4, 5, 6}, {7, 8 ,9}}; for (i=0 ; i<3 ; i++){ for (j=0 ; j<3 ; j++){ printf("%d ",a[j][i]); } printf("\n"); }
-check this code then, In python 3 make a code that shows the performance curve of the algorithm using time measurements 1. Approach: Non recursive: //include necessary header files#include <iostream>using namespace std;//main functionint main(){ int days,buy_on_this_day ,sell_on_this_day; //get number of days as input from user cout<<"Enter number of days: "; cin>>days; int stock_price[days]; for(int i=0;i<days;i++) { cout<<"Enter stock_price"; cin>>stock_price[i]; } int i=0; for(int i=0;i<days-1;i++) { //comparing current price with next day price and finding the minima while(i<days-1 && stock_price[i+1]<=stock_price[i]) i++; if(i==days-1) break; buy_on_this_day =i++; while(i<days && stock_price[i]>= stock_price[i-1]) i++; sell_on_this_day =i-1; cout<<buy_on_this_day <<" : index of the change…
1. What is the output of the following program segment: C++ int temp[5];for (int i = 0; i < 5; i++) temp[i] = 2 * i - 3; for (int i = 0; i < 5; i++) cout << temp[i] << " "; cout << endl;temp[0] = temp[4];temp[4] = temp[1];temp[2] = temp[3] + temp[0]; for (int i = 0; i < 5; i++) cout << temp[i] << " "; cout << endl;
Write a program in C++ to find the area of any triangle using Heron'sFormula: Side = (a+b+c)/2Area= sqrt (Side *(side-a) *(Side-b)*(Side-c)Note: use #include <math.h> to run/recognize the sqrt Sample Input:Input the length of 1st side of the triangle : 5Input the length of 2nd side of the triangle : 5Input the length of 3rd side of the triangle : 5Sample Output:The area of the triangle is : 10.8253
Let two words be given. At least how many steps must be taken to make one of these two words like the other? Each step can be one of the following 3 steps: 1- Drop a letter 2- Changing a letter 3- Add a letter (anywhere) Solve the question using only a brute force algorithm. Explain your solution and question write program in java language and calculate time complexity?
Write a program that performs arithmetic division. The program will use two integers, a and b (obtained by the user) and will perform the division a/b, store the result in another integer c and show the result of the division using cout. In a similar way, extend the program to add, subtract, multiply, do modulo and power using integers a and b. Modify your program so that when it starts, it asks the user which type of calculation it should do, then asks for the 2 integers, then runs the user selected calculation and outputs the result in a user friendly formatted manner.
Write the result or output of the following program. M=5 N=2 P-M/N P=M//N P-P+N P=P+M print(" First and second value of P is:" ,P,P) print("Third and Fourth value of P is:" P,P) M-M%N P-M+N print("M=",M,"N="N,"P-".P)
bitcount: Given x, set y to the number of bits in x that are 1. Write the code in Java. Provided input(s): x Permitted: 40 operations (may use !, ~, +, -, <<, >>, &, ^, |) Hint: The obvious solution would be something like ans=0; for(int i=0; i<32; i+=1) { a += x&1; x >>=1; } We don’t allow for loops, but even if you replace it with 32 copies that’s still 96 operations, and we only allow 40 for this task. The trick is to do things in parallel, treating a number like a vector of smaller numbers. Suppose I wanted to count the bits of an 8-bit number with bits abcdefgh. With a little shifting and masking I could make three numbers 0b00e00h 0a00d00g 0000c00f and add them to get xx0yy0zz where xx = a+b, yy = c+d+e, and zz = f+g+h. Extending this trick to several rounds on 32 bits will solve this problem.
Using Java Let |p|2 denote the size of p in bits. Your task is to generate a safe prime q, where q = 2p + 1, and p is also prime. However, the size of |p|2 = φ, where φ is obtained from the input. You are to write a program that asks for the size of φ, and then use the Lehman’s test to find a prime number p, and then use the Lehman’s test again to find the prime number q. The program is to output p, |p|2, q, |q|2
Trace this C code: What is the output of the following program segment? (Trace code and show your work) int i = 1, j = 1, k = 5; while (i+j < k) { printf("i = %d j = %d k = %d \n", i, j, k); i = j + k; j = i + k; k = i + j; } printf("i = %d j = %d k = %d \n", i, j, k);
Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible. Apply dynamic programming and memoization. Do not use recursion. Make sure ALL test cases return expected outputs. Hint: Approach the problem with 2D Dynamic Programming. Output FormatOutput one line containing a single integer containing the answer as described in the problem statement. This number must be output mod 109 + 7. Sample Input 0:3 9357 Sample Output 0:5 Sample Input 1:3 23151615 Sample Output 1:4 Sample Input 2:3 6123 Sample Output 2:8 The actual code: def solve(n,c,ws): # compute and return answer here # place 2 nested for loops here MOD = 1000000007n, c = list(map(int,input().rstrip().split(" ")))ws = [int(input().rstrip()) for i in range(n)]print(solve(n,c,ws))