Scribd Logo
Upload

Welcome to Scribd!

  • S1-21 (HCL) DSCS - Assignment 2

    Uploaded by

    mohit kumar
    2 views1 page
    This document provides instructions for Assignment 2 which is due between January 11th and 25th. Students must answer questions about Fibonacci relations using generating functions, analyze graphs for Euler paths/cycles and Hamiltonian paths/cycles, discuss the connectedness of the graphs, and determine which graphs are isomorphic - all in handwritten format to be scanned and uploaded. Plagiarism is not allowed and may result in penalties.

    Original Description:

    Discrete Structures for Computer Science

    Original Title

    S1-21(HCL);DSCS_Assignment 2

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides instructions for Assignment 2 which is due between January 11th and 25th. Students must answer questions about Fibonacci relations using generating functions, analyze graphs for Euler paths/cycles and Hamiltonian paths/cycles, discuss the connectedness of the graphs, and determine which graphs are isomorphic - all in handwritten format to be scanned and uploaded. Plagiarism is not allowed and may result in penalties.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views1 page

    S1-21 (HCL) DSCS - Assignment 2

    Uploaded by

    mohit kumar
    This document provides instructions for Assignment 2 which is due between January 11th and 25th. Students must answer questions about Fibonacci relations using generating functions, analyze graphs for Euler paths/cycles and Hamiltonian paths/cycles, discuss the connectedness of the graphs, and determine which graphs are isomorphic - all in handwritten format to be scanned and uploaded. Plagiarism is not allowed and may result in penalties.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Assignment 2( 8 Marks)

    11th – 25th January 2020


     Answer the questions (Handwritten), scan and upload them in Canvas
     Plagiarism results in necessary action

    1). Using Generating Function, find the solution of Fibonacci relation (2 Marks)

    2). Consider the following Graphs and answer the questions given below. (Justify your
    answers)

    (i) For each graph discuss Euler path, Euler cycle /circuit, Hamiltonian path and
    Hamiltonian Cycle/Circuit. And find Euler Graph and Hamiltonian Graph.
    Justify your answers. (2 Marks)
    (ii) Discuss the connectedness of the above Graphs. (2 Marks)
    (iii) Which of the given graphs are isomorphic? (2 Marks)

    XXXXXXXXXX

    You might also like