Write a function that accepts a positive integer array 'price' consisting of 'n' elements as its argument. 'price' contains prices of a share throughout the day in the order of their occurrence. When a new price occurs old price disappears forever. A transaction for the share is complete when firstly the share is bought and then sold. In a transaction where the share is bought at price[j] and sold at price[k], where j

Write a function that accepts a positive integer array 'price' consisting of 'n' elements as its argument. 'price' contains prices of a share throughout the day in the order of their occurrence. When a new price occurs old price disappears forever. A transaction for the share is complete when firstly the share is bought and then sold. In a transaction where the share is bought at price[j] and sold at price[k], where j

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 MAGICFS LANGUAGE The Fibonacci sequence begins like this: 0,1,1,2,3,5,8,13,21,... A number in the sequence is the sum of the previous two numbers in the sequence, with first two being 0 and 1. Implement a function named 'fibonacci' that expects a working value of an integer index, and returns the Fibonacci number at that position in the sequence. The index is zero-based. For instance, if given a value of 4, the function should return 3 because the sequence is 0, 1, 1, 2, 3, ... Use subroutines if necessary. Your answer will be evaluated for partial credit. Comments are encouraged.
In C programming languge: Write a function that takes an array of ints, and the size of the array – another int. It also returns a double. Call this one ‘average.’ Return a double that is the average of the values in the array. Demonstrate that it works by finding the average of an array with these values {78, 90, 56, 99, 88, 68, 92}
Create a function using Java: Number of Rows = 3-6 Number of Columns = 3-6 Function Name: winInDiagonalFSParameters: board: 2D integer array, piece: integerReturn: booleanAssume board is valid 2D int array, piece is X==1/O==2.Look at all forward slash / diagonals in the board. If any forward slash / diagonals has at least 3consecutive entries with given type of piece (X/O) (3 in a row XXX, OOO), then return true,otherwise false
Create a function using Java: Number of Rows = 3-6 Number of Columns = 3-6 Function Name: ColumnWinParameters: board: 2D integer array, column: integer, piece: integerReturn: booleanAssume board is valid 2D int array, column is valid index in the board, piece is X==1/O==2Look at indicated column at given index in board. If that column has at least 3 consecutiveentries with given type of piece (X/O) (3 in a row XXX, OOO), then return true, otherwise false.
Write a function void pintByDept(char *deptName , student allStudents[], int size) that will print the information of only those students who belong to the department with name pointed to by deptName. The array allStudent is of length ‘size’ and holds information of all the students
Create a function using Java: Number of Rows = 3-6 Number of Columns = 3-6 Function Name: winInDiagonalBSParameters: board: 2D integer array, piece: integerReturn: booleanAssume board is valid 2D int array, piece is X==1/O==2.Look at all backward slash \ diagonal in the board. If any backward slash \ diagonal has atleast 3 consecutive entries with a given type of piece (X/O) (3 in a row XXX, OOO), then return true,otherwise false.
In java there must be at least two calls to the function with different arguments and the output must clearly show the task being performed. Develop a function that accepts an array and returns true if the array contains any duplicate values or false if none of the values are repeated. Develop a function that returns true if the elements are in decreasing order and false otherwise. A “peak” is a value in an array that is preceded and followed by a strictly lower value. For example, in the array {2, 12, 9, 8, 5, 7, 3, 9} the values 12 and 7 are peaks. Develop a function that returns the number of peaks in an array of integers. Note that the first element does not have a preceding element and the last element is not followed by anything, so neither the first nor last elements can be peaks. Develop a function that finds the starting index of the longest subsequence of values that is strictly increasing. For example, given the array {12, 3, 7, 5, 9, 8, 1, 4, 6}, the function…
Write a modular program in C++ that analyzes a year’s worth of rainfall data. In addition to main, the program should have a getData function that accepts the total rainfall for each of 12 months from the user and stores it in an array holding double numbers. It should also have four value-returning functions that compute and return to main the totalRainfall, averageRainfall, driestMonth, and wettestMonth. These last two functions return the number of the month with the lowest and highest rainfall amounts, not the amount of rain that fell those months. Notice that this month number can be used to obtain the amount of rain that fell those months. This information should be used either by main or by a displayReport function called by main to print a summary rainfall report similar to the following: 2019 Rain Report for Springdale County Total rainfall: 23.19 inches Average monthly rainfall: 1.93 inches The least rain fell in January with 0.24 inches. The most rain fell in April with…
3. Write a recursive function that ассepts 8x8 array of an characters that represents a maze. Each position can contain either an X or a blank. Starting at position (0,1), list any path through the maze to get to the location (7,7). Only horizontal and vertical moves are allowed. If no path exists, write a message indicating there is no path. Moves can be made only to the locations that contain a blank. If an X is encountered, that path is blocked and another must be chosen. [6]
Given a function uint16_t func(int16_t x) write a function callPassedFunc() that takes two arguments: • a pointer to func • a int16_t and returns a uint16_t. A call to callPassed Func() should have the same effect and return value as a call to func(), as in the example. Note that it should not matter what func() does. To test this question, write a few random function bodies for func(). For example: Test uint16_t func(int16_t x) { return x/2; //Only an example could be anything. } int16_t arg = 10; uint16_t directRetVal= func(arg); uint16_t indirect RetVal = callPassed Func(&func, arg); printf("%d\n", directRetVal == indirectRetVal); Result 1
In java Develop a function that accepts an array and returns true if the array contains any duplicate values or false if none of the values are repeated. Develop a function that returns true if the elements are in decreasing order and false otherwise. A “peak” is a value in an array that is preceded and followed by a strictly lower value. For example, in the array {2, 12, 9, 8, 5, 7, 3, 9} the values 12 and 7 are peaks. Develop a function that returns the number of peaks in an array of integers. Note that the first element does not have a preceding element and the last element is not followed by anything, so neither the first nor last elements can be peaks. Develop a function that finds the starting index of the longest subsequence of values that is strictly increasing. For example, given the array {12, 3, 7, 5, 9, 8, 1, 4, 6}, the function would return 6, since the subsequence {1, 4, 6} is the longest that is strictly increasing. Develop a function that takes a string…
Computer Science Implement a main program that defines a dynamically created array, consisting of objects of class Candidate, and calls three functions: to. getVotesCandidate: Function that asks the user for the name and votes of the candidate. b. displayStatistics: function that prints the three columns the name of the candidate, the number of votes obtained and calculates the percentage it represents with respect to the total sum of the votes of the possible candidates. c.getHighestIndex: Function that returns the index where the highest number of votes obtained among the candidates is stored