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

Insertion at specific position N in singly link list

Insertion of a new node at position N in singly link list requires traversing the list for N-1 th node so that links are updated to accommodate the new node in the list. The new node's next is set to point to Nth node of the list and then N-1 th node's next pointer is updated so that it reference to new node. The step by step algorithm to insert node at Nth position is as below: Algorithm to insert node at specific position N in singly link list: This algorithm will insert the new node PTR at the position N in the link list. The steps are as follows: Create new node PTR Set the INFO field of PTR If N is less than 1 Node can't be inserted Else If node is to be inserted at first i.e. [N=1] Make new node PTR points to first node i.e. [PTR->NEXT = START] Make START point to new node PTR i.e. [START = PTR] Else Traverse the list to get the (N-1)th node of list into TEMP Make PTR's next pointer point to Nth node in the list i.e. [PTR -> NEXT  =  TEMP-...
Post a Comment
Read more

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

Concatenating two link list

Here we will see how to concat two single link list into other link list. First we copy the content of first list in third list and then the content of second list into third list. Algorithm for concatenation of two link list: This algorithm will use three list. List 1 and List 2 will be concatenated into List 3. The step below: Copy the list 1 into list 3 Copy the list 2 at the last of list 3 Function to concat two link list: void concatLists(NODE **start1, NODE **start2, NODE **mergeinto){ NODE *temp; temp = *start1; while(temp != NULL){ insertAtLast(&*mergeinto, temp->info); temp = temp->next; } temp = *start2; while(temp != NULL){ insertAtLast(&*mergeinto, temp->info); temp = temp->next; } }   Program to concat two link lists: #include <stdio.h> #include <malloc.h> struct node{ int info; struct node *next; }; typedef struct node NODE; void insertAtLast(NODE **, int); void traverse(NODE **); void concatLists(NODE **,...
Post a Comment
Read more