Array Implementation in JavaScript

var testScores = [78, 90, 62, 88, 93, 50]; // Decleration of Array..
var highestScore = testScores[4]; // Finding element of Array..
testScores[5] = 71; // Modify the array..
testScores.push(89); // Insert a value at last position..
testScores.unshift(74, 58); // You can also add a new element to the beginning of an array using the unshift() method.
testScores.pop(); // This method lets you delete the last element in an array
testScores.shift(); // The shift() method to remove the first element of an array.

console.log(testScores);
console.log("Length of the Array is: "+(testScores.length)); // Print the nmber of elements of the array..

Comments

Post a Comment

Popular posts from this blog

Average of All Indexes of Array

 let array_1 = [1, 7, 9, 12, 6, 10, 2, 11, 9, 8];     let average;     let total = 0;     for(var i=0; i<array_1.length; i++){           total = ((total + array_1[i]));     }              average = (total/(array_1.length));     console.log(average);
Read more

JavaScript Coding Challenge-8

 Write a program which removes 0 from prefix but not suffix..        e.g., - if, i/p - 300, (o/p - 300)        if, i/p - 003, (o/p - 3) _______________________________________  let original_num; let result; function removeZeros(number){       if(number%10 == 0){           result = original_num;       }else{           result = (number%10);       }       console.log(result); } original_num = 009; removeZeros(original_num);
Read more

Largest and Lowest Number of the Array using JavaScript

  let array_1 = [7, 9, 3, 2, 0, 10, 90, 21, 12, 87, 11, 22, 8];     let array_2 = [7, 9, 3, 2, 0, 10, 90, 21, 12, 87, 11, 22, 8, 4, 1, 0];         let largest_number = array_1[0];     let lowest_number = array_2[0];     // loop to find largest number of the array..     for(var i=0; i<array_1.length; i++){              if(largest_number<array_1[i]){                    largest_number = array_1[i];              }     }     // loop to find lowest number of the array..     for(var k=0; k<array_2.length; k++){              if(lowest_number > array_2[k]){     ...
Read more