AT-CS12 · Data structures
Text Auto-Complete Using Trie
Suggests words as you type, using a trie built from a dictionary.
- Suits
- Sem 3–4
- Branches
- CSE, ISE, AIML
- Type
- Software
How it works
A dictionary of words is loaded into a trie, a tree in which each level holds one letter and words with the same beginning share the same branch. As you type, the program walks down the branch for the letters typed so far and collects the words below it, most used first. New words can be added to the trie at any time.
What it does
- Fast prefix search
- Ranked suggestions
- Add new words
Built with
Python or C++
What you get
- Working software with full source code
- Steps to install and run it on your laptop
- Rough report and explanation of the working
- Live demo on video call before the final payment
Good to know
- Features are as listed here. Anything extra is quoted separately.
- Runs on a normal laptop unless we tell you otherwise.
- Full reports and PPTs are not included.
Similar projects
- AT-CS10Sudoku Solver Using BacktrackingEnter any Sudoku and watch it being solved step by step.
- AT-CS11Shortest Path Finder (Dijkstra)Pick two points on a map and see the shortest route found by Dijkstra's algorithm.
- AT-CS13File Compression Tool (Huffman Coding)Compresses and restores text files and shows the space saved.
- AT-CS01Student Attendance Management SystemTeachers mark attendance online and students see their percentage subject by subject.