LawMint Sign in

Gujarat SET (GSET) UGC NET Computer Science & Applications Previous Year Questions

Try the preview and open any solution for a worked explanation.

Gujarat SET (GSET) practice pack

The practice pack for Gujarat SET (GSET) is coming soon to LawMint.

Question 1

Determine the logical nature of the following compound proposition :
(P → Q) ∧ (Q → P).
Which of the following best describes this expression ?

Select one answer

Question 2

Which of the following is logically equivalent to the statement :
¬ (P ∨ (Q ∧ R)) ?

Select one answer

Question 3

Which of the following is logically equivalent to the statement :
“It is not true that for every element x in domain D, there exists an element y in D such that P(x, y) holds.”, that is, ¬(∀x∈ D)(∃y∈ D) P(x, y) ?

Select one answer

Question 4

Let R be a relation on set A = {1, 2, 3, 4 }, defined by aRb if and only if a2 = b2.
Which property does R satisfy ?

Select one answer

Question 5

Which one of the following statements is true about bipartite graphs ?

Select one answer

Question 6

Consider the following well-formed formulas :
F1 : P ⇒ ¬P
F2 : (P ⇒ ¬P) ∨ (¬P ⇒ P).
Which statement is correct ?

Select one answer

Question 7

In a class of 30 students, 12 like mathematics, 18 like physics and 5 like both. If a student is selected at random, what is the probability the student likes either mathematics or physics ?

Select one answer

Question 8

Which algorithm is commonly used to solve integer linear programming problems by progressively adding linear constraints ?

Select one answer

Question 9

Which of the following is the correct prefix expression for the infix expression?
(a + b * (c – d))↑e
(Assume ↑ denotes exponentiation.)

Select one answer

Question 10

What is domain of function f(x) = x–1 for it to be defined everywhere on domain ?

Select one answer

Continue practising

The practice pack for Gujarat SET (GSET) is coming soon to LawMint.

Gujarat SET (GSET) practice pack

The practice pack for Gujarat SET (GSET) is coming soon to LawMint.