import axios from "axios"; //Check this for more information

const [user, SetUser] = useState({
  name = "",
  username = "",
  email = "",
});

const { name, username, email } = user;

const onInputChange = (e) => {
  setUser({ ...user, [e.target.name]: e.target.value }); //This will append info when type
}

const onSubmit = async (e) => {
  e.preventDefault(); //This will prevent showing info in url.
  await axios.post("https://localhost:8080/user") //Link to backend server
  //We use async and await here to guarantee get the data before submit.
};

<form onSubmit = {(e) => onSubmit(e)}>
  <input
	value={name}
	onChange={(e) => onInputChange(e)}
	/>
</form>

class D
{
   public static void Wait() throws InterruptedException
    {
        for(int i=0;i<=10;i++)
        {
            System.out.println(i);
            Thread.sleep(1000);
            
        }
    }
    public static void main(String[] args) 
{
    try
    {
        Wait();
        System.out.println(10/0);
       
    }
    catch(Exception s)
    {
        System.out.println("some error find");
    }
}
}

class D
{
   public static void Wait() throws InterruptedException
    {
        for(int i=0;i<=10;i++)
        {
            System.out.println(i);
            Thread.sleep(1000);
            
        }
    }
    public static void main(String[] args) throws InterruptedException
    {
        Wait();
        System.out.println("some error find");
    }
}

class D
{
    void div(int a, int b) throws ArithmeticException
    {
        if (b == 0)
        {
            throw new ArithmeticException();
        }
        else
        {
            int c = a / b;
            System.out.println(c);
        }
    }

    public static void main(String[] args)
    {
        D r = new D(); // Fix the typo here
        try
        {
            r.div(10, 0);
        }
        catch (Exception e)
        {
            System.out.println("We cannot divide by 0");
        }
    }
}

class F
{
    public static void main(String[] args) throws InterruptedException
    {
        for(int i=1;i<=10;i++)
        {
            System.out.println(i);
            Thread.sleep(1000);
        }
    }
}

#include <stdio.h>

int main()
{
    float i, r, p;
    int d;
    printf("Enter loan principal:");
    scanf("%f", &p);
    
    printf("Enter interest rate:");
    scanf("%f", &r);
    
    printf("Enter the term of the loan in days:");
    scanf("%d", &d);
    
    i=(p*r*d)/ 365;
    
    printf("The interest charge is P%.2f", i);
    return 0;
}

#include <stdio.h>

int main()
{
    int a, b, c, d, e, total;
    
    printf("Total miles driven per day:");
    scanf("%d", &a);
    printf("Cost per gallon of gasoline:");
    scanf("%d", &b);
    printf("Average miles per gallon:");
    scanf("%d", &c);
    printf("Parking fees per days:");
    scanf("%d", &d);
    printf("Tolls per day:");
    scanf("%d", &e);
    
    
    total = (a/c)*b+d+e;
    printf("Cost per Day: %d", total);
    
 
    return 0;
}

#include <stdio.h>

int main()
{
    float radius, diameter, circumference, area, pi=3.14;
    printf("Enter radius:");
    scanf("%f", &radius);
    
    printf("\nDiameter is %.2f\n", radius*2);
    printf("circumference is %.2f\n", 2*radius*pi);
    printf("Area is %.2f\n", pi*radius*radius);
    
    

    return 0;
}

09:22:48.[810716]	>>	======================================================================

09:22:48.[815805]	>>	                                                GET DATA FROM ANALYZER

09:22:48.[821361]	>>	======================================================================

09:22:48.[826293]	>>	 

09:22:48.[831255]	>>	R:	<ENQ>

09:22:48.[848398]	>>	S:	<ACK>

09:22:48.[856375]	>>	---

09:22:48.[994730]	>>	R:	<STX>1H|\^&|||99^2.00|||||||P|1.00|20240118084708<CR><ETX>21<CR><LF>

09:22:49.[023133]	>>	S:	<ACK>

09:22:49.[032325]	>>	---

09:22:49.[054270]	>>	Mode [P]: Production Mode

09:22:49.[163194]	>>	R:	<STX>2P|1|||^^^<CR><ETX>CD<CR><LF>

09:22:49.[193582]	>>	S:	<ACK>

09:22:49.[203532]	>>	---

09:22:49.[347893]	>>	R:	<STX>3O|1|670219483304|||R<CR><ETX>F0<CR><LF>

09:22:49.[369834]	>>	S:	<ACK>

09:22:49.[380804]	>>	---

09:22:49.[512006]	>>	R:	<STX>4R|1|^^^1|57.0|sec||||F||||<CR><ETX>2D<CR><LF>

09:22:49.[549618]	>>	S:	<ACK>

09:22:49.[563122]	>>	---

09:22:49.[626420]	>>	Insert LN: 6702194833 Barcode: 670219483304 Anacode: 1 Test Code: OL011 Result: 57 Status:  Result Flag: - Flag1: F complete!!!

09:22:49.[886168]	>>	---

09:22:50.[001793]	>>	R:	<STX>5M|1|A|C<CR><ETX>BB<CR><LF>

09:22:50.[025731]	>>	S:	<ACK>

09:22:50.[033966]	>>	---

09:22:50.[176947]	>>	R:	<STX>6R|2|^^^2|5.23|INR||||F||||<CR><ETX>DD<CR><LF>

09:22:50.[206310]	>>	S:	<ACK>

09:22:50.[219075]	>>	---

09:22:50.[280086]	>>	Insert LN: 6702194833 Barcode: 670219483304 Anacode: 2 Test Code: HM045 Result: 5.23 Status:  Result Flag: - Flag1: F complete!!!

09:22:50.[437811]	>>	---

09:22:50.[560267]	>>	R:	<STX>7M|2|A|C<CR><ETX>BE<CR><LF>

09:22:50.[588627]	>>	S:	<ACK>

09:22:50.[601312]	>>	---

09:22:50.[736161]	>>	R:	<STX>0L|1|N<CR><ETX>03<CR><LF>

09:22:50.[770972]	>>	S:	<ACK>

09:22:50.[784905]	>>	---

09:22:50.[923674]	>>	R:	<EOT>

09:22:59.[346006]	>>	 

09:22:59.[351735]	>>	======================================================================

09:22:59.[356728]	>>	                                                GET DATA FROM ANALYZER

09:22:59.[362236]	>>	======================================================================

09:22:59.[367223]	>>	 

09:22:59.[372206]	>>	R:	<ENQ>

09:22:59.[390059]	>>	S:	<ACK>

09:22:59.[398150]	>>	---

09:22:59.[535139]	>>	R:	<STX>1H|\^&|||99^2.00|||||||P|1.00|20240118084719<CR><ETX>23<CR><LF>

09:22:59.[562065]	>>	S:	<ACK>

09:22:59.[571069]	>>	---

09:22:59.[595632]	>>	Mode [P]: Production Mode

09:22:59.[705522]	>>	R:	<STX>2P|1|||^^^<CR><ETX>CD<CR><LF>

09:22:59.[739065]	>>	S:	<ACK>

09:22:59.[747136]	>>	---

09:22:59.[886041]	>>	R:	<STX>3O|1|670219483304|||R<CR><ETX>F0<CR><LF>

09:22:59.[917131]	>>	S:	<ACK>

09:22:59.[931063]	>>	---

