Scribd
Upload
43 views3 pages

Sesesa

The document provides instructions for an assignment on artificial intelligence. It outlines the rules for marking, how to upload assignments, and objectives. The assignment involves drawing a tree based on given nodes and labels, traversing the tree using breadth-first search to find a target node, and converting an undirected tree to an undirected graph. No assignments will be accepted after the deadline and students should consult the instructor if there are any issues or mistakes.

Uploaded by

Raja Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
43 views3 pages

Sesesa

The document provides instructions for an assignment on artificial intelligence. It outlines the rules for marking, how to upload assignments, and objectives. The assignment involves drawing a tree based on given nodes and labels, traversing the tree using breadth-first search to find a target node, and converting an undirected tree to an undirected graph. No assignments will be accepted after the deadline and students should consult the instructor if there are any issues or mistakes.

Uploaded by

Raja Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Artificial Intelligence (CS607) Total marks = 20

Assignment # 01 Deadline
th
16 of November
Fall 2023 2023

Please carefully read the following instructions before attempting the assignment.

RULES FOR MARKING


It should be clear that your assignment would not get any credit if:
 The assignment is submitted after the due date.
 Strict action will be taken if the submitted solution is copied from any other student or the internet.

You should consult the recommended books to clarify your concepts as handouts are not sufficient.

UPLOADING INLINE ASSIGNMENT INSTRUCTION


Follow the given instructions to submit Inline assignments:
Microsoft Word (doc/docx) and Adobe Acrobat (pdf) file uploading options will not be available in inline
assignment submission.
 Students can submit HTML, Images, and plain text only in this inline Mode. You may also insert an image
file/table.
 Students can insert the images or snapshots in the following formats.

 Images and tables can be inserted using the following highlighted option in the interface .

OBJECTIVE
The objective of this assignment is to:
 Learn and practice basic concepts of Graph and tree Data Structure with traversing techniques.

Lecture # 01 till Lecture # 11


NOTE

No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding
or internet malfunctioning etc.). Hence refrain from uploading assignments in the last hour of the deadline. It is
recommended to upload the solution at least two days before its closing date.

If you people find any mistake or confusion in the assignment (Question statement), please consult with your
instructor before the deadline. After the deadline, no queries will be entertained in this regard.

For any query, feel free to email me at:


cs607@vu.edu.pk
Questions No. 01 10 Marks
State the situation in which BFS applied and also draw a tree data structure for the given
nodes. You are required to traverse the tree and state the path as per BFS with height 4. The
nodes and height of the tree are given as:
Given Data:
Number of nodes =12
Number of Tree Levels= 4
Nodes Labeling: 1, 2, 7, 8, 3, 6, 9, 12, 4, 5, 10, 11 (Target Node)
You are required to draw a tree for path searching using BFS.
Required:
 Reason for using BFS
 Number of Nodes in Operation
 Levels of Tree
 Path of Tree
 Last Node / Target Node of Tree

Solution:

 Finding the Shortest Path


 Traversing Trees or Graphs with Uniform Cost
 Finding the Connected Components of a Graph
 Optimality of Solution (Solving complex puzzle problems)

1 Level 0

2 Level 1
7 8

9 12 Level 2
3 6

10 11 Level 3
4 5
Questions No. 02 10 Marks
Convert the mentioned below undirected Tree into an undirected Graph.

Undirected Tree:
1

3
2

7
6
4 5

Undirected Graph:

2 5

3 7
1

4
6

Wish you the very best of Luck!

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy