Queue using Linked List in C Program

A queue like a stack is another special type of ordered list. In queue insertion operations are permitted at one end of the list and deletion operations are performed at the other end of the list. The end where insertion operations are performed is called rear and the end where deletion operations are performed is called front. A queue is often called Fisrt In Fisrt Out(FIFO) list because the first element removed is the first element added to the queue.

Continue reading “Queue using Linked List in C Program”

Stack using Linked List in C Program

Stack is a special kind of linear list. Linear list is an ordered collection of a number of items of the same type. Two operations are performed frequently from linear list – insertion and deletion. A stack is a linear list where all insertions and deletions happen at one end of the list. A stack is often called Last In First Out(LIFO) because a first element removed is the last element pushed to the stack.

Here we will see the operations on stack using linked list because the stack is never full as long as the system has enough space for dynamic memory allocation. Continue reading “Stack using Linked List in C Program”

Doubly Linked List Example Using C Program

This example shows how to create, insert, append, remove nodes in doubly linked list using C program. We will use here Structure, which is a composite data type, in which we can define all data types under the same name or object. Size of the Structure is determined by computing the size of all data types, plus any internal padding. The key word struct is used to declare the Structure. In doubly linked list there are two links – one is left and another is right link.

Continue reading “Doubly Linked List Example Using C Program”

Singly Linked List Example Using C Program

This example shows how to create, insert, append, remove nodes in singly linked list using C program. We will use here Structure, which is a composite data type, in which we can define all data types under the same name or object. Size of the Structure is determined by computing the size of all data types, plus any internal padding. The key word struct is used to declare the Structure. Unlike doubly linked list singly linked list has only one link.

Continue reading “Singly Linked List Example Using C Program”

Multiplication of Two Polynomials using C Program

This example shows how to multiply two polynomials using C program. For multiplication of two polynomials we will use here Structure, which is a composite data type, in which we can define all data types under the same name or object. Size of the Structure is determined by computing the size of all data types, plus any internal padding. The key word struct is used to declare the Structure. A Polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients.

Continue reading “Multiplication of Two Polynomials using C Program”

Addition of Two Polynomials using C Program

This example shows how to add two polynomials using C program. For addition of two polynomials we will use here Structure, which is a composite data type, in which we can define all data types under the same name or object. Size of the Structure is determined by computing the size of all data types, plus any internal padding. The key word struct is used to declare the Structure. A Polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients. Continue reading “Addition of Two Polynomials using C Program”