Skip to main content

basic of javascript lesson 1

DATA TYPES IN JAVASCRIPT

JAVASCRIPT MAINLY HAVE 5 TYPES OF DATA TYPES 

1. STRING LIKE- 
    VAR USENAME="MANISH CHAUHAN"; USERNAME IS 
    MANISH CHAUHAN NOW

2. NUMBER
    LIKE-VAR X=200; X CONTAIN 200.

3. OBJECT IS USED TO STORE COMPLEX VALUES IN JAVASCRIPT THERE ARE MULTIPLE WAYS YOU CAN CREATE A OBJECT IS JAVASCRIPT SO BELOW ARE THE EXAMPLE.

    //object

 var obj={
  name:"manish",
  age:35
}

var obj1=new Object();
obj1.name="manish";
obj1.age=22;


var obj2=Object.create(null,{
      'userName': {
  value: "manish", 
  writable: true, 
  enumerable: true
      },
       'age': {
  value: 35, 
  writable: true, 
  enumerable: true
      }
      });


4. DATE 
    
    var date=new Date();



5. ARRAY
    
    var myArray=[];
var myArray1=new Array();


ONE THING IS THAT YOU CAN STORE ALL TYPES OF ITEMS IN SAME ARRAY LIKE

VAR MYARRAY=[1,2,3,"A,"B"];

THE REASON BECAUSE JAVASCRIPT IS NOT A STRICT TYPE CHECKED LANGUAGE SO YOU CAN ALTER THE BEHAVIOUR OF A VARIABLE AT RUNTIME. FOR EXAMPLE

VAR USERNAME="MANISH";

LATER ON YOU CAN CHANGE IT TO USERNAME=222; SO THIS BEHAVIOUR CAN EASILY BRING LOTS OF BUGS WHEN YOUR PROJECT IS BIG.


2. JavaScript Hoisting is another important part of javascript

    Hoisting is JavaScript's default behavior of moving declarations to the top.
     
    what do you mean by above line 

    so let's check out this

       //in this case you would get a error 

      //Error: myNumber is not defined

      console.log(myNumber)


   the above behaviour is right because myNumber is not defined yet



    but if you declare a variable later on the behaviour would be like below

    

console.log(myNumber)


var myNumber; 


the value of myNumber would be undefined because javascript moves everything to the top so for compiler the statement would be like 


var myNumber; 


console.log(myNumber)


   

next coming soon.....




  

















   

Comments

Post a Comment

Popular posts from this blog

Creating a word Scramble game where you can drag and drop the word and create a complete word. (drag and drop word Scramble game).

Creating a word game using  phaser game engine which is a javascript based gaming engine  where u can drag and drop world like Word Scramble Game and complete a given word. your index.html file look like below < html > < head > < script src = "src/phaser.min.js" ></ script > < script src = "src/wordGame.js" ></ script > < script src = "src/main.js" ></ script > </ head > < body > </ body > </ html > 1.    <script src="src/phaser.min.js"></script> required to run the  phaser game engine. 2. rest of the two files deals with game logics      <script src="src/wordGame.js"></script>       <script src="src/main.js"></script> you can download whole project from https://github.com/manishchauhan/wordgame/tree/master just copy and paste the project in your local server and run ...
Post a Comment
Read more

starting with three.js and react with a very simple example

 1. three.js is undoubtedly the best library to create interactive content for the web in 3d. link https://threejs.org/ a working sample of three with react can be found below https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js why choose threejs 1. lightweight  2.fast 3.big community  https://discourse.threejs.org/ 4. even you can use unity or unreal to publish html5 content but i don't think that would be acceptable in many cases. 5. open-source project. i created a running sample with React  https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js
Post a Comment
Read more

A simple binary search tree with generic approach tree can store any type of data. (DFS and BFS)

 1. a binary search tree in c++ using a generic approach with both BFS and DFS approach    working tree    https://www.onlinegdb.com/edit/HkuQLdA-w code=> some properties of binary search tree-> 1. binary search tree is not always a balanced tree.  2. Inorder, traversing gives you sorted data.  3.  best is o(log n) and worst is O(n).  4. left node data is always less than root data and right node data always be greater than root data.  5. red-black tree STL map is a balanced binary search tree. *******************************************************************************/ #include <stdio.h> #include<iostream> #include<queue> using namespace std; template < typename T > class Node {   //can store any type of data private:   //genric data or store any type of data   T data;   //reference of left pointer   Node *left = nullptr;   //reference of right pointer   Node *rig...
Post a Comment
Read more