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
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions:

Which of the following is true?
Consider the binary relation R = {(x, y), (x, z), (z, x), (z, y)} on the set {x, y, z}. Which one of the following is TRUE?
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?
Let G1 = (V, E1) and G2 = (V, E2) be connected graphs on the same vertex set V with more than two vertices. If G1 ∩ G2 = (V, E1 ∩ E2) is not a connected graph, then the graph G1 U G2 = (V, E1 U E2)
Let A = {a, b, c, d }, B = { p, q, r, s } denote sets. R : A –> B, R is a function from A to B. Then which of the following relations are not functions ?

(i) { (a, p) (b, q) (c, r) }
(ii) { (a, p) (b, q) (c, s) (d, r) }
(iii) { (a, p) (b, s) (b, r) (c, q) }
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is :
Let G = (V,E) be a graph. Define ξ(G) = Σd id x d, where id is the number of vertices of degree d in G. If S and T are two different trees with ξ(S) = ξ(T),then
Let f (x) be a polynomial and g(x) = f (x) be its derivative. If the degree of (f(x) + f(−x)) is 10, then the degree of (g(x) − g(−x)) is _______________ .
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?
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of
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

NET General Paper 1

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.