LawMint Sign in

Karnataka SET (KSET) UGC NET Computer Science & Applications Previous Year Questions

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

Karnataka SET (KSET) practice pack

The practice pack for Karnataka SET (KSET) is coming soon to LawMint.

Question 1

Given (¬ P ∨ Q) ∧ (P ∨ Q), which of the following mathematical logics is considered as equivalent?

Select one answer

Question 2

Match the following terms with their definitions:

a. Well-ordered Set(i) A set where every pair of elements are comparable
b. Partial-ordered Set(ii) Every non-empty subset has a least element
c. Totally-ordered Set(iii) A set where every pair of elements need not be comparable
d. Empty Set(iv) A set with no elements

Select one answer

Question 3

Given U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, Let A = {1, 2, 3, 4, 5}; B = {1, 2, 4, 8}; C = {1, 2, 3, 5, 7} and D = {2, 4, 6, 8}. Determine (A ∪ B) – (C ∩ D).

Select one answer

Question 4

What is the probability of an odd sum when two dice are rolled?

Select one answer

Question 5

A party of n persons sits at a round table. Find the odds against two specific individuals sitting next to each other.

Select one answer

Question 6

Consider a connected, undirected graph G = (V, E) where |V| = n and |E| = m. Which of the following statements must be true for a spanning tree of G?
a. A spanning tree of G will always have exactly m – n + 1 edges
b. Any subgraph of G with exactly n – 1 edges is guaranteed to be a spanning tree
c. The number of spanning trees in G can be computed using Kirchhoff's matrix tree theorem
d. A spanning tree of G is always unique for any given graph

Select one answer

Question 7

Let G be a group defined by a*b = (ab/2); where the elements of G are nonzero real numbers. The solution of 3*x = 4 is given by

Select one answer

Question 8

For a given Boolean expression, F = X.Y.Z + X.Y.Z‾\overline{Z} + X.Y.Z + X‾\overline{X}.Y, the simplified Boolean expression is

Select one answer

Question 9

Consider a weighted complete graph G on the vertex set {V1,V2,V3,V4,....,Vn} such that the weight of the edge (Vi, Vj) is 2 |i – j|. The weight of minimum spanning tree of G is

Select one answer

Question 10

For given U = {1, 2, 3, 4, ....., 10}, Let A = {1, 2, 3, 4, 5}; B = {1, 2, 4, 8}; C = {1, 2, 3, 5, 7} and D = {2, 4, 6, 8}. Determine the following C‾\overline{C} ∪ D‾\overline{D}.

Select one answer

Continue practising

The practice pack for Karnataka SET (KSET) is coming soon to LawMint.

Karnataka SET (KSET) practice pack

The practice pack for Karnataka SET (KSET) is coming soon to LawMint.