DSA LAB 1 Program

-

 Program for using Dynamic Function (malloc(), calloc(), realloc(), free(0) function 

// malloc() & free() function

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int n, i, *ptr, sum = 0;

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

    ptr = (int *)malloc(n * sizeof(int));

    // if memory cannot be allocated
    if (ptr == NULL)
    {
        printf("Error! memory not allocated.");
        exit(0);
    }

    for (i = 0; i < n; ++i)
    {
        printf("Enter %d elements : ",i+1);
        scanf("%d", ptr + i);
        sum += *(ptr + i);
    }

    printf("Sum = %d", sum);

    // deallocating the memory
    free(ptr);

    return 0;
}

// Output

Enter number of elements: 5 Enter 1 elements : 5 Enter 2 elements : 8 Enter 3 elements : 6 Enter 4 elements : 3 Enter 5 elements : 5 Sum = 27


// calloc() & free() function

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int n, i, *ptr, sum = 0;

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

    ptr = (int *)calloc(n, sizeof(int));

    // if memory cannot be allocated
    if (ptr == NULL)
    {
        printf("Error! memory not allocated.");
        exit(0);
    }

    for (i = 0; i < n; ++i)
    {
        printf("Enter %d elements : ",i+1);
        scanf("%d", ptr + i);
        sum += *(ptr + i);
    }

    printf("Sum = %d", sum);

    // deallocating the memory
    free(ptr);

    return 0;
}

// output
Enter number of elements: 5 Enter 1 elements : 4 Enter 2 elements : 74 Enter 3 elements : 7 Enter 4 elements : 64 Enter 5 elements : 4 Sum = 153


// malloc(), realloc & free() function

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int *ptr, i, n1, n2;
    printf("Enter size: ");
    scanf("%d", &n1);

    ptr = (int *)malloc(n1 * sizeof(int));

    printf("Addresses of previously allocated memory:\n");
    for (i = 0; i < n1; ++i)
        printf("%pc\n", ptr + i);

    printf("\nEnter the new size: ");
    scanf("%d", &n2);

    // rellocating the memory
    ptr = realloc(ptr, n2 * sizeof(int));

    printf("Addresses of newly allocated memory:\n");
    for (i = 0; i < n2; ++i)
        printf("%pc\n", ptr + i);

    free(ptr);

    return 0;
}

// output

Enter size: 5 Addresses of previously allocated memory: 00B51AB0c 00B51AB4c 00B51AB8c 00B51ABCc 00B51AC0c Enter the new size: 4 Addresses of newly allocated memory: 00B51AB0c 00B51AB4c 00B51AB8c 00B51ABCc

Comments

Post a Comment

Popular posts from this blog

DSA Lab 8 program

-
 Program for implementing multiple stack. # include < stdio.h > # include < stdlib.h > struct stack {     int maxstack;     int * stack;     int top; }; int isEmpty ( struct stack * ptr ) {     if ( ptr -> top == - 1 ) {         return 1 ;     } else {         return 0 ;     } } int isFull ( struct stack * ptr ) {     if ( ptr -> top == ptr -> maxstack - 1 ) {         return 1 ;     } else {         return 0 ;     } } int peek ( struct stack * ptr ) {     return ptr -> stack [ ptr -> top ]; } int pop ( struct stack * ptr ) {     if ( isEmpty (ptr) ) {         printf ( " Stack Underflow! Cannot pop from the stack \n " ) ;         return - 1 ;     } else {         in...
Read more

DSA Lab 7 Program

-
 Program for implementing Stack using array # include < stdio.h > int maxstack = 10 ; int stack [ 10 ]; int top = - 1 ; int empty (){     if (top == - 1 ){         return 1 ;     }     else {         return 0 ;     } } int full (){     if (top == maxstack){         return 1 ;     }     else {         return 0 ;     } } int peek (){     return stack [top]; } int pop (){     int data;     if ( ! empty () ){         data = stack [top];         top -= 1 ;         printf ( " The data has been Deleted. Your data is %d \n " , data) ;         return data;     }     else {         printf ( " The data Can't be Deleted. Becouse stack is empty \n " ) ;   ...
Read more

Network Layer: Design Issues and Key Concepts

-
Image
 ### Network Layer: Design Issues and Key Concepts **Network Layer** is responsible for data transfer between devices on different networks. It determines how data is routed from the source to the destination, ensuring it follows the best path. ### 1. **Design Issues in the Network Layer:**    - **Routing**: Deciding the best path for data to travel across the network.    - **Congestion Control**: Preventing network overload, ensuring smooth data flow.    - **Packet Forwarding**: Moving data packets from one network to another.    - **Error Handling**: Detecting and correcting errors that occur during data transmission. ### 2. **Routing Algorithms**: A Detailed Explanation Routing algorithms are methods used by network devices (like routers) to determine the best path for data to travel from its source to its destination. The goal of these algorithms is to ensure that data packets reach their destination efficiently, quickly, and with minimal...
Read more