Visas viktorīnas

Software Engineering: Beyond the Buzzwords

Software engineering is full of terms everyone uses and few use precisely.

  • Tehnoloģijas
  • Pieaugušie
  • Grūta
  • Nopietns
  • 10 jautājumi
  • apmēram 5 min
  • Atgriezeniskā saite pēc katra jautājuma

Viens pret otru

Apskatīt jautājumus

Bez pareizajām atbildēm, lai spēlējot tās joprojām būtu pārsteigums.

  1. 1. jautājums

    What does Brooks's law say about adding people to a late software project?

    • It makes the project later still
    • It speeds it up roughly in proportion
    • It speeds it up only with microservices
    • It mainly increases technical debt
  2. 2. jautājums

    Under semantic versioning, which version change signals a breaking API change?

    • 2.3.1 to 2.4.0
    • 2.3.1 to 2.3.2
    • 2.3.1 to 3.0.0
    • 2.3.1 to 2.3.1-rc1
  3. 3. jautājums

    Which HTTP method is defined as idempotent but not safe?

    • GET
    • POST
    • PATCH
    • PUT
  4. 4. jautājums

    A test suite reaches 100% line coverage. What does that guarantee?

    • Every line ran during the tests
    • Every branch combination was tested
    • The code contains no logic errors
    • Every edge case has an assertion
  5. 5. jautājums

    What best distinguishes continuous delivery from continuous deployment?

    • Delivery skips automated testing
    • In delivery, release to production is a manual decision
    • Delivery requires fixed release plans
    • Deployment needs no build pipeline
  6. 6. jautājums

    What is the key difference between a mock and a stub in testing?

    • A stub verifies calls; a mock returns data
    • They are two names for one thing
    • A mock is used only in integration tests
    • A mock verifies the calls made to it
  7. 7. jautājums

    An algorithm is O(n) and another O(n²). What can you conclude for n = 100?

    • The O(n) one is always faster
    • Nothing certain about which is faster
    • The O(n²) one takes 100 times longer
    • The O(n) one uses less memory
  8. 8. jautājums

    According to the CAP theorem, what must a distributed system give up during a network partition?

    • Partition tolerance or durability
    • Any two of the three properties
    • Either consistency or availability
    • Latency guarantees under heavy load
  9. 9. jautājums

    What happens to commit hashes when you rebase a branch onto a new base?

    • They stay the same
    • Only the newest commit changes
    • They change only if conflicts occur
    • The rebased commits get new hashes
  10. 10. jautājums

    A single-core CPU runs two tasks by switching between them. This is an example of what?

    • Concurrency without parallelism
    • Parallelism without concurrency
    • Both concurrency and parallelism
    • Neither concurrency nor parallelism
Please turn on JavaScript