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

Explore more Topics under GATE CSE Exam

Q61.
Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false?

a.

Every minimum spanning tree of G must contain emin

b.

If emax is in a minimum spanning tree, then its removal must disconnect G

c.

No minimum spanning tree contains emax

d.

G has a unique minimum spanning tree

Discuss
Answer: (c).No minimum spanning tree contains emax
Q62.
Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following statements is always true?

a.

{u,v} must be an edge in G, and u is a descendant of v in T

b.

{u,v} must be an edge in G, and v is a descendant of u in T

c.

If {u,v} is not an edge in G then u is a leaf in T

d.

If {u,v} is not an edge in G then u and v must have the same parent in T

Discuss
Answer: (c).If {u,v} is not an edge in G then u is a leaf in T
Q63.
Consider the following statements:

S1: The sum of two singular n × n matrices may be non-singular
S2: The sum of two n × n non-singular matrices may be singular.

Which of the following statements is correct?

a.

S1 and S2 are both true

b.

S1 is true, S2 is false

c.

S1 is false, S2 is trueS1 and S2 are both fals

d.

S1 and S2 are both false

Discuss
Answer: (a).S1 and S2 are both true
Q64.
Consider two well-formed formulas in prepositional logic. Which of the following statements is correct?

a.

F1 is satisfiable, F2 is valid

b.

F1 unsatisfiable, F2 is satisfiable

c.

F1 is unsatisfiable, F2 is valid

d.

F1 and F2 are both satisfiable

Discuss
Answer: (a).F1 is satisfiable, F2 is valid
Q65.
Let f(n) = n^2Logn and g(n) = n (logn)^10 be two positive functions of n. Which of the following statements is correct?

a.

f(n) = O(g(n)) and g(n) != O(f(n))

b.

f(n) != O(g(n)) and g(n) = O(f(n))

c.

f(n) = O(g(n)) but g(n) = O(f(n))

d.

f(n) != O(g(n)) but g(n) != O(f(n))

Discuss
Answer: (b).f(n) != O(g(n)) and g(n) = O(f(n))
Q66.
Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. then the following relational algebra expression is always equal to

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (c).C
Q67.
How many 4-digit even numbers have all 4 digits distinct?

a.

2240

b.

2296

c.

2620

d.

4536

Discuss
Answer: (b).2296
Q68.
Let f: A→B be a function, and let E and F be subsets of A. Consider the following statements about images.

S1: f (E ∪ F) = f (E) ∪ f (F)
S1: f (E ∩ F) = f (E) ∩ f (F)

Which of the following is true about S1 and S2?

a.

Only S1 is correct

b.

Only S2 is correct

c.

Both S1 and S2 are correct

d.

None of S1 and S2 is correct

Discuss
Answer: (a).Only S1 is correct
Q69.
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day?

a.

1/7^7

b.

1/7^6

c.

1/2^7

d.

7/2^7

Discuss
Answer: (b).1/7^6
Q70.
Consider an undirected unweighted graph G. Let a breadth-first traversal of G be done starting from a node r. Let d(r,u) and d(r,v) be the lengths of the shortest paths from r to u and v respectively in G. If u is visited before v during the breadth-first traversal, which of the following statements is correct?

a.

d(r, u) < d(r, v)

b.

d(r,u) > d(r,v)

c.

d(r,u) <= (r,v)

d.

None of the above

Discuss
Answer: (c).d(r,u) <= (r,v)
Page 7 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!

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Artificial Intelligence

Get started on the path to the future with our Artificial Intelligence MCQs. Covering...

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

Computer Hardware

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

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...