1 / 17

C Programming: From Problem Analysis to Program Design, Third Edition

Objectives. In this chapter you will:Learn about stacksExamine various stack operationsLearn how to implement a stack as an arrayLearn how to implement a stack as a linked listDiscover stack applicationsLearn how to use a stack to remove recursion. Objectives. Learn about queuesExamine variou

cai
Télécharger la présentation

C Programming: From Problem Analysis to Program Design, Third Edition

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    1. C++ Programming: From Problem Analysis to Program Design, Third Edition Chapter 19: Stacks and Queues

    2. Objectives In this chapter you will: Learn about stacks Examine various stack operations Learn how to implement a stack as an array Learn how to implement a stack as a linked list Discover stack applications Learn how to use a stack to remove recursion

    3. Objectives Learn about queues Examine various queue operations Learn how to implement a queue as an array Learn how to implement a queue as a linked list Discover queue applications

    4. Stacks Stack: list of homogenous elements Addition and deletion occurs only at one end, called the top of the stack In a cafeteria, the second tray can be removed only if first tray has been removed Last in first out (LIFO) data structure

More Related