#ninvalidation

[samueladu-mrexponent]

@regrann_app from @exponentsignature . We love good feedbacks like this @exponentsignature . For matters concerning your NIN new registration and capturing, verification and validation, we are a DM away🥰 . Good News📰 You can now convert your NIN slip to plastic ID Card. Yes, we are confirmed and legit 💯 We are an accredited NIMC Agent for NIN registration. . Just send in your tracking ID or NIN slip and within 24hours, you get your NIN Plastic ID card. N*B: This is only for people that have done and validate their NIN before, otherwise, you can come for capturing and new registration at our office at No. 6, Ago Ijaiye Street, Orile-Oshodi, Lagos. . #regrann #nin #nimc #ninplasticidcard #ninverification #nincapturing #ninvalidation https://www.instagram.com/p/CeL16Flji4w/?igshid=NGJjMDIxMWI=

[spthetutor]

Write a program in C to implement a Stack using array

#include<stdio.h> #define SIZE 3

void push(int item);   // declaration void pop();   // declaration void peek();

int st[SIZE]; int tos = -1;

int main() {    int choice, item;    do    {        printf("\n1. PUSH\n2. POP\n3. PEEK\n4. EXIT");        printf("\nEnter your choice : ");        scanf("%d",&choice);        switch(choice)        {            case 1:                printf("\nEnter the item to be pushed : ");                scanf("%d",&item);                push(item);                break;            case 2:                pop();                break;            case 3:                peek();                break;            case 4:                printf("\nGoodbye!");                break;            default:                printf("\nInvalid choice! Try again");        }    }while(choice != 4);    return 0; }

void push(int item) {    if(tos == SIZE - 1)    {        printf("\nStack overflow!");    }    else    {        ++tos;        st[tos] = item;    } }

void pop() {    if(tos == -1)    {        printf("\nStack underflow");    }    else    {        printf("\nPOPPED element is %d",st[tos]);        --tos;    } }

void peek() {    if(tos == -1)    {        printf("\nStack is empty");    }    else    {        printf("\nTopmost element of stack is %d",st[tos]);    } }

[letechnologeek]

Apple n'invalide pas le brevet de Caltech et doit 838 millions de dollars

[spthetutor]

Circular Queue using Arrays

#include<stdio.h> #define LENGTH 3 void enqueue(int item); void dequeue(); void display();

int front = -1, rear = -1; int cq[LENGTH];

int main() {    int choice, item;    do    {        printf("\n1. ENQUEUE\n2. DEQUEUE\n3. DISPLAY\n4. EXIT");        printf("\nEnter choice : ");        scanf("%d",&choice);        switch(choice)        {            case 1:                printf("\nEnter item to insert : ");                scanf("%d",&item);                enqueue(item);                break;            case 2:                dequeue();                break;            case 3:                display();                break;            case 4:                printf("\nEnd of program");                break;            default:                printf("\nInvalid input. Please try again");        }    } while(choice != 4);    return 0; }

void enqueue(int item) {    if((rear == LENGTH - 1 && front == 0) || (front == rear + 1))        printf("\nQueue is full");    else    {        if(front == -1) // same as if (rear == -1)        {            front = rear = 0;            cq[rear] = item;        }        else        {            rear = (rear + 1) % LENGTH;            cq[rear] = item;        }        printf("\nENQUEUE is successful");    } }

void dequeue() {    if(front==-1)   // same as if(rear == -1) printf("\nQueue is empty"); else { if(rear == front) //contains only one element? { front = rear = -1; } else        {            front=(front + 1) % LENGTH;        }        printf("\nDEQUEUE successful"); } }

void display() {    int i;    if (front == -1)    {        printf("\nQueue is Empty");        return;    }    printf("\nElements in Circular Queue are: ");    if (rear >= front)    {        for (i = front; i <= rear; i++)            printf("%d ",cq[i]);    }    else    {        for (i = front; i < LENGTH; i++)            printf("%d ", cq[i]);

       for (i = 0; i <= rear; i++)            printf("%d ", cq[i]);    } }