Analysis

GATE CSE 2019 Result Responses

February 14, 2020 by Arjun Suresh Leave a Comment

Source Add your Response Rank Predictor for GATECSE 2020 Admission Response: GATE CSE 2019 Admission Responses Result Responses: GATE CSE 2021 Result Responses GATE CSE 2020 Result Responses GATE CSE 2018 Result Responses GATE CSE 2017 Result Responses GATE CSE 2016 Result Responses GATE CSE 2015 Result Responses 6,964 total views, 3 views today

6,964 total views, 3 views today

2018 Year Placement Statistics for CSE

June 10, 2018 by Arjun Suresh Leave a Comment

Placement Statistics for Year 2018 for Computer Science & Engineering

13,299 total views, 3 views today

GATE CSE College Reviews for Masters

June 10, 2018 by Arjun Suresh Leave a Comment

Reviews for Computer Science & Engineering Course for Masters by GATE Overflow members.

8,594 total views, 2 views today

GATE CSE 2018 Admission Responses

June 7, 2018 by Arjun Suresh Leave a Comment

Admission Responses for GATE 2018 Computer Science and Engineering branch given by GATE Overflow users. You can know what rank people got into which all Institutes.

33,913 total views, 3 views today

GATE CSE 2018 Result Responses

June 7, 2018 by Arjun Suresh Leave a Comment

GATE Computer Science 2018 Result Responses submitted to GATE Overflow

16,347 total views, 7 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: