adplus-dvertising

Welcome to the Engineering Mathematics MCQs Page

Dive deep into the fascinating world of Engineering Mathematics with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Engineering Mathematics, a crucial aspect of GATE CSE Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Engineering Mathematics, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within GATE CSE Exam.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Engineering Mathematics. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of GATE CSE Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Engineering Mathematics. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Engineering Mathematics MCQs | Page 20 of 23

Q191.
The determinant of the matrix given below is

a.

-1

b.

0

c.

1

d.

2

Discuss
Answer: (a).-1
Q192.
Consider the following equation:

a.

0

b.

1

c.

2

d.

3

Discuss
Answer: (b).1
Q193.
Find the Integral value of f(x) = x * sinx within the limits 0, π.
Discuss
Answer: (a).π
Q194.
The value of the constant 'C' using Lagrange's mean value theorem for f(x) = 8x - x^2 in [0,8] is:
Discuss
Answer: (a).4
Q195.
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
Discuss
Answer: (c).7
Q196.
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.
Discuss
Answer: (c).Both P and Q
Q197.
The line graph L(G) of a simple graph G is defined as follows: · There is exactly one vertex v(e) in L(G) for each edge e in G. · For any two edges e and e' in G, L(G) has an edge between v(e) and v(e'), if and only if e and e'are incident with the same vertex in G. Which of the following statements is/are TRUE?

(P) The line graph of a cycle is a cycle.
(Q) The line graph of a clique is a clique.
(R) The line graph of a planar graph is planar.
(S) The line graph of a tree is a tree.
Discuss
Answer: (a).P only
Q198.
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to

a.

3

b.

4

c.

5

d.

6

Discuss
Answer: (d).6
Q199.
Which of the following graphs is isomorphic to

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (b).B
Q200.
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to
Discuss
Answer: (c).45

Suggested Topics

Are you eager to expand your knowledge beyond Engineering Mathematics? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!