Recent questions in Revision

0 votes

0 answers

1

What are the Algorithms which are (from all topics) important for GATE ?
It would be great, if the time complexities associated with them are included.

asked Dec 30, 2018 in Revision by parabol (219 points) | 24 views

0 votes

0 answers

2

GATE exam preparation
what is the good plan for gate 2019 ? is this good taking 1 or 2 test every day and evolution properly ?

asked Nov 19, 2018 in Revision by manojeve (279 points) | 48 views

0 votes

1 answer

3

general
hi seniors and gate rankers in the month of November aspirants of gate 2019 are now able to complete 80 to 90 % of syllabus some of them are revising , I am also at the same position but since 1 week I am losing my confidence and because of this the no of hours I was giving to gate is decreasing drastically, please suggest me how to overcome from this problem.

asked Nov 1, 2018 in Revision by Divyanshum29 Junior (785 points) | 139 views

0 votes

0 answers

4

HIGHLY SLOW INITIAL DAYS OF PREPARATION
I initially started with Sheldon Ross and tried to solve each and every problem in it and It took me 10 days to complete the 1st 2 Chapters. I have already completed solving all the Problems in GO Book. If I continue in this manner, I' ... ? I know most of the concepts. I just lack practice. What exactly is the correct way to increase the pace of preparation?

asked May 24, 2018 in Revision by Balaji Jegan Active (4.6k points) | 89 views

+3 votes

1 answer

5

GATE 2019 PREPARATION
I am not sure that i can ask this question here or not but let me ask!!! Anyone 2019 serious GATE aspirant residing in "Kolkata" if interested for "Group Study" (self not coaching) who already has prepared for GATE 2018 please comment below!!! I need a Study Buddy !!! [closed]

asked Feb 5, 2018 in Revision by Sunny Mukherjee Active (1.8k points) | 1.1k views

+2 votes

0 answers

6

Self doubt
This may seem trivial I'm scoring little less in Made-easy than what I'm scoring in other Test series. Is made-easy test closer to actual gate difficulty?Or they are just trying to make it difficult. Overall. I want to know so that I'm ready for tough paper too. I'd appreciate any experiences or suggestion

asked Jan 22, 2018 in Revision by Ajay Jadhav Active (2k points) | 110 views

+2 votes

0 answers

7

Plz Help
Hello Friends, In past 20 days I have attempted 10-12 full length tests(ACE+******).But my marks are in the range 40-50. No matter how much I try, I can't score above 70(thats my aim).What should I do? Also I am not getting full marks in aptitude/verbal section. Please help.

asked Jan 20, 2018 in Revision by ankit_thawal Active (2.1k points) | 51 views

+2 votes

1 answer

8

do questions in the original gate exam appear in order or random ?
does the questions in gate exam appear randomly or in order like aptitude first maths next and the technical or in any random order?

asked Jan 10, 2018 in Revision by Venkat Sai Active (3.6k points) | 106 views

0 votes

0 answers

9

I am getting a low score mocks even after preparing for 6 months
I am getting low score in Made Easy test. I have taken five tests, did analysis but still my score is not improving. I am a dropper and due to that I feel more pressure by seeing my marks, please suggest a way how should I revise.

asked Jan 5, 2018 in Revision by anonymous | 404 views

0 votes

0 answers

10

Strategy
I have just completed with my CS syllabus. I have just gone through some maths videos earlier but what should I do to score atleast 10/15 in maths.Now what should be the strategy for the month of Jan? Is the test series imp if all prev year Gate que are covered?

asked Dec 19, 2017 in Revision by anonymous | 50 views

0 votes

0 answers

11

gate 2018
i completed 6 subject till now . (ds &c , daa,toc,cd,os,rdbms ) and 5 subject are remaining (co, dcld ,cn ,discrete mathematics)but till now i am not doing privous year gate question of these subject .. what will be the right dicision for ... some important topic of remaining subject like (co, dcld ,cn ,discrete mathematics ) which are more scoring. gate mostly ask from those topics . [closed]

asked Nov 19, 2017 in Revision by vivek gangwar (59 points) | 29 views

0 votes

0 answers

12

general gate preparation doubt.
When should one stop preparing a subject? Gate has a huge syllabus. Even in a single subject a lot of topics are there. Obviously one must understand the basics of all topics. But my question is at what point should one be satisfied with a ... more questions to solve. This question is specially for people who had sat for gate before and secured a good rank. Thanks.

asked Nov 16, 2017 in Revision by Tridhara Chakrabarti (271 points) | 87 views

0 votes

0 answers

13

#revision plan for last 3 months
what will be the best plan for revision in last 3 months ??

asked Nov 16, 2017 in Revision by Ajeet Singh (137 points) | 73 views

+1 vote

0 answers

14

General
I just want a proper guide. What's the efficient way to revise a subject. My strategy i try to revise a subject per day as I have studied most of the subjects. Problem is I start always from the scratch so it really take lot of time even though I had studied it earlier. What is the efficient way to revise and how many daily hours to spend on revision?

asked Nov 15, 2017 in Revision by Na462 Loyal (8.1k points) | 73 views

0 votes

0 answers

15

