Follow

Translate

Tuesday, March 8, 2016

Home » » Queue

Queue

Unknown  11:00:00 AM    No comments
What is Queue?
Queue: A queue, also called a first-in first-out(FIFO) system, is a linear list in which deletions can take place only at one end of the list, the "front" of the list, and insertions can take place only at the other end of the list, the "rear" of the list.
If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE

Related Posts:

  • FINDA(INFO, LINK, START, ITEM, LOC) FINDA(INFO, LINK, START, ITEM, LOC) This procedure finds the location LOC of the last node in a sorted list such that INFO[LOC] < ITEM, or sets LOC = NULL. 1.  [List of empty?]   If START = NULL, then … Read More
  • INSERT(INFO, LINK, START, AVAIL, ITEM) Algorithm: INSERT(INFO, LINK, START, AVAIL, ITEM) This algorithm inserts ITEM into a sorted linked list. 1.   [Use Procedure FINDA to find location of the node preceding ITEM]   Call FINDA(INFO, LINK, … Read More
  • Insertion Algorithms Insertion Algorithms: (a)  Checking to see if space is available in the AVAIL list.  If not, that is, if AVAIL = NULL, then the algorithm will print the message OVERFLOW. (b)  Removing the first node fr… Read More
  • Deletion Algorithms Deletion Algorithms: Algorithms which delete nodes from linked lists come up in various situations. We discuss two of them here. The first one deletes the node following a given node, and the second one deletes the node wi… Read More
  • COPY(INFO, LINK, NAME1, NAME2, AVAIL) COPY(INFO, LINK, NAME1, NAME2, AVAIL) This algorithm makes a copy of a list NAME1 using NAME2 as the list pointer variable of the new list. 1.     Set NAME2 : = NULL.   [Forms empty  … Read More

0 comments:

Post a Comment