Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Prabhanjan_1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Prabhanjan_1
4
votes
0
answers
1
combinatorics
How many three-digit numbers are there such that no two adjacent digits of the number are consecutive ?
How many three-digit numbers are there such that no two adjacent digits of the number are consecutive ?
307
views
asked
Dec 23, 2017
Combinatory
discrete-mathematics
combinatory
+
–
2
votes
2
answers
2
Right Quotient
$L_{1}=\left\{a^{n}b^{n}c^{n}|n>=0\right\}\\ L_{2}=\left\{b^{i}c^{j}|i,j>=0\right\}\\ Find \ out\ L_{1}/L_{2}$
$L_{1}=\left\{a^{n}b^{n}c^{n}|n>=0\right\}\\L_{2}=\left\{b^{i}c^{j}|i,j>=0\right\}\\Find \ out\ L_{1}/L_{2}$
1.4k
views
asked
Nov 3, 2017
Theory of Computation
theory-of-computation
closure-property
regular-language
+
–
1
votes
1
answer
3
Fibonacci-Sequence
Which of the following is true about time complexity for generating $\color{blue} {n^{th}}$ Fibonacci number ? a)$O(n)$ b)$O(Logn)$ c)$O(2^n)$ d)$\Omega(n)$
Which of the following is true about time complexity for generating $\color{blue} {n^{th}}$ Fibonacci number ? a)$O(n)$b)$O(Logn)$c)$O(2^n)$d)$\Omega(n)$
1.7k
views
asked
Oct 30, 2017
Algorithms
algorithms
time-complexity
+
–
4
votes
1
answer
4
Stack
How many permutations can be obtained in the output using a stack assuming that the input 1,2,3,4,5,6 such that 3 will be popped out from stack at 3rd position ?
How many permutations can be obtained in the output using a stack assuming that the input 1,2,3,4,5,6 such that 3 will be popped out from stack at 3rd position ?
1.5k
views
asked
Sep 12, 2017
Programming in C
stack
data-structures
+
–
2
votes
3
answers
5
Integration
Solve the following $\int_{0}^{\infty}e^{-x^2}x^4dx$
Solve the following $\int_{0}^{\infty}e^{-x^2}x^4dx$
636
views
asked
Jan 16, 2017
Calculus
engineering-mathematics
integration
calculus
+
–
1
votes
1
answer
6
Minimal DFA
Number of states in Minimal DFA that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$
Number of states in Minimal DFA that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$
497
views
asked
Dec 26, 2016
Theory of Computation
theory-of-computation
minimal-state-automata
+
–
5
votes
1
answer
7
Schedule's
$1)$ Consider schedule below. Determine whether schedule is cascadeless or not ? r1(x); r2(z); r1(z); r3(x); r3(y); w1(x); c1; w3(y); c3; r2(y); w2(z); w2(y);c2
$1)$ Consider schedule below. Determine whether schedule is cascadeless or not ?r1(x); r2(z); r1(z); r3(x); r3(y); w1(x); c1; w3(y); c3; r2(y); w2(z); w2(y);c2
1.2k
views
asked
Dec 24, 2016
Databases
databases
transaction-and-concurrency
+
–
6
votes
3
answers
8
Schedules
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B).
$1)$ Find the number of all possible conflict-equivalent and view-equivalent schedules to the following serial schedules. (a) r1(A), w1(B), r2(A), w2(B), r3(A), w3(B)....
4.9k
views
asked
Dec 24, 2016
Databases
transaction-and-concurrency
conflict-serializable
view-serializable
+
–
4
votes
2
answers
9
Probability ,Settheory.
$1)$ A random selector can only select one of the nine integers $\left \{ 1,2,.....,9 \right \}$ and it makes these selections with equal probability,Assume that $n$ numbers are chosen this way.Find the probability such that the product of $n$ numbers selected is not divisible by $3$. $2)$ Let S = {1, 2, . . . , n} then Find |{(R, T) : R, T ⊆ S, R ∩ T = ∅}| = ?
$1)$ A random selector can only select one of the nine integers $\left \{ 1,2,.....,9 \right \}$ and it makes these selections with equal probability,Assume that $n$ num...
1.3k
views
asked
Dec 19, 2016
Probability
engineering-mathematics
probability
set-theory&algebra
+
–
0
votes
1
answer
10
Routing algorithm
Consider a router based on DV algorithm.Consider a five-node network given in figure. Assume all nodes building distance from that node to A.After initial setup suddenly either A goes down or link between A and B is cut.What are values at router B,C,D,E which they will find to distance A from that node after 3rd transmission ??
Consider a router based on DV algorithm.Consider a five-node network given in figure.Assume all nodes building distance from that node to A.After initial setup suddenly e...
1.1k
views
asked
Dec 18, 2016
Computer Networks
computer-networks
distance-vector-routing
+
–
7
votes
1
answer
11
CSMA/CD
1)Suppose nodes A and B are on 10Mbps Ethernet segment and the propagation delay between the two nodes is 225 bit times. Suppose A and B send frames at the same time, the frames collide, and then A and B choose different values of K say for A (k=0) ... ? 2) Assume A has started before B and B detects collision as soon as it started transmitting, Then reransmissions of A and B collide ?
1)Suppose nodes A and B are on 10Mbps Ethernet segment and the propagation delay between the two nodes is 225 bit times. Suppose A and B send frames at the same time, the...
9.4k
views
asked
Dec 9, 2016
Computer Networks
computer-networks
ethernet
csma-cd
+
–
5
votes
4
answers
12
Discrete Maths
Explain each one of the following: a ) In how many ways can we put 31 people in 3 rooms such that each room has an odd number of people ? b ) Coefficient of $x^4$ in the expansion $(1+ x + x^2 + x^3)^{11}$ using generating functions. c)Find out number of solutions $x_1+x_2+x_3 = 20 , 2<x_1<6 , 6<x_2<10 , 0<x_3<5$
Explain each one of the following:a ) In how many ways can we put 31 people in 3 rooms such that each room has an odd number of people ? b ) Coefficient of $x^4$ in the ...
1.7k
views
asked
Dec 5, 2016
Mathematical Logic
combinatory
+
–
12
votes
1
answer
13
B-tree/B+tree
1)Consider a B+ Tree of order 4 and height 3, then find a)The maximum number of records stored are ........... b)The maximum number of keys ........... c)The minimum number of records stored are ............ d)The minimum ... maximum number of keys ? 3) Find the following with order 3 and height 3 in B-tree Minimum and maximum number of keys ? Please provide detailed explanation
1)Consider a B+ Tree of order 4 and height 3, then finda)The maximum number of records stored are ...........b)The maximum number of keys ...........c)The minimum number...
9.4k
views
asked
Nov 30, 2016
Databases
databases
indexing
+
–
5
votes
1
answer
14
Round Robin
Consider a System with n–processes arriving at time 0. Scheduling overhead is ‘s’ seconds. Using Round Robin CPU Scheduling what must be the value of time quantum ‘q’ such that each process is guaranteed to gets its turn on the CPU in its subsequent run exactly twice within ‘t’ sec (inclusive)? please give detailed explaination.
Consider a System with n–processes arriving at time 0. Scheduling overhead is ‘s’ seconds. Using Round Robin CPU Scheduling what must be the value of time quantum �...
2.2k
views
asked
Nov 29, 2016
Operating System
operating-system
process-scheduling
+
–
0
votes
0
answers
15
TCP/UDP
Which of the following are true about TCP/UDP ? a)UDP handles congestion control but not Flow control. b)Slow start mechanism deals with Congestion control and Flow Control. c)Fast retransmit deals with Congestion control but not Flow control.
Which of the following are true about TCP/UDP ?a)UDP handles congestion control but not Flow control.b)Slow start mechanism deals with Congestion control and Flow Control...
869
views
asked
Nov 28, 2016
Computer Networks
computer-networks
tcp
congestion-control
+
–
1
votes
1
answer
16
Modified GATE-2014 Comparisons
Minimum number of comparisons to find minimum and maximum of 100 numbers ?? Average number of comparisons to find minimum and maximum of 100 numbers ?? Maximum number of comparisons to find minimum and maximum of 100 numbers ?? Find all the 3 cases in detailed manner which should work for all inputs.
Minimum number of comparisons to find minimum and maximum of 100 numbers ??Average number of comparisons to find minimum and maximum of 100 numbers ??Maximum number of co...
627
views
asked
Nov 6, 2016
Algorithms
algorithms
sorting
normal
descriptive
+
–
2
votes
1
answer
17
RR ALGO
Find each of the following cases with detailed explanation by an example schedule.d
Find each of the following cases with detailed explanation by an example schedule.d
818
views
asked
Nov 1, 2016
Operating System
process-scheduling
round-robin-scheduling
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register