BCS Bachelor of Computer Science Degree MCQ 3

Question 1

Which asymptotic notation describes the worst-case running time of an algorithm?

Accepted Answer

Big-O (O)

Answer

Big-O notation provides an upper bound on the running time, representing the worst-case scenario for an algorithm's complexity.

Question 2

In TCP/IP networking, what is the function of ARP (Address Resolution Protocol)?

Accepted Answer

Mapping IP addresses to MAC addresses

Answer

ARP resolves an IP address into the corresponding MAC (hardware) address needed for local network delivery.

Question 3

What is the output of the following binary addition: 1011 + 0110?

Accepted Answer

10001

Answer

1011 (11) + 0110 (6) = 10001 (17) in binary, with a carry propagating to produce a 5-bit result.

Question 4

Which design pattern ensures a class has only one instance and provides a global access point to it?

Accepted Answer

Singleton Pattern

Answer

The Singleton pattern restricts instantiation of a class to one object and provides a global access point to that instance.

Question 5

In a binary search tree (BST), what property must always hold?

Accepted Answer

Left child < parent < right child

Answer

In a BST, every node's left subtree contains values less than the node, and the right subtree contains values greater than the node.

BCS - Bachelor Of Computer Science Degree Practice Test