O GoConqr está de visual novo! Conte para nós o que você achou.

Quiz

Week 1 Training

myc elium 136 perguntas

Fazer o quiz

Este quiz tem tipos de pergunta que abrem no player de sempre.

Perguntas do quiz (136)

  1. 1What is an Array List?
    1. AA dynamic array that maintains insertion order and is indexed.
    2. BA collection that utilizes nodes to store data in non-consecutive memory locations. Each node has data, and pointers to its next and prev node.
    3. CA collection that is unordered and operates on key-value pairs. Keys must be unique, but values do not.
    4. DA form of map that uses hashcode() to determine the index location for keys.
    5. EA collection that is unordered, has no indices, and does not allow duplicate values.
  2. 2What is a Linked List?
    1. AA dynamic array that maintains insertion order and is indexed.
    2. BA collection that utilizes nodes to store data in non-consecutive memory locations. Each node has data, and pointers to its next and prev node.
    3. CA collection that is unordered and operates on key-value pairs. Keys must be unique, but values do not.
    4. DA form of map that uses hashcode() to determine the index location for keys.
    5. EA collection that is unordered, has no indices, and does not allow duplicate values.
  3. 3What is a Map?
    1. AA dynamic array that maintains insertion order and is indexed.
    2. BA collection that utilizes nodes to store data in non-consecutive memory locations. Each node has data, and pointers to its next and prev node.
    3. CA collection that is unordered and operates on key-value pairs. Keys must be unique, but values do not.
    4. DA form of map that uses hashcode() to determine the index location for keys.
    5. EA collection that is unordered, has no indices, and does not allow duplicate values.
  4. 4What is a Hash Map?
    1. AA dynamic array that maintains insertion order and is indexed.
    2. BA collection that utilizes nodes to store data in non-consecutive memory locations. Each node has data, and pointers to its next and prev node.
    3. CA collection that is unordered and operates on key-value pairs. Keys must be unique, but values do not.
    4. DA form of map that uses hashcode() to determine the index location for keys.
    5. EA collection that is unordered, has no indices, and does not allow duplicate values.
  5. 5What is a Set?
    1. AA dynamic array that maintains insertion order and is indexed.
    2. BA collection that utilizes nodes to store data in non-consecutive memory locations. Each node has data, and pointers to its next and prev node.
    3. CA collection that is unordered and operates on key-value pairs. Keys must be unique, but values do not.
    4. DA form of map that uses hashcode() to determine the index location for keys.
    5. EA collection that is unordered, has no indices, and does not allow duplicate values.
  6. 6Syntax for using an iterator to move through a collection
    1. Awhile (iterator.hasNext()) {}
    2. Bdo {
      System.out.println("\t" + nums[j]);
      } while(j >= 0);
    3. Cfor (int n : nums) {
      System.out.println("\t" + n);
      }
    4. Dwhile (j >= 0) {
      System.out.println("\t" + nums[j]);
      } do;
    5. Efor (int n % nums) {
      System.out.println("\t" + n);
      }
  7. 7Syntax for a do-while loop
    1. Awhile (iterator.hasNext()) {}
    2. Bdo {
      System.out.println("\t" + nums[j]);
      } while(j >= 0);
    3. Cfor (int n : nums) {
      System.out.println("\t" + n);
      }
    4. Dwhile (j >= 0) {
      System.out.println("\t" + nums[j]);
      } do;
    5. Efor (int n % nums) {
      System.out.println("\t" + n);
      }
  8. 8Syntax for a for-each loop
    1. Awhile (iterator.hasNext()) {}
    2. Bdo {
      System.out.println("\t" + nums[j]);
      } while(j >= 0);
    3. Cfor (int n : nums) {
      System.out.println("\t" + n);
      }
    4. Dwhile (j >= 0) {
      System.out.println("\t" + nums[j]);
      } do;
    5. Efor (int n % nums) {
      System.out.println("\t" + n);
      }
  9. 9Select which methods can be used with Array Lists
    1. A.add("lemon")
    2. B.add(0, "lemon")
    3. C.get(0)
    4. D.remove(0)
    5. E.remove("lemon")
    6. F.put("yellow", "lemon")
    7. G.remove("yellow", "lemon")
    8. H.get("yellow")
  10. 10Select which methods can be used with Linked Lists
    1. A.add("lemon")
    2. B.add(0, "lemon")
    3. C.get(0)
    4. D.remove(0)
    5. E.remove("lemon")
    6. F.put("yellow", "lemon")
    7. G.remove("yellow", "lemon")
    8. H.get("yellow")

Informações

Descrição
Full Stack Development SkillStorm Training Quiz sobre Week 1 Training, criado por myc elium em 19-11-2025.
Idioma
English
Visualizações
51
Avaliação
Ainda sem avaliações
Avalie este quiz
Avalie este quiz

Fale Conosco

Sobre o que é sua mensagem?

O que você acha do novo visual?

Você gostou?