09:23:00.[064944]	>>	R:	<STX>4R|1|^^^3|43.0|sec||||F||||<CR><ETX>2A<CR><LF>

09:23:00.[080901]	>>	S:	<ACK>

09:23:00.[088882]	>>	---

09:23:00.[116805]	>>	---

09:23:00.[225514]	>>	R:	<STX>5M|1|A|D<CR><ETX>BC<CR><LF>

09:23:00.[254735]	>>	S:	<ACK>

09:23:00.[262844]	>>	---

09:23:00.[407672]	>>	R:	<STX>6R|2|^^^4|1.50|Ratio||||F||||<CR><ETX>F1<CR><LF>

09:23:00.[433602]	>>	S:	<ACK>

09:23:00.[441579]	>>	---

09:23:00.[463145]	>>	---

09:23:00.[586856]	>>	R:	<STX>7M|2|A|D<CR><ETX>BF<CR><LF>

09:23:00.[615360]	>>	S:	<ACK>

09:23:00.[623114]	>>	---

09:23:00.[767193]	>>	R:	<STX>0R|3|^^^5|28.7|Ref.T||||F||||<CR><ETX>98<CR><LF>

09:23:00.[790163]	>>	S:	<ACK>

09:23:00.[799105]	>>	---

09:23:00.[822734]	>>	---

09:23:00.[954203]	>>	R:	<STX>1M|3|A|D<CR><ETX>BA<CR><LF>

09:23:00.[984525]	>>	S:	<ACK>

09:23:00.[997605]	>>	---

09:23:01.[139234]	>>	R:	<STX>2L|1|N<CR><ETX>05<CR><LF>

09:23:01.[170408]	>>	S:	<ACK>

09:23:01.[181377]	>>	---

09:23:01.[302864]	>>	R:	<EOT>

09:33:26.[735700]	>>	 

09:33:26.[741439]	>>	======================================================================

09:33:26.[746656]	>>	                                                GET DATA FROM ANALYZER

09:33:26.[752218]	>>	======================================================================

09:33:26.[757308]	>>	 

09:33:26.[762294]	>>	R:	<ENQ>

09:33:26.[782471]	>>	S:	<ACK>

09:33:26.[790754]	>>	---

09:33:26.[927056]	>>	R:	<STX>1H|\^&|||99^2.00|||||||Q|1.00|20240118085746<CR><ETX>25<CR><LF>

09:33:26.[958920]	>>	S:	<ACK>

09:33:26.[965901]	>>	---

09:33:26.[988125]	>>	Mode [Q]: QC Result Mode, Ignore!!!

09:33:27.[100549]	>>	R:	<STX>2P|1|||<CR><ETX>B3<CR><LF>

09:33:27.[135208]	>>	S:	<ACK>

09:33:27.[154673]	>>	---

09:33:27.[295887]	>>	R:	<STX>3O|1|12351|||R<CR><ETX>7D<CR><LF>

09:33:27.[321569]	>>	S:	<ACK>

09:33:27.[328550]	>>	---

09:33:27.[460634]	>>	R:	<STX>4R|1|^^^1|14.7|sec||||F||||20240118085746<CR><ETX>FD<CR><LF>

09:33:27.[491131]	>>	S:	<ACK>

09:33:27.[498844]	>>	---

09:33:27.[630424]	>>	R:	<STX>5M|1|A|@<CR><ETX>B8<CR><LF>

09:33:27.[660085]	>>	S:	<ACK>

09:33:27.[668317]	>>	---

09:33:27.[808325]	>>	R:	<STX>6L|1|N<CR><ETX>09<CR><LF>

09:33:27.[832260]	>>	S:	<ACK>

09:33:27.[840673]	>>	---

09:33:27.[975506]	>>	R:	<EOT>

class MyThread extends Thread {
    public void run() {
        for (int i = 1; i <= 5; i++) {
            System.out.println("Thread: " + i);
        }
    }
}

class MyRunnable implements Runnable {
    public void run() {
        for (int i = 1; i <= 5; i++) {
            System.out.println("Runnable: " + i);
        }
    }
}

public class ThreadExample {
    public static void main(String[] args) {
        MyThread thread = new MyThread();
        thread.start();

        Thread runnableThread = new Thread(new MyRunnable());
        runnableThread.start();
    }
}

import java.awt.*;
import javax.swing.*;
class border{
JFrame frame;
border(){
frame=new JFrame();
             JButton box1=new JButton("**NORTH**");
             JButton box2=new JButton("**SOUTH**");
             JButton box3=new JButton("**EAST**");
             JButton box4=new JButton("**WEST**");
             JButton box5=new JButton("**CENTER**");

              frame.add(box1,BorderLayout.NORTH);
              frame.add(box2,BorderLayout.SOUTH);
              frame.add(box3,BorderLayout.EAST);
              frame.add(box4,BorderLayout.WEST);
              frame.add(box5,BorderLayout.CENTER);

              frame.setSize(300,300);
              frame.setVisible(true);
              
}
public static void main(String args[])
{
       new border();
}
}

class Producer implements Runnable {
    Buffer buffer;

    Producer(Buffer buffer) {
        this.buffer = buffer;
        new Thread(this, "Producer").start();
    }

    public void run() {
        for (int i = 0; i < 5; i++) {
            buffer.put(i);
            System.out.println("Produced: " + i);
        }
    }
}

class Consumer implements Runnable {
    Buffer buffer;

    Consumer(Buffer buffer) {
        this.buffer = buffer;
        new Thread(this, "Consumer").start();
    }

    public void run() {
        for (int i = 0; i < 5; i++) {
            System.out.println("Consumed: " + buffer.get());
        }
    }
}

public class SynchronizationExample {
    public static void main(String[] args) {
        Buffer buffer = new Buffer();
        new Producer(buffer);
        new Consumer(buffer);
    }
}

package xyzpackage;
import abcpackage.Package1;
public class Package2{
        public static void main(String args[]){
        Package1 p=new Package1();
        p.input();
        p.calculate();
}
}

package abcpackage;
import java.util.Scanner;
public class Package1
{
       Scanner sc=new Scanner(System.in);
       
       int a,b,sum; 
       double avg;
       
       public void input(){
        a=sc.nextInt();
        b=sc.nextInt();
       }
       public void calculate(){
       sum=a+b;
       avg=sum/2;

       System.out.println("sum"+sum);
       System.out.println("avg"+avg);
}
}

package abcpackage;
import java.util.Scanner;
public class Package1
{
       Scanner sc=new Scanner(System.in);
       
       int a,b,sum; 
       double avg;
       
       public void input(){
        a=sc.nextInt();
        b=sc.nextInt();
       }
       public void calculate(){
       sum=a+b;
       avg=sum/2;

       System.out.println("sum"+sum);
       System.out.println("avg"+avg);
}
}

import java.util.ArrayList;

class Account {
    protected String accountNumber;
    protected double balance;

    public Account(String accountNumber, double balance) {
        this.accountNumber = accountNumber;
        this.balance = balance;
    }

    public void deposit(double amount) {
        balance += amount;
        System.out.println("Deposited: $" + amount);
        printBalance();
    }

    public void withdraw(double amount) {
        if (amount <= balance) {
            balance -= amount;
            System.out.println("Withdrawn: $" + amount);
        } else {
            System.out.println("Insufficient funds");
        }
        printBalance();
    }

    public void printBalance() {
        System.out.println("Current Balance: $" + balance);
    }
}

