[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fMjMPEfhefvjrqc7KGXCTGfB_lh4lOiD9WCsyLybYI5s":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2025-06-09 20:18:32",197157663,[8,9,10,11],"Q=-23\u002F2q","Q=23\u002F2q","Q=-2q","Q=2q",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},54,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","work_44175578","作业4 - 栈","正方形的两对角线处各放置电荷Q,另两对角线各放置电荷q,若Q所受到合力为零,则Q与q的关系为:( )",[21,26,36,45,54,64,73,82,91,100],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":28,"id":29,"options":30,"question":35,"source":24,"type":25},[],"2025-06-09 20:18:33",197157667,[31,32,33,34],"&sigma;\u002F&epsilon;0","&sigma;\u002F2&epsilon;0","&sigma;\u002F4&epsilon;0","&sigma;\u002F8&epsilon;0","一半径为R的导体球表面的面点荷密度为&sigma;,则在距球面R处的电场强度( )",{"answer":37,"createTime":28,"id":38,"options":39,"question":44,"source":24,"type":25},[],197157671,[40,41,42,43],"若高斯面上的电场强度处处为零,则该面内必定没有净电荷","若高斯面内没有电荷,则该面上的电场强度必定处处为零","若高斯面上的电场强度处处不为零,则该面内必定有电荷","若高斯面内有电荷,则该面上的电场强度必定处处不为零","下面说法正确的是:( )",{"answer":46,"createTime":28,"id":47,"options":48,"question":53,"source":24,"type":25},[],197157676,[49,50,51,52],"电场和电势均为零","电场不为零,电势均为零","电势和表面电势相等","电势低于表面电势","在电场中的导体内部的( )",{"answer":55,"createTime":56,"id":57,"options":58,"question":63,"source":24,"type":25},[],"2025-06-13 12:41:09",199811053,[59,60,61,62],"队列","循环队列","栈","循环栈","插入和删除只能在一端进行的线性表,称为",{"answer":65,"createTime":56,"id":66,"options":67,"question":72,"source":24,"type":25},[],199811055,[68,69,70,71],"必须判别栈是否满","必须判别栈是否空","必须判别栈元素类型","队栈可不做任何判别","如果以链表作为栈的存储结构,则出栈操作时",{"answer":74,"createTime":56,"id":75,"options":76,"question":81,"source":24,"type":25},[],199811058,[77,78,79,80],"先进先出","后进先出","栈空则进","栈满则出","栈中元素的进出原则是",{"answer":83,"createTime":56,"id":84,"options":85,"question":90,"source":24,"type":25},[],199811062,[86,87,88,89],"插入操作更加方便","通常不会出现栈满的情况","不会出现栈空的情况","删除操作根加方便","链栈与顺序栈相比,有一个比较明显的优点是",{"answer":92,"createTime":56,"id":93,"options":94,"question":99,"source":24,"type":25},[],199811064,[95,96,97,98],"链表","数组","循环链表","变量","顺序栈存储空间的实现使用以下哪种方式存储栈元素",{"answer":101,"createTime":56,"id":102,"options":103,"question":108,"source":24,"type":25},[],199811069,[104,105,106,107],"已固定","不固定","可以改变","动态变化","在C语言中,一个顺序栈一旦被声明,其占用空间的大小"]