Scribd
Upload
34 views3 pages

Fall 2023 - CS607 - 1

The document provides instructions for Assignment #01 in an Artificial Intelligence course. It covers rules for marking, uploading instructions, objectives of the assignment, lectures covered, and notes. The assignment contains 2 questions worth 10 marks each. Question 1 asks students to apply breadth-first search (BFS) on a given tree structure with 11 nodes and draw the tree, stating the path and target node. Question 2 asks students to convert an undirected tree into an undirected graph. The deadline for submission is November 15, 2023.

Uploaded by

Javeria Fayyaz
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
34 views3 pages

Fall 2023 - CS607 - 1

The document provides instructions for Assignment #01 in an Artificial Intelligence course. It covers rules for marking, uploading instructions, objectives of the assignment, lectures covered, and notes. The assignment contains 2 questions worth 10 marks each. Question 1 asks students to apply breadth-first search (BFS) on a given tree structure with 11 nodes and draw the tree, stating the path and target node. Question 2 asks students to convert an undirected tree into an undirected graph. The deadline for submission is November 15, 2023.

Uploaded by

Javeria Fayyaz
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
15 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.

Lectures Covered in Assignment no 1


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:


[email protected]
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 =11
Number of Tree Levels= 3
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

Questions No. 02 10 Marks


Convert the mentioned below undirected Tree into an undirected Graph.

Undirected Tree:
1

3
2

7
6
4 5
Wish you the very best of Luck!

You might also like