GRT Technical Skills 2

Question 1

A sorting algorithm has a worst-case time complexity of O(n²) but an average-case complexity of O(n log n). Which algorithm fits this description?

Accepted Answer

Quick Sort

Answer

Quick Sort has an average-case of O(n log n) but degrades to O(n²) in the worst case when pivot selection is poor.

Question 2

In a relational database, which normal form eliminates transitive dependencies?

Accepted Answer

Third Normal Form (3NF)

Answer

Third Normal Form (3NF) requires that all non-key attributes depend only on the primary key, eliminating transitive dependencies.

Question 3

Which data structure is most efficient for implementing a priority queue?

Accepted Answer

Binary Heap

Answer

A Binary Heap supports O(log n) insertion and O(log n) deletion of the minimum/maximum element, making it ideal for priority queues.

Question 4

A network engineer needs to subnet a Class C IP address to support 30 hosts per subnet. What subnet mask should be used?

Accepted Answer

/27 (255.255.255.224)

Answer

A /27 mask provides 32 addresses (30 usable hosts) per subnet, which exactly meets the 30-host requirement.

Question 5

In object-oriented programming, what principle does the Liskov Substitution Principle (LSP) enforce?

Accepted Answer

Objects of a subclass should be replaceable for objects of the superclass

Answer

LSP states that subclasses must be substitutable for their parent classes without altering the correctness of the program.

(GRT) Graduate Recruitment Test Practice Test