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

Q71.
How many undirected graphs (not necessarily connected) can be constructed out of a given set V = {v1, v2, ... vn} of n vertices?
Discuss
Answer: (d).2^n(n-1)/2
Q72.
The rank of the matrix is :

a.

4

b.

2

c.

1

d.

0

Discuss
Answer: (c).1
Q73.
The trapezoidal rule for integration give exact result when the integrand is a polynomial of degree:
Discuss
Answer: (c).0 or 1
Q74.
The minimum number of colours required to colour the vertices of a cycle with n nodes in such a way that no two adjacent nodes have the same colour is
Discuss
Answer: (d).n - 2⌊n/2⌋ + 2
Q75.
If X, then Y unless Z" is represented by which of the following formulae in propositional logic? ("¬" is negation "^" is conjunction, and "→" is implication)
Discuss
Answer: (a).(X ^ ¬ Z) → Y
Discuss
Answer: (b).is equivalent to the binary value 0.01
Q77.
Maximum number of edges in a n - node undirected graph without self loops is
Discuss
Answer: (b).n(n - 1)/2
Q78.
The Newton-Raphson iteration Xn + 1 = (Xn/2) + 3/(2Xn) can be used to solve the equation
Discuss
Answer: (a).X^2 = 3
Q79.
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is :
Discuss
Answer: (c).7/8
Q80.
A B+ -tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8 bytes, disk block are size 512 bytes, and index pointers are of size 4 bytes. Given this scenario, what would be the best choice of the degree (i.e. the number of pointers per node) of the B+ -tree?
Discuss
Answer: (c).43

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!