FACTOID # 29: 73.3% of America's gross operating surplus in motion picture and sound recording industries comes from California.
 
 Home   Encyclopedia   Statistics   States A-Z   Flags   Maps   FAQ   About 
   
 
WHAT'S NEW
RELATED ARTICLES
People who viewed "Deque" also viewed:
 

SEARCH ALL

FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > Deque

In computer science, a deque (short for double-ended queue) is a data structure for which elements can be added to or removed from the front or back. This differs from a normal queue, where elements can only be added to one end and removed from the other. A deque maintains a slightly modified FIFO structure, doing so using each end as both left and right. A common implemenation of a deque uses a doubly linked list. Computer science is the study of the theoretical foundations of information and computation and their implementation and application in computer systems. ... In providing services to people, and in computer science, transport and operations research a queue is a First-In-First-Out (FIFO) process â€” the first element in the queue will be the first one out. ... A binary tree, a simple type of branching linked data structure. ... In providing services to people, and in computer science, transport and operations research a queue is a First-In-First-Out (FIFO) process â€” the first element in the queue will be the first one out. ... FIFO is an acronym for First In, First Out. ... In computer science, a linked list is one of the fundamental data structures used in computer programming. ...


Deque is usually pronounced deck, possibly due to the conceptual similarity to a deck of cards, where a card can be dealt from or returned to either the face or patterned side.


Operations

The following operations are possible on a deque:

  • push_back
  • push_front
  • pop_back
  • pop_front
  • peek_back
  • peek_front

Complexity

  • In a doubly-linked list implementation, the Time complexity of all operations is O(1).
  • In an growing array, the amortized complexity of all operations is O(1).
In computer science, computational complexity theory is the branch of the theory of computation that studies the resources, or cost, of the computation required to solve a given problem. ... It has been suggested that Landau notation be merged into this article or section. ... In computational complexity theory, amortized analysis is the time per operation averaged over a worst_case sequence of operations. ...

  Results from FactBites:
 
Deque (598 words)
Deque allows elements to be inserted/removed from arbitrary points in a sequence more efficiently than a vector can, although not in constant time.
Random access to elements contained in a deque is slightly less efficient when compared to a vector due to an additional level of indirection.
This is because a deque will allocate a new block of memory when the memory buffer is exausted and begin using it to store the new elements.
Deque (Java Platform SE 6) (2237 words)
When a deque is used as a stack, elements are pushed and popped from the beginning of the deque.
method works equally well when a deque is used as a queue or a stack; in either case, elements are drawn from the beginning of the deque.
Retrieves and removes the head of the queue represented by this deque (in other words, the first element of this deque).
  More results at FactBites »

 
 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments

Want to know more?
Search encyclopedia, statistics and forums:

 


Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m