Left and Right Rotate Bits of a Number in C

Here we’ll see how to write C program to left or right rotate bits of a number. For example, an unsigned integer consists of 32-bit. Number 2591458749 is represented as 10011010011101101000010110111101 in binary. The diagram below shows how the bits of that number will look like after rotating 8 bits. Logic to Left Rotate Bits … Continue reading “Left and Right Rotate Bits of a Number in C”

C Program to Toggle Bits

Here we’ll see how to write C program to toggle all bits or a particular bit or all but a particular bit of a number. Toggle All Bits of a Number We can toggle all bits of a number using NOT (~) bitwise operation. Doing NOT (~) operation on a number toggles all of its … Continue reading “C Program to Toggle Bits”

C Program to Set, Clear and Toggle a Bit

In this article we saw how to check a particular bit of a number. Here we’ll see how to set, clear or toggle a bit of a number. Setting a Bit Setting a bit means making that bit 1 irrespective of the previous value of that bit. We can use bitwise operation OR (|) to … Continue reading “C Program to Set, Clear and Toggle a Bit”

C Program to Move the Last Node to the Front of a Linked List

Here we’ll see how to write C Program to move the last node to the front of a linked list. We can do that just by re-arranging the pointers. No need to create or delete any node. Logic to Move the Last Node to the Front If the linked list is empty or has only … Continue reading “C Program to Move the Last Node to the Front of a Linked List”

C Program to Delete the Last Node of a Linked List

Here we’ll see how to delete the last node of a linked list. The last node always points to NULL. To delete that, we have to traverse up to last node. We have to point the second last node to NULL and free memory of the last node. After deletion the second last node will … Continue reading “C Program to Delete the Last Node of a Linked List”

1
0
0
4
11
1