Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Anand.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Anand.
0
votes
1
#undecidability
why recursive enumerable languages does not satisfy the complementation property ???
why recursive enumerable languages does not satisfy the complementation property ???
392
views
answered
Jul 24, 2018
Theory of Computation
decidability
+
–
4
votes
2
NIELIT STA
Let P,Q,R be a regular expression over Σ. If P does not contain null string ,then R=Q+RP, has a unique solution 1)Q*P 2)QP* 3) Q*P* 4)(P*Q*)*
Let P,Q,R be a regular expression over Σ. If P does not contain null string ,then R=Q+RP, has a unique solution1)Q*P2)QP*3) Q*P*4)(P*Q*)*
5.1k
views
answered
Jul 5, 2018
1
votes
3
UGC NET CSE | November 2017 | Part 3 | Question: 6
A micro-instruction format has micro-ops field which is divided into three subfields $F1$, $F2$, $F3$ each having seven distinct micro-operations, conditions field $CD$ for four status bits, branch field $BR$ having four options used in conjunction ... $128$ memory locations. The size of micro-instruction is $17$ bits $20$ bits $24$ bits $32$ bits
A micro-instruction format has micro-ops field which is divided into three subfields $F1$, $F2$, $F3$ each having seven distinct micro-operations, conditions field $CD$ f...
1.7k
views
answered
Jun 29, 2018
CO and Architecture
ugcnetcse-nov2017-paper3
microprocessors
co-and-architecture
+
–
2
votes
4
Minimum spanning tree
What would be the maximum weight of minimum spanning tree of a complete connected graph with 6 vertex where each edge is of distinct +ve weights and max weight of edge is 15 1) 25 2) 26 3)27 4) none of these
What would be the maximum weight of minimum spanning tree of a complete connected graph with 6 vertex where each edge is of distinct +ve weights and max weight of edge i...
740
views
answered
Jun 28, 2018
Algorithms
minimum-spanning-tree
+
–
1
votes
5
self doubt
A fair coin is tossed until a head comes up for the first time. The probability of this happening on an odd number toss is?
A fair coin is tossed until a head comes up for the first time. The probability of this happening on an odd number toss is?
434
views
answered
Jun 26, 2018
Probability
discrete-mathematics
+
–
2
votes
6
GATE CSE 2008 | Question: 27
Aishwarya studies either computer science or mathematics everyday. If she studies computer science on a day, then the probability that she studies mathematics the next day is $0.6$. If she studies mathematics on a day, then the probability that she studies computer ... what is the probability that she studies computer science on Wednesday? $0.24$ $0.36$ $0.4$ $0.6$
Aishwarya studies either computer science or mathematics everyday. If she studies computer science on a day, then the probability that she studies mathematics the next da...
7.6k
views
answered
Jun 13, 2018
Probability
gatecse-2008
probability
normal
conditional-probability
+
–
1
votes
7
Time Complexity
What is the time complexity of the following code? for(i=n;i>=1;) i=i/2;
What is the time complexity of the following code?for(i=n;i>=1;)i=i/2;
371
views
answered
Jun 11, 2018
Algorithms
algorithms
time-complexity
+
–
0
votes
8
Bayes Probability Question
URN I contains 3 White,2 Black 2 Green Balls. URN II contains 2 White,3 Black 4 Green Balls. URN III contains 5 White,2 Black 2 Green Balls. An urn is chosen at random and two balls are drawn,they happen to be black and green. What is the probability that the come from urns 1) URN I 2) URN II 3) URN III ????
URN I contains 3 White,2 Black 2 Green Balls.URN II contains 2 White,3 Black 4 Green Balls.URN III contains 5 White,2 Black 2 Green Balls.An urn is chosen at random and t...
2.1k
views
answered
Jun 1, 2018
Probability
probability
conditional-probability
engineering-mathematics
+
–
1
votes
9
Sliding window protocol
A channel has bit rate of $1 \hspace{0.1cm} Mbps$ and propagation delay of $270 \hspace{0.1cm} msec$ .Frame size is of $125 \hspace{0.1cm} bytes$ . Acknowledgement is always piggibacked onto data frames .Four bit sequence no. Is used .ignore header size,then what is maximum achievable channel utilization for GO-BACK-N? $1.48\%$ $0.18\%$ $2.95\%$ $2.78\%$
A channel has bit rate of $1 \hspace{0.1cm} Mbps$ and propagation delay of $270 \hspace{0.1cm} msec$ .Frame size is of $125 \hspace{0.1cm} bytes$ . Acknowledgement is alw...
1.9k
views
answered
May 31, 2018
Computer Networks
computer-networks
go-back-n
+
–
2
votes
10
Made easy test series
565
views
answered
May 30, 2018
Algorithms
made-easy-test-series
time-complexity
+
–
1
votes
11
#CO and Architecture
There is a $5$ stage Instruction pipeline, which takes $1$ $ns$ to execute each cycle. There are $4000$ branch instructions with a delay of $2$ clock cycles and $6000$ normal instructions ( They get completed in $5$ stages). What will be the total ... total time for execution will be $6004 + 4006 = 10010$ $ns$ Is this a correct answer and right way to solve such problem?
There is a $5$ stage Instruction pipeline, which takes $1$ $ns$ to execute each cycle. There are $4000$ branch instructions with a delay of $2$ clock cycles and $6000$ no...
565
views
answered
May 30, 2018
CO and Architecture
co-and-architecture
+
–
3
votes
12
GATE CSE 2018 | Question: 9
The following are some events that occur after a device controller issues an interrupt while process $L$ is under execution. P. The processor pushes the process status of $L$ onto the control stack Q. The processor finishes the execution of the ... based on the interrupt Which of the following is the correct order in which the events above occur? QPTRS PTRSQ TRPQS QTPRS
The following are some events that occur after a device controller issues an interrupt while process $L$ is under execution.P. The processor pushes the process status of ...
10.4k
views
answered
Feb 14, 2018
Operating System
gatecse-2018
operating-system
interrupts
normal
1-mark
+
–
0
votes
13
The Unix Kernel maintains two key data structures related to processes
The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is/are the part of user structure? i) File descriptor table ii) System call state iii) Scheduling parameters iv)Kernel stack both i,iv both ii,iv only i,ii all i,ii,iv
The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is/are the part of user s...
3.1k
views
answered
Apr 15, 2017
Operating System
operating-system
+
–
0
votes
14
cpu scheduling
A process burst time can be using exponential averaging technique of shortest process next scheduling. Assume E(t) is the estimation burst time of a process at time t , B(t) is the actual burst time of a process at time t , and 0<=α<=1. What is the formula to predict the burst time of t? a) E(t) = B(t) ... + (1 - α) * B(t - 2) d) E(t) = α * E(t - 1) + (1 - α) * B(t - 1) e) none
A process burst time can be using exponential averaging technique of shortest process next scheduling.Assume E(t) is the estimation burst time of a process at time t , B(...
412
views
answered
Apr 2, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register