Practice Test Geeks(EIT) Engineer In Training Certification Practice Test
← All EIT Flashcard Decks

Computer Science and Numerical Methods Flashcards

6 cards from real EIT practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.

Read the first 6 Computer Science and Numerical Methods flashcards as text

  1. What is the result of binary addition 1011 + 0101?

    Answer: 10000

    1011 (11) + 0101 (5) = 16 = 10000 in binary.

  2. The Newton-Raphson method is primarily used for:

    Answer: Finding roots of nonlinear equations

    Newton-Raphson iteratively refines root estimates using xₙ₊₁ = xₙ − f(xₙ)/f′(xₙ).

  3. What is the time complexity of the binary search algorithm?

    Answer: O(log n)

    Binary search halves the search space each iteration, yielding O(log n) time complexity.

  4. In numerical methods, the trapezoidal rule is used to approximate:

    Answer: Definite integrals

    The trapezoidal rule estimates a definite integral by summing trapezoidal areas under the curve.

  5. Which data structure operates on a Last-In-First-Out (LIFO) principle?

    Answer: Stack

    A stack follows LIFO order—the most recently inserted element is the first to be removed.

  6. Round-off error in numerical computation refers to:

    Answer: Loss of precision when representing decimals in finite binary storage

    Round-off error occurs because finite binary representation cannot exactly store all decimal values.