Register

Introduction to algorithms by cormen

• retagged by
1,195 views
0 0 votes
I am just starting with algorithms and as I have no source specifically aimed for gate prep so I am gonna go ahead with clrs(introduction to algorithms). Can someone list the topics which are relevant for GATE ? I am facing a hard time deducing exact chapters from the book by looking at the gate syllabus. I wanna know in what chapters what subtopics are relevant for gate. For example, do I need to cover linear time sorting algorithms like counting sort ,radix sort and the algorithms for median finding .

Any help would be appreciated

1 Answer

0 0 votes
First, try to complete video lectures available on Youtube by kiran sir (GATEBOOK).It will give you a good understanding of the subject, then read the syllabus from the book and try to solve previous year gate questions.
Voting & Accepting an answer helps improve the community
← Previous · Regular ExpressionsNext → · depth first traversa...
← Previous in category · Heap SortNext in category → · cormen 3rd edition Q...
Position:
Show:

Related questions

1 1 vote
0 0 answers
1.3k
1.3k views
Akshata asked Jul 16, 2017
1,264 views
Introduction to algorithms by Cormen
Determine an LCS of {1,0,0,1,0,1,0,1} (assume A) and {0,1,0,1,1,0,1,1,0} (assume B)If we draw the matrix and backtrack then one of the possible sequence is 100110. But th...
0 0 votes
1 1 answer
873
873 views
Azhar Khan asked Mar 29, 2016
873 views
Book for Algorithms other than Coreman?
I would like to know if there is any other Algorithm and data structure book(other than coreman) available for beginners for Gate preparations like we have Let Us C(Y. K...
2 2 votes
1 1 answer
2.0k
2.0k views
Pavan Kumar Munnam asked Nov 14, 2016
1,981 views
introduction to algorithms Thomas H.cormen q.22.2-3
In the qusetion he meant that it can be implemented using two colors by eliminating the Grey color... i think there must be one more check such that if v.pi ==nil if it m...
0 0 votes
0 0 answers
849
849 views
Pavan Kumar Munnam asked Mar 23, 2016
849 views
Introduction to algorithms,Thomas h cormen question:6.3-3