Skip to main content

JavaScript DOM

DOM (Document Object Model) connects web pages to programming languages.

HTML DOM methods: are the actions we can perform on HTML elements,
  • getElementById(id) - get the element with a specified id
  • getElementsByTagName(name) - get all elements with a specified tag name
  • appendChild(node) - insert a child node to x
  • removeChild(node) - remove a child node from x

 DOM properties:  DOM properties are values that we can set or change.
  • innerHTML - the inner text value of x (a HTML element)
  • nodeName - the name of x
  • nodeValue - the value of x
  • parentNode - the parent node of x
  • childNodes - the child nodes of x
  • attributes - the attributes nodes of 

The getElementById Method:

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <title>html DOM</title>
</head>
<body>
<h1 id="demo"></h1>
<script>
    document.getElementById('demo').innerHTML = "Sadman Kabir Soumik";
</script>

</body>
</html>

In the example above, getElementById is a method, while innerHTML is a property.

Document Object: If we want to access any element in an HTML page, we need to access that element via the document object. 



 


Labels

Labels:

Comments

Post a Comment

Popular posts from this blog

Difference between a Singly LinkedList and Doubly LinkedList

3 comments
Read more

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 fro...
Post a Comment
Read more

A Brief Overview of GPT-3 by OpenAI

    You have probably already seen some articles like "A robot wrote an entire article. Aren't you scared yet, human?" So, who is the robot here?    It's GPT-3 model. It's a transformer based language model. The full form of GPT is Generative Pre-trained Transformers. This model is developed by OpenAI. There were GPT-2 and other models released by OpenAI previously. GPT-3 was released in May 2020. GPT-3 is more robust than its predecessors. Though architecturally it doesn't have that mush difference.   GPT-3 can write articles, poems, and even working code for you*, given some context. There are some limitations which I am going explain later in this article. It's a language model means given a text, it probabilistically predicts what tokens from a known vocabulary will come next in that string. So, it's sort of a autocomplete that we see on a phone keyboard. We type a word, and then the keyboard suggests another word that can come next. What sets GPT...
1 comment
Read more