QuestionTests.md 7.8 KB
Request
GetQuestionIdsIn:得到给定id序列的相关问题
requestMethod
GET
url
http://localhost:62201/api/question/search/findByIdIn?id={id}&page={page}&size={size}&sort={sort}
path
/api/question/search/findByIdIn?id={id}&page={page}&size={size}&sort={sort}
urlVariables
{"size":5,"id":[1001,1002],"page":1,"sort":"lastModified,DESC"}
reqBodyDemo
null
resBodyDemo
{"_embedded":{"questions":[{"id":"1002","type":"choice","stem":"假设某硬盘由 5 个盘片构成（共有 8 个记录面），盘面有效记录区域的外直径为 30cm, 内直径为 10cm,记录位密度为 250 位/mm,磁道密度为 16 道/mm,每磁道分 16 个扇区， 每扇区 512 字节，则该硬盘的格式化容量约为（ ） MB。","options":{"A":"","B":"","C":"","D":""},"answer":"B","key_points":"空","analysis":"本题考查计算机系统硬件方面磁盘容量的计算。硬盘容量分为非格式化容量和格式化容量两种，计算公式如下：非格式化容量=面数×(磁道数/面)×内圆周长×最大位密度格式化容量=面数×(磁道数/面)×(扇区数/道)×(字节数/扇区)题目中给出硬盘的面数为8，每面的磁道数为(30-10)×10÷2×16，每磁道扇区数为16，每扇区512字节，换算成MB单位时再除以1024*1024。","tags":null,"knowledgeId":null,"lastModified":"2020-02-28 21:33:06","tq_id":"1002","_links":{"self":{"href":"http://localhost:62201/api/question/1002"},"question":{"href":"http://localhost:62201/api/question/1002"}}},{"id":"1001","type":"choice","stem":"海明校验码是在 n 个数据位之外增设上个校验位,从而形成一个 k+n 位的新的码字， 使新的码字的码距比较均匀地拉大。n 与 k 的关系是( )。","options":{"A":"2^k-1 ＞= n + k","B":"2n-1 ＜= n + k","C":"n = k","D":"n-1 ＜= k"},"answer":"A","key_points":"空","analysis":"假设有k个校验位，一个位子有0或1两种情况，k个位子就有2^k种排列情况，能表示2^k种状态。其中一个状态用来表示正确（没有错误发生）的这种情况。其余的2^k-1种状态来表示错误发生在哪一位。总共有n+k位，所以2^k-1一定要\\>=总位子n+k。","tags":null,"knowledgeId":null,"lastModified":"2020-02-28 13:31:56","tq_id":"1001","_links":{"self":{"href":"http://localhost:62201/api/question/1001"},"question":{"href":"http://localhost:62201/api/question/1001"}}}]},"_links":{"self":{"href":"http://localhost:62201/api/question/search/findByIdIn?id=1001,1002&page=1&size=5&sort=lastModifiedTime,desc"}},"page":{"size":5,"totalElements":2,"totalPages":1,"number":1}}
Request
PostQuestion:新增问题，需要提供id
requestMethod
POST
url
http://localhost:62201/api/question
path
/api/question
urlVariables
{}
reqBodyDemo
{"type":"choice","stem":"一次测试","options":{"A":"2^k-1 ＞= n + k","B":"2n-1 ＜= n + k","C":"n = k","D":"n-1 ＜= k"},"answer":"A","key_points":"空","analysis":"这里是分析","tags":null,"knowledgeId":["CF.CQ"],"id":"uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest"}
resBodyDemo
{"id":"uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest","type":"choice","stem":"一次测试","options":{"A":"2^k-1 ＞= n + k","B":"2n-1 ＜= n + k","C":"n = k","D":"n-1 ＜= k"},"answer":"A","key_points":"空","analysis":"这里是分析","tags":null,"knowledgeId":["CF.CQ"],"lastModified":null,"tq_id":"uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest","_links":{"self":{"href":"http://localhost:62201/api/question/uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest"},"question":{"href":"http://localhost:62201/api/question/uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest"}}}
Request
PutQuestion:更改问题，需要提供id
requestMethod
PUT
url
http://localhost:62201/api/question/{id}
path
/api/question/{id}
urlVariables
{"id":"uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest"}
reqBodyDemo
{"type":"choice","stem":"一次测试","options":{"A":"2^k-1 ＞= n + k","B":"2n-1 ＜= n + k","C":"n = k","D":"n-1 ＜= k"},"answer":"A","key_points":"空","analysis":"这里新的分析","tags":null,"knowledgeId":["CF.CQ"],"id":"uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest"}
resBodyDemo
{"id":"uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest","type":"choice","stem":"一次测试","options":{"A":"2^k-1 ＞= n + k","B":"2n-1 ＜= n + k","C":"n = k","D":"n-1 ＜= k"},"answer":"A","key_points":"空","analysis":"这里新的分析","tags":null,"knowledgeId":["CF.CQ"],"lastModified":null,"tq_id":"uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest","_links":{"self":{"href":"http://localhost:62201/api/question/uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest"},"question":{"href":"http://localhost:62201/api/question/uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest"}}}
Request
GetQuestion:查询问题，需要提供id
requestMethod
GET
url
http://localhost:62201/api/question/{id}
path
/api/question/{id}
urlVariables
{"id":"9"}
reqBodyDemo
null
resBodyDemo
{"legal":true,"id":"9","type":"choice","stem":"这是一次测试","options":{"A":"2k-l ＞ n + k","B":"2n-l ＜= n + k","C":"n = k","D":"n-l ＜= k"},"answer":"B","key_points":"有考点","analysis":"无解析","tags":null,"knowledgeId":null,"lastModified":"2020-02-28 21:33:17","tq_id":"9"}
Request
DeleteQuestion:删除问题，需要提供id
requestMethod
DELETE
url
http://localhost:62201/api/question/{id}
path
/api/question/{id}
urlVariables
{"id":"uuidtestuuidtestuuidtestuuidtestuuidtestuuidtestuuidtest"}
reqBodyDemo
null
resBodyDemo
null
Request
findByStemLike:根据题干模糊问题，需要提供stem
requestMethod
GET
url
path
/api/question/search/findByStemLike?content={content}&page={page}&size={size}&sort={sort}
urlVariables
{"size":1,"page":1,"sort":"lastModified,DESC","content":"测试"}
reqBodyDemo
null
resBodyDemo
{"_embedded":{"questions":[{"id":"9","type":"choice","stem":"这是一次测试","options":{"A":"2k-l ＞ n + k","B":"2n-l ＜= n + k","C":"n = k","D":"n-l ＜= k"},"answer":"B","key_points":"有考点","analysis":"无解析","tags":null,"knowledgeId":null,"lastModified":"2020-02-28 21:33:17","tq_id":"9","_links":{"self":{"href":"http://localhost:62201/api/question/9"},"question":{"href":"http://localhost:62201/api/question/9"}}}]},"_links":{"first":{"href":"http://localhost:62201/api/question/search/findByStemLike?content=%E6%B5%8B%E8%AF%95&page=1&size=1&sort=lastModifiedTime,desc"},"self":{"href":"http://localhost:62201/api/question/search/findByStemLike?content=%E6%B5%8B%E8%AF%95&page=1&size=1&sort=lastModifiedTime,desc"},"next":{"href":"http://localhost:62201/api/question/search/findByStemLike?content=%E6%B5%8B%E8%AF%95&page=2&size=1&sort=lastModifiedTime,desc"},"last":{"href":"http://localhost:62201/api/question/search/findByStemLike?content=%E6%B5%8B%E8%AF%95&page=41&size=1&sort=lastModifiedTime,desc"}},"page":{"size":1,"totalElements":41,"totalPages":41,"number":1}}