Algorithms and Data Structures

TEXT ANALYSIS TOOL REPORTby (Name) Course Professor University City and state Date Text Analysis Tool Report Introduction This report aims to provide information on the necessary development of a Text Analysis Tool in a C# console application as part of the Algorithms & Data Structures unit. The program processes the text file named "mobydick.txt" and includes several operations like word list, frequency of a word, and a sorted list. The working core of the application is a Dictionary data structure that best fits the given requirements in terms of effectiveness and versatility. Here, the different options for the data structure are compared, the stages of development are described, the efficiency of the used algorithms is discussed, and, finally, some thoughts about development are summed up. Comparison of Data Structures This is the case because the choice of the data structure is inversely proportional to the performance and scalability of an application. This project analyzed four data structures: Static Array, Dictionary, Linked List, and Binary Search Tree (BST). All were evaluated based on their feasibility in storing the word data to facilitate easy retrieval of such information. Static Array Static arrays offer efficient access using indexes and are helpful for direct search operations, which is O(1). They are limited in size and cannot be easily modified when working with fluctuating data sets. Search or insert operations take O(n) time in an unsorted array, which makes it unimaginable to work with large-sized text files such as log files (Cormen et al., 2009). As learned in class and through creating the arrays in the text, static arrays were not sufficient for this endeavor. Dictionary The Dictionary<TKey, TValue> in C# is a hash table-based collection of items that can support average case complexity on the time complexity of the constant time complexity of the algorithm of O(1) for search and insert operations (Microsoft, 2023). This structure was appropriate for storing words and keeping a record of the word frequency and the frequency within a line. This was so even if sorting requires additional O(n log n); overall, the efficiency and ease of handling made the dictionary typical. Microsoft's documentation and practical activities in Week 9 corroborated the choice. LinkedList LinkedList also provides dynamic memory allocation, and insertion/removal operations are possible at either end of a list. However, they are inefficient for search and random access because of their non-indexing feature (GeeksforGeeks, 2023). In week five's labs, implementing a search of data in the linked list took O(n) time, which makes it undesirable to analyze large datasets on a repetitive basis. Binary Search Tree (BST) BSTs could keep elements sorted, making search and insertion operations in the average case of O(log n). However, the Operation of unbalanced trees is O(n), while using self-balanced variants such as AVL trees increases the algorithm complexity (Cormen et al., 2009). Although we tried during Week 7 to implement BSTs, they did not fit the required functionalities. Conclusion Out of all the evaluated structures, the solution offered by the dictionary can be considered the most useful. The quick access, elasti...