Aspire Faculty ID #18862 · Topic: UGC NET Computer Science Nov 2021 (Paper II) · Just now
UGC NET Computer Science Nov 2021 (Paper II)

Given below are two statements

Statement I: Breadth-First Search is optimal when all the step costs are equal whereas uniform-cost search is optimal with any step-cost.
Statement II: When all the step costs are same uniform-cost search expands more nodes at depth $d$ than the Breadth-First Search.
In light of the above statements, choose the correct answer from the options given below.

Solution

Utility-based agent works with utility value.

Utility value tells how good or bad a state is for the agent.

A happy state means higher utility.

An unhappy state means lower utility.

So, the agent that deals with happy and unhappy states is Utility-based agent.Breadth-First Search gives optimal solution when all step costs are equal.

Uniform-cost search gives optimal solution when step costs may be different but non-negative.

So, Statement I is true.

When all step costs are same, Uniform-cost search behaves like Breadth-First Search.
It expands nodes in increasing path-cost order, which becomes same as increasing depth order.
So, it does not expand more nodes at depth $d$ than Breadth-First Search.
Therefore, Statement II is false.

Previous 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)

Nearest first
1
Which agent deals with the happy and unhappy state?
Topic: UGC NET Computer Science Nov 2021 (Paper II)
2
In the following table, the left column contains the names of standard graph algorithms and the right column contains t…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
3
A hash function $h$ defined as $h(key)=key\ mod\ 7$, with linear probing, is used to insert the keys $44,45,79,55,91,18…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
4
The order of a leaf node in a $B+$ tree is the maximum number of value, data record pointer pairs it can hold. Given th…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
5
 Which of the given options provides the increasing order of asymptotic complexity of functions $f_1,\ f_2,\ f_3$ …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
6
Given below are two statementsStatement I: In an undirected graph, number of odd degree vertices is even.Statement II: …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
7
Consider the following graph.Among the following sequencesI. $a\ b\ e\ g\ h\ f$II. $a\ b\ f\ e\ h\ g$III. $a\ b\ f\ h\ …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
8
A data structure is required for storing a set of integers such that each of the following operations can be done in $O…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
9
Two balanced binary trees are given with $m$ and $n$ elements, respectively. They can be merged into a balanced binary …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
10
A double-ended queue (deque) supports adding and removing items from both ends of the queue. The operations supported b…
Topic: UGC NET Computer Science Nov 2021 (Paper II)

Next 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)

Ascending by ID
1
Consider the given tree below. Calculate the value at the root of the tree using alpha‐beta pruning algorithm.
Topic: UGC NET Computer Science Nov 2021 (Paper II)
2
Which among the following statement(s) is(are) FALSE?A. Greedy best-first search is not optimal but is often efficient.…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
3
Consider the sentence below.There is a country that borders both India and Pakistan.Which of the following logical expr…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
4
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
5
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
6
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
7
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
8
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
9
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
10
Consider following two statements:Statement I: Relational database schema represents the logical design of the database…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Ask Your Question or Put Your Review.

loading...