Snippets Collections
mov [1100h],1115h
mov [1102h],1004h
mov ax,[1100h]
mov bx,[1102h]
mul bx
mov [1200h],bx
hlt
mov [1100h],1115h
mov [1102h],1004h
mov ax,[1100h]
mov bx,[1102h]
add ax,bx
mov [1200h],ax
hlt
//Message Queue(Receivers)
#include <stdio.h> 
#include <sys/ipc.h> 
#include <sys/msg.h> 
  
// structure for message queue
struct mesg_buffer { 
    long mesg_type; 
    char mesg_text[100]; 
} message; 


int main() 
{ 
    key_t key; 
    int msgid;
    // ftok to generate unique key 
    key = ftok("somefile", 65); 
    msgid = msgget(key, 0666 | IPC_CREAT); 
   
    printf("Waiting for a message from Client...:\n "); 
   
    msgrcv(msgid, &message, sizeof(message),1,0); 
    // display the message 
    printf("Message Recieved from Client  is : %s \n", message.mesg_text);
    msgctl(msgid,IPC_RMID,NULL);
    return 0; 
} 
//Message Queue(senders)
#include <stdio.h> 
#include <sys/ipc.h> 
#include <sys/msg.h> 
  
// structure for message queue
struct mesg_buffer { 
    long mesg_type; 
    char mesg_text[100]; 
} message; 


int main() 
{ 
    key_t key; 
    int msgid;
    // ftok to generate unique key 
    key = ftok("somefile", 65); 
    msgid = msgget(key, 0666 | IPC_CREAT); 
    message.mesg_type = 1; 
    printf("Insert message : "); 
    gets(message.mesg_text);
    // msgsnd to send message 
    msgsnd(msgid, &message, sizeof(message), 0); 
    // display the message 
    printf("Message sent to sever is : %s \n", message.mesg_text);

    return 0; 
} 
data segment
num DB 5,9,20,25,79,0  
even db ?
odd db ?
data ends
code segment
assume code:cs,ds:data
start :
mov ax,data
mov ds,ax
lea si,num
mov bl , 0h
mov bh, 0h
mov cl , [si]
inc si
up: mov al,[si]
ror al,1
jc go
inc bl
jmp next
go: inc bh
next: inc si
  dec cl
   jnz up
   mov even,bl
   mov odd,bh
    mov AH,4CH
    INT 21H
code ends
end start

{/* Reject Booking Modal */}
            <Modal backdrop={"opaque"} isOpen={rejectModal.isOpen} onOpenChange={rejectModal.onOpenChange} isDismissable={false} size={"xl"} 
                classNames={{
                    body: " flex flex-grow size-full",
                    base: "border-[#292f46]text-[#a8b0d3] p-2",
                    header: "sm:justify-evenly",
                    footer: "justify-center",
                    closeButton: "hover:bg-[#F31260] bg-[#F31260] text-white text-xl",
                }} >
                <ModalContent>
                    {(onClose) => (<>
                        <ModalHeader className="flex flex-col gap-1 text-4xl font-black">Reject Booking?</ModalHeader>
                        <ModalBody>
                            <Textarea
                                variant="bordered"
                                label="Please provide a reason for rejecting this booking:"
                                isInvalid={isReasonEmpty}
                                errorMessage={isReasonEmpty && "Please enter a reason"}
                                labelPlacement="outside"
                                placeholder="Type here..."
                                value={reason}
                                onChange={(input) => {setReason(input.target.value); setIsReasonEmpty(false); console.log("reason", reason, "isEmpty", isReasonEmpty)}}
                                // onValueChange={setReason}
                            />
                        </ModalBody>
                        <ModalFooter>
                            <Button color="primary" variant="light" onPress={() => { setIsReasonEmpty(false); setReason(''); onClose() }}> Close </Button>
                            <Button color="danger" endContent={<Send2/>} onPress={() => { rejectBooking(accessTokenCookie, transaction?.id); reason !== '' ? onClose() : null; }}> Reject </Button>
                        </ModalFooter>
                    </>)}
                </ModalContent>
            </Modal>
            {showRejectSnackbar && (
                <Snackbar text="Booking rejected successfully!" icon={CheckCircleIcon} onClose={()=>setShowRejectSnackbar(false)} variant="success" />
            )}
            {showCancelSuccessSnackbar && (
                <Snackbar text="Booking cancelled successfully!" icon={CheckCircleIcon} onClose={()=>setShowCancelSuccessSnackbar(false)} variant="success" />
            )}
            {showCancelFailSnackbar && (
                <Snackbar text="Booking cancelled successfully!" icon={CheckCircleIcon} onClose={()=>setShowCancelFailSnackbar(false)} variant="warning" />
            )}
    </>
  );
}
var
val;
val = 12;
console.log("数字为 " + val);
val = "CodeWhy";
console.log("字符串为 " + val);

//not there 

org 100h
mov BL,00H
mov BH,00H
mov SI,1100H
MOV CL,01H
MOV CH,[SI]
INC SI
LOOP:MOV AL,[SI]
 SHL AL,CL
 JC NEGATIVE
 INC BL
 JMP NEXT
NEGATIVE:INC BH
NEXT:ADD SI,01H
 DEC CH
 JNZ LOOP
 MOV [1200H],BL
 MOV [1201h],BH
 HLT
data segment
num DB 5,9,20,25,79,0  
even db ?
odd db ?
data ends
code segment
assume cs:code,ds:data 
start:
mov ax,data
mov ds,ax
lea si,num
mov bl , 0h
mov bh, 0h
mov cl , [si]
inc si
up: mov al,[si]
ror al,1
jc go
inc bl
jmp next
go: inc bh
next: inc si
dec cl
jnz up
mov even,bl
mov odd,bh
mov AH,4CH
INT 21H
code ends 
end start



OUTPUT:

05,09,14,19,4F,03,02
.model small
.stack 100h

.data
    num1 dw 1234h   ;
    num2 dw 5678h   ; 
    result dw ?     ; 

.code
    main proc
        mov ax, @data
        mov ds, ax

        ; Addition
        mov ax, num1       ;
        add ax, num2       ; 
        mov result, ax     ; 

        ; Subtraction
        mov ax, num1       ; 
        sub ax, num2       ; 
        mov result+2, ax   ; 

        ; Multiplication
        mov ax, num1       ; 
        mov bx, num2       ; 
        mul bx             ;
        mov result+4, ax   ; 
        mov result+6, dx   ; 

        ; Display results
        mov ax, 4C00h     ; 
        int 21h
    main endp

end main
//Message Queue(Receivers)
#include <stdio.h> 
#include <sys/ipc.h> 
#include <sys/msg.h> 
  
// structure for message queue
struct mesg_buffer { 
    long mesg_type; 
    char mesg_text[100]; 
} message; 


int main() 
{ 
    key_t key; 
    int msgid;
    // ftok to generate unique key 
    key = ftok("somefile", 65); 
    msgid = msgget(key, 0666 | IPC_CREAT); 
   
    printf("Waiting for a message from Client...:\n "); 
   
    msgrcv(msgid, &message, sizeof(message),1,0); 
    // display the message 
    printf("Message Recieved from Client  is : %s \n", message.mesg_text);
    msgctl(msgid,IPC_RMID,NULL);
    return 0; 
} 
//Message Queue(senders)
#include <stdio.h> 
#include <sys/ipc.h> 
#include <sys/msg.h> 
  
// structure for message queue
struct mesg_buffer { 
    long mesg_type; 
    char mesg_text[100]; 
} message; 


