LawMint Sign in

Jammu & Kashmir and Ladakh SET (JKSET/LASET) UGC NET Computer Science & Applications Previous Year Questions

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

Jammu & Kashmir and Ladakh SET (JKSET/LASET) practice pack

The practice pack for Jammu & Kashmir and Ladakh SET (JKSET/LASET) is coming soon to LawMint.

Question 1

When run on a given system, a program takes 1,000,000 cycles. If the system achieves a CPI of 40, how many instructions are executed in running the program ?

Select one answer

Question 2

Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6 respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm ? Do not count the context switches at time zero and at the end.

Select one answer

Question 3

If A is a finite set with n elements, then number of elements in the largest equivalence relation of A is __________.

Select one answer

Question 4

The circuit which will work as OR gate in positive level will work as __________ gate in negative level logic.

Select one answer

Question 5

Find the function represented by the figure

Logic circuit with three 2-input AND gates labelled 1, 2, 3 on the left, three 2-input OR gates labelled 4, 5, 6 in the middle, and one 3-input AND gate on the right producing Output. Gate 1 has inputs A and B; Gate 2 has inputs B and C; Gate 3 has inputs A and B. Gate 4 has inputs A and the output of Gate 1; Gate 5 has inputs B and the output of Gate 2; Gate 6 has inputs C and the output of Gate 3. The outputs of Gates 4, 5 and 6 feed the final AND gate.
Select one answer

Question 6

Every cut set of a connected Euler graph has __________.

Select one answer

Question 7

The number of integers between 1 and 250 that are not divisible by 2, 3, 5 or 7 is __________.

Select one answer

Question 8

Given below are two statements:
Statement I: A graph is planar if it can be drawn in a plane so that no edges cross.
Statement II: Every planar graph has at least one vertex of degree 5 or less than 5.

Select one answer

Question 9

The calculation of opportunity cost in the MODI method is analogous to a __________.

Select one answer

Question 10

The pre-order traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the post order traversal of this tree is:

Select one answer

Continue practising

The practice pack for Jammu & Kashmir and Ladakh SET (JKSET/LASET) is coming soon to LawMint.

Jammu & Kashmir and Ladakh SET (JKSET/LASET) practice pack

The practice pack for Jammu & Kashmir and Ladakh SET (JKSET/LASET) is coming soon to LawMint.