Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Mohitkumaraiactr
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Mohitkumaraiactr
0
votes
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
488
views
answered
Jan 18, 2019
Programming in C
data-structures
programming-in-c
easy
+
–
0
votes
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...
428
views
answered
May 7, 2018
Theory of Computation
test-series
theory-of-computation
+
–
0
votes
3
programming
output?
output?
254
views
answered
Nov 6, 2017
3
votes
4
UGC NET CSE | November 2017 | Part 3 | Question: 4
Which of the following addressing mode is best suited to access elements of an array of contiguous memory locations? Indexed addressing mode Base Register addressing mode Relative address mode Displacement mode
Which of the following addressing mode is best suited to access elements of an array of contiguous memory locations?Indexed addressing mode Base Register add...
919
views
answered
Nov 6, 2017
CO and Architecture
ugcnetcse-nov2017-paper3
addressing-modes
co-and-architecture
+
–
1
votes
5
UGC NET CSE | December 2012 | Part 2 | Question: 35
Which of the following is the most powerful parsing method? LL(I) Canonical LR SLR LALR
Which of the following is the most powerful parsing method?LL(I)Canonical LRSLRLALR
2.0k
views
answered
Oct 30, 2017
Theory of Computation
ugcnetcse-dec2012-paper2
compiler-design
parsing
+
–
0
votes
6
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).
457
views
answered
Oct 30, 2017
Compiler Design
compiler-design
grammar
regular-grammar
lr-parser
+
–
4
votes
7
MadeEasy Subject Test: Computer Networks - Congestion Control
Assume a scenario where the size of congestion window of a TCP connection be 40 KB when a timeout occurs. The maximum segment size (MSS) be 2 KB. Let the propagation delay be 200 msec. The time taken by the TCP connection to get back to 40 KB congestion window is _________ msec.
Assume a scenario where the size of congestion window of a TCP connection be 40 KB when a timeout occurs. The maximum segment size (MSS) be 2 KB. Let the propagation dela...
959
views
answered
Oct 24, 2017
Computer Networks
made-easy-test-series
computer-networks
congestion-control
tcp
+
–
0
votes
8
Graph based protocol
Is there a chance for Deadlock in Graph based protocol?
Is there a chance for Deadlock in Graph based protocol?
665
views
answered
Aug 5, 2017
Databases
graph-based-protocol
databases
+
–
1
votes
9
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)
296
views
answered
Aug 5, 2017
Compiler Design
compiler-design
grammar
ll-parser
+
–
–1
votes
10
LR(0) OR NOT???
If i am wrong let me correct.
If i am wrong let me correct.
496
views
answered
Aug 5, 2017
Compiler Design
compiler-design
lr-parser
grammar
theory-of-computation
context-free-language
+
–
0
votes
11
Gate cs 2018 syllabus
Is differential equation the part of gate cs 2018 syllabus???
Is differential equation the part of gate cs 2018 syllabus???
938
views
answered
Aug 5, 2017
0
votes
12
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...
1.5k
views
answered
Jul 2, 2017
Computer Networks
computer-networks
network
+
–
1
votes
13
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?????
535
views
answered
Jul 2, 2017
Verbal Aptitude
profit-loss
+
–
0
votes
14
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= Ø}?
344
views
answered
Jul 1, 2017
1
votes
15
Regular language
#I am confused in the language (iv) . Someone please explain.
#I am confused in the language (iv) . Someone please explain.
383
views
answered
Jul 1, 2017
0
votes
16
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).
683
views
answered
Jul 1, 2017
Algorithms
space-complexity
sorting
heap-sort
+
–
0
votes
17
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
1.2k
views
answered
Jun 30, 2017
DS
sorting
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register