MCQs Data Structure|UGC-NET|GATE|Data Structures
| 41. | Give as good a big–O estimate as possible for the following functions : (nlogn+n2)(n3+2) and (n!+2n) (n3+log(n2+1)) |
| A. | O(n5+2n2) & O(n3*n!) |
| B. | O(n5) & O(n3*2n) |
| C. | O(n5) & O(n3* n!) |
| D. | O(n5+2n2) & O(n3*2n) |
| View/Hide Ans | |
| Explanation | |
| 42. | Which of the following connected simple graph has exactly one spanning tree? |
| A. | Complete graph |
| B. | Hamiltonian graph |
| C. | Euler graph |
| D. | None of the above |
| View/Hide Ans | |
| Explanation | |
| 43. | How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components? |
| A. | M+N–C |
| B. | M–N–C |
| C. | M–N+C |
| D. | M+N+C |
| View/Hide Ans | |
| Explanation | |
| 44. | Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation? |
| A. | Circular linked list |
| B. | Doubly linked list |
| C. | Linked list |
| D. | Dequeue |
| View/Hide Ans | |
| Explanation | |
| 45. | The number of nodes in a complete binary tree of height n: |
| A. | 2n-1-1 |
| B. | 2n-1+1 |
| C. | 2n+1-1 |
| D. | 2n+1+1 |
| View/Hide Ans | |
| Explanation | |
| 46. | Binary search algorithm employs the strategy of. |
| A. | Divide and Conquer technique |
| B. | Dynamic Programming |
| C. | Branch & Bound technique |
| D. | Greedy Strategy |
| View/Hide Ans | |
| Explanation | |
| 47. | Give the name of the Linear list in which elements can be added at ends but not in the middle: |
| A. | Array |
| B. | Queue |
| C. | Tree |
| D. | Circular Queue |
| View/Hide Ans | |
| Explanation | |
| 48. | If every node “a” in a graph G is adjacent to every node “b” in G, then the graph is: |
| A. | Isolated graph |
| B. | Connected graph |
| C. | Eulerian graph |
| D. | Complete graph |
| View/Hide Ans | |
| Explanation | |
| 49. | Full Binary tree with n leaves contain: |
| A. | n nodes |
| B. | 2n-1 nodes |
| C. | n-1 nodes |
| D. | log n nodes |
| View/Hide Ans | |
| Explanation | |
| 50. | In any undirected graph, the sum of the degrees of all nodes is: |
| A. | must be even |
| B. | is always ODD |
| C. | need not be even |
| D. | is twice number of edges |
| View/Hide Ans | |
| Explanation |
Author Does Not claim of any answer these answers are as per expert opinion