class SavingsAccount extends Account {
    private double interestRate;

public SavingsAccount(String accountNumber, double balance, double interestRate) {
        super(accountNumber, balance);
        this.interestRate = interestRate;
    }

    public void applyInterest() {
        balance += balance * interestRate;
        System.out.println("Interest applied. Updated Balance: $" + balance);
    }
}

class CheckingAccount extends Account {
    private double overdraftLimit;

    public CheckingAccount(String accountNumber, double balance, double overdraftLimit) {
        super(accountNumber, balance);
        this.overdraftLimit = overdraftLimit;
    }

    @Override
    public void withdraw(double amount) {
        if (amount <= balance + overdraftLimit) {
            balance -= amount;
            System.out.println("Withdrawn: $" + amount);
        } else {
            System.out.println("Exceeded overdraft limit");
        }
        printBalance();
    }
}

class Customer {
    private String name;
    private ArrayList<Account> accounts;

    public Customer(String name) {
        this.name = name;
        this.accounts = new ArrayList<>();
    }

    public void addAccount(Account account) {
        accounts.add(account);
        System.out.println(name + " added an account: " + account.accountNumber);
    }

    public void printAccounts() {
        System.out.println(name + "'s Accounts:");
        for (Account account : accounts) {
            System.out.println(account.accountNumber);
        }
    }
}

class Employee {
    private String name;

    public Employee(String name) {
        this.name = name;
    }

    public void processTransaction(Account account, double amount) {
        account.deposit(amount);
    }
}

public class BankingApplication {
    public static void main(String[] args) {
        Customer customer1 = new Customer("John Doe");
        SavingsAccount savingsAccount = new SavingsAccount("SA123", 1000.0, 0.02);
        CheckingAccount checkingAccount = new CheckingAccount("CA456", 500.0, 200.0);

        customer1.addAccount(savingsAccount);
        customer1.addAccount(checkingAccount);
        customer1.printAccounts();

        Employee bankEmployee = new Employee("Bank Employee");
        bankEmployee.processTransaction(savingsAccount, 200.0);
        bankEmployee.processTransaction(checkingAccount, 300.0);

        savingsAccount.applyInterest();
    }
}

class D
{
    public static void main(String[] args){
        //System.out.println(10/0);
        throw new ArithmeticException("not divide it by 0");
    }
}

SELECT ProductID, ProductName, CategoryName
FROM Products
INNER JOIN Categories ON Products.CategoryID = Categories.CategoryID;
​

SELECT Customers.CustomerName, Orders.OrderID
FROM Customers
LEFT JOIN Orders
ON Customers.CustomerID=Orders.CustomerID
ORDER BY Customers.CustomerName;
​

​

Alpha-beta pruning is a modified version of the minimax algorithm. It is an optimization technique for the minimax algorithm.
As we have seen in the minimax search algorithm that the number of game states it has to examine are exponential in depth of the tree. Since we cannot eliminate the exponent, but we can cut it to half. Hence there is a technique by which without checking each node of the game tree we can compute the correct minimax decision, and this technique is called pruning. This involves two threshold parameter Alpha and beta for future expansion, so it is called alpha-beta pruning. It is also called as Alpha-Beta Algorithm.
Alpha-beta pruning can be applied at any depth of a tree, and sometimes it not only prune the tree leaves but also entire sub-tree.
The two-parameter can be defined as:
Alpha: The best (highest-value) choice we have found so far at any point along the path of Maximizer. The initial value of alpha is -∞.
Beta: The best (lowest-value) choice we have found so far at any point along the path of Minimizer. The initial value of beta is +∞.
The Alpha-beta pruning to a standard minimax algorithm returns the same move as the standard algorithm does, but it removes all the nodes which are not really affecting the final decision but making algorithm slow. Hence by pruning these nodes, it makes the algorithm fast.

Modifications to min-max: There are some heuristic search methods other than alpha-beta pruning method which are used to improve the performance of min-max procedure. They are: 
Greedy hill climbing method 
Artificial immune algorithm 

Mini-max algorithm is a recursive or backtracking algorithm which is used in decision-making and game theory. It provides an optimal move for the player assuming that opponent is also playing optimally.
Mini-Max algorithm uses recursion to search through the game-tree.
Min-Max algorithm is mostly used for game playing in AI. Such as Chess, Checkers, tic-tac-toe, go, and various tow-players game. This Algorithm computes the minimax decision for the current state.
In this algorithm two players play the game, one is called MAX and other is called MIN.
Both the players fight it as the opponent player gets the minimum benefit while they get the maximum benefit.
Both Players of the game are opponent of each other, where MAX will select the maximized value and MIN will select the minimized value.
The minimax algorithm performs a depth-first search algorithm for the exploration of the complete game tree.

Min-Max algorithm : 
Step 1: Set FINAL_VALUE to be minimum as possible. 
Step 2 : If limit of search has been reached, then FINAL_VALUE = 
GOOD_VALUE of the current position. 
Step 3: Else do. 
Step 3.1 : Generate the successors of the position. 
Step 3.2: Recursively call MIN-MAX again with the present position with 
depth incremented by unity. 
Step 4: Evaluate the GOOD_VALUE. 
Step 5 : If GOOD_VALUE > FINAL_VALUE then FINAL_VALUE = GOOD_VALUE.

Example: 
Consider a game which has 4 final states and paths to reach final state are from root to 4 leaves of a perfect binary tree as shown below. Assume you are the maximizing player and you get the first chance to move

https://media.geeksforgeeks.org/wp-content/uploads/minmax.png

Maximizer goes LEFT: It is now the minimizers turn. The minimizer now has a choice between 3 and 5. Being the minimizer it will definitely choose the least among both, that is 3
Maximizer goes RIGHT: It is now the minimizers turn. The minimizer now has a choice between 2 and 9. He will choose 2 as it is the least among the two values.
Being the maximizer you would choose the larger value that is 3. Hence the optimal move for the maximizer is to go LEFT and the optimal value is 3.

class D
{
    public static void main(String[] args){
        try
        {
            String a="hello";
            System.out.println(a.toUpperCase());
        }
        catch(Exception e)
        {
            System.out.println(e);
        }
        finally
        {
            try
            {
                System.out.println(10/0);
            }
            catch(Exception p)
            {
                System.out.println(p);
            }
            finally
            {
                System.out.println("System ended");
            }
        }
    }
}

class D
{
    public static void main(String[] args){
        try
        {
            String a="hello";
            System.out.println(a.toUpperCase());
        }
        catch(Exception e)
        {
            System.out.println(e);
        }
        finally
        {
            try
            {
                System.out.println(10/0);
            }
            catch(Exception p)
            {
                System.out.println(p);
            }
            finally
            {
                System.out.println("System ended");
            }
        }
    }
}

  <Identity Name="Contoso.AssetTracker" 
    Version="1.0.0.0" 
    Publisher="CN=Contoso Software, O=Contoso Corporation, C=US"/>

message Check {
    string rro_fn = 1;
    int64 date_time = 2;
    bytes check_sign = 3;
    int32 local_number = 4;
    enum Type {
        UNKNOWN = 0;
        CHK = 1;
        ZREPORT = 2;
        SERVICECHK = 3;
    }
    Type check_type = 5;
    string id_offline = 6;
    string id_cancel = 7;

}

