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 jaiganeshcse94
0
votes
4
answers
1
minimal DFA
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
894
views
asked
Sep 26, 2017
Theory of Computation
finite-automata
theory-of-computation
minimal-state-automata
+
–
0
votes
0
answers
2
CN Question
Consider 1 Record = n bytes, Recommended Payload Size >= 960, Derive an formula to find total number of Records and Total Payload size with an Example.
Consider 1 Record = n bytes, Recommended Payload Size >= 960, Derive an formula to find total number of Records and Total Payload size with an Example.
338
views
asked
Jan 6, 2017
0
votes
2
answers
3
construct a DFA for the following language
construct a minimal DFA for the following language ,Set of all strings which start and end with same symbol
construct a minimal DFA for the following language ,Set of all strings which start and end with same symbol
1.1k
views
asked
Aug 22, 2016
3
votes
1
answer
4
Introduction to languages and the theory of computing by "john c martin" page no. 48
A minimal DFA for language L={x∈{a, b}* | x ends with 'b' and does not contain the substring 'aa'}?
A minimal DFA for language L={x∈{a, b}* | x ends with 'b' and does not contain the substring 'aa'}?
677
views
asked
Jul 28, 2016
Theory of Computation
finite-automata
+
–
3
votes
6
answers
5
Introduction to theory of computing by "Michael sipser" 3rd edition page no:37
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
5.0k
views
asked
Jul 27, 2016
Theory of Computation
finite-automata
+
–
5
votes
2
answers
6
ISRO2009-7
Advanced Encryption Standard (AES) is based on Asymmetric key algorithm Symmetric key algorithm Public key algorithm Key exchange
Advanced Encryption Standard (AES) is based onAsymmetric key algorithmSymmetric key algorithmPublic key algorithmKey exchange
3.8k
views
asked
Jun 2, 2016
Computer Networks
isro2009
computer-networks
cryptography
network-security
+
–
3
votes
5
answers
7
ISRO2008-60
Overlaying requires use of a loader allows larger programs, but requires more effort is most used on large computers is transparent to the user
Overlayingrequires use of a loaderallows larger programs, but requires more effortis most used on large computersis transparent to the user
4.7k
views
asked
Jun 2, 2016
Operating System
isro2008
operating-system
threads
+
–
0
votes
0
answers
8
dynamic address trasalation
271
views
asked
Jun 1, 2016
0
votes
0
answers
9
feedback queues
228
views
asked
Jun 1, 2016
4
votes
4
answers
10
ISRO2008-45
The TRAP is one of the interrupts available in $\textsf{INTEL 8085}.$ Which one of the following statements is true of TRAP ? it is level triggered it is negative edge triggered it is $\textsf{+ve}$ edge triggered it is both $\textsf{+ve}$ and $\textsf{-ve}$ edges triggered
The TRAP is one of the interrupts available in $\textsf{INTEL 8085}.$ Which one of the following statements is true of TRAP ?it is level triggeredit is negative edge trig...
4.0k
views
asked
Jun 1, 2016
CO and Architecture
isro2008
co-and-architecture
8085-microprocessor
non-gate
+
–
9
votes
1
answer
11
ISRO2008-31
If the two matrices $\begin{bmatrix} 1 &0 &x \\ 0 & x& 1\\ 0 & 1 & x \end{bmatrix}$ and $\begin{bmatrix} x &1 &0 \\ x & 0& 1\\ 0 & x & 1 \end{bmatrix}$ have the same determinant, then the value of $x$ is $\frac{1}{2}$ $\sqrt2$ $\pm \frac{1}{2}$ $\pm \frac{1}{\sqrt2}$
If the two matrices $\begin{bmatrix} 1 &0 &x \\ 0 & x& 1\\ 0 & 1 & x \end{bmatrix}$ and $\begin{bmatrix} x &1 &0 \\ x & 0& 1\\ 0 & x & 1 \end{bmatrix}$ have the same dete...
2.4k
views
asked
May 31, 2016
Linear Algebra
isro2008
linear-algebra
matrix
determinant
+
–
5
votes
2
answers
12
ISRO2011-65
The Cyclomatic Complexity metric V(G) of the following control flow graph 3 4 5 6
The Cyclomatic Complexity metric V(G) of the following control flow graph3456
4.4k
views
asked
May 30, 2016
IS&Software Engineering
isro2011
is&software-engineering
cyclomatic-complexity
+
–
8
votes
4
answers
13
ISRO2011-24
If the page size in a 32-bit machine is 4K bytes then the size of page table is 1 M bytes 2 M bytes 4 M bytes 4 K bytes
If the page size in a 32-bit machine is 4K bytes then the size of page table is1 M bytes2 M bytes4 M bytes4 K bytes
22.7k
views
asked
May 27, 2016
Operating System
isro2011
operating-system
paging
virtual-memory
+
–
0
votes
0
answers
14
if the page size in a 32-bit machine is 4k bytes then the size of page table is
447
views
asked
May 27, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register