Follow

Translate

Tuesday, March 8, 2016

Home » » Stack Lesson One

Stack Lesson One

Unknown  10:50:00 AM    No comments
What is mean Stack?

Stack: A Stack, also called a last-in-first-out(LIFO) system, is a linear list in which insertions and deletions can take place only at one end, called the top
If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE

Related Posts:

  • 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
  • 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
  • DELLOCHL(INFO, LINK, START, AVAIL, ITEM) DELLOCHL(INFO, LINK, START, AVAIL,  ITEM) 1.  [Use Procedure FINDBHL to find the location of N and its preceding node.]   Call LINDBHL(INFO, LINK, START, ITEM, LOC, LOCP). 2.  If LOC = NULL, the… Read More
  • FINDBHL(INFO, LINK, START, ITEM, LOC, LOCP) Procedure: FINDBHL(INFO, LINK, START, ITEM, LOC, LOCP) 1.  Set SAVE : = START and PTR : = LINK[START].  [Initializes pointer]. 2. Repeat while INFO[PTR] != ITEM and PTR != START.    Set SAVE : = P… 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

0 comments:

Post a Comment