Necessary Instructions

Conclusion

Why Should Be Read?

 

Special Features of Book-

 

The special features of this book are-

It is one of the best books available on this subject.

It covers C language in great depth.
It covers all the GATE topics in a detailed way.
It has decent number of good quality exercise questions.
Covering this book is a must for GATE preparation.

Analysis of Content-
 

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

GATE Relevant
Chapter No. GATE Topics Covered
 Sections

1 All Sections Introduction

2.1 to 2.4 Variables & Data Types

2
2.5 to 2.12 Operators & Precedence Order

3 3.1 to 3.8 Control Flow

4.1 to 4.2 Functions

4.3, 4.6, 4.7 External, Static & Register Variables

4 4.5 Header Files

4.10 Recursion

4.11 C Preprocessor

5 All Sections Pointers & Arrays

6.1 to 6.2 Basics of Structures

6.3 Arrays of Structures

6 6.4 to 6.5 Pointers & Structures

6.7 Typedef

6.8 Unions

7.1 to 7.2 Standard & Formatted I/O

7 7.4 Scanf

7.6 Error Handling

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.

1 1.4, 1.15, 1.17, 1.19, 1.23, 1.24

2 2.1 to 2.10

3 3.4, 3.5, 3.6

4 4.1, 4.3, 4.8, 4.9, 4.12, 4.13

5 5.1 to 5.4, 5.8, 5.9, 5.10

6 6.1, 6.2, 6.4

7 7.5

Practicing Only These Exercises Is Enough

 

Necessary Instructions-
 

Keep the following instructions in mind while reading the book-

The book has nearly 300 pages.

However, if you cover only GATE related topics, it comes down to 150 pages.
This subject has a good weightage in GATE exam.
The knowledge of this subject is required in solving some of the data structures and algorithms problems.
The exercise questions of this book are quite good from practice point of view.
Practice C programming questions from all the previous GATE papers.
Mostly, questions in this subject come from the topic of arrays and pointers.
Having a firm grip over arrays and pointers will ensure good marks in the exam.

Conclusion-
 

The textbook covers many more topics than those mentioned in the GATE syllabus.
Reading the above described sections will ensure all the topics are covered.
Overall, covering this book alone is more than enough for GATE preparation of this subject.
You need not to refer anything else.

 
 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 is the best book among the few available reference books for this subject.
It covers much more than what is present in the GATE syllabus.
It discusses the content in quite clear, simple and lucid style.
It is suitable for beginners as well as intermediate students.
It has sufficient number of exercise questions which are high in quality.

Analysis of Content-
 

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

GATE Relevant
 Chapter No. GATE Topics Covered
Sections

1 All Sections Introduction to Compilers

2 All Sections Basics of Syntax Directed Translator

3 3.1 to 3.5 Lexical Analysis and Tokens

4.1.1
Introduction to Syntax Analysis
4.1.2

4.2 Context Free Grammars

(Overlaps with Theory of Computation Syllabus)

4 4.3

4.4 Top-Down Parsing

4.5 Bottom-Up Parsing

4.6 to 4.9 LR Parsing and Parser Generators

5 All Sections Syntax Directed Translation

6.1 Directed Acyclic Graphs

6.2 Three Address Code

6
6.6
Control Flow and Backpatching
6.7

7.2
Stack Allocation & Accessing Data on Stack
7 7.3

7.4 Heap Management

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.

1 1.6.1, 1.6.2, 1.6.3, 1.6.4

2 2.2.1 to 2.2.6, 2.3.1 to 2.3.5, 2.4.1, 2.6.1 to 2.6.3

3 3.1.1, 3.3.2, 3.3.3, 3.3.5, 3.3.6, 3.3.7, 3.3.9, 3.3.10

4.2.1 to 4.2.8, 4.3.1 to 4.3.3, 4.4.1, 4.4.3, 4.4.4, 4.4.5, 4.4.6,

4
4.4.7, 4.5.1 to 4.5.3, 4.6.1 to 4.6.7, 4.7.1 to 4.7.5, 4.8.1

5.1.1 to 5.1.3, 5.2.1 to 5.2.5, 5.3.1 to 5.3.3, 5.4.2 to 5.4.6, 5.5.1

5
to 5.5.5

6.1.1, 6.1.2, 6.2.1, 6.2.2, 6.2.3, 6.6.1, 6.6.3, 6.6.4, 6.6.5, 6.6.6,
6
6.7.1 to 6.7.3

7 7.2.1 to 7.2.5, 7.3.1, 7.3.2, 7.4.1

