• kth.se
  • Student web
  • Intranet
  • kth.se
  • Student web
  • Intranet
Login
ID1021 HT22 (50321)
A "heap" or priority queue
Skip to content
Dashboard
  • Login
  • Dashboard
  • Calendar
  • Inbox
  • History
  • Help
Close
  • Min översikt
  • ID1021 HT22 (50321)
  • Assignments
  • A "heap" or priority queue
  • Home
  • Syllabus
  • Assignments
  • Course Evaluation

A "heap" or priority queue

  • Due 14 Oct 2022 by 18:00
  • Points 2
  • Submitting a file upload
  • File types pdf
  • Available 6 Oct 2022 at 8:00 - 17 Oct 2022 at 8:59
This assignment was locked 17 Oct 2022 at 8:59.

A "heap"  is a very nice structure to use when implementing a priority queue.

  • heap.pdf
1665763200 10/14/2022 06:00pm
Please include a description
Additional comments:
Rating max score to > Pts
Please include a rating title

Rubric

Find rubric
Please include a title
Find a rubric
Title
You've already rated students with this rubric. Any major changes could affect their assessment results.
 
 
 
 
 
 
 
     
Can't change a rubric once you've started using it.  
Title
Criteria Ratings Pts
This criterion is linked to a learning outcome Description of criterion
threshold: 5 pts
Edit criterion description Delete criterion row
5 to >0 Pts Full marks blank
0 to >0 Pts No marks blank_2
This area will be used by the assessor to leave comments related to this criterion.
pts
  / 5 pts
--
Additional comments
This criterion is linked to a learning outcome Description of criterion
threshold: 5 pts
Edit criterion description Delete criterion row
5 to >0 Pts Full marks blank
0 to >0 Pts No marks blank_2
This area will be used by the assessor to leave comments related to this criterion.
pts
  / 5 pts
--
Additional comments
Total points: 5 out of 5