P

Priyanka Tomar • 35.28K Points
Coach

Q. Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?

  • (A) the boundary is defined as those nodes in closed that have at least one successor still in open
  • (B) the nodes in closed that are not on the boundary are in the kernel
  • (C) the number of relay nodes on each path is exactly one.
  • (D) both a & b
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. These objects can be realized as parallel process with method corresponding to defined object operations.

Q. Why are Patterns important?

Q. At which time does the static_cast can be applied?

Q. Floyd Warshall’s Algorithm is used for solving

Q. Which of the following are the cheapest memory devices in terms of Cost/Bit?

Q. Which of the following explains Cookies nature?

Q. Does network layer in TCP/IP and OSI Model are same.

Q. The task environment of organizations consists of constituencies that have a direct impact on managers’ decisions and actions The main constitue

Q. The following SQL is which type of join: SELECT CUSTOMER_T. CUSTOMER_ID, ORDER_T. CUSTOMER_ID, NAME, ORDER_ID FROM CUSTOMER_T,ORDER_T WHERE CUSTOMER_T

Q. A deadlock avoidance algorithm dynamically examines the to ensure that a circular wait condition can never exist.

Question analytics