Time Left - 15:00 mins

NIELIT STQC 2021 Quiz-19

Attempt now to get your rank among 104 students!

Question 1

Identify the missing term in the following table:

Question 2

Pick the odd one out:

Question 3

Find out the alternative which will replace the question mark

Rigid : Stiff :: Ally : ?

Question 4

The school principal has received complaints from parents about bullying in the school yard during recess. He wants to investigate and end this situation as soon as possible, so he has asked the recess aides to watch closely. Which situation should the recess aides report to the principal?

Question 5

Which of the following statements is/are true?

S1: Heap sort is an inplace sorting algorithm.

S2: Quick sort is a stable algorithm.

S3: Merge sort is a stable algorithm.

S4: Insertion sort is an inplace algorithm.

Question 6

Consider the following table of arrival time and burst time for three processes P1, P2, P3 and P4:

If longest remaining time first (LRTF) CPU scheduling is used, then the average TAT will be

(Assume if burst time of two process are matches, then schedule the lowest arrival time process)

Question 7

Dirty bit is used to indicate which of the following?

Question 8

Let L be a language and L’ be its complement. Which one of the following is NOT a viable possibility?

Question 9

Which of the following impose additional overhead on clients and offer faster transfer?

Question 10

Which of the following is correct with regard to insertion sort?
  • 104 attempts
  • 1 upvote
  • 1 comment
Mar 12GATE & PSU CS