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 Saurav
0
votes
1
answer
1
Decidability
A turing machine $M$ halts if started with a blank tape. This is undecidable . Can somebody explain this in easiest way possible.
A turing machine $M$ halts if started with a blank tape. This is undecidable . Can somebody explain this in easiest way possible.
533
views
asked
Mar 19, 2018
Theory of Computation
theory-of-computation
turing-machine
+
–
0
votes
1
answer
2
Decidability
Decide whether or not the state $q$ is ever entered when $M$ is applied to string $w$. Can somebody explain the solution.
Decide whether or not the state $q$ is ever entered when $M$ is applied to string $w$.Can somebody explain the solution.
321
views
asked
Mar 19, 2018
Theory of Computation
theory-of-computation
turing-machine
+
–
1
votes
2
answers
3
max no of boolean expression that can be formed for the function f(x,y,z) satisfying the relation f(x',y,z') = f(x,yz)
Consider the following sequence of micro-operations. MBR ← PC MAR ← X PC ← Y Memory ← MBRWhich one of the following is a possible operation performed by this seq...
2.8k
views
asked
Oct 1, 2015
1
votes
1
answer
4
subnetting
An ISP is granted a block of addresses starting with 190.100.0.0/16 (65,536 addresses). The ISP needs to distribute these addresses to three groups of customers as follows: a. The first group has 64 customers; each needs 256 addresses. b. ... group has 128 customers; each needs 64 addresses. Design the subblocks and find out how many addresses are still available after these allocations
An ISP is granted a block of addresses starting with 190.100.0.0/16 (65,536 addresses). The ISPneeds to distribute these addresses to three groups of customers as follows...
4.7k
views
asked
Sep 29, 2015
0
votes
3
answers
5
graph coloring
7 var occurs in a loop of computer programm.The variable nd step during which they must be stored are t: step 1 through 6;u:step2;:steps 2 through 4 ;w:step 1 ,3 and 5;x:step 1 and 6;y:step3 through 6; nd z:step 4 nd 5. How many different index registers are needed to store these variables during execution?
7 var occurs in a loop of computer programm.The variable nd step during which they must be stored aret: step 1 through 6;u:step2;:steps 2 through 4 ;w:step 1 ,3 and 5;x:s...
694
views
asked
Sep 10, 2015
0
votes
3
answers
6
max clock frequency in ripple counter
A 3 bit ripple counter uses j k flip flops.if the propagation delay of each flipflop is 50 nsec,then the maximum clock frequency that can be used in megahertz... please explain the soln
A 3 bit ripple counter uses j k flip flops.if the propagation delay of each flipflop is 50 nsec,then the maximum clock frequency that can be used in megahertz... please e...
9.8k
views
asked
Sep 6, 2015
1
votes
2
answers
7
minimum 4*16 line decoders required to realize 8*256 line decoders are
i m getting 16 but the answer is 17 .please explain
i m getting 16 but the answer is 17 .please explain
8.5k
views
asked
Sep 6, 2015
0
votes
2
answers
8
Critical section problem
repeat flag[i]=true; turn =j; while(flag[j] and turn=j ) do no op; critical section; flag[i]= false; remainder section; until false; Above algorithm is the correct soln of the critical section ... cs then is it will be executed indefinetly and pj will never be executed if this phenomenon is repeated .so,please tell me where i m wrong .
repeat flag[i]=true; turn =j; while(flag[j] and turn=j ) do no op; critical section; flag[i]= false; remainder section; ...
1.1k
views
asked
Sep 4, 2015
0
votes
1
answer
9
The number of leaf nodes in the recurrence tree of the recurence T(n) = T(n/4) + T(n/2) + n^2
The number of leaf nodes in the recurrence tree of the recurence T(n) = T(n/4) + T(n/2) + n^2
The number of leaf nodes in the recurrence tree of the recurenceT(n) = T(n/4) + T(n/2) + n^2
1.0k
views
asked
Aug 31, 2015
Algorithms
algorithms
recurrence-relation
+
–
0
votes
1
answer
10
Path matrix
given a graph G,a matrix Pk represent a matrix in which each entry pk[i][j] represent the shortest path from node i to node j in G which uses only nodes 1,2,3.............k-1 .The corresponding graph formed by using matrix Pk[i][j] is termed as ... .now my question is how to find Gk if the graph G is represented by using adjacency list and what will be the time complexity to do it ??
given a graph G,a matrix Pk represent a matrix in which each entry pk[i][j] represent the shortest path from node i to node j in G which uses only nodes 1,2,3...........
839
views
asked
Aug 27, 2015
Algorithms
graph-theory
shortest-path
time-complexity
+
–
0
votes
1
answer
11
BFS and DFS predecessor subgraph
The predessor subgraph of BFS is a tree but the predecessor subgraph of DFS is a forest ?? please explain why??
The predessor subgraph of BFS is a tree but the predecessor subgraph of DFS is a forest ?? please explain why??
1.4k
views
asked
Aug 27, 2015
Algorithms
graph-search
graph-algorithms
+
–
0
votes
1
answer
12
accessing the (n+1)th the element of an array of size n by using pointer
In an array A[n] of size n we can access the element A[n+1] by writting *(A+n+1) . Accessing the all the elements before and after the index can be done in 0(1) time complexity.So, why we will use a linked ... any no of elements after the end point of an array . The size of each node is also larger in case of linked list.
In an array A[n] of size n we can access the element A[n+1] by writting *(A+n+1) . Accessing the all the elements before and after the index can be done in 0(1) time comp...
405
views
asked
Aug 23, 2015
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
