Information Retrieval System MCQs with answers Page - 5

Here, you will find a collection of MCQ questions on Information Retrieval System. Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 828.03K Points
Coach

Q. Usability can be measured in terms of:

  • (A) intellectual skill to learn the system
  • (B) time required to become moderately efficient in system usage
  • (C) net increase in productivity
  • (D) all of the mentioned

A

Admin • 828.03K Points
Coach

Q. A graphical technique for finding if changes and variation in metrics data are meaningful is known as

  • (A) dre (defect removal efficiency)
  • (B) function points analysis
  • (C) control chart
  • (D) all of the mentioned

A

Admin • 828.03K Points
Coach

Q. Defects removal efficiency (DRE)depends on:

  • (A) e – errors found before software delivery
  • (B) d – defects found after delivery to user
  • (C) both e and d
  • (D) varies with project

A

Admin • 828.03K Points
Coach

Q. What’s the role of lyaopunov fuction?

  • (A) to determine stability
  • (B) to determine convergence
  • (C) both stability & convergence
  • (D) none of the mentioned

A

Admin • 828.03K Points
Coach

Q. Explanation: It is sufficient but not necessary condition.

  • (A) v(x) >=0
  • (B) v(x) <=0
  • (C) v(x) =0
  • (D) none of the mentioned

A

Admin • 828.03K Points
Coach

Q. What does cohen grossberg theorem?

  • (A) shows the stability of fixed weight autoassociative networks
  • (B) shows the stability of adaptive autoaassociative networks
  • (C) shows the stability of adaptive heteroassociative networks
  • (D) none of the mentioned

A

Admin • 828.03K Points
Coach

Q. What does cohen grossberg kosko theorem?

  • (A) shows the stability of fixed weight autoassociative networks
  • (B) shows the stability of adaptive autoaassociative networks
  • (C) shows the stability of adaptive heteroassociative networks
  • (D) none of the mentioned

A

Admin • 828.03K Points
Coach

Q. What does 3rd theorem that describe the stability of a set of nonlinear dynamical systems?

  • (A) shows the stability of fixed weight autoassociative networks
  • (B) shows the stability of adaptive autoaassociative networks
  • (C) shows the stability of adaptive heteroassociative networks
  • (D) none of the mentioned

A

Admin • 828.03K Points
Coach

Q. What happens during recall in neural networks?

  • (A) weight changes are suppressed
  • (B) input to the network determines the output activation
  • (C) both process has to happen
  • (D) none of the mentioned

A

Admin • 828.03K Points
Coach

Q. In nearest neighbour case, the stored pattern closest to input pattern is recalled, where does it occurs?

  • (A) feedback pattern classification
  • (B) feedforward pattern classification
  • (C) can be feedback or feedforward
  • (D) none of the mentioned