li en aretle Let the functions fun and main be defined as int fun(int *k) { *k += 2, return (*k) - 1; } void main() { int i = 10, j = 10, suml, sum2; suml= (1/2) + fun(&i); sum2 = fun(&j) + (j/2) +i; } What are the values of sum1 and sum2 at the end of the main function. a. operands in the expressions are evaluated left to right? suml= sum2- b. operands in the expressions are evaluated right to left? suml= sum2= UYGULAMAYI BİTİR...

li en aretle Let the functions fun and main be defined as int fun(int k) { k += 2, return (*k) - 1; } void main() { int i = 10, j = 10, suml, sum2; suml= (1/2) + fun(&i); sum2 = fun(&j) + (j/2) +i; } What are the values of sum1 and sum2 at the end of the main function. a. operands in the expressions are evaluated left to right? suml= sum2- b. operands in the expressions are evaluated right to left? suml= sum2= UYGULAMAYI BİTİR...

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

PROGRAMMING LANGUAGE: C++ Write a class Complex to model complex numbers and overload the followingoperators (using member functions).a. ‘+’ and ‘–‘ operators for addition and subtraction respectively.b. ‘~’ operator to find the conjugate of a complex number.c. ‘*’ operator to multiply two complex numbers.d. ‘!’ operator to find the magnitude (absolute value) of a complex number.
Programming Language: C Write the following three functions: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true. If no such element is not found, the function returns -1. int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A. void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: 1. Start with accumulator = A[0] 2. For i=1...length-1 compute accumulator=f(accumulator, A[i]) 3. Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array. int reduce(int* A, int n, int (*f)(int,int)); Test for the functions: // used for test Q3-find bool is_even(int x) { return x%2 == 0; } bool is_positive(int x) { return x>0; } void…
Hi, OCaml programming 1. Create a type slidingTile, consisting of a char matrix and two integers xand y. The integers x and y are the coordinates of an empty tile. 2. Create a function val slide : slidingTile -> int -> int -> slidingTile = <fun> that given a slidingTile and two integers, that represent a location in thematrix, it slides the tile from the specified location to the empty tile, thenreturns the altered slidingTile. If provided location is not adjacent to theempty tile, or out of bounds, then return the slidingTile unaltered. 3. Create a function val print_tile : slidingTile -> unit = <fun> that prints a slidingTile on screen with the corresponding characters fromthe matrix. However, print an empty space where the empty tile is instead.
(C Language) Write a recursive function called DrawTriangle() that outputs lines of '*' to form a right side up isosceles triangle. Function DrawTriangle() has one parameter, an integer representing the base length of the triangle. Assume the base length is always odd and less than 20. Output 9 spaces before the first '*' on the first line for correct formatting. Hint: The number of '*' increases by 2 for every line drawn.
Q. ocaml, unlike most functional languages , does not allow functions to return structured values ? - True - False Q. The Ocaml type signature val f : 'a - > ' a = <fun> indicates that function f has parameter and return value that can be any type , as long as the types of f's parameter and return value are the same. - True - False
Define a function SetBirth, with int parameters monthVal and dayVal, that returns a struct of type DateOfBirth. The function should assign DateOfBirth's data member numMonths with monthVal and numDays with dayVal.
Restructure Newton's method (Case Study: Approximating Square Roots) by decomposing it into three cooperating functions. The newton function can use either the recursive strategy of Project 2 or the iterative strategy of the Approximating Square Roots Case Study. The task of testing for the limit is assigned to a function named limitReached, whereas the task of computing a new approximation is assigned to a function named improveEstimate. Each function expects the relevant arguments and returns an appropriate value. An example of the program input and output is shown below: Enter a positive number or enter/return to quit: 2 The program's estimate is 1.4142135623746899 Python's estimate is 1.4142135623730951 Enter a positive number or enter/return to quit
Solve the problem in C++ (Geometry: find the bounding rectangle) A bounding rectangle is the minimum rectangle that encloses a set of points in a two-dimensional plane, as shown in Figure 11.9d. Write a function that returns a bounding rectangle for a set of points in a two-dimensional plane, as follows: const int SIZE = 2; Rectangle2D getRectangle(const double points[][SIZE]); Write another function that returns a pointer to the bounding rectangle as follows: Rectangle2D* getRectanglePointer(const double points[][SIZE]); The Rectangle2D class is defined in Programming Exercise 11.9. Write a test program that prompts the user to enter five points and displays the bounding rectangle’s center, width, and height. Sample Run Enter five points: 1.0 2.5 3 4 5 6 7 8 9 10 The bounding rectangle’s center (5.0, 6.25), width 8.0, height 7.5
Write a program in C that includes the following functions: A function elementsSummation() that takes an integer array and the array size as arguments and prints the summation of the array’s elements. A function smallestElement() that takes the array and its size as arguments and returns the smallest element of the array. A recursive function integerReverse() that takes the array, start index, and the array size as arguments and prints the array back to front.
Implement in C Programming 7.11.1: LAB: Student struct Given main(), build a struct called Student that represents a student that has two data members: the student's name (string) and the student's GPA (double). Assume student's name has a maximum length of 20 characters. Implement the Student struct and related function declarations in Student.h, and implement the related function definitions in Student.c as listed below: Student InitStudent() - initializes name to "Louie" and gpa to 1.0 Student SetName(char *name, Student s) - sets the student's name Student SetGPA(double gpa, Student s) - sets the student's GPA void GetName(char* studentName, Student s) - return the student's name in studentName double GetGPA(Student s) - returns the students GPA Ex. If a new Student object is created, the default output is: Louie/1.0 Ex. If the student's name is set to "Felix" and the GPA is set to 3.7, the output becomes: Felix/3.7 main.c #include <stdio.h> #include <string.h>…
Consider the following function definition.void mystery(int* x){// function body } Inside the definition of mystery, the C++ language provides a way to distinguish if x points to a lone int value or to an int allocated as part of a larger array.A. True B. False
Describe a situation where the add operator in a programming languagewould not be commutative. ____________________________________________________________________ Let the function fun be defined asint fun(int *k) { *k += 4; return 3 * (*k) – 1;}Suppose fun is used in a program as follows:void main(){ int i = 10, j = 10, sum1, sum2;sum1 = (i/2) + fun(&i);sum2 = fun(&j) + (j/2);}What are the values of sum1 and sum2a. if the operands in the expressions are evaluated left to the right?b. if the operands in the expressions are evaluated right to the left?