"Beware of Fake Texts and Delivery Scams During Amazon Prime Day: Tips to Stay Safe"

According to Tompor, scammers are taking advantage of the Amazon Prime Day event, a popular online shopping extravaganza, to trick unsuspecting consumers

PROGRAM - 1

#include
#include
#include
struct date
{
 int dd;
 int mm;
 int yy;
};
struct calendar
{
 char day[20];
 struct date dmy;
 char activity[50];
};
struct calendar *cal;
void create();
void read();
void display();
int main()
{
 create();
 read();
 display();
 return 0;
}

void create()

{
 cal = (struct calendar*)malloc(7*sizeof(struct calendar));
}
void read()
{
 int i;
 printf("Enter the details of Calendar\n");
 for(i=0;i<7;i++)
 {
printf("Enter the details of Day%d\n",i+1);
printf("Enter the day: ");
scanf("%s",(cal+i)->day);
printf("Enter the day in dd mm yyyy format: ");
scanf("%d%d%d%*c",&(cal+i)->dmy.dd,&(cal+i)->dmy.mm,&(cal+i)->dmy.yy);
printf("Enter the activity:");
gets((cal+i)->activity);
 }
}
void display()
{
 int i;
 printf("Weekly Activity details Report are as follows:\n");
 printf("Day\t Date\t\t Activity\n");
 for(i=0;i<7;i++)
 {
 printf("%s\t %d-%d-%d\t\t %s\n",(cal+i)->day,(cal+i)->dmy.dd,(cal+i)-> 
 dmy.mm,(cal+i)->dmy.yy,(cal+i)->activity);
 }
}

PROGRAM - 2

#include
int stringlen(char str[]);
void stringmatch(char dest[], char src[]);
int main()
{
int i=0,j,k=0,flag=0;
char str[100], pat[20], rep[20], res[100];
clrscr();
printf("Enter Main String\n");
gets(str);
printf("Enter Pattern String\n");
gets(pat);
printf("Enter Replace String\n");
gets(rep);
while(str[i] != '\0')
{
j=0;
while((str[i+j] == pat[j]) && (pat[j] != '\0'))
{
j++;
}
if(pat[j] == '\0')
{
 flag = 1;
 res[k] = '\0';
 stringmatch(res,rep);
 k = k + stringlen(rep);
 i = i + (j -1);
}
else
{

res[k++] = str[i];

}
i++;
}
res[k] = '\0';
printf("The result is\n");
 if(flag)
puts(res);
else
printf("Pattern not found\n");
 return 0;
}
int stringlen(char str[])
{
int len=0;
while(str[len] != '\0')
{
len++;
}
return len;
}
void stringmatch(char dest[], char src[])
{
int i=0, j=0;
while(dest[i] != '\0')
{
i++;
}
while(src[j] != '\0')
{
dest[i+j] = src[j];
j++;
}
}

PROGRAM - 03

#include
#include
#define MAX 5
int top=-1;
int stack[MAX];
void push();
void pop();
void palindrome();
void display();
int main()
{
int ch;
while(1)
{
 printf("STACK OPERATION\n");
 printf("1 : Push\n");
 printf("2 : Pop\n");
 printf("3 : Palindrome\n");
 printf("4 : Display\n");
 printf("5 : Exit\n");
 printf("Enter your choice\n");
 scanf("%d",&ch);
 switch(ch)
 {
 case 1: push();
 break;
 case 2: pop();

 break;

 case 3: palindrome();
 break;
 case 4: display();
 break;
 case 5: exit(0);
 default: printf("Invalid choice\n");
 }
 }
 return 0;
}
void push()
{
 int elem;
 if(top==MAX-1)
 printf("stack overflow\n");
 else
 {
 printf("Enter the elements to be inserted\n");
 scanf("%d",&elem);
 top++;
 stack[top]=elem;
 }
}
void pop()
{
 if(top==-1)
 printf("stack underflow\n");
 else
 {
 printf("\nThe deleted element from the stack is %d\n",stack[top]);
 top--;
 }
}
void palindrome()
{
 int i,count=0;
 for(i=0;i<=top/2;i++)
 {
 if(stack[i]==stack[top-i])
 count++;
 }
 if((top/2+1)==count)
printf("Stack contents are palindrome\n");
 else
printf("Stack contents are not palindrome\n");
}

