We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

Please discuss here

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 816

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Replies to This Discussion

By Qatil

MY TODAY QUIZ CS607 - Artificial Intelligence

1) Mutation can be as simple as just flipping a bit at random or any number of bits
Ans: True

2) In DFS search(es), we only have one agent searching solution space to find goal state

3) In ______ search(es), we only have one agent searching solution space to find goal state

4) In progressive depending, the idea is to simply apply DFS to a specific

5) _________ is branch and bound technique with the improvement of underestimates and dynamic programming

6) “In context of Hill climbing algorithm, situation may arise when a step in one direction takes you lower, on the other hand when you step in some other direction it gives you no improvement.” The above statement refers to

7) “In context of Hill climbing algorithm, a person may reach the portion of a mountain which is totally flat, whatever step he takes gives him no improvement in height hence he gets stuck.” The above statement refers to

8) There are many techniques to solve our problem of optimal search without using a brute force technique; one such procedure is called

9) In ____ search, out of ”n” possible choices at any level, we follow only the best "k" of them

10) Genetic algorithm uses evolutionary techniques, based on function optimization and artificial intelligence, to develop a solution
Ans: True

11) Alpha beta pruning relates to
Ans: Minimax

Please all students related this subject Share your online Quizzes here to help each other.thanks

 

Please share the question and their answers of this quiz if anyone has done.
Thanks.

RSS

© 2020   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.