Owner: Data structures URL:http://www.datastructurestutorial.blogspot.com/ Join Date: Sun, 24 Aug 2008 21:56:29 -0500 Rating:0 Site Description: fundamentals of data structures and implementations of all the basic data structures like stack, queue, linked list, tree. graph Site statistics:Click here
Stack ( ADT ) Data Structure 2008-08-20 00:13:00 Stack ( ADT ) Data Structure
:
* Stack is an ADT woks on the principle Last In First Out (LIFO)
* The last element add to the stack is the first element to be delete.
* Insertion and deletion can be takes place at one end called TOP.
* It looks like one side closed tube.
* The add operation of the stack is called push operation
* The delete operation is called as pop operation.
* Push Read more:Stack
Double Linked List 2007-12-06 03:33:00 Doubly linked list (or) Double linked list :- Double Linked list is a fundamental data structure used in computer programming. It consists of a sequence of nodes connected by two pointers in both directions. Each node is having three parts the first part contains the address of previous node and second part contains data and third part contains address of next node. The first and third part is
Single Linked List 2007-12-06 02:41:00 Single linked list: - Single Linked list is a linear data structure. It is used as a fundamental data structure in computer programming. It contains a collection of nodes which are connected by only one pointer in one direction. Each node is having two parts the first part contains the data and second part contains the address of the next node. The first part is called data field or
Linked Lists 2007-12-06 02:38:00 Linked list: - Linked list is a linear data structure that works on a principle Random in Random out (RIRO). Linked list can be defined as Collection of logically adjacent nodes in which logical adjacency is maintained by pointers. Ex: The days of the week (Sun, Mon, Tue, Wed, Thu, Fri, Sat) Linked lists can be represented in memory by two ways they are <!--[if !supportLists
Circular Queue Data Structure 2007-12-06 02:30:00 Circular queue :- In a standard queue data structure rebuffering problem occurs for each dequeue operation. To solve this problem by joining the front and rear ends of a queue to make the queue as a circular queue Circular queue is a linear data structure. It follows FIFO principle. In circular queue the last node is connected back to the first node to make a circle. Circular Read more:Structure
, Circular
, Queue
DeQueue Data Structure 2007-12-06 02:27:00 DeQueue (or) Deque (Double ended Queue) :- DeQueue is a data structure in which elements may be added to or deleted from the front or the rear. Like an ordinary queue, a double-ended queue is a data structure it supports the following operations: enq_front, enq_back, deq_front, deq_back, and empty. Dequeue can be behave like a queue by using only enq_front and deq_front , and behaves like a Read more:Structure
Priority Queue 2007-12-06 02:24:00 Priority queue :
Priority queue is a linear data structure. It is having a list of items in which each item has associated priority. It works on a principle add an element to the queue with an associated priority and remove the element from the queue that has the highest priority. In general different items may have different priorities. In this queue highest or the lowest priority item are Read more:Queue
Queue Data Structure 2007-12-06 01:46:00 Queue Data Structure
: Queue is a linear data structure it works on the principle First In First Out (FIFO). The first element insert into the queue is the first element to be deleteInsertion can be done at rear end using rear pointer and deletions can be done at front end using front pointerIt looks like open tube.The insertion operation is called append/ Read more:Queue
Applications of Stack Data Structure 2007-12-06 01:35:00 Application of stacks :- The linear data structure stack can be used in the following situations. <!--[if !supportLists]-->1. <!--[endif]-->It can be used to process function calls. <!--[if !supportLists]-->2. <!--[endif]-->Implementing recursive functions in high level languages <!--[if !supportLists]-->3. <!--[endif]-->Converting and e Read more:Stack
, Structure
, Applications
Classification of Data structures 2007-12-06 01:19:00 Data structures can be classified as
· Simple data structure
· Compound data structure
· Linear data structure
· Non linear data structure
Simple Data Structure:
Simple data structure can be constructed with the help of primitive data structure. A primitive data structure used to represent the standard data types of any one of the computer languages. Variables, arrays, pointers, structur Read more:Classification
Data Structure Definitions 2007-12-06 01:00:00 Data structure Definitions
: -
In computer science, a data structure is a way of storing data in a computer so that it can be used efficiently. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type. A well-designed data structure allows a variety of critical operations to Read more:Structure
Recommend Site To A Friend
