Practice Test GeeksEIT - Engineering in Training Practice Test
← All EIT Flashcard Decks

Computer Science and Numerical Methods Flashcards

7 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 7 Computer Science and Numerical Methods flashcards as text

  1. In hexadecimal, what is the decimal value of FF?

    Answer: 255

    FF in hex equals 15×16 + 15×1 = 240 + 15 = 255 in decimal.

  2. The central difference approximation for the first derivative f'(x) is:

    Answer: [f(x+h) - f(x-h)] / (2h)

    The central difference formula uses points on both sides of x and divides by 2h, providing second-order accuracy.

  3. The 4th-order Runge-Kutta method is primarily used to numerically solve:

    Answer: Ordinary differential equations with initial conditions

    RK4 is a step-by-step integration scheme that advances the solution of ODEs from initial conditions using weighted slope estimates.

  4. When the Newton-Raphson method converges near a simple root, its rate of convergence is:

    Answer: Quadratic

    Near a simple root, the error at each Newton-Raphson iteration is proportional to the square of the previous error — quadratic convergence.

  5. What is the result of the bitwise AND of binary 1100 and 1010?

    Answer: 1000

    AND returns 1 only when both bits are 1: 1100 AND 1010 gives 1000 (only the leftmost bit is 1 in both).

  6. In floating-point arithmetic, round-off error arises from:

    Answer: The limited precision of floating-point number representation

    Round-off error occurs because computers store real numbers with finite precision, causing irrational and many rational numbers to be approximated.

  7. A queue data structure follows which access principle?

    Answer: FIFO — First In, First Out

    A queue removes elements in the same order they were added — the first element enqueued is the first one dequeued (FIFO).