Tag: GATE Computer Science Books

Computer Organization Hamacher | Best COA Books

Computer Organization By Carl Hamacher

 

This article reviews the book “Computer Organization” by Carl Hamacher, Zvonko Vranesic and Saftwat Zaky.

The article covers-

  • Special features of book
  • Analysis of Content
  • Analysis of Exercises
  • Necessary Instructions
  • Conclusion

 

Why Should Be Read?

 

Special Features of Book-

 

The special features of this book are-

  • It contains the most recommended text for this subject.
  • It has simple diagrams which are quite clear in their meanings.
  • Its examples very well explains how the concepts are implemented in modern computer systems.
  • The explanation of Memory System topic is the best among all the textbooks on this subject.
  • It has high quality numerical questions in its exercises which are very useful for practice.

 

Analysis of Content-

 

The following table analyzes sections of the book that are relevant for GATE-

 

Chapter No.GATE Relevant SectionsGATE Topics Covered
11.2Functional Units of Computer
1.4Number Representation

(Signed Magnitude, 1’s and 2’s Complement System)

22.1Memory and Addresses
2.2
2.5Addressing Modes
2.7Input / Output Operations
2.9Subroutines
44.2Interrupts
4.4Direct Memory Access (DMA)
4.5Buses
55.1 to 5.9Memory System

(Organization of RAM Chip, Cache Memory, Virtual Memory etc)

66.1Signed Number Addition Using Adders
6.2
6.4Booth’s Algorithm
6.7Floating Point Number Representation

(Listed Under Digital Logic in GATE Syllabus)

77.1 to 7.5Processing and Control Unit

(Hardwired, Microprogrammed)

88.1 to 8.5Pipelining

(Basics, Hazards, Operand Forwarding, Branch Prediction etc)

Covering Only These Sections Is Enough

 

Analysis of Exercises-

 

The following table analyzes exercises of the book that are relevant for GATE-

 

Chapter No.Question No.
11.5, 1.6
22.1, 2.2, 2.5, 2.8, 2.13, 2.17, 2.20
44.3, 4.8, 4.12, 4.20
55.1, 5.4, 5.6, 5.7, 5.8, 5.9, 5.10, 5.11, 5.13, 5.14, 5.16, 5.18, 5.19, 5.21, 5.25, 5.27, 5.29
66.1, 6.2, 6.3, 6.4, 6.5, 6.9, 6.10, 6.11, 6.12, 6.17, 6.22, 6.25, 6.26, 6.27
77.4, 7.5, 7.8, 7.18, 7.21, 7.26, 7.30
88.1, 8.2, 8.13, 8.14, 8.15

Practicing Only These Exercises Is Enough

 

Necessary Instructions-

 

Keep the following instructions in mind while reading the book-

  • Many students find this subject comparatively tough for GATE exam.
  • The questions asked in the exam are highly conceptual in nature.
  • Be thorough with the concepts.
  • Read the relevant sections thoroughly.
  • Multiple readings may be needed for some sections.
  • Give utmost importance to the topics of Memory System and Pipelining.
  • It is very essential to solve the exercises to get a good grip over the subject.

 

Conclusion-

 

  • This textbook caters the need of all the students pretty well.
  • The carefully-curated examples make this book insightful to read.
  • The exercise questions are rich in quality.
  • Some questions are above the level of questions asked in the GATE exam.
  • The chapters of Memory System, Arithmetic and Pipelining are covered in great depth.
  • Overall, this book is a must read while preparing this subject for GATE exam.

 

THIS BOOK IS SELF-SUFFICIENT FOR GATE EXAM.

 

 

Amazon Rating

 

Student’s Reviews-

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Other Recommended Books-

 

Computer Organization: A Quantitative Approach By Hennesy and Patterson-

 

 

Computer Organization and Architecture By William Stallings-

 

 

Operating System Tanenbaum | Best OS Books

Modern Operating Systems By Tanenbaum

 

This article reviews the book “Modern Operating Systems” by Andrew S. Tanenbaum and Herbert Bos.

The article covers-

  • Special features of book
  • Analysis of Content
  • Analysis of Exercises
  • Necessary Instructions
  • Conclusion

 

Why Should Be Read?

 

Special Features of Book-

 

The special features of this book are-

  • It strikes a good balance between the theory and problems.
  • The topics are explained in sufficient details which makes it pretty good.
  • The clear and concise diagrams and tables make it interesting to read the book.
  • The book is suitable for beginners as well as intermediate students.
  • The language used while explaining the topics is simple and straight forward.
  • The topic of Memory Management is covered in an elaborative and clear way.
  • Of all the textbooks present on this subject, this book has the best exercise questions.
  • The questions are of good quality and sufficient for GATE preparation.

 

