Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Smishra95
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Smishra95
1
answer
1
Automata for given Regular Expression
Can you please draw the DFA for given regex (ab*)*
Can you please draw the DFA for given regex (ab*)*
658
views
commented
Dec 22, 2018
Theory of Computation
theory-of-computation
regular-expression
finite-automata
regular-language
expression
+
–
1
answer
2
#viral math
6÷2(1+2) = ?
6÷2(1+2) = ?
261
views
commented
Nov 2, 2018
1
answer
3
Testbook Test Series: Theory of Computation - Identify Class Language
Is L={1n0n0m | m+n>100} a regular language?
Is L={1n0n0m | m+n>100} a regular language?
579
views
commented
Oct 30, 2018
Theory of Computation
testbook-test-series
theory-of-computation
identify-class-language
+
–
1
answer
4
Pipeline : Number of RAW dependencies
Consider the below instructions executed on a 5 stage(IF,ID,EX,MA,WB) RISC pipeline with operand forwarding. I1: ADD R0,R1,R2 (R0=R1+R2) I2: SUB R3,R0,R2 I3:MUL R4,R3,R0 I4:DIV R5,R4,R0 How many RAW dependencies?
Consider the below instructions executed on a 5 stage(IF,ID,EX,MA,WB) RISC pipeline with operand forwarding.I1: ADD R0,R1,R2 (R0=R1+R2)I2: SUB R3,R0,R2I3:MUL R4,R3,R0I4:D...
2.2k
views
commented
Oct 23, 2018
CO and Architecture
data-hazards
hazards
co-and-architecture
pipelining
data-dependency
+
–
2
answers
5
Process Scheduling
683
views
commented
Oct 22, 2018
Operating System
process-scheduling
priority-queue
+
–
2
answers
6
Er diagram
1.3k
views
commented
Oct 22, 2018
Databases
databases
er-diagram
+
–
1
answer
7
ACE test series
(00)*+0(00)*+00(000)* regular expression represents
(00)*+0(00)*+00(000)* regular expression represents
308
views
commented
Oct 22, 2018
1
answer
8
#virtualgate
580
views
commented
Oct 19, 2018
0
answers
9
Finite Automata
480
views
comment edited
Oct 18, 2018
Theory of Computation
finite-automata
theory-of-computation
minimal-state-automata
regular-expression
+
–
9
answers
10
GATE IT 2004 | Question: 40
Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where $K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and $Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsilon), (s, a)), (( s, a, a), (f, \epsilon)), ((f, a, a), (f, \epsilon)), ((f, b, a), (f, \epsilon))\}$. Which one of the following strings is not a member of $L(M)$? $aaa$ $aabab$ $baaba$ $bab$
Let $M = (K, Σ, Г, Δ, s, F)$ be a pushdown automaton, where$K = (s, f), F = \{f\}, \Sigma = \{a, b\}, Г = \{a\}$ and$Δ = \{((s, a, \epsilon), (s, a)), ((s, b, \epsil...
38.5k
views
commented
Oct 17, 2018
Theory of Computation
gateit-2004
theory-of-computation
pushdown-automata
normal
+
–
0
answers
11
made easy test series
364
views
commented
Oct 17, 2018
0
answers
12
made easy
am not getting this question even after reading it many times!!
am not getting this question even after reading it many times!!
294
views
commented
Oct 17, 2018
1
answer
13
DECIDABILITY
L = {<M> | L(M) = {1}} L = {<M> | L(M) is {} } L = {<M> | L(M) has exactly 100 strings} which are REC R E BUT not REC , NOT EVEN RE
L = {<M | L(M) = {1}}L = {<M | L(M) is {} }L = {<M | L(M) has exactly 100 strings} which are REC R E BUT not REC , NOT EVEN RE
602
views
asked
Oct 16, 2018
Theory of Computation
decidability
recursive-and-recursively-enumerable-languages
theory-of-computation
+
–
1
answer
14
ace test series
465
views
commented
Oct 15, 2018
2
answers
15
cache memory
Number of sets = 128 2 way set Associative Cache size = 4Kbytes Main memory has 21 bit address What are the sizes of the cache blocks and number of cache blocks respectively?
Number of sets = 1282 way set AssociativeCache size = 4KbytesMain memory has 21 bit addressWhat are the sizes of the cache blocks and number of cache blocks respectively?...
828
views
commented
Oct 15, 2018
CO and Architecture
co-and-architecture
cache-memory
numerical-answers
+
–
1
answer
16
PNC (aptitude)
Arrange 8 cars such that there are exactly 4 cars between 2 specified cars.
Arrange 8 cars such that there are exactly 4 cars between 2 specified cars.
2.7k
views
commented
Oct 15, 2018
Verbal Aptitude
combinatory
+
–
1
answer
17
what is the output of this program and how
#include<stdio.h> void swap (char *x, char *y) { char *t = x; x = y; y = t; } int main() { char *x = "raghav"; char *y = "ravi"; char *t; swap(x, y); printf("(%s, %s)", x, y); t = x; x = y; y = t; printf("\n(%s, %s)", x, y); return 0; }
#include<stdio.h>void swap (char *x, char *y){ char *t = x; x = y; y = t;}int main(){ char *x = "raghav"; char *y = "ravi"; char *t; swap(x, y); printf("(%s...
541
views
commented
Oct 15, 2018
1
answer
18
Made Easy
A translational look aside buffer is a hardware device used for speeding up the conversation from virtual address to physical address. Consider a memory management unit where a memory reference takes 500 nanoseconds; TLB (Translation Look aside Buffer) reference takes 40 ... 80%. The speed-up (in %) we gained using TLB technique compared to the pure paging with no TLB ________.
A translational look aside buffer is a hardware device used for speeding up the conversation from virtual address to physical address. Consider a memory management unit w...
526
views
commented
Oct 15, 2018
1
answer
19
Multilevel paging
Doubt In multi level paging Is it required that all the pages of the page table should be in main memory like inner page table and outer page table should be in main memory or either by loading only outer page table we can run the process if any inner page table page required it generate a trap(page fault )and that inner page will put into the main memory by os ?
DoubtIn multi level paging Is it required that all the pages of the page table should be in main memory like inner page table and outer page table should be in main memo...
352
views
answered
Oct 14, 2018
Operating System
doubt
+
–
1
answer
20
regular exprression
what is the equivalent nfa for the given regular expression? a*b*(ba)*a*
what is the equivalent nfa for the given regular expression?a*b*(ba)*a*
595
views
commented
Oct 11, 2018
Theory of Computation
regular-expression
+
–
3
answers
21
Degree of vertices
Consider an undirected graph with $n$ vertices, vertex $1$ has degree $1$,while each vertex $2,3,.............,n-1$ has degree $4$.The degree of vertex $n$ is unknown. Which of the following statement must be true? Vertex $n$ has degree $1$ Graph is connected There is a path from vertex $1$ to vertex $n$ Spanning tree will include edge connecting vertex $1$ and vertex $n$
Consider an undirected graph with $n$ vertices, vertex $1$ has degree $1$,while each vertex $2,3,.............,n-1$ has degree $4$.The degree of vertex $n$ is unknown. Wh...
1.1k
views
commented
Oct 10, 2018
Graph Theory
discrete-mathematics
graph-theory
+
–
1
answer
22
solve my Q
305
views
commented
Oct 10, 2018
1
answer
23
doubt on networking
pop is statefull of stateless protocol?
pop is statefull of stateless protocol?
290
views
answered
Oct 10, 2018
3
answers
24
Number of 0 address instructions possible
How many maximum number of zero address instructions possible?
How many maximum number of zero address instructions possible?
631
views
answer edited
Oct 10, 2018
CO and Architecture
co-and-architecture
zero-address-instruction
self-doubt
+
–
2
answers
25
GateForum Test Series: Theory Of Computation - Recursive and Recursively Enumerable Languages
What is Turing Decidable and Turing Recognizable and What to conclude from those terms?
What is Turing Decidable and Turing Recognizable and What to conclude from those terms?
632
views
answered
Oct 10, 2018
Theory of Computation
gateforum-test-series
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
1
answer
26
Maxima and Minima
Find the stationary points, maxima and minima f(x)=|x+1|+|x-1| , -3<=x<=2
Find the stationary points, maxima and minimaf(x)=|x+1|+|x-1| , -3<=x<=2
803
views
commented
Oct 10, 2018
Calculus
calculus
engineering-mathematics
maxima-minima
+
–
1
answer
27
Complete Graph
Consider the following graph: Number of the Hamiltonian cycles starting and ending point at $ A$ is _______
Consider the following graph:Number of the Hamiltonian cycles starting and ending point at $ A$ is _______
873
views
commented
Oct 10, 2018
Graph Theory
engineering-mathematics
discrete-mathematics
graph-theory
+
–
1
answer
28
Self Doubt
Switch can't reduce broadcast domain because it is not a network layer device.Is my reasoning correct?
Switch can't reduce broadcast domain because it is not a network layer device.Is my reasoning correct?
669
views
answered
Oct 10, 2018
1
answer
29
ACE MOCK TEST
what is the difference between CSMA/CD and CSMA/CA
what is the difference between CSMA/CD and CSMA/CA
410
views
answered
Oct 10, 2018
1
answer
30
dbms question 6
297
views
commented
Oct 9, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register