[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f9Q9wXGax2GgcWZwCpNJawANRiJS4Mqo6KzxfK28nEtA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2026-01-08 15:20:51",224161401,[8,9,10,11],"选择结构","层次结构","顺序结构","循环结构",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},31,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","4697dd3ecc8d4af3b2a0ccc22b860098","章节测试","任何复杂算法都可以用三种基本结构组成,下列不属于基本结构的是( )",[21,33,42,51,60,63,72,81,91,101],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2026-01-07 20:33:52",224161397,[26,27,28,29],"算法必须在1秒内结束,否则就不满足有穷性","算法代码行数必须有限,但运行步数可以无限","算法必须在执行有限步骤后终止并给出结果","只要算法最终能停机,中间出现无限循环也无妨","下列关于算法"有穷性"的说法中,正确的是( )","v1",0,{"answer":34,"createTime":5,"id":35,"options":36,"question":41,"source":31,"type":32},[],224161398,[37,38,39,40],"矩形框","椭圆形框","圆形框","菱形框","流程图中表示判断的是( )",{"answer":43,"createTime":5,"id":44,"options":45,"question":50,"source":31,"type":32},[],224161399,[46,47,48,49],"圆圈","菱形","矩形","平行四边形",""如果下雨在体育馆上体育课,不下雨则在操场上体育课".用流程图来描述这一问题时,判断"是否下雨"的流程图符号是( )",{"answer":52,"createTime":5,"id":53,"options":54,"question":59,"source":31,"type":32},[],224161400,[55,56,57,58],"树型模式","循环模式","选择模式","顺序模式","有一个程序段,其功能是画一个圆,在编程时,如果用该程序段画100个圆,则适合采用的算法结构是( )",{"answer":61,"createTime":5,"id":6,"options":62,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":64,"createTime":5,"id":65,"options":66,"question":71,"source":31,"type":32},[],224161402,[67,68,69,70],"在流程图结束的时候,必须从基本符号区中选择并插入"End"",""Main"的初始状态只有Start和End","在开始画流程图的时候,必须从基本符号区中选择并插入"Start"","基本符号区中的符号有8个","下列关于RAPTOR基本程序环境的描述,正确的是( )",{"answer":73,"createTime":5,"id":74,"options":75,"question":80,"source":31,"type":32},[],224161403,[76,77,78,79],"RAPTOR定义了四个常量:pi、e、yes、no","RAPTOR数据类型有数值和字符串","RAPTOR系统可以使用汉字字符","不同类型的数据不可比较","下列关于RAPTOR的说法中,不正确的是( )",{"answer":82,"createTime":83,"id":84,"options":85,"question":90,"source":31,"type":32},[],"2025-11-20 15:08:55",224161404,[86,87,88,89],"递归算法","解析算法","枚举算法","排序算法","只能被1或本身整除的大于1的自然数称为素数.判断大于1的某自然数m是不是素数的算法基本思想是:把m作为被除数,将2到m-1中的自然数作为除数,逐一进行相除,如果都除不尽,m就是素数,否则m就不是素数.这种判定素数的算法主要属于( )",{"answer":92,"createTime":93,"id":94,"options":95,"question":100,"source":31,"type":32},[],"2026-01-08 15:13:35",224161405,[96,97,98,99],"有穷性","唯一性","有0个或多个输入","有输出","用计算机无法解决"打印所有素数"的问题,其原因是解决该问题的算法违背了算法特征中的( )",{"answer":102,"createTime":5,"id":103,"options":104,"question":109,"source":31,"type":32},[],224161406,[105,106,107,108],"一个算法的执行步骤可以是无限的","算法只能用流程图表示","一个完整的算法必须有输入","一个完整的算法至少有一个输出","下列关于算法的描述,正确的是( )"]