1-DAV-202 Data Management 2023/24
Previously 2-INF-185 Data Source Integration

Materials · Introduction · Rules · Contact
· Grades from marked homeworks are on the server in file /grades/userid.txt
· Dates of project submission and oral exams:
Early: submit project May 24 9:00am, oral exams May 27 1:00pm (limit 5 students).
Otherwise submit project June 11, 9:00am, oral exams June 18 and 21 (estimated 9:00am-1:00pm, schedule will be published before exam).
Sign up for one the exam days in AIS before June 11.
Remedial exams will take place in the last week of the exam period. Beware, there will not be much time to prepare a better project. Projects should be submitted as homeworks to /submit/project.
· Cloud homework is due on May 20 9:00am.


Difference between revisions of "HWcpp"

From MAD
Jump to navigation Jump to search
(Created page with "<!-- NOTEX --> See the lecture <!-- /NOTEX -->")
 
Line 2: Line 2:
 
See [[Lcpp|the lecture]]
 
See [[Lcpp|the lecture]]
 
<!-- /NOTEX -->
 
<!-- /NOTEX -->
 +
 +
You should implement all functionalities in two versions:
 +
 +
* Pure Python
 +
* Python interface with C++ implementation
 +
 +
===Task A===
 +
 +
You are given a list of documents. Each document consists of multiple words (words are lowercase) separated by space.
 +
You should design and implement an indexing data structure, that allows following two operations:
 +
 +
* Add a document to index (your index should assign it an unique ID)
 +
* Retrieve a document with given ID
 +
* Find all documents that contain the given word
 +
 +
TODO Python signature and implementation hints, example usage
 +
 +
===Task B===
 +
 +
Extend you index so that it support following query:
 +
* Given list of words (W1, W2, ...) find all documents, which contain all of the words (so each document has to contain all of the word from the query).
 +
 +
TODO Python signature and implementation hints, example usage

Revision as of 09:28, 12 April 2024

See the lecture

You should implement all functionalities in two versions:

  • Pure Python
  • Python interface with C++ implementation

Task A

You are given a list of documents. Each document consists of multiple words (words are lowercase) separated by space. You should design and implement an indexing data structure, that allows following two operations:

  • Add a document to index (your index should assign it an unique ID)
  • Retrieve a document with given ID
  • Find all documents that contain the given word

TODO Python signature and implementation hints, example usage

Task B

Extend you index so that it support following query:

  • Given list of words (W1, W2, ...) find all documents, which contain all of the words (so each document has to contain all of the word from the query).

TODO Python signature and implementation hints, example usage

Retrieved from "https://compbio.fmph.uniba.sk/vyuka/mad/index.php?title=HWcpp&oldid=2025"