# Data Structure NTA UGC NET Question Analysis

Data Structure NTA UGC NET Question Analysis

#### Show Answer With Best Explanation

Explanation:
Statement I: True. TD be a DFS tree on G, & there is no edge cross with respect to any Tree but can have cross in directed graphs.
Statement II: False. This is not always correct.

#### Show Answer With Best Explanation

Explanation:  #### Show Answer With Best Explanation

Explanation:
L = (n-1) * I + 1
where,
L = Leaf Node, I = Internal Node, n = n-ary Tree
L = (n-1)*I +1
41 = (n-1) * 10 +1
41 = 10n -10 +1
10n = 50
n = 5

#### Show Answer With Best Explanation

Explanation:

As we know the structure of MAX heap. In a max heap, the smallest element is always present at a leaf node.
As we know the heap being a complete binary tree, there can be up to n/2 leaf nodes.
If we are going to examine all of them, we would need O(n) time.

#### Show Answer With Best Explanation

Explanation:
By Handshaking theorem,
Sum of the Degree of vertices = 2 * Number of Edges
2n1 + 3n2 + n3 = 2E 2n + 6n + 3n = 2E E = 11n/2 —————— equation (1) We know , In Tree Number of vertices = Number of edges + 1 2n + 3n + n = 11n/2 + 1 6n = 11n/2 +1 12n = 12n + 2 n = 2 put n =2 in eqution (1), we got E = 11n/2 E = 112 / 2
E = 11
Number of vertices = number of edges + 1
V = E + 1
V = 11 + 1
V = 12

#### Show Answer With Best Explanation

Explanation:

In the worst case running time of insert in unsorted Array,
we can simply insert an element at the end of the unsorted array, it would need Θ (1) time.
Worst case complexity is Θ(1).
——————————————————————————————–
In the worst case running time extract min, there is no specific algorithm for extract min. So, the linear search is an only way to extract min on the unsorted array. it would need Θ (n) time.
Worst case complexity is Θ(n).
So. the correct answer is (I)

#### Show Answer With Best Explanation

Explanation:
It is given that ,
Block pointer = 4 byte
Record pointer = 0 , {consider it as 0 because it is not given in the question}
Search Key value = 32 byte
Size of non-leaf node in B Tree = m * Block pointer + (m – 1)*(search key value + record pointer)
= m * 4 + (m-1)*(32 + 0)
= 4m + 32m -32
= 36m – 32

#### Show Answer With Best Explanation

Explanation:

In the worst case running time of insert in unsorted Array,
we can simply insert an element at the end of the unsorted array, it would need Θ (1) time.
Worst case complexity is Θ(1).
——————————————————————————————–
In the worst case running time extract min, there is no specific algorithm for extract min. So, the linear search is an only way to extract min on the unsorted array. it would need Θ (n) time.
Worst case complexity is Θ(n).
So. the correct answer is (I)

#### Show Answer With Best Explanation

Explanation: #### Show Answer With Best Explanation

Explanation: #### Show Answer With Best Explanation

Explanation:   #### Show Answer With Best Explanation

Explanation:   #### Show Answer With Best Explanation

Answer: I (Marks to all )

#### Show Answer With Best Explanation 