Txhua qhov kev xeem

Software Engineering: Beyond the Buzzwords

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

  • Thev naus laus zis
  • Neeg loj
  • Nyuaj
  • Nruj nreem
  • 10 lo lus nug
  • kwv yees li 5 feeb
  • Feedback tom qab txhua lo lus nug

Sib tw

Saib cov lus nug

Tsis qhia cov lus teb raug, kom thaum koj ua si lawv tseem yog ib qho xav tsis txog.

  1. Lo lus nug 1

    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. Lo lus nug 2

    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. Lo lus nug 3

    Which HTTP method is defined as idempotent but not safe?

    • GET
    • POST
    • PATCH
    • PUT
  4. Lo lus nug 4

    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. Lo lus nug 5

    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. Lo lus nug 6

    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. Lo lus nug 7

    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. Lo lus nug 8

    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. Lo lus nug 9

    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. Lo lus nug 10

    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