GATE CSE Book - Chapter Digital Logic

Question

Sorry for the delay. After a long wait, Digital Logic Chapter is now complete. Next one is Computer Organization and Architecture. Thanks to @Srestha, @Bikram for the contents and also @Praneeth for the latex book. Please give feedback.

Download

 

Except Notes Part of all the Subjects - Download

Comments

I felt the book gives very quick revision of the subjects and bookmarks in each and every topic is quite helpful,waiting for upcoming books ...Thanks

---

Cannot download.

---

And what about other subjects like Toc, Cn etc..can u give link

---

Very Helpful

---

Thank you very much for the book!

 

There is a VERY minor mistake in Pg No: 9, the binary representation of 11₁₀ is given as 1010(10₁₀) instead of 1011.

---

Thanx sr ..really will help a lot...If you could post a similar book for High weigtage subjects ..it would be very helpful :-)

---

Thanx. It would be good if we also have such books for exhaustive subjects like networks and CO.

---

@Nithish Thank you. Please point out any other mistakes too.

@Shivangi For those aiming for top 100, weightage of subjects does not really matter. I'll give more priority for system subjects in the book - but more marks are for mathematics/algorithm part in GATE. But these must be done by proper thinking and practice- a book is of less help.

---

is Booth's algo is still in our syllabus ?

---

yes, "computer arithmetic" is mentioned in syllabus. But since it is not directly mentioned-- less likely to be asked compared to those which are directly mentioned.

---

thanku sir and plz tell shall i prepare this sir ? bcoz havent read this

---

Well if you have covered other topics yes. I recommend doing- it is not difficult. Just try one example for normal booth and then the recoding one.

---

[CN] Sir, Are calls like socket() listen() connect() still in syllabus? couldn't find a proper place to study all these.

---

arjun sir while studying cormen i really face lots of problems, i mean there are so many questions and exhaustive proving exercises which takes lot of time and its not practical to solve now given the time left. Any advice what tp study from cormen and how??

Are questions related to probalistic lower bounds and upper bounds important for GATE? Section 8.1 in cormen. plz tell sir.

---

While read Cormen read these chapters for Gate exam 

Chapter 1,2,3,4[excluding 4.4],6,7[excluding7.3],8,10,11[excluding 11.5],12[excluding12.4],18,22,23,24[excluding 24.4 and 24.5] for
NP-Completeness you can read 34 also.( NP competeness not in syllabus now but require later ) 

In addition to this book ,  see the video lectures from MIT. The lectures are given by Lieserson[who BTW is also one of the authors of CLRS] and Erik demaine. The lectures are
absolutely brilliant. You may download them from ocw.mit.edu

https://www.youtube.com/playlist?list=PL8B24C31197EC371C

you will understand in a better way . 

 

---

@susmita

For More specific , read these

https://docs.google.com/spreadsheets/d/1IkL58gDCSHnToD7JP7mxNcKp3mF0wiY5rNfvtHUi8RY/edit

---

https://www.youtube.com/watch?v=zWqLYby99EU&index=4&list=PLkHsKoi6eZnzJl1qTzmvBwTxrSJW4D2Jj

see video for socket

yes it is in syllabus

just these things discussed in video enough

---

Thanx a lot bikram sir. Sir plz just once check section 8.1 (problems) of cormen which contains problems regarding probalistic analysis and their proofs. Can i leave those questions? sir plz advice.

---

CLRS section 8.1  have lower bound for sorting , yes it is important, That decission tree method.

theorem 8.1 and it's proof followed by a corolarry u have to read. Just read these , u have to know the theorem and understand the proof. 

nptel naveen garg DS video have this proof for lower bound, he teach this part well can watch it, 

https://www.youtube.com/watch?v=4OxBvBXon5w&index=22&list=PL9C5B76DBF13A3584

---

also do not worry about exercise questions of 8.1 , these kind of  problems asked in 8.1 exercise  NOT require for gate exam, just read theory part and know proof , may ask in iisc/ iit interviews.

 

Bit after gate may give a try, solution manual is available,

---

sir please add toc book

---

yes sir i will try those problems after GATE, Thanx a lot for the valuable advice.

---

is Booth’s Algorithm also included in the syllabus of GATE 2017?

I have checked gate2017 syllabus from gate.iitr.ernet.in site. Booth's Algorithm is not mentioned in the syllabus.

---

NOT only 2017, you can check 2016 , 2015 , 2014 etc previous years of gate syllabus still you will not find anything written as Booth's Algorithm in the syllabus.

If you check old gate question ( year i can't remember )  you will find they ask question from Booth's Algorithm . So you have to read it. 

Hope you understand now. it is in the syllabus. 

---

thank you @Bikram..

---

is johnsons algo in syllabus?

---

@sushmita, no questions have been asked, if you have time you can study, not explicitly mentioned

---

@arjun sir please update aptitue overflow book by the end of this month

---

yeah thanx. But shortest path topic is mentioned thats the thing.

---

No johnson's algo is not in syllabus only djkstra SSSP and bellman ford APSPis in syllabus.

---

Thanx sir. But they have just mentioned shortest path in syllabus. And sir the syllabus also includes Floyd warshal algorithm in all pairs shortest path and Johnson algorithm is also used in all pair shortest path in case of sparse graph. So don't u think it's implied in syllabus? Just a doubt if you could once check.

---

only Floyd warshal algorithm in all pairs shortest path  have to read, if you want to read Johnson algorithm check its property, where used and any drawbak etc..

 

but in syllabus floyed warshal is as qstn came but no qstn till from johnson's algo.

---

New link added which excludes "notes" portion of the subjects but includes all the subjects.

---

Some books are never too old !

http://infolab.stanford.edu/~ullman/focs.html

 

---

The one who has made digital syllabus I am very grateful to him.

Perfect distribution and topic wise presentation given with the resource to look to as well.

---

thanks man for bringing this back .

Helps me a lot :)

---

can any one share  other files/documents like this which is useful ?