Home /UOS — University of Sargodha /Main Campus /Artificial Intelligence

Artificial Intelligence AD/BE/BSCS 6 Semester/Term UOS — University of Sargodha 2014

Artificial Intelligence AD/BE/BSCS 6 Semester/Term UOS — University of Sargodha 2014 — page 1

Discussion

Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.

Your email is only used to send you replies and occasional Ustadni updates. It is never shown publicly.

Log in to post under your name

No questions yet — be the first to ask.

Need Paper? See all →

Need a paper or stuck on a question? Ask here — students reply and you get an email.

Ask about a paper
  • Ayesha Mustafa· 5 days ago

    BS ZOOLOGY first semester Animal diversity ZOOL 101 - university of Punjab 2025

    0 replies Reply →
  • Abubakar· 5 days ago

    Literary criticism

    1 reply Reply →
  • Guest· 5 days ago

    this paper consists of 60 marks but now we have 35 marks paper.

    1 reply Reply →
  • Annie· 6 days ago

    Can you please tell me more past papers please because my exams are starting from next week

    1 reply Reply →
  • Ahmed· 10 days ago

    Did you provide the past papers of the science of society uos?

    1 reply Reply →

More Artificial Intelligence papers

See all

Paper text

Artificial Intelligence

Time: 90 Mins

Marks: 30

Mid Term

BSCS 6" (Reg &

April 26, 20

Choose nodes in alphabetically ascending order for questions 2 to

6. (where necessary)

Ustard hy state space graph for the SP problem given in below mentioned figure. (3)

2. Let A be the starting point and a Bai, US BREADTH FIRST SEARCH to hid the got ta,

3. Let A be the starting point and be the goal. Use DEPTH FIRST SEARS Ad the goal. (4)

4. Let A be the starting point and E be the goal. Use DEPTH LIMITED SEARCH to find the goal. Let

the depth be

2. [4]

5. Let A be the starting point and E be the goal. Use ITERATIVE DEEPENING SEARCH to find the

goal. [4]

6. Let A be the starting point and E be the goal. Use UNIFORM COST SEARCH to find the goal. (4)

7. Let the initial population be ABCDE, EDCBA, CDEAB, EDCBA. Perform a single crossover by

choosing the most fit and least fit candidate solution and generate the next generation that

would comprise of 50% most fit and 50% least fit candidates. (3]

8. Let the initial solution be ABCDE. Use hill climbing to improve the solution. Generate

neighboring solution by replacing one edge with another. (4)

5

ust

Eystani.pk

visit website: ustani.pk