void display()
{
 int i;
 if(top==-1)
 printf("stack underflow\n no elements to display\n");
 else
 {
 printf("The elements of stack are\n");
 for(i=0;i<=top;i++)
 printf("%d\t",stack[i]);
 printf("\n");
 }
}

PROGRAM - 04

#include
#include
char stack[20];
int top=-1;
void push(char op);
char pop();
int prcd(char op);
void conversion(char infix[20],char postfix[20]);
int main()
{
 char infix[20],postfix[20];
 stack[++top]='#';
 printf("Enter infix expression\n");
 scanf("%s",infix);
 conversion(infix,postfix);
 printf("postfix expression is %s\n",postfix);
 return 0;
}
void push(char op)
{
 stack[++top]=op;
}
char pop()
{
 if(top==-1)
 {
 printf("Invalid expression\n");
 return 0;
 }
 else
 return(stack[top--]);
}

int prcd(char op)
{
 switch(op)
 {
 case '^': return 4;
 case '%':
 case '/':
 case '*': return 3;
 case '+':
 case '-': return 2;
 case '(': return 1;
 case '#': return 0;
 default : printf("Invalid choice\n");
 exit(0);
 }
 return 0;
}
void conversion(char infix[20],char postfix[20])
{
 int i=0,j=0;
 char token;
 while(infix[i]!='\0')
 {
 token=infix[i];
 if(isalnum(token))
 postfix[j++]=token;
 else if(token=='(')
 push(token);
 else if(token==')')
 {
 while(stack[top]!='(')
 postfix[j++]=pop();
 pop();
 }
 else
 {
 while(prcd(stack[top])>=prcd(token))
 {
 if(stack[top]=='^'&& token=='^')
 break;
 postfix[j++]=pop();
 }
 push(token);
 }
 i++;
 }
 while(stack[top]!='#')
 postfix[j++]=pop();
 postfix[j]='\0';
}

PROGRAM -05

#include
#include
#include

PROGRAM - 06

#include
#define max 5
int front=-1,rear=-1;
char queue[max];
void cqinsert();
void cqdelete();
void cqdisplay();
int main()
{
 int ch;
 while(1)
 {
 printf("Circular Operations\n1.Insert\n2.Delete\n3.Display\n4.Exit\n");
 printf("Enter your choice\n");
 scanf("%d%*c",&ch);
 switch(ch)
 {
 case 1: cqinsert();
 break;
 case 2: cqdelete();
 break;
 case 3: cqdisplay();
 break;
 case 4: exit(0);
 default: printf("Invalid Choice\n");
 }
 }
 return 0;
}

void cqinsert()
{
 char x;
 printf("Enter the character\n");
 scanf("%c",&x);
 if((front==0 && rear==max-1) || (front==rear+1))
 {
 printf("Circular Queue is Full or Overflow\n");
 return;
 }
 if(front==-1 && rear==-1)
front=rear=0;
 else
 {
if(rear==max-1)
 rear=0;
else
 rear++;
 }
 queue[rear]=x;
}
void cqdelete()
{
 char y;
 if(front==-1 && rear==-1)
 {
 printf("Circular Queue is Empty or Underflow\n");
 return;
 }
 y=queue[front];
 if(front==rear)
front=rear=-1;
 else
 {
 if(front==max-1)
 front=0;
 else
 front++;
 }
 printf("The deleted element is %c\n",y);
}
void cqdisplay()
{
 int i;
 if(front==-1 && rear==-1)
 {

printf("Queue is Empty\n");
 return;
 }
 printf("The Queue Contents are\n");
 for(i=front; i!=rear; i=(i+1)%max)
 printf("%c\n",queue[i]);
 printf("%c\n",queue[rear]);
}

PROGRAM - 07

