International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 183 - Number 52 |
Year of Publication: 2022 |
Authors: Kuldeep Vayadande, Ram Mandhana, Kaustubh Paralkar, Dhananjay Pawal, Siddhant Deshpande, Vishal Sonkusale |
10.5120/ijca2022921936 |
Kuldeep Vayadande, Ram Mandhana, Kaustubh Paralkar, Dhananjay Pawal, Siddhant Deshpande, Vishal Sonkusale . Pattern Matching in File System. International Journal of Computer Applications. 183, 52 ( Feb 2022), 18-22. DOI=10.5120/ijca2022921936
String matching algorithms have had a significant impact on computer science and are used to solve a variety of real-world challenges. It aids in the completion of time-saving tasks in a variety of fields. These techniques can be handy when looking for a string within another string. Database schema and network systems both employ string matching. We have designed and used several pattern matching algorithms like Naive, KMP(Knuth Morris Pratt) and Automation Matcher algorithm to find patterns in the file system. The proposed system goes through three main steps; Take the names of the files present in the current directory; Take the pattern to search and type of algorithm from the user; And display the pattern if found in the directory. The program is able to accurately detect the patterns in the file system using the mentioned algorithms successfully.