pta第三章棧和隊(duì)列練習(xí)題-資料下載頁(yè)
2025-08-04 22:55本頁(yè)面
【正文】 oppings are allowed. Then among the following, the impossible popping sequence is: (2分)1. b c a e f d2. c b d a e f3. d c e b f a4. a f e d c b作者: DS課程組單位: 浙江大學(xué)225Given an empty stack S and an empty queue Q. Push elements {1, 2, 3, 4, 5, 6, 7} one by one onto S. If each element that is popped from S is enqueued onto Q immediately, and if the dequeue sequence is {4, 5, 7, 6, 3, 2, 1}, then the minimum size of S must be: (2分)1. 22. 33. 44. 5作者: Martin Ester單位: 浙江大學(xué)226Given the pushing sequence of a stack as {6, 5, 4, 3, 2, 1}. Among the following, the impossible popping sequence is: (2分)1. 2 3 4 1 5 62. 3 4 6 5 2 13. 5 4 3 6 1 24. 4 5 3 1 2 6作者: DS課程組單位: 浙江大學(xué)227下列關(guān)于棧的敘述中，錯(cuò)誤的是：(2分)1. 采用非遞歸方式重寫(xiě)遞歸程序時(shí)必須使用棧2. 函數(shù)調(diào)用時(shí)，系統(tǒng)要用棧保存必要的信息3. 只要確定了入棧次序，即可確定出棧次序4. 棧是一種受限的線性表，允許在其兩端進(jìn)行操作1. 僅 12. 僅 33. 僅 44. 僅 4201712190218 李文超 F() F() T() T() F() T() C() D() A() D() D() B() D() A() B() C() C() B() A() A() A() C() B() B() B() B() C() A() C D() D() B() C
外語(yǔ)相關(guān)推薦
鄂ICP備17016276號(hào)-1