//Les tableaux 
// Opérateurs + 
$a = [1, 2];
$b = [4, 5, 6];

print_r($a + $b); //Output = 1, 2, 6 
//Prends la valeur du tableaux de droite et si pas d'index prends la valeur de gauche

// Opérateurs == ne prends pas en compte l'ordre
// Opérateurs === prends en compte l'ordre

// Spread operator :
print_r([...$a, ...$b]); // [1, 2, 4, 5, 6]
// Le tableaux n'existe plus et on étend les valeurs 

//&$variable Récupère l'adresse mémoire d'une variable

// Assigner une valeur à un tableaux :
// Ajouter une valeur à l'index suivant
$arr = [1];
$arr[] = 2; //Output = [1, 2]
// Equivalence avec le spread :
$arr = [...$arr, 3]; // Assigne un nouveau tableau et spread l'ancien en assignant une nouvelle valeur
$arr = [-1, ...$arr]; //Ajoute une valeur au début
array_push($arr, 4);


// Return a random value
$arr = ['orrange', 'blue', 'yellow'];
$value = array_rand($arr);
echo $arr[$value];

// Remove duplicates
$arr2 = ['test', 'test', 1, 2, 3];
$res = array_unique($arr2);

.mini-cart-qnt.quantity{display:flex;padding-right:20px}.mini-cart-qnt a{width:20px;cursor:pointer;display:flex;height:35px;align-items:center;justify-content:center}.mini-cart-qnt .btnPlus{border:1px solid;border-left:0}.mini-cart-qnt .btnMinus{border:1px solid;border-right:0px}.mini-cart-qnt input{height:35px;width:50px;border-radius:0;outline:0;-moz-appearance:textfield}.mini-cart-qnt input::-webkit-inner-spin-button,.mini-cart-qnt input::-webkit-outer-spin-button{-webkit-appearance:none;margin:0}

.loader{position:relative}.lodgin-mini-cart-item{background:#00000070;display:none;position:absolute;width:100%;height:100%;z-index:3;justify-content:center;align-items:center}.loader .lodgin-mini-cart-item{display:flex}.loading-mini-cart{position:relative;width:50px;height:50px}.loading-mini-cart:after{content:'';position:absolute;left:0;bottom:0;z-index:5;width:50px;height:50px;border:10px solid #f3f3f3;border-radius:50%;border-top:10px solid #d6952c;-webkit-animation:spin 2s linear infinite;animation:spin 2s linear infinite}@-webkit-keyframes spin{0%{-webkit-transform:rotate(0)}100%{-webkit-transform:rotate(360deg)}}@keyframes spin{0%{transform:rotate(0)}100%{transform:rotate(360deg)}}

.devnet_fsl-free-shipping .fsl-notice,.devnet_fsl-free-shipping .notice,.devnet_fsl-free-shipping .fsl-title,.devnet_fsl-free-shipping .title{width:100%;display:block;text-align:center}.devnet_fsl-free-shipping{width:100%;margin:1rem 0 2rem;padding:1rem 2rem;box-shadow:0 0 2rem -1rem #000;box-sizing:border-box}.devnet_fsl-free-shipping .fsl-title,.devnet_fsl-free-shipping .title{margin:2rem auto;font-size:1.1em}.devnet_fsl-free-shipping .fsl-notice .woocommerce-Price-amount.amount,.devnet_fsl-free-shipping .notice .woocommerce-Price-amount.amount{font-weight:bold}.devnet_fsl-free-shipping .fsl-.progress-bar,.devnet_fsl-free-shipping .progress-bar{width:100%;justify-content:flex-start;margin:1rem 0;border:.0625rem solid #000;border-radius:.5rem;box-shadow:0 .3rem 1rem -0.5rem #000}.devnet_fsl-free-shipping .fsl-.progress-bar .fsl-.progress-amount,.devnet_fsl-free-shipping .fsl-.progress-bar .progress-amount,.devnet_fsl-free-shipping .progress-bar .fsl-.progress-amount,.devnet_fsl-free-shipping .progress-bar .progress-amount{position:relative;display:block;border-radius:.5rem}.devnet_fsl-free-shipping .fsl-.progress-bar span,.devnet_fsl-free-shipping .progress-bar span{display:inline-block;height:100%;border-radius:3px;box-shadow:0 1px 0 rgba(255,255,255,.5) inset;transition:width .4s ease-in-out}.devnet_fsl-free-shipping .fsl-.progress-bar.shine span,.devnet_fsl-free-shipping .progress-bar.shine span{position:relative}.devnet_fsl-free-shipping .fsl-.progress-bar.shine span::after,.devnet_fsl-free-shipping .progress-bar.shine span::after{content:"";opacity:0;position:absolute;top:0;right:0;bottom:0;left:0;background:#fff;border-radius:3px;-webkit-animation:animate-shine 2s ease-out infinite;animation:animate-shine 2s ease-out infinite}.devnet_fsl-free-shipping .fsl-.progress-bar.stripes span,.devnet_fsl-free-shipping .progress-bar.stripes span{background-size:30px 30px;background-image:linear-gradient(135deg, rgba(255, 255, 255, 0.15) 25%, transparent 25%, transparent 50%, rgba(255, 255, 255, 0.15) 50%, rgba(255, 255, 255, 0.15) 75%, transparent 75%, transparent);-webkit-animation:animate-stripes 3s linear infinite;animation:animate-stripes 3s linear infinite}.devnet_fsl-free-shipping.qualified-message .title{margin:0;padding:0}@-webkit-keyframes animate-stripes{0%{background-position:0 0}100%{background-position:60px 0}}@keyframes animate-stripes{0%{background-position:0 0}100%{background-position:60px 0}}@-webkit-keyframes animate-shine{0%{opacity:0;width:0}50%{opacity:.5}100%{opacity:0;width:100%}}@keyframes animate-shine{0%{opacity:0;width:0}50%{opacity:.5}100%{opacity:0;width:100%}}.devnet_fsl-no-shadow{border:none;box-shadow:none}.devnet_fsl-label{display:block !important;margin:1rem auto;padding:.3rem .5rem;font-size:.8em;font-weight:bold;text-align:center;box-shadow:0 5px 16px -8px #000}.devnet_fsl-no-animation .shine span.progress-amount{-webkit-animation:none;animation:none}.devnet_fsl-no-animation .shine span.progress-amount::after{-webkit-animation:none;animation:none}.summary .devnet_fsl-label{max-width:-webkit-max-content;max-width:-moz-max-content;max-width:max-content;margin:inherit;margin:.5rem 0 1rem}
.elementor-menu-cart__main .devnet_fsl-free-shipping {padding: 0px 10px;box-shadow: none; margin:20px 0px 10px;}

html

 <div class="mobile-nav">
            <div class="container">
                <div class="row">
                    <div class="col-md-2">
                        <div id="clickBtn" class="clickBtn toggle-btn">
                            <span></span>
                            <span></span>
                            <span></span>
                        </div>
                        <div class="bgoverly">
                            <div id="sideBar" class="sidebar">
                                <div class="top_sect_menu">
                                    <div class="topsecleft">
                                        <?php the_custom_logo(); ?>
                                    </div>
                                    <div class="close">
                                        <img src="<?php echo get_template_directory_uri(); ?>/img/closeX.png"
                                            alt="close">
                                    </div>
                                </div>
                                <?php
                                wp_nav_menu(
                                    array(
                                        'theme_location' => 'mobile-menu',
                                        'menu_id' => '-1',
                                    )
                                ); ?>
                                <div class="mobile-bottom-sect">
                                    <a class="mobile-contact" href="">Contact Us</a>
                                    <div class="mobile-icons">
                                        <a href=""><i class="fa-brands fa-facebook-f"></i></a>
                                        <a href=""><i class="fa-brands fa-twitter"></i></a>
                                        <a href=""><i class="fa-brands fa-linkedin-in"></i></a>
                                        <a href=""><i class="fa-brands fa-instagram"></i></a>
                                    </div>
                                </div>
                            </div>
                        </div>
                    </div>
                    <div class="col-md-7">
                        <div class="mobile-logo">
                            <?php the_custom_logo(); ?>
                        </div>
                    </div>
                    <div class="col-md-3">
                        <div class="mobile-login">
                            <a href="" class="header-btn2">Get Free Trial</a>
                        </div>
                    </div>
                </div>
            </div>
        </div>



css






div#clickBtn {
    cursor: pointer;
    position: relative;
    z-index: 9999;
}

.top_sect_menu {
    display: grid;
    grid-template-columns: 70% 30%;
    align-items: center;
}

.mobile-logo {
    text-align: center;
}

.mobile-nav .col-md-3 {
    display: flex;
    justify-content: end;
    align-items: center;
}

.mobile-nav .col-md-2 {
    display: flex;
    align-items: center;
}

.bgoverly {
    position: fixed;
    top: 0;
    left: -10000px;
    width: 100%;
    height: 100%;
    background: #0000005e;
    z-index: 9999999999999999999999999999;
    transition: all 0.75s;
}

.toggle-btn span {
    width: 40px;
    height: 4px;
    background: #000;
    margin: 8px 0;
    display: block;
    transition: .5s;
    border-radius: 10px;
}

#sideBar.active,
.bgoverly.active {
    left: 0px !important;
    transition: all 0.25s;
}

#sideBar {
    margin: 0;
    position: fixed;
    width: 555px;
    height: 100%;
    top: 0;
    background: #fff;
    /*left: -4000px;*/
    transition: all 0.75s;
    padding: 35px 50px 30px 40px;
    /* overflow: scroll; */
}

