Lecture Notes for CS 246 - Data & File Structures with Ghemri at Texas Southern University (TSU)

Notes Information

Material Type:Class Note
Class:CS 246 - Data & File Structures
Subject:Computer Science
University:Texas Southern University
  • Arrangement
  • Salesperson
  • Initial State
  • Time Complexity
  • Formulation
  • Alternatives
  • In Front Of
Login / Sign Up to View Document
Preview Page 1Preview Page 2Preview Page 3Preview Page 4Preview Page 5Preview Page 6

Sample Document Text

Trees and Search Strategies and Algorithms -- Reference: Dr. Franz J. Kurfess Computer Scien epartment Science Department Cal Poly Basic Search Strategies - depth-first - breadth-first . exercise - apply depth-first to finding a path from this buildin to our favorite "feedin station" gy g (McDonalds, Jason Deli, Pizza Hut) . is this task sufficiently specified . is success guaranteed . how long will it take . could you remember the path you . how good is the solution Motivation . search strategies are important methods for many approaches to problem-solving . the use of sear requires an abstract search formulation of the problem and the available steps to constru olutions construct solutions . search algorithms are the basis for many ti i ti d l i th dop m za on an p ann ng me o s Objectives . formulate appropriate problems as search tasks as search - states, initial state, goal state, successor functions (operators), cost . know the fundamental search s...

Related Documents

Better Representation Notes
155, "/var/app/current/tmp/"