Sunday, March 20, 2022
Saturday, April 10, 2021
A complete n - ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n - ary tree. If L=41. and I=10. What is the value of n? - Solved Computer Science - June 2020 - NTA NET ASPIRANT ACADEMY
NTA NET SOLVED COMPUTER SCIENCE - JUNE 2020
Answer: 5 (Option D)
Friday, April 9, 2021
What is the radix of the numbers if the solution to the quadratic equation X^2-10X+26=0 is x=4 and x=7? - NTA NET JUNE 2020 - NTA NET ASPIRANT ACADEMY
Download UGC NET Previous Question Paper and Answer Key
Download Computer Science Syllabus
For more Details NTA NET ASPIRANT ACADEMY and YouTube Channel
Thursday, April 8, 2021
Let G be a simple undirected graph, TD be a DFS tree on G, and TB be the BFS tree on G. Consider the following statemets. - NET ASPIRANT ACADEMY
Answer: Option 3
Explanation: There are four types of edges can yield in DFS. These are tree, forward, back, and cross edges. In undirected connected graph, forward and back egdes are the same thing. A cross edge in a graph is an edge that goes from a vertex v to another vertex u such that u is neither an ancestor nor descendant of v. Therefore, cross edge is not possible in undirected graph.
So, statement (I) is correct.
For statement (II) take counterexample of complete graph of three vertices, i.e., K3 with XYZ, where X is source and Y and Z are in same level. Also,there is an edge between vertices Y and Z, i.e., |i-j| = 0 ≠ 1 in BFS. So, statement became false.
Download UGC NET Previous Question Paper.
Download Computer Science Syllabus
For more Details NTA NET ASPIRANT ACADEMY and YouTube Channel
Subscribe to:
Posts (Atom)
-
Answer: Option 3 Explanation: There are four types of edges can yield in DFS. These are tree, forward, back, and cross edges. In undirecte... -
Download Paper I - June 2022
-
UGC NET Paper I - June 2020 - Click Here: to Download UGC NET Paper I - June 2020