Time Left - 12:00 mins

GATE 2022 Toppers Quiz 22

Attempt now to get your rank among 61 students!

Question 1

Consider the recurrence function:

Then T(n) in terms of Θ notation is ?

Question 2

The number of errors which are given below, how many of them are corrected by Lexical Analyzer?

I. Nested Comments

II. Unbalanced Parenthesis

III. Name of the identifier starting with a number

IV. The identifier is not declared before its use.

Question 3

Consider the following Boolean functions:

f1(w,x,y,z) = Σm(1,3,6,7,10,14,15) + d(4,11)

f2(w,x,y,z) = ∏M(1,4,6,12,13,15) + d(8,10)

How many maxterms are there in f1.f̅2 (f1 dot f2 bar)?

Question 4

Consider table A:

And a SQL query →SELECT COUNT(Payable_amount), SUM(Payable_amount) FROM A. Then the output will be?

Question 5

Consider the following snapshot of a given system :

If the available is (3, 3, 2) which of the following order of execution of the processes ensures safety in the system?

Question 6

Consider the following languages over the alphabet Σ = {0,1, c}:
L₁ = {0ⁿ1ⁿ | n ≥ 0}
L₂ = {wcw^r |w ∈ {0,1}∗}
L₃ = {ww^r |w ∈ {0,1}∗}
Here, w^r is the reverse of the string w. Which of these languages are deterministic Context-free languages?

Question 7

Consider an ethernet with length of the cable is 1800 meter and speed of the signal cable is 3 × 10⁸ m/s, transmission time is 45 μsec, the (%) of time channel remains idle ________. (Upto 2 decimal place)

Question 8

Consider the following program:

The value returned by find (9) is ______ .

61 attempts
0 upvotes
0 comments

Tags :

GATE & PSU CS General

Aug 9GATE & PSU CS