EIT Computer Science and Numerical Methods

Question 1

What is the time complexity of binary search on a sorted array of n elements?

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(n²)

Answer

O(1)

Question 2

The Newton-Raphson iterative formula for finding the root of f(x) = 0 is:

Accepted Answer

x_(n+1) = x_n - f(x_n)/f'(x_n)

Answer

x_(n+1) = x_n + f(x_n)/f'(x_n)

Answer

x_(n+1) = [x_n + f(x_n)] / 2

Answer

x_(n+1) = x_n · f'(x_n) - f(x_n)

Question 3

What is the decimal equivalent of the binary number 1101?

Accepted Answer

13

Answer

11

Answer

12

Answer

14

Question 4

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

Accepted Answer

A definite integral

Answer

The root of a function

Answer

The derivative of a function at a point

Answer

A system of linear equations

Question 5

Which data structure follows the LIFO (Last In, First Out) access principle?

Accepted Answer

Stack

Answer

Queue

Answer

Linked List

Answer

Hash Table

Question 6

The average-case time complexity of merge sort is:

Accepted Answer

O(n log n)

Answer

O(n²)

Answer

O(log n)

Answer

O(n)

Question 7

In programming, recursion is best described as:

Accepted Answer

A function that calls itself directly or indirectly

Answer

A loop that iterates until a condition is met

Answer

Two functions sharing the same memory variable

Answer

A program using multiple threads simultaneously