HW 1 Solution [CS 6613 Fall 2013] - CS 6613 HW 1 Solution Fall 2013 E K Wong Total Points = 84 1[9 points(3 points each(a LIFO queue(or stack(b FIFO

HW 1 Solution [CS 6613 Fall 2013] - CS 6613 HW 1 Solution...

This preview shows page 1 - 2 out of 2 pages.

CS 6613 Fall 2013 HW 1 Solution E. K. Wong 1 Total Points = 84 1. [9 points] (3 points each) (a) LIFO queue (or stack) (b) FIFO queue (c) queue ordered in increasing order of path cost. (Alternate answer to part (b), if one of the searches is done by breadth-first search and the other is done by iterative deepening, then both FIFO and LIFO queues are used.) 2. [5 points] (a) Reflex agent. 3. [10 points] (3 points each) (a) {A,B,C,D,E,F,G,H} (b) {C,D,E,F,G,H} (c) {F,G,H} 4 . [10 points] (a) (5 points) Iterative Deepening Search; (b) (5 points) Time complexity= O ( b d ) ; Space complexity= O ( bd ) ; b is worst-case branching factor and d is level of shallowest solution. 5. [20 points] See page 2.

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture