>>54901137
1. Make a doubly linked list.

2. Use the doubly linked list to make a chained hash table

3. Use the LinkedList and HashTable to make a file system crawler, indexer, and search engine. (build a module that reads the content of a file into memory, parses it into a series of words, and builds a linked list of (word, position) information. Build modules that convert a series of these linked lists into an in-memory, inverted index. Use this in-memory, inverted index to build a query processor that has a console-based interface.)

4. Write code that takes an in-memory inverted index produced by (3) and writes it out to disk in an architecture-neutral format. Write C code that walks through an on-disk index to service a lookup. Write a query processor that serves queries from multiple on-disk indices.

5. Implement a multithreaded Web server front-end to your query processor.

solve women.

>>54901137
https://projecteuler.net/

>>54901207
>you'll never be smart enough to do step 3+

>>54901344
Do you need some elaboration on where to begin?

I'm sure you could do it if you a) complete steps 1 and 2 and b) Took a few moments googling the terms I used and c) planned out the data structures you need and how they interact and d) worked on it for a few days.

Try creating a fictional company database using structures and pointers