Which of the following is not the application of Divide and Conquer technique?
Show Hint
- Quick Sort
- Strassen's Matrix Multiplication
- Linear Search
- Binary Search
The Correct Option is C
Solution and Explanation
Step 1: Understand Divide and Conquer technique.
The Divide and Conquer technique involves dividing the problem into smaller subproblems, solving each subproblem, and then combining their solutions to solve the original problem.
Step 2: Evaluate each option.
- **Quick Sort:** A sorting algorithm based on Divide and Conquer where the array is partitioned into smaller sub-arrays.
- **Strassen's Matrix Multiplication:** This algorithm uses Divide and Conquer to multiply matrices efficiently.
- **Linear Search:** A search algorithm that scans through the elements linearly and does not use Divide and Conquer.
- **Binary Search:** A Divide and Conquer technique where the search space is halved in each step.
Step 3: Conclusion.
The correct answer is (3) **Linear Search** since it does not use Divide and Conquer.
Questions Asked in CUET PG exam
In C language, mat[i][j] is equivalent to: (where mat[i][j] is a two-dimensional array)
- CUET (PG) - 2025
- Pointers and Arrays
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Graph Theory
Match LIST-I with LIST-II
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Graph Theory
Consider the following set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, and P5, with the given length of the CPU burst (in milliseconds) and their priority:
\[\begin{array}{|c|c|c|}\hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline \text{P1} & 10 & 3 \\ \hline \text{P2} & 1 & 1 \\ \hline \text{P3} & 4 & 4 \\ \hline \text{P4} & 1 & 2 \\ \hline \text{P5} & 5 & 5 \\ \hline \end{array}\]
Using priority scheduling (where priority 1 denotes the highest priority and priority 5 denotes the lowest priority), find the average waiting time.
- CUET (PG) - 2025
- Scheduling Algorithms
Match LIST-I with LIST-II
\[\begin{array}{|c|l|}\hline \textbf{LIST-I} & \textbf{LIST-II} \\ \hline \text{A. Encipherment} & \text{The use of mathematical algorithms to transform data into a form that is not readily intelligible.} \\ \hline \text{B. Digital Signature} & \text{Cryptographic transformation of a data unit that allows a recipient of the data unit to prove the source and integrity of the data unit and protect against forgery.} \\ \hline \text{C. Access Control} & \text{A variety of mechanisms that enforce access rights to resources.} \\ \hline \text{D. Data Integrity} & \text{A variety of mechanisms used to assure the integrity of a data unit or stream of data units.} \\ \hline \end{array}\]
\[\text{Matching\ Items\ in\ LIST\-I\ with\ LIST\-II}\]
- CUET (PG) - 2025
- Data Security Mechanisms