Question

write code:

char animals[4][10] = {“MONkey”, “BEAR”, “DoG”, “kittyKAT”};
Display all elements in animals.

Display only the uppercase letters.

2. Write a function to reverse the linked list (holds 3 Nodes). Use only pointer operations.
head ->12->18-> 4->NULL End result: 4 ->18 ->12

Answer 1

# include int main() char animals [4] [101- "MONkey", "BEAR", "DoG", "kittyKAT"); int i-0,j; printf" for (1#0;i<4:1++)//printing contents contents of animals array puts (animals[i]) printf ("- for (i-0:i<4;i++)//printing uppercase letters only uppercase letters while (animals[i] [j]) if (animals [i] j1 'A'&&animals[illj]<-'Z') //checking for uppercase characters. printf ("%c", animals [i] [j] ) ; printf ("In") return 0;

contents of animals array MONkey BEAR DoG kittyKAT only uppercase letters MON BEAR DG AT Process exited normally Press any key to continue . - .

----------------------------------------------------------------------------------------------------------------------------------------------

#include # include struct node int data struct node *next; void reverse (struct node *head) struct node *temp, *templ; tempshead->next;//interchaning head->next-temp->next->next; head->next->next- temp->next; head->next->next->next-temp; data.ן int main() struct node *head=NULL, *node 1, *node2,*node3://declaring 3 nodes head- (struct node*) malloc (sizeof (struct node)//allocating memory node 1=(struct node*) malloc (sizeof (struct node)) ; node2-(struct node*) malloc (sizeof (struct node)) node3-(struct node*) malloc (sizeof (struct node)) head->next-nodel;//forming 1links between nodes.after head node.l node1->next-node2//after nodel ,node2 node2->next-node3//after node2,node3

node3->next-NU LL;//after node3,null node1->data 12://placing data node2->data-18 node3->data 4 printf("--before reverse-n"); printf ("%d>", head->next->data) ; printf ( " %d>", head->next->next->data) ; printf ( " %d\n" , head->next->next->next->data) ; reverse (head);//calling reverse funtion. printf printf ("%d>", head->next->data) ; printf ( " %d>", head->next->next->data) ; printf ("%d", head->next->next->next->data) ; return 0 "-after reverse-")

before reverse 12-18-4 afterreverse 4-〉18-12 rocess exited normally. ress any key to continue . - .

---------------------------------------------------------------------------------------------------------------------------------

#include<stdio.h>
int main()
{
   char animals[4][10]={"MONkey","BEAR","DoG","kittyKAT"};
   int i=0,j;
   printf("---------------contents of animals array-----------------\n");
   for (i=0;i<4;i++)//printing contents
       puts(animals[i]);
   printf("---------------only uppercase letters-----------------\n");
   for (i=0;i<4;i++)//printing uppercase letters
   {
       j=0;
       while(animals[i][j])
       {
           if (animals[i][j]>='A'&&animals[i][j]<='Z')//checking for uppercase characters.
               printf("%c",animals[i][j]);
           ++j;
       }
       printf("\n");  
   }
   return 0;
}

---------------------------------------------------------------------------------------------------------------------------------

---------------------------------------------------------------------------------------------------------------------------------

#include<stdio.h>
#include<malloc.h>
struct node
{
   int data;
   struct node *next;
};
void reverse(struct node *head)
{
   struct node *temp,*temp1;
   temp=head->next;//interchaning data.
   head->next=temp->next->next;
   head->next->next=temp->next;
   head->next->next->next=temp;
}
int main()
{
   struct node *head=NULL,*node1,*node2,*node3;//declaring 3 nodes
   head=(struct node*)malloc(sizeof(struct node));//allocating memory
   node1=(struct node*)malloc(sizeof(struct node));
   node2=(struct node*)malloc(sizeof(struct node));
   node3=(struct node*)malloc(sizeof(struct node));
   head->next=node1;//forming links between nodes.after head node1
   node1->next=node2;//after node1 ,node2
   node2->next=node3;//after node2,node3
   node3->next=NULL;//after node3 ,null
   node1->data=12;//placing data
   node2->data=18;
   node3->data=4;
   printf("---------------------------before reverse-------------------------\n");
   printf("%d->",head->next->data);
   printf("%d->",head->next->next->data);
   printf("%d\n",head->next->next->next->data);
   reverse(head);//calling reverse funtion.
   printf("---------------------------after reverse-------------------------\n");
   printf("%d->",head->next->data);
   printf("%d->",head->next->next->data);
   printf("%d",head->next->next->next->data);
   return 0;
}

---------------------------------------------------------------------------------------------------------------------------------

"IF YOU HAVE ANY DOUBTS,PLEASE USE COMMENT SECTION"