L. Single Choice ( 10 questions. 2 points each. total 20 peints) (1) An array is a A. Lincar data structure B. Nos -linear data structure C. Complex data structure D. None of these (2) Which is the prefix expression for the following infix expression? A+B(C+D)F+D=E AAB+CD+FD+Ex B. ABCD+F/+DE+ C. ++1+CDBFADE D. A+BCDFDE++ (3) The data stracture used for recursion is A. Stack B. Qurve C. Troe D. None of the above (4) A binary tree T has n nodes of degree 2 . The number of leaf nodes in T is A. logen B. n1 C. n D. n+1 (5) Which of the following sorting algonithes has a bet cave runaing time of O(n2) ? A. Insertion sort B. Merge sert C. Quick sort D. Bubble sort (6) Which of the following sorting methods will be the most efficient if it is already in sorted order? A. Shell sont B. Selection sort C. Insertion sort D. Merget sort (7) The time complexity of Digkstra is . A. O(a) B. O(e+e) C. O(tr) D. O(n3) (8) Given an undirected connected graph with n vernex, the namber of edges in the miniman spanning tree is. A. n B. n-1 C. 2n D. 2n1 (9) Fof a siagle-linked list, remeve the suceessor of p, which operation is correct. A. p next-p next ncel B. p p p neat, p next p next neat; C. prip-ast: D. p'p - next-neat, (Dra Seracture? Fum (Ruge I af 4 ) (10) Which is the property of Qasue A. FIFO B. FILO C. Only insert and remove at the froet back D. No Common points 11. True or False. labeled as T/F (10 questions, 2 peints each. total 20 points) (1) The logical order is ahways the same as the sterags order for linear list. (2) Stack and Queve can store in sequential way, and abo in linked way. (3) After a binary tree threaded, every node should huve a thered which pointing to the predecesser or successor. (4) Given the proorder and inorder sequense, contracting a tree is possible. (5) For the complete binary trec, enly last level cannoe be full. (6) The shortest path is unique from the source to the sink: (7) Binsry search is slower than sequential scurch. (8) The push operation adds an element so the end of a itack. (9) Trees and graphs are the examples of nonlinear data structures. (10) Kruskal's algorithm is an cumple of a groody alporithm. L. Single Choice ( 10 questions. 2 points each. total 20 peints) (1) An array is a A. Lincar data structure B. Nos -linear data structure C. Complex data structure D. None of these (2) Which is the prefix expression for the following infix expression? A+B(C+D)F+D=E AAB+CD+FD+Ex B. ABCD+F/+DE+ C. ++1+CDBFADE D. A+BCDFDE++ (3) The data stracture used for recursion is A. Stack B. Qurve C. Troe D. None of the above (4) A binary tree T has n nodes of degree 2 . The number of leaf nodes in T is A. logen B. n1 C. n D. n+1 (5) Which of the following sorting algonithes has a bet cave runaing time of O(n2) ? A. Insertion sort B. Merge sert C. Quick sort D. Bubble sort (6) Which of the following sorting methods will be the most efficient if it is already in sorted order? A. Shell sont B. Selection sort C. Insertion sort D. Merget sort (7) The time complexity of Digkstra is . A. O(a) B. O(e+e) C. O(tr) D. O(n3) (8) Given an undirected connected graph with n vernex, the namber of edges in the miniman spanning tree is. A. n B. n-1 C. 2n D. 2n1 (9) Fof a siagle-linked list, remeve the suceessor of p, which operation is correct. A. p next-p next ncel B. p p p neat, p next p next neat; C. prip-ast: D. p'p - next-neat, (Dra Seracture? Fum (Ruge I af 4 ) (10) Which is the property of Qasue A. FIFO B. FILO C. Only insert and remove at the froet back D. No Common points 11. True or False. labeled as T/F (10 questions, 2 peints each. total 20 points) (1) The logical order is ahways the same as the sterags order for linear list. (2) Stack and Queve can store in sequential way, and abo in linked way. (3) After a binary tree threaded, every node should huve a thered which pointing to the predecesser or successor. (4) Given the proorder and inorder sequense, contracting a tree is possible. (5) For the complete binary trec, enly last level cannoe be full. (6) The shortest path is unique from the source to the sink: (7) Binsry search is slower than sequential scurch. (8) The push operation adds an element so the end of a itack. (9) Trees and graphs are the examples of nonlinear data structures. (10) Kruskal's algorithm is an cumple of a groody alporithm
