Where have you seen Data structures in real-time applications?

Ankitraaz
2 min readJul 7, 2022

๐’๐ญ๐š๐œ๐ค:

1) UNDO option
2) Text editor: you push letter by letter to the stack so you erase back.
3) Recursion(inbuilt stack)

๐๐ฎ๐ž๐ฎ๐ž:
1) Your browser deletes the history past one month.
2) If you delete a picture on your phone, it will be the โ€œrecently deleteโ€ folder which says โ€œthe images will be deleted permanently after one weekโ€.
Here all the images are stored in the queue so itโ€™s easier to pop from the rear based on the image deletion date.
3) Waiting list: during online registrations, sometimes youโ€™ll be put on the waiting list. basically, all the requests will be stored in the queue.

๐‹๐ข๐ง๐ค๐ž๐ ๐ฅ๐ข๐ฌ๐ญ:
1) Browserโ€™s Next and Previous Button: a linked list of URLs
2) music player where you can play the next or previous song. (Doubly linked list).
3) In the ludo game, It has to pass the chance to each player in a circular fashion (circular linked list).

๐“๐ซ๐ž๐ž๐ฌ:
1) File system: Folders and subfolders (N-ary tree).
2) e-commerce websites : category -> subcategories -> products
3) Auto-suggestion when you google (Trie)

๐†๐ซ๐š๐ฉ๐ก๐ฌ:
1) Uber, Ola cab booking: show nearest available cars (BFS)
2) Maven dependencies build order ( Topological sorting (DFS))
3) While booking bus/flights, you get a list of available routes.
4) In Facebook, users are considered to be the vertices and if they are friends then there is an edge running between them. Facebookโ€™s Friend suggestion algorithm uses graph theory. Facebook is an example of an undirected graph.

Please Like and Follow :)

--

--