Practice Algorithms Questions and Answers

• Which of the following operations on a data structure refers to the removal of an element from the front of a queue?
• Which of the following protocols is most commonly used in IoT devices to enable communication between smart devices?
• Which of the following SQL queries is used to remove a table from a database?
• Which component of a network ensures that data is delivered to the correct host in a multi-host environment?
• In mobile computing, what is the main feature of pervasive computing?
• Which of the following is true about the time complexity of Merge Sort?
• Which of the following algorithms is best suited for finding the shortest path in a weighted graph where some edges may have negative weights but no negati...
• Which of the following is a critical concern for securing critical infrastructure?
• Which data structure is most suitable for implementing recursion?
• In a Data Analytics pipeline, which of the following is an advantage of using Dimensional Modelling?
• Which of the following is true about the Round Robin (RR) CPU scheduling algorithm?
• Which of the following is NOT a characteristic of the SJF (Shortest Job First) scheduling algorithm?      
• Which of the following is a primary challenge associated with Cloud Security?
• Which of the following algorithms is most appropriate for a sorting task that requires minimal auxiliary space?
• In the context of Data Modelling and Analytics, which technique is most suitable for identifying the underlying patterns in high-dimensional data without e...
• 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?