Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
junk_mayavi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by junk_mayavi
3
votes
0
answers
1
given language is DCFL?
$L=\{0^l1^{2l}0^{l+n}|l\geq{0},n\geq{0}\}$
$L=\{0^l1^{2l}0^{l+n}|l\geq{0},n\geq{0}\}$
350
views
asked
Jan 18, 2018
2
votes
0
answers
2
minimal dfa
Consider the following grammar: $S\rightarrow aA|bB$ $A\rightarrow aA|bB$ $B\rightarrow bB|ϵ$ Then the number of states in a minimal D.F.A of the above grammar is ______________ ?
Consider the following grammar:$S\rightarrow aA|bB$$A\rightarrow aA|bB$$B\rightarrow bB|ϵ$Then the number of states in a minimal D.F.A of the above grammar is __________...
384
views
asked
Jan 15, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
number-of-states
+
–
3
votes
0
answers
3
gatebook test - Algorithm design paradigms
Select the wrong statement from the following given options. a. Dynamic programming is applicable when subproblems are not independent. b. Divide and conquer algorithm does more work than necessary repeatedly solving the common subproblems c. ... exactly once and saves the result into a table. d. Longest path problem has optimal substructure property.
Select the wrong statement from the following given options. a. Dynamic programming is applicable when subproblems are not independent.b. Divide and conquer algorithm doe...
582
views
asked
Jan 10, 2018
Algorithms
algorithms
test-series
dynamic-programming
+
–
3
votes
0
answers
4
OS critical section
Let 'n' processes competing to enter their critical sections and mutex be a global binary semaphore initialized to 1. The process is coded as follows: Signal(mutex); C.S; wait(mutex); Which of the following statements are TRUE? s1: This ... decision is not postponed indefinitely and there is no competition to enter as well. can we take this as progress? Please answer.
Let 'n' processes competing to enter their critical sections and mutex be a global binary semaphore initialized to 1. The process is coded as follows:Signal(mutex); C...
639
views
asked
Jan 2, 2018
Operating System
process-synchronization
operating-system
critical-section
+
–
10
votes
1
answer
5
Discrete mathematics - Combinatorics
An integer is called snakelike if its decimal representation $a_1a_2a_3...a_n$ satisfies $a_i < a_{i+1} $ if $i$ is odd and $a_i > a_{i+1}$ if $i$ is even. How many snakelike integers between $1000$ and $9999$ have four distinct digits?
An integer is called snakelike if its decimal representation $a_1a_2a_3...a_n$ satisfies $a_i < a_{i+1} $ if $i$ is odd and $a_i a_{i+1}$ if $i$ is even. How many snak...
670
views
asked
Nov 2, 2017
Combinatory
combinatory
discrete-mathematics
+
–
4
votes
2
answers
6
Discrete maths Combinatorics
How many ways can the letters $\{a,b,c,d,e\}$ be placed into $3$ identical boxes such that no box is empty?
How many ways can the letters $\{a,b,c,d,e\}$ be placed into $3$ identical boxes such that no box is empty?
583
views
asked
Nov 1, 2017
Combinatory
discrete-mathematics
combinatory
+
–
3
votes
0
answers
7
Ace Mock test
A ROM is designed with decoder and OR gates. Minimum number of OR gates required for designing a ROM while storing the function table for 8 bit squares is _________
A ROM is designed with decoder and OR gates. Minimum number of OR gates required for designing a ROM while storing the function table for 8 bit squares is _________
350
views
asked
Jan 18, 2017
Digital Logic
ace-test-series
digital-logic
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register