BCA 2nd Sem Notes-Shift operators

• UNIT-I (Array)

Definition

Declaration & initialization of 1D 

Accessing array elements

Displaying array elements

Sorting arrays

Arrays and function

Declaration & initialization of 1D

Accessing and Displaying

Memory representation of array [Row Major, Column Major]

Multidimensional array

UNIT-II (Pointers)

Definition

Declaration & initialization

Indirection operator

address of operator

pointer arithmetic

dynamic memory allocation

arrays and pointers

function and pointers

UNIT-III (Strings)

Definition

Declaration & initialization

standard library function strlen()

strlen(),strcpy(),   strcat() ,strcmp()

Implementation without using standard library functions

UNIT-IV (Structures)

Definition

Declaration & initialization

Accessing fields

structure operations

Nested structures

Union: Definition  declaration

Differentiate between Union and structure

UNIT-V                                  (C Preprocessor)

Definition
Macro substitution directives
File inclusion directives
Conditional compilation
Bitwise Operators
Shift operators
Masks
Bitfield

UNIT-VI                                (File Handling)

Definition of Files,
Opening modes of files
Standard function
fopen(), fclose(),               feof() fseek(),                     fewind()
Using text files
fgetc(), fputc(),               fscanf()

Program's in C

Shift operators

Left Shift and Right Shift Operators in C/C++ << (left shift) Takes two numbers, left shifts the bits of the first operand, the second operand decides the number of places to shift. ... >> (right shift) Takes two numbers, right shifts the bits of the first operand, the second operand decides the number of places to shift

Two move administrators move the bits in a whole number variable by a predefined number of positions. The << administrator shifts bits to one side, and the >> administrator shifts bits to one side. The punctuation for these double administrators is 

x << n 

also, 

x >> n 

Every administrator moves the bits in x by n positions in the predefined heading. For a correct move, zeros are submitted in the n high-request bits of the variable; for a left move, zeros are put in the n low-request bits of the variable. Here are a couple of models:

Next TopicMasks

← prevnext →