This document provides an example of how to implement a circular right shift of bits in C. It asks the user to input an integer and number of bits to shift. It then shows the binary representation before and after shifting bits to the right by that number of places. Examples are given for positive integers shifted 1-3 places and negative integers shifted 3 places. Pre-requisites and the objective of understanding bitwise operations and functions are also stated.

1. Team Emertxe
Function and Pointer
Basics

2. Assignment 8

3. Assignment 8

4. Assignment 8
WAP to implement Circular Right shift

5. WAP to implement Circular Right shift
Input:
Assignment 8

6. WAP to implement Circular Right shift
Input: Read integer ‘num’(-ve and +ve) and number of bits
‘n’
Assignment 8

7. WAP to implement Circular Right shift
Input: Read integer ‘num’(-ve and +ve) and number of bits
‘n’
Output:
Assignment 8

8. WAP to implement Circular Right shift
Input: Read integer ‘num’(-ve and +ve) and number of bits
‘n’
Output: Print the updated value of ‘num’ after shifting bits
towards right in binary format.
Assignment 8

9. Example’s:
Assignment 8

10. Example’s:
➢ Input: num = 12 and n = 3
Assignment 8

11. Example’s:
➢ Input: num = 12 and n = 3
➢ 32 bit binary representation of num 12 :
Assignment 8

12. Example’s:
➢ Input: num = 12 and n = 3
➢ 32 bit binary representation of num 12 :
Assignment 8
0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 0 0
0
1
1
0
0
0
0
0
0
0
0
0
0
0

13. Example’s:
➢ Input: num = 12 and n = 3
➢ Shift ‘num’ 3 times towards right.
Assignment 8
0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 0 0
0
1
1
0
0
0
0
0
0
0
0
0
0
0
1 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 0 1
0
0
0
0
0
0
0
0
0
0
0
0
0
0

14. Example’s:
➢ Input: num = -12 and n = 3
Assignment 8

15. Example’s:
➢ Input: num = -12 and n = 3
➢ 32 bit binary representation of num -12 :
Assignment 8

16. Example’s:
➢ Input: num = -12 and n = 3
➢ 32 bit binary representation of num -12 :
Assignment 8
1 1
1
1
1
1
1
1
1
1
1
1
1
1
1
1 1 0
0
1
0
1
1
1
1
1
1
1
1
1
1
1

17. Example’s:
➢ Input: num = -12 and n = 3
➢ Shift ‘num’ 3 times towards right.
Assignment 8
1 1
1
1
1
1
1
1
1
1
1
1
1
1
1
1 1 0
0
1
0
1
1
1
1
1
1
1
1
1
1
1
1 1
1
1
1
1
1
1
1
1
1
1
1
1
0
0 1 0
1
1
1
1
1
1
1
1
1
1
1
1
1
1

18. Example’s:
➢ Input: num = 15 and n = 2
Assignment 8

19. Example’s:
➢ Input: num = 15 and n = 2
➢ 32 bit binary representation of num 15 :
Assignment 8

20. Example’s:
➢ Input: num = 15 and n = 2
➢ 32 bit binary representation of num 15 :
Assignment 8
0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 0 1
1
1
1
0
0
0
0
0
0
0
0
0
0
0

21. Example’s:
➢ Input: num = 15 and n = 2
➢ Shift ‘num’ 2 times towards right.
Assignment 8
0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 0 1
1
1
1
0
0
0
0
0
0
0
0
0
0
0
1 0
0
0
0
0
0
0
0
0
0
0
0
0
0
1 0 1
1
0
0
0
0
0
0
0
0
0
0
0
0
0

22. Example’s:
➢ Input: num = 1 and n = 1
Assignment 8

23. Example’s:
➢ Input: num = 1 and n = 1
➢ 32 bit binary representation of num 1 :
Assignment 8

24. Example’s:
➢ Input: num = 1 and n = 1
➢ 32 bit binary representation of num 1 :
Assignment 8
0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 0 1
0
0
0
0
0
0
0
0
0
0
0
0
0
0

25. Example’s:
➢ Input: num = 1 and n = 1
➢ Shift ‘num’ 1 time towards right.
Assignment 8
0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 0 1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

26. Sample execution:-
Assignment 8

27. Sample execution:-
Assignment 8

28. Pre-requisites:-
Assignment 8

29. Pre-requisites:-
➢ Bitwise operators
Assignment 8

30. Pre-requisites:-
➢ Bitwise operators
➢ Functions
Assignment 8

31. Pre-requisites:-
➢ Bitwise operators
➢ Functions
Objective:-
Assignment 8

32. Pre-requisites:-
➢ Bitwise operators
➢ Functions
Objective:-
To understand the concept of
➢ Bitwise operations
Assignment 8

33. Pre-requisites:-
➢ Bitwise operators
➢ Functions
Objective:-
To understand the concept of
➢ Bitwise operations
➢ Functions
Assignment 8

34. Team Emertxe
Thank you