Q/ Write Example is First integral but not Conservation system.

Q/ solve the system X° = -4X +2XY-8 y°= 2 4y² - x2

Q4: Discuss the stability critical point of the ODES x + sin(x) = 0 and draw phase portrait.

Using Karnaugh maps and Gray coding, reduce the following circuit represented as a table and write the final circuit in simplest form (first in terms of number of gates then in terms of fan-in of those gates). HINT: Pay closeattention to both the 1’s and the 0’s of the function.

Recall the RSA encryption/decryption system. The following questions are based on RSA. Suppose n (=15) is the product of the two prime numbers 3 and 5.1. Find an encryption key e for for the pair (e, n)2. Find a decryption key d for for the pair (d, n)3. Given the plaintext message x = 3, find the ciphertext y = x^(e) (where x^e is the message x encoded with encryption key e)4. Given the ciphertext message y (which you found in previous part), Show that the original message x = 3 can be recovered using (d, n)

Theorem 1: A number n ∈ N is divisible by 3 if and only if when n is writtenin base 10 the sum of its digits is divisible by 3. As an example, 132 is divisible by 3 and 1 + 3 + 2 is divisible by 3.1. Prove Theorem 1 2. Using Theorem 1 construct an NFA over the alphabet Σ = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}which recognizes the language {w ∈ Σ^(∗)| w = 3k, k ∈ N}.

Recall the RSA encryption/decryption system. The following questions are based on RSA. Suppose n (=15) is the product of the two prime numbers 3 and 5.1. Find an encryption key e for for the pair (e, n)2. Find a decryption key d for for the pair (d, n)3. Given the plaintext message x = 3, find the ciphertext y = x^(e) (where x^e is the message x encoded with encryption key e)4. Given the ciphertext message y (which you found in previous part), Show that the original message x = 3 can be recovered using (d, n)

Find the sum of products expansion of the function F(x, y, z) = ¯x · y + x · z in two ways: (i) using a table; and (ii) using Boolean identities.

Give both a machine-level description (i.e., step-by-step description in words) and a state-diagram for a Turing machine that accepts all words over the alphabet {a, b} where the number of a’s is greater than or equal to the number of b’s.