1 answer
1
How to prepare for BARC exam and how many marks required to confirm interview call from the previous cutoff’s.Thankyou.
1 answer
2
is there is easy way to find no of candidate key in these type of questions.
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 answers
4
please arrange them in increasing order of speed:Relative addressing , Absolute addressing , Register addressing , Register Indirect addressing , Indirect addressing , Ba...
0 answers
5
Can anyone explain in easy way
0 answers
6
is it correct solution?
0 answers
7
0 answers
8
What is lockout state.
0 answers
9
What is difference between B and C Option.
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 answers
11
1 answer
12
Please solve this by taking some exampleBack edgecross edgetree edgeThankyou.
0 answers
14
Very very thankful to you if anyone solve it.DCFL ∪ Recursive DCFL ∪ Recursive Enumerable Recursive ∪ Recursive EnumerableDCFL ∩ Recursive DCFL ∩ Recursive Enum...
1 answer
15
CFL ∩ DCFLCFL ∩ CSLCFL ∩ RecursiveCFL ∩ Recursive EnumerableCFL ∪ DCFLCFL ∪ CSLCFL ∪ RecursiveCFL ∪ Recursive Enumerable
0 answers
16
is it correct solution if it is correct please explain it.
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 answers
18
isomorphism and planarity is removed from Gate CSE syllabus or not?please response as soon as possible.Thank you.
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.
0 answers
20
How many nonisomorphic simple graphs are there with n vertices, when n is a) 2? b) 3? c) 4?
0 answers
21
How many nonisomorphic directed simple graphs are there with n vertices, when n isa) 2? b) 3? c) 4?
1 answer
22
How much storage is needed to represent a simple graph with n vertices and m edges usinga) adjacency lists?b) an adjacency matrix?c) an incidence matrix?Rosen_discrete_ma...
1 answer
23
Which book covers all the gate topics in Discrete mathematics and good in gate point of view.Thank you.
1 answer
24
What is the minimum and maximum no of elements can be present in below points with order "n"1. B+ tree internal node2. B+ tree root node3. B+ leaf node4. B tree internal ...
0 answers
25
what is LL(1) and LL(2) parsers.
1 answer
26
What is actual difference between in LALR(1) and CLR(1).please explain this by taking one example.
1 answer
27
what is difference between ambiguous and inherently ambiguous.please explain with example.
0 answers
28
what is prefix and proper prefix.please explain this by taking one example.
0 answers
29
what is the output frequency if the input frequency is 'f' in Ring counter.please solve this question with example and if there is any direct formula then please write it...
0 answers
30
what is the output frequency if the input frequency is 'f' in johnson counter.please solve this question with example and if there is any direct formula then please write...