Register
Filter

Recent activity by Mohitkumaraiactr

1 answer
1
DS and programming
in a sorted array of n distinct element finding i th largest element take o(1) . true / false
in a sorted array of n distinct element finding i th largest element take o(1) . true / false
2 answers
2
TheGateAcademy Test Series
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"
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...
0 answers
3
theory of computation
how to solve these type of questions
how to solve these type of questions
1 answer
4
probability
1 answer
5
Discrete maths functions
The number of ways possible to form injective function from set $A$ set $B$ where $|A|=3\text{ and } |B|=5$ such that $p^{th}$ element of set $A$ cannot match with $p^{th}$ element of set $B$ are __________.
The number of ways possible to form injective function from set $A$ set $B$ where $|A|=3\text{ and } |B|=5$ such that $p^{th}$ element of set $A$ cannot match with $p^{th...
0 answers
6
Doubt
Suppose we have 50 pages and LRU algorithm is used. find number of page faults for both row and column major order for (i=0; i <100; i++) for( j=0; j < 100 ; j++) A[i][j] = A[i][j] + A[j][i] Please explain
Suppose we have 50 pages and LRU algorithm is used. find number of page faults for both row and column major orderfor (i=0; i <100; i++)for( j=0; j < 100 ; j++)A[i][j] = ...
1 answer
7
Theory of computation
Design a TM that decides regular expression {w | w is a string not containing “101” as a substring }.
Design a TM that decides regular expression {w | w is a string not containing “101” as a substring }.
2 answers
8
programming
output?
output?
0 answers
10
Test Series.
Q.) Let G be a non abelian group, order of G can be a) 24 b) 44 c) 54 d) 34 Please Provide explanation with your answer.
Q.) Let G be a non abelian group, order of G can bea) 24b) 44c) 54d) 34Please Provide explanation with your answer.
1 answer
12
Compiler
Which of the following statements are correct and why.....? Every regular set has LR(1) grammar Every regular grammar is LR(1).
Which of the following statements are correct and why.....?Every regular set has LR(1) grammarEvery regular grammar is LR(1).
1 answer
15
Graph based protocol
Is there a chance for Deadlock in Graph based protocol?
Is there a chance for Deadlock in Graph based protocol?
1 answer
16
LL one
Given answer is yes but i think should not be LL(1)
Given answer is yes but i think should not be LL(1)
1 answer
18
Gate cs 2018 syllabus
Is differential equation the part of gate cs 2018 syllabus???
Is differential equation the part of gate cs 2018 syllabus???
2 answers
19
computer networks (Pure Aloha)
Let a cluster of stations share 48Kbps of pure Aloha channel. Every station outputs frames of length 1024bits on an average of every 50seconds. Then what is the maximum value of no. of stations?
Let a cluster of stations share 48Kbps of pure Aloha channel. Every station outputs frames of length 1024bits on an average of every 50seconds. Then what is the maximum v...
4 answers
20
profit loss
The selling price of table is 4/5 times its cost price .the gain % is?????
The selling price of table is 4/5 times its cost price .the gain % is?????
1 answer
21
Regular language
#I am confused in the language (iv) . Someone please explain.
#I am confused in the language (iv) . Someone please explain.
1 answer
22
Peter linz chapter 2 ques no 5
Is it true that for any nfa M = (Q,Σ,δ,q 0 ,F) the complement of L(M)is equal to the set {w ∈ Σ * : δ * (q 0 ,w) F= Ø}?
Is it true that for any nfa M = (Q,Σ,δ,q 0 ,F) the complement of L(M)is equal to the set {w ∈ Σ * : δ *(q 0 ,w) F= Ø}?
1 answer
23
complexity analysis
Space complexity = input size + extra space So, heap sort also takes input of an 'n' size array. Does this mean that space cost of heap sort algo is O (n).
Space complexity = input size + extra spaceSo, heap sort also takes input of an 'n' size array.Does this mean that space cost of heap sort algo is O (n).
2 answers
24
Sorting
We need to sort 7 numbers each of 4 digits. What is the number of comparisons in worst case . Options are as follows: 1) 40 2) 38 3) 47 4) 280
We need to sort 7 numbers each of 4 digits. What is the number of comparisons in worst case . Options are as follows:1) 402) 383) 474) 280