Answered: Q1/ find code optimization of this code…

Engineering

Computer Science

Q1/ find code optimization of this code then find type to this code for (i=1;i

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

Topical Information Use C++. This lab will help you practice with dynamic memory (NOT mixed with classes). Program Information One statistic of interest to many researchers is the median of a set of data. The median is the value in the middle. (This is NOT the average, mind you.) Being in the middle, of course implies that the data are in order (sorted). If there are an odd number of data items, the middle is simple to find. If there are an even number of data items, you are supposed to take the average of the two middle values. You'll need to find the median of a set of data from a file. You don't know how many data are in the file, of course. You'll have to count the data, then read them in to sort, then find the median, and finally print it (the median) out. Do NOT use any more memory than is necessary!!
[In C#] Write a class named Sorting with static sort function in order to sort the following array as Pakistan. Call sort function in the main function. char[] p= {‘a’, ‘p’, ‘i’, ‘k’, ‘t’, ‘a’, ‘n’, ‘s’};Output as = pakistan
Part 2: Unroll Write a function called unroll, which takes in a square array of arrays (i.e. a grid with n rows and n columns). An input could look like this: const square = [ [1, 2, 3, 4], [5, 6, 7, 8], ]; [9, 10, 11, 12], [13, 14, 15, 16] unroll should take in such a square array and return a single array containing the values in the square. You should obtain the values by traversing the square in a spiral: from the top- left corner, move all the way to the right, then all the way down, then all the way to the left, then all the way up, and repeat. For the above example, unroll should return [1, 2, 3, 4, 8, 12, 16, 15, 14, 13, 9, 5, 6, 7, 11, 10].
#include <iostream> using namespace std; // define a function // pass a 2d array as a parameter void display(float numbers[][2]) { cout << "Displaying Values: " << endl; for (int i = 0; i < 3; ++i) { for (int j = 0; j < 2; ++j) { cout << "num[" << i << "][" << j << "]: " << numbers[i][j] << endl; } } } int main() { // initializing the 2 dimensional array. int actions[3][2] = { {30, 704}, {70.9, 51.7}, {35.7, 11.92} }; return 0; } Call the display function in main to show the results of the nested for loop
* Assignment: Longest increasing subsequence * * Sequences are a natural source of computational problems. One such * family of problems involves finding subsequences with specified * properties in a given sequence. This exercise asks you to write * a program that, given a sequence * * s(0), s(1), ..., s(n-1) * * of integers as input, finds a ___longest increasing subsequence___ * of the sequence s. * * For example, suppose we are given as input the sequence * * 72, 16, 51, 17, 6, 21, 92, 59, 54, 78, 41, 33, 94, * 85, 83, 56, 2, 46, 57, 44, 73, 6, 47, 47, 0. * * In this sequence, a longest increasing subsequence has length 7. * One example of such an increasing subsequence is * * 16 < 17 < 21 < 54 < 56 < 57 < 73. * * More generally, your program must be such that * given a sequence * * s(0), s(1), ..., s(n-1) * * of integers as input, the program returns a subsequence * * s(i_1), s(i_2), ..., s(i_k) * * that meets all…
C++ Assignment: Rajesh is very good in mathematics since the starting classes and want to be great mathematician like Brahmagupta. He is keep practicing for her goal achievement. Once He knew about the Vector dot Product So He asked his friend Sammer the problem. He her two vectors A and B length N. He asked him to reduce the dot output of these two vectors. Sammer has the option to change the order of the objects of these two carriers i.e., in any two objects I and j at any vector can change the shape of these objects. gave Since Sammer is new to the program, he has asked you to resolve the issue using C++ Programming language. Input: 1 2 1-2 -3 8 Output: -19
C++ solution required Gustavo Gus has to remove one of his drug chemists due to trust issues. So he comes up with the idea of playing a game of Pick and Drop. In this game, an array of integers AA is of size NN, and each player (Mr. Hyperwhite and Gale BoetticherGaleBoetticher) removes one number from the array in alternating moves until only one number remains. If the remaining number is even, Mr. White wins, otherwise Gale wins. Whoever loses will be eliminated by Gus. Mr. White always takes the first turn (i.e., Mr. White first turn -> Gale second turn -> Mr. White third turn and so on). Mr. White is thinking about which number to choose in the first move to win. Help Mr. White by determining the number of ways he can pick the first number to win. Input 1 5 12345 Output -1
C++ solution required Gustavo Gus has to remove one of his drug chemists due to trust issues. So he comes up with the idea of playing a game of Pick and Drop. In this game, an array of integers AA is of size NN, and each player (Mr. Hyperwhite and Gale BoetticherGaleBoetticher) removes one number from the array in alternating moves until only one number remains. If the remaining number is even, Mr. White wins, otherwise Gale wins. Whoever loses will be eliminated by Gus. Mr. White always takes the first turn (i.e., Mr. White first turn -> Gale second turn -> Mr. White third turn and so on). Mr. White is thinking about which number to choose in the first move to win. Help Mr. White by determining the number of ways he can pick the first number to win. Input 1 5 12345 Output -1
C++ solution required Gustavo Gus has to remove one of his drug chemists due to trust issues. So he comes up with the idea of playing a game of Pick and Drop. In this game, an array of integers AA is of size NN, and each player (Mr. Hyperwhite and Gale BoetticherGaleBoetticher) removes one number from the array in alternating moves until only one number remains. If the remaining number is even, Mr. White wins, otherwise Gale wins. Whoever loses will be eliminated by Gus. Mr. White always takes the first turn (i.e., Mr. White first turn -> Gale second turn -> Mr. White third turn and so on). Mr. White is thinking about which number to choose in the first move to win. Help Mr. White by determining the number of ways he can pick the first number to win. Input 1 5 12345 Output -1
Please use easy logic with proper indentations and comments for understanding!. Coding should be in C++. 3. Define a class which stores up to 10 integer values in an array. The class should also define the following 4 public methods: setNumber – accepts an integer value to store in the array. The value is stored in the next available element of the array (first call to the method stores the value in element 0 with the second call storing the value in element 1.) The method returns true if there is room in the array and the integer was successfully stored. Returns false otherwise. clear – removes all values from the array so that the array can be reused. displayNumbers – displays the values currently stored in the array. getStats – determines the largest, smallest, and average of the values currently stored in the array. These values are returned to the caller via reference parameters. All methods should produce correct results regardless of the order in which…
#include <iostream> using namespace std; // define a function // pass a 2d array as a parameter void display(float numbers[][2]) { cout << "Displaying Values: " << endl; for (int i = 0; i < 3; ++i) { for (int j = 0; j < 2; ++j) { cout << "num[" << i << "][" << j << "]: " << numbers[i][j] << endl; } } } int main() { // initializing the 2 dimensional array. int actions[3][2] = { {30, 704}, {70.9, 51.7}, {35.7, 11.92} }; return 0; } Display and explain your answer.
Will downvote. Asking this question second time. Please give right code Please find errors. Write line number is necessary for the code