0 votes
1 answer
1
How to prepare for BARC exam and how many marks required to confirm interview call from the previous cutoff’s.Thankyou.
0 votes
1 answer
2
is there is easy way to find no of candidate key in these type of questions.
0 votes
1 answer
3
If there is negative edge cycle then dijkstra algorithm will give correct path or not same thing about bellman ford also?Bellman ford always halts or not?
0 votes
0 answers
4
please arrange them in increasing order of speed:Relative addressing , Absolute addressing , Register addressing , Register Indirect addressing , Indirect addressing , Ba...
0 votes
0 answers
5
Can anyone explain in easy way
0 votes
0 answers
6
is it correct solution?
0 votes
0 answers
7
What is lockout state.
1 votes
0 answers
8
0 votes
0 answers
9
What is difference between B and C Option.
2 votes
0 answers
10
if anyone have previous year math question of gate of all branches please share by google drive and share link.please friends.Thankyou.
0 votes
0 answers
11
0 votes
1 answer
12
Please solve this by taking some exampleBack edgecross edgetree edgeThankyou.
0 votes
0 answers
13
Very very thankful to you if anyone solve it.DCFL ∪ Recursive DCFL ∪ Recursive Enumerable Recursive ∪ Recursive EnumerableDCFL ∩ Recursive DCFL ∩ Recursive Enum...
1 votes
1 answer
14
CFL ∩ DCFLCFL ∩ CSLCFL ∩ RecursiveCFL ∩ Recursive EnumerableCFL ∪ DCFLCFL ∪ CSLCFL ∪ RecursiveCFL ∪ Recursive Enumerable
0 votes
0 answers
16
is it correct solution if it is correct please explain it.
0 votes
0 answers
17
Best book for probability in gate point of view.variety of question should be in this book.and the question should be gate type.please reply fast.thank you
0 votes
0 answers
18
isomorphism and planarity is removed from Gate CSE syllabus or not?please response as soon as possible.Thank you.
0 votes
0 answers
19
How many nonisomorphic simple graphs are there with five vertices and three edges? is there is any formula for n vertices and m edges.thankyou.
1 votes
0 answers
20
How many nonisomorphic simple graphs are there with n vertices, when n is a) 2? b) 3? c) 4?