-
1.
zsm28
14,786 Pts
-
2.
Clark
8,287 Pts
-
3.
anonymousxyz
6,337 Pts
-
4.
XYZ88
5,797 Pts
-
5.
Henry Greenside
4,961 Pts
-
6.
MissUniverse
3,870 Pts
-
7.
rapunzel
3,071 Pts
-
8.
Muhammad Umair
2,810 Pts
-
9.
Lord Font le Roy
2,734 Pts
-
10.
iseejamespeople3
2,525 Pts
-
11.
soumya31
2,486 Pts
-
12.
Shylock
2,380 Pts
-
13.
Grace
2,366 Pts
-
14.
Med-Leddy-nessing
2,142 Pts
-
15.
KelvinTemperature
1,911 Pts
Featured Computer Science Questions
-
REGULAR EXPRESSION
Question Details
Construct a regular expression to define all words over alphabet {0,1,..,9} representing decimal numbers divisible by 25. Construct a deterministic FSA to accept the string of the language.
-
Page Replacement Algorithm Implementation (LRU, FIFO)
Question Details
Objectives:
- Implement variations of page replacement memory management schemes.
- Be able to compare and contrast the relative performance of different replacement schemes.
Description:
In programming assignment #4 you are to write a simulation of a page replacement memory management syste... -
PDA - push down automata
Question Details
Design a PDA to accept the following languages
1. L = { a^(2n) b^n : n>=0}
2. L = { wcw^R : w e {a,b}*}
3. L = { a^n b^m c^(n+m) : n>=0, m>=0}
4. L = { w : E(w) = #b(w)}
5. L = { w : E(w) < #b’s(w)} -
FSA and transition table
Question Details
Design a deteministic FSA and transition table to recognize all decimal numbers of form 4k+1, k>=0. Trace “348791” using the following table:
Current state:
Next input character:
Next state: -
FSA
Question Details
Construct an FSA to recognize the following languages
Over alphabet { a,b }
1. The set of all strings with even number of ‘baa’
2. The set of all strings with no triple letters
3. The set of all strings with b’s only in clumps of 3
Construct FSA to recognize the following languages Over
...
- Sorry, no questions found.