Analysis of Content-

 

The following table analyzes sections of the book that are relevant for GATE-

 

Chapter No.GATE Relevant SectionsGATE Topics Covered
11.1 to 1.3Introduction to Operating Systems

(Optional to Read)

1.5
1.6
22.1Process Management
2.2Threads
2.3Inter-Process Communication
2.4Process Scheduling

(First Come First Serve, Round Robin etc)

2.5Classical Inter-Process Communication Problems

(Producer-Consumer, Dining Philosophers etc)

33.1Memory Abstraction
3.2
3.3Virtual Memory
3.4Page Replacement Algorithms

(FIFO, LRU, Optimal etc)

3.5Paging Design and Implementation Issues
3.6
3.7Segmentation
44.3 to 4.5.2File Management System
55.1 to 5.3Input Output

(Overlaps with Computer Organization Syllabus)

5.4.1 to 5.4.4Disk Scheduling Algorithms
6All SectionsDeadlock

Covering Only These Sections Is Enough

 

Analysis of Exercises-

 

The following table analyzes exercises of the book that are relevant for GATE-

 

Chapter No.Question No.
14, 5, 10, 11, 13, 14,15, 24
25, 6, 7, 8, 16, 17, 23, 24, 25, 26, 27, 30, 32, 33, 39, 40, 41, 42, 43,
44, 45, 46, 49, 51, 54, 55
32, 4, 6, 7, 11, 12, 13, 14, 15, 16, 17, 19, 20, 22, 24, 25, 27, 28, 33,
35, 36, 38, 42, 44, 45, 47
412, 13, 16, 18, 23, 24, 25, 32, 36, 37, 38, 40
55, 6, 8, 11, 12, 17, 18, 19, 20, 21, 28, 31, 32, 37
65, 8, 14, 20, 22, 23, 25, 26, 28, 34

Practicing Only These Exercises Is Enough

 

Necessary Instructions-

 

Keep the following instructions in mind while reading the book-

  • The book has nearly 1100 pages.
  • If you concentrate on just GATE syllabus, the number of pages reduce significantly.
  • The topics of process management and memory management are the focused areas in GATE exam.
  • Keep making quality notes while reading the book. This will help you to solve theoretical questions.
  • GATE focuses on numerical questions from this subject. So, practice all the above questions.
  • Try to implement the process scheduling algorithms and inter-process communication problems.

 

Conclusion-

 

  • The text book covers the entire GATE syllabus and much more than that.
  • The best part of the book is its exercise questions and at par with the questions asked in GATE.
  • The book covers tricky topics like inter-process communication in an elaborative and fun to read way.
  • The book is sufficient for theoretical as well as numerical questions.

 

THIS BOOK IS SELF-SUFFICIENT FOR GATE EXAM.

 

 

Amazon Rating

 

Student’s Reviews-

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Other Recommended Books-

 

Operating Systems By William Stallings-

 

 

Operating System Concepts By Abraham Silberschatz-

 

 

Introduction to Algorithms By Cormen | Best Algorithms Books

Introduction to Algorithms By Cormen

 

This article reviews the book “Introduction to Algorithms” by Thomas H. Cormen.

The article covers-

  • Special features of book
  • Analysis of Content
  • Analysis of Exercises
  • Necessary Instructions
  • Conclusion

 

Why Should Be Read?

 

Special Features of Book-

 

The special features of this book are-

  • It has an in-depth and elaborative explanation which is unmatched by any other book.
  • The algorithms are explained followed by their analysis and proofs.
  • It provides a detailed insight into the subject.
  • The analysis part is covered very well and multiple readings may be needed for some algorithms.
  • The exercise questions are pretty good.
  • Some GATE questions have been asked directly from its exercises in the previous year exams.
  • Data structures are covered equally good.

 

Analysis of Content-

 

The following table analyzes sections of the book that are relevant for GATE-

 

Chapter No.GATE Relevant SectionsGATE Topics Covered
11.1Basics of Algorithms
1.2
22.1Insertion Sort
2.2
2.3Merge Sort
3All SectionsAsymptotic Notations & Growth of Functions
44.1 to 4.3Divide & Conquer, Solving Recurrences, Master’s Theorem
4.5
6All SectionsHeap Sort & Priority Queues
77.1Quick Sort
7.2
7.4
8All SectionsCounting Sort, Radix Sort, Bucket Sort
1010.1Stacks, Queues & Linked List
10.2
10.4
1111.1 to 11.4Hashing, Open Addressing
1212.1 to 12.3Binary Trees
1515.1Dynamic Programming Algorithms
15.2
15.4
1616.1 to 16.3Greedy Algorithms
22All SectionsGraph Representations & Traversal Algorithms
23All SectionsMinimum Spanning Tree Algorithms

