search
Log In
1 vote
3.9k views
Has anybody tried this book?Is this book good to practice for gate and psus especially psus?
in Others
retagged by
3.9k views
1
If someone is aiming a rank something around 2500-5000 Then this book can help to achieve that

To get rank under 1000   only refer std books no alternatives

2 Answers

4 votes
 
Best answer
I have practiced problems from this book and can say that this book is pretty good. The questions are difficult enough to keep your brain working and easy enough to not let down your confidence level. There are questions that are not usually asked in the various competitive exams and you would like to filter them out. I must also add that the answers to some problems are incorrect and you may need to double check them.

selected by
0
I have heard that this book is useful for psu exams as most of the questions come from this book and gate previous year is this true?Do you have any idea?
0
Yeah. You can say that few questions are taken from this book or they have relevance to the questions of this book.
0
I want to prepare for psus and wanted to know what all can i solve other than gate papers
0
Most of the PSU now take the admission through GATE. For the rest, it depends. Like Coal India conducted exam a few years back and it gave most of the questions from the previous GATE question papers and most of them from compiler design. ISRO provides its own past question papers. As I gave exams of various PSUs, I can say that it is difficult to retrieve those questions as they don't let the candidate to take the question paper. So spreparing previous GATE questions, MCQ by Timothy Williams and questions from ISRO question paper will serve as good mix of questions. If I have any question paper with me, I will share the questions or at least the scan copy.
0
Thanks a lot
0 votes

Related questions

0 votes
0 answers
1
743 views
A byte addressable computer has a memory capacity of 2^m kbytes and can perform 2^n operations. An instruction involving 3 operands and one operator needs a maximum of - (a) 3m bits (b) 3m+n bits (c) m+n bits (d) none of the above. Please provide a detailed explanation ...
asked Apr 10, 2018 in CO and Architecture DEEPAK PANDEY 1 743 views
0 votes
1 answer
2
410 views
The $n^{th}$ order difference of a polynomial of degree $n$ is zero one some constant undefined Please explain the solution.
asked Mar 12, 2018 in Set Theory & Algebra Shikha Mallick 410 views
4 votes
1 answer
3
1.7k views
Memory Protection is of no use in a) single user systems b) non multiprogrammed systems c) non multitasking systems d) none of the above
asked Aug 23, 2016 in Operating System Sankaranarayanan P.N 1.7k views
0 votes
4 answers
4
561 views
A sorting technique that guarantees that records with same primary key in the same order in the sorted list as in the original unsorted list is said to be....
asked Sep 22, 2019 in DS Nukku 561 views
...