https://github.com/sanchariii/ip-address
The main objective of this project is to make an algorithm that can search through data as fast as possible. This project is an implementation of data structures.
https://github.com/sanchariii/ip-address
c-programming data-structures tree-structure
Last synced: 7 months ago
JSON representation
The main objective of this project is to make an algorithm that can search through data as fast as possible. This project is an implementation of data structures.
- Host: GitHub
- URL: https://github.com/sanchariii/ip-address
- Owner: Sanchariii
- Created: 2022-11-25T05:56:06.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-11-25T05:57:10.000Z (over 3 years ago)
- Last Synced: 2025-03-01T20:47:31.453Z (about 1 year ago)
- Topics: c-programming, data-structures, tree-structure
- Language: C
- Homepage:
- Size: 244 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# IP-Address-Finder
With the help of splay tree data structure, we would create a tree whose nodes are
embedded with the Ip address of the device that are connect to a specific network router. In our
code we have taken 11 devices connected to one network router and so there would be some
common part in the Ip address of each of the devices. Now, router gets some specific data
packets from the net which is supposed to be given to a specified device and so it uses searching
operation to find the correct Ip address. To increase the speed of this process we use splay tress
for searching and inserting the Ip addresses. It is the fastest data structure for searching
operation. Therefore, the router sends the data packet to the specified Ip address when multiple
devices are connected. Here we have used the random function to input the data packets so that
there is no input function required and the processes is completely automatic as it takes place in
network router.