...
February 13, 2024

Communication

Question 30 A good communicator begins his/her presentation with a: A Non-sequitur B Repetitive phrase C Ice-breaker D Complex question CommunicationNature-of-Communication2017 November NTA UGC NET Paper […]
February 13, 2024

Question 9704 – Time-Complexity

The running time of the following algorithm Procedure A(n) If n <= 2 return(1) else return (A(⌈√n⌉)); is best described by: Correct Answer: C Question 15 […]
February 13, 2024

Question 9517 – Time-Complexity

The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of Correct Answer: C Question 19 […]