Log In

Recent activity by Mayankprakash

0 answers
How to check solutions of screening test 1 for gate 2020?
asked May 7, 2019 in Others 55 views
0 answers
Im going to start preparation from March for gate 2020 as I totally messed up gate 2019.I couldn't perform well in exam because of lack of practice and revision as I could manage time properly along with job. Please suggest how shall I prepare for ... alot each subject,how to practice effectively and revision techniques to remember for long. @experts or @top rankers Please guide me Thanks Mayank
commented Feb 17, 2019 in Others 2k views
1 answer
Please suggest me in briefly for revision . How to we test regular,dcfl,cfl,recursive and recursive enumeranle. Eg say if we can find the pattern it's regular. Please help
commented Jan 25, 2019 in Theory of Computation 87 views
0 answers
Please anyone suggest in brief with his/her experience how to judge we need to solve the probability questions with which of the methods. 1.Bayes and total 2. Binomial, poison, exponential and uniform. Please suggest Thanks
asked Jan 16, 2019 in Probability 43 views
0 answers
I have completed almost 90% of subjects and I'm working professional. From this point of time what should be my strategy.I should revise first or directly start with mock test or practice previous year questions .In many YouTube videos I see people telling give mock test in January. What should be my strategy from now on. Please suggest valuable suggestions which can boost my preparation. Thanks
commented Jan 9, 2019 in GATE 252 views
1 answer
T(n) = T(n/4) + T(3n/4) + n How to solve these type of problems? Can I solve this using master theorm by considering X = T(3N/4) +N THEN T(N) = T(N/4) +X CAN WE SOLVE LIKE THIS? PLEASE HELP
commented Jan 7, 2019 in Algorithms 410 views
1 answer
how to compute time complexity of this kind of recurrence relation- T(n)=T(n/2)+T(n/4)+T(n/8)+n
commented Jan 4, 2019 in Algorithms 261 views
1 answer
How to analyze this problem For (I=1;I<n;I++) { For (j=1;j<n;j=j+I) { Print("℅d℅d", I,j); } } Please suggest I'm detail how do we unroll I & j.
asked Jan 3, 2019 in Algorithms 149 views
3 answers
If we run Dijkstra’s algorithm to find single source shortest path for the above edge weighted directed graph with ‘8’ as source. In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized.
commented Jan 3, 2019 in Algorithms 483 views
1 answer
Please explain in very brief for below things. I'm confused in using these terminology 1. Subnet size and subnet mask size 2. Network I'd,block Id ,subnet id are they same? 3. IP addresses in network = No of host ? 4. How no of host ,no of subnets are related? Please help me in clearing my doubt. Thanks
commented Dec 30, 2018 in Computer Networks 197 views
0 answers
Please help me in solving quickly these type of problem IP - SM - How do we apply ANDing between 69 and 196 quickly.please suggest any good method Thanks
asked Dec 30, 2018 in Computer Networks 78 views
0 answers
Please suggest me how to do I start preparing for maths and aptitude as I'm already completing other subjects.(Any links or something which can be helpful) Suggestions will be very helpful. Thanks
asked Dec 28, 2018 in Mathematical Logic 272 views
1 answer
A is a 2D-array with the range [-5....5,3......13] of elements.The starting location is 100. each element accupies 2 memeory cells. Calculate the location of A[0][8] using column major order and row major order.Does indexing matter??Why C follow $0$ indexing??
commented Dec 28, 2018 in Programming 579 views
0 answers
Shall I cover token passing and aloha in flow control methods in computer network. Please suggest as I don't want to waste time if it's not in syllabus. Thanks
asked Dec 26, 2018 in Computer Networks 239 views
1 answer
5 answers
the complement of every context-free language is recursive ? or recursive enumerable? or both?
commented Dec 25, 2018 in Theory of Computation 6.6k views
0 answers
Do we need to cover page replacement implementations for gate? Please suggest
asked Dec 24, 2018 in Operating System 101 views
0 answers
Please suggest in revising the topic process synchronization. 1. After completing the full process synchronization Im totally confuse while solving problems which technique to apply. 2.Any summarized difference between every technique list or chart or link would be very helpful . Please help me on this . Thanks
asked Dec 22, 2018 in Operating System 98 views
1 answer
Please suggest some revision or must see questions for algorithms subject. It would be helpful for me to revise. Thanks
answer selected Dec 22, 2018 in Others 137 views
1 answer
1.Please suggest some good sources or links of last 10 year topic wise analysis of every subject so that I can plan my revision. 2.what topics are less frequently asked in DL and CO as I have less time to cover those 2 subjects. Please suggest Thanks
answer selected Dec 22, 2018 in Others 560 views
0 answers
Please anyone share formula sheet and last minute notes for each subject. As it will be very helpful for revision. Thanks
asked Dec 22, 2018 in Others 149 views
0 answers
1 answer
Do I need to study computability and decidability for gate 2019? Please suggest
asked Dec 20, 2018 in Theory of Computation 167 views
5 answers
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ? $8$ $16$ $32$ $64$ None of the above
commented Dec 18, 2018 in Algorithms 1.5k views
1 answer
It has been mentioned in Advertisement that Admit-Card for online exam will send to registered email-IDs. Does anyone received admit card yet?
commented Dec 11, 2018 in Others 298 views
1 answer
Which of the following data structure is most suitable for radix sort? 1 .tree 2 . Linked list 3 . Stack 4 . Binary search tree
commented Dec 10, 2018 in Programming 262 views
1 answer
Why this the following not a tautology? There is no case in which RHS is False and LHS is True. $\Bigl [ (\lnot p \land q) \land \bigl[ q \to (p \to q) \bigr ] \Bigr ] \to \lnot r$
commented Dec 5, 2018 in Mathematical Logic 219 views