Disciplinas:
Algoritmos e Estrutura de Dados 2
Arquitetura de Software 1
Atualidades 5
Banco de Dados 1
Direito Constitucional 2
Engenharia de Software 5
Inglês 5
Legislação dos Municípios do Estado de São Paulo 3
Português 10
Programação 3
Raciocínio Lógico 10
Redes de Computadores 7
Segurança da Informação 2
Sistemas Operacionais 4
Texto da Questão:
+
As questões seguintes, utilizam frases extraídas do livro “Introduction Algorithms”, T.H. Cormen, C.E. Leiserson, R.L. Rivest e C. Stein. The MIT Press, Third Edition, 2009.
Analise a texto a seguir:
“Algorithms may require several different types of operations to be performed on sets. For example, many algorithms need only the ability to insert elements into, delete elements from, and test membership in a set. We call a dynamic set that supports these operations a dictionary. Other algorithms require more complicated operations.”
Segundo o texto,
“Algorithms may require several different types of operations to be performed on sets. For example, many algorithms need only the ability to insert elements into, delete elements from, and test membership in a set. We call a dynamic set that supports these operations a dictionary. Other algorithms require more complicated operations.”
Segundo o texto,
