Let $G$ be a simple, unweighted, and undirected graph. A subset of the vertices and edges of $G$ are shown below.
It is given that $a-b-c-d$ is a shortest path between $a$ and $d ; e-f-g-h$ is a shortest path between e and $h ; a-f-c$ - $h$ is a shortest path between $a$ and $h$. Which of the following is/are NOT the edges of $G$ ?Which of the following statements is/are correct in a Bayesian network?
The state graph shows the action cost along the edges and the heuristic function $h$ associated with each state.
Suppose A* algorithm is applied on this state graph using priority queue to store the frontier. In what sequence are the nodes expanded?
Consider a hash table of size 10 with indices $\{0,1, \ldots, 9\}$, with the hash function
$$ h(x)=3 x(\bmod 10) $$
where linear probing is used to handle collisions. The hash table is initially empty and then the following sequence of keys is inserted into the hash table: 1 , $4,5,6,14,15$. The indices where the keys 14 and 15 are stored are, respectively
GATE Data Science and Artificial Intelligence Papers
All year-wise previous year question papers