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 bhavnakumrawat5
0
votes
0
answers
1
Barc exam
Can any one tell me....IT branch student can apply for barc in CS branch...
Can any one tell me....IT branch student can apply for barc in CS branch...
671
views
asked
Feb 3, 2019
0
votes
1
answer
2
doubt
What is semi and Partially decidable...and how we know
What is semi and Partially decidable...and how we know
665
views
asked
Oct 1, 2018
Theory of Computation
decidability
+
–
0
votes
0
answers
3
doubt
L1 = { a^n b^n c^m | n,m>=0} L2 = { a^m b^n c^n | m,n>=0} L1 intersection L2 = { { a^n b^n c^n | n>=0} how we do intersection plz explain using grammer....
L1 = { a^n b^n c^m | n,m>=0}L2 = { a^m b^n c^n | m,n>=0}L1 intersection L2 = { { a^n b^n c^n | n>=0}how we do intersection plz explain using grammer....
261
views
asked
Oct 1, 2018
Theory of Computation
context-free-grammar
+
–
1
votes
3
answers
4
doubt
How to check any set is countable or not
How to check any set is countable or not
459
views
asked
Sep 30, 2018
Theory of Computation
countable-uncountable-set
+
–
1
votes
0
answers
5
doubt - synchronization
what is difference between in both question...? it is totally look same just difference in variable. https://gateoverflow.in/1256/gate2007-58 https://gateoverflow.in/8405/gate2015-3-10
what is difference between in both question...? it is totally look same just difference in variable.https://gateoverflow.in/1256/gate2007-58 https://gateoverflow.in/8405...
582
views
asked
Sep 17, 2018
Operating System
process-synchronization
+
–
1
votes
3
answers
6
self-doubt
Consider a binary tree T that has 50 leaf nodes. Then the number of nodes in T that have exactly ONE children are ______.
Consider a binary tree T that has 50 leaf nodes. Then the number of nodes in T that have exactlyONE children are ______.
1.0k
views
asked
Jul 25, 2018
DS
binary-tree
+
–
0
votes
1
answer
7
Testbook Test Series: Programming & DS - Stack
A queue is implemented using two stacks S1 and S2. Initially the queue contains 1, 2, 3, 4 from front to rear. The following operations are performed in the queue: delete, insert (5), delete, Then how many total no. of push and pop operations are needed to perform ... ? a) Push: 12 Pop: 13 b) Push: 15 Pop: 16 c) Push: 11 Pop: 10 d) Push: 12 Pop: 11
A queue is implemented using two stacks S1 and S2. Initially the queue contains 1, 2, 3, 4 from frontto rear. The following operations are performed in the queue: delete,...
1.3k
views
asked
Jul 23, 2018
DS
testbook-test-series
data
data-structures
stack
+
–
0
votes
1
answer
8
self - doubt
how the get 3n/2 -2 comparision
how the get 3n/2 -2 comparision
347
views
asked
Jul 23, 2018
DS
array
+
–
0
votes
0
answers
9
Doubt
Given a binary string , in which direction should we place the parity bits , starting from left to right or right to left? Does both give same result Ex : Data is 1001 1. P1 P2 1 P4 0 0 1 https://www.youtube.com/watch?v=tBacTPPNIrk 2. 1 0 0 P4 1 P2 P1 https://www.youtube.com/watch?v=1A_NcXxdoCc&t=109s Which is correct?
Given a binary string , in which direction should we place the parity bits , starting from left to right or right to left? Does both give same result Ex : Data is 10011. ...
394
views
asked
Jul 21, 2018
Digital Logic
hamming-code
+
–
0
votes
0
answers
10
doubt-tree
If each node of the B-tree is 80 percent full, then what is the average number of keys per node of the above B tree?
If each node of the B-tree is 80 percent full, then what is the average number of keys per node of the above B tree?
361
views
asked
Jul 20, 2018
DS
binary-tree
+
–
0
votes
0
answers
11
Doubt
Can we solve it by master Theorem T(n)=T(n/3)+T(n/4)+6n
Can we solve it by master TheoremT(n)=T(n/3)+T(n/4)+6n
445
views
asked
Jul 18, 2018
Algorithms
time-complexity
+
–
0
votes
0
answers
12
doubt
How to Calculate Propagation Delay In Carry Look Ahead Adder.
How to Calculate Propagation Delay In Carry Look Ahead Adder.
314
views
asked
Jul 18, 2018
Digital Logic
carry-look-ahead-adder
+
–
0
votes
1
answer
13
doubt
A 4bit carry lookahead adder which add two 4bit number is designed using AND,OR,NOT,NAND,NOR gates only.Assuming that all the inputs are available in both complemented and uncomplemented form and the delay of each gate is one time unit ,what is over all propagation delay of the adder?assume that carry network has been implemented using two level AND-Or logic .
A 4bit carry lookahead adder which add two 4bit number is designed using AND,OR,NOT,NAND,NOR gates only.Assuming that all the inputs are available in both complemented an...
542
views
asked
Jul 18, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
