Strategic Programming Challenges Quiz

A programmer is tasked with developing a function that calculates the factorial of a number using recursion. Which of the following is a correct base case for this recursive function?

• When the number is 0, return 1.

• When the number is 1, return 0.

• When the number is 2, return 2.

• When the number is negative, return -1.

Consider a scenario where you need to optimize a sorting algorithm for a dataset that is mostly sorted. Which sorting algorithm would be most efficient in this case?

• Bubble Sort

• Quick Sort

• Insertion Sort

• Selection Sort

A developer is designing a program that needs to store and frequently access a large number of key-value pairs. Which data structure should they use to ensure the fastest access time?

• Array

• Linked List

• Hash Table

• Stack

You are given a problem to find the shortest path in a weighted graph. Which algorithm would be most appropriate to use?

• Depth-First Search

• Breadth-First Search

• Dijkstra's Algorithm

• Kruskal's Algorithm

A software engineer needs to implement a feature that requires checking if a string is a palindrome. Which of the following approaches would be most efficient?

• Reverse the string and compare it to the original.

• Use a stack to store characters and compare.

• Use two pointers from both ends and move towards the center.

• Convert the string to a list and sort it.

In a multi-threaded program, which of the following is a common issue that can arise and needs to be handled carefully?

• Memory Leak

• Deadlock

• Buffer Overflow

• Syntax Error

A developer is tasked with writing a function to calculate the greatest common divisor (GCD) of two numbers. Which algorithm is most efficient for this task?

• Brute Force

• Euclidean Algorithm

• Prime Factorization

• Binary Search

Which of the following is a key advantage of using a linked list over an array?

• Faster access time

• Dynamic size

• Easier to sort

• Less memory usage

A programmer needs to implement a feature that requires frequent insertion and deletion of elements. Which data structure is most suitable for this requirement?

• Array

• Queue

• Linked List

• Binary Tree

In the context of object-oriented programming, which of the following best describes polymorphism?

• The ability to inherit methods from a parent class.

• The ability to define multiple methods with the same name but different implementations.

• The ability to encapsulate data within a class.

• The ability to create a new class from an existing class.