MathJax


Sunday, April 3, 2022

2022-077

Consider the following graph, that lists the requirements for subjects in a Computer Science course. Which of the alternatives represent an acceptable topological ordering?

  1. ProgI → ProgII → SO → ArqComp → CompAlg → EstDados → IA → ProbEst
  2. ProbEst → IA → ProgI → ArqComp → SO → ProgII → CompAlg → EstDados
  3. ArqComp → SO → ProgI → ProgII → CompAlg → EstDados → ProbEst → IA
  4. ProgI → ArqComp → ProgII → SO → CompAlg → EstDados → ProbEst → IA
  5. None of the above.

Original idea by: Diogo Souza

at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

2025-261

Consider a directed graph \(G\)   and the Kosaraju-Sharir's algorithm for finding strongly connected components (SCCs). Analyze the foll...

  • 2024-248
      Consider the following networks:   Which of the following options correctly ranks these networks from  most  robust to  least  robust agai...
  • 2021-051
    Random networks evolve in a dynamic process when \( \langle k \rangle \) grows from 0 to infinity. They start with isolated nodes, which a...
  • 2023-221
    Which of the following statements correctly describes the robustness of scale-free networks? Scale-free networks are highly robust again...