.close {
    text-align: end;
    cursor: pointer;

}

.menu-mobile-menu-container {
    padding-top: 60px;
}

.menu-mobile-menu-container ul {
    margin: 0;
    padding: 0;
}

.menu-mobile-menu-container li {
    list-style: none;
    margin-bottom: 30px;
}

.menu-mobile-menu-container a {
    text-decoration: none;
    color: #091e1c;
    font-family: 'ClashGrotesk';
    font-size: 30px;
    font-weight: 600;
}

.mobile-contact {
    padding: 14px 46px;
    background-color: #ef6023;
    color: #fff;
    text-decoration: none;
    font-size: 23px;
    font-family: 'ClashGrotesk';
    font-weight: 600;
    border-radius: 10px;

}

.mobile-bottom-sect {
    display: flex;
    align-items: center;
    justify-content: space-between;
    margin-top: 70px;
}

.mobile-icons a {
    margin-right: -12px;
    display: flex;
    background-color: #0f513e;
    justify-content: center;
    align-items: center;
    width: 60px;
    height: 60px;
    text-decoration: none;
    color: #fff;
    font-size: 24px;
    border-radius: 100%;
    border: 4px solid white;
}

.mobile-icons {
    display: flex;
    gap: 2px;
    justify-content: end;
}

.mobile-nav {
    display: none;
}




js





jQuery(".clickBtn").on('click', function () {
    jQuery(".sideBar").addClass('active');
    jQuery(".bgoverly").addClass('active');
    jQuery('body').addClass('active-nav');
});
jQuery('.bgoverly').on('click', function () {
    jQuery("#sideBar").removeClass('active');
    jQuery(".bgoverly").removeClass('active');
    jQuery('body').removeClass('active-nav');
});


jQuery('a[href^="#"]').on('click', function (e) {
    e.closeNav();
    e.preventDefault();
});




hamber gur 2
document.addEventListener("DOMContentLoaded", function () {
    const clickBtn = document.querySelector(".clickBtn");
    const sideBar = document.querySelector(".sidebar");
    const bgOverlay = document.querySelector(".bgoverly");
    const body = document.body;

    const openMenuHTML = `
        <div class="three-toggle">
              <span class="short-line"></span>
              <span class="large-line"></span>
              <span class="short-line"></span>
        </div>`;
    const closeMenuHTML = `
        <div class="make-close">
            <img src="https://mmcgbl.com/wp-content/uploads/2024/11/closeX.webp" alt="close">
        </div>`;

    clickBtn.addEventListener("click", function () {
        const isSidebarOpen = sideBar.classList.contains("active");
        sideBar.classList.toggle("active");
        bgOverlay.classList.toggle("active");
        body.classList.toggle("sidebar-open");
        if (isSidebarOpen) {
            clickBtn.innerHTML = openMenuHTML;
        } else {
            clickBtn.innerHTML = closeMenuHTML;
        }
    });

    const menuItems = document.querySelectorAll(".mega-menu-item.nav-item.has-submenu");
    menuItems.forEach((item) => {
        const subMenu = item.querySelector(".sub-menu");
        item.addEventListener("click", function(event) {
            event.preventDefault();
            menuItems.forEach(otherItem => {
                const otherSubMenu = otherItem.querySelector(".sub-menu");
                if (otherSubMenu !== subMenu) {
                    otherSubMenu.classList.remove("open");
                    otherItem.classList.remove("open");
                }
            });
            subMenu.classList.toggle("open");
            item.classList.toggle("open");
        });

        const subMenuLinks = subMenu.querySelectorAll("a");
        subMenuLinks.forEach((link) => {
            link.addEventListener("click", function(event) {
                event.stopPropagation();
            });
        });
    });
});

?>
<div class="mobile-custome-menu">
    <div id="clickBtn" class="clickBtn toggle-btn">
        <div class="three-toggle">
            <span class="short-line"></span>
            <span class="large-line"></span>
            <span class="short-line"></span>
        </div>
    </div>
    <div class="bgoverly">
        <div id="sideBar" class="sidebar">
            <?php
          wp_nav_menu(array(
         'menu' => 'Home New Mobile',
          'menu_id' => '-1',
           ));
           ?>
        </div>
    </div>
</div>

Heuristic is a function which is used in Informed Search, and it finds the most promising path. It takes the current state of the agent as its input and produces the estimation of how close agent is from the goal. The heuristic method, however, might not always give the best solution, but it guaranteed to find a good solution in reasonable time. Heuristic function estimates how close a state is to the goal. It is represented by h(n), and it calculates the cost of an optimal path between the pair of states. The value of the heuristic function is always positive.

h(n) <= h*(n)  
Here h(n) is heuristic cost, and h*(n) is the estimated cost. Hence heuristic cost should be less than or equal to the estimated cost.

class G
{
    public static void main(String[] args){
    try
    {
        int a=10, b=0 , c;
        c=a/b;
        System.out.println(c);
        System.out.println("no error found");
    }
    catch(Exception a)
    {
        try
        {
            String p="okkk";
            System.out.println(p.toUpperCase());
            System.out.println("some  error found");
        }
        catch(Exception u)
        {
            System.out.println("big  error found");
        }
    }
    
    }
}

