.::VULMSIT::.eNoxel cs607 100% solved Quiz ............

Question # 1 of 10 ( Start time: 12:15:40 PM ) Total Marks: 1
In the worst case of semantic network, we may need to traverse the
entire network and then discover that the requested info ________.
Select correct option:

Does not exist (Answer)

Exists

Is incorrect

Is correct








Question # 2 of 10 ( Start time: 12:16:41 PM ) Total Marks: 1
A function by which we can tell which board position is nearer to our
goal is called
Select correct option:

Alternative function

Recursive function

Best function

Fitness function(Answer)







Question # 3 of 10 ( Start time: 12:17:27 PM ) Total Marks: 1
Procedures that search the solution space in an uninformed manner are
usually costly with respect to ___________.
Select correct option:

Time

Space

Time and space both

All of the given(Answer)








Question # 4 of 10 ( Start time: 12:18:26 PM ) Total Marks: 1
Best first search is a greedy approach.
Select correct option:

True (Answer)
False









Question # 5 of 10 ( Start time: 12:18:53 PM ) Total Marks: 1
Semantic networks are graphs, with nodes representing ____________ and
arcs representing ____________ between objects.
Select correct option:

distance, relationships

objects, distance

relationships, distance

objects, relationships(Answer)







BC080201420 : Muhammad Nadeem



Quiz Start Time: 12:15 PM Time Left 46
sec(s)


Question # 6 of 10 ( Start time: 12:19:49 PM ) Total Marks: 1
What is the correct order for solving a problem using GA I. Choose the
best individuals from the population for crossover II. Choose initial
population III. Evaluate the fitness of each individual
Select correct option:

I,II,III

I,III,II

II,I,III

II,III,I(Answer)









Question # 7 of 10 ( Start time: 12:20:40 PM ) Total Marks: 1
In GA, the random process is repeated until an individual with
required _________ level is found.
Select correct option:

Higher

Lower

Fitness(Answer)

Logical





Question # 8 of 10 ( Start time: 12:21:05 PM ) Total Marks: 1
We can get optimal solution given some parameters using Genetic Algorithm.
Select correct option:

True(Answer)

False






Question # 9 of 10 ( Start time: 12:22:03 PM ) Total Marks: 1
Genetic Algorithms is a search method in which multiple search paths
are followed in _______.
Select correct option:

Series

Parallel(Answer)

None of the given

Sequential






Question # 10 of 10 ( Start time: 12:22:32 PM ) Total Marks: 1
Mutation can be as simple as just flipping a bit at random or any
number of bits
Select correct option:

True(Answer)

False

--

***Teri rehmaton Py Ha Munhasir Meri Har Amal ki Qaboolilyat***

*** Na Mujhy Saleeqa E iltija Na Mujhy Shaoor e NIMAZ Ha***

\

 Remember me in ur prayers

MCS 4th semester

Allah bless us Always

Ameen

--
Virtual University of Pakistan*** IT n CS Blog
================================
http://www.geniusweb.tk
 
http://itncs.tk
 
 
You received this message because you are subscribed to the Google
Groups "vulms" group.
To post to this group, send email to vulmsit@googlegroups.com
To unsubscribe from this group, send email to
vulmsit+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vulmsit?hl=en?hl=en