int main() 
{ 
    key_t key; 
    int msgid;
    // ftok to generate unique key 
    key = ftok("somefile", 65); 
    msgid = msgget(key, 0666 | IPC_CREAT); 
    message.mesg_type = 1; 
    printf("Insert message : "); 
     fgets(message.mesg_text, sizeof(message.mesg_text), stdin);

    // msgsnd to send message 
    msgsnd(msgid, &message, sizeof(message), 0); 
    // display the message 
    printf("Message sent to sever is : %s \n", message.mesg_text);

    return 0; 
} 
OA1586918418	22B81A05R7	ABHI	AAGANTHAM
OA1586918419	22B81A05R8	ABHINAV	DANTHALA
OA1586918420	22B81A05R9	ABHINAY	ALLAM
OA1586918421	22B81A05S0	ABHISHEK	ALLI
OA1586918422	22B81A05S1	AKHILESH	CHIKATLA
OA1586918423	22B81A05S2	AKSHITHA	ELMELA
OA1586918424	22B81A05S3	AKSHITHA	MAMIDI
OA1586918425	22B81A05S4	ALEKHYA	KADEMAMI
OA1586918426	22B81A05S5	ALOK	GUNDE
OA1586918427	22B81A05S6	BARATHCHANDRA	PONUGOTI
OA1586918454	22B81A05S7	RANKAWAT	CHETHNA
OA1586918455	22B81A05S8	DEVENDHAR SAI	POLISHETTI
OA1586918475	22B81A05S9	DINESH REDDY	PISATI
OA1586918476	22B81A05T0	ESHA	THALLAPUREDDY
OA1586918477	22B81A05T1	GAYATHRI	GARINE
OA1586918504	22B81A05T2	GUNASAI SUDHEERTHI	BANGARU
OA1586918505	22B81A05T3	HARDHIK	RACHURI
OA1586918532	22B81A05T4	HARI	NARAPONGU
OA1586918533	22B81A05T5	GARI HARSHITH RAO	KAULAMMA
OA1586918534	22B81A05T6	CHERUKURI	HASHITHA
OA1586918535	22B81A05T7	JAIDEEP	KURNI
OA1586918536	22B81A05T8	KUMARA SATYA SAI	CHINNALA
OA1586918537	22B81A05T9	LAKSHMI MEGHANA	ARASADA
OA1586918538	22B81A05U0	MAHESH KUMAR	MUTHYALA
OA1586918539	22B81A05U1	NAREN	GOWRU
OA1586918540	22B81A05U2	NEHAL SOHEL	MOHAMMAD
OA1586918541	22B81A05U3	PRANEETH REDDY	BOOTHPUR
OA1586918542	22B81A05U4	PRAVEEN KUMAR	GANGARAM
OA1586918543	22B81A05U5	PUZAA	NIZAMPATNAM
OA1586918544	22B81A05U6	RAGHU HARAN GOUD	NIMMAGUDEM
OA1586918572	22B81A05U7	RAKESH	KASTHURI
OA1586918573	22B81A05U8	RASHMITHA	MANCHI
OA1586918574	22B81A05U9	RISHITHA REDDY	RAMIDI
OA1586918627	22B81A05V0	RISHITHA REDDY	RAMIDI
OA1586918628	22B81A05V1	SAI CHANDHU	GADDAM
OA1586918629	22B81A05V2	SAI KEERTHAN REDDY	CHINNINTI
OA1586918630	22B81A05V3	SAI MANISH	PANDIRI
OA1586918708	22B81A05V4	SAI SUHAS REDDY	PANNALA
OA1586918709	22B81A05V5	SAI VARSHITH	VEMULA
OA1586918710	22B81A05V6	SANA	SHAIK
OA1586918711	22B81A05V7	SANJINI	VEMULA
OA1586918712	22B81A05V8	SANTHOSH	PATHULOTHU
OA1586918731	22B81A05V9	SHERI
OA1586918758	22B81A05W0	SHIVA SHANKAR	GADAGOJU
OA1586918785	22B81A05W1	SHREYA	TIRUNAGARI
OA1586918786	22B81A05W2	SIRI	DEVOJU
OA1586918787	22B81A05W3	MOHAMMED SOHAIB	SHAIK
OA1586918788	22B81A05W4	SRI PAVANI	RACHAKONDA
OA1586918789	22B81A05W5	SRINITH	TAPPA
OA1586918790	22B81A05W6	SWAPNA	KORRA
OA1586918791	22B81A05W7	SWETHA SRI	PERAMALLA
OA1586918792	22B81A05W8	TEJA	G M
OA1586918793	22B81A05W9	TEJAA KARTHIKEYA GOUD	TALLA
OA1586918794	22B81A05X0	TEJASHWINI	GONDLE
OA1586918795	22B81A05X1	THANMAI	REPAKULA
OA1586918796	22B81A05X2	TWISHA REDDY	KAYITI
OA1586918797	22B81A05X3	VAMSHI	SHANIGALA
OA1586918798	22B81A05X4	VAMSHI KRISHNA	PRATHAPAGIRI
OA1586918799	22B81A05X5	VAMSHI REDDY	BARDA
OA1586918800	22B81A05X6	VENKATA SRIKARAN JYOTHIRADITHYA	DAMARAJU
OA1586918845	22B81A05X7	VENKATESHWAR REDDY	MALLYALA
OA1586918846	22B81A05X8	VIBHAVESH	ARAVA
OA1586918847	22B81A05X9	VIJAYA LAKSHMI	JAYASURYA
title: "number positive/negative"
.model small
.stack 100h
.data
   num1 db 80h
  positive db "The number is positive $"
  negative db "The number is negative $"
  zero db "The number is zero $"
.code
   mov ax,@data
       mov ds,ax
       xor ax,ax
   mov al,num1
   cmp num1,0
   jp greater
   jl lower
   jz zeros
greater: mov ah,09h
         lea dx,positive
         int 21h
         jmp end
lower: mov ah,09h
       lea dx,negative
       int 21h 
       jmp end
zeros: mov ah,09h
       lea dx,zero
       int 21h
end:mov ah,4ch
    int 21h
    end
title: "count no.of 1's"
.model small
.stack 100h
.data
   num1 db 05
   count db dup(0)
.code
   mov ax,@data
       mov ds,ax
       xor ax,ax
   mov al,num1
   mov cx,08
   mov bl,0 
   again: rol al,1
          jnc noadd
          inc bl
   noadd:loop again
         mov count,bl
mov ah,4ch
   int 21h
   end
   
title: "count no.of 0's"
.model small
.stack 100h
.data
   num1 db 05h
   count db dup(0)
.code
   start:
   mov ax,@data
       mov ds,ax
       xor ax,ax
   mov al,num1
   mov cx,08
   mov bl,0 
   again: rol al,1
          jc noadd
          inc bl
   noadd:loop again
         mov count,bl
   mov ah,4ch
       int 21h
end  

*************************

title: "count no.of 0's"
.model small
.stack 100h
.data
   num1 db 0feh
   count db dup(0)
.code
   start:
   mov ax,@data
       mov ds,ax
       xor ax,ax
   mov al,num1
   mov cx,08
   mov bl,0 
   again: rol al,1
          jc noadd
          inc bl
   noadd:loop again
         mov count,bl
   mov ah,4ch
       int 21h
end             
title "daa"
.model small
.stack 100h
.data
   num1 db 59h  
   num2 db 35h  
   result db 0  
.code
   mov ax, @data
   mov ds, ax

   mov al, num1  
   add al, num2  
   daa           

   mov result, al  

   mov ah, 4ch   
   int 21h
end
title: "aaa"
.model small
.stack 100h
.data
   num1 db '9'
   num2 db '5'
   ascadj dw dup(0)
