Scribd
Upload
7 views

DynMemory Programs

Dynamic memory allocation program for 2nd year VTU

Uploaded by

Johnny GAMER
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views

DynMemory Programs

Dynamic memory allocation program for 2nd year VTU

Uploaded by

Johnny GAMER
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

// Program to calculate the sum of n numbers entered by the user

#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);
}

printf("Enter elements: ");


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

// deallocating the memory


free(ptr);
return 0;
}

// Program on realloc
#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;
}

// Find the largest element using Dynamic Memory Allocation


#include <stdio.h>
#include <stdlib.h>
int main() {
int i, n;
float *element; // Pointer to float type to store elements
printf("\n\n Pointer : Find the largest element using Dynamic Memory
Allocation :\n");
printf("-------------------------------------------------------------------------\n");
// Input the total number of elements
printf(" Input total number of elements (1 to 100): ");
scanf("%d", &n);

element = (float *)calloc(n, sizeof(float)); // Allocate memory for 'n'


elements
if (element == NULL) {
printf(" No memory is allocated."); // If memory allocation fails
exit(0);
}
printf("\n");

// Input 'n' numbers and store them dynamically in the allocated memory
for (i = 0; i < n; ++i) {
printf(" Number %d: ", i + 1);
scanf("%f", element + i);
}
// Find the largest element among the 'n' elements
for (i = 1; i < n; ++i) {
if (*element < *(element + i)) {
*element = *(element + i); // Store the largest element in the first
memory location
}
}
printf(" The Largest element is : %.2f \n\n", *element); // Display the
largest element found
return 0;
}
Write a program in C to print all permutations of a given string
using pointers.
#include <stdio.h>
#include <string.h>

// Function to swap characters


void changePosition(char *ch1, char *ch2)
{
char tmp;
tmp = *ch1;
*ch1 = *ch2;
*ch2 = tmp;
}

// Main function
int main()
{
char str[] = "abcd"; // The input string
printf("\n\n Pointer : Generate permutations of a given string :\n");
printf("--------------------------------------------------------\n");
int n = strlen(str); // Get the length of the string
printf(" The permutations of the string are : \n");
charPermu(str, 0, n - 1); // Call function to generate permutations
printf("\n\n");
return 0;
}
// Function to generate permutations of a string
void charPermu(char *cht, int stno, int endno)
{
int i;
if (stno == endno)
printf("%s ", cht); // Print the generated permutation when stno equals
endno
else
{
for (i = stno; i <= endno; i++)
{
changePosition((cht + stno), (cht + i)); // Swap characters at
positions stno and i
charPermu(cht, stno + 1, endno); // Recursively generate
permutations for the rest of the string
changePosition((cht + stno), (cht + i)); // Restore the original string
by swapping back
}
}
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy