Dsa

C Code For Liked List and its Operations Using Arrays in Data Structure

#include<stdio.h>

#include <stdlib.h>

struct Node{

    int data;

    struct Node *next;

};


void Traversal(struct Node *ptr){

    while(ptr != NULL){

        printf("%d -> ",ptr->data);

        ptr = ptr->next;

    }

}


// insert at begining

struct Node * insertAtFirst(struct Node *head,int data){

    struct Node *ptr = (struct Node *)malloc(sizeof(struct Node));

    ptr->next = head;

    ptr->data = data;

    return ptr;

}


// insert at end 

struct Node * insertAtEnd(struct Node *head,int data){

    struct Node *ptr = (struct Node *)malloc(sizeof(struct Node));

    struct Node *p = head;

    ptr->data = data;

    

    while(p->next != NULL){

        p = p->next;

    }

    p->next = ptr;

    ptr->next = NULL;

    return head;

}


// insert in between

struct Node * InsertAtIndex(struct Node *head,int data,int index){

    struct Node *ptr = (struct Node *)malloc(sizeof(struct Node));

    struct Node *p = head;

    int i = 0;

    while(i != index-1){

        p = p->next;

        i++;

    }

    ptr->data = data;

    ptr->next = p->next;

    return head;

}


// insert in between

struct Node * InsertAfterNode(struct Node *prevnode,struct Node *head,int data){

    struct Node *ptr = (struct Node *)malloc(sizeof(struct Node));

    ptr->data = data;

    ptr->next = prevnode->next;

    prevnode->next = ptr;

    return head;

}


// delete the first node 

struct Node *DeleteFirstNode(struct Node *head){

    struct Node *ptr = head;

    head = head->next;

    free(ptr);

    return head;

} 


// Deleting the element at a given index

struct Node *DeleteAtIndex(struct Node *head,int index){

    struct Node *p = head;

    struct Node *q = head->next;

    for(int i=0; i<index-1; i++){

        p = p->next;

        q = q->next;

    }

    p->next = q->next;

    free(q);

    return head;

} 


// delete last element 

struct Node *DeleteAtLast(struct Node *head){

    struct Node *p = head;

    struct Node *q = head->next;

    while(q->next != NULL){

        p = p->next;

        q = q->next;

    }

    p->next = NULL;

    free(q);

    return head;

} 


int main(){

    struct Node *head;

    struct Node *secondnode;

    struct Node *thirdnode;

    head = (struct Node *)malloc(sizeof(struct Node));

    secondnode = (struct Node *)malloc(sizeof(struct Node));

    thirdnode = (struct Node *)malloc(sizeof(struct Node));


   head->data = 10;

   head->next = secondnode;

   

   secondnode->data = 50;

   secondnode->next = thirdnode;

   

   thirdnode->data = 100;

   thirdnode->next = NULL;

   

   printf("data:- ");

   Traversal(head);  

//   head = DeleteFirstNode(head);


   printf("delete at last");

   head = DeleteAtLast(head);

   Traversal(head);  

//   printf("insert at first:- ");

//   head = insertAtFirst(head,56);

//   Traversal(head);

   

//   printf("insert in begining:- ");

//   head = InsertAtIndex(head,200,1);

//   Traversal(head);

   

//   printf("insert at end:- ");

//   head = insertAtEnd(head,60);

//   Traversal(head);

   

//   printf("insert after node:- ");

//   head = InsertAfterNode(secondnode,head,90);

//   Traversal(head);

   

   return 0;

}



C Code For Queue and its Operations Using Arrays in Data Structure

#include <stdio.h>

#include <stdlib.h>

#define MAX_SIZE 10  // Define queue size

// Define queue structure

struct queue {

    int size;

    int front;

    int rear;

    int items[MAX_SIZE];

};

// Function to initialize the queue

void MakeEmptyQueue(struct queue *q) {

    q->front = -1;

    q->rear = -1;

    printf("Queue is initialized.\n");

}


// Check if the queue is full

int IsFull(struct queue *q) {

    return (q->rear == q->size - 1);

}


// Check if the queue is empty

int IsEmpty(struct queue *q) {

    return (q->front == q->rear);

}


// Function to add items to the queue