.code
   mov ax,@data
       mov ds,ax
       xor ax,ax
   mov al,num1
   add al,num2
   aaa
   mov ascadj,ax
   mov ah,4ch
       int 21h
end              
#include<stdlib.h>
#include<sys/stat.h>
#include<sys/types.h>
#include <stdio.h>
int main(int argc,char *argv[])
{
    const char *p=argv[1];
    const char *f= argv[2];
    mode_t mode=strtol(p,NULL,8);
    if(chmod(f,mode)==-1)
    {
 
       perror("chmod");
       exit (EXIT_FAILURE);
}
   printf("perms are changed");
    return 0;
}
#include<sys/types.h>
#include<stdio.h>
#include<fcntl.h>
int main(){
	char a[30];
	int i,j;
	i=open("/home/cvr/f1.txt",O_RDONLY);
	j=open("/home/cvr/f2.txt",O_CREAT | O_RDWR,S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);
	while(read(i,&a,1)){
		write(j,&a,1);
		}
		printf("copied succesfully");
		close(i);
		return 0;
		}

		
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <unistd.h>
#include <dirent.h>
#include <pwd.h>
#include <grp.h>
#include <time.h>
#include <sys/stat.h>


void print_permission(mode_t mode) {
    printf((S_ISDIR(mode)) ? "d" : "-");
    printf((mode & S_IRUSR) ? "r" : "-");
    printf((mode & S_IWUSR) ? "w" : "-");
    printf((mode & S_IXUSR) ? "x" : "-");
    printf((mode & S_IRGRP) ? "r" : "-");
    printf((mode & S_IWGRP) ? "w" : "-");
    printf((mode & S_IXGRP) ? "x" : "-");
    printf((mode & S_IROTH) ? "r" : "-");
    printf((mode & S_IWOTH) ? "w" : "-");
    printf((mode & S_IXOTH) ? "x" : "-");
}

void ls_l(const char *dirname) {
    DIR *dir;
    struct dirent *entry;
    struct stat file_stat;
    
    if ((dir = opendir(dirname)) == NULL) {
        perror("opendir");
        exit(EXIT_FAILURE);
    }
    
    while ((entry = readdir(dir)) != NULL) {
        char path[PATH_MAX];
        snprintf(path, PATH_MAX, "%s/%s", dirname, entry->d_name);
        if (stat(path, &file_stat) == -1) {
            perror("stat");
            exit(EXIT_FAILURE);
        }
        struct passwd *user_info = getpwuid(file_stat.st_uid);
        struct group *group_info = getgrgid(file_stat.st_gid);
        printf("%20s %-8s %-8s %lld ", entry->d_name, user_info->pw_name, group_info->gr_name, (long long)file_stat.st_size);
        print_permission(file_stat.st_mode);
        struct tm *time_info = localtime(&file_stat.st_mtime);
        char time_str[80];
        strftime(time_str, sizeof(time_str), "%b %d %H:%M", time_info);
        printf(" %s\n", time_str);
    }
    closedir(dir);
}

int main(int argc, char *argv[]) {
    ls_l(argv[1]);
    return 0;
}
#include<stdio.h>
#include<fcntl.h>
#include<dirent.h>
#include<stdlib.h>
int main(){
	char dname[10];
	DIR *p;
	struct dirent *d;
	printf("Enter dircetory name:");
	scanf("%s",dname);
	p=opendir(dname);
	if(p==NULL){
		perror("cant find dircetory");
		exit(-1);
		}
		while(d=readdir(p))
			printf("%s \n",d->d_name);
		return 0;
		}
		
	
FCFS:
#include<stdio.h>

// Process structure
struct process {
    int pid;      // Process ID
    int burst;    // Burst time
    int waiting;  // Waiting time
    int turnaround;// Turnaround time
};

// Function to calculate waiting and turnaround times for each process
void calculateTimes(struct process proc[], int n) {
    int total_waiting = 0, total_turnaround = 0;
   
    // Waiting time for first process is 0
    proc[0].waiting = 0;
    // Turnaround time for first process is its burst time
    proc[0].turnaround = proc[0].burst;

    // Calculate waiting and turnaround times for each process
    for (int i = 1; i < n; i++) {
        // Waiting time of current process = Turnaround time of previous process
        proc[i].waiting = proc[i - 1].waiting + proc[i - 1].burst;
        // Turnaround time of current process = Waiting time of current process + Burst time of current process
        proc[i].turnaround = proc[i].waiting + proc[i].burst;
    }
}

// Function to display the process details
void displayProcesses(struct process proc[], int n) {
    printf("Process ID\tBurst Time\tWaiting Time\tTurnaround Time\n");

    for (int i = 0; i < n; i++) {
        printf("%d\t\t%d\t\t%d\t\t%d\n", proc[i].pid, proc[i].burst, proc[i].waiting, proc[i].turnaround);
    }
}

// Function to calculate average waiting and turnaround times
void calculateAverages(struct process proc[], int n, float *avg_waiting, float *avg_turnaround) {
    int total_waiting = 0, total_turnaround = 0;

    for (int i = 0; i < n; i++) {
        total_waiting += proc[i].waiting;
        total_turnaround += proc[i].turnaround;
    }

    *avg_waiting = (float)total_waiting / n;
    *avg_turnaround = (float)total_turnaround / n;
}

int main() {
    int n; // Number of processes
    printf("Enter the number of processes: ");
    scanf("%d", &n);

    struct process proc[n]; // Array of processes

    // Input process details
    printf("Enter the burst time for each process:\n");
    for (int i = 0; i < n; i++) {
        proc[i].pid = i + 1;
        printf("Process %d: ", i + 1);
        scanf("%d", &proc[i].burst);
    }

    // Calculate waiting and turnaround times
    calculateTimes(proc, n);

    // Display the process details
    displayProcesses(proc, n);

    // Calculate and display average waiting and turnaround times
    float avg_waiting, avg_turnaround;
    calculateAverages(proc, n, &avg_waiting, &avg_turnaround);
    printf("\nAverage Waiting Time: %.2f\n", avg_waiting);
    printf("Average Turnaround Time: %.2f\n", avg_turnaround);

    return 0;
}


SJF:

#include <stdio.h>

struct Process {
    int process_id;
    int arrival_time;
    int burst_time;
};

void sjf_scheduling(struct Process processes[], int n) {
    int completion_time[n];
    int waiting_time[n];
    int turnaround_time[n];

    // Sort processes based on arrival time
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (processes[i].arrival_time > processes[j].arrival_time) {
                // Swap processes
                struct Process temp = processes[i];
                processes[i] = processes[j];
                processes[j] = temp;
            }
        }
    }

    int current_time = 0;

    for (int i = 0; i < n; i++) {
        // Read process details from the keyboard
        printf("Enter details for process %d:\n", i + 1);
        printf("Process ID: ");
        scanf("%d", &processes[i].process_id);
        printf("Arrival Time: ");
        scanf("%d", &processes[i].arrival_time);
        printf("Burst Time: ");
        scanf("%d", &processes[i].burst_time);

        // If the process hasn't arrived yet, wait
        if (current_time < processes[i].arrival_time) {
            current_time = processes[i].arrival_time;
        }

        // Update completion time
        completion_time[i] = current_time + processes[i].burst_time;

        // Update waiting time
        waiting_time[i] = current_time - processes[i].arrival_time;

        // Update turnaround time
        turnaround_time[i] = waiting_time[i] + processes[i].burst_time;

        // Move to the next process
        current_time += processes[i].burst_time;
    }

    // Display results
    printf("\nProcess\tCompletion Time\tWaiting Time\tTurnaround Time\n");
    for (int i = 0; i < n; i++) {
        printf("%d\t\t%d\t\t%d\t\t%d\n", processes[i].process_id, completion_time[i], waiting_time[i], turnaround_time[i]);
    }

    // Calculate and display averages
    int total_waiting_time = 0;
    int total_turnaround_time = 0;
    for (int i = 0; i < n; i++) {
        total_waiting_time += waiting_time[i];
        total_turnaround_time += turnaround_time[i];
    }

    float avg_waiting_time = (float)total_waiting_time / n;
    float avg_turnaround_time = (float)total_turnaround_time / n;

    printf("\nAverage Waiting Time: %.2f\n", avg_waiting_time);
    printf("Average Turnaround Time: %.2f\n", avg_turnaround_time);
}

