Back to Other Questions [Of this Course]
👁️ 53 views
University of Barishal Logo

University of Barishal

Department of Computer Science and Engineering

2nd Mid Exam

Course Title: Artificial Intelligence (CSE-3205)

Semester: 6th | Session: 20-21

Time: 50 minutes | Marks: 20.00

Course Teacher: Dr. Tania Islam

View 52 Topic-wise Questions for this Course
1.
Scenario Image

1) Perform Breadth-First Search (BFS) starting from node A. List the order in which nodes are visited.

Please SUBSCRIBE to view full question

Topics: Breadth First Search (BFS) , Graph Algorithms , Searching Techniques Solution is Coming!
5 Marks
2) Using A* algorithm, find the shortest path from A to F. Assume the heuristic (straight-line distance to F) is: h(A)=5, h(B)=4, h(C)=2, h(D)=6, h(E)=3, h(F)=0 Show your step-by-step calculation, including f(n)=g(n)+h(n).

Please SUBSCRIBE to view full question

Topics: A* Algorithm , Informed Search / Heuristic Search Solution is Coming!
5 Marks
3) Draw the final search tree showing the paths explored by A*.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
5 Marks
4) Explain which algorithm (BFS or A*) is more efficient in this case and why.

Please SUBSCRIBE to view full question

Topics: N/A Solution is Coming!
5 Marks
View 52 Topic-wise Questions for this Course

Contributors of this Question:

Role Name Date
Prepared By (Teacher): Dr. Tania Islam N/A
Uploaded By: Sabii Ha Sept. 21, 2025, 7:54 p.m.
Converted By (Img/PDF to Text): Nahare Jannat Nov. 23, 2025, 1:42 p.m.
Reviewed By: Obaydul Hasan Nayeem Nov. 23, 2025, 2:05 p.m.
Back to Other Questions [Of this Course]