Dark Mode

Recent activity by iamdeepakji

1 answer

1

Self Doubt
How to prepare for BARC exam and how many marks required to confirm interview call from the previous cutoff’s. Thankyou.

commented in Others Feb 16, 2019

397 views

1 answer

2

ACE TEST SERIES
is there is easy way to find no of candidate key in these type of questions.

commented in Databases Jan 31, 2019

456 views

1 answer

3

Self doubt
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?

asked in Programming Jan 27, 2019

188 views

0 answers

4

Self doubt
please arrange them in increasing order of speed: Relative addressing , Absolute addressing , Register addressing , Register Indirect addressing , Indirect addressing , Base addressing , indexed addressing

asked in CO and Architecture Jan 27, 2019

167 views

0 answers

5

Made Easy
Can anyone explain in easy way

asked in Mathematical Logic Jan 27, 2019

96 views

0 answers

6

self doubt
is it correct solution?

commented in Computer Networks Jan 26, 2019

216 views

0 answers

7

commented in Probability Jan 16, 2019

281 views

0 answers

8

self doubt
What is lockout state.

commented in Digital Logic Jan 15, 2019

135 views

0 answers

9

Self Doubt
What is difference between B and C Option.

asked in Mathematical Logic Jan 6, 2019

146 views

0 answers

10

self doubt
if anyone have previous year math question of gate of all branches please share by google drive and share link. please friends. Thankyou.

asked in Mathematical Logic Dec 30, 2018

161 views

0 answers

11

asked in Mathematical Logic Dec 28, 2018

109 views

1 answer

12

self doubt
Please solve this by taking some example Back edge cross edge tree edge Thankyou.

commented in Programming Dec 27, 2018

181 views

0 answers

13

self doubt
Very Very Thankful to you if anyone solve it. Regular ∩ deterministic Context free Regular ∩ Context Free Regular ∩ Context Sensitive Regular ∩ Recursive Regular ∩ Recursive Enumerable Regular ∪ deterministic Context free Regular ∪ Context Free Regular ∪ Context Sensitive Regular ∪ Recursive Regular ∪ Recursive Enumerable

commented in Theory of Computation Nov 23, 2018

179 views

0 answers

14

Self Doubt
Very very thankful to you if anyone solve it. DCFL ∪ Recursive DCFL ∪ Recursive Enumerable Recursive ∪ Recursive Enumerable DCFL ∩ Recursive DCFL ∩ Recursive Enumerable Recursive ∩ Recursive Enumerable

asked in Theory of Computation Nov 23, 2018

234 views

1 answer

15

Self doubt
CFL ∩ DCFL CFL ∩ CSL CFL ∩ Recursive CFL ∩ Recursive Enumerable CFL ∪ DCFL CFL ∪ CSL CFL ∪ Recursive CFL ∪ Recursive Enumerable

asked in Theory of Computation Nov 23, 2018

173 views

0 answers

16

self doubt
is it correct solution if it is correct please explain it.

asked in Programming Nov 21, 2018

213 views

0 answers

17

self doubt
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

asked in Mathematical Logic Nov 5, 2018

158 views

0 answers

18

self doubt
isomorphism and planarity is removed from Gate CSE syllabus or not? please response as soon as possible. Thank you.

commented in Mathematical Logic Oct 31, 2018

129 views

0 answers

19

self doubt
How many nonisomorphic simple graphs are there with ﬁve vertices and three edges? is there is any formula for n vertices and m edges. thankyou.

asked in Mathematical Logic Oct 29, 2018

129 views

0 answers

20

self doubt
How many nonisomorphic simple graphs are there with n vertices, when n is a) 2? b) 3? c) 4?

asked in Mathematical Logic Oct 29, 2018

59 views

0 answers

21

self doubt
How many nonisomorphic directed simple graphs are there with n vertices, when n is a) 2? b) 3? c) 4?

asked in Mathematical Logic Oct 29, 2018

79 views

1 answer

22

self doubt
How much storage is needed to represent a simple graph with n vertices and m edges using a) adjacency lists? b) an adjacency matrix? c) an incidence matrix? Rosen_discrete_mathematics section 10.4 question 70. thankyou.

asked in Mathematical Logic Oct 29, 2018

89 views

1 answer

23

self doubt
Which book covers all the gate topics in Discrete mathematics and good in gate point of view. Thank you.

asked in Mathematical Logic Oct 25, 2018

167 views

1 answer

24

self doubt
What is the minimum and maximum no of elements can be present in below points with order "n" 1. B+ tree internal node 2. B+ tree root node 3. B+ leaf node 4. B tree internal node 5. B tree root node 6. B tree leaf node Thank you in advance.

asked in Databases Oct 16, 2018

87 views

0 answers

25

Self Doubt
what is LL(1) and LL(2) parsers.

asked in Compiler Design Oct 10, 2018

100 views

1 answer

26

Self Doubt
What is actual difference between in LALR(1) and CLR(1). please explain this by taking one example.

asked in Compiler Design Oct 10, 2018

170 views

1 answer

27

self doubt
what is difference between ambiguous and inherently ambiguous. please explain with example.

asked in Theory of Computation Oct 6, 2018

93 views

0 answers

28

self doubt
what is prefix and proper prefix. please explain this by taking one example.

asked in Theory of Computation Oct 6, 2018

102 views

0 answers

29

Self doubt
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

asked in Digital Logic Oct 3, 2018

110 views

0 answers

30

Self doubt
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 it.

asked in Digital Logic Oct 3, 2018

118 views