CS502 Assignment 3 Solution and Discussion


  • Cyberian's Gold

    Assignment No. 03
    SEMESTER Fall 2019
    CS502- Fundamentals of Algorithms
    Total Marks: 20

    Due Date: 15/01/2020
    Instructions
    Please read the following instructions carefully before solving & submitting assignment:
    It should be clear that your assignment will not get any credit if:
    • The assignment is submitted after due date.
    • The submitted assignment does not open or file corrupt.
    • The assignment is fully or partially copied from (other student or ditto copy from handouts or internet).
    • Student ID is not mentioned in the assignment File or name of file is other than student ID.
    • The assignment is not submitted in .doc or .docx format.
    Uploading instructions
    Your submission must include:

    • Assignment should be in .doc or .docx format.
    • Save your assignment with your ID (e.g. bx180200786.doc).
    Assignment submission through email is NOT acceptable
    Objective
    The objective of this assignment is
    • To give basic knowledge and understanding of Graphs.
    • To develop the understanding between adjacency list and adjacency matrix representations.

    Note:
    Your answer must follow the below given specifications.
    • Font style: “Times New Roman”
    • Font color: “Black”
    • Font size: “12”
    • Bold for heading only.
    • Font in Italic is not allowed at all.
    • No formatting or bullets are allowed to use.
    • Your answer should be precise and to the point, avoid irrelevant detail.

    Lectures Covered: This assignment covers Lecture # 28
    Deadline
    Your assignment must be uploaded/submitted at or before 15/01/2020.

    Assignment Statement:

    Everywhere we see objects and some sort of interaction between them. If we are needed to model this connection or relationship between them, the graphs is a good way to model it.
    A graph G = (V, E) consists of a finite set of vertices V (or nodes) and E, a binary relation on V called edges. E is a set of pairs from V. If a pair is ordered, we have a directed graph. For unordered pair, we have an undirected graph.
    There are two ways of representing graphs: using an adjacency matrix and using an adjacency list.

    Question No 01: (Marks: 10)

    Draw an undirected Graph for the following Adjacency list representation as given below,

    e5754efc-b6bf-4975-8417-d71e6c4945d6-image.png

    Question No 02: (Marks: 10)

    Draw a directed graph for the following matrix format representation,
    15a35cf7-f143-437f-897d-7c03d0cd4980-image.png

    =====================================Ended=======================================

    For any query about the assignment, contact at [email protected]

    GOOD LUCK


  • Cyberian's Gold

    Q.1 Answer
    09060a11-e58a-4510-b329-9e0ee2e4ea71-image.png

    Q.2 Answer
    3cd1afd9-1b1a-40ab-b8e3-96784cc3c253-image.png


  • Cyberian's Gold

    efe5770e-b8a4-420f-aa98-3a15db0dfc4f-image.png

    99abdf7f-c9c2-4f9d-b09e-5acd87686969-image.png


  • Cyberian's Gold


  • Cyberian's Gold


  • Cyberian's Gold


  • Cyberian's Gold



    Recent Topics


| DMCA.com Protection Status