Scribd
Upload
4 views1 page

Math Assignment

This document is an assignment for the Discrete Mathematics and Graph Theory course at JSS Academy of Technical Education. It outlines the course details, including outcomes related to graph theory, and lists five questions for students to answer. The assignment is due on January 29, 2026, and covers concepts such as Eulerian and Hamiltonian graphs.

Uploaded by

80nishantvatsyayan
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

Math Assignment

This document is an assignment for the Discrete Mathematics and Graph Theory course at JSS Academy of Technical Education. It outlines the course details, including outcomes related to graph theory, and lists five questions for students to answer. The assignment is due on January 29, 2026, and covers concepts such as Eulerian and Hamiltonian graphs.

Uploaded by

80nishantvatsyayan
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

USN:

JSS ACADEMY OF TECHNICAL EDUCATION


JSS Campus, Dr. Vishnuvaradhan Road, Bengaluru -60
Department of Mathematics
Assignment – 1

----------------------------------------------------------------------------------------------------------------------------- ------------
Course Name: Discrete Mathematics and Graph Theory Maximum Marks:10
Course code: MMC102
Course year (Term): 2025-26 Odd Semester
Course Faculty Name: Roopini R
Announcement Date:09-01-2026
Submission Date: 29-01-2026

COURSE OUTCOMES COVERED IN THIS QUIZ


Bloom’s
CO# Course Outcome level
CO 3 Solve the problems by applying the basic concepts of Graph theory. L3
Utilize Eulerian and Hamiltonian graphs to solve problems in
CO 4 L3
Computer Networks

Answer the following questions.

Q.
CO# Answer the following questions BLL
No
Define Simple graph, multi graph, finite graph, infinite graph, connected
CO3 1 L2
graph and disconnected graph.
CO4 2 Define Euler path and Euler Circuit L2
CO4 3 Is every Eulerian graph Hamiltonian? Justify with example. L3
CO4 4 Give an example of a graph which is Hamiltonian but not Eulerian. L2
CO4 5 Applications of graph theory in computer networks L3

You might also like