1. For Questions 1 (a - c) assume the following environment.#define MAX 50int a [MAX], i, j, temp;(a) What is the effect of this program segment?for (i = 0; i < MAX / 2; ++i){temp = a[i];a [i] =a [MAX - i - 1];a [MAXi - 1] = temp;}(b) What is the effect of this program segment?for (i = 0; i < MAX - 1; ++i)if (a[i]> a[i+1]){temp = a[i];a[i] = a[i+1];a[i+1] = temp;}(c) What is the effect of this program segment?temp = 0;for (i = 1; i < MAX; ++i)if (a[i] > a [0])++temp;

a) By iterating the for loop and interchanging the last and first elements by increasing the i value…

1. For Questions 1 (a - c) assume the following environment. #define MAX 50 int a [MAX], i, j, temp; (a) What is the effect of this program segment? for (i = 0; i < MAX / 2; ++i) { temp = a[i]; a[i] = a [MAX i 1]; - a [MAX - i 1] = temp; }

1. For Questions 1 (a - c) assume the following environment. #define MAX 50 int a [MAX], i, j, temp; (a) What is the effect of this program segment? for (i = 0; i < MAX / 2; ++i) { temp = a[i]; a[i] = a [MAX i 1]; - a [MAX - i 1] = temp; }

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 C programming: Write a main() function using the following requirements:• Define a SIZE constant (the value is irrelevant, but for testing, you may want to keep it small enough – no bigger than 5)• Create an array of course pointers using SIZE• Dynamically allocate each element of the array• Call inputAllCourses()• Call printAllCourses().
#include using namespace std; /*complete the function to multiple the megabytes, don't forget to set the parameter*/ void promotion() { //taking multiplier as input int multiplier; cin>>multiplier; } int main() { //getting initial count of megabytes int megabytes; cin >> megabytes; //printing the count of megabytes before the promotion cout << "Before the promotion: " << megabytes << endl; //complete the function call promotion(); //printing the count of megabytes after the promotion cout << "After the promotion: " << megabytes << endl; return 0; }
Python only** define the following function: 1. This function must add a task to a checklist, setting its initial value to False. It will accept two parameters: the checklist object to add to, and the task name to add. In addition to adding the task, it must return the (now modified) checklist object that it was given. There is one issue, however: a task cannot be added to a checklist if the name requested is already being used by another task in that checklist. In that case, this function must print a specific message and must return None Define addTask with 2 parameters Use def to define addTask with 2 parameters Use a return statement Within the definition of addTask with 2 parameters, use return _ in at least one place. Do not use any kind of loop Within the definition of addTask with 2 parameters, do not use any kind of loop.
Data structure/ C language / Graph / Dijkstra’s algorithm implement a solution of a very common issue: howto get from one town to another using the shortest route.* design a solution that will let you find the shortest paths betweentwo input points in a graph, representing cities and towns, using Dijkstra’salgorithm. Your program should allow the user to enter the input filecontaining information of roads connecting cities/towns. The programshould then construct a graph based on the information provided from thefile. The user should then be able to enter pairs of cities/towns and thealgorithm should compute the shortest path between the two cities/townsentered.Attached a file containing a list of cities/towns with the following data:Field 1: Vertex ID of the 1st end of the segmentField 2: Vertex ID of the 2nd of the segmentField 3: Name of the townField 4: Distance in KilometerPlease note that all roads are two-ways. Meaning, a record may representboth the roads from feild1 to field2…
computer programing (C++) i need to get an algorithm ( flowchart and pseudocode) #include<iostream> //header file using namespace std; float function1(float, float[]); //function prototype for function1 float function2(float, float[]); //function prototype for function2 float function3(float[], float[]); //function prototype for function3 int function4( ); int main( ) //main function { float vin, R[4], i[4], v[4]; //declare float variables which are R,i and v int choice; //declare int variables for choice cout<<"Enter vin: \n"; //ask user for enter vin cin>>vin; //read the input cout<<"Enter R1, R2, R3: \n"; //ask the user enter value R1,R2, and R3 cin>>R[1]>>R[2]>>R[3]; //read input cout<<"Select from the menu: \n"; //ask user to select the menu…
#include<bits/stdc++.h> using namespace std; void bubbleSort(int arr[], int n) { for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } } int binarySearch(int arr[], int l, int r, int x, int& comp) { comp++; if (r >= l) { int mid = l + (r - l) / 2; if (arr[mid] == x) { return mid; } if (arr[mid] > x) { return binarySearch(arr, l, mid - 1, x, comp); } return binarySearch(arr, mid + 1, r, x, comp); } return -1; } int main() { int Num[8192]; srand(time(NULL)); for (int i = 0; i < 8192; i++) { Num[i] = rand() % 10001; } clock_t starting_time = clock(); bubbleSort(Num, 8192); clock_t ending_time = clock(); clock_t result =…
JAVA CODE PLEASE Recursive Functions Quiz by CodeChum Admin Create a recursive function named sequence that accepts an integer n. This function prints the first n numbers of the Fibonacci Sequence separated by a space in one line Fibonacci Sequence is a series of numbers in which each number is the sum of the two preceding numbers. In the main function, write a program that accepts an integer input. Call the sequence function by passing the inputted integer. Input 1. One line containing an integer Output Enter·a·number:·5 0·1·1·2·3
main.cpp:4:17: error: 'string' has not been declared 4 | void KMPSearch(string pat, string txt) main.cpp:4:29: error: string' has not been declared 4 | void KMPSearch(string pat, string txt) Aununun main.cpp:31:25: error: string' has not been declared 31 | void computelPSArray(string pat, int M, int[] lps) main.cpp:31:50: error: expected or . before lps' 31 | void computeLlPSArray(string pat, int M, int[] lps) main.cpp:55:8: error: expected :' before 'static' 55 | public static void Main() main.cpp:61:2: error: expected ;' after class definition 61 | } | main.cpp: In member function 'void GFG::KMPSearch(int, int)': main.cpp:6:15: error: request for member Length' in 'pat', which is of non-class type 'int' 6 | int M = pat.Length; main.cpp:7:15: error: request for member Length' in txt’, which is of non-class type 'int' int N = txt.Length; main.cpp:8:6: warning: structured bindings only available with -std3c++17' or (-std=gnu++17' 8 | int[] lps new int[M];
C++ 6.34 #include <iostream>#include <cstdlib>#include <ctime>using namespace std; void guessGame(); // function prototypebool isCorrect( int, int ); // function prototype int main(){srand( time( 0 ) ); // seed random number generatorguessGame();} // end main // guessGame generates numbers between 1 and 1000 and checks user's guessvoid guessGame(){int answer; // randomly generated numberint guess; // user's guesschar response; // 'y' or 'n' response to continue game // loop until user types 'n' to quit gamedo {// generate random number between 1 and 1000// 1 is shift, 1000 is scaling factoranswer = 1 + rand() % 1000; // prompt for guesscout << "I have a number between 1 and 1000.\n" << "Can you guess my number?\n" << "Please type your first guess." << endl << "? ";cin >> guess; // loop until correct numberwhile ( !isCorrect( guess, answer ) ) cin >> guess; // prompt for another gamecout << "\nExcellent! You guessed the…
C++ A matrix is a rectangular array of numbers that is arranged in a two-dimensional table. Matrices have numerous applications in computer systems. Matrix structures are examined in computer memory, graphics, and cryptography. The Hill cipher, for example, makes use of matrix inversions to encrypt and decrypt data. The intent of this problem is to develop a C++ program that computes and displays the inversion of a 2 x 2 matrix. A matrix is said to have the dimensions m x n if it has m rows and n columns. A square matrix has the same number of rows as columns, and is therefore said to have m x m dimensions. Matrix M shown below is an example of a 2 x 2 matrix. The inverse of a square matrix, M-1, is defined by the equation M(M-1) = I, where I is called the identity matrix. I is a square matrix that is all zeros except for ones along the main diagonal from the upper left corner to the lower right corner. I for a 2 x 2 matrix is: Multiplying a square matrix by its inverse will always…
1. Examine the following code segment. What will be printed?If there are any errors indicate the nature of the error. int a[8] ={16, 12, 10, 7, 15, 18, 17, 29}; int *ptr ; ptr = & a[ 5 ] ; for(int i = 0; i<= 4; i = i + 2) cout<<a[i]<<*( ptr + i )<<endl; cout<<” ”<<a[1]<<” ”<<*ptr<<” ”<<*ptr + 2<<” ”<<*(ptr + 3);