GATE

Previous Year Information Technology GATE Papers with Solution

July 18, 2020 by soujanya 1 Comment

Previous Year GATE Papers and Official Keys 6,853 total views, 2 views today

6,853 total views, 2 views today

I want to crack GATE in CSE

April 15, 2016 by arjun 8 Comments

How to crack GATE CSE?

59,096 total views, 22 views today

Should I take what I get from GATE or try Different

February 29, 2016 by Arjun Suresh Leave a Comment

What to do after not so good GATE in CSE? Life after GATE.

19,073 total views, 3 views today

GATE Overflow Book – Practice Questions for GATE CSE

January 2, 2016 by Arjun Suresh 3 Comments

Previous year GATE/TIFR questions for practicing for GATE

12,093 total views, 5 views today

Aptitude Overflow Book

December 13, 2015 by Arjun Suresh 1 Comment

Updated April 2016 April 2016 (excluding General Awareness and Computer Knowledge) 101,657 total views, 10 views today

101,657 total views, 10 views today

GATE Overflow
Aptitude Overflow

Answered: BEGINNER FRIENDLY BOOK FOR ALGORITHMS ?

ykrishnay have you searched here: GATE CSE Resources GATE CSE Books – More Options Preparation [...]

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

If you are looking for Operating System Book for knowledge purpose and to clear GATE Exam then Galvin is sufficient. In Gate Exam Questions from the following topics are generally asked in GATE exam. (1) Process Concepts (2) CPU Scheduling Algorithms ( 2 Marks Every Year Asked) (3) Banker’s Algorithms (4) Memory Management Questions like Calculation of Average Access time, Page replacement algorithms based questions, Logical address and physical address based questions. (5) Questions based on semaphore or critical section (6) Disk Scheduling Problems You can read Operating System Tutorials article to know more about Operating System for GATE exam [...]

Answered: State True or False: Classes of Grammar and respective automata

After discussion with deepak sir: First of all point 3 is wrongly framed. This are the points from Go classes telegram channel: “There exists a Bijection between Set of type 3 grammars and set of all regular expressions... YES. because both are countable infinite so have same cardinality as set of positive integers. But There exists a Bijection between Set of Turing machines and set of all regular expressions...? YES. Same reason. “ What is countably infinite? → when the set S has one to one correspondance with the natural number. So,similarly “Set of ALL Grammars and set of regular… [...]

Answered: Zeal Test Series 2019: Graph Theory - Graph Connectivity

All four options are correct. 1) consider $K_{2}$ 2) Example as given in the other answers 3) consider $K_{2}$ 4) consider $C_{6}$ [...]

Introduction to Graph Theory Exercises

Introduction to Graph Theory Exercises

This is the problem snapshot [...]

Anyone can send link to download quantative book of arun sarma?

Book for General Aptitude [...]

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: