Exam(Ch26 27, 28).docVIP

Name:_______________________ Covers 50 min CSCI 2410 Data Structures and Algorithms Armstrong Atlantic State University Instructor: Y. Daniel Liang (Open book test, you can only bring the textbook) Part I: Multiple Choice Questions: (1 pts each) 1. (2 pts) Show the BST after inserting 45, 43, 100, 34, 23, and 3 into an empty BST. 2. (2 pts) Show the BST after deleting 15 from the following BST. 3. (2 pts) Show the BST after deleting 60 from the following BST. 4. (3 pts) Show the inorder, preorder, and postorder of the following BST. 5. (2 pts) Draw a DFS tree from the following graph starting from vertex E. 6. (2 pts) Draw a BFS tree from the following graph starting from vertex E. 7. (2 pts) Find a MST in the following graph. 8. (2 pts) Find all shortest paths starting from vertex A in the following graph. Part II: Multiple Choice Questions: (1 pts each) (Take the multiple-choice questions online from LiveLive before midnight today. Log in and click Take Instructor Assigned Quiz Quiz2. You have to take it before it is due. You have to submit it within 20 minutes.) 1. The ________ is to visit the left subtree of the current node first, then the current node itself, and finally the right subtree of the current node. a. postorder traversal b. preorder traversal c. inorder traversal d. breadth-first traversal Key:c # 2. The time complexity for finding an element in a binary search tree is _________. a. O(logn) b. O(nlogn) c. O(n) d. O(1) Key:c # 3. To add a new node, you need to start a process by first placing it as _______ and move it up to maintain the heap property. a. the last node in the heap b. the new root c. the right child of the root d. the left child of the root Key:a # 4. The time complexity of the DFS algorithm is O(|E|). a. true b. false Key:a # 5. A ____ is an edge that links a vertex to itself. a. loop b. parallel edge c. weighted edge d. directed edge Key:a # 6. If two ve