Skip to main content

Scanner Class | Java | Code Trivia | MyCodingNetwork


Scanner class in Java is used to accept values from the user. The values can be used in the program. It is part of the java.util package. Users can use it to provide values of primitive data types like boolean, int, float, double, String etc. One of the major advantages of Scanner class is that users can test the program for various inputs instead of the constant values assigned to the variables of the program. In other words, it increases the useability of the program.


Syntax: 

1. To import the class
import java.util.Scanner;
OR
import java.util.*;
2. Creating object sc of the Scanner
Scanner sc=new Scanner (System.in);


Program 1:

import java.util.Scanner;
class Test{
public static void main(String args[ ])
{
Scanner sc=new Scanner (System.in);
//nextInt() is function to receive value of int
//data type 
int a=sc.nextInt();
int b=sc.nextInt();
int sum=a+b;
System.out.println(sum);
}}
Output can change according to the values entered by the user.
Now compare it with the program given below:


Program 2:

import java.util.Scanner;
class Test{
public static void main(String args[ ])
{
Scanner sc=new Scanner (System.in);
//nextInt() is function to receive value of int
//data type 
int a=34;
int b=67;
int sum=a+b;
System.out.println(sum);
}}

Explanation: Output is the same whenever the user runs the program, that is, 101.


Hope you liked this explanation, for any doubt or feedback you can write down in the comment section.

Popular posts from this blog

Exploring Uninformed Search in Artificial Intelligence: Basics and Applications

  In artificial intelligence (AI), search algorithms are essential for solving a variety of problems, from navigating a maze to scheduling tasks. Uninformed search, also known as blind search, is a fundamental category of search techniques where the algorithm has no additional information about the states beyond what is provided in the problem definition to guide the search. This page delves into the basics of uninformed search algorithms, their types, and their applications in AI. Understanding Uninformed Search Uninformed search algorithms explore the search space without any guidance on which paths might lead to the goal more efficiently. They rely solely on the information available from the initial problem setup, such as the start state, goal state, and possible actions. This approach contrasts with informed search algorithms, which utilize heuristics to make more educated guesses about the best path to take. Types of Uninformed Search Algorithms   Several uninformed se...

Artificial Intelligence Playlist

Here's a playlist specifically dedicated to Artificial Intelligence. Make sure to follow it, as a whole lot of new AI videos coming up... 1. Concept of State in AI 2. Uninformed Search in AI 3. Breadth First Search | Part 1 4. Breadth First Seach | Part 2 | Algorithm & Working and many more to come...

Print a Linked List in Reverse Order | Linked List | Java | MyCodingNetwork

  Print a Linked List in Reverse Order After mastering the four standard operations on a Linked List - Creation, Traversal, Insertion, and Deletion - we will now proceed to the next topic: ' Printing a Linked List in Reverse Order '. It serves as a continuation of our previous discussions. We will build upon the topics and ideas that we have previously explored to further our understanding about Linked List. We 'll be using recursive approach for the implementation. For this a separate recursive function would be needed. Concept of stack is also implemented for print statement. Let's discuss the algorithm for the same: Algorithm: Create a function printReverse() , which takes 'head ' of the Linked List as the parameter. Take a temporary node ' cur ' and assign it with the head of the list. Create a base case which checks if cur==null . If base case is TRUE, then function would return . If base case is FALSE, then the statements following that base case ...