List of top Computer Science and IT Engineering Questions on OOPs concept

Which class of problem solving is considered the easiest one?

Which type of graph does not contain any cycles?

The problem solving technique which divides a problem into smaller sub problems and then combines their results _________

Which algorithm is commonly used to find a minimum spanning tree?

Name the notation that represents the average-case complexity of an algorithm.

Which time complexity grows the slowest as input size increases?

What is the time complexity of the optimal solution for the 0/1 Knapsack problem with n items and capacity W using Dynamic Programming?

In a singly linked list, what is the time complexity to delete a node given a pointer to that specific node?

Which sorting algorithm has the best-case time complexity of $O(n)$ when the input array is already sorted?

Which data structure allows insertion and deletion at both ends?

Which tree traversal visits left subtree, root, then right subtree?

Which data structure is used for level order traversal in trees?

Which of the following parameter passing mechanisms allows a function to modify the actual variable in the calling function?

In a circular queue implemented using an array of size $MAX$, if 'front' and 'rear' are the indices, the condition for the queue being full is:

Which of the following is TRUE about the Quick Sort algorithm?

The Huffman coding algorithm used for data compression is based on which algorithmic strategy?

Consider the linear search algorithm on an array of size 'n'. What is the worst-case time complexity of linear search?

Which of the following statements about linked lists is true?

A connected undirected graph has 8 vertices and 12 edges. How many edges will its spanning tree contain?

An algorithm repeatedly divides a problem into smaller sub-problems, solves them independently, and combines the results to obtain the final solution. Determine the algorithm that follows this strategy.