void additems(struct queue *q, int value) {

    if (IsFull(q)) {

        printf("Queue is full, cannot add item %d.\n", value);

    } else {

        q->rear = q->rear + 1;

        q->items[q->rear] = value;

        printf("Added %d to queue.\n", value);

    }

}


// Function to remove items from the queue

void deleteitems(struct queue *q) {

    if (IsEmpty(q)) {

        printf("Queue is empty, cannot delete items.\n");

    } else {

        q->front = q->front + 1;

        printf("Deleted item: %d\n", q->items[q->front]);

    }

}


// Function to traverse and display queue items

void TraversingItem(struct queue *q) {

    if (IsEmpty(q)) {

        printf("Queue is empty.\n");

    } else {

        printf("Queue elements: ");

        for (int i = q->front + 1; i <= q->rear; i++) {

            printf("%d ", q->items[i]);

        }

        printf("\n");

    }

}


int main() {

    struct queue q;

    q.size = MAX_SIZE;

    

    MakeEmptyQueue(&q);


    additems(&q, 10);

    additems(&q, 20);

    additems(&q, 30);


    TraversingItem(&q);


    deleteitems(&q);

    TraversingItem(&q);


    return 0;

}


Comments

Post a Comment

Popular posts from this blog

Lets build a Markdown blog using Next.js, Shadcn, Tailwind, Pieces, Remark & Rehype 🔥

 Building a Markdown blog using **Next.js**, **Shadcn**, **Tailwind CSS**, **Pieces**, **Remark**, and **Rehype** is a fantastic idea! This stack will give you a modern, performant, and highly customizable blog. Let’s break it down step by step. --- ### **1. Set Up Next.js Project** Start by creating a new Next.js project: ```bash npx create-next-app@latest my-markdown-blog cd my-markdown-blog ``` --- ### **2. Install Tailwind CSS** Install Tailwind CSS and configure it: ```bash npm install -D tailwindcss postcss autoprefixer npx tailwindcss init -p ``` Update `tailwind.config.js`: ```javascript /** @type {import('tailwindcss').Config} */ module.exports = {   content: [     "./app/**/*.{js,ts,jsx,tsx}",     "./pages/**/*.{js,ts,jsx,tsx}",     "./components/**/*.{js,ts,jsx,tsx}",   ],   theme: {     extend: {},   },   plugins: [], }; ``` Add Tailwind to your `globals.css`: ```css @tailwind base; @tailwind components; @...
Read more

React Portflio Website Basic to Advance

To build a React-based portfolio website with Tailwind CSS, follow these steps to integrate Tailwind and style your components. 1. Set Up Tailwind CSS in Your React Project First, create a new React project and install Tailwind CSS.   npx create-react-app portfolio-website  cd portfolio-website  npm install -D tailwindcss postcss autoprefixer  npx tailwindcss init After running ,    npx tailwindcss init   a    tailwind.config.js  file will be created. Now, configure Tailwind to purge unused styles by editing tailwind.config.js as follows: tailwind.config.js /** @type {import('tailwindcss').Config} */ module . exports = {   content : [     " ./src/**/*.{js,jsx,ts,tsx} " ,   ],   theme : {     extend : {},   },   plugins : [], } 2. Add Tailwind Directives to CSS Create a new file  src / index .css   (or edit the existing one) to include the Tailwind directives: sr...
Read more

Todo List app using html,js and tailwind.css with features login,logout,storing the data in localstorage addtodos,deletetodos and updating todos,toastify library and many more

Image
  Here's a fully functional To-Do List app with login/logout functionality, item management (add, edit, delete), and local storage for data persistence. The app uses HTML, CSS (with Tailwind CSS for design), and JavaScript for the logic. File Structure: index.html - The main structure of the app style.css - Custom styles (if needed) script.js - JavaScript logic for the app You can use Tailwind CSS CDN for simplicity to quickly apply beautiful styles. Features Breakdown: Login/Logout : The user can log in by entering a username and password. After logging in, they can manage their to-do list. If not logged in, they are redirected to the login screen. To-Do Management : The user can add, edit, and delete items from the to-do list. Local Storage : All data is stored in the browser's local storage, so the data persists even after the page is refreshed. Tailwind CSS : The app uses Tailwind CSS to create a clean, responsive, and modern design. You can run this code by creating th...
Read more