A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. The set {1, 2, 3, 5, 7, 8, 9} under multiplication modulo 10 is not a group. Given below are four plausible reasons. Which one of them is false?
a. It is not closed
b. 2 does not have an inverse
c. 3 does not have an inverse
d. 8 does not have an inverse
Answer:3 does not have an inverse

Similar Questions:

An examination paper has 150 multiple-choice questions of one mark each, with each question having four choices. Each incorrect answer fetches -0.25 mark. Suppose 1000 students choose all their answers randomly with uniform probability. The sum total of the expected marks obtained by all these students is:
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?
Let R be a relation on the set of ordered pairs of positive integers such that ((p, q), (r, s)) ∈ R if and only if p–s = q–r. Which one of the following is true about R?
Two alternative packages A and B are available for processing a database having 10k records.Package A requires 0.0001n^2 time units and package B requires 10nlog10n time units to process n records.What is the smallest value of k for which package B will be preferred over A?
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day?
Consider the systems, each consisting of m linear equations in n variables.

I. If m < n, then all such systems have a solution
II. If m > n, then none of these systems has a solution
III. If m = n, then there exists a system which has a solution

Which one of the following is CORRECT?
Consider the following iterative root finding methods and convergence properties:

Iterative root finding Convergence properties methods
(Q) False Position                        (I) Order of convergence = 1.62
(R) Newton Raphson                 (II) Order of convergence = 2
(S) Secant                                         (III) Order of convergence = 1 with guarantee of convergence
(T) Successive Approximation (IV) Order of convergence = 1 with no guarantee of convergence
Let G be a simple connected planar graph with 13 vertices and 19 edges. Then, the number of faces in the planar embedding of the graph is
Given a boolean function f (x1, x2, ..., xn), which of the following equations is NOT true
Let (5, ≤) be a partial order with two minimal elements a and b, and a maximum element c.

Let P : S → {True, False} be a predicate defined on S.
Suppose that P(a) = True, P(b) = False and
P(x) ⇒ P(y) for all x, y ∈ S satisfying x ≤ y,
where ⇒ stands for logical implication.

Which of the following statements CANNOT be true ?

View All Questions on: Engineering Mathematics

Start The Conversation:

Get it on Google Play

GATE CSE Resources

Questions from Previous year GATE question papers

UGC NET Computer science Resources

UGC NET Previous year questions and practice sets

GATE CSE Online Test

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

UGC NET practice Test

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.