Skip to main content

Operators in C programming : Assignment Operators

There are several different assignment operators in C. All of them are used to form assignment expressions which assign the value of an expression to an identifier. The most commonly used assignment operator is =. Assignment expressions that make use of the operator are written in the form:
identifier = expression
Where identifier generally represents a variable, and expression represents a constant, a variable or more complex expression.
 Here are some typical assignment expressions that make use of the = operator.
a = 3
x = y
delta = 0.001
sum = a+b
area = length * width
Assignment operator = and equality operator = = are distinctly different. The assignment operator can be applied only to integer type signed or unsigned) and not to float or double. They are
Operator                    Meaning
&                                 bitwise AND
|                                   bitwise OR
^                                  bitwise exclusive OR
<<                                Left shift
>>                                right shift
~                                  bitwise one’s complement operator

Consider, a = 60 and b = 15. THe binary representation of a and b for 32 bits

a = 0000 0000 0011 1100
b = 0000 0000 0000 1111
c = a & b = 0000 0000 0011 1111 = 12
d = a | b = 0000 0000 0011 1111 = 63
n = ~ a = 1111 1111 1100 0011 = -61
e = a ^ b = 0000 0000 0011 0011 =51

For Bitwise Shift Operator
Operand Bitwise Shift operator number
For e.g.
a = 0000 0000 0011 1100

f = a << 3
shift1 = 0000 0000 0111 1000
shift2 = 0000 0000 1111 0000
shift3 = 0000 0001 1110 0000 = f = 480
Similarly,
g = a > > 3
shift1 = 0000 0000 0001 1110
shift2 = 0000 0000 0000 1111

shift3 = 0000 0000 0000 0111 = g = 7

Comments

Popular posts from this blog

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...