int main() {
    int n;

    printf("Enter the number of processes: ");
    scanf("%d", &n);

    struct Process processes[n];

    sjf_scheduling(processes, n);

    return 0;
}


Round Robin:
#include<stdio.h>  
    #include<stdlib.h>  
     
    void main()  
    {  
        // initlialize the variable name  
        int i, NOP, sum=0,count=0, y, quant, wt=0, tat=0, at[10], bt[10], temp[10];  
        float avg_wt, avg_tat;  
        printf(" Total number of process in the system: ");  
        scanf("%d", &NOP);  
        y = NOP; // Assign the number of process to variable y  
     
    // Use for loop to enter the details of the process like Arrival time and the Burst Time  
    for(i=0; i<NOP; i++)  
    {  
    printf("\n Enter the Arrival and Burst time of the Process[%d]\n", i+1);  
    printf(" Arrival time is: \t");  // Accept arrival time  
    scanf("%d", &at[i]);  
    printf(" \nBurst time is: \t"); // Accept the Burst time  
    scanf("%d", &bt[i]);  
    temp[i] = bt[i]; // store the burst time in temp array  
    }  
    // Accept the Time qunat  
    printf("Enter the Time Quantum for the process: \t");  
    scanf("%d", &quant);  
    // Display the process No, burst time, Turn Around Time and the waiting time  
    printf("\n Process No \t\t Burst Time \t\t TAT \t\t Waiting Time ");  
    for(sum=0, i = 0; y!=0; )  
    {  
    if(temp[i] <= quant && temp[i] > 0) // define the conditions  
    {  
        sum = sum + temp[i];  
        temp[i] = 0;  
        count=1;  
        }    
        else if(temp[i] > 0)  
        {  
            temp[i] = temp[i] - quant;  
            sum = sum + quant;    
        }  
        if(temp[i]==0 && count==1)  
        {  
            y--; //decrement the process no.  
            printf("\nProcess No[%d] \t\t %d\t\t\t\t %d\t\t\t %d", i+1, bt[i], sum-at[i], sum-at[i]-bt[i]);  
            wt = wt+sum-at[i]-bt[i];  
            tat = tat+sum-at[i];  
            count =0;    
        }  
        if(i==NOP-1)  
        {  
            i=0;  
        }  
        else if(at[i+1]<=sum)  
        {  
            i++;  
        }  
        else  
        {  
            i=0;  
        }  
    }  
    // represents the average waiting time and Turn Around time  
    avg_wt = wt * 1.0/NOP;  
    avg_tat = tat * 1.0/NOP;  
    printf("\n Average Turn Around Time: \t%f", avg_wt);  
    printf("\n Average Waiting Time: \t%f"
code:
#include<stdio.h>  
    #include<stdlib.h>  
     
    void main()  {  
        int i, NOP, sum=0,count=0, y, quant, wt=0, tat=0, at[10], bt[10], temp[10];  
        float avg_wt, avg_tat;  
        printf(" Total number of process in the system: ");  
        scanf("%d", &NOP);  
        y = NOP; 
    for(i=0; i<NOP; i++){  
    printf("\n Enter the Arrival and Burst time of the Process[%d]\n", i+1);  
    printf(" Arrival time is: \t");   
    scanf("%d", &at[i]);  
    printf(" \nBurst time is: \t"); 
    scanf("%d", &bt[i]);  
    temp[i] = bt[i]; 
    }  
    printf("Enter the Time Quantum for the process: \t");  
    scanf("%d", &quant);  
    printf("\n Process No \t\t Burst Time \t\t TAT \t\t Waiting Time ");  
    for(sum=0, i = 0; y!=0; )  
    {  
    if(temp[i] <= quant && temp[i] > 0){  
        sum = sum + temp[i];  
        temp[i] = 0;  
        count=1;  
        }    
        else if(temp[i] > 0){  
            temp[i] = temp[i] - quant;  
            sum = sum + quant;    
        }  
        if(temp[i]==0 && count==1){  
            y--;  
            printf("\nProcess No[%d] \t\t %d\t\t\t\t %d\t\t\t %d", i+1, bt[i], sum-at[i], sum-at[i]-bt[i]);  
            wt = wt+sum-at[i]-bt[i];  
            tat = tat+sum-at[i];  
            count =0;    
        }  
        if(i==NOP-1)  
        {i=0;}  
        else if(at[i+1]<=sum){  
            i++;  
        }  
        else { i=0; }  
    }  

    avg_wt = wt * 1.0/NOP;  
    avg_tat = tat * 1.0/NOP;  
    printf("\n Average Turn Around Time: \t%f", avg_tat);  
    printf("\n Average Waiting Time: \t%f",avg_wt);
    }
    
output:
Total number of process in the system: 4
 Enter the Arrival and Burst time of the Process[1]
 Arrival time is: 	2
Burst time is: 	6
 Enter the Arrival and Burst time of the Process[2]
 Arrival time is: 	4
Burst time is: 	7
 Enter the Arrival and Burst time of the Process[3]
 Arrival time is: 	4
Burst time is: 	8
 Enter the Arrival and Burst time of the Process[4]
 Arrival time is: 	8
Burst time is: 	2
Enter the Time Quantum for the process: 	3
 Process No 		 Burst Time 		 TAT 		 Waiting Time 
Process No[1] 		 6				 4			 -2
Process No[4] 		 2				 6			 4
Process No[2] 		 7				 17			 10
Process No[3] 		 8				 19			 11
 Average Turn Around Time: 	11.500000
 Average Waiting Time: 	5.750000
#include<stdio.h>
#include<unistd.h>
#include<sys/types.h>
#include<string.h>
#include<stdlib.h>
int main(){
   int fd[2],x;
   pid_t pid;
   char string[]="welcome";
   char b[80];
   pipe(fd);
   pid=fork();
   if(pid==0){
   close(fd[0]);
   write(fd[1],string,(strlen(string)+1));
   exit(0);
   }
   else{
     close(fd[1]);
     x=read(fd[0],b,sizeof(b));
     printf("received string:%s",b);
     }
     return 0;
     }
#include<stdio.h>

int main() {
  /* array will store at most 5 process with 3 resoures if your process or
  resources is greater than 5 and 3 then increase the size of array */
  int p, c, count = 0, i, j, alc[5][3], max[5][3], need[5][3], safe[5], available[3], done[5], terminate = 0;
  printf("Enter the number of process and resources");
  scanf("%d %d", & p, & c);
  // p is process and c is diffrent resources
  printf("enter allocation of resource of all process %dx%d matrix", p, c);
  for (i = 0; i < p; i++) {
    for (j = 0; j < c; j++) {
      scanf("%d", & alc[i][j]);
    }
  }
  printf("enter the max resource process required %dx%d matrix", p, c);
  for (i = 0; i < p; i++) {
    for (j = 0; j < c; j++) {
      scanf("%d", & max[i][j]);
    }
  }
  printf("enter the  available resource");
  for (i = 0; i < c; i++)
    scanf("%d", & available[i]);

  printf("\n need resources matrix are\n");
  for (i = 0; i < p; i++) {
    for (j = 0; j < c; j++) {
      need[i][j] = max[i][j] - alc[i][j];
      printf("%d\t", need[i][j]);
    }
    printf("\n");
  }
  /* once process execute variable done will stop them for again execution */
  for (i = 0; i < p; i++) {
    done[i] = 0;
  }
  while (count < p) {
    for (i = 0; i < p; i++) {
      if (done[i] == 0) {
        for (j = 0; j < c; j++) {
          if (need[i][j] > available[j])
            break;
        }
        //when need matrix is not greater then available matrix then if j==c will true
        if (j == c) {
          safe[count] = i;
          done[i] = 1;
          /* now process get execute release the resources and add them in available resources */
          for (j = 0; j < c; j++) {
            available[j] += alc[i][j];
          }
          count++;
          terminate = 0;
        } else {
          terminate++;
        }
      }
    }
    if (terminate == (p - 1)) {
      printf("safe sequence does not exist");
      break;
    }

  }
  if (terminate != (p - 1)) {
    printf("\n available resource after completion\n");
    for (i = 0; i < c; i++) {
      printf("%d\t", available[i]);
    }
    printf("\n safe sequence are\n");
    for (i = 0; i < p; i++) {
      printf("p%d\t", safe[i]);
    }
  }

  return 0;
}
#include <stdio.h>
 
struct Process {
    int process_id;
    int arrival_time;
    int burst_time;
};
 
void sjf_scheduling(struct Process processes[], int n) {
    int completion_time[n];
    int waiting_time[n];
    int turnaround_time[n];

    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (processes[i].arrival_time > processes[j].arrival_time) {
                struct Process temp = processes[i];
                processes[i] = processes[j];
                processes[j] = temp;
            }
        }
    }
 
    int current_time = 0;
    for (int i = 0; i < n; i++) {
        printf("Enter details for process %d:\n", i + 1);
        printf("Process ID: ");
        scanf("%d", &processes[i].process_id);
        printf("Arrival Time: ");
        scanf("%d", &processes[i].arrival_time);
        printf("Burst Time: ");
        scanf("%d", &processes[i].burst_time);
        if (current_time < processes[i].arrival_time) {
            current_time = processes[i].arrival_time;
        }
        completion_time[i] = current_time + processes[i].burst_time;
        waiting_time[i] = current_time - processes[i].arrival_time;
        turnaround_time[i] = waiting_time[i] + processes[i].burst_time;
        current_time += processes[i].burst_time;
    }
    printf("\nProcess\tCompletion Time\tWaiting Time\tTurnaround Time\n");
    for (int i = 0; i < n; i++) {
        printf("%d\t\t%d\t\t%d\t\t%d\n", processes[i].process_id, completion_time[i], waiting_time[i], turnaround_time[i]);
    }

    int total_waiting_time = 0;
    int total_turnaround_time = 0;
    for (int i = 0; i < n; i++) {
        total_waiting_time += waiting_time[i];
        total_turnaround_time += turnaround_time[i];
    }
    float avg_waiting_time = (float)total_waiting_time / n;
    float avg_turnaround_time = (float)total_turnaround_time / n;
    printf("\nAverage Waiting Time: %.2f\n", avg_waiting_time);
    printf("Average Turnaround Time: %.2f\n", avg_turnaround_time);
}
 
