Register

Ai Questions | DS-AI Paper | GATE 2024

413 views

1 Answer

Best answer
1 votes
1 votes
The maximum number of nodes expanded during a breadth-first search can be calculated using the following formula.

N = 1 + b + b² + ......+ b^d.

Given b=3         (b is branching factor)

d = 4.            (d is depth)

N = 1+ 3 + 3^2 + 3^3 + 3^4 = 121.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

399
views
0 answers
0 votes
rajveer43 asked Dec 11, 2023
399 views
GATE DS-AI questions | ML
Consider the feature transform z = [L0(x) L1(x) L2(x)]T with Legendre polynomials and the linear model h(x) = w T .z. For the regularized hypothesis with w = [−1 + 2 �...
User Avatar
444
views
1 answers
0 votes
rajveer43 asked Jan 16
444 views
AI Sample Question for DS-AI
Imagine you are guiding a robot through a grid-based maze using the A* algorithm. The robot is currently at node A (start) and wants to reach node B (goal). The heuristi...
User Avatar
306
views
1 answers
0 votes
rajveer43 asked Jan 16
306 views
UPENN | DS-AI Sample | Decision Tree
When choosing one feature from \(X_1, \ldots, X_n\) while building a Decision Tree, which of the following criteria is the most appropriate to maximize? (Here, \(H()\) me...
User Avatar
336
views
1 answers
0 votes
rajveer43 asked Jan 15
336 views
UPENN | ML Questions for GATE DA
In fitting some data using radial basis functions with kernel width $σ$, we compute training error of $345$ and a testing error of $390$.(a) increasing $σ$ will most li...
User Avatar
Link Copied!