Test Index

GATE Computer Science (CS) 2014 Shift 1 Solved Paper

© examsnet.com

Question : 22

Total: 65

Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly 4 nodes is O(n^a log^b n). Then the value of a + 10b is _______

Your Answer:

Go to Question:

Prev Question

Next Question