About CS607P Assignment 1
CS607P Assignment No 1 for Fall 2026 is from Artificial Intelligence (Practical). It covers lesson 3: Lab # 03: Breadth First Search (BFS), carries 20 marks and is due on VULMS by 11:59 pm on Monday 9 November 2026. You can request the solution from this page.
- Course
- CS607P Artificial Intelligence (Practical)
- Assignment
- Assignment No 1
- Semester
- Fall 2026
- Lesson
- 3: Lab # 03: Breadth First Search (BFS)
- Total marks
- 20
- End date
- Mon 9 Nov, 11:59 pm
What CS607P Assignment 1 asks
This assignment requires students to analyze a provided directed graph to understand fundamental graph theory concepts and traversal algorithms. Students must perform basic graph analysis, including counting vertices, edges, and determining degrees. Additionally, the assignment involves applying Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms to the graph to compare their traversal behaviors. Students must document their findings in specific tables provided within the document.
-
1
Question 1 (Basic Graph Analysis)
6 marksExamine the directed graph to determine the total number of vertices and directed edges. Identify the in-degree of Vertex 3 and the out-degree of Vertex 4. Finally, count vertices with specific degree combinations and identify any vertex unreachable from Vertex 0.
-
2
Question 2 (Graph Traversal Using BFS and DFS)
14 marksApply BFS and DFS starting from Vertex 0, following specific rules for visiting adjacent vertices from left to right. Record the traversal order, vertices at depth 3, path lengths to Vertex 7, and the depth of Vertex 6 for both methods. Conclude by identifying the shortest path method, checking the visit status of Vertex 3, and counting total backtracks.
- What to submit
- One MS Word (Doc or Docx) file.
- Topics covered
- Directed graphs Breadth-First Search Depth-First Search Graph traversal In-degree and out-degree Shortest path analysis
A summary of the assignment file, Fall 2026_CS607P_1.docx. Download the file for the full wording before you start.
Lesson covered
The questions in this assignment come from this lesson. Read it in the CS607P handout before you open the assignment file, then practise it with the MCQs and past papers.
Solution
The solution has not been added yet. Request it from the download box and it will be added to this page, usually within a day.
Before you submit on VULMS
- 1 Start on the questions in the assignment file now. The solution will be added to this page once it is written.
- 2 Write the final answer in your own words. VU checks assignments for copying, and copied work gets zero marks.
- 3 Save your answer in the file type the assignment file asks for, and name it with your student ID, for example BC260012345.
- 4 Open the file once more to check it is not empty or corrupted, then upload it on VULMS before 11:59 pm on Mon 9 Nov.
Questions about this assignment
When is CS607P Assignment 1 due?
Monday 9 November 2026 at 11:59 pm. VULMS does not accept files after the deadline.
When will the solution be added?
Most solutions are up within a day of a request. Requests tell us which ones to write first, and 0 students have asked for this one so far.
Can I submit the solution as it is?
No. VU checks assignments for copying, and copied work gets zero marks. Use the solution to check your method, then write your own answer.
What file do I submit?
The assignment file says which file type to upload and lists any extra instructions from your instructor. Name the file with your student ID before you upload it on VULMS.