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 23 of 23

Explore more Topics under GATE CSE Exam

Q221.
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is _______________.

a.

24

b.

20

c.

32

d.

64

Discuss
Answer: (a).24
Q222.
A graph is self-complementary if it is isomorphic to its complement. For all self-complementary graphs on n vertices, n is

a.

A multiple of 4

b.

Even

c.

Odd

d.

Congruent to 0 mod 4, or 1 mod 4

Discuss
Answer: (d).Congruent to 0 mod 4, or 1 mod 4
Q223.
In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is True?

a.

A tree has no bridge

b.

A bridge cannot be part of a simple cycle

c.

Every edge of a clique with size ≥ 3 is a bridge (A clique is any complete subgraph of a graph)

d.

A graph with bridges cannot have a cycle

Discuss
Answer: (b).A bridge cannot be part of a simple cycle
Q224.
What is the number of vertices in an undirected connected graph with 27 edges, 6 vertices of degree 2, 3 vertices of degree 4 and remaining of degree 3?

a.

10

b.

11

c.

18

d.

19

Discuss
Answer: (d).19
Q225.
The minimum number of colours that is sufficient to vertex-colour any planar graph is _______________.

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (d).4
Q226.
If all the edge weights of an undirected graph are positive, then any subset of edges that connects all the vertices and has minimum total weight is a

a.

Hamiltonian cycle

b.

grid

c.

hypercube

d.

tree

Discuss
Answer: (d).tree
Q227.
Consider a weighted undirected graph with positive edge weights and let uv be an edge in the graph. It is known that the shortest path from the source vertex s to u has weight 53 and the shortest path from s to v has weight 65. Which one of the following statements is always true?

a.

weight (u, v) < 12

b.

weight (u, v) ≤ 12

c.

weight (u, v) > 12

d.

weight (u, v) ≥ 12

Discuss
Answer: (d).weight (u, v) ≥ 12
Q228.
What is the chromatic number of the following graph?

a.

2

b.

3

c.

4

d.

5

Discuss
Answer: (b).3
Q229.
G is a simple undirected graph. Some vertices of G are of odd degree. Add a node v to G and make it adjacent to each odd degree vertex of G. The resultant graph is sure to be

a.

regular

b.

Complete

c.

Hamiltonian

d.

Euler

Discuss
Answer: (d).Euler
Page 23 of 23

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!

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

DBMS

Get a firm grasp on database systems with our DBMS MCQs. Explore relational...

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...

Computer Architecture

Unveil the science behind computer design with our Computer Architecture MCQs. Topics...

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....

Computer Hardware

Explore the tangible components of computers with our Computer Hardware MCQs. Learn...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...