A) Write program in C++ to solve the equation y = [ (x^2 + x + 1) when x values increased 0.2 from (1.8 to 4) in each step using do...while structure? Your answer B)Write program in C++ to find the sum of the following series: 1+1/3+1/5+1/7+......1/n, the term must less than 0.001?

A) Write program in C++ to solve the equation y = [ (x^2 + x + 1) when x values increased 0.2 from (1.8 to 4) in each step using do...while structure? Your answer B)Write program in C++ to find the sum of the following series: 1+1/3+1/5+1/7+......1/n, the term must less than 0.001?

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

please answer with proper explanation and step by step solution. i need code in c++ Using the sample BUBBLESORT program given in class do the following: Print out the original unsorted data Print out the data sorted (ascending) Print out the data sorted (descending) Print out the Maximum and Minimum and the range Print out the median Print out the mode Print out any data having a frequency greater than 3 Print out the standard deviation Sample output: Unsorted List: 9 8 1 6 12 3 5 4 3 6 1 3 6 6 Sorted List: 1 1 3 3 3 4 5 6 6 6 6 8 9 12 (ascending) Sorted List: 12 9 8 6 6 6 6 5 4 3 3 3 1 1 Maximum: 12 Minimum: 1 Range: 11 Median: 5.5 Mode: 6 Frequency: 6 occurs 4 times 3 occurs 3 times Do NOT use files…I should be able to enter UP TO 15 values and have the program work. BE sure that your program covers ALL cases of the median and mode as discussed in class!!!!
Problem 1. We usually write numbers in decimal form (or base 10), meaning numbers are composed using 10 different "digits" {0, 1,..., 9). Sometimes though it is useful to write numbers hexadecimal or base 16. Now there are 16 distinct digits that can be used to form numbers: {0, 1, ..., 9, A, B, C, D, E, F) where A, B, C, D, E and F represent digits with values 10, 11, 12, 13, 14 and 15, respectively. So for example, a 3 digit hexadecimal number might be 2B8 = 8 + (B) 16+ (2) 16² = 8+ (11) 16+ (2) 16² = 696. (a) How many 2-digit hexadecimals are there in which the first digit is E or F? Explain your answer in terms of the additive principle (using either events or sets). (b) Explain why your answer to the previous part is correct in terms of the multiplicative principle (using either events or sets). Why do both the additive and multiplicative principles give you the same answer? (c) How many 3-digit hexadecimals start with a letter (A-F) and end with a numeral (0-9)? Explain. (d) How…
Q13: Write C++ program to find e from the following series: e = 1 + (1/1!) + (1/2!) + (1/3!) + ... + (1/n!)
Q) Write a C++ program to compute the value of S using function, where the value of S(x, n)=– (X')/1! + (X*)/3! – (X)/5! + (X®)/7! .. + (X2n)/(2n-1)!. Define the function Compute_S(x, n) to compute the value of S, given the value of x, and n as parameters list.
Computer Science c++ || urgent Write the code for choosing the list of items in order to get the maximum profit of fractional knapsack problem. [NOTE: number of input items should be user interest, and output should be like - firstly print the resulting profit table, and then print the all selected items (must not be all items from the inputted items - means that all inputted items should not be as the selected items) for the knapsack and then print the maximum profit.]
I need this code in C programing(Not C++) There are several test cases. Each test case begins with a line containing a single integer n (1≤n≤1000). Each of the next n lines is either a type-1 command, or an integer 2 followed by an integer x. This means that executing the type-2 command returned the element x. The value of x is always a positive integer not larger than 100. Given a sequence of operations with return values, you’re going to guess the data structure. It is a stack (Last-In, First-Out), a queue (First-In, First-Out), a priority-queue (Always take out larger elements first), not sure(It can be more than one of the three data structures mentioned above) or impossible(It can’t be a stack, a queue or a priority queue). Sample Input Sample output 6 1 1 1 2 1 3 2 1 2 2 2 3 6 1 1 1 2 1 3 2 3 2 2 2 1 2 1 1 2 2 4 1 2 1 1 2 1 2 2 7 1 2 1 5 1 1 1 3 2 5 1 4 2 4 1 2 1 queue not sure impossible stack priority queue impossible
i need help in R language [R studio] not python or c++ or excel Calculate an approximation of the integration of the following function x3/2 dx where a=0, b=1, n= 64 using Simpson's Composite rule and the Composite Trapezoid rule.
Write a function that takes in a 4 by 4 square matrix and outputs whether it is symmetric or not.The matrix is to be obtained via user input (Total 16 entries, 1 at a time) andshould output either ‘Symmetric’ or ‘Not Symmetric’. For c++
1. Write a C/C++ program that creates a table consisting of 500 randomly generated 3- tuple entries where each entry consists of processID, arrivalTime, and burstTime. The processID should be a “unique” 3-digit positive integer (e.g., 382, 881, 923, …). The arrivalTime should be an integer randomly picked from a range of values between 1 and 1,000. Note that the arrival times of two processes can be the same. The burstTime is an integer randomly picked from a range of values between 1 and 500. Your program should print out the table. An example output of your program would look something like this: processID arrivalTime burstTime 839 1 83 228 4 20 102 3 30 … 2. Using the code for Problem 1, write a C/C++ program that simulates execution of the Round Robin (RR) Algorithm with Time Quantum of 10 and calculates the average waiting time. Your program should run the RR algorithm 500 times. Note that each time you run the algorithm, a new table should be generated, and thus, the average…
I know how set and function works ... but i just dont know how do i implement it on a C++ program.. here is the question that i have problem with a) User need add input for set A, B and Relation b) Add at least 2 operation of sets such as intersection, union, and etc. c) Add at least 2 operation of function such as transistive, symetric and etc. d) Write a program that able to pick any one of four options(TWO operation of set and TWO operation of relation) example of the output
Write a C++ program incorporating recursion to solve the following problem. The program should compile and execute under the UNIX gcc or g++ environments. (show this please) In this program it needs to accept a sequence of k characters from the user and use the characters to produce a k concentric squares. Also assume that there is an index origin of 1, the outermost square is made up of the letter a[k], the square inside that is made from the letter a[k-1], the square inside that is made from the letter a[k-2], and so on, with the innermost square made from the letter a[1]. For example, if k=5, and the values of a are ("R","O","C","K","Y") then the executed program should display: Y Y Y Y Y Y Y Y Y Y K K K K K K K Y Y K C C C C C K Y Y K C O O O C K Y Y K C O R O C K Y Y K C O O O C K Y Y K C C C C C K Y Y K K K K K K K Y Y Y Y Y Y Y Y Y Y To make this program simpiler to do if you implement it in C++ and write a class; instances of this class can be passed by value. If a class is…
Using C Program: Create a calculator program that works like a real calculator. It means that the user could enter as much number as they want. Ex: 1+1+1+1+1+1+2+2+2.... Create this by only using functions and arrays. Avoid using switch.