Applications of data structures
Download as PPTX, PDF6 likes30,473 views
This document discusses various applications of common data structures like linked lists, stacks, queues, and trees. It provides examples of how linked lists are used to implement queues and stacks, and in web browsers to store browsing history. It also gives examples of how stacks can be used for reversing words, undo/redo functions, matching parentheses in compilers, and modeling real-world examples like plates in a cupboard. Applications of queues include asynchronous data transfer and resource sharing. Trees are used in operating systems to represent folder structures, in HTML for the document object model, for network routing, syntax trees in compilers, and modeling game moves in AI.
Applications of data structures
- 1. Applications of Data Structures Ram
- 2. Agenda • Applications of Linked List • Applications of Stacks • Applications of Queue • Applications of Deque • Applications of Trees
- 4. Linked List • The linked list is fundamental, and as the simplest persistent, recursive data structure, is used everywhere. • Linked list are usually a basic dynamic data structure which implements queues and stacks • In web-browsers, where it creates a linked list of web-pages visited, so that when you check history (traversal of a list) or press back button, the previous node's data is fetched.
- 6. Stack • To reverse a word. You push a given word to stack - letter by letter - and then pop letters from the stack. • An "undo" mechanism in text editors; this operation is accomplished by keeping all text changes in a stack. - Undo/Redo stacks in Excel or Word. • Language processing : -compiler's syntax check for matching braces is implemented by using stack. • A stack of plates/books in a cupboard. • A garage that is only one car wide. To remove the first car in we have to take out all the other cars in after it. • Wearing/Removing Bangles. • Back/Forward stacks on browsers. • Support for recursion -Activation records of method calls.
- 10. Programming Applciations • When a resource is shared among multiple consumers. Examples include CPU scheduling, Disk Scheduling. • When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes. Examples include IO Buffers, pipes, file IO, etc.
- 12. Deque • Palindrome check • Steal Job Scheduling Algorithm – -The steal algorithm implements task scheduling for several process(Multiprocess scheduling) – -Each Processor has a deque linked to it – -If the process completes the execution of its own queue,it pulls the thread from the rear end of other processor and executes it. • Undo-Redo Operations in software applications
- 14. Folders in Operating System in windows go to command line and type tree. You can see the folder tree structure.
- 15. Linux File System is also a Tree
- 16. HTML Document All html text, attributes are stored in tree called Document Object Model (DOM).
- 17. Network Routing
- 18. Syntax Tree in Compiler In compiler , every expression is converted into syntax tree format.
- 19. Auto Corrector and Spell Checker
- 20. Next Move in Games In Artificial intelligence game (opponent is cpu) , next moves are stored using tree data structure.