Algorithms Preparation Resources for GATE CSE

July 16, 2015 by Arjun Suresh 9 Comments

Algorithms Syllabus

http://gatecse.in/wiki/Changes_to_GATE_CSE_Syllabus_in_2016#Algorithms
Searching, sorting, hashing.
Asymptotic worst case time and space complexity.
Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
Graph traversals, minimum spanning trees, shortest paths.

“Just a rename of Graph Traversals to Graph Search.”

Book

C.L.R.S.

Video

Shai Simonson

GO Classroom

Course Link

Recommended Tests:

GATE Overflow Test Series – GATE CSE 2022

Web Links

Previous Year Questions

GATE Overflow Questions

Important Questions

Important Questions in Algorithms

GATE CSE Discussions

2016-2 Algorithms and Pointers

GATE CSE Syllabus

Best Books for GATE CSE

93,333 total views, 10 views today

Related

GATE Overflow
Aptitude Overflow

iit kanpur Calculas practice question

Does there exist a differentiable function f : [0, 2] → R satisfying f(0) = −1, f(2) = 4 and f’(x) ≤ 2 for all x ∈ [0, 2]? [...]

Answered: No of solution of the given equation

Generally for such questions, creating a function out of the equation and solving it with different tools is much easier. Consider, $f(x)=sin^2(x)-3x-5$. Clearly, $f(-5)>0$ and $f(1) [...]

Answered: Is "operating system three easy pieces" Book is enough for gate exam?

Match the content of the book with GATE SYLLABUS and choose accordingly. Note: For Operating systems refer here: Best Books for GATE CSE with Relevant Chapters to Read GATE CSE Books – More Options [...]

Answered: No of 5 letter english words that contains atleast one 'a' ?

With 26 alphabet for a 5 letter word we can have $26^{5}$ possible words as each 5 position can have 26 possible alphabet. we need no of word which contains at least one ‘A’. This is same as Total number of words – Number of words with no ‘A’ Now, Number of words with no ‘A’ =$25^{5}$ as, each 5 position can have 25 possible alphabet as we exclude ‘A’. so , Total number of words which contains at least one ‘A’ =$26^{5}-25^{5}$. [...]

Answered: What is the best way to prepare for IITB MSR CSE written test and interview?

...I felt like dropping a year to explore these subjects in-depth and preparing again for GATE to apply for MS programs (at IISC, IITB, or IITM)? In my opinion, you don't need to drop out and prepare for these subjects? You can learn even while doing Job so first thing no need to think about dropping at all. It is not suitable for you and your career. I know it may be an emotional touch you have with AI/ML but dropping off is not a solution. Try to get a job and start learning alongside. [...]

Explain why the call to the lock() method in a Java ReentrantLock is not placed in the try clause for exception handling, yet the call to the unlock() method is placed in a finally clause.

Operating System Concepts [...]

Answered: CAT 2001 | Question: 52

AE BF CG DH [...]

Answered: CAT 2010 | Question: 33

AE BF CG DH [...]

Answered: NIELIT 2019 Feb Scientist C - Section A: 22

Inverse relation for mother-in-law – either son-in-law or daughter-in-law. Option A is the only possible answer. [...]

Answered: NIELIT 2016 MAR Scientist D: 16

We have $(D\to E), (\neg E \to A), (\neg B \to \neg C), (F \to \neg H), (\neg A \to B) $ Now, we have $(D,C)$ inside the hideout. So, $E$ must also be inside (due to $D \to E),$ and $B$ must also be inside due to $([\neg B \to \neg C] \leftrightarrow [C \to B]).$ This eliminates options A, B and C. Correct answer: D. [...]

Answered: NIELIT 2019 Feb Scientist D - Section D: 26

Relative speed of the dog, $S_r = \dfrac{(2 \times 2m) – (3 \times 1m)}{t},$ where $t$ is the time for two leaps of the dog. $\implies S_r = 1m/t$ So, after every $2$ leaps, the dog covers $1m$ distance to the fox. So, to cover $30\;m$ dog will need to make $2 \times 30 = 60$ leaps which will be $2 \times 60 = 120m$. Correct option: D. [...]

Answered: What was the largest number of students in any year that went on to further study?

1. 3.585 2. 1.125 3. 5.can't say [...]

%d bloggers like this: