MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Worst case complexity of Breadth First Search traversal __________ |
| A. | O(n*n) |
| B. | O(nlogn) |
| C. | O(n2 logn) |
| D. | O(n3) |
| Answer» C. O(n2 logn) | |
| 2. |
Breadth First Search traversal of a binary tree finds its application in __________ |
| A. | Cloud computing |
| B. | Peer to peer networks |
| C. | Weighted graph |
| D. | Euler path |
| Answer» C. Weighted graph | |
| 3. |
An immediate application of a Depth First Search traversal is __________ |
| A. | count the number of leaf nodes |
| B. | perform Inorder traversal in easy way |
| C. | count number of nodes |
| D. | implement preorder traversal |
| Answer» B. perform Inorder traversal in easy way | |
| 4. |
The time complexity of calculating the sum of all leaf nodes in an n-order binary tree is __________ |
| A. | O(n2) |
| B. | O(n+1) |
| C. | O(1) |
| D. | O(n) |
| Answer» E. | |
| 5. |
For the expression (7-(4*5))+(9/3) which of the following is the post order tree traversal? |
| A. | *745-93/+ |
| B. | 93/+745*- |
| C. | 745*-93/+ |
| D. | 74*+593/- |
| Answer» D. 74*+593/- | |
| 6. |
What is the minimum height for a binary search tree with 60 nodes? |
| A. | 1 |
| B. | 3 |
| C. | 4 |
| D. | 2 |
| Answer» E. | |
| 7. |
From the following code identify the which traversal of a binary tree is this __________ |
| A. | Inorder traversal |
| B. | preorder traversal |
| C. | postorder traversal |
| D. | Euler tour traversalView Answer |
| Answer» D. Euler tour traversalView Answer | |
| 8. |
An important application of binary tree is ______ |
| A. | Huffman coding |
| B. | stack implementation |
| C. | queue implementation |
| D. | traverse a cyclic graph |
| Answer» B. stack implementation | |
| 9. |
In preorder traversal of a binary tree the second step is ____________ |
| A. | traverse the right subtree |
| B. | traverse the left subtree |
| C. | traverse right subtree and visit the root |
| D. | visit the root |
| Answer» C. traverse right subtree and visit the root | |