华东师范大学期中试卷2025—２ 008 学年第二学期课程名称:_ ＿ ____ 数据结构 _____ 姓 名:__＿___＿_____＿___＿__ 学 号:＿＿____＿______＿_＿__专 业:＿_______＿_____＿__＿＿ 年级/班级:＿___＿__＿_＿__＿＿＿＿_＿课程性质:专业必修一二三四五六七八总分阅卷人签名一、单项选择题(共１ 8 分,每题 3 分)１、 Stack ｈ a ｓ the propert ｙ called las ｔ i ｎ ａ nd first out, then whi ｃｈ of the following describ ｅ s ｔ he ｐｒｏｐ er ｔｙ of Q ｕ eue？a） L ａ st in ａｎｄ first ou ｔb) Ｆ i ｒ s ｔ i ｎ and ｌａ st ｏ utc） F ｉ rst ｉｎ a ｎ d first out2、 A li ｓｔ of it ｅ m ｓ ｆ r ｏｍ whi ｃ h on ｌ y ｔｈ e ｉ t ｅｍ mos ｔ rｅ cently ad ｄｅ d c ａ n be rem ｏｖ ed ｉｓ k ｎｏ wn as a ( )a) s ｔａｃ k ｂ） qu ｅｕ e c) ｃ i ｒ c ｕ lar linked l ｉ s ｔ ｄ) list３、 If tｈe followiｎg funｃtｉon is cａlled wｉth ａ vａluｅ of 2 fｏr n, what ｉs the rｅsultinｇ ｏuｔｐut?ﻩﻩ vｏｉd Ｑuiz（ int n )ﻩ { if (n > 0）ﻩﻩ {ﻩ cout << ０;ﻩ Quiｚ(n - 1);ﻩﻩ coｕｔ << 1;ﻩ Ｑuｉz（ｎ - １)；ﻩ }ﻩ }ａ)0001１０11 b）ﻩ11100100 c）1001110０ d)ﻩ1001０１０１ e)ﻩ00101１4、 A ｈ ea ｐ ｉ s a list in w ｈ ic ｈ each en ｔｒ y co ｎ tain ｓ ａ key， ａnd, ｆｏ r all ｐ osit ｉ o ｎ s i in the lis ｔ, ｔ h ｅ ｋ e ｙ at po ｓ it ｉ o ｎ i is at lease as la ｒ ge as ｔ he ｋ ey ｓ in ｐｏｓｉ t ｉ ons 2i+2 a ｎｄ ( ), pro ｖided these posi ｔ i ｏｎ s exis ｔ in ｔｈ e l ｉ s ｔ、ａ) ２ ib) ２ i-1c) ２ i-2d） ２ i+１5、 Givｅn ｔhe reｃuｒsiｖe functionﻩﻩ ｉnt Ｆunｃ( /* iｎ */ int ｉ,ﻩﻩ ／* in */ inｔ j )ﻩ ｛ ｉf (ｉ < 11)ﻩﻩ if （j < 1１)ﻩﻩ return i ＋ j; elｓeﻩﻩ return ｊ + Fｕnc(i， ｊ - ２);ﻩﻩ elｓｅ retuｒn ｉ ＋ Func（i - １, ｊ）;ﻩﻩ ...
