Aspire Faculty ID #14704 · Topic: UGC NET Computer Science 26 June 2025 (Paper II) · Just now
UGC NET Computer Science 26 June 2025 (Paper II)

Which of the following trees are height balanced?
  • A. Binary Search Tree
  • B. AVL Tree
  • C. Red-Black Tree
  • D. B-Tree

Choose the correct answer from the options below:

  1. A and D only
  2. A, B and D only
  3. C and D only
  4. B and C only

Solution

Answer: 4) B and C only

  • Binary Search Tree (BST): Not necessarily balanced; height can degrade to O(n).
  • AVL Tree: Height-balanced by definition (balance factor −1, 0, +1); height is O(log n).
  • Red-Black Tree: Enforces black-height properties that keep height O(log n); treated as a height-balanced binary tree.
  • B-Tree: Balanced (all leaves at the same level) but not a binary tree; the term “height-balanced tree” typically refers to binary trees. Hence excluded here.

Previous 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)

Nearest first
1
Consider relation R(A, B, C, D, E) with the following functional dependencies: C → F, E → A, EC → D, A → B. Wh…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
Consider the following interrupt protection levels in Linux, and arrange them in the increasing order of their prioriti…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
Maintaining a graph in memory by means of its adjacency matrix is known as
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
Arrange the following parsers in increasing order of their power (least → most): LR(0) LR(1) LALR(1) LL(0) S…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
Match List I with List II List I List II A. Digital Signature I. Asymmetric encryption algor…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
Match List I with List II List I List II A. Count to infinity problem I. Mobile Adhoc Networ…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
Which of the following belongs to McCall’s Quality Factors? A. Maintainability B. Usability C. Integrity…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
Which of the following is not a valid property over two fuzzy relations $\tilde R$ and $\tilde S$ for performing $\lamb…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
What would be the equivalent pointer expression for referring the array element ar[m][n][o]? *(*(*(ar) + m + n) + o)…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
Which of the following are controlled-access protocols? A. Reservation B. Polling C. TDMA D. Token Passing E. CSMA…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)

Next 10 Questions — UGC NET Computer Science 26 June 2025 (Paper II)

Ascending by ID
1
Let P denote “She is intelligent” and Q denote “She is happy.” Given statements: (a) If she is intelligent, the…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
2
The process followed in order to find difficult, unknown and hidden information about a software system is called:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
3
When developing a dynamic programming algorithm, the sequence of steps followed is: A. Construct an optimal s…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
4
The packet sent by a node to the source to inform it of congestion is called:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
5
In a pack of 42 cards, 3 cards are chosen one after the other without replacement. Find the number of ways this can…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
6
The transformation of data from main memory to cache memory is referred as:
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
7
Match List I with List II: List I List II A. Address Space I. Associative Mappi…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
8
Consider the following table defining the sample inputs and corresponding target values for a perceptron model. …
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
9
Arrange the following in the increasing order of coupling from lowest coupling to highest coupling. A. Common Coupling …
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
10
The correct sequence of constructing Huffman tree isA. Repeat until root formedB. Create leaf nodesC. Build priority qu…
Topic: UGC NET Computer Science 26 June 2025 (Paper II)
Ask Your Question or Put Your Review.

loading...