# BARC 2020: Mini Mock 3 (App update required to attempt this test)

Attempt now to get your rank among 250 students!

Question 1

Question 2

What will be the correct pattern generated by these 3 processes, write it without any space between the digit?

Question 3

* FCFS

* SRTF

* SJF

* Longest Job First

* Pre-emptive Priority

* Round Robin

* Multi-level Feedback Queue Scheduling

Question 4

Which pages will be replaced by using FIFO and LRU scheme respectively?

Question 5

10, 22, 20, 2, 40, 6, 38

Assume the disk head is currently positioned at cylinder 20. Seek time takes 6 ms. How many number of cylinder moves are taken for the given requests using the SCAN scheduling? (Assume initially head is moving upward)

Question 6

Question 7

These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is________.

Question 8

What is the average waiting time using the scheduling technique Highest Response Ratio Next.

Question 9

Question 10

1) Deadlock Avoidance

2) Deadlock Prevention

3) Deadlock Detection and Recovery

4) Deadlock Ignorance

Write the numbers in a proper order. For example, if you think that the sequence is 1234 then type the numbers in the same sequence i.e. 1234.

Question 11

A) L is a context sensitive language (CSL), complement of L is of same type.

B) Let L1 and L2 is CSL, intersection of L1 and L2 is empty or not.

C) Finiteness problem in CFGs.

D) Emptiness problem for CFGs

Number of problems that are decidable is ____.

Question 12

^{i}b

^{j}c

^{k}/ i!=j and j!=k}

Question 13

^{∑*}?

Question 14

L3 = L1 U L2

L4 = L3’

L5 = L4 ∩ L1

L6 = L5 – L1

L6 = L5*

L7 = L6 U L2

L8 = L7 U L1

The resultant language we get in L8 is

Question 15

Question 16

Number of final states in DFA is

Question 17

Question 18

Question 19

What will be ?

Question 20

1) The intersection of two regular languages is infinite is decidable.

2) Whether a given context free language is regular is decidable.

3) Whether a given grammar is context free grammar is not decidable.

4) Finiteness problem of regular language is decidable.

- 250 attempts
- 0 upvotes
- 2 comments

Tags :

GATE & PSU CSGeneralPosted by: