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
Recent activity by Nishant Arora
1
answer
1
MADE EASY TEST SERIES
Which of the following represents the minimum number of states in DFA for given language : 5 states 6 states 7 states 8 states I am being able to draw a DFA with 5 states but Made easy says 6 states are required. Please verify.
Which of the following represents the minimum number of states in DFA for given language :5 states6 states7 states8 statesI am being able to draw a DFA with 5 states but ...
284
views
answer selected
Jan 17, 2017
2
answers
2
LL(k) grammars
1. LL(k) grammars have one to one correspondance with DCFL's 2. LR(k) grammars have one to one correspondance with CFL's Which of them is True and explain it bit clearly?
1. LL(k) grammars have one to one correspondance with DCFL's2. LR(k) grammars have one to one correspondance with CFL'sWhich of them is True and explain it bit clearly?
5.4k
views
commented
Jan 15, 2017
Compiler Design
theory-of-computation
compiler-design
grammar
ll-parser
+
–
1
answer
3
time complexity
What is the time complexibilty of the following code?Assume "statement" takes O(1) time. int x=0; int A(n) { statement; if (n==1) { return 1; } else { x += 4 A(n/2) + n2; return x; } }
What is the time complexibilty of the following code?Assume "statement" takes O(1) time.int x=0; int A(n) { statement; if (n==1) { return 1; } else { x += 4 A(n/2) + n2; ...
411
views
commented
Jan 3, 2017
Algorithms
time-complexity
algorithms
+
–
4
answers
4
GATE CSE 1992 | Question: 02-ii
All digital circuits can be realized using only Ex-OR gates Multiplexers Half adders OR gates
All digital circuits can be realized using onlyEx-OR gatesMultiplexersHalf addersOR gates
10.7k
views
commented
Dec 19, 2016
Digital Logic
gate1992
normal
digital-logic
digital-circuits
multiple-selects
functional-completeness
combinational-circuit
+
–
4
answers
5
MadeEasy Test Series: Algorithms - Time Complexity
i=0 for(i=1;i<=n;++i) for(j=1;j<=i*i;++j) if((j%i)==0) for(k=1;k<=j;++k) c=c+1; find time complexity of these program?
i=0 for(i=1;i<=n;++i) for(j=1;j<=i*i;++j) if((j%i)==0) for(k=1;k<=j;++k) c=c+1;find time complexity of these program?
1.1k
views
commented
Dec 17, 2016
Algorithms
made-easy-test-series
algorithms
time-complexity
+
–
2
answers
6
MadeEasy Test Series: Linear Algebra - Eigen Value
can we use some identity to find value of ab+by+ya???without finding its eigen values and then multiplying..earlier i have read it somewhere but i forget it.
can we use some identity to find value of ab+by+ya???without finding its eigen values and then multiplying..earlier i have read it somewhere but i forget it.
759
views
answer selected
Dec 15, 2016
Linear Algebra
made-easy-test-series
engineering-mathematics
linear-algebra
eigen-value
+
–
1
answer
7
MadeEasy Test Series: Set Theory & Algebra - Groups
Which of the following is true? Every lower triangular matrix is group under multiplication operation where all elements of diagonal are non zero numbers. Every diagonal matrix is group under multiplication operation, where all elements of ... under addition operation where all elements are real numbers. Both (a) and b) Why is C incorrect?
Which of the following is true?Every lower triangular matrix is group under multiplication operation where all elements of diagonal are non zero numbers.Every diagonal ma...
865
views
commented
Dec 15, 2016
Set Theory & Algebra
made-easy-test-series
engineering-mathematics
discrete-mathematics
set-theory&algebra
group-theory
+
–
1
answer
8
test book
The minimum number of states required to contruct a DFA accepting languages L= { w | w has an even number of both 0's and 2 's , and an odd number of 1's } over the alphabet $\Sigma =\left \{ 0,1,2,3 \right \}$ is _____ please write regular expression also.
The minimum number of states required to contruct a DFA accepting languages L= { w | w has an even number of both 0's and 2 's , and an odd number of 1's } over the alph...
1.2k
views
commented
Dec 15, 2016
Theory of Computation
regular-expression
minimal-state-automata
number-of-dfa
testbook-test-series
theory-of-computation
+
–
0
answers
9
ME FLT-1 Q-10
i have used hypergeometric distribution but MADE Easy have used binomial theorem..we should use binomial when replacement are done na? my ans.0.6 made easy ans:0.81
i have used hypergeometric distribution but MADE Easy have used binomial theorem..we should use binomial when replacement are done na?my ans.0.6made easy ans:0.81
394
views
asked
Dec 13, 2016
Mathematical Logic
probability
made-easy-test-series
test-series
+
–
1
answer
10
PDA membership
664
views
answer selected
Dec 8, 2016
2
answers
11
HOW TO SOLVE THIS ONE?
Consider unspanned blocking with 20 byte blocks. A file contains records of sizes 2,5,3,7,4,20 bytes. The percentage of space wasted if blocks are allocated for file is __________
Consider unspanned blocking with 20 byte blocks. A file contains records of sizes 2,5,3,7,4,20 bytes. The percentage of space wasted if blocks are allocated for file is ...
663
views
answer selected
Dec 7, 2016
2
answers
12
GATE CSE 1999 | Question: 1.11, UGCNET-Dec2015-II: 44
System calls are usually invoked by using a software interrupt polling an indirect jump a privileged instruction
System calls are usually invoked by usinga software interruptpollingan indirect jumpa privileged instruction
12.2k
views
answer selected
Dec 3, 2016
Operating System
gate1999
operating-system
normal
ugcnetcse-dec2015-paper2
os-protection
+
–
1
answer
13
made easy technical
i think option should be B if it is left skewed..same type questionhttps://gateoverflow.in/974/gate2006-13
i think option should be B if it is left skewed..same type questionhttps://gateoverflow.in/974/gate2006-13
339
views
answer selected
Nov 22, 2016
12
answers
14
GATE CSE 2006 | Question: 48
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $2$ ... exist a cycle in $G$ containing $u$ and $ν$ There must exist a cycle in $G$ containing $u$ and all its neighbours in $G$
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $...
21.4k
views
commented
Nov 21, 2016
Algorithms
gatecse-2006
algorithms
graph-algorithms
normal
graph-search
+
–
1
answer
15
class of language
1. L = {<M>|M is a TM and L(M) is countable} 2. L = {<M>|M is a TM and L(M) is uncountable} what is the class of 1 and 2 recursive/RE/NOT RE
1. L = {<M>|M is a TM and L(M) is countable}2. L = {<M>|M is a TM and L(M) is uncountable}what is the class of 1 and 2 recursive/RE/NOT RE
2.1k
views
edited
Nov 13, 2016
Theory of Computation
theory-of-computation
identify-class-language
decidability
turing-machine
+
–
1
answer
16
GBook TOC Grand Test 1 Q 4
L is a language in which number of b's is twice the number of a's. M is a language in which every 'a' is being followed by exactly 2b's. N is a language in which all a's are followed by double number of b's . Which of ... a's is twice the number of b's to L is a language in which number of b's is twice the number of a's.
L is a language in which number of b's is twice the number of a's. M is a language in which every 'a' is being followed by exactly 2b's. N is a language in which all a’...
1.0k
views
commented
Nov 10, 2016
Theory of Computation
gatebook-toc
+
–
2
answers
17
CPU Scheduling
Q1) An OS contains 10 identical processes that were initiated at the same time. Each process contains 15 identical requests, and each request consumes 20msec of CPU time. A request is followed by an I/O operation that consumes 10 msec. The system consumes 2 msec in CPU ... Q 2) In the above problem , the scheduler length is A) 3300 msec B) 3600 msec C) 6300 msec D) 6600 msec
Q1)An OS contains 10 identical processes that were initiated at the same time. Each process contains 15 identical requests, and each request consumes 20msec of CPU time. ...
2.2k
views
commented
Oct 21, 2016
Operating System
process-scheduling
+
–
2
answers
18
Doubt
L = { an bm cp dq , n != m or p != q } Is it inherently ambiguous or not????
L = { an bm cp dq , n != m or p != q }Is it inherently ambiguous or not????
764
views
commented
Oct 20, 2016
Theory of Computation
theory-of-computation
inherently-ambiguous
+
–
9
answers
19
GATE CSE 2005 | Question: 72
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); } Let $u,v$ be the values printed by the parent process and $x,y$ be the values printed by the child ... $u + 10 = x \text{ and } v = y$ $u + 10 = x \text{ and } v != y$
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); }Let $u,v$ be the values pr...
37.8k
views
commented
Oct 19, 2016
Operating System
gatecse-2005
operating-system
fork-system-call
normal
+
–
0
answers
20
memory management
A computer system has a 36-bit virtual address space with a page size of 8K, and 4 bytes per page table entry.What is the maximum size of addressable physical memory in this system?
A computer system has a 36-bit virtual address space with a page size of 8K, and 4 bytes per page table entry.What is the maximum size of addressable physical memory in t...
683
views
closed
Oct 18, 2016
Operating System
memory-management
virtual-memory
+
–
2
answers
21
homework nyu
In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bit 8-bit 6-bit 8 bit We use a 3-level page table, such that the first 10-bit are for the first level and so on. What is the size of a page table for a process that has 256K of memory starting at address 0? (assume 2Byte per entry for all the levels)
In a 32-bit machine we subdivide the virtual address into 4 segments as follows: 10-bit8-bit6-bit8 bitWe use a 3-level page table, such that the first 10-bit are for the...
5.7k
views
edited
Oct 18, 2016
Operating System
memory-management
virtual-memory
+
–
2
answers
22
Graph connectivity
Consider the following statements $S1:2,3,3,3,3,3,4$ is a graphic sequence $S2:$ A connected graph with $10$ vertices and $16$ edges without having a cycle of length $3$, is a planar graph. Both $S1$ and $S2$ are true $S1$ is false but $S2$ is true $S2$ is false but $S1$ is true Both $S1$ and $S2$ are false
Consider the following statements$S1:2,3,3,3,3,3,4$ is a graphic sequence$S2:$ A connected graph with $10$ vertices and $16$ edges without having a cycle of length $3$, i...
1.1k
views
comment edited
Oct 17, 2016
Graph Theory
graph-theory
graph-connectivity
euler-graph
+
–
3
answers
23
Probability Expectaiton
A box contain 2 red balls and 3 white balls. The random experiment is picking two balls from the box. When 2 white balls picked, the balls will be replaced and experiment repeated. Otherwise stop the experiment. What is the expected number of repetations?
A box contain 2 red balls and 3 white balls. The random experiment is picking two balls from the box. When 2 white balls picked, the balls will be replaced and experiment...
594
views
commented
Oct 8, 2016
Mathematical Logic
probability
expectation
+
–
4
answers
24
Kenneth Rosen Edition 7 Exercise 6.1 Question 22 (Page No. 396)
How many positive integers less than $1000$ are divisible by $7?$ are divisible by $7$ but not by $11?$ are divisible by both $7$ and $11?$ are divisible by either $7$ or $11?$ are divisible by exactly one of $7$ and $11?$ are divisible by neither $7$ nor $11? $ have distinct digits? have distinct digits and are even?
How many positive integers less than $1000$are divisible by $7?$are divisible by $7$ but not by $11?$ are divisible by both $7$ and $11?$ are divisible by either $7$ or $...
6.4k
views
commented
Oct 7, 2016
Combinatory
kenneth-rosen
discrete-mathematics
counting
descriptive
+
–
2
answers
25
If two squares are chosen at random on a chess board the probability that they have a side in common is?
a) 1/9b) 2/7c) 1/18d) none
3.7k
views
commented
Oct 7, 2016
Probability
probability
+
–
1
answer
26
Probability Distribution
In cartesian co-ordinate system,along the x axis two points p and q are selected uniformly at random in $\left [ 0,L \right ]$ where L > 0. What is the probability of $\text{distance(p,q)} \leq \frac{L}{4}$.
In cartesian co-ordinate system,along the x axis two points p and q are selected uniformly at random in $\left [ 0,L \right ]$ where L 0.What is the probability of $\tex...
796
views
commented
Oct 6, 2016
Probability
probability
engineering-mathematics
uniform-distribution
+
–
3
answers
27
Expectated no of coin toss
An unbiased coin is tossed repeatedly and outcomes are recorded. What is the expected no of toss to get HT ( one head and one tail consecutively) ?
An unbiased coin is tossed repeatedly and outcomes are recorded. What is the expected no of toss to get HT ( one head and one tail consecutively) ?
3.0k
views
commented
Sep 26, 2016
Probability
discrete-mathematics
probability
expectation
counting
+
–
2
answers
28
Limits
How to slove this $\lim_{n\rightarrow \infty }\left ( 10^{n}+n^{20} \right )/n!$
How to slove this$\lim_{n\rightarrow \infty }\left ( 10^{n}+n^{20} \right )/n!$
482
views
commented
Sep 25, 2016
Calculus
limits
+
–
1
answer
29
Calcus
1. f(x)=|x|+ |x+1|+ |x+2| is diffrentiable at x= 1 How it 1 Please Explain ?
1. f(x)=|x|+ |x+1|+ |x+2| is diffrentiable at x= 1 How it 1 Please Explain ?
440
views
commented
Sep 24, 2016
1
answer
30
DM
$P\left ( x,y \right )\Rightarrow x+y=10$ State true/false 1.$\exists x\, \forall y \, \, P\left ( x,y \right )$. 2.$\forall y\, \exists x\, \, P\left ( x,y \right )$ if im wrong plz correct me.......
$P\left ( x,y \right )\Rightarrow x+y=10$State true/false1.$\exists x\, \forall y \, \, P\left ( x,y \right )$.2.$\forall y\, \exists x\, \, P\left ( x,y \right )$if im w...
319
views
answered
Sep 24, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register