queue implementation using linked list
About Queue A queue is an ordered collection of items in which items may be inserted at one end known as rear end and items may be inserted at one end known as front end. A queue is also known as FIFO (first in first out) structure because the element which is inserted first will […]
queue implementation using array in c
Queue Data Structure A queue is a linear Data structure which allows operations in a particular order i.e. rear or front end only. The order of queue is First In First Out (FIFO) or First Come First Serve (FCFS). A good example of the queue is any queue of consumers for a resource where the […]
single circular linked list implementation in c
Single Circular Linked List A single circular linked list is a list in which each node is linked with others. A node is a structure element containing data and link field.it’s same as a single Linked list but only the difference is in the single linked list the last node next node is always NULL […]
stack implementation using linked list
About Stack A stack is a linear data structure which allows any kind of operations on only top of the stack. Stack follows particular order only i.e LIFO(Last In First Out) or FILO(First In Last Out). About Linked list A linked list is a way to store a collection of elements. Like an array, these can […]
Stack implementation using array
What is Stack A stack is a linear data structure which allows any kind of operations on only top of the stack. Stack follows particular order only i.e LIFO(Last In First Out) or FILO(First In Last Out). How to understand a stack practically? There are many real-life examples of the stack. Consider the simple example […]
circular doubly linked list data structure
Circular doubly linked list data structure Circular Doubly Linked List has properties of both doubly linked list and circular linked list in which two consecutive elements are linked or connected by previous and next pointer and the last node points to the first node by next pointer and also the first node points to the […]
doubly linked list implementation in data structure
Doubly Linked List A linked list is a way to store a collection of elements. Like an array, these can be character or integers. Each element in a linked list is stored in the form of a node. A doubly-linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called […]
singly linked list implementation in data structure
Singly Linked List A linked list is a way to store a collection of elements. Like an array, these can be character or integers. Each element in a linked list is stored in the form of a node. Declaring a Single Linked list In C language, a linked list can be implemented using structure and pointers. struct […]
C Online Assessment#2
It’s an ideal test for pre-employment screening. A good C developer needs to be able not only to solve problems using C but also understand the implications of low-level optimizations. Loading…
C Online Assessment
It’s an ideal test for pre-employment screening. A good C developer needs to be able not only to solve problems using C but also understand the implications of low-level optimizations. Loading…