ENADE Ciência da Computação
ENADE Ciência da Computação (Brazil)
Algoritmos Complexidade Estruturas DadosEnglish
Exam overviewPractice session
In asymptotic analysis of algorithms, let f(n) and g(n) be functions from non-negative integers to positive real numbers. Which formal definition correctly defines the Big-Theta notation (f(n) = Theta(g(n)))?
Loading your practice session…