inspire

  NODE JS: Beginning #1 Here are the details for the code we used: var means: Any Variable  Console.Log : print something # 4 types of Compilers:  ⦁ Online Compiler ⦁ Vs Code ⦁ Browser Run ⦁ Terminal Here is the simple program to run in java: Var a = 5; Var b = 5; Var ans = a*b; Console.log(ans); Output:  25 ----------------------------------------------------- #Basics Of JS Will Be Using In Node JS: Variable Objects JSON Console Array Random If Else Loop Functions Prompt ___________________________________________________ We can use "let" instead of using "var" keyword to define variables Keyword : Const -> A const keyword is used to create datatypes constant. i.e.(That Cannot Be Changed)! syntax: const name = 'Ram'; and if we change it to Shyam  like:  name = 'Shyam' Error: It gives an error that constant variable cannpt be changed; If you want to know what types of data is stored in variable you can see .  Let's see example for tha...

Linked List A linked list is a linear data structure that does not store elements in contiguous memory locations, the elements in the linked list are linked using pointers. It is a collection of nodes in which each node stores data and a pointer that links to the next node to form a sequence of nodes. -> Linked List is a linear data structure which is a combination of Nodes. -> Nodes contain two parts i.e. data & address. Representation of a Linked List in C: A linked list is represented as a pointer to the first node where each node contains: Data:  Here the actual information is stored. Next:  Pointer that links to the next node. Advantages of a Linked List: Linked list is dynamic data structure it has memory allocation and de-allocation, which means that memory is only used when needed and not earlier in order to avoid waste. In linked list items are arranged in a linear fashion, new items can be inserted or removed as and when needed without affecting other items...

Binary Search: Algorithms What is Binary Search? Binary Search is an interval searching algorithm used to search for an item in the sorted list. It works by repeatedly dividing the list into two equal parts and then searching for the item that is the part where it can possibly exist. Unlike linear search, there are a few conditions for applying binary search: The list must be sorted. Random access to the list member. It means that we cannot apply the binary search in unsorted or liked data structures. Visualization of Binary Search: Algorithm for Binary Search in C Let [X]   be the element we are searching for, and the array is sorted in the ascending order. Compare [X] with the middle element of the array.   If [X]  matches with the middle element, we return the index of the middle element.   Else if [X]  is greater than the middle element, it means that [X]  can only lie in the right half subarray after the middle element. So, we repeat steps 1 and 2 for ...