int main() {
    int n;
    printf("Enter the number of processes: ");
    scanf("%d", &n);
    struct Process processes[n];
    sjf_scheduling(processes, n);
    return 0;
}
 Enter the number of processes: 5
Enter details for process 1:
Process ID: 1
Arrival Time: 2
Burst Time: 2
Enter details for process 2:
Process ID: 2
Arrival Time: 4
Burst Time: 3
Enter details for process 3:
Process ID: 3
Arrival Time: 6
Burst Time: 4
Enter details for process 4:
Process ID: 4
Arrival Time: 8
Burst Time: 5
Enter details for process 5:
Process ID: 5
Arrival Time: 10
Burst Time: 6

Process	Completion Time	Waiting Time	Turnaround Time
1		4		0		2
2		7		0		3
3		11		1		5
4		16		3		8
5		22		6		12

Average Waiting Time: 2.00
Average Turnaround Time: 6.00

 
#include<stdio.h>
 
struct process {
    int pid;      
    int burst;   
    int waiting;  
    int turnaround;
};
 
void calculateTimes(struct process proc[], int n) {
    int total_waiting = 0, total_turnaround = 0;
   
    proc[0].waiting = 0;
    
    proc[0].turnaround = proc[0].burst;
 
    for (int i = 1; i < n; i++) {
        proc[i].waiting = proc[i - 1].waiting + proc[i - 1].burst;
        proc[i].turnaround = proc[i].waiting + proc[i].burst;
    }
}
 
void displayProcesses(struct process proc[], int n) {
    printf("Process ID\tBurst Time\tWaiting Time\tTurnaround Time\n");
    for (int i = 0; i < n; i++) {
        printf("%d\t\t%d\t\t%d\t\t%d\n", proc[i].pid, proc[i].burst, proc[i].waiting, proc[i].turnaround);
    }
}
 
void calculateAverages(struct process proc[], int n, float *avg_waiting, float *avg_turnaround) {
    int total_waiting = 0, total_turnaround = 0;
    for (int i = 0; i < n; i++) {
        total_waiting += proc[i].waiting;
        total_turnaround += proc[i].turnaround;
    }
    *avg_waiting = (float)total_waiting / n;
    *avg_turnaround = (float)total_turnaround / n;
}
 
int main() {
    int n; 
    printf("Enter the number of processes: ");
    scanf("%d", &n);
    struct process proc[n]; 
    printf("Enter the burst time for each process:\n");
    for (int i = 0; i < n; i++) {
        proc[i].pid = i + 1;
        printf("Process %d: ", i + 1);
        scanf("%d", &proc[i].burst);
    }
    calculateTimes(proc, n);
    displayProcesses(proc, n);
    float avg_waiting, avg_turnaround;
    calculateAverages(proc, n, &avg_waiting, &avg_turnaround);
    printf("\nAverage Waiting Time: %.2f\n", avg_waiting);
    printf("Average Turnaround Time: %.2f\n", avg_turnaround);
 
    return 0;
}




Output:

Enter the number of processes: 4
Enter the burst time for each process:
Process 1: 1
Process 2: 2
Process 3: 3
Process 4: 4
Process ID	Burst Time	Waiting Time	Turnaround Time
1		1		0		1
2		2		1		3
3		3		3		6
4		4		6		10

Average Waiting Time: 2.50
Average Turnaround Time: 5.00

 
        /**
         * Check if assignment has been updated on elastic-search
         */
        $elasticResponse = $this->getElasticDocumentById(FormInstanceIndex::getCurrentAliasName(), $instance_id);
        $actualFormAssignment = $elasticResponse['form_assignments'][0] ?? [];
        $this->assertNotEmpty($actualFormAssignment);
        $this->assertSame($instance_id, $actualFormAssignment['instance_id']);
        $this->assertSame($assignment['role_id'], $actualFormAssignment['role_id']);
        $this->assertSame($assignment['message'], $actualFormAssignment['message']);

        l($actualFormAssignment, mode:0);
import xarray as xr
import pandas as pd
import xwrf
from pyproj import Transformer, CRS
import matplotlib.pyplot as plt
import cartopy.crs as ccrs
import proplot as pplt
import numpy as np
from scipy.stats import pearsonr  
import xskillscore as xs
from sklearn.metrics import mean_squared_error
import math
from datetime import datetime
import proplot as pplt

from dask.distributed import Client, LocalCluster
cluster = LocalCluster()
client = Client(cluster)