Practicing Only These Exercises Is Enough

 

Necessary Instructions-
 

Keep the following instructions in mind while reading the book-

The book has nearly 1000 pages.

So, be selective and read only the relevant sections from the book.
If you follow the GATE syllabus, the number of pages reduces significantly.
Target code generation and code optimization are no longer the part of syllabus.
From the past 2-3 years, the weightage of this subject has reduced.
In last previous years, there have been hardly one or two questions asked.
So, prepare accordingly keeping in mind the weightage of this subject.
The exercise questions of this book are at par with the level of questions asked in the GATE exam.
Practicing exercise questions along with previous year questions is sufficient to perform excellent.

Conclusion-
 

This textbook covers many more topics than those mentioned in the GATE syllabus.
 Necessary Instructions
Conclusion

Why Should Be Read?

 

Special Features of Book-

 

The special features of this book are-

It contains the most well-balanced text for this subject.

It covers the concepts in detail without getting verbose.
It contains clear and concise diagrams and tables.
It is a good choice for beginners and intermediate level students.
The chapters covering Data Link layer and Network layer are explained in great detail.
No other text book has as clear explanation for Transport layer as this book has.
Exercise questions are numerical as well as conceptual in nature.
The difficulty level of exercise questions is at par with the level of questions asked in GATE.

Analysis of Content-
 

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

GATE Relevant
Chapter No. GATE Topics Covered
Sections

1 1.4 Reference Models (OSI and TCP/IP)

2.5.1 Transmission Encoding (NRZ, Manchester etc)

2
2.6.5 Switching (Circuit and Packet)

3.1 Basics of Data Link Layer

3.2 Error Detection and Correction

3
3.3.2 Flow Control

(Stop and Wait, Sliding Window Techniques)

3.4

4.2.1 Multiple Access Protocols

(Aloha and CSMA)

4.2.2

4.3 Ethernet
4
4.4 WiFi

Networking Devices
4.8
(Bridge, Hub, Switch etc)

5.1 Network Layer Introduction

5.2.1 to 5.2.5 Routing (Distance Vector and Link State Routing)

5
5.4.2 Traffic Shaping (Leaky and Token Bucket)

5.6.1 to 5.6.3 Internet Protocol (IPv4 and IPv6)

6.1.3 Sockets

6 6.4.1 User Datagram Protocol (UDP)

6.5.1 to 6.5.10 Transmission Control Protocol (TCP)

7 7.1 to 7.3 Application Layer Protocols

8.3 Public Key Algorithms

 8.4.2
Digital Signatures and Message Digests
8.4.3
8
8.5.1 Digital Certificates

8.6.2 Firewalls

8.7.2 Diffie-Hellman Key Exchange

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.

1 15, 16, 22, 27, 28

2 37, 38, 39

3 1, 2, 6, 8, 11, 13, 15, 16, 18, 20, 22, 32, 33, 35

4 2, 4, 6, 10, 13, 15, 16, 38

5 6, 7, 16, 18, 19, 23, 24, 25, 26, 28, 30, 31, 33, 37, 40

6 7, 9, 22, 26, 28, 30, 31, 32, 33, 34, 36, 42, 43

7 4, 20, 42

8 17, 18, 22, 32, 33

Practicing Only These Exercises Is Enough

 

Necessary Instructions-
 

Keep the following instructions in mind while reading the book-

 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-

GATE Relevant
Chapter No. GATE Topics Covered
Sections
 1.2 Functional Units of Computer

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

2.1
Memory and Addresses
2.2

2 2.5 Addressing Modes

2.7 Input / Output Operations

2.9 Subroutines

4.2 Interrupts

4 4.4 Direct Memory Access (DMA)

4.5 Buses

Memory System

5 5.1 to 5.9 (Organization of RAM Chip, Cache Memory, Virtual

Memory etc)

6.1
Signed Number Addition Using Adders
6.2

6 6.4 Booth’s Algorithm

Floating Point Number Representation

6.7
(Listed Under Digital Logic in GATE Syllabus)

Processing and Control Unit

7 7.1 to 7.5
(Hardwired, Microprogrammed)

Pipelining

