A Guide to SQL
A Guide to SQL
9th Edition
ISBN: 9781337668880
Author: Pratt
Publisher: Cengage
Expert Solution & Answer
Book Icon
Chapter 8, Problem 2RQ

Explanation of Solution

Round a number to a specific number of decimal places in Oracle, Access and SQL Server:

  • In Oracle, Access and SQL server, user can round a number to a specific number of decimal places by using “ROUND” function.

“ROUND” function:

  • This function is used to rounds a number to a specified number of decimal places.
  • This function contains more than one argument.
  • Syntax for “ROUND” function:

    ROUND(number, DecimalPlaces)

    • From the given syntax, the argument “number” defines the value to be rounded and the argument “DecimalPlaces” represents the number of decimal places to which to round the result.
    • Consider an example, “ROUND(46.78, 0)” will give the result as “47”...

Explanation of Solution

Remove each value to the right of the decimal places using Oracle, Access and Server:

For Oracle and SQL Server:

For Oracle and SQL server, user can use the “FLOOR” function to remove each number to the right of decimal point.

“FLOOR” function:

  • This function is used to truncate everything to the right of decimal value.
  • Syntax for “FLOOR” function:

    FLOOR(value)

    From the given syntax, the “value” represents numeric value.

Example of “FLOOR” function:

The example for “FLOOR” function in query concept is given below:

SELECT FLOOR(86.32) AS COMPUTED_VALUE;

  • The above query is used to eliminate everything to the right of decimal value using “FLOOR” function.
  • The computed value is represented by “COMPUTED_VALUE” using “AS” operator.

When the query is executed, the following output will be displayed...

Blurred answer
Students have asked these similar questions
1.) Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable. ii) Let ALLDFA = {(A)| A is a DFA and L(A) = "}. Show that ALLDFA is decidable. iii) Let AECFG = {(G)| G is a CFG that generates &}. Show that AECFG is decidable. iv) Let ETM {(M)| M is a TM and L(M) = 0}. Show that ETM, the complement of Erm, is Turing-recognizable. Let X be the set {1, 2, 3, 4, 5} and Y be the set {6, 7, 8, 9, 10). We describe the functions f: XY and g: XY in the following tables. Answer each part and give a reason for each negative answer. n f(n) n g(n) 1 6 1 10 2 7 2 9 3 6 3 8 4 7 4 7 5 6 5 6 Aa. Is f one-to-one? b. Is fonto? c. Is fa correspondence? Ad. Is g one-to-one? e. Is g onto? f. Is g a correspondence? vi) Let B be the set of all infinite sequences over {0,1}. Show that B is uncountable using a proof by diagonalization.
Can you find the least amount of different numbers to pick from positive numbers (integers) that are at most 100 to confirm two numbers that add up to 101 when each number can be picked at most two times?
Can you find the formula for an that satisfies the provided recursive definition? Please show all steps and justification
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
A Guide to SQL
Computer Science
ISBN:9781111527273
Author:Philip J. Pratt
Publisher:Course Technology Ptr
Text book image
Oracle 12c: SQL
Computer Science
ISBN:9781305251038
Author:Joan Casteel
Publisher:Cengage Learning
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781285196145
Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher:Cengage Learning
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781305627482
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning