Consider the following pseudocode ALGO which takes as input an array A containing n integers.Assume that array indexing begins at 0.5. For each of the following statements about the running time of ALGO, insert a T in the text box if it is True and F if it is false. ALGO (A)1: x = A[0]2: p = -13: r = n4: while(True) {do {5:6:7:8:9:10:11:10:11:12:13:14:15:}P = p + 1} while (A[p] < x)do {r = r - 1} while (A[r] > x)if (p >= r ) {return r}exchange A[p] and A[r] 2. For each of the following statements about the behavior of ALGO, insert a T in thetext box if it is True and F if it is false.A. At the end of each iteration of the while loop of Line 4, each index of A smallerthan p contains an integer smaller than x.B. At the end of each iteration of the while loop of Line 4, each index of A largerthan r contains an integer larger than or equal to x.C. When ALGO terminates, the integer at index r is x.

Name: Consider the following pseudocode ALGO which takes as input an array A
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Consider the following pseudocode ALGO which takes as input an array A containing n integers.Assume that array indexing begins at 0.5. For each of the following statements about the running time of ALGO, insert a T in the text box if it is True and F

Given: ALGO(A)x = A[0]p = -1r = nwhile (True) { do { p = p + 1 } while (A[p] < x)…

Engineering

Computer Science

2. For each of the following statements about the behavior of ALGO, insert a T in the text box if it is True and F if it is false. A. At the end of each iteration of the while loop of Line 4, each index of A smaller than p contains an integer smaller than x. B. At the end of each iteration of the while loop of Line 4, each index of A larger than r contains an integer larger than or equal to x. C. When ALGO terminates, the integer at index r is x.

2. For each of the following statements about the behavior of ALGO, insert a T in the text box if it is True and F if it is false. A. At the end of each iteration of the while loop of Line 4, each index of A smaller than p contains an integer smaller than x. B. At the end of each iteration of the while loop of Line 4, each index of A larger than r contains an integer larger than or equal to x. C. When ALGO terminates, the integer at index r is x.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

x <- bubblesort(sample(1:6, size=5, replace=T)) if (x[1]==x[5]){ hand <-"Yahtzee" } else if (x[1]==x[4] ] x[2]==x[5]) { hand <- "4ofKind" } } else { hand <-"Chance" } The above code lays this out for Yahtzee and 4 of a kind. Find statements that work for the rest and put this into a function called get hand , which returns what type of hand was rolled from a sorted roll of five dice. Make sets of rolls and test them to make sure they work. Note that above we use an else if, which allows us to test multiple conditions in an if-else statement.
A = {1,2,3} B = {1,2,3} C = {5,6,7} D = {0,1,2,3,4,5} Is A = C?
void deleteRange( int from, int to) { int i, j = 0; for (i = 0; i < counter; i++) { if (i <= from - 1 || i >= to + 1) { A[j] = A[i]; j++; } } for (int i = 0; i < j; i++) cout << A[i] << " "; } Above method deletes range of elements from an array. Please explain the logic of above code in simple english (algorithm and comments).
void deleteRange( int from, int to) {int i, j = 0;for (i = 0; i < counter; i++) {if (i <= from - 1 || i >= to + 1) {A[j] = A[i];j++;}}for (int i = 0; i < j; i++)cout << A[i] << " ";} Above method deletes range of elements from an array. Consider array A[] globally declared and counter is its size. Please explain the logic of above code in simple english (algorithm and comments).
4. A={3,4}, B={4,5}. An B= AUB= A-B= A OB= AXB=
int binsearch (int X , int V [] , int n ) { int low , high , mid , i ; low = 0; high = n - 1; for ( i = 0; i < high ; i ++) { if( V[ i ] > V [ i +1]) return -2; } while ( low <= high ) { mid = ( low + high )/2; if ( X < V [ mid ]) high = mid - 1; else if ( X > V [ mid ]) low = mid + 1; else return mid ; } return -1; } This code takes as input a sorted array V of size n, and an integer X, if X exists in the array it will return the index of X, else it will return -1. 1. Draw a CFG for binsearch(). 2. From the CFG, identify a set of entry–exit paths to satisfy the complete statement coverage criterion. 3. Identify additional paths, if necessary, to satisfy the complete branch coverage criterion. 4. For each path identified above, derive their path predicate…
A/ find code optimization method to this code and then find type to this code 1- For(i=1;i
C++ A robot is initially located at position (0; 0) in a grid [?5; 5] [?5; 5]. The robot can move randomly in any of the directions: up, down, left, right. The robot can only move one step at a time. For each move, print the direction of the move and the current position of the robot. If the robot makes a circle, which means it moves back to the original place, print "Back to the origin!" to the console and stop the program. If it reaches the boundary of the grid, print \Hit the boundary!" to the console and stop the program. A successful run of your code may look like:Down (0,-1)Down (0,-2)Up (0,-1)Left (-1,-1)Left (-2,-1)Up (-2,0)Left (-3,0)Left (-4,0)Left (-5,0)Hit the boundary! or Left (-1,0)Down (-1,-1)Right (0,-1)Up (0,0)Back to the origin! About: This program is to give you practice using the control ow, the random number generator, and output formatting. You may use <iomanip> to format your output. You may NOT use #include "stdafx.h".
Computer Engineering HandsOn Lab: The Government of United States of America has decided to issue new currency notes with special protection features to so as to commemorate a great mathematician. They have decided to issue notes summing up to N and all the sums from 1 to N should only made by selecting some of the notes in only one unique way. With n = 5 the sets {1,1,1,1,1}, {1,2,2}, {1,1,3} are valid. Your task is to design a C++ code that output the solution in one line. Sample Input - 100 Sample Output - 3
Deliverable #2: How many operations in nested for loops? Implement the following psuedocode as the function two_dimensional_loop (n) in the cell below: count = 0 for i = 0 to n-1 : for j = i to n-1 : count = count + 1 return count ► def two_dimensional_loop(n) : # complete to satisfy the instructions and implement the pseudocode || return 0 expectEqual (two_dimensional_loop (520),135460) expectEqual (two_dimensional_loop (1234), int(1234* (1234+1)/2)) 个 ↓
Let A = {a, b, c} and B = {u, v}. Write a. A × B b. B × A
4. *Fill in with =, >, >=, <, <=, n/a for the relationship between A and B: Value A 0 -1 2147483647 2147483647U -1 (unsigned)-1 2147483647 2147483647 A ??? B Value B OU OU -2147483648 -2147483648 -2 -2 2147483648U (int)2147483648U