8 8.1 to 8.5 (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.

1 1.5, 1.6

2 2.1, 2.2, 2.5, 2.8, 2.13, 2.17, 2.20

4 4.3, 4.8, 4.12, 4.20

5.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
5.27, 5.29

6 6.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

7 7.4, 7.5, 7.8, 7.18, 7.21, 7.26, 7.30

8 8.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-
 Analysis of Exercises
Necessary Instructions
Conclusion

Why Should Be Read?

 

Special Features of Book-

 

The special features of this book are-

It is one of the most detailed books for this subject.

It covers all the GATE topics.
The topics of Transaction Management are covered in great depth especially.
It deals with the content in a simple and crystal clear way which makes the subject beginner friendly.
Its exercise questions are of high quality and at par with the level of questions asked in the GATE exam.

Analysis of Content-
 

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

GATE Relevant
Chapter No. GATE Topics Covered
Sections
 1 All Sections Overview (Optional Read)

2 2.1 to 2.5 Basics of ER Model

3.1 to 3.4 Relational Model

3
3.5 ER to Relational Model

4.2 Relational Algebra

4
4.3 Relational Calculus

5 5.1 to 5.6 SQL Queries

8.1 to 8.3 Indexing

8 8.4 File Organization

8.5 Performance Tuning

16.1
Transactions and ACID Properties
16.2
16
16.3
Concurrent Execution and Lock-based Concurrency
Control
16.4

17.1 View Serializability

17
17.2 to 17.6 Lock Management and Deadlocks

18.2

18 18.5 Crash Recovery and Check-pointing

18.6

19 All Sections Normalization

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.

2 2.2, 2.3, 2.4, 2.7, 2.8

3 3.2, 3.5, 3.7, 3.8, 3.9

4 4.2, 4.3, 4.4, 4.5

5 5.1 to 5.5, 5.7, 5.10

8 8.4, 8.7, 8.10, 8.11

16 16.2, 16.3, 16.5, 16.8, 16.9

17 17.2, 17.3, 17.4, 17.6, 17.7

19 19.2, 19.3, 19.5, 19.7, 19.8, 19.10, 19.12, 19.13, 19.18, 19.24, 19.26

Practicing Only These Exercises Is Enough

 

Necessary Instructions-
 

Keep the following instructions in mind while reading the book-

The book has nearly 1100 pages.

Read only selective topics which are part of a GATE syllabus.
Competitive exams mainly focus on numerical questions from this subject.
So, practice all the questions mentioned in the Analysis of Exercises section.
Theoretical questions may be asked but less frequently asked.
So, keep making short notes while reading the book to solve theoretical questions.
Focus on the topics of Normalization and Transaction Management.
Questions from these topics are asked every year in the GATE exam.

Conclusion-
 

This textbook covers the entire GATE syllabus in a clear and detailed manner.
The exercise questions provide good practice to solve GATE questions.
 Necessary Instructions
Conclusion

Why Should Be Read?

 

Special Features of Book-

 

The special features of this book are-

It contains the most comprehensive text on this subject.

It is recommended even in IITs.
It covers all the GATE topics crisply.
It follows a very simple and easy-to-understand approach.
It is suitable for beginners as well as intermediate-level students.
It has ample exercise questions for practice.
The exercise questions are at par with the level of questions asked in the GATE exam.

Analysis of Content-
 

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

 
 GATE Relevant
Chapter No. GATE Topics Covered
Sections

1 All Sections Binary Systems

2.1 to 2.6 Boolean Algebra

2
2.7 Logic Gates

3.1 to 3.4 K-Maps

3
3.5 to 3.8 Implementation of SOP & POS forms

4.1 to 4.4 Combinational Circuits

4
4.5 to 4.9 Multilevel NAND / NOR Circuits & Implementation

5.2 to 5.3 Adder & Subtractor

5 5.4 to 5.6 Encoders, Decoders, MUX

5.7 ROM

6.1 to 6.3 Sequential Circuits & Flip Flops

6 6.4 to 6.6 Characteristics & Excitation Tables of Flip Flops

6.7 to 6.8 Design of Sequential Circuits & Counters

7.1 to 7.3 Registers

7 7.4 to 7.5 Counters

7.7 to 7.8 RAM

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.

 1 1-10, 1-11, 1-12, 1-13, 1-14, 1-16, 1-17, 1-18, 1-19, 1-22, 1-23, 1-24, 1-31

2 2-1 to 2-7, 2-11 to 2-18, 2-22

3 3-5 to 3-8, 3-11 to 3-19, 3-22 to 3-27

4 4-1 to 4-11, 4-15 to 4-19, 4-21, 4-22, 4-28 to 4-30

5 5-4 to 5-7, 5-12, 5-13, 5-15 to 5-18, 5-23 to 5-32

6 6-1 to 6-3, 6-5 to 6-9, 6-11 to 6-16, 6-19 to 6-25

7 7-4, 7-5, 7-8, 7-9, 7-10, 7-14 to 7-17, 7-33 to 7-37

Practicing Only These Exercises Is Enough

 

Necessary Instructions-
 

Keep the following instructions in mind while reading the book-

The book has nearly 500 pages.

However, if you cover only GATE related topics, it comes down to 300 pages.
There is not much to skip from the first seven subjects.
It is the most scoring subject out of all the subjects in the GATE syllabus.
The questions asked are pretty straight forward.
If you have studied this subject well, you can answer all the questions easily.
Most of the questions asked are from the topics of combinational & sequential circuits.
Sequential circuits is the only part from where tough questions may be asked.
So, lay down more focus on sequential circuits.
The questions asked in the exam are purely numerical in nature.
So, give utmost importance to solving the exercise questions.
Practicing exercise questions is enough for getting a good grip over the subject.

Conclusion-
 

The textbook covers all the topics mentioned in the GATE syllabus.
The well-curated exercise questions provide sufficient practice to solve GATE questions.
 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-
 

GATE Relevant
Chapter No. GATE Topics Covered
Sections

1.1
1 Basics of Algorithms
1.2

2.1
Insertion Sort
2 2.2

2.3 Merge Sort

3 All Sections Asymptotic Notations & Growth of Functions

4.1 to 4.3
4 Divide & Conquer, Solving Recurrences, Master’s Theorem
4.5

6 All Sections Heap Sort & Priority Queues

7.1

7 7.2 Quick Sort

7.4

8 All Sections Counting Sort, Radix Sort, Bucket Sort

10.1

10 10.2 Stacks, Queues & Linked List

10.4

11 11.1 to 11.4 Hashing, Open Addressing

12 12.1 to 12.3 Binary Trees

15.1

15 15.2 Dynamic Programming Algorithms

15.4

16 16.1 to 16.3 Greedy Algorithms

 22 All Sections Graph Representations & Traversal Algorithms

Minimum Spanning Tree Algorithms

23 All Sections
(Prim’s and Kruskal’s)

24 24.1 to 24.3 Bellman Ford & Dijkstra’s Algorithm

25 25.2 Floyd-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.

1 1.2-2, 1.2-3

2 2.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

3 3.1-1, 3.1-2, 3.1-4, 3.2-3, 3.1, 3.3, 3.4

4.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
4.5-1, 4.5-3, 4.5-4, 4.1, 4.3, 4.5, 4.6

6.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
6.3

7 7.1-1 to 7.1-4, 7.2-1 to 7.2-3, 7.4-6, 7.4

8 8.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

10 10.1-1 to 10.1-7, 10.2-2, 10.2-3, 10.2-8, 10.4-1 to 10.4-6, 10.1

11 11.2-1 to 11.2-3, 11.4-1, 11.4-3

12 12.1-1 to 12.1-5, 12.2-1, 12.2-5, 12.2-6

15 15.1-3 to 15.1-5, 15.2-1, 15.2-6, 15.4-1, 15.4-3

16 16.1-2, 16.1-4, 16.2-1, 16.2-2, 16.2-3, 16.2-6, 16.3-3

 22.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 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

23 23.1-1 to 23.1-11, 23.2-2 to 23.2-5, 23.2, 23.3

24 24.1-1, 24.1-6, 24.2-1, 24.3-1, 24.3-2, 24.3-10

25 25.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.
 Necessary Instructions
Conclusion

Why Should Be Read?

 

Special Features of Book-

 

The special features of this book are-

It is the best book among the all the available reference books for this subject.
It covers all the GATE topics in detail without getting verbose.
It explains the content in a pretty simple and straight forward language.
It makes the subject fun to read.
It is suitable for beginners as well as intermediate students.
Turing Machines and Undecidability are covered in a very clear and crisp manner.
It contains large number of exercise questions yet the quality is pretty good.

Analysis of Content-
 

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

GATE Relevant
 Chapter No. GATE Topics Covered
Sections

1 All Sections Introduction

2.1 Deterministic Finite Automata (DFA)

2 2.2 Non-Deterministic Finite Automata (NFA)

2.3 to 2.4 Equivalence of DFA and NFA, Minimizing States

Regular Expression, Regular Language and Regular

3 3.1 to 3.2
Grammar

Closure Properties, Pumping Lemma for Regular

4 4.1 to 4.3
Languages

5 5.1 to 5.3 Context Free Grammars- Parsing and Ambiguity

Grammar Transformations
6.1
(Removing Epsilon and Unit Productions)
6

6.2 Chomsky and Greibach Normal Forms

Non-Deterministic PDA, Deterministic PDA and Context-

7 7.1 to 7.3
Free Languages

8.1 Pumping Lemma for Context Free Languages

8
8.2 Closure Properties of Context Free Languages

9 9.1 to 9.3 Turing Machine

10 All Sections Variations of Turing Machine and Linear Bound Automata

11 All Sections Hierarchy of Languages

Undecidability, TM Halting Problem, Post Correspondence

12 All Sections
Problem

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.

2.1-1 to 2.1-16, 2.1-24, 2.2-2 to 2.2-16, 2.3-1, 2.3-2, 2.3-3, 2.3-6,

2 2.3-7, 2.3-8, 2.3-9, 2.3-11, 2.3-12, 2.3-14, 2.3-15, 2.4-1, 2.4-2, 2.4-
4, 2.4-5, 2.4-9

3.1-1 to 3.1-17, 3.1-24, 3.1-25, 3.1-26, 3.2-1 to 3.2-6, 3.2-8 to 3.2-

3
13, 3.2-17, 3.2-18, 3.3-1 to 3.3-13, 3.3-16

4.1-2, 4.1-5, 4.1-6 to 4.1-18, 4.1-22 to 4.1-26, 4.3-1 to 4.3-15, 4.3-

4
17, 4.3-18

5 5.1-2 to 5.1-22, 5.2-1 to 5.2-8, 5.2-10 to 5.2-16

6.1-2, 6.1-3, 6.1-5 to 6.1-9, 6.1-14, 6.1-19, 6.1-22 to 6.1-24, 6.2-2

6
to 6.2-16

7 7.1-1 to 7.1-15, 7.2-1 to 7.2-16, 7.3-1 to 7.3-18

8 8.1-1 to 8.1-15, 8.1-20, 8.2-1 to 8.2-19

9 9.1-2 to 9.1-12, 9.2-2 to 9.2-5

10.1-1, 10.1-4, 10.1-7, 10.2-1 to 10.2-6, 10.4-5, 10.4-8, 10.4-9,

10
10.5-4 to 10.5-6

11 11.1-1 to 11.1-19, 11.2-1, 11.2-4, 11.2-7, 11.3-1 to 11.3-4

12.1-5, 12.1-7, 12.1-9, 12.1-13, 12.1-16, 12.2-2 to 12.2-8, 12.3-1,

12
12.3-3, 12.3-5, 12.4-2 to 12.4-9

Practicing Only These Exercises Is Enough

 

Necessary Instructions-
 

Keep the following instructions in mind while reading the book-

The book has nearly 400 pages.

The number of pages is considerably less as compared to other books.
Apart from two chapters, all the chapters have GATE relevant topics.
So, there is not much to filter while reading the book.
 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-
 

GATE Relevant
Chapter No. GATE Topics Covered
Sections

1.1 to 1.3
Introduction to Operating Systems
1 1.5
(Optional to Read)

1.6

2.1 Process Management

2.2 Threads

2.3 Inter-Process Communication

2 Process Scheduling
2.4
(First Come First Serve, Round Robin etc)

Classical Inter-Process Communication Problems

2.5
(Producer-Consumer, Dining Philosophers etc)

3.1
Memory Abstraction
3.2

3.3 Virtual Memory

Page Replacement Algorithms

3 3.4
(FIFO, LRU, Optimal etc)

3.5
Paging Design and Implementation Issues
3.6

3.7 Segmentation

4 4.3 to 4.5.2 File Management System

Input Output
5.1 to 5.3
(Overlaps with Computer Organization Syllabus)
5
 5.4.1 to 5.4.4 Disk Scheduling Algorithms

6 All Sections Deadlock

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.

1 4, 5, 10, 11, 13, 14,15, 24

5, 6, 7, 8, 16, 17, 23, 24, 25, 26, 27, 30, 32, 33, 39, 40, 41, 42, 43,
2
44, 45, 46, 49, 51, 54, 55

2, 4, 6, 7, 11, 12, 13, 14, 15, 16, 17, 19, 20, 22, 24, 25, 27, 28, 33,
3
35, 36, 38, 42, 44, 45, 47

4 12, 13, 16, 18, 23, 24, 25, 32, 36, 37, 38, 40

5 5, 6, 8, 11, 12, 17, 18, 19, 20, 21, 28, 31, 32, 37

6 5, 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.