BCS Bachelor of Computer Science Degree 3

Question 1

What is the worst-case time complexity of searching in a balanced Binary Search Tree (BST)?

Accepted Answer

O(log n)

Answer

A balanced BST guarantees O(log n) worst-case search time because the tree height is kept at log n.

Question 2

In object-oriented programming, what concept allows a subclass to provide a specific implementation of a method already defined in its parent class?

Accepted Answer

Overriding

Answer

Method overriding allows a subclass to redefine a parent class method with its own specific implementation.

Question 3

Which type of memory is volatile and loses its content when power is removed?

Accepted Answer

RAM

Answer

RAM (Random Access Memory) is volatile and loses all stored data when the power supply is cut.

Question 4

In asymptotic notation, O(1) describes what type of algorithm complexity?

Accepted Answer

Constant

Answer

O(1) denotes constant time complexity, meaning execution time does not change regardless of input size.

Question 5

Which cryptographic protocol is used to secure communications over a computer network in HTTPS?

Accepted Answer

TLS/SSL

Answer

TLS (Transport Layer Security), formerly SSL, encrypts data transmitted over HTTPS connections.

BCS - Bachelor Of Computer Science Degree Practice Test