The worst case time complexity of AVL tree is better in comparison to binary search tree for
A. | Search and Insert Operations |
B. | Search and Delete Operations |
C. | Insert and Delete Operations |
D. |
Search, Insert and Delete Operations
|
Option: D Explanation : Click on Discuss to view users comments. seema said: (11:13am on Sunday 31st March 2013)
seaching ,insertion and deletion of any key in BST is o(h) where h is height of BST and the height of AVL tree is o(log n).
|
A. | SS, BSS, OSS |
B. |
BSS, BSC, MSC
|
C. | CELL, BSC, OSS |
D. | SS, CELL, MSC |
Option: A Explanation : Click on Discuss to view users comments. |
A. |
{ φ}
|
B. | { φ, { φ}} |
C. | {0} |
D. | {0, φ, { φ}} |
Option: B Explanation : Click on Discuss to view users comments. Umar said: (1:28pm on Friday 27th December 2013)
Shouldn't the answer be (A). Because the element mentioned inside the braces is a symbol for null set. So it is equivalent to empty braces.
|
A. |
239
|
B. | 310 |
C. | 321 |
D. | 325 |
Option: C Explanation : Click on Discuss to view users comments. pooja said: (11:57am on Sunday 23rd February 2014)
i want the explaination
|
This Section covers the UGC NET Computer Science solved papers along with Answer Keys. UGC NET Computer Science Answer Keys, UGC NET Computer Science Answer Key December 2012, Previous Year Papers UGC NET Computer Science, Solved papers , Answer keys, December 2012 , dec 12 , previous year solved papers , model papers