# Questions by Subham Nagar

1
If in question it is given to find no. of counting states of a counter, does it mean that we need to find Mod of the counter or just the no. of distinct states that the counter can have?
1 vote
2
Assume 2 computers are connected via a network. The network uses Go-Back 7 sliding window protocol for maintaining flow control. It is observed that every 5th packet that has been sent through the network is lost. What will be the number of extra packets that has to be resent for transmitting 10 such packet through the network? With explanation.
3
Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-Tree Please also refer the source from where clear-cut formulae are given
4
In FCFS CPU Scheduling, when a process with a long Burst Time occupies the CPU, which of the following is said to occur: Convoy Effect Starvation Logically speaking, it should be Starvation as other processes would have to wait for a long time. I just want a confirmation as the answer given is Convoy Effect.
5
Is the 3 year M.Tech RA (January, sponsored) in IIT HYDERABAD course recently implemented? If anyone can give a review as I have been shortlisted for interview to be held on 26th November but i am not sure to attend or not
6
Is SMTP connection-oriented or connectionless ?
7
What will be the minimum no. of states for DFA for the above NFA? Please explain.
8
https://gateoverflow.in/39700/gate2016-1-46 In this question, there is a 4th option named "Syntax Error". So in such questions when do syntax error occurs? Is it related to grammar or something else?
9
Is 1 a lattice?
10
Examine the structure of the EMPLOYEES table: EMPLOYEE_ID NUMBER Primary Key FIRST_NAME VARCHAR2(25) LAST_NAME VARCHAR2(25) Assume all the following four options are executed in the same sequence order. Which statement will not insert a row into the table? a. INSERT INTO ... (employee_id) VALUES (1000); d. INSERT INTO employees (employee_id, first_name, last_name) VALUES ( 1000, John', ');
11
The instruction pipeline of RISC processor has 200 instructions in which 100 are performing addition, 25 performing division and 75 performing multiplications, where Execution state for addition take 1 clock cycle,multiplication take 3 and division take 5. Assume pipeline has 5 stages: IF, ... 5-1)*5+ (75+5-1)*3 Am i doing wrong? Solution with explanation of formulae being used will be welcomed.
12
As all recursive languages are recursively enumerable languages, they also should be Turing Recognizable together with Turing Decidable. This was my logic behind marking the 4th option which says all of the mentioned statements are true. Correct me if I am wrong
13
If there are Q states in NFA, DFA should have at max $2^{Q}$ states. Keeping this thing in mind I answered the question but it went wrong. Please if anyone can give the correct solution.
14
L= { $a^{n}b^{m}$ | $n<=m<=2n$ } a) DCFL b) CFL but not DCFL c) Not CFL
15
In DFA, does each state need to have transition on "EACH" input alphabet? The answer was given "False" but I dont think so. Can anyone explain? Because if this statement is False, then there is no use of "Dead State"
16
I don't think it will be regular . Had the language been uwwRv the expression could have been (a+b)*(aa+bb)(a+b)* as there is no restriction on w. Is it correct? and if it isn't regular, is it a CFL?
17
L = {a^n: n ≥ 2, is a prime number}. This is not a regular language. What about L*? Is it regular? Please explain.