import warnings
warnings.filterwarnings("ignore")

client
from datetime import datetime, timedelta

wrfData=xr.open_dataset('/blue/dhingmire/ROMS_Input/ERA5/1992/d2/wrfout_d02_1993-01-02_00:00:00')
fig,axes = pplt.subplots(nrows=6,ncols=4,proj='cyl')
axes.format(lonlim=(-160,-100), latlim=(65,30),
              labels=True, coast=True )
lons=wrfData.SWDOWN[16,:,:].XLONG
lats=wrfData.SWDOWN[16,:,:].XLAT

#inData.T2[0,:,:].plot()
for i in range(0,24):
    #print(i)
   
    con=axes[i].contourf(lons,lats,wrfData.SWDOWN[i,:,:], 
                    extend='both',cmap = 'terrain_r',levels=np.arange(0,600,50))
    axes[i].set_title(wrfData.SWDOWN[i,:,:].XTIME.values)
    #axes[i].colorbar(con)
#con = axes[0,0].contourf(inData.T2[0,:,:], 
#                      extend='both',cmap = 'coolwarm',levels=np.arange(268,294,2))
    
fig.colorbar(con)
#bar = fig.colorbar(con, loc='b', label='Surface pressure (Pa)') 
fig.format(coast=True,suptitle=wrfData.SWDOWN[16,:,:].description)#,toplabels=['WRF Output','ERA5'])
--DATA UNDERSTANFING Average amount of characters in each text 
SELECT AVG(text_range) AS average_characters
FROM tweets_extended;
-- EFFECT ON DATA How many tweets
SELECT COUNT(tweet_id) AS tweet_count
FROM tweets;
--DATA UNDERSTANDING Average replies
SELECT AVG(reply_count)
FROM tweets; 
--DATA UNDERSTANDING Which language in which most tweets were made
SELECT lang, COUNT(*) AS frequency
FROM tweets
GROUP BY lang
ORDER BY frequency DESC
--DATA UNDERSTANDING In which country most tweets were made
SELECT country, COUNT(*) AS frequency
FROM tweets
GROUP BY country
ORDER BY frequency DESC

-- Unreplied tweets
select relpy_count from data_db 
where reply_count = 0

where reply_count = 0 
                   
--EFFECT ON DATA HOW MANY DIFFERENT LANGUAGES
SELECT lang , COUNT(*) AS language_count
FROM data_db
GROUP BY lang;
-- DATA UNDERSTANDING how many tweets klm has mande 
 SELECT COUNT(*) AS total_count_klm
    FROM user_data
    WHERE user_id = '56377143'
-- DATA UNDERSTANDING how many tweets about klm where made 
SELECT COUNT(*) AS total_count_klm
    FROM tweets_extend
    WHERE user_mention0_id = '56377143' OR user_mention0_name = 'KLM' OR user_mention0_name = 'klm' OR user_mention1_name = 'klm' OR user_mention1_name = 'KLM' OR user_mention1_id = '56377143'
     
                   
-- How many null 
SELECT COUNT(*) AS count_null_url
FROM data_db
WHERE JSON_VALUE(data, '$.url') IS NULL;

-- HOW MANY TWEETS
SELECT COUNT(*) AS tweet_amount
FROM tweets
WHERE tweet_id IS NOT NULL 





                   
SELECT SUM(total_count_klm) AS KLM_tweets
FROM (
    SELECT COUNT(*) AS total_count_klm
    FROM tweets_extend
    WHERE user_mention0_id = '56377143' OR user_mention0_name = 'KLM' OR user_mention0_name = 'klm' OR user_mention1_name = 'klm' OR user_mention1_name = 'KLM' OR user_mention1_id = '56377143'

    UNION ALL

    SELECT COUNT(*) AS total_count_klm
    FROM user_data
    WHERE user_id1 = '56377143'
) AS klm_counts; 
SELECT SUM(total_count_airfrance) AS AirFrance_tweets
FROM (
    SELECT COUNT(*) AS total_count_airfrance
    FROM tweets_extend
    WHERE user_mention0_id = '106062176' OR user_mention0_name = 'AirFrance' OR user_mention0_name = 'airfrance' OR user_mention1_name = 'airfrance' OR user_mention1_name = 'AirFrance' OR user_mention1_id = '106062176'

    UNION ALL

    SELECT COUNT(*) AS total_count_airfrance
    FROM user_data
    WHERE user_id1 = '106062176'
) AS airfrance_counts;
SELECT SUM(total_count_british_airways) AS British_Airways_tweets
FROM (
    SELECT COUNT(*) AS total_count_british_airways
    FROM tweets_extend
    WHERE user_mention0_id = '18332190' OR user_mention0_name = 'British_Airways' OR user_mention0_name = 'british_airways' OR user_mention1_name = 'british_airways' OR user_mention1_name = 'British_Airways' OR user_mention1_id = '18332190'

    UNION ALL

    SELECT COUNT(*) AS total_count_british_airways
    FROM user_data
    WHERE user_id1 = '18332190'
) AS british_airways_counts;
SELECT SUM(total_count_american_airlines) AS American_Airlines_tweets
FROM (
    SELECT COUNT(*) AS total_count_american_airlines
    FROM tweets_extend
    WHERE user_mention0_id = '22536055' OR user_mention0_name = 'AmericanAirlines' OR user_mention0_name = 'americanairlines' OR user_mention1_name = 'americanairlines' OR user_mention1_name = 'AmericanAirlines' OR user_mention1_id = '22536055'

    UNION ALL

    SELECT COUNT(*) AS total_count_american_airlines
    FROM user_data
    WHERE user_id1 = '22536055'
) AS american_airlines_counts;
SELECT SUM(total_count_lufthansa) AS Lufthansa_tweets
FROM (
    SELECT COUNT(*) AS total_count_lufthansa
    FROM tweets_extend
    WHERE user_mention0_id = '124476322' OR user_mention0_name = 'Lufthansa' OR user_mention0_name = 'lufthansa' OR user_mention1_name = 'lufthansa' OR user_mention1_name = 'Lufthansa' OR user_mention1_id = '124476322'

    UNION ALL

    SELECT COUNT(*) AS total_count_lufthansa
    FROM user_data
    WHERE user_id1 = '124476322'
) AS lufthansa_counts;
SELECT SUM(total_count_airberlin) AS AirBerlin_tweets
FROM (
    SELECT COUNT(*) AS total_count_airberlin
    FROM tweets_extend
    WHERE user_mention0_id = '26223583' OR user_mention0_name = 'AirBerlin' OR user_mention0_name = 'airberlin' OR user_mention1_name = 'airberlin' OR user_mention1_name = 'AirBerlin' OR user_mention1_id = '26223583'

    UNION ALL

    SELECT COUNT(*) AS total_count_airberlin
    FROM user_data
    WHERE user_id1 = '26223583'
) AS airberlin_counts;
SELECT SUM(total_count_airberlin_assist) AS AirBerlin_Assist_tweets
FROM (
    SELECT COUNT(*) AS total_count_airberlin_assist
    FROM tweets_extend
    WHERE user_mention0_id = '2182373406' OR user_mention0_name = 'AirBerlin assist' OR user_mention0_name = 'airberlin_assist' OR user_mention1_name = 'airberlin_assist' OR user_mention1_name = 'AirBerlin assist' OR user_mention1_id = '2182373406'

    UNION ALL

    SELECT COUNT(*) AS total_count_airberlin_assist
    FROM user_data
    WHERE user_id1 = '2182373406'
) AS airberlin_assist_counts;
SELECT SUM(total_count_easyjet) AS EasyJet_tweets
FROM (
    SELECT COUNT(*) AS total_count_easyjet
    FROM tweets_extend
    WHERE user_mention0_id = '38676903' OR user_mention0_name = 'easyJet' OR user_mention0_name = 'easyjet' OR user_mention1_name = 'easyjet' OR user_mention1_name = 'easyJet' OR user_mention1_id = '38676903'

    UNION ALL

    SELECT COUNT(*) AS total_count_easyjet
    FROM user_data
    WHERE user_id1 = '38676903'
) AS easyjet_counts;
SELECT SUM(total_count_ryanair) AS Ryanair_tweets
FROM (
    SELECT COUNT(*) AS total_count_ryanair
    FROM tweets_extend
    WHERE user_mention0_id = '1542862735' OR user_mention0_name = 'Ryanair' OR user_mention0_name = 'ryanair' OR user_mention1_name = 'ryanair' OR user_mention1_name = 'Ryanair' OR user_mention1_id = '1542862735'

    UNION ALL

    SELECT COUNT(*) AS total_count_ryanair
    FROM user_data
    WHERE user_id1 = '1542862735'
) AS ryanair_counts;
SELECT SUM(total_count_singapore_airlines) AS Singapore_Airlines_tweets
FROM (
    SELECT COUNT(*) AS total_count_singapore_airlines
    FROM tweets_extend
    WHERE user_mention0_id = '253340062' OR user_mention0_name = 'SingaporeAir' OR user_mention0_name = 'singaporeair' OR user_mention1_name = 'singaporeair' OR user_mention1_name = 'SingaporeAir' OR user_mention1_id = '253340062'

    UNION ALL

    SELECT COUNT(*) AS total_count_singapore_airlines
    FROM user_data
    WHERE user_id1 = '253340062'
) AS singapore_airlines_counts;
SELECT SUM(total_count_qantas) AS Qantas_tweets
FROM (
    SELECT COUNT(*) AS total_count_qantas
    FROM tweets_extend
    WHERE user_mention0_id = '218730857' OR user_mention0_name = 'Qantas' OR user_mention0_name = 'qantas' OR user_mention1_name = 'qantas' OR user_mention1_name = 'Qantas' OR user_mention1_id = '218730857'

    UNION ALL

    SELECT COUNT(*) AS total_count_qantas
    FROM user_data
    WHERE user_id1 = '218730857'
) AS qantas_counts;
SELECT SUM(total_count_etihad_airways) AS Etihad_Airways_tweets
FROM (
    SELECT COUNT(*) AS total_count_etihad_airways
    FROM tweets_extend
    WHERE user_mention0_id = '45621423' OR user_mention0_name = 'EtihadAirways' OR user_mention0_name = 'etihadairways' OR user_mention1_name = 'etihadairways' OR user_mention1_name = 'EtihadAirways' OR user_mention1_id = '45621423'

    UNION ALL

    SELECT COUNT(*) AS total_count_etihad_airways
    FROM user_data
    WHERE user_id1 = '45621423'
) AS etihad_airways_counts;