#include
#include
#define NULL 0
struct node
{
 char usn[15],name[20],branch[10],phno[15];
 int sem;
 struct node *link;
};
typedef struct node *nodepointer;
nodepointer temp, first=NULL;
nodepointer getnode()
{
 nodepointer x;
 x=(nodepointer)malloc(sizeof(struct node));
 return x;
}
void read()
{
 temp=getnode();
 temp->link=NULL;
 printf("Enter the usn\n");
 gets(temp->usn);
 printf("Enter the name\n");
 gets(temp->name);
 printf("Enter the branch\n");
 gets(temp->branch);
 printf("Enter the phone number\n");
 gets(temp->phno);

printf("Enter the semester\n");
 scanf("%d%*c",&temp->sem);
}
void createsll()
{
 int n,i;
 printf("Enter the number of students\n");
 scanf("%d%*c",&n);
 for(i=1;i<=n;i++)
 {
 printf("Enter the details of student %d\n",i);
 read();
 if(first==NULL)
 first=temp;
 else
 {
 temp->link=first;
 first=temp;
 }
 }
}
void display()
{
 int count=0;
 nodepointer temp1=first;
 printf("Student details are as follows\n");
 if(temp1==NULL)
 {
 printf("the student details list is empty and count=%d\n",count);
 }
 else
 { 
 printf("\n_______________________________________________________\n");
 printf("\nUSN\t\tNAME\t\tBRANCH\t\tPHONE\t\tSEM\n");
 printf("\n______________________________________________________\n" );
 while(temp1!=NULL)
 {
 printf("%s\t%s\t%s\t\t%s\t%d\n",temp1->usn,temp1-> 
 name,temp1->branch,temp1->phno,temp1->sem);
 count++;
 temp1=temp1->link;
 }
 printf("\n______________________________________________________\n");
 printf("student count = %d\n",count);
 }

void insertfront()
{
 printf("Enter the deatils of new student to be inserted\n");
 read();
 if(first==NULL)
 first=temp;
 else
 {
 temp->link=first;
 first=temp;
 }
}
void deletefront()
{
 nodepointer temp1=first;
 if(temp1==NULL)
 {
 printf("SLL is empty\n");
 }
 else
 {
 printf("The deleted node is of the student usn %s\n",temp1->usn);
 first=temp1->link;
 free(temp1);
 }
}
void insertend()
{
 nodepointer last=first;
 printf("Enter the details of new student to be inserted\n");
 read();
 if(last!=NULL)
 {
 while(last->link!=NULL)
 {
 last=last->link;
 }
 last->link=temp;
 }
 else
 first=temp;
}
void deleteend()
{
 nodepointer temp1=first, pre=NULL;
 if(temp1==NULL)
 {
 printf("SLL is empty\n");

}
 else if(temp1->link==NULL)
 {
 printf("The deleted node is of the student usn %s\n",temp1->usn);
 free(temp1);
 first=NULL;
 }
 else
 {
 while(temp1->link!=NULL)
 {
 pre=temp1;
 temp1=temp1->link;
 }
 pre->link=NULL;
 printf("The deleted element is %s\n",temp1->usn);
 free(temp1);
 }
}
int main()
{
 int ch;
 while(1)
 {
 printf("Single Linked List\n");
printf("MENU\n1.Create\t2.Display\t3.Insert Front\t 4.Delete Front\t
5.Insert End\t 6.Delete End\t7.Exit\n");
 printf("Enter your choice\n");
 scanf("%d%*c",&ch);
 switch(ch)
 {
 case 1: createsll();
 break;
 case 2: display();
 break;
 case 3: insertfront();
 break;
 case 4: deletefront();
 break;
 case 5: insertend();
 break;
 case 6: deleteend();
 break;
 case 7: exit(0);
 default:printf("Enter a valid choice\n");
 }
 }
 return 0;
}

PROGRAM - 08

#include
#include
#define NULL 0
struct node
{
 char ssn[10],name[20],dept[10],desg[10],phno[15];
 int sal;
 struct node *rlink;
 struct node *llink;
};
typedef struct node *nodepointer;
nodepointer temp,first=NULL,end=NULL;
nodepointer getnode()
{
 nodepointer x;
 x=(nodepointer)malloc(sizeof(struct node));
 return x;
}
void read()
{
 temp=getnode();
 temp->llink=NULL;
 temp->rlink=NULL;
 printf("Enter the ssn\n");
 gets(temp->ssn);

 printf("Enter the name\n");
 gets(temp->name);
 printf("enter the department\n");
 gets(temp->dept);
 printf("Enter the designation\n");
 gets(temp->desg);
 printf("Enter the phone number\n");
 gets(temp->phno);
 printf("Enter the salary\n");
 scanf("%d%*c",&temp->sal);
}
void createdll()
{
 int n,i;
 printf("Enter the number of employees\n");
 scanf("%d%*c",&n);
 for(i=1;i<=n;i++)
 {
 printf("Enter the details of employee %d\n",i);
 read();
 if(first==NULL)
 {
 first=temp;
 end=temp;
 }
 else
 {
 end->rlink=temp;
 temp->llink=end;
 end=temp;
 }
 }
}
void displaycount()
{
 int count=0;
 nodepointer temp1=first;
 if(first==NULL)
 printf("DLL is empty and count is %d\n",count);
 else
 {
 
printf("\n_________________________________________________________\n");
 printf("\nssn\tname\t\tdept\tdesg\tphno\t\tsal\n");
printf("\n_________________________________________________________\n");
 while(temp1!=NULL)
 {

printf("%s\t%s\t%s\t%s\t%s\t%d\n",temp1->ssn,temp1-> 
 name,temp1->dept,temp1->desg,temp1->phno,temp1->sal);
 count++;
 temp1=temp1->rlink
 }
 
printf("\n_________________________________________________________\n");
 printf("employee count is %d\n",count);
 }
}
void insertend()
{
 temp=getnode();
 printf("Enter the details of new employee\n");
 read();
 if(first==NULL)
 {
 first=temp;
 end=temp;
 }
 else
 {
 end->rlink=temp;
 temp->llink=end;
 end=temp;
 }
}
void deleteend()
{
 nodepointer temp1=end;
 if(temp1==NULL)
 {
 printf("DLL is empty\n");
 }
 else if(first==end)
 {
 printf("The deleted element is with ssn %s\n",temp1->ssn);
 first=NULL;
 end=NULL;
 free(temp1);
 }
 else
 {
 printf("The deleted element is with ssn %s\n",temp1->ssn);
 end=end->llink;
 end->rlink=NULL;

free(temp1);
 }
}
void insertfront()
{
 printf("Enter the details of employee\n");
 read();
 if(first==NULL)
 {
 first=temp;
 end=temp;
 }
 else
 {
 temp->rlink=first;
 first->llink=temp;
 first=temp;
 }
}
void deletefront()
{
 nodepointer temp1=first;
 if(first==NULL)
 printf("DLL is empty\n");
 else if(first==end)
 {
 printf("The deleted element is with ssn %s\n",temp1->ssn);
 first=NULL;
 end=NULL;
 free(temp1);
 }
 else
 {
 printf("The deleted element is with the ssn %s\n",temp1->ssn);
 first=first->rlink;
 first->llink=NULL;
 free(temp1);
 }
}
int main()
{
 int ch;
 while(1)
 {

printf("Double Linked List\n");
 printf("MENU\n1.Create\t2.Display and Count\t3.Insert End\t 
 4.Delete End\t5.Insert Front\t6.Delete Front\t7.Exit\n");
 printf("Enter your choice\n");
 scanf("%d%*c",&ch);
 switch(ch)
 {
 case 1: createdll();
 break;
 case 2: displaycount();
 break;
 case 3: insertend();
 break;
 case 4: deleteend();
 break;
 case 5: insertfront();
 break;
 case 6: deletefront();
 break;
 case 7: exit(0);
 default:printf("Enter the valid choice\n");
 }
 }
 return 0;
}

PROGRAM - 10

#include
#include
struct node
{
 int info;
 struct node *lchild;
 struct node *rchild;
};
typedef struct node *nodepointer;
nodepointer getnode()
{
 nodepointer x;
 x=(nodepointer)malloc(sizeof(struct node));
 return x;
}
nodepointer insert(int item, nodepointer root)
{
 nodepointer temp,cur,prev;
 temp=getnode();
 temp->info=item;
 temp->lchild=temp->rchild=NULL;
 if(root==NULL)
 {
 root=temp;
 return root;
 }
 else
 {
 prev=NULL;

cur=root;
 while(cur!=NULL)
 {
 prev=cur;
 if(temp->info < cur->info)
cur=cur->lchild;
 else if(temp->info > cur->info)
 cur=cur->rchild;
 else
 {
 printf("Duplicate Node\n");
 return root;
 }
 }
 if(temp->info > prev->info)
 prev->rchild=temp;
 else
 prev->lchild=temp;
 return root;
 }
}
void preorder(nodepointer root)
{
 if(root!=NULL)
 {
 printf("%d\t",root->info);
 preorder(root->lchild);
 preorder(root->rchild);
 }
}
void inorder(nodepointer root)
{
 if(root!=NULL)
 {
 inorder(root->lchild);
 printf("%d\t",root->info);
 inorder(root->rchild);
 }
}
void postorder(nodepointer root)
{
 if(root!=NULL)
 {
 postorder(root->lchild);
 postorder(root->rchild);

printf("%d\t",root->info);
 }
}
void traversal(nodepointer root)
{
 if(root==NULL)
 {
 printf("The tree is empty\n");
 return;
 }
 printf("\nThe preorder traversal is\n");
 preorder(root);
 printf("\nThe inorder traversal is\n");
 inorder(root);
 printf("\nThe postorder traversal is\n");
 postorder(root);
}
void search(nodepointer root)
{
 int key;
 nodepointer cur;
 printf("Enter the key element to be searched\n");
 scanf("%d",&key);
 if(root==NULL)
 {
 printf("The tree is empty\n");
 return;
 }
 cur=root;
 while(cur!=NULL)
 {
 if(key==cur->info)
 {
 printf("The key element %d is found in tree\n",key);
 return;
 }
 if(keyinfo)
 cur=cur->lchild;
 else
 cur=cur->rchild;
 }
 printf("The key element %d is not found in the tree\n",key);
}

int main()
{
 int ch,item;
 nodepointer root=NULL;
 while(1)
 {
 printf("\nBinary Search Tree Operations\n1.Insert\t 
 2.Traversal\t3.Search\t4.Exit\n");
 printf("Enter your choice\n");
 scanf("%d",&ch);
 switch(ch)
 {
 case 1: printf("Enter the item to be inserted\n");
 scanf("%d",&item);
 root=insert(item,root);
 break;
 case 2: traversal(root);
 break;
 case 3: search(root);
 break;
 case 4: exit(0);
 default:printf("enter a valid choice\n");
 }
 }
 return 0;

PROGRAM - 11

#include
int visited[10],a[10][10],n;
void dfs(int source)
{
 int i;
 visited[source]=1;
 for(i=1;i<=n;i++)
 if(a[source][i]==1 && visited[i]==0)
 dfs(i);
}
void main()
{
 int i,j,source;
 clrscr();
 printf("Enter the number of cities\n");
 scanf("%d",&n);
 printf("Enter the adjacency matrix\n");
 printf("0 if there is no path, 1 if there is a path\n");
 for(i=1;i<=n;i++)
 for(j=1;j<=n;j++)
scanf("%d",&a[i][j]);
 printf("Enter the source city\n");
 scanf("%d",&source);
 for(i=1;i<=n;i++)
 visited[i]=0;
 dfs(source);
 for(i=1;i<=n;i++)
 {
 if(visited[i]==0)
 printf("node %d is not reachable\n",i);
 else
 printf("node %d is reachable\n",i);
 }
}

PROGRAM - 12

#include<stdio.h>
#include<string.h>
#define max 100
struct employee
{
 int key;
 int id;
 char name[20];
};
struct employee e[max];
int a[max];
int count=0;
void linearprobe(int key,int id,char name[20]);
void display();
void main()
{
 int choice,i,key,id;
 char name[20];
 clrscr();
 for(i=0;i<max;i++)
 a[i]=-1;
 do
 {
 printf("Enter employee key ,id and name\n");
 scanf("%d%d%s",&key,&id,&name);
 linearprobe(key,id,name);
 display();
 printf("\ndo you want to continue (1 for Continue & 0 for Exit)\n");
 scanf("%d",&choice);
 }while(choice);
}

void linearprobe(int key,int id,char name[20])

{

 int rem,i;

 rem=key%max;

 if(count==max)

 {

 printf("hash table is full\n");

 getch();

 exit(0);

 }

 else

 {

 if(a[rem]==-1)

 {

 a[rem]=1;

 e[rem].key=key;

 e[rem].id=id;

 strcpy(e[rem].name,name);

 count++;

 }

 else

 {

 printf("\nCollision Detected\n");

 for(i=rem+1; i!=rem;i=(i+1)%max)

 {

 if(a[i]==-1)

 {

 count++;

 a[i]=1;

 e[i].id=id;

 e[i].key=key;

 strcpy(e[i].name,name);

 break;

 }

 }

 }

 }

}

void display()

{

 int i;

 printf("\nHASH TABLE\n");

 printf("___________________________________________\n");

 printf("Address\t Key\t Id\t Name\n");

 printf("___________________________________________\n");

 for(i=0;i<max;i++)

 if(a[i]==1)

 printf("\n[%d]\t %d\t %d\t %s\n",i,e[i].key,e[i].id,e[i].name);

 printf("___________________________________________\n");

}

PROGRAM -05

#include
#include
#include

void towers(int n, char A, char B, char C)
{
 if(n==1)
 {
 printf("Disk 1 is moved from peg %c to peg %c\n", A, C);
 return;
 }
 towers(n-1, A, C, B);
 printf("Disk %d is moved from peg %c to peg %c\n",n, A, C);
 towers(n-1, B, A, C);
}
void eval(char postfix[30])
{
 float result,op1,op2;
 int i=0;
 while(postfix[i]!='\0')
 {
 if(isdigit(postfix[i]))
 push(postfix[i]-'0');
 else
 {
 op2=pop();
 op1=pop();
 switch(postfix[i])
 {
 case '+': result=op1+op2;
 break;
 case '-': result=op1-op2;
 break;
 case '*': result=op1*op2;
 break;
 case '/': result=op1/op2;
 break;
 case '%': result=fmod(op1,op2);
 break;
 case '^': result=pow(op1,op2);
 break;
 default : printf("Enter a valid operation\n");
 }
 push(result);
 }
 i++;
 }
 if(top==0)
 printf("result=%f\n",result);
 else

{
 printf("invalid expression\n");
 exit(0);
 }
}
void push(float x)
{
 stack[++top]=x;
}
float pop()
{
 if(top==-1)
 {
 printf("Invalid expression\n");
 exit(0);
 }
 return(stack[top--]);
}

According to Tompor, scammers are taking advantage of the Amazon Prime Day event, a popular online shopping extravaganza, to trick unsuspecting consumers. They send fake text messages posing as delivery notifications, claiming that a package couldn't be delivered due to an incorrect address or unpaid shipping fees. These texts often include malicious links or phone numbers, aiming to deceive recipients into providing personal information or making payments.

The author emphasizes the importance of verifying the legitimacy of any text message or notification received, especially during high-profile shopping events like Prime Day. Tompor advises recipients to independently track their orders on the official retailer's website or app instead of clicking on suspicious links. By doing so, consumers can ensure the accuracy of delivery information and avoid falling into the trap of scammers.

Tompor further recommends contacting the retailer directly if there are any concerns or doubts about a delivery notification. It is crucial to use contact information obtained from official sources rather than relying on the information provided in suspicious text messages. Retailers can verify the status of an order and provide guidance on how to proceed if there are any genuine issues with the delivery.

Furthermore, the additional tips to protect oneself from scams. One suggestion is to enable two-factor authentication for online shopping accounts, adding an extra layer of security. Reviewing credit card statements regularly can help identify any unauthorized transactions and take immediate action if necessary. Additionally, consumers should be cautious of unexpected requests for personal information or payments, as scammers often use urgency and fear tactics to pressure victims into providing sensitive data.

In conclusion, the readers to stay vigilant during Amazon Prime Day and other online shopping events to avoid falling victim to fake text messages and delivery scams. By staying cautious, verifying notifications, and taking necessary precautions, consumers can protect themselves from potential fraudulent activities. It is essential to rely on official retailer channels, independently track orders, and avoid clicking on suspicious links or sharing personal information. By following these guidelines, shoppers can have a safe and secure online shopping experience.