quadrant [★★] Complete the quadrant function below, which should return the quadrant of the given x, y point according to the diagram on the right (borrowed from Wikipedia). Points that lie on an axis do not belong to any quandrant. Hints: (a) define a helper function for the sign of an integer, (b) match against a pair. type quad = I | II | III | IV type sign = Neg | Zero | Pos let sign (x:int) : sign = ... let quadrant : int*int -> quad option = fun (x,y) -> match ... with | ... -> Some I | ... -> Some II | ... -> Some III | ... -> Some IV | ... -> None B) quadrant when [★★] Rewrite the quadrant function to use the when syntax. You won’t need your helper function from before. let quadrant_when : int*int -> quad option = function | ... when ... -> Some I | ... when ... -> Some II | ... when ... -> Some III | ... when ... -> Some IV | ... -> None please use Ocaml for the code

quadrant [★★] Complete the quadrant function below, which should return the quadrant of the given x, y point according to the diagram on the right (borrowed from Wikipedia). Points that lie on an axis do not belong to any quandrant. Hints: (a) define a helper function for the sign of an integer, (b) match against a pair. type quad = I | II | III | IV type sign = Neg | Zero | Pos let sign (x:int) : sign = ... let quadrant : intint -> quad option = fun (x,y) -> match ... with | ... -> Some I | ... -> Some II | ... -> Some III | ... -> Some IV | ... -> None B) quadrant when [★★] Rewrite the quadrant function to use the when syntax. You won’t need your helper function from before. let quadrant_when : intint -> quad option = function | ... when ... -> Some I | ... when ... -> Some II | ... when ... -> Some III | ... when ... -> Some IV | ... -> None please use Ocaml for the code

COMPREHENSIVE MICROSOFT OFFICE 365 EXCE

1st Edition

ISBN:9780357392676

Author:FREUND, Steven

Publisher:FREUND, Steven

Chapter3: Working With Large Worksheets, Charting, And What-if Analysis

Section: Chapter Questions

Problem 2.2EYK

See similar textbooks

Similar questions

function [P, A] = rect(L, W) P= 2 (L+ W); A =L*W; end Above function is defined to find perimeter and area of a rectangle. If a rectangle has length 10 mm and width 7 mm then the correct way to get perimeter and area of a given rectangle by executing this function is Select one: a. [A, B] = rect(10, 7) b. rect(7, 10) c. [A, B] = rect(7, 10) d. rect(10, 7)
Explanation: pi(x) is a function that has nothing to do with pi (why? because MATH, that's why) but rather is a function meaning "The number of prime numbers <= x". So pi(7) = 4, since there are four prime numbers <= 7, namely: 2, 3, 5, and 7. (1 is not a prime number!) The big sigma is the summation symbol. It means add up the results for pi(x) from x = i to x = j. So if we sum up all pi(x) from x = 7 to 11, we are computing: pi(7) + pi(8) + pi(9) + pi(10) + pi(11) Now pi(7) through pi(10) are all the same, right? Since the next prime number is 11. So all of those are 4. And then pi(11) is 5, since there's now five prime numbers <= 11: 2, 3, 5, 7, 11. So the answer is: 4 + 4 + 4 + 4 + 5 = 21. (Your code will output: "The answer is: 21"). Can you explain and write it code help me please? C++
2.a Σ : {c,A,G,T}, L = { w : w = CAG™T™C, m = j + n }. For example, CAGTTC E L; CTAGTC ¢ L because the symbols are not in the order specified by the characteristic function; CAGTT ¢ L because it does not end with c; and CAGGTTC € L because the number of T's do not equal the number of A's plus the number of G's. Prove that L¢ RLs using the RL pumping theorem.
thello is a board game and you are expected to implement the move function for this game. Arguments passed to the function are - a symbol of the player making the move and x y coordinates of the cell at which the player wishes to make the move. The move function will be returning a boolean, false - if the move isn't feasible and true - if the move is feasible and this function will also make the move then i.e. make the required changes in the board. Input Format: Line 1: Integer n (Total number of moves) Line 2: Player 1 coordinates, x and y (Two integers separated by space) Line 3: Player 2 coordinates, x and y (Two integers separated by space) Note 1: Number of moves (i.e. n) is always even and Player 1 always starts the game. Note 2: If any player's coordinates are not valid, enter again till the right move. Main function is given for you reference. Sample Input: 2 24 15 25 Sample Output: 00000000 00000000 00001000 00011000 00021000 00000000 00000000 00000000 false 00000000 00000000…
Python only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…
Python only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…
Q3: Write a matlab program call matq3.m that returns the plot of the 2- D space defined by the following equation: (-xsin(x) y = {20 ( cos (x) - 2π ≤ x < 0 x ≥ 2π Label the x-axis and y-axis and z-axis and title to the curve.
Question 6 Calculate and print the shaded area for the given rectangle below in function shadedArea (). Height and length are passed to the function through its parameter. Formula: Rectangle = length x height Triangle = ½ x length x height
There should be a description of the GetStdHandle function.
Define an enumeration type triangleType that has the values scalene, isosceles, equilateral, and noTriangle.b. Write a function triangleShape that takes as parameters three numbers, each of which represents the length of a side of the triangle. The function should return the shape of the triangle. (Note: In a triangle, the sum of the lengths of any two sides is greater than the length of the third side.)c. Write a program that prompts the user to input the length of the sides of a triangle and outputs the shape of the triangle.
Explain how a function works with a relevant example.
Question on Grid Navigation In this section, you will investigate the problem of navigation on a two-dimensional grid with obstacles. The goal is to produce the shortest path between a provided pair of points, taking care to maneuver around the obstacles as needed. Path length is measured in Euclidean distance. Valid directions of movement include up, down, left, right, up-left, up-right, down-left, and down-right. Your task is to write a function find_path(start, goal, scene) which returns the shortest path from the start point to the goal point that avoids traveling through the obstacles in the grid. For this problem, points will be represented as two-element tuples of the form (row, column), and scenes will be represented as two-dimensional lists of Boolean values, with False values corresponding empty spaces and True values corresponding to obstacles. Your output should be the list of points in the path, and should explicitly include both the start point and the goal point. Your…