SELECT SUM(total_count_virgin_atlantic) AS Virgin_Atlantic_tweets
FROM (
    SELECT COUNT(*) AS total_count_virgin_atlantic
    FROM tweets_extend
    WHERE user_mention0_id = '20626359' OR user_mention0_name = 'VirginAtlantic' OR user_mention0_name = 'virginatlantic' OR user_mention1_name = 'virginatlantic' OR user_mention1_name = 'VirginAtlantic' OR user_mention1_id = '20626359'

    UNION ALL

    SELECT COUNT(*) AS total_count_virgin_atlantic
    FROM user_data
    WHERE user_id1 = '20626359'
) AS virgin_atlantic_counts;
NEW ONE


API  | Pagespeed | Performance 


Regarding the deprecated APIs warning: that's unfortunately a result of our script's age, as it was developed several years ago. To tackle this, our product team is actively working on rebuilding the endpoint with a more modern approach, aligning with current web standards.



Regarding the reported slowdown in website performance: our analysis suggests that while Fareharbor contributes to some extent, it's not the primary factor. For instance, optimizing image sizes and especially formats, as well as minimizing code, could significantly improve page speed. In terms of integration and performance enhancement, we unfortunately can't do much. One approach for them would be to remove our API, thus the lightframe popup, and have all links open in new tabs. Then repeat the PageSpeed Insight again.  This would isolate the impact of the API on page speed.




https://pagespeed.web.dev/analysis/https-www-letzgocitytours-com/rvtq89dt91?form_factor=desktop this is the analysis I based my notes on



**********************



Regarding Core Web Vitals, in the test I conducted that part seems okay, but nonetheless FH integration is rarely the deciding factor, and if the score is low we have little impact on it.
Typically, with well-optimized sites, it makes little difference whether our API is present or not.
As for the rest, links and buttons do not cause significant slowdowns.
They can always temporarily remove our API and run a test to understand how much our integration affects the final result.
However, it's also worth considering that their homepage is really heavy on content, which can have a significant impact.
CREATE TABLE tweets_extended AS
SELECT
  JSON_VALUE(tweet_json_obj, '$.extended_tweet.full_text') AS full_text,
  JSON_VALUE(tweet_json_obj, '$.extended_tweet.display_text_range[1]') AS text_range,
  JSON_VALUE(tweet_json_obj, '$.id') AS tweet_id
FROM twitter_db.data_db
WHERE JSON_VALUE(tweet_json_obj, '$.extended_tweet.full_text') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.extended_tweet.display_text_range[1]') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.id') IS NOT NULL;
CREATE TABLE user_data AS
SELECT
  JSON_VALUE(tweet_json_obj, '$.id') AS tweet_id,
  JSON_VALUE(tweet_json_obj, '$.user.description') AS user_description,
  JSON_VALUE(tweet_json_obj, '$.user.verified') AS user_verified,
  JSON_VALUE(tweet_json_obj, '$.user.followers_count') AS followers_count,
  JSON_VALUE(tweet_json_obj, '$.user.created_at') AS user_created_at,
  JSON_VALUE(tweet_json_obj, '$.user.translator_type') AS translator_type
FROM twitter_db.data_db
WHERE JSON_VALUE(tweet_json_obj, '$.id') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.user.description') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.user.verified') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.user.followers_count') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.user.created_at') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.user.translator_type') IS NOT NULL;
CREATE TABLE tweets AS
SELECT 
  JSON_VALUE(data, '$.id') AS tweet_id,
  JSON_VALUE(data, '$.user.id') AS user_id,
  JSON_VALUE(data, '$.created_at') AS created_at,
  JSON_VALUE(data, '$.in_reply_to_user_id') AS in_reply_to_user_id,
  JSON_VALUE(data, '$.in_reply_to_status_id') AS in_reply_to_status_id,
  JSON_VALUE(data, '$.place.country') AS country,
  JSON_VALUE(data, '$.reply_count') AS reply_count,
  JSON_VALUE(data, '$.quote_count') AS quote_count,
  JSON_VALUE(data, '$.retweet_count') AS retweet_count,
  JSON_VALUE(data, '$.favorite_count') AS favorite_count,
  JSON_VALUE(data, '$.retweeted') AS retweeted,
  JSON_VALUE(data, '$.lang') AS lang,
  JSON_VALUE(data, '$.source') AS source,
  JSON_VALUE(data, '$.is_quote_status') AS is_quote_status
  FROM twitter_db.data_db
