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
Answers by Shubhanshu
2
votes
1
Self Doubt
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00 or 11.
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00or 11.
778
views
answered
Jan 19, 2019
Theory of Computation
finite-automata
number-of-dfa
minimal-state-automata
+
–
1
votes
2
ACE 2019
Normal forms
Normal forms
242
views
answered
Jan 9, 2019
0
votes
3
ME CN 1
Consider the following statements: Which of the above statement is correct? A Hidden terminals can be handled by using either of RTS or CTS control frame. B RTS/CTS exchange helps in reducing collisions and leads to efficient use of channel resources. C 802.11 frame has three address fields. D By the help of 802.11 frame, we can come to known whether encryption is used on n
Consider the following statements:Which of the above statement is correct?A Hidden terminals can be handled by using either of RTS or CTS control frame.B RTS/CTS exchange...
945
views
answered
Dec 15, 2018
Computer Networks
computer-networks
csma-ca
+
–
1
votes
4
graph theory
in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is? a. weakly connected unilaterally connected strongly connected disconnected
in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is? a. weakly connectedunilaterally conne...
1.1k
views
answered
Dec 15, 2018
4
votes
5
Doubt Integration
Can some one please how to solve above integral using mentioned property or any other way?
Can some one please how to solve above integral using mentioned property or any other way?
257
views
answered
Nov 7, 2018
3
votes
6
CPU Scheduling
Consider 3 processes A, B, and C to be scheduled as per SRTF scheduling. The process A is known to be scheduled first and when A has been running for 7 units of time the process C has arrived. The process C has run for 1 unit of time, then the process B has arrived ... running for 2 units of time. Then what could be the minimum burst time of processes A and C? 11, 3 12,3 11,4 12,4
Consider 3 processes A, B, and C to be scheduled as per SRTF scheduling. The process A is known to be scheduled first and when A has been running for 7 units of time the ...
461
views
answered
Mar 11, 2018
Operating System
process-scheduling
operating-system
+
–
2
votes
7
ethernet , jam signal
Consider two nodes A and B on the same Ethernet segment, and suppose the propagation delay between the two nodes is 300 bit times. Suppose at time both nodes A and B begin to transmit a frame. Assume both nodes transmit a 60 bit jam signal after detecting a collision. ... idle channel? [in microseconds]( Marks: 0.00 ) 22.5 micro sec 27.5 micro sec 72.5 micro sec 66 micro sec
Consider two nodes A and B on the same Ethernet segment, and suppose the propagation delay between the two nodes is 300 bit times. Suppose at time both nodes A and B begi...
1.0k
views
answered
Nov 18, 2017
Computer Networks
computer-networks
ethernet
+
–
0
votes
8
Depth first search
Consider the following graph G. Modified DFS on G applied as follows: • Starting vertex is ‘p’. • Vertex is visited based on alphabetic order. • Vertices are visited in order p, q, r, s, t, v. • It works same as DFS except the visiting order restriction What is the number of back edges during the above DFS traversal on G ______________
Consider the following graph G.Modified DFS on G applied as follows:• Starting vertex is ‘p’.• Vertex is visited based on alphabetic order.• Vertices are visite...
1.5k
views
answered
Nov 7, 2017
Algorithms
depth-first-search
+
–
2
votes
9
oprator
int main() { unsigned int x = 1; printf("Signed Result %d \n", ~x); printf("Unsigned Result %ud \n", ~x); return 0; } some one give detailed answer ... (mainly how it works )
int main(){unsigned int x = 1;printf("Signed Result %d \n", ~x);printf("Unsigned Result %ud \n", ~x);return 0;}some one give detailed answer ...(mainly how it works )
730
views
answered
Oct 13, 2017
2
votes
10
#DBMS #Normalization
620
views
answered
Oct 6, 2017
Databases
databases
database-normalization
+
–
0
votes
11
deadlock
process maximum demand currently holds p1 70 45 p2 60 40 p3 60 x p4 40 y if a system has total of 150 units of resource then identify which of the following values of X and Y the above system will be in sage state? A x=40,Y=20 B X=30 ,Y =20 C X=50 Y=10 D X=20 Y=30
processmaximum demandcurrently holdsp17045p26040p360xp440yif a system has total of 150 units of resource then identify which of the following values of X and Y the above ...
413
views
answered
Oct 5, 2017
0
votes
12
GATE Overflow | Digital Logic | Test 1 | Question: 13
$(1217)_8$ is equivalent to $(1217)_{16}$ $(028F)_{16}$ $(2297)_{10}$ $(0B17)_{16}$
$(1217)_8$ is equivalent to$(1217)_{16}$$(028F)_{16}$$(2297)_{10}$$(0B17)_{16}$
141
views
answered
Sep 30, 2017
Digital Logic
digital-logic
go-digital-logic-1
number-representation
+
–
9
votes
13
Find average CPI of non-pipeline CPU(assume ideal case for pipelining)?
Consider a 5 stage instruction pipeline having latencies (in ns) 1, 2, 3, 4 and 5 respectively. Find average CPI of non-pipeline CPU when speed up achieved with respect to pipeline is 4 (assume ideal case for pipelining)? (a) 1.23 (c) 1.66 (b) 1.33 (d) 1.73
Consider a 5 stage instruction pipeline having latencies (in ns) 1, 2, 3, 4 and 5 respectively.Find average CPI of non-pipeline CPU when speed up achieved with respect to...
3.0k
views
answered
Sep 28, 2017
CO and Architecture
co-and-architecture
pipelining
+
–
1
votes
14
chess board
number of rectangles in a chess board that are not sqaure a)1296 b)1092 c)1096 d)1292
number of rectangles in a chess board that are not sqaurea)1296b)1092c)1096d)1292
884
views
answered
Sep 12, 2017
Quantitative Aptitude
combinatory
+
–
1
votes
15
Result after bit stuffing
Data :- 011111 Flag:- 0111
Data :- 011111Flag:- 0111
1.5k
views
answered
Aug 24, 2017
Computer Networks
computer-networks
bit-stuffing
+
–
2
votes
16
Limit
The limit x->0 sin[2x/3]/x is
The limit x->0 sin[2x/3]/x is
535
views
answered
Aug 21, 2017
0
votes
17
output??
plz explain this code?? main() { char *p="hai friends",*p1; p1=p; while(*p!='\0') ++*p++; printf("%s %s",p,p1); }
plz explain this code??main(){char *p="hai friends",*p1;p1=p;while(*p!='\0') ++*p++;printf("%s %s",p,p1);}
866
views
answered
Aug 18, 2017
4
votes
18
process synchronization
What is SPIN-LOCK..?
What is SPIN-LOCK..?
679
views
answered
Aug 17, 2017
Databases
process-synchronization
operating-system
+
–
1
votes
19
UPSC prelim test
A bag contains 20 balls. 8 balls are green, 7 are white and 5 are red. What is the minimum number of balls that must be picked up from the bag blind-folded (without replacing any of it) to be assured of picking atleast one ball of each colour? a) 15 b) 16 c) 17 d)18
A bag contains 20 balls. 8 balls are green, 7 are white and 5 are red. What is the minimum number of balls that must be picked up from the bag blind-folded (without repla...
2.7k
views
answered
Aug 14, 2017
Combinatory
pigeonhole-principle
discrete-mathematics
+
–
4
votes
20
BASIC QUESTION TOC
CAN ANYONE EXPLAIN IN SIMPER MANNER GIVEN ANSWER IS A. HOW??? if we take input 0 then ?? if we take input 1 then ?? if we take input 10 then?? i have confusion as which is present input and previous bit??? The Finite state machine described by ... . (B) Outputs 01 whenever the input sequence contains 11. (C) Outputs 00 whenever the input sequence contains 10. (D) None of these
CAN ANYONE EXPLAIN IN SIMPER MANNER GIVEN ANSWER IS A.HOW???if we take input 0 then ??if we take input 1 then ??if we take input 10 then??i have confusion as which is pr...
492
views
answered
Aug 14, 2017
Theory of Computation
theory-of-computation
gateoverflow
finite-automata
+
–
0
votes
21
TOC String matching in unary aplphabet
w is defined to unary alphabet 1. L={ ww } 2.L={ w w^r } ,w^r is reverse of w Can i say both of these are regular?
w is defined to unary alphabet1. L={ ww }2.L={ w w^r } ,w^r is reverse of wCan i say both of these are regular?
456
views
answered
Aug 7, 2017
Theory of Computation
regular-language
theory-of-computation
+
–
1
votes
22
Next number in series
Find next number in series? 15,10,5,150,16,12,4,192,20,15,5,....?
Find next number in series?15,10,5,150,16,12,4,192,20,15,5,....?
1.6k
views
answered
Jul 20, 2017
Quantitative Aptitude
quantitative-aptitude
number-series
+
–
1
votes
23
context free languages
{a^m b^n c^m : m,n > 1} is this cfl?
{a^m b^n c^m : m,n 1} is this cfl?
261
views
answered
Jul 20, 2017
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register