class D
{
    public static void main(String[] args){
        try{
            try{
                int a=10,b=10,c;
                c=a+b;
                System.out.println(c);
                System.out.println("no error found in ap");
            }
            catch(ArithmeticException a )
            {
                System.out.println("some error found in ap function");
            }
            int a[]={10,20,23,44};
            System.out.println(a[3]);
            System.out.println("no error found in array ");
        }
        catch(ArrayIndexOutOfBoundsException a)
        {
            System.out.println("some error found in array function");
        }
    }
}

select * from worker exists join personUser
  where worker.Person == personUser.PersonParty
	&& personUser.User == curUserId();

select DefaultDimension from HcmEmployment where HcmEmployment.Worker == worker.RecId;
//Department = HcmWorkerHelper::getPrimaryDepartmentRecId(HcmWorkerLookup::currentWorker());
OMOperatingUnit OMOperatingUnit;
OMOperatingUnit = HcmWorkerHelper::getPrimaryDepartment(HcmWorkerLookup::currentWorker());
Department = OMOperatingUnit.OMOperatingUnitNumber;
//Info(Department);
//Department = DimensionAttributeValueSetStorage::find(HcmEmployment.DefaultDimension).getDisplayValueByDimensionAttribute(DimensionAttribute::findByName("Department").RecId);
//  Info(Department);
qbdsdimensionAttributeValueSet = purchTable_ds.query().dataSourceTable(tableNum(PurchTable)).addDataSource(tableNum(dimensionAttributeValueSet));

qbdsdimensionAttributeValueSet.addLink(fieldNum(PurchTable,DefaultDimension),
                                       fieldNum(dimensionAttributeValueSet,RecId));
qbdsdimensionAttributeValueSet.joinMode(JoinMode::ExistsJoin);
qbdsdimensionAttributeValueSet.relations(true);
qbdsdimensionAttributeValueSet.fetchMode(QueryFetchMode::One2One);

qbdsdimensionAttributeValueSetItemView = purchTable_ds.query().dataSourceTable(tableNum(PurchTable)).addDataSource(tableNum(dimensionAttributeValueSetItemView));
qbdsdimensionAttributeValueSetItemView.addLink(fieldNum(PurchTable,DefaultDimension),
                                               fieldNum(dimensionAttributeValueSetItemView,DimensionAttributeValueSet));
qbdsdimensionAttributeValueSetItemView.joinMode(JoinMode::ExistsJoin);
qbdsdimensionAttributeValueSetItemView.relations(true);
qbdsdimensionAttributeValueSetItemView.fetchMode(QueryFetchMode::One2One);
qbdsdimensionAttributeValueSetItemView.addRange(fieldNum(dimensionAttributeValueSetItemView,DisplayValue)).value(Department);

qbdsDimensionAttribute = qbdsdimensionAttributeValueSetItemView.addDataSource(tableNum(DimensionAttribute));
qbdsDimensionAttribute.addLink(fieldNum(dimensionAttributeValueSetItemView,DimensionAttribute),
                               fieldNum(DimensionAttribute,RecId));
qbdsDimensionAttribute.joinMode(JoinMode::ExistsJoin);
qbdsDimensionAttribute.relations(true);
qbdsDimensionAttribute.fetchMode(QueryFetchMode::One2One);
qbdsDimensionAttribute.addRange(fieldNum(DimensionAttribute,Name)).value("DEPARTMENT");

@isTest
public class customer360CommunicationsHelperTest {
    @isTest
    static void getCaseAccountContactTest(){
        
        //Creating a test Account
        Account testAccount = new Account(
            Name = 'Test Account'
        );
        insert testAccount;
        
        //Creating a test Individual 
        Individual testIndividual = new Individual (
        	FirstName = 'Test',
            LastName = 'Individual',
            HasOptedOutSolicit = false
        );
        insert testIndividual;
        
        //Creating a test Contact and assigning the Individual to the Contact
        Contact testContact = new Contact(
            FirstName = 'Test',
            LastName = 'Contact',
            Email = 'TestEmail@hotmail.com',
            AlternativeBillingName__c = 'Test Billing Name',
            ContactPreferences__c = 'Email',
            PreferredCommunicationFormat__c = 'Standard',
            IndividualId = testIndividual.Id
        );
        insert testContact;
        
        //Associating the test Case to the Account and Contact
        Case testCase = new Case(
            Subject = 'Test Case',
            AccountId = testAccount.Id,
            ContactId = testContact.Id
        );
        insert testCase;
        
        List<Id> caseId = new List<Id>{testCase.Id};
        
        Test.startTest();
        List<Map<String, String>> result = customer360CommunicationsHelper.getCaseAccountContact(caseId);
        Test.stopTest();
        
        Map<String, String> resultMap = result[0];
        
        System.assertEquals('Test Account', resultMap.get('AccountName'));
        System.assertEquals(testAccount.Id, resultMap.get('AccountId'));
        System.assertEquals(testContact.Id, resultMap.get('ContactId'));
    }

}

public with sharing class customer360CommunicationsHelper {

    @AuraEnabled(cacheable=true)
    public static List<Map<String, String>> getCaseAccountContact(List<Id> caseId) {

        //Creating a new Map String to return the variables
        List<Map<String, String>> caseAccountContactList = new List<Map<String, String>>();
        
        //SOQL querey to retrieved the Desired fields from the Case
        List<Case> relatedCases = [SELECT AccountId, ContactId, Account.Name, Contact.AlternativeBillingName__c, Contact.ContactPreferences__c, Contact.PreferredCommunicationFormat__c, 
                                    Contact.Individual.HasOptedOutSolicit FROM Case WHERE Id IN :caseId LIMIT 1];

        Case relatedCase = relatedCases[0];

        //Checking if there is an AccountId and ContactId on the Case
        if (relatedCase.AccountId != null && relatedCase.ContactId != null) {
            
            //Creating a new Map String to add the fields onto
            Map<String, String> caseAccountContactMap = new Map<String, String>();

            //All the desired fields are then put into the caseAccountContactMap
            caseAccountContactMap.put('AccountName', relatedCase.Account?.Name);
            caseAccountContactMap.put('AccountId', relatedCase.AccountId);
            caseAccountContactMap.put('ContactId', relatedCase.ContactId);
            caseAccountContactMap.put('ContactAlternativeBillingName', String.isBlank(relatedCase.Contact?.AlternativeBillingName__c) ? '' : relatedCase.Contact.AlternativeBillingName__c);
            caseAccountContactMap.put('ContactOpted', relatedCase.Contact?.Individual.HasOptedOutSolicit != null && relatedCase.Contact.Individual.HasOptedOutSolicit ? 'Opt Out' : '');
            caseAccountContactMap.put('ContactPreferences', relatedCase.Contact?.ContactPreferences__c != null ? relatedCase.Contact.ContactPreferences__c : '');
            caseAccountContactMap.put('PreferredCommunicationFormat', relatedCase.Contact?.PreferredCommunicationFormat__c != null ? relatedCase.Contact.PreferredCommunicationFormat__c : '');

            //The caseAccountContactMap is added onto the caseAccountContactMap
            caseAccountContactList.add(caseAccountContactMap);
        }
        return caseAccountContactList;
    }
}

.slds-box{
   background-color: rgb(243,243,243);
}

