<div> <h2 style="text-align: center;"><span style="font-size: 14pt; font-family: tahoma, arial, helvetica, sans-serif; color: #808080;"><strong>Aurora's Engineering College</strong></span></h2> <h2 style="text-align: center;"><span style="font-size: 12pt; font-family: tahoma, arial, helvetica, sans-serif; color: #808080;"><strong>B.Tech 2 CSE II Sem - Mid-II Test - 2019-20</strong></span></h2> <div style="text-align: center;"><span style="font-size: 12pt; font-family: tahoma, arial, helvetica, sans-serif; color: #808080;"><strong>Discrete Mathematics</strong></span></div> </div>

Aurora's Engineering College

B.Tech 2 CSE II Sem - Mid-II Test - 2019-20

Discrete Mathematics

Please read the below instructions before taking the test:

This test contains 20 multiple choice questions
Each question carries one mark
Maximum marks : 20
Duration : 30 minutes
This test can be attempted only once. If there are multiple attempts by creating different logins, all your tests stand cancelled, and no marks will be awarded.

Please read the below instructions before taking the test:

This test contains 20 multiple choice questions
Each question carries one mark
Maximum marks : 20
Duration : 30 minutes
This test can be attempted only once. If there are multiple attempts by creating different logins, all your tests stand cancelled, and no marks will be awarded.

Consider the recurrence relation a₁=4, a_n=5n+a_n-1. The value of a₆₄ is _________

10399

23760

75100

53700

Determine the solution of the recurrence relation F_n=20F_n-1 − 25F_n-2 where F₀=4 and F₁=14

a_n = 14*5^n-1

a_n = 7/2*2ⁿ−1/2*6ⁿ

a_n = 7/2*2ⁿ−3/4*6ⁿ⁺¹

a_n = 3*2ⁿ−1/2*3ⁿ

What is the recurrence relation for 1, 7, 31, 127, 499?

b_n+1=5b_n-1+3

b_n=4b_n+7!

b_n=4b_n-1+3

b_n=b_n-1+1

If Sn=4Sn-1+12n, where S0=6 and S1=7, find the solution for the recurrence relation

a_n=7(2ⁿ)−29/6n6ⁿ

a_n=6(6ⁿ)+6/7n6ⁿ

a_n=6(3ⁿ⁺¹)−5n

a_n=nn−2/6n6ⁿ

Find the value of a₄ for the recurrence relation a_n=2a_n-1+3, with a₀=6

320

221

141

The solution to the recurrence relation a_n=a_n-1+2n, with initial term a₀=2 are

4n+7

2(1+n)

3n²

5*(n+1)/2

Determine the solution for the recurrence relation b_n=8b_n-1−12b_n-2 with b₀=3 and b₁=4

7/2*2ⁿ−1/2*6ⁿ

2/3*7ⁿ-5*4ⁿ

4!*6ⁿ

2/8ⁿ

What is the solution to the recurrence relation a_n=5a_n-1+6a_n-2?

2n²

(3/2)n

N!*3

Determine the value of a2 for the recurrence relation a_n = 17a_n-1 + 30n with a₀=3

4387

5484

238

1437

Determine the solution for the recurrence relation a_n = 6a_n-1−8a_n-2 provided initial conditions a₀=3 and a₁=5

a_n = 4 * 2ⁿ – 3ⁿ

a_n = 3 * 7ⁿ – 5*3ⁿ

a_n = 5 * 7ⁿ

a_n = 3! * 5ⁿ

If a partial order is drawn as a Hasse diagram in which no two edges cross, its covering graph is called

Upward planar

Downward planar

Lattice

Biconnected components

Which of the following relation is a partial order as well as an equivalence relation?

Equal to(=)

Less than(<)

Greater than(>)

Not equal to(!=)

The relation ≤ is a partial order if it is

Reflexive, antisymmetric and transitive

Reflexive, symmetric

Asymmetric, transitive

Irreflexive and transitive

Which of the following statements for a simple graph is correct?

Every path is a trail

Every trail is a path

Every trail is a path as well as every path is a trail

Path and trail have no relation

A connected planar graph having 6 vertices, 7 edges contains _____________ regions

Which of the following properties does a simple graph not hold?

Must be connected

Must be unweighted

Must have no loops or multiple edges

Must have no multiple edges

A graph with all vertices having equal degree is known as a

Multi Graph

Regular Graph

Simple Graph

Complete Graph

All trees with n vertices consists of ______ edges

N - 1

None of the above

The number of elements in the adjacency matrix of a graph having 7 vertices is

Which of the following statements is/are TRUE for undirected graphs?

P : Number of odd degree vertices is even.

Q : Sum of degrees of all vertices is even

P only

Q only

Both P and Q

Neither P nor Q

Aurora's Engineering College

B.Tech 2 CSE II Sem - Mid-II Test - 2019-20

Discrete Mathematics

Aurora's Engineering College

B.Tech 2 CSE II Sem - Mid-II Test - 2019-20

More Quizzes

Aurora's Engineering College B.Tech 2 CSE II Sem - Mid-II Test - 2019-20 Discrete Mathematics

Aurora's Engineering College

B.Tech 2 CSE II Sem - Mid-II Test - 2019-20

More Quizzes

Aurora's Engineering College

B.Tech 2 CSE II Sem - Mid-II Test - 2019-20

Discrete Mathematics