shaam se aankh mein nami si hain shaam se aankh mein nami si hain aaj phir aapki kamii si hain   shaam se aankh mein nami si hain 

haath chhute bhin to rishtey nahi chhoda kartey haath chhute bhin to rishtey nahi chhoda kartey waqt ki shaakh se lamhe nahi toda karte haath chhute bhin to rishtey nahi chhoda kartey

                                                                   Before writing this, I must mention that before using this phone I was not very keen on buying Motorola Mobile phones, but this one changed my outlook towards Motorola mobiles. This one is my first Motorola mobile. If ever I had to recommend anyone a Music Phone this would be right at the top. […]

There are several ways to find out if a loop is present in the linked list or not. Let’s look at the two ways: 1) If we can modify the linked list structure, then insert a Boolen (bool) flag called visited in the structure. Start traversing the linked list, on every node mark the flag visit […]

/* Structure for a linked list*/ struct list{     int num;     struct list* next; /* pointer to next node in list*/ }; /* Function to find the middle node for the linked list, given the starting node pointer*/ struct list* middle(struct list* head) {

/* Structure for a linked list*/ struct list{     int num;     struct list* next; /* pointer to next node in list*/ }; #define FREE(x) free(x);x=NULL; /* Function to remove duplicates from a linked list, given the head pointer for the list*/ void removeDuplicates(struct list** head) {

/* Structure for a linked list*/ struct list{     int num;     struct list* next; /* pointer to next node in list*/ }; /* Function to split a linked list into two parts, given the position from which to start splitting*/ void split(struct list* head, struct list** dest, int position) {

/* Structure for a linked list*/ struct list{     int num;     struct list* next; /* pointer to next node in list*/ }; #define FREE(x) free(x);x=NULL; /* Function to delete a node from a linked list, given the value for the node*/ int delete(struct list** head, int value) {

/* Structure for a linked list*/ struct list{     int num;     struct list* next; /* pointer to next node in list*/ }; /* Function to find the length of linked list using recursion, given the starting node pointer*/ int length(struct list* node) {