CoursweorkProject

210CT

To open Task1. In github Go CourseworkProject and then Task1.ccp

Or Download and Open Task one From source Files.

Thank you for the opperatunity I learned a Lot, even thought Not being able to Implement a binary search and that, IT is not possible to implement Other tasks if you are stuck on task 1. Task 6 can in fact be done as it is seperate from the other tasks.

Learning outcomes: Should have asked Tutors and Friends on how to implement a binary search tree from the Words that come from Sonnets into verses and then eventually to words.

Complete tasks within the project, Task one is written in Int Main, Under the name Task1.

Task 1

1. We are required to Open a text file from line 253 and end on line 2867 "

2. Take the data between the lines 253 and 2867 , and save it to a string. "

3. From the String we take the data of it, and Parase the words from Verses, while removing numbers from the text file. "

4. To the Final Point of view, Take the data and the words and make a Binary search tree.

Task 2

1. Use task 1s Binary tree and make it user, usable.

Task 3

1. let the User Remove words from the Binary tree cant be Done without 1 and 2 Task 4

Needs task 2. Task 5

Looks to see if the Graph is Strongly Connected In task 5 Task 6

Dijkstra’s algorithm That accepts two words.