Questions with Complete Solutions - Hamro CSIT

Solve the recurrence relation\[a_n = a_{n-1} + 2a_{n-2}\]with\[
a_0 = 2 \quad \text{and} \quad a_1 = 7.
\]

Not Answered Discrete Structure Asked on 2082 Exam

What are the necessary conditions for a graph to be isomorphic? List and illustrate with an example.

Not Answered Discrete Structure Asked on 2082 Exam

Define well ordering property. Find the multiplicative inverse of 7 modulo 19 using Extended Euclidean Algorithm.

Not Answered Discrete Structure Asked on 2082 Exam

What is the negation of “This is a boring course”? Give a direct proof for the statement: “If n is even, then n + 4 is even.”

Not Answered Discrete Structure Asked on 2082 Exam

Suppose that R is the relation on the set of strings of English letters such that aRb if and only if L(a) = L(b), where L(x) is the length of the string x. Is R an equivalence relation?

Not Answered Discrete Structure Asked on 2082 Exam

Use mathematical induction to prove that
\[ 1^3 + 2^3 + 3^3 + \cdots + n^3
= \frac{n^2(n+1)^2}{4}. \]

Not Answered Discrete Structure Asked on 2082 Exam

Suppose that on an island there are three types of people, knights, knaves, and normals. Knights always tell the truth, knaves always lie, and normals sometimes lie and sometimes tell the truth. Detectives questioned three inhabitants of the island — Amy, Brenda, and Claire — as part of the investigation of a crime. The detectives knew that one of the three committed the crime, but not which one. They also knew that the criminal was a knight, and that the other two were not. Additionally, the detectives recorded these statements: Amy: “I am innocent.” Brenda: “What Amy says is true.” Claire: “Brenda is not a normal.” After analyzing their information, the detectives positively identified the guilty party. Who was it?

Not Answered Discrete Structure Asked on 2082 Exam

Find the solution to the system of congruences
\[
x \equiv 1 \ (\mathrm{mod}\ 4), \quad
x \equiv 2 \ (\mathrm{mod}\ 5), \quad
x \equiv 3 \ (\mathrm{mod}\ 7).
\] using the Chinese Remainder Theorem.

Not Answered Discrete Structure Asked on 2082 Exam

Explain how the pigeonhole principle can be used to show that among any 11 integers, at least two must have the same last digit. Find a minimum spanning tree from the following graph where the degree of each vertex in the spanning tree does not exceed 2.

Not Answered Discrete Structure Asked on 2082 Exam

Define an Euler circuit and Euler path in an undirected graph. Compute the maximal flow from the following network flow.

Not Answered Discrete Structure Asked on 2082 Exam

HAMROCSIT.COM

Copyright 2024 | HAMROCSIT.COM | All Right Reserved - Nymna Technology