Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Desert_Warrior
3
votes
5
answers
101
#Regular Expression
The regular expression 0*(10*)* denotes the same set as (A) (1*0)*1* (B) 0 + (0 + 10)* (C) (0 + 1)* 10(0 + 1)* (D) none of these
The regular expression 0*(10*)* denotes the same set as(A) (1*0)*1*(B) 0 + (0 + 10)*(C) (0 + 1)* 10(0 + 1)*(D) none of these
2.5k
views
asked
Apr 13, 2016
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
3
answers
102
#DS Which Data structure is more suitable
Consider a situation where a client receives packets from a server. There may be differences in speed of the client and the server. Which data structure is best suited for synchronization? (A) Circular Linked List (B) Queue (C) Stack (D) Priority Queue
Consider a situation where a client receives packets from a server. There may be differences in speed of the client and the server. Which data structure is best suited fo...
5.3k
views
asked
Apr 11, 2016
DS
data-structures
+
–
0
votes
3
answers
103
Probability PGEE
What is the chance that a leap year selected at random will contain 52 Sundays? a. 1 b. 3/7 c. 1/7 d. 2/7
What is the chance that a leap year selected at random will contain 52 Sundays? a. 1 b. 3/7 c. 1/7 d. 2/7
1.2k
views
asked
Mar 20, 2016
Probability
iiith-pgee
quantitative-aptitude
probability
+
–
0
votes
0
answers
104
Hash table
Consider a hash table with 'm' slots that uses chaining for collision resolution. the table is initially empty. What is probability that after 4 keys are inserted then atleast a chain of size 3 is created? (assume simple uniform hashing is used) a. m-1 b. m-4 c. m-3(m-1) d. 3m-1
Consider a hash table with 'm' slots that uses chaining for collision resolution. the table is initially empty. What is probability that after 4 keys are inserted then at...
738
views
asked
Mar 11, 2016
DS
hashing
data-structures
+
–
2
votes
3
answers
105
Algorithms
Given n linearly ordered distinct elements. What is the worst case running time to find ith smallest element (1<=i<=n) from those n elements? a) O(log n) b) O(n) c) O(n log n) d) O(n2)
Given n linearly ordered distinct elements. What is the worst case running time to find ith smallest element (1<=i<=n) from those n elements? a) O(log n)b) O(n)c) O(n lo...
1.2k
views
asked
Mar 8, 2016
Algorithms
algorithms
time-complexity
+
–
0
votes
2
answers
106
permutations
The number of ways in which 6 rings can be worn on the four fingers of one hand is: a. 360 b. 4^6 c. 6C4 d. 6^4
The number of ways in which 6 rings can be worn on the four fingers of one hand is:a. 360b. 4^6c. 6C4d. 6^4
1.2k
views
asked
Feb 17, 2016
0
votes
3
answers
107
Circular Permutation
A class is composed of 2 brothers and 6 other boys. In how many ways can all the boys be seated at a round table so that the two brothers are not seated together? a. 3000 b.3600 c. 2050 d. 2600
A class is composed of 2 brothers and 6 other boys. In how many ways can all the boys beseated at a round table so that the two brothers are not seated together?a. 3000b....
3.1k
views
asked
Feb 17, 2016
3
votes
2
answers
108
point to point link to the moon
Suppose you are designing the sliding window protocol for a 1 Mbps point to point link to the moon, which has one way latency(delay) of 1.25 seconds. assuming that each frame carries 1 KB of data, What is minimum number of bits you need for sequence number?
Suppose you are designing the sliding window protocol for a 1 Mbps point to point link to the moon, which has one way latency(delay) of 1.25 seconds. assuming that each f...
8.3k
views
asked
Dec 13, 2015
Computer Networks
computer-networks
reference-book
sliding-window
+
–
1
votes
4
answers
109
CN stop and wait bandwidth is 1.5 Mbps
If the bandwidth f the line is 1.5 Mbps, RTT is 45ms and packet size is 1KB, then find link utilization stop and wait protocol.
If the bandwidth f the line is 1.5 Mbps, RTT is 45ms and packet size is 1KB, then find link utilization stop and wait protocol.
11.1k
views
asked
Dec 13, 2015
Computer Networks
stop-and-wait
computer-networks
+
–
2
votes
5
answers
110
Which one of the following doesn’t generate same language as rest?
(a+b)*a(a+b)*(a+b)* b * a b * a (a + b)* (a + b)* a b* a b* b * a (a + b)* a b* All are generating same language.
(a+b)*a(a+b)*(a+b)*b * a b * a (a + b)*(a + b)* a b* a b*b * a (a + b)* a b*All are generating same language.
2.7k
views
asked
Aug 22, 2015
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
2
answers
111
Is this Language regular?
$L = \Bigl \{ \Sigma^* \Bigr \}$
$L = \Bigl \{ \Sigma^* \Bigr \}$
829
views
asked
Aug 13, 2015
Theory of Computation
theory-of-computation
+
–
Page:
« prev
1
2
3
4
5
6
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register