(Prim’s and Kruskal’s)

2424.1 to 24.3Bellman Ford & Dijkstra’s Algorithm
2525.2Floyd-Warshall Algorithm

Covering Only These Sections Is Enough

 

Analysis of Exercises-

 

The following table analyzes exercises of the book that are relevant for GATE-

 

Chapter No.Question No.
11.2-2, 1.2-3
22.1-1, 2.1-2, 2.2-1, 2.2-2, 2.3-1, 2.3-3, 2.3-5, 2.3-6, 2.3-7, 2.1, 2.4
33.1-1, 3.1-2, 3.1-4, 3.2-3, 3.1, 3.3, 3.4
44.2-1, 4.2-3, 4.3-1, 4.3-2, 4.3-3, 4.3-6, 4.3-9, 4.4-1, 4.4-2, 4.4-3, 4.4-4, 4.4-5, 4.5-1, 4.5-3, 4.5-4, 4.1, 4.3, 4.5, 4.6
66.1-1 to 6.1-7, 6.2-1, 6.2-6, 6.3-1 to 6.3-3, 6.4-1, 6.4-3, 6.5-1, 6.5-7, 6.5-9, 6.2, 6.3
77.1-1 to 7.1-4, 7.2-1 to 7.2-3, 7.4-6, 7.4
88.2-1, 8.2-2, 8.3-1, 8.3-2, 8.3-4, 8.4-1, 8.4-2, 8.4-3, 8.2, 8.3
1010.1-1 to 10.1-7, 10.2-2, 10.2-3, 10.2-8, 10.4-1 to 10.4-6, 10.1
1111.2-1 to 11.2-3, 11.4-1, 11.4-3
1212.1-1 to 12.1-5, 12.2-1, 12.2-5, 12.2-6
1515.1-3 to 15.1-5, 15.2-1, 15.2-6, 15.4-1, 15.4-3
1616.1-2, 16.1-4, 16.2-1, 16.2-2, 16.2-3, 16.2-6, 16.3-3
2222.1-1, 22.1-2, 22.1-4, 22.1-6, 22.1-7, 22.2-1, 22.2-2, 22.2-4, 22.2-7, 22.2-8, 22.3-5, 22.3-8, 22.3-9, 22.3-11, 22.3-13, 22.4-1, 22.4-3, 22.4-4, 22.5-1, 22.5-4, 22.1 to 22.3
2323.1-1 to 23.1-11, 23.2-2 to 23.2-5, 23.2, 23.3
2424.1-1, 24.1-6, 24.2-1, 24.3-1, 24.3-2, 24.3-10
2525.2-4, 25.2-6, 25.2-8

Practicing Only These Exercises Is Enough

 

Necessary Instructions-

 

Keep the following instructions in mind while reading the book-

  • The book has nearly 1300 pages and all the topics are explained in great detail.
  • You need to be pretty selective with what topics you need to read. (Refer above)
  • Since GATE does not have subjective questions, so there is no need to cover the proofs.
  • However, studying the proofs deepens the knowledge of algorithms.
  • Go for studying the proofs only if you have ample time.

 

You can divide reading the book in three levels-

 

Level-01:

 

  • Read the algorithm.
  • Try to understand how it works and implement on a few examples.
  • Implement the algorithm code in some programming language if you have time.
  • Prefer C language as it is a part of GATE syllabus.

 

Level-02:

 

  • Read the analysis part and proof of correctness for that algorithm.
  • This part is important as GATE questions focus on the analysis aspect of algorithms.

 

Level-03:

 

  • Try solving the problems at the end of each chapter.
  • The problems are of medium and tough difficulty level and requires thorough knowledge.

 

Conclusion-

 

  • The book covers all the algorithms in an extensive way focusing equally on the analysis aspect.
  • The exercise questions are intuitive and guide the students to cover topics in depth.
  • The exercise questions of this book have been asked directly in GATE .
  • Most of the questions are at par with the level of questions asked in GATE.
  • This book is a must read for every student who wants to learn algorithms.

 

THIS BOOK IS MORE THAN ENOUGH FOR GATE EXAM.

 

 

Amazon Rating

 

Student’s Reviews-

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Other Recommended Books-

 

Algorithm Design By Kleinberg and Tardos-