Skip to main content

Disclaimer

TheCSpoint is my personal area where I write about various topics of Computer Science. I make sure that whatever content I write is helpful to my reader. All content provided on this blog is for informational purposes only. As the owner of this blog I make no guarantee to the accuracy or completeness of any information on this site.

The owner will not be held responsible for any errors or omissions in the information provided on the blog, nor for the availability of this information. Also the blog owner will not be held responsible for any losses, injuries, or damages from the display or use of this information. All opinions expressed on this blog and also in the guest posts are solely those of its authors and do not gives the opinions of any organizations or any affiliates or TheCSpoint.

You are not allowed to reproduce, reprint or publish any part of this blog without written consent from MI Ansari.

The contents of this blog are not intended to malign any religion, ethnic group, club, organization, company, or individual.

We are very much concerned about the privacy of your personal information. We collect the information but WE NEVER SELL it to third parties.

We also use third party advertisements on TheCSpoint to make it better. Some of these advertisers may use technology such as cookies and web beacons when they advertise on our site, which will also send these advertisers (such as Google through the Google Adsense program) information including your IP address, your ISP, the browser you used to visit our site. This is generally used for geo-targeting purposes or showing certain ads based on specific sites visited.

For more about uses of your information and how we protect your information can be found on privacy policy page.

Popular posts from this blog

Prefix to Infix Conversion

With a given Prefix Expression, we will see how to convert Prefix Expression into Infix Expression using stack.   Algorithm to convert Prefix Expression to Infix Expression: In this algorithm, we will use stack to store operands during the conversion. The step are as follows: Read the prefix string While the end of prefix string scanned from right to left symb = the current character If symb is an operator poped_sym1 = pop the stack poped_sym2 = pop the stack concat the string  STR = ( poped_sym1 )+ ( operator )+( poped_sym2 ) push the string STR into stack Else push the operand symb into stack End If End While infix_str = pop the stack   Function to convert Prefix Expression to Infix Expression: void prefix_to_infix(char prefix[], char infix[]){ char op[2]; //operator string char poped1[MAX]; char poped2[MAX]; char temp[MAX]; int i = strlen(prefix); op[1] = '\0'; while(--i != -1){ if(prefix[i] == ' '){ continue; } if(isoper
Post a Comment
Read more

Circular Doubly Link List

Circular Doubly Link List is data structure which contains a list of node containing info part and links to the next and previous node. In CDLL, last node's next pointer points to the first node and first node's previous pointer points to last node of the list. This  makes traversal in both direction of CDLL.  Before going to discuss the operation on circular doubly link list, we will first see the basic structure of the data type and see how it could be represented in c programming. First we will see the how the node or element of circular doubly link list is represented. See the image below: The component of circular doubly list node: info : It contains the actual information next : This field points to the next node in the list prev  : This field points to the previous node in the list Now we see how the circular doubly link list is represented. See the image below: The component of circular doubly link list are: START  pointer points to the first node of the lis
Post a Comment
Read more

Insert node at last position in doubly link list

Now we will see how to insert a new node at the last position of doubly link list. Algorithm for insertion at last position in doubly link list: In this algorithm, START is pointer to first node of list and PTR is the node to be inserted at last. The steps are as follows: Create new node PTR Set the info field of PTR Set PTR->NEXT = NULL If list is empty i.e. START == NULL Set START = PTR Set PTR->PREV = NULL Else Traverse the list for last node into TEMP pointer Set PTR->PREV = TEMP Set TEMP->NEXT = PTR End If;     Function to insert node at last position in doubly link list: void insertAtLast(NODE **start, int info){ NODE *ptr = (NODE*) malloc(sizeof(NODE)); NODE *temp = *start; ptr->info = info; ptr->next = NULL; if(*start == NULL){ *start = ptr; ptr->prev = NULL; } else{ while(temp->next != NULL){ temp = temp->next; } ptr->prev = temp; temp->next = ptr; } }   Program to insert at last position in the do
Post a Comment
Read more