75% 19:44 PM = Question 31 Not yet answered Marked out of 1.00 Flag question If the tree is not empty, the first node is called the a root b. trunk c. front d. head Question 32 Not yet answered Marked out of 100 Flag question The sum of the indegree and outdegree branches is the of the node. a factor b. count c. degree d. size Question 33 Not yet answered Marked out of 100 Flag question Leave a message X The height of a tree is the level of the leaf in the long O 75% 9:44 PM III Question 29 Not yet answered Marked out of 100 Flag question After new data has been inserted into the queue, the new element becomes the front Select one: True False Question 30 Not yet answered Marked out of 1.00 Flag question When we insert data into a queue with data already in it, the only pointer that needs to be updated is the rear pointer, which is set to point to the new node. Select one True False Previous page Next page Quiz 2 Jump to... Leave a message 74% 19:44 PM III Question 33 Not yet answered Marked out of 1.00 Flag question The height of a tree is the level of the leaf in the longest path from a. Its father plus 1 b. its farthest descendant c. The root d. root plus 1 Question 34 Not yet answered Marked out of 100 Flag question In a binary tree, the maximum outdegree for a node is a two b. zero c. one d. three Question 35 Not yet answered Marked out of 1.00 Flag question Leave a message X 74% 9:45 PM Question 40 Not yet answered Marked out of 1.00 P Flag question In the_traversal of a binary tree, we process all of the children of a node before proceeding with the next level a postorder b. inorder c. perorder d. breadth-first Question 41 Not yet answered Marked out of 1.00 Flag question The efficiency of the sequential search is a. O(n/2) b. O(log n) c. On logn) d. 0 Previous page Next page -Quiz 2 Leave a message X O 74%9:44 PM E-learning Portal Namibia X * Supplementary Quiz (page 4 X o celearning.nust na/eleam/mod/qt ! III Question 37 Not yet answered Marked out of 100 Flag question In the _traversal, the root is processed first before its subtrees a. postorder b. preorder c. breath first d. inorder Question 38 Not yet answered Marked out of 1.00 Flag question What kind of traversal does the following algorithm describe? Algorithm traversal (root) if (root is not null) traversal (leftSub Tree) process (root) traversal (rightSub Tree) end if end traversal Leave a message 74% 19:45 PM III Question 48 Not yet answered Marked out of 1.00 Flag question Two vertices in a graph are said to be adjacent vertices (or neighbors) if there is a path of length connecting them a. at least 1 b. less than 2 c. at least 2 d. 1 Question 49 Not yet answered Marked out of 1.00 Flag question A graph is said to be an) if it is not connected, a. collection of edges b. disjoint graph c. set of edges and vertices d unconnected graph Question 50 Not yet answered Marked out of 1.00 Leave a message 74% 9:45 PM III Question 44 Not yet answered Marked out of 1.00 Flag question If the node to be deleted has we delete the node and attach the left subtree to the deleted node's parent a. has no children b, only a right subtree c. only a left subtree d. has two subtrees Question 45 Not yet answered Marked out of 1.00 Flag question The most difficult logic in the deletion algorithm occurs when the node is a, a leaf b. the root c. a leaf like a node d. not a leaf Question 46 Not yet answered Leave a message Marked out of 100 O