Hello Friends today I am Posting About What is the Practical use of Datastructure in Computers?
3..Tree - Directory traversal
7.LinkedList
Here are some DataStructure and their Uses
1.Stack -
Undo/Redo Operation in Word Processor,Expression Evalution,Syntax Parsing,Many Virtual Machine like JVM are Stack Oriented.
2.Queue -
Process Scheduling normally uses a queue (how processes or threads are accessed after the initial work varies though)
Process Scheduling normally uses a queue (how processes or threads are accessed after the initial work varies though)
3..Tree - Directory traversal
4.Binary search tree - searching quickly for a given element
5.Graph-
Connection/Relation in Social Networking Site,Routing,Network of Communication,Data Organization etc.
Connection/Relation in Social Networking Site,Routing,Network of Communication,Data Organization etc.
6.Hash map -
Searching for certain blocks of memory (i.e. when using many pointers) Hashing occurs when you have, say, an address book on your computer. It might use a hash map so that when you enter John Smith, his phone number and other information are available. This is because there is a hashing function that points to a certain location in memory when "John Smith" is entered. It would be a headache entering a memory address every time you wanted to access some simple information.
Searching for certain blocks of memory (i.e. when using many pointers) Hashing occurs when you have, say, an address book on your computer. It might use a hash map so that when you enter John Smith, his phone number and other information are available. This is because there is a hashing function that points to a certain location in memory when "John Smith" is entered. It would be a headache entering a memory address every time you wanted to access some simple information.
7.LinkedList
1. We can use linked list as a stack by adding and removing elements from the beginning of the list.
2. Same goes for the queue. Adding in the beginning, removing from the end( can be tricky? No, we maintain a pointer to the last element of the queue or dequeue).
3. In hash table , each bucket of the table can itself be a linked list(chaining).
2. Same goes for the queue. Adding in the beginning, removing from the end( can be tricky? No, we maintain a pointer to the last element of the queue or dequeue).
3. In hash table , each bucket of the table can itself be a linked list(chaining).
8.Queues-
Transport and Operation Research where various entities are stored and held to be processed later ie,the queue Performs the function of a buffer.
Transport and Operation Research where various entities are stored and held to be processed later ie,the queue Performs the function of a buffer.
9. Priority Queues-Process Scheduling in kernal.
10.Radix Tree-IP Routing Table
11.BSP Tree- 3D Computer Graphics.
12.Heap- Dynamic Memory Allocation in LISP
10.Radix Tree-IP Routing Table
11.BSP Tree- 3D Computer Graphics.
12.Heap- Dynamic Memory Allocation in LISP
0 comments:
Post a Comment
Enter Here Your Ideas and Comment to improve this Blog