Monday 23, June, 2025
Tuesday 24, June, 2025
Assignment No. 02
Spring 2025
CS502- Fundamentals of Algorithms
|
Instructions Please read the following instructions carefully before solving & submitting assignment: It should be clear that your assignment will not get any credit (zero marks) if: Ø The assignment is submitted after the due date. Ø The submitted assignment is other than MS Word file. Ø The submitted assignment does NOT open, or file is corrupted.
Uploading instructions
· For clarity and simplicity, you are required to upload/submit only one .doc/docx file. Lectures:
· Lectures 24 to 28 are covered in this assignment.
Objectives
· The objectives of this assignment are:
Ø To be able to understand the concept of Graphs and Adjacency list. Ø To be able to understand the concept of In-Degree and Out-Degree.
For any query about the assignment, contact at CS502@vu.edu.pk |
|
Question No. 1 Marks: 05 The following Graph shows the road connections among four cities labeled as A, B, C, and D. Your task is to create an adjacency list to accurately represent it. Note: You can either use MS word/Any tool for creating the adjacency list OR you can draw it on paper and paste the image in solution. |
|
Question No. 2 Marks: 5 + 5 = 10 List down In and Out- Degrees of vertices of the given directed graph.
|
|
|
VuPark
Approved
Wednesday 18, June, 2025