Discrete math and its applications
Hi, So I'm studying discrete math and I have some questions: 1.For this question,in the answer we use inexclusive or,why is it wrong to use exclusive or? p: You can use wireless network in the Airport q: You pay the daily fees ... me figure out this question :translate Actors are not the only people who own an Iphone using propositional logic.. Thanks in advance.

asked Nov 9, 2017 in Revision by TheWanderer (17 points) | 47 views

0 votes

0 answers

16

discrete
Let G be a connected 3 - regular graph. Each edge of G lies on some cycle. Let S⊆V and C1,C2,…,Cm,m=Codd(G−S), be the odd component of G−S. Let eG(Ci,S) denote the number of edges with one- end in Ci and the other in S. Then ∑(i=1 to m) eG(Ci−S) is (1) ≤m (2) ≥5m (3) ≥3m

asked Sep 27, 2017 in Revision by ashutoshsharma (61 points) | 37 views

0 votes

0 answers

17

discrete
Consider the preferences given in this Problem Student 1 2 3 4 University 1 2 3 4 A d a b c a C D B A B c b a d b D C A B C c b a d c A C B D D d a b c d B D A C The University - oriented stable matching obtained using Gale-Shapely Algorithm is (1) {aD,bc,cA,dB} (2) {aC,bD,cA,dB} (3) None of the above

asked Sep 27, 2017 in Revision by ashutoshsharma (61 points) | 20 views

0 votes

0 answers

18

discrete
Student 1 2 3 4 University 1 2 3 4 A d a b c a C D B A B c b a d b D C A B C c b a d c A C B D D d a b c d B D A C The Student - oriented stable matching obtained using Gale - Shapely Algorithm is (1) {Aa,Bb,Cc,Dd} (2) {Ac,Ba,Cb,Dd} (3) {Ac,Bd,Cb,Da} (4) None of the above

asked Sep 27, 2017 in Revision by ashutoshsharma (61 points) | 18 views

0 votes

0 answers

19

discrete
Consider the preferences Student 1 2 3 4 University 1 2 3 4 A d a b c a C D B A B c b a d b D C A B C c b a d c A C B D D d a b c d B D A C Is the matching M= {Ab,Ba,Cc,Dd} stable? (A) Yes (B) No

asked Sep 27, 2017 in Revision by ashutoshsharma (61 points) | 28 views

0 votes

0 answers

20

DISCRETE
Let G be a connected 3 - regular graph. Each edge of G lies on some cycle. Let S⊆V and C1,C2,…,Cm,m=Codd(G−S), be the odd component of G−S. Let eG(Ci,S) denote the number of edges with one- end in Ci and the other in S. Then eG(Ci,S) is (A) Even (B) Odd (C) Cannot say

asked Sep 21, 2017 in Revision by ashutoshsharma (61 points) | 102 views

0 votes

0 answers

21

DISCRETE
Determine whether the graph below has a perfect matching: (A) Yes (B) No

asked Sep 21, 2017 in Revision by ashutoshsharma (61 points) | 63 views

0 votes

1 answer

22

DISCRETE
Determine whether the graph below has a perfect matching: (A) Yes (B) No

asked Sep 21, 2017 in Revision by ashutoshsharma (61 points) | 44 views

0 votes

0 answers

23

Discrete
What is the size of minimum vertex cover for the graph G

asked Sep 21, 2017 in Revision by ashutoshsharma (61 points) | 26 views

0 votes

1 answer

24

Discrete
In the above graph, find a maximum matching M. Then |M| is

asked Sep 21, 2017 in Revision by ashutoshsharma (61 points) | 54 views

0 votes

0 answers

25

DISCRETE
Let T be a tree with n vertices and k be the maximum size of an independent set in T. Then the size of maximum matching in T is (A) k (B) n−k (C) (n−1)/2

asked Sep 21, 2017 in Revision by ashutoshsharma (61 points) | 26 views

0 votes

1 answer

26

DISCRETE
The size of minimum vertex cover can be - (A) Smaller than the size of maximum matching (B) No smaller than the size of maximum matching (C) Cannot say

asked Sep 21, 2017 in Revision by ashutoshsharma (61 points) | 46 views

0 votes

0 answers

27

DISCRETE
In a class of 4 students, four committees are formed ( see the table below). Is it possible to choose a president for each committee so that no student is a president of more than one committee? Committee Members C1 Amit, Bimal, Dipak C2 Bimal, Dipak C3 Bimal, Chandan C4 Amit, Bimal, Chandan Yes No

asked Sep 21, 2017 in Revision by ashutoshsharma (61 points) | 41 views

+1 vote

1 answer

28

discrete
Given a maximum matching M, if we pick one endpoint of each edge in M, this form a valid vertex cover. TRUE FALSE

asked Sep 21, 2017 in Revision by ashutoshsharma (61 points) | 72 views

0 votes

0 answers

29

discrete mathematics
Let T be an n - vertex tree having one vertex of degree i for i=2,3,…,k and the remaining n−k+1 vertices are of degree 1 each. Determine n in terms of k.

asked Sep 14, 2017 in Revision by ashutoshsharma (61 points) | 67 views

+1 vote

3 answers

30

Gate 2018 schedule
I am not able to study for gate 2018 I have resources,time, environment, completed all the subjects while preparing for gate 2017 How do I overcome this

asked Jun 22, 2017 in Revision by ck (387 points) | 226 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions in Revision

Recent Posts

Recent Blog Comments