Bahria University10 Fragen

Mathematics for Computer Science MCQs

Q: Are these Mathematics for Computer Science MCQs free?

Yes. Every Mathematics for Computer Science MCQ on this page is free to practice, including the correct answer and explanation.

Q: Do these include past-paper questions?

Yes — questions sourced from past papers are clearly marked with a "Past Paper" badge, alongside fresh practice questions.

Q: Which exams do these Mathematics for Computer Science MCQs help with?

They are aimed at Bahria University and related Pakistani competitive exams that test Mathematics for Computer Science.

Q: How should I practice subject-wise MCQs?

Attempt each question first, then reveal the answer and read the explanation. Short, focused sessions on one subject work better than long unstructured reading.

Practice Mathematics for Computer Science multiple-choice questions for Bahria University competitive exams. Each question includes the correct answer and a short explanation, and past-paper questions are marked so you can revise both repeated and fresh material in one place.

View Active Exams Start Custom Exam

O(n)

O(n log n)

O(n^2)

O(n^3)

ErklärungBig-O notation considers the highest order term, which in this case is n^2.

V + E

V^2

ErklärungAccording to the Handshaking Lemma, the sum of the degrees of all vertices in a graph is equal to twice the number of edges.

1/8

3/8

1/2

2/3

ErklärungUsing the binomial distribution: (3 choose 2) * (0.5)^2 * (0.5)^1 = 3 * 0.125 = 0.375 or 3/8.

A is invertible

A is singular (non-invertible)

A must be a zero matrix

The trace of A is 0

ErklärungA square matrix is singular if and only if its determinant is 0, which is equivalent to at least one of its eigenvalues being 0.

NAND

XOR

Implication

Inhibit

ErklärungThe inhibit gate or operation performs a conjunction of one variable and the negation of another (P ∧ ¬Q).

3 elements

6 elements

8 elements

9 elements

ErklärungThe number of elements in the power set of a set with n elements is 2^n. For n=3, 2^3 = 8.

n(n+1)/2

n^2

n(n-1)

n(n+1)(2n+1)/6

ErklärungThis is the standard formula for the sum of the first n positive integers (the triangular number formula).

ErklärungThe cardinality of the power set of a set with n elements is 2^n. For n=5, 2^5 = 32.

f'(x) = 0

f'(x) > 0

f'(x) < 0

f'(x) is undefined

ErklärungA strictly increasing function must have a positive slope (derivative) across its domain.

0010

0110

1110

1000

ErklärungXOR returns 1 if bits are different and 0 if they are the same: 1^1=0, 0^1=1, 1^0=1, 0^0=0. So 1010^1100 = 0110.

Frequently Asked Questions

Are these Mathematics for Computer Science MCQs free?

Yes. Every Mathematics for Computer Science MCQ on this page is free to practice, including the correct answer and explanation.

Do these include past-paper questions?

Yes — questions sourced from past papers are clearly marked with a "Past Paper" badge, alongside fresh practice questions.

Which exams do these Mathematics for Computer Science MCQs help with?

They are aimed at Bahria University and related Pakistani competitive exams that test Mathematics for Computer Science.

How should I practice subject-wise MCQs?

Attempt each question first, then reveal the answer and read the explanation. Short, focused sessions on one subject work better than long unstructured reading.