JavaScript- How to get input from user and display it on browser?

We can do that by using the prompt() method. We can display whatever the input given by the user on browser by using innerHTML.

for example:

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <title>Getting Input</title>
</head>
<body>
<button onclick="myFunction()">Click Here</button>
<p id="myName"></p>

<script>
    function myFunction() {
        var name = prompt("Please enter your name: ");        if(name != null){
            document.getElementById("myName").innerHTML = "Hello "+ name + ", How are you today?";        }

    }
</script>

</body>
</html>

This will display a "Click Here" button on browser and if you click on it, then it will ask you to enter your name like below:

If the user enter his/her name and click OK, then it will display a paragraph like below:

Red marked area is the input given by the user.

Comments

Difference between abstract class and interface in OOP

Source: Amit Sethi In Interface: > All variables must be public static final. > No constructors. An interface can not be instantiated using the new operator. > All methods must be public abstract .

DFS Performance Measurement

Completeness DFS is not complete, to convince yourself consider that our search start expanding the left subtree of the root for so long path (maybe infinite) when different choice near the root could lead to a solution, now suppose that the left subtree of the root has no solution, and it is unbounded, then the search will continue going deep infinitely, in this case , we say that DFS is not complete. Optimality Consider the scenario that there is more than one goal node, and our search decided to first expand the left subtree of the root where there is a solution at a very deep level of this left subtree , in the same time the right subtree of the root has a solution near the root, here comes the non-optimality of DFS that it is not guaranteed that the first goal to find is the optimal one, so we conclude that DFS is not optimal. Time Complexity Consider a state space that is identical to that of BFS, with branching factor b, and we start the search from th

Soumik's Tech Blog

Search This Blog