Skip to main content

Featured Post

How to use Tabs in ASP.NET CORE

I want to show Components in a tabs , so first of all create few components. In this project we have three components, First View Component  public class AllViewComponent : ViewComponent     {         private readonly UserManager<ApplicationUser> _userManager;         public AllViewComponent(UserManager<ApplicationUser> userManager)         {             _userManager = userManager;         }         public async Task<IViewComponentResult> InvokeAsync()         {             List<StudentViewModel> allUsers = new List<StudentViewModel>();             var items = await _userManager.Users.ToListAsync();             foreach (var item in items)             {                 allUsers.Add(new StudentViewModel {Id=item.Id, EnrollmentNo = item.EnrollmentNo, FatherName = item.FatherName, Name = item.Name, Age = item.Age, Birthdate = item.Birthdate, Address = item.Address, Gender = item.Gender, Email = item.Email });             }            

Example programs showing pointer assignment, addition and subtractions in Data Structures through 'C'

Example programs showing pointer assignment, addition and subtractions:


1.’C’ program to read and print a dynamic array of the user required size:
   #include<stdio.h>
  #include<conio.h>
  #include<stdlib.h>
main(),
{
 int *arr, size, i;
 /* arr is a pointer to store address of dynamically allocated memory*/
 clrscr();
 printf(“Enter the size of array :”);
 scanf(“%d”,&size);
  arr=(int*)malloc(size*sizeof(int));
   /* dynamic memory allocation, pointer assignment operation */

  If(arr= = NULL)
 {
   printf(“Memory allocation error!”);
   exit(0);        /*to terminate program execution */
 }    /*end of if*/
 printf(“\n Enter array elements:”);
 for(i=0;i<size;i++)
    scanf(“%d”,arr+i);                                 /*pointer
addition */
  printf(“\nThe array is:\n”);
  for(i=0;i<size;i++)
  printf(“%d”,*(arr+i));                                  /*pointer
 addition */

}             /* end of main() */


NOTE: The array elements can also be referred as arr[i],
Where ’i’ is the index of the respective element.
The same program 1 for reading and displaying dynamic array can also be written with pointer subtraction as follows:

To read the array and display the array using pointer subtraction operation, the address of the last element is stored in a pointer variable and it is update accordingly by subtracting the respective index of the element to be read or displayed.
   #include<stdio.h>
  #include<conio.h>
  #include<stdlib.h>
main(),
{
  int *arr, size, i,*p;
  /* arr is a pointer to store address of dynamically allocated memory*/
  clrscr();
  printf(“Enter the size of array :”);
  scanf(“%d”,&size);

   arr=(int*)malloc(size*sizeof(int));
   /* dynamic memory allocation, pointer assignment operation */

   if(arr= = NULL)
   {
     printf(“Memory allocation error!”);
     exit(0);        /*to terminate program execution */
     }    /*end of if*/

  p=&a[size-1];/*address of the last element */
  printf(“\n Enter array elements:”);
  for(i=size-1;i>=0;i--)
   scanf(“%d”,p-i);                   /*pointer subtraction*/

  p=&a[size-1]; /*pointer assignment */
  printf(“\nThe array is:\n”);
  for(i=0;i<size;i++)
   printf(“%d”,*(p-i));      /*pointer subtraction*/

}             /* end of main() */

2.’C’ program to implement to searching using dynamic array:


   #include<stdio.h>
  #include<conio.h>
  #include<stdlib.h>
main(),
{
 float *arr, num;  /*array of real numbers */
 int size, i;
 clrscr();
 printf(“Enter the size of array :”);
 scanf(“%d”,&size);
 arr=(float*)malloc(size*sizeof(float));
 if(arr = = NULL)
 {
  printf(Memory allocation error!);
  exit(0);    /*to terminate program execution */
 }        /* end of it*/
 printf(“\nEnter  array elements:”);
 for(i=0;i<size;i++)
 scanf(“%f”,arr+i);                                      /*pointer addition */
 printf(“Enter the real number to search in array:”);
 scanf(“%f”,&num);
 for(i=0;i<size;i++)
   if(num==*(arr+i))
   break;                /*to terminate for loop */
 if(i==size)            /*if i=size then ‘break’ is not executed.
                               Element comparison is over */
 printf(“Search unsuccessful…”);
 else
 printf(“Search successful…”);
} /*end of main() */

3.’C’ program to count the frequency of a number in a dynamic array.

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
main(),
{
  float *arr, num;  /*array of real numbers */
  int size, i, count=0;
  printf(“Enter the size of array :”);
  scanf(“%d”,&size);
  arr=(float*)malloc(size*sizeof(float));
  if(arr == NULL)
 {
   printf(Memory allocation error!);
   exit(0);    /*to terminate program execution */
 }        /* end of it*/
  printf(“\nEnter  array elements:”);
  for(i=0;i<size;i++)
  scanf(“%f”,arr+i);                                      /*pointer addition */
  printf(“Enter the number, the freq. of which is freq.:”);
  scanf(“%f”,&num);
   /*finding the frequency */
  for(i=0;i<size;i++)
   if(num==*(arr=i))
     count++;        /*count incremented by 1, whenever the num is equal to
                              the array element */                                
  printf(“\n Frequency of number %f is %d”,num,count);
} /*end of main() */

4.’C’ program to find the number of prime numbers stored in a dynamic array.

  #include<stdio.h>
 #include<conio.h>
 #include<stdlib.h>
 int prime(int num)
{
  int i;
  for(i=2;i<=num/2;i++)
  if(num%i == 0)               /*Non-prime */
     return 0;
  return 1;               /*prime */
 }
main()
{
  int  *arr, size, i, count=0;

  printf(“Enter the size of array :”);
  scanf(“%d”,&size);

  arr=(int*)malloc(size*sizeof(int));
  if(arr == NULL)
 {
   printf(“Memory allocation error!”);
   exit(0);                                /*to terminate program execution */
}                         /* end of it*/
 printf(“\nEnter  array elements:”);
 for(i=0;I<size;i++)
 scanf(“%d”,arr+i);                                      /*pointer addition */
 for(i=0;i<size;i++)
 if(prime(*(arr+i)) ==1)
 count++;                                    
 printf(“\nNumber of primes = %d”,count);
} /*end of main() *

Comments

Popular Post

Polynomial representation using Linked List for Data Structure in 'C'

Polynomial representation using Linked List The linked list can be used to represent a polynomial of any degree. Simply the information field is changed according to the number of variables used in the polynomial. If a single variable is used in the polynomial the information field of the node contains two parts: one for coefficient of variable and the other for degree of variable. Let us consider an example to represent a polynomial using linked list as follows: Polynomial:      3x 3 -4x 2 +2x-9 Linked List: In the above linked list, the external pointer ‘ROOT’ point to the first node of the linked list. The first node of the linked list contains the information about the variable with the highest degree. The first node points to the next node with next lowest degree of the variable. Representation of a polynomial using the linked list is beneficial when the operations on the polynomial like addition and subtractions are performed. The resulting polynomial can also

How to use Tabs in ASP.NET CORE

I want to show Components in a tabs , so first of all create few components. In this project we have three components, First View Component  public class AllViewComponent : ViewComponent     {         private readonly UserManager<ApplicationUser> _userManager;         public AllViewComponent(UserManager<ApplicationUser> userManager)         {             _userManager = userManager;         }         public async Task<IViewComponentResult> InvokeAsync()         {             List<StudentViewModel> allUsers = new List<StudentViewModel>();             var items = await _userManager.Users.ToListAsync();             foreach (var item in items)             {                 allUsers.Add(new StudentViewModel {Id=item.Id, EnrollmentNo = item.EnrollmentNo, FatherName = item.FatherName, Name = item.Name, Age = item.Age, Birthdate = item.Birthdate, Address = item.Address, Gender = item.Gender, Email = item.Email });             }            

Memory representation of Linked List Data Structures in C Language

                                 Memory representation of Linked List              In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.                Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:       Suppose next node is allocated at an address 506, so the list becomes,   Suppose next node is allocated with an address with an address 10,s the list become, The other way to represent the linked list is as shown below:  In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of