C Dilinden Heap/ Priority Queue

Son Teslim Tarihi: 20 Ocak 2021 23:00
Bütçe: ~150 TL
Bilgisayar Yazılım
In this project, you are to use binomial heaps to implement a priority queue for the
task of ranking documents. In other words, you need to rank documents according to
given keyword with binomial heaps.
In the folder of files, there are 42 documents.
Steps:
a) Open the folder and read the files.
b) Ask the user for the keyword and pass it to your program as the keyword
parameter
c) Decide your heap structure whether you choose max-heap or min-heap.
d) Build a priority queue with the keyword.
e) By using your priority queue data structures in (d), extract the relevant 5
documents with the keyword.
f) Discuss your results in (e) and advantages using priority queue for such a
problem.
Proje bu şekilde bilgili arkadaşlar aday olsunlar lütfen

Bu Görev Yayında Değil

Yorumları görmek için giriş yapmalısın !