Bihar STET Computer Science – Artificial Intelligence Set 2

Questions 31-35 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 31

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 03.11.2025 (Shift-I) PYQ

In First-Order Logic, the process of eliminating existential quantifiers by replacing them with fresh function symbols is known as:

Answers for question 31

Question 32

MCQ · Single Correct 1 mark

In a Hidden Markov Model (HMM), which algorithm efficiently computes the most likely sequence of hidden states given an observed sequence?

Answers for question 32

Question 33

MCQ · Single Correct 1 mark

In an HMM, the Forward Algorithm is primarily used to compute:

Answers for question 33

Question 34

MCQ · Single Correct 1 mark

Which algorithm is used for unsupervised parameter estimation (training) in Hidden Markov Models?

Answers for question 34

Question 35

MCQ · Single Correct 1 mark

Laplace Smoothing (Add-One Smoothing) is applied in Naive Bayes text classification to:

Answers for question 35
Scroll to Top