{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu","formal_name":"MMLU","introduction":"MMLU asks four-way multiple-choice questions across 57 subjects, from elementary material to professional-level examinations. Since 2020 it has been the most widely cited single reference point for general capability.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/hendrycks/test","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"af392037-87b7-5767-8fb6-8903b142b3f7","task_key":"all--test--af392037-87b7-5767-8fb6-8903b142b3f7","task_revision_id":"1","upstream_id":"","short_description":"In a height-balanced binary search tree, the heights of the left and right…","config":"all","split":"test","body":"{\"choices\":\"['I and III only', 'II and III only', 'II and IV only', 'I, II, and IV']\",\"question\":\"In a height-balanced binary search tree, the heights of the left and right descendents of any node differ by at most 1. Which of the following are true of such a tree?\\nI. Worst-case search time is logarithmic in the number of nodes.\\nII. Average-case search time is logarithmic in the number of nodes.\\nIII. Best-case search time is proportional to the height of the tree.\\nIV. The height of the tree is logarithmic in the number of nodes.\",\"subject\":\"college_computer_science\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/test","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}