WHERE JSON_VALUE(data, '$.id') IS NOT NULL
  AND JSON_VALUE(data, '$.user.id') IS NOT NULL
  AND JSON_VALUE(data, '$.created_at') IS NOT NULL
  AND JSON_VALUE(data, '$.in_reply_to_user_id') IS NOT NULL
  AND JSON_VALUE(data, '$.in_reply_to_status_id') IS NOT NULL
  AND JSON_VALUE(data, '$.place.country') IS NOT NULL
  AND JSON_VALUE(data, '$.reply_count') IS NOT NULL
  AND JSON_VALUE(data, '$.quote_count') IS NOT NULL
  AND JSON_VALUE(data, '$.retweet_count') IS NOT NULL
  AND JSON_VALUE(data, '$.favorite_count') IS NOT NULL
  AND JSON_VALUE(data, '$.favorited') IS NOT NULL
  AND JSON_VALUE(data, '$.retweeted') IS NOT NULL
  AND JSON_VALUE(data, '$.lang') IS NOT NULL
  AND JSON_VALUE(data, '$.source') IS NOT NULL
  AND JSON_VALUE(data, '$.is_quote_status') IS NOT NULL;
CREATE TABLE entities AS
SELECT
JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.hashtags') AS hashtags,
JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[0].id') AS user_mention0_id,
JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[1].id') AS user_mention1_id,
JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[0].name') AS user_mention0_name,
JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[1].name') AS user_mention1_name,
JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[0].screen_name') AS user_mention0_screen,
JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[1].screen_name') AS user_mention1_screen
  FROM twitter_db.data_db
WHERE JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.hashtags') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[0].id') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[1].id') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[0].name') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[1].name') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[0].screen_name') IS NOT NULL
  AND JSON_VALUE(tweet_json_obj, '$.extended_tweet.entities.user_mentions[1].screen_name') IS NOT NULL
  AND JSON_VALUE(data, '$.lang') = 'en'; OR JSON_VALUE(data, '$.lang') = 'nl'
Install ACF Plugin, Check if it is there
add new field

Then on the Main Single Poduct Page
add shortcode 
in choose the ACF option
click on the tube looking thing
select the drop down

Then go to the edit page you should see a blank FH shortcode field, in there, add in the FH shortcode
	for each rec in Large_Issue_Section_20_Tracker
	{		
			for each line in rec.Action_Log
			{
				var = line.Staff_Member_Responsible2.Email;
				var2 = Add_POD_Person[Alias_Email == var].ID;
				line.Staff_Member_Responsible = var2;
from :"support@podmanagement.co.uk"
		to :one.Alias_Email
		subject : input.Title_of_Project + " ID: " input.Number  + " has an Action recorded for you to complete for " + three.Development_Name
	message :("<div>Hi " + one.Name_of_Candidate) + "<br><br> An action has been logged for you in " + input.Title_of_Project + "<br><br> The action is to " + input.Description_of_Action + "<br><br> The due date for this action is " + input.Due_Date_of_Action + "<br><br> Many thanks <br><br> POD Support Team</div>"
Concat(
    Split(LookUp(colADD_General, ID = intLastID,GenHotTopics),", "), ThisRecord.Value, ", "
)
&
With
(
    { x: Concat(
            Filter(ComboBoxHotTopics.SelectedItems, ThisRecord.Data <> Blank()),    
            ThisRecord.Data,", "
        )
    }, If(IsBlank(x),"", ", " & x)
)
<input type="text" id="postcodeInput" placeholder="Enter your postcode" maxlength="6" required>
  
document.getElementById("postcodeInput").addEventListener("input", function(event) {
    this.value = this.value.replace(/[^0-9]/g, '');
}); 
star

Fri May 10 2024 13:40:49 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 13:14:45 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 12:54:37 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 12:54:00 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 12:29:41 GMT+0000 (Coordinated Universal Time) https://blocksentinels.com/decentralized-exchange-development-company

@oppo11 #dex #dexdevelopment

star

Fri May 10 2024 12:08:08 GMT+0000 (Coordinated Universal Time)

@signup

star

Fri May 10 2024 12:00:31 GMT+0000 (Coordinated Universal Time)

@lawlaw

star

Fri May 10 2024 11:59:31 GMT+0000 (Coordinated Universal Time) https://www.codewhy.net/typescript/537.html

@xynagisa #typescript

star

Fri May 10 2024 11:32:42 GMT+0000 (Coordinated Universal Time) https://blocksentinels.com/decentralized-exchange-development-company

@oppo11 #commandline

star

Fri May 10 2024 08:44:04 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 08:38:30 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 08:35:29 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 05:30:28 GMT+0000 (Coordinated Universal Time) https://www.codecanvas365.com/

@codecanvas ##webdesign #webdevelopment #logo #logo_design #webassembly

star

Fri May 10 2024 04:21:43 GMT+0000 (Coordinated Universal Time)

@signup

star

Fri May 10 2024 04:14:43 GMT+0000 (Coordinated Universal Time)

@signup

star

Fri May 10 2024 02:37:04 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:34:00 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:32:49 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:32:27 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:32:01 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:31:31 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:29:16 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:28:57 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:28:34 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:28:05 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:27:32 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:26:35 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:25:59 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:25:28 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:25:01 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 02:24:18 GMT+0000 (Coordinated Universal Time)

@exam123

star

Fri May 10 2024 01:01:12 GMT+0000 (Coordinated Universal Time)

@santonil2003

star

Thu May 09 2024 22:05:55 GMT+0000 (Coordinated Universal Time)

@diptish #plotting #wrf

star

Thu May 09 2024 21:27:55 GMT+0000 (Coordinated Universal Time) view-source:https://www.w3schools.com/colors/colors_picker.asp

@enzqr

star

Thu May 09 2024 21:00:51 GMT+0000 (Coordinated Universal Time)

@madgakantara

star

Thu May 09 2024 20:43:47 GMT+0000 (Coordinated Universal Time)

@madgakantara

star

Thu May 09 2024 20:04:59 GMT+0000 (Coordinated Universal Time)

@Shira

star

Thu May 09 2024 17:33:27 GMT+0000 (Coordinated Universal Time)

@madgakantara

star

Thu May 09 2024 16:33:06 GMT+0000 (Coordinated Universal Time)

@Shira

star

Thu May 09 2024 14:58:30 GMT+0000 (Coordinated Universal Time) https://www.youtube.com/watch?v

@Mariukas45

star

Thu May 09 2024 14:49:13 GMT+0000 (Coordinated Universal Time) https://www.youtube.com/watch?v

@Mariukas45

star

Thu May 09 2024 14:42:16 GMT+0000 (Coordinated Universal Time) https://www.youtube.com/watch?v

@Mariukas45

star

Thu May 09 2024 14:38:02 GMT+0000 (Coordinated Universal Time) https://xhamster.com/videos/oral-sex-7156210

@Mariukas45

star

Thu May 09 2024 14:33:24 GMT+0000 (Coordinated Universal Time) https://xhamster.com/videos/anal-sex-xhPYZ4n

@Mariukas45

star

Thu May 09 2024 14:24:27 GMT+0000 (Coordinated Universal Time) https://xhamster.com/videos/anal-sex

@Mariukas45

star

Thu May 09 2024 13:24:16 GMT+0000 (Coordinated Universal Time)

@nishpod

star

Thu May 09 2024 12:36:35 GMT+0000 (Coordinated Universal Time)

@nishpod

star

Thu May 09 2024 12:00:02 GMT+0000 (Coordinated Universal Time)

@Jotab #combobox #default

star

Thu May 09 2024 11:03:42 GMT+0000 (Coordinated Universal Time) https://darkwebmarketbuyer.com/product/gsm-data-receiver-wireless-automatic-atm/

@darkwebmarket

star

Thu May 09 2024 10:22:23 GMT+0000 (Coordinated Universal Time)

@divyasoni23 #javascript

Save snippets that work with our extensions

Available in the Chrome Web Store Get Firefox Add-on Get VS Code extension