Java Program to Round of the Float value and return it in Integer in Java

Java Program to Round of the Float value and return it in Integer in Java

 

 Code:

import java.util.*;
public class RoundOfTheValue {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
float data = sc.nextFloat();
System.out.println(Math.round(data));
}
}

 Sample Input/Output:

 

Comments

Post a Comment

Popular posts from this blog

Convert binary to decimal in c using built in function

Image
 Convert binary to decimal in c using built in function     In C, you can use the strtol function from the <stdlib.h> library to convert a binary string to a decimal number. strtol stands for "string to long integer."  Syntax:  long strtol(const char *nptr, char **endptr, int base); nptr : The string you want to convert to a number. endptr : The address of the first character that's not part of the number (if provided). base : The numerical base of the string (e.g., 2 for binary, 10 for decimal).         This code snippet demonstrates converting the binary string "101010" to its decimal equivalent using strtol . The base parameter 2 specifies that the string is in binary format. Adjust the binaryString variable to contain the binary string you want to convert. ```c #include <stdio.h> #include <stdlib.h> int main () { char binaryString [] = "101010" ; long decimal = strtol ( binaryString , NULL...
Read more

Install nodeJs in linux

Install nodeJs in linux   Download the NodeJS https://nodejs.org/en  Extract the tar file  Rename the file to nodejs  Run the below command:  cd nodejs  sudo cp '/home/dev/Downloads/nodejs/bin/node' '/usr/bin'  node -v  sudo ln -s /home/dev/Downloads/nodejs/bin/npm /usr/local/bin/npm  ./npm install npm@latest  npm -v      
Read more

DFS in Complete Tree

Image
  DFS in Complete Tree  "DFD" typically stands for "Data Flow Diagram." It's a graphical representation used in software engineering and systems analysis to illustrate how data moves through a system. However, it's not an algorithm like BFS or DFS. Completeness: DFDs depict data flow in a system but might not cover every detail, depending on the diagram's level of abstraction. Time & Space Complexity: the time complexity of both DFS and BFS is O(V + E) , where V represents the number of vertices and E represents the number of edges in the graph. And, the space complexity of DFS and BFS is O(V), in the worst case Optimality: DFDs are design tools; their value lies in effectively illustrating data flow for system understanding and analysis, rather than being inherently optimal or non-optimal. Tree:    Code: class Node : def __init__ ( self , value ): self . data = value self . left = None self . right = None...
Read more