Practice Algorithms Questions and Answers

• In which traversal strategy does the algorithm explore all the neighbor nodes at the present depth prior to moving on to nodes at the next depth level?  �...
• Which of the following best describes the importance of digital signatures?
• What is the primary purpose of normalization in database design?
• Which of the following sorting algorithms has the best average-case time complexity?
• What is the purpose of using foreign keys in a relational database?
• Which of the following SQL commands is used to retrieve data from a database?
• What is the primary focus of Black Box Testing?
• Which of the following design patterns is primarily used to create objects without specifying the exact class of object that will be created?
• What does the "L" in SOLID principles stand for?
• Which of the following types of testing is primarily focused on verifying the integration of different modules?
• What HTTP method is primarily used to retrieve data from a server in a REST API?
• What is the primary purpose of cookies in web development?
• Which of the following cloud service models provides the highest level of control over the infrastructure?
• What is the primary purpose of virtualization in cloud computing?
• Output  of below code   public class Prg {     public static void main(String args[]){       &n...
• Which of the following is shared by the thread of the same process.
• Which of the following is NOT a common wireless security protocol?
• What is the default replication factor in HDFS?
• The recurrence relation T(n) = 2T(n/2) + O(n) corresponds to which algorithm’s time complexity?
• Which sorting algorithm is not stable by default?
• A directed acyclic graph (DAG) has 10 vertices and 15 edges. What is the maximum possible number of topological orderings?
• The Master Theorem gives time complexity for recurrences of the form:
• Which data structure supports extraction of both min and max in O(1) time and insertion in O(log n)?
• The amortized time for inserting into a dynamic array (like C++ vector) is:
• Which of the following problems cannot be solved using greedy algorithms for optimal result?
• The time complexity of building a heap from an unsorted array of n elements is:
• Which traversal method in a binary search tree retrieves nodes in sorted order?
• The Bellman-Ford algorithm executes relaxation steps how many times for a graph with V vertices?
• Which algorithm is best suited to find the shortest path in a graph with negative edge weights but no negative cycles?
• The time complexity of the best case for QuickSort is:
• In a binary tree, if the number of leaf nodes is L, what is the number of nodes with two children?
• In dynamic programming, overlapping subproblems and _________ are key properties.
• Which data structure is used for implementing recursive function calls?
• What is the time complexity of searching in a balanced binary search tree?
• Which algorithm uses a “divide and conquer” strategy?
• In hashing, what is a collision?
• The minimum number of edges in a connected graph with n vertices is:
• Which algorithm is used to detect cycles in a directed graph?
• Which of the following sorting algorithms has the best worst-case time complexity?
• Which of the following is true for Dijkstra’s algorithm?