search anything

Sunday, 20 October 2024

Computer Science and Application MP Set Exam 2022 Q-141 to 150

 141. When searching a graph using DFS and BFS, which of the following statements is true ?

(A) DFS always guarantees to find the shortest path between two nodes.

(B) BFS is more memory-efficient than DFS.

(C) DFS is non-recursive algorithm while BFS is recursive.

(D) BFS explores all the neighboring nodes before moving to the next level in the graph.

Answer: (D)

142. What is the primary purpose of a Hopfield Network ?

(A) Classification

 (B) Associative memory

(C) Clustering

(D) Regression

Answer: (B)

143. Which of the following statements is true ?

(A) Hill climbing is a local search algorithm, meaning it focuses on improving the current solution by exploring neighbouring solutions.

(B) Hill climbing can be applied to both discrete and continuous optimization problems.

(C) Hill climbing is prone to getting trapped in local optima.

(D) All of the above are correct.

Answer: (D)

144. Which of the following operations is commonly used in Fuzzy set theoiy for combining Fuzzy sets ? (A) Cartesian product

(B) Union, intersection and complement

(C) Complement and Cartesian product

(D) Power set and Cartesian product

Answer: (B)

145. From the given below, which can be effectively used as a simple phonetic based spell checker ?

(A) A* algorithm

(B) Soundex algorithm

(C) Phonetic algorithm

(D) None of the above

Answer: (B)

146. A …………………. is a collection of written or spoken texts that serve as a source of linguistic data for analysis and study.

(A) N-Grams

(B) Dictionary

(C) Corpus

(D) Language model

Answer: (C)

147. Factors that influence backpropagation training :

(A) Bias

(B) Momentum

(C) Learning constants

(D) All of the above

Answer: (D)

148. The theoretical foundation of genetic algorithm rely on the binary string representation of solutions and the notion of schema. If 'r' is the number of 'don't care symbol' in the schema then every schema matches exactly………. strings.

(A) 2r

(B) 2'

(C) r2

(D) 2r – 1

Answer: (B)

149. The issue(s) involved with multi-agent planning is/are :

(i) Representing and planning for multiple simultaneous actions.

(ii) Cooperation, coordination and competition arising in true multiagent settings

(A) Only (i)

(B) Only (ii)

(C) Both (i) and (ii)

(D) Neither (i) nor (ii)

Answer: (C)

150. In a Horn clause, if the antecedent contains multiple literals, it is known as a :

(A) Definite clause

(B) Disjunctive clause

(C) Fact

(D) Rule

Answer: (D)

No comments:

Post a Comment