.slds-accordion_communications{
   --slds-c-accordion-heading-text-color: #0176d3;
   --slds-c-accordion-heading-font-size: 10pt;
   --slds-c-accordion-section-spacing-inline-start: ;
}

import { LightningElement, api, wire } from 'lwc';
import { NavigationMixin } from 'lightning/navigation';
import getCaseAccountContact from '@salesforce/apex/customer360CommunicationsHelper.getCaseAccountContact';

//Columns to show the Account Name and the Alternative Billing Name
const columns = [
    { 
        label: 'Account Name', 
        fieldName: 'AccountId', 
        type: 'url',
        typeAttributes: {
            label: { fieldName: 'AccountName' }, 
            target: '_self' 
        }
    },
    { 
        label: 'Alternative Billing Name', 
        fieldName: 'AlternativeBillingName', 
        type: 'url',
        typeAttributes: {
            label: { fieldName: 'ContactAlternativeBillingName' }, 
            target: '_self'
        } 
    },
];

//URL variables
const ACCOUNT_URL = '/lightning/r/Account/';
const CONTACT_URL = '/lightning/r/Contact/';
const VIEW_URL = '/view';

export default class Customer360Communications extends NavigationMixin(LightningElement) {
    columns = columns;
    @api recordId; 
    contact;

    //Text Variables
    contactPreferencesFormatText = 'Communications format - ';
    contactPreferencesText = 'Communication preference -  ';
    marketingConsentText = 'Marketing consent - ';
    
    @wire(getCaseAccountContact, { caseId: '$recordId' })
    wiredData({ error, data }) {
        if (data) {
            this.caseAccountContactData = data.map(contact => ({
                ...contact,
                AccountId: contact.AccountId ? ACCOUNT_URL + contact.AccountId + VIEW_URL : '', 
                AlternativeBillingName: contact.ContactAlternativeBillingName ? CONTACT_URL + contact.ContactId + VIEW_URL : '',
                strContactURL: CONTACT_URL + contact.ContactId + VIEW_URL,
                strMarketingConsent: this.marketingConsentText + contact.ContactOpted,
                strContactPrefs: this.contactPreferencesText + contact.ContactPreferences,
                strCommsPrefFormat: this.contactPreferencesFormatText + contact.PreferredCommunicationFormat
            }));
            this.contact = this.caseAccountContactData[0];
        } else if (error) {
            console.error('Error fetching data:', error);
        }
    }
}

<template>
    <lightning-layout-item>
        <h3 class="slds-text-heading_small slds-col slds-p-around_small brandColor"><b>Updated Communications Section</b></h3>
        <div class="slds-box">
            <!-- Checking if there is data returned -->
            <template if:true={contact}>
                <!-- Creating a Lightning Accordion Section -->
                <lightning-accordion allow-multiple-sections-open class = "slds-accordion_communications">
                    <lightning-accordion-section  label="Alternative billing name ">
                        <!-- Creating a Lightning DataTable to view that Data Returned -->
                        <lightning-datatable
                            key-field="id"
                            data={caseAccountContactData}
                            columns={columns}
                            hide-checkbox-column="true">
                        </lightning-datatable>
                    </lightning-accordion-section>
                </lightning-accordion>
                <!-- Creating new fields and formatting it in a URL -->
                <p><lightning-formatted-url value={contact.strContactURL} label={contact.strMarketingConsent} target="_self"></lightning-formatted-url></p>
                <p><lightning-formatted-url value={contact.strContactURL} label={contact.strContactPrefs} target="_self"></lightning-formatted-url></p>
                <p><lightning-formatted-url value={contact.strContactURL} label={contact.strCommsPrefFormat} target="_self"></lightning-formatted-url></p>
            </template>
            <!-- Checking if there is no data returned -->
            <template if:false={contact}>
                <div> There is no Communication record.</div>
            </template>
        </div>
    </lightning-layout-item>
</template>

pip install fpdf2
https://pypi.org/project/fpdf2/

class F
{
    public static void main(String[] args){
        try
        {
            int a=10 , b=0 , c;
            c=a+b;
            System.out.println(c);
            
            int d[]={10,20};
            System.out.println(d[1]);
            
            String j = "amkit";
            System.out.println(j.toUpperCase());
           
        }
        catch(ArrayIndexOutOfBoundsException d)
        {
            System.out.println("array error");
        }
        catch(ArithmeticException F)
        {
           System.out.println("ap error");
        }
        catch(NumberFormatException o)
        {
            System.out.println("number format error");
        }
        catch(Exception L)
        {
            System.out.println("some basic error ");
        }
    }
}

In this component we show an overview of the Contact such as the Marketing Consent, Communication Format and the Preferred Communication Format

You are given an m liter jug and a n liter jug. Both the jugs are initially empty. The jugs don’t have markings to allow measuring smaller quantities. You have to use the jugs to measure d liters of water where d is less than n. 

Initial State, Goal State, and Actions:
The initial state is where you start. In the classic scenario, this typically means both jugs are empty.
The goal state is where you want to reach, representing the desired water level, e.g., 4 liters.
Actions are the operations you can perform on the jugs, such as filling, emptying, or pouring water between them.

Let's consider a scenario with a 3-liter jug and a 5-liter jug, where you want to measure 4 liters of water.

Production rules-
Start with both jugs empty (0, 0).
Fill the 3-liter jug (3, 0).
Pour water from the 3-liter jug into the 5-liter jug (0, 3).
Fill the 3-liter jug again (3, 3).
Pour water from the 3-liter jug into the 5-liter jug until it's full (1, 5).
Empty the 5-liter jug (1, 0).
Pour the remaining water from the 3-liter jug into the 5-liter jug (0, 1).
Fill the 3-liter jug (3, 1).
Pour water from the 3-liter jug into the 5-liter jug until it's full (0, 4).

class F
{
    public static void main(String[] args){
        try
        {
            int a=10,b=0,c;
            c=a/b;
            System.out.println(c);
        }
        catch(Exception a)
        {
            
            System.out.println("error found ");
        }
        try
        {
            int a[] ={10,20,30};
            System.out.println(a[3]);
        }
        catch(ArrayIndexOutOfBoundsException b)
        {
            System.out.println("error found ");
        }
        
        
    }
}

Hill climbing algorithm is a local search algorithm which continuously moves in the direction of increasing elevation/value to find the peak of the mountain or best solution to the problem. It terminates when it reaches a peak value where no neighbor has a higher value.
Hill climbing algorithm is a technique which is used for optimizing the mathematical problems. One of the widely discussed examples of Hill climbing algorithm is Traveling-salesman Problem in which we need to minimize the distance traveled by the salesman.
It is also called greedy local search as it only looks to its good immediate neighbor state and not beyond that.
A node of hill climbing algorithm has two components which are state and value.
Hill Climbing is mostly used when a good heuristic is available.
In this algorithm, we don't need to maintain and handle the search tree or graph as it only keeps a single current state.

Algorithm for Simple Hill Climbing:
Step 1: Evaluate the initial state, if it is goal state then return success and Stop.
Step 2: Loop Until a solution is found or there is no new operator left to apply.
Step 3: Select and apply an operator to the current state.
Step 4: Check new state:
If it is goal state, then return success and quit.
Else if it is better than the current state then assign new state as a current state.
Else if not better than the current state, then return to step2.
Step 5: Exit.

Problems in Hill Climbing Algorithm:
1. Local Maximum: A local maximum is a peak state in the landscape which is better than each of its neighboring states, but there is another state also present which is higher than the local maximum.

Solution: Backtracking technique can be a solution of the local maximum in state space landscape. Create a list of the promising path so that the algorithm can backtrack the search space and explore other paths as well.

Hill Climbing Algorithm in AI
2. Plateau: A plateau is the flat area of the search space in which all the neighbor states of the current state contains the same value, because of this algorithm does not find any best direction to move. A hill-climbing search might be lost in the plateau area.

Solution: The solution for the plateau is to take big steps or very little steps while searching, to solve the problem. Randomly select a state which is far away from the current state so it is possible that the algorithm could find non-plateau region.

Hill Climbing Algorithm in AI
3. Ridges: A ridge is a special form of the local maximum. It has an area which is higher than its surrounding areas, but itself has a slope, and cannot be reached in a single move.

Solution: With the use of bidirectional search, or by moving in different directions, we can improve this problem.

Hill Climbing Algorithm in AI

class D
{
    public static void main(String[] args){
        
        try
        {
            int a=10,b=2,c;
            c=a/b;
            System.out.println(c);
        }
        catch(Exception a)
        {
            System.out.println("Any error found");
        }
        finally
        {
            System.out.println("no error found");
        }
        System.out.println("system ended");
    }
}

nileshdev0707@gmail.com
pass:-qwerty123

SELECT Products.ProductName,COUNT(OrderDetails.OrderDetailID) AS NumberOfOrders FROM OrderDetails
LEFT JOIN Products ON Products.ProductID = OrderDetails.ProductID
GROUP BY ProductName;

10:44:51.[952613]	>>	 

10:44:51.[962614]	>>	======================================================================

10:44:51.[962614]	>>	                                 SEARCHING FOR BARCODE: [240116032002]

10:44:51.[972615]	>>	======================================================================

10:44:51.[982615]	>>	 

10:44:52.[002616]	>>	 

10:44:52.[002616]	>>	======================================================================

10:44:52.[012618]	>>	         SEND DATA TO ANALYZER: [771D48E8-EEF1-4CB5-9809-67DA55A909F2]

10:44:52.[022618]	>>	======================================================================

10:44:52.[032619]	>>	 

10:44:52.[142625]	>>	S:	<VT>MSH|^~\&|||||20240116104452||QCK^Q02|49|P|2.3.1||||||ASCII|||<CR>MSA|AA|49|order<SP>accepted.|||0|<CR>ERR|0|<CR>QAK|SR|OK|<CR><FS><CR>

10:44:52.[152627]	>>	 

10:44:52.[162627]	>>	======================================================================

10:44:52.[172627]	>>	         SEND DATA TO ANALYZER: [771D48E8-EEF1-4CB5-9809-67DA55A909F2]

10:44:52.[172627]	>>	======================================================================

10:44:52.[182629]	>>	 

10:44:52.[312637]	>>	S:	<VT>MSH|^~\&|||||20240116104452||DSR^Q03|49|P|2.3.1||||||ASCII|||<CR>MSA|AA|49|order<SP>information.|||0|<CR>ERR|0|<CR>QAK|SR|OK|<CR>QRD|20240116104452|R|D|49|||RD|240116032002|OTH|||T|<CR>QRF||||||RCT|COR|ALL||<CR>DSP|1||2565011461|||<CR>DSP|2|||||<CR>DSP|3||นส.<SP>วรรณนิศา<SP>วรสินวิวัฒน์|||<CR>DSP|4||19891228000000|||<CR>DSP|5||F|||<CR>DSP|6|||||<CR>DSP|7|||||<CR>DSP|8|||||<CR>DSP|9|||||<CR>DSP|10|||||<CR>DSP|11|||||<CR>DSP|12|||||<CR>DSP|13|||||<CR>DSP|14|||||<CR>DSP|15|||||<CR>DSP|16|||||<CR>DSP|17|||||<CR>DSP|18|||||<CR>DSP|19|||||<CR>DSP|20|||||<CR>DSP|21||240116032002|||<CR>DSP|22|||||<CR>DSP|23||20240116104452|||<CR>DSP|24||N|||<CR>DSP|25|||||<CR>DSP|26||Serum|||<CR>DSP|27|||||<CR>DSP|28||ผู้ป่วยนอก|||<CR>DSP|29||FT3|||<CR>DSP|30||TSH|||<CR>DSC||<CR><FS><CR>

10:44:52.[422644]	>>	 




#####
#####

11:28:59.[428298]	>>	R:	<VT>MSH|^~\&|||||20240116113214||ORU^R01|60|P|2.3.1||||0||ASCII|||<CR>PID|24|2565011461|||นส.<SP>วรรณนิศา<SP>วรสินวิวัฒน์|||F|||ผู้ป่วยนอก||||||||||||||||||||<CR>OBR|24|240116032002|25|^|N|20240116104807|20240116104807|20240116104807||1^28||||20240116104807|Serum||ผู้ป่วยนอก||||||||5|||||||||||||||||||||||<CR>OBX|1|NM|FT3|FT3|3.66|pg/mL|-|N|||F||3.660317|20240116113214|||0|<CR><FS><CR>

11:28:59.[438299]	>>	 

11:28:59.[438299]	>>	======================================================================

11:28:59.[448301]	>>	         SEND DATA TO ANALYZER: [B4334B09-2A52-4FDA-AC32-DF924254F00A]

11:28:59.[458301]	>>	======================================================================

11:28:59.[468302]	>>	 

11:28:59.[578307]	>>	S:	<VT>MSH|^~\&|||||20240116112859||ACK^R01|60|P|2.3.1||||0||ASCII|||<CR>MSA|AA|60|get<SP>result.|||0|<CR><FS><CR>

11:28:59.[588309]	>>	 

11:28:59.[598310]	>>	======================================================================

11:28:59.[608310]	>>	SAVE DATA TO LIS: [240116032002] - [B4334B09-2A52-4FDA-AC32-DF924254F00A]

11:28:59.[608310]	>>	======================================================================

11:28:59.[618311]	>>	 

11:28:59.[648312]	>>	Insert LN: 2401160320 Barcode: 240116032002 Anacode: FT3 Test Code: CH059 Result: 3.66 Status:  Result Flag: - complete!!!

11:41:50.[978888]	>>	 

State space search is a problem-solving technique used in Artificial Intelligence (AI) to find the solution path from the initial state to the goal state by exploring the various states. The state space search approach searches through all possible states of a problem to find a solution. It is an essential part of Artificial Intelligence and is used in various applications, from game-playing algorithms to natural language processing.

State space search has several features that make it an effective problem-solving technique in Artificial Intelligence. These features include:

Exhaustiveness:
State space search explores all possible states of a problem to find a solution.

Completeness:
If a solution exists, state space search will find it.

Optimality:
Searching through a state space results in an optimal solution.

Uninformed and Informed Search:
State space search in artificial intelligence can be classified as uninformed if it provides additional information about the problem.

In contrast, informed search uses additional information, such as heuristics, to guide the search process.

digram from nb

class D
{
    public static void main(String[] args){
    String str="heavy";
    
    try
    {
        int a=Integer.parseInt(str);
        System.out.println("error not found");
    }
   catch(NumberFormatException n)
   {
       System.out.println("error found");
   }
   System.out.println("system ended ");
} 
}