@Vikasnagar

// traditonal function function sum(a,b) { return a+b; } // arrow function

function greetings() { console.log("Hello world!"); } greetings(); function add(x,y) { /// x and y are parameters console.log(x+y);

let marks = [12,13,78,34,54,44,11]; let names = ["vikas","vishal","kiraa","raj"]; console.log(marks[1]) console.log(marks); console.log(marks.length); //modify value marks[0]=89

////////////////////////////////loop///////////////////////////////////////////////////// // for(i=0; i<=50; i++){ // console.log(i); // } ////// even on odd//////////// console.log("Enter a number"); // let num =prompt("Enter a number")

//get user input using prompt and check number is multiple of 5 or not console.log("Check number is multiple of 5 or not") let a= prompt("Enter a number") if(a%5==0){ console.log("Yes ${a} is multiple of 5") } else{

const products ={ "name":"Laptop", "price": 1000, "brand": "Dell", "inStock": true, "features": ["16GB RAM", "512GB SSD", "Intel i7 Processor",120] } console.log(products); // Output: Laptop

import java.util.*; class Main{ public static void add(){ Scanner sc = new Scanner (System.in); System.out.println("enter first number "); int num1 = sc.nextInt(); System.out.println("enter second number"); int num2 = sc.nextInt(); int num3 = num1 + num2; System.out.println(num3);

#include <stdio.h> #include <stdlib.h> #define SIZE 5 // Define the size of the queue typedef struct { int items[SIZE]; int front, rear; } CircularQueue; // Function to initialize the queue

#include<stdio.h> int main() { int num1,num2; printf("enter the two number"); scanf("%d%d",&num1,&num2); if (num1>num2) printf("%d is larger tham %d\n",num1,num2); else if(num1<num2) printf("%d is larger than %d\n",num2,num1);

#include<stdio.h> int main() { int num1=2; int num2=3; int result; result = num1*num2; printf("the result of multipication %d from%d is %d\n ",num1,num2,result); return 0;

#include <stdio.h> int main() { printf("Hello world!\n"); return 0; }

#include<stdio.h> int main() { int num1=200; int num2=50; int result; result=num1-num2; printf("the result of substraction %dfrom %d is %d",num1,num2,result); return 0; }

#include<stdio.h> int main() { int num1,num2,sum; printf("enter the first number:"); scanf("%d",&num1); printf("enter the second number:"); scanf("%d",&num2); sum = num1+num2; printf("sum of %d and %d is %d",num1,num2,sum);

#include <stdio.h> int main() { int num1,num2; printf("enter the first number\n"); scanf("%d",&num1); printf("\nenter the second number"); scanf("%d",&num2); if(num1>num2) {

// C++ program to implement the queue data structure using // linked list #include <bits/stdc++.h> using namespace std; // Node class representing a single node in the linked list class Node { public: int data; Node* next;

// C program to implement a stack using linked list #include <stdio.h> #include <stdlib.h> // ________LINKED LIST UTILITY FUNCITON____________ // Define the structure for a node of the linked list typedef struct Node { int data; struct Node* next;

// C Program to Insert an element // at a specific position in an Array #include <stdio.h> int main() { int arr[100] = { 0 }; int i, x, pos, n = 10;

public class Main { public static void main(String[] args) { int[] arr = {90, 80, 70, 60, 50, 40, 1}; boolean bool; for (int i = 0; i < arr.length; i++) { bool = false;

// Online C compiler to run C program online #include <stdio.h> #include <stdlib.h> struct Node{ int data; struct Node* next; };

// Online C compiler to run C program online #include <stdio.h> #include <stdlib.h> struct Node{ int data; struct Node* next; };