How structure elements are stored?

The elements of a structure are always stored in contiguous memory locations. This can be illustrated as

void main()

{

struct student

{

int roll;

float marks;

char remarks;

};

struct student st={200,60.5,'P'};

printf("\nAddress of roll=%u",&st.roll);

printf("\nAddress of marks=%u",&st.marks);

printf("\nAddress of remarks=%u",&st.remarks);

getch();

}

Output:

Address of roll=65518

Address of marks=65520

Address of remarks=65524

st.roll st.marks st.remarks

200

60.5

‘P’

65518 65520 65524

Comments

Object Oriented Programming

Object Oriented Programming Programming paradigm that represents the concept of "objects" that have data fields (attributes that describe the object) and associated procedures known as methods Programming methodology based on objects, instead of just functions and procedures Focuses on data rather than process As individual objects can be modified without affecting other aspects of the program, it is easier for programmers to structure and organize software programs Easier to update and change programs written in object-oriented languages Simula was the first object oriented programming language Eg: C++, Java, etc. Features of OOPS Objects Referred as instance of class Basic run-time entities in an object-oriented system a person, a place, a bank account, a table of data, etc can be an object They occupy space in memory that keeps its state Each object contains data and code to manipulate the data Classes Blue print or prototype which ...

Passing arrays to functions in C programming

Like any other variables, we can also pass entire array to a function. An array name can be named as an argument for the prototype declaration and in function header. When we call the function no need to subscript or square brackets. When we pass array that pass as a call by reference because the array name is address for that array. /* Program to illustrate passing array to function */ #include<stdio.h> void display(int) ; /* function prototype */ main( ) { int num[5] = {100, 20, 40, 15, 33, i ; clrscr( ) ; printf (“\n The content of array is \n”) ; for (i=0; i<5; i++) display (num[i]) ; /*Pass array element fo fun */ getch{ } ; } void display(int n) { printf (“\t%d”, n ) ; } Output: The content of array is 100 20 40 15 3 /* Program to read 10 numbers from keyboard to store these num into array and then c...

Recursive Function in C programming

If a statement within the body of a function calls the same function, the function is called recursive function. Actually, recursion is a process by which a function calls itself repeatedly until some specified condition has been satisfied. This process is used for repetitive computations in which each action is stated in term of previous result. Many iterative or repetitive problems can be written in this form. To solve a problem using recursive method, two conditions must be satisfied. They are: 1) Problem could be written or defined in term of its previous result. 2) Problem statement must include a stopping condition. /* An example of recursive function to calculate factorial of a number.*/ #include<stdio.h> #include<conio.h...

Learning posts

Search This Blog