<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>DCA6108 DISCRETE MATHEMATICS &amp; GRAPH THEORY &#8211; MUJ ASSIGNMENT </title>
	<atom:link href="https://muj.assignmentsupport.in/product-tag/dca6108-discrete-mathematics-graph-theory/feed/" rel="self" type="application/rss+xml" />
	<link>https://muj.assignmentsupport.in</link>
	<description>MUJ ASSIGNMENT SUPPORT</description>
	<lastBuildDate>Sat, 02 May 2026 22:17:33 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.0</generator>

<image>
	<url>https://i0.wp.com/muj.assignmentsupport.in/wp-content/uploads/2025/05/cropped-LOGO-JPG-1.jpg?fit=32%2C32&#038;ssl=1</url>
	<title>DCA6108 DISCRETE MATHEMATICS &amp; GRAPH THEORY &#8211; MUJ ASSIGNMENT </title>
	<link>https://muj.assignmentsupport.in</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">243817679</site>	<item>
		<title>DCA6108 DISCRETE MATHEMATICS &#038; GRAPH THEORY JAN FEB 2026</title>
		<link>https://muj.assignmentsupport.in/product/dca6108-discrete-mathematics-graph-theory/</link>
		
		<dc:creator><![CDATA[dEEpak]]></dc:creator>
		<pubDate>Tue, 22 Apr 2025 08:11:33 +0000</pubDate>
				<guid isPermaLink="false">https://muj.assignmentsupport.in/?post_type=product&#038;p=1626</guid>

					<description><![CDATA[<strong><span lang="EN-IN">Match your questions with the sample provided in description</span></strong>

<strong><span lang="EN-IN">Note:</span></strong><span lang="EN-IN"> Students should make necessary changes before uploading to avoid similarity issues in Turnitin.</span>

<strong><span lang="EN-IN">If you need unique assignments</span></strong>

<span lang="EN-IN">Turnitin similarity between 0 to 20 percent
Price is 700 per assignment
Buy via WhatsApp at 8791514139</span>]]></description>
										<content:encoded><![CDATA[<body><table width="624">
<tbody>
<tr>
<td width="218"><strong>SESSION</strong></td>
<td width="406"><strong>JAN FEB 2026</strong></td>
</tr>
<tr>
<td width="218"><strong>PROGRAM</strong></td>
<td width="406"><strong>MASTER OF COMPUTER APPLICATIONS (MCA)</strong></td>
</tr>
<tr>
<td width="218"><strong>SEMESTER</strong></td>
<td width="406"><strong>I</strong></td>
</tr>
<tr>
<td width="218"><strong>COURSE CODE &amp; NAME</strong></td>
<td width="406"><strong>DCA6108  DISCRETE MATHEMATICS &amp; GRAPH THEORY</strong></td>
</tr>
<tr>
<td width="218"> </td>
<td width="406"> </td>
</tr>
<tr>
<td width="218"> </td>
<td width="406"> </td>
</tr>
</tbody>
</table>
<p> </p>
<p><strong> </strong></p>
<p><strong>Assignment Set – 1</strong></p>
<p> </p>
<p> </p>
<p><strong>Q.1. Find the inverse of the matrix A=  using the adjoint method. (10 Marks)</strong></p>
<p> </p>
<p><strong>Ans 1.</strong></p>
<p> </p>
<p><strong>Matrix Inverse Using Adjoint Method</strong></p>
<p>The concept of the inverse of a matrice is an essential concept in linear algebra, with numerous applications in solving linear equations in systems, computers, cryptography, and analysis of networks. If a matrix is square, of order n, the inverse exists only when the determinant of A is non-zero. A matrix like this is referred to as invertible or non-singular. The approach of the adjoint is an organized algebraic strategy for finding the inverse, without relying upon row</p>
<p> </p>
<p><strong>MUJ</strong></p>
<p>Its Half solved only</p>
<p>Buy Complete assignment from us</p>
<p><strong>Price – 190/  assignment</strong></p>
<p><strong>MUJ Manipal University</strong> <strong>Complete SolvedAssignments  JAN- FEB  2026</strong></p>
<p>buy cheap assignment help online from us easily</p>
<p>we are here to help you with the best and cheap help</p>
<p><strong>Contact No –</strong> <strong>8791514139</strong><strong> (WhatsApp)</strong></p>
<p><strong>OR</strong></p>
<p><strong>Mail us-  </strong><a href="mailto:bestassignment247@gmail.com">bestassignment247@gmail.com</a></p>
<p><strong>Our website – </strong><a href="https://muj.assignmentsupport.in/">https://muj.assignmentsupport.in/</a></p>
<p><strong>JAN-FEB 2026</strong></p>
<p> </p>
<p> </p>
<p> </p>
<p><strong>Q.2. Use Gauss’s Elimination Method to solve: x – 2y = -4, -5y + z = -9, 4x – 3z = -10. (10 Marks)</strong></p>
<p><strong>Ans 2. </strong></p>
<p><strong>Gauss Elimination Method </strong></p>
<p>Gauss Elimination is one of the most popular direct methods for solving systems that are linear in nature. It is named after the German mathematician Carl Friedrich Gauss and transforms a particular system into an upper triangular structure using the simplest row operations. These include swapping between two rows, multiplying a row with a non-zero scalar and subtracting or adding a multiple of one row from the other. These operations do not alter the algorithmic</p>
<p> </p>
<p> </p>
<p><strong>Q.3. Let f:A→B, g:B→C, and h:C→D. If f(x) = x+1, g(y) = y², and h(z) = √z, find the composition h∘g∘f(x). Also, check the bijectiveness of mappings. (10 Marks)</strong></p>
<p><strong>Ans 3. </strong></p>
<p><strong>Function Composition and Bijectiveness </strong></p>
<p>In math, a function creates a relationship between two sets such that each of the domain is exactly one element in the codomain. Composition of functions can be described as an option of mixing multiple functions, so that the output of one function becomes the input of the following. For functions like f:A and B and the g:B function to C and C, the composition made with f is</p>
<p> </p>
<p> </p>
<p><strong> </strong></p>
<p><strong>Assignment Set – 2</strong></p>
<p> </p>
<p> </p>
<p><strong>Q.4. Demonstrate that (p ∧ (q ∨ r)) ≡ ((p ∧ q) ∨ (p ∧ r)). (10 Marks)</strong></p>
<p> </p>
<p><strong>Ans 4.</strong></p>
<p> </p>
<p><strong>Theory: Distributive Law in Propositional Logic</strong></p>
<p>Propositional logic is a branch of logic which deals with propositions. They’re statements that can be taken as true or false. Logical connectives like conjunction (AND) and disjunction (OR) negation (NOT), implication, and biconditional can be used to make compound propositions out of simple ones. Two complex propositions are considered to be logically similar if they have identical the truth value for every combination of the truth values of their component propositions. Equivalence is denoted by the symbol of the triple bar or the double implication</p>
<p><strong> </strong></p>
<p><strong> </strong></p>
<p><strong>Q.5. The marks scored by students in a test are as follows: [0-20: 6], [20-40: 10], [40-60: 15], [60-80: 8], [80-100: 4]. Find the median marks. (10 Marks)</strong></p>
<p> </p>
<p><strong>Ans 5.</strong></p>
<p> </p>
<p><strong>Theory: Median for Grouped Data</strong></p>
<p>The median is a measure of central tendency that represents the middle-point for a set of data points when they are arranged in an order. For grouped frequency distributions, the median does not just represent an observation in the middle, but calculated using a statistical formula that takes into account the classes interval, the cumulative frequencies as well as the class that contains the median. It divides the frequency distribution into two equal portions and fifty</p>
<p><strong> </strong></p>
<p><strong>Q.6. What is a connected graph? What is a cycle in a graph? (10 Marks)</strong></p>
<p> </p>
<p><strong>Ans 6.</strong></p>
<p><strong>Connected Graph</strong></p>
<p>The field of Graph Theory is one of discrete maths which studies graphs, which are mathematical models composed of vertices (also known as nodes) as well as edges (also known as arches) which connect two vertices. Graphs are used to model connections and networks within diverse disciplines, such as computer networks social media, transportation systems electrical circuits, as</p>
</body>]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">1626</post-id>	</item>
	</channel>
</rss>
