Circular Queue Circular Queue uses memory quite efficiently when compared with Linear Queue because in Linear Queue even if there are empty spaces at the front in the queue, it will display “Queue Full” message if the rear pointer reaches at the end of the queue. Circular queue is assumed to be circular array as […]

Read MoreConverting Binary Number To Decimal NumberTo convert any binary number to decimal, there are two steps:First step is to separate all binary digits of the binary number and store the individual bits in a queue. To separate binary digits, the binary number is divided by 10. On every division, the remainder is added to the […]

Read MoreWhat is a QueueA queue is a linear structure where adding of items is done at one end but removing of items is done at the other end. It is for this reason that a queue is also called as FIFO (First In First Out) structure. For implementing a queue, we need two pointers or […]

Read MoreReversing an Integer NumberTo reverse an integer number, it is divided by 10, the remainder is pushed to the stack and the quotient is again divided by 10. On every division, the remainder is pushed to the stack and the quotient is re-divided by 10. The process continues until the quotient becomes less than 10. […]

Read MoreConverting a Decimal Number Into Binary Along With CodeTo convert any decimal number into binary, it is divided by 2, the remainder is pushed to the stack and the quotient is again divided by 2. On every division, the remainder is pushed to the stack and the quotient is re-divided by 2. The process continues […]

Read MoreStack The stack is a data structure where all insertions and deletions are performed at on end. The end at which insertions and deletions are performed is called tos (top of the stack). Suppose, we keep one book on the top of the other. The pile of such collection of books where a book is […]

Read MoreIn this post, I am explaining how a circular linked list is created and displayed along with the source code. The code is written in C programming language. Creating of Circular Linked List With Header In this linked list, we will use a node structure comprising of two members, data and next (see Figure 1). […]

Read MoreIn this post, I am providing the code for creating and displaying circular linked list along with the complete explanation. Code for creating and displaying Circular Singly Linked List #include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; }; struct node *startList; void createCircularLinkedList(); void displayCircularLinkedList(); intÂ main() { startList=NULL; createCircularLinkedList(); displayCircularLinkedList(); […]

Read MoreLet us learn to add new contacts to the Contacts database of the device. The application will display a form prompting the user to enter information like name, address, e-mail address, and phone number of the contact. After entering the information for the new contact, when the user selects the Submit button, a new contact […]

Read MoreSuppose I want to integrate my WordPress blog with Twitter or in other words I wish to tweet from my WordPress blog. I also want that my tweets on Twitter.com should appear as posts in my WordPress blog. For this purpose, I have chosen the Twitter Tools plugin by Crowd Favorite. You can have more […]

Read MoreCircular Queue Circular Queue uses memory quite efficiently when compared with Linear Queue because in Linear Queue even if there are empty spaces at the front in the queue, it will display “Queue Full” message if the rear pointer reaches at the end of the queue. Circular queue is assumed to be circular array as […]

Converting Binary Number To Decimal NumberTo convert any binary number to decimal, there are two steps:First step is to separate all binary digits of the binary number and store the individual bits in a queue. To separate binary digits, the binary number is divided by 10. On every division, the remainder is added to the […]

© 2016 B.M. Harwani's Blog – Site to Help Programmers. All Rights Reserved

Skip to toolbar

- About WordPress
- Log in