List of top Data Science A.I Cyber Security and Computer Sci. Questions on Algorithm asked in CUET (PG)

Match List I with List II.

LIST I	LIST II
(A) A* Algorithm	(I) Space complexity is O4, where d = depth of the deepest optimal solution.
(B) Recursive Best First Search	(II) Incomplete even if the search space is finite.
(C) Recursive Best First Search	(III) Optimal, if the optimal solution is reachable, otherwise returns the best reachable optimal solution.
(D) SMA* Algorithm	(IV) Computation and space complexity is too high.

Choose the correct answer from the options given below:

Match List I with List II

LIST I	LIST II
(A) lim_x→1(1 − x)^1/x	(I) e
(B) lim_x→0 1/x ln(1 − x)	(II) 1
(C) lim_x→0 (1 + x²)^1/x	(III) 0
(D) lim_x→∞ (1 + 1/x)^x	(IV) 2

Equation x² − 1 = 0 is required to be solved using Newton Raphson’s method with an initial guess x0 = −1. Then after one step of Newton’s method, the estimate x1 of the solution will be given by

Match List I with List II

LIST I	LIST II
(A) Floyd-Warshall algorithm for all pair shortest paths	(I) Divide and Conquer
(B) Prim’s algorithm	(II) Greedy Paradigm
(C) Hamiltonian Circuit	(III) Backtracking
(D) Merge Sort	(IV) Dynamic Programming paradigm

Choose the correct answer from the options given below:

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst-case running time of this computation is:

Which of the following statement(s) is/are not true?
1. Optimal binary search tree construction can be performed efficiently using dynamic programming.
2. BFS cannot be used to find connected components of a graph.
3. Given the prefix and postfix walks over the binary tree, the binary tree cannot be uniquely constructed.
4. DFS can be used to find connected components of a graph.
Choose the correct answer from the options given below:

Consider the quicksort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists, one of which contains one-fifth of the elements and the remaining elements are contained in the other sub-list. Let T(n) be the number of comparisons required to sort n elements. Then:

Let A be the problem of finding a Hamiltonian cycle in a graph G = (V, E) with |V| divisible by 3, and B be the problem of determining if a Hamiltonian cycle exists in such graphs. Which one of the following is true?

Rank the following functions by order of growth (Highest running time to lowest running time):
1. $n \times 3^n$
2. $2^{\log(n)}$
3. $n^{2/3}$
4. $4^n$
5. $4^{\log(n)}$
Choose the correct answer from the options given below:

Match List I with List II;

LIST I	LIST II
(A) Bucket sort	(I) O(n²)
(B) Matrix chain multiplication	(II) O(n³)
(C) Huffman codes	(III) O(n log n)
(D) Dijkstra’s Algorithm	(IV) O(n)

Choose the correct answer from the options given below:

Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to j if and only if either j = i + 1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is: