C ATALOGUE

20 1 7

COMPUTER
Pearson India Education Services Pvt. Ltd.
15th Floor, World Trade Tower, Plot No: C - 01, Sector 16, Noida 201301, Uttar Pradesh – India
T: +91 (120) 4306 500, 4306 550 www.pearson.co.in [email protected]
Pearson India Education Services Private Limited (Formerly TutorVista Global Private Limited) Regd Off: 4th floor, Software Block, Elnet Software City, TS-140, Block 2 & 9, Rajiv Gandhi Salai, Taramani, Chennai, Tamil Nadu 600113, CIN: U72200TN2005PTC057128
SCIENCE
 Educating 100 million people worldwide, Pearson Education is the world’s biggest education company. Pearson
Education’s education solutions cover a wide spectrum of subjects including business, technology, sciences, law
and the humanities. They include books and resources that help students learn, teachers teach, and professionals
evolve throughout their careers. The carefully designed learning tools help people around the world to expand their
knowledge, develop their skills and realize their potential. The company is committed to provide quality content,
assessment tools and educational services in all available media, spanning the learning curve from birth through
university and beyond.

Pearson Education India specializes in the publication of academic and reference books in the fields of computer
science, engineering, business & management, professional & trade, higher education and competitive examination
preparation books. Pearson Education India is also India’s foremost publisher in the school segment (K-12), with book
lists in English language teaching (ELT), the humanities, sciences and mathematics, from primary to senior secondary
classes.

With elaborate editorial facilities in Delhi, Chennai and Chandigarh, Pearson Education India covers the entire
subcontinent and has specific divisions with experienced editorial teams catering to all levels and fields of education.
The teams create indigenous publishing programmes to meet local market needs, and undertake customized publishing
for schools, universities and other institutions. Pearson Education India also works closely with authors and customers
through strong editorial development processes and innovations in sales and marketing.

00_FM.indd 1 4/5/2017 4:45:18 PM

00_FM.indd 2 4/5/2017 4:45:18 PM
 Contents
Algorithm Design..........................................................................................................................................1
Artificial Intelligence (AI)..............................................................................................................................6
Computer Vision....................................................................................................................................... 10
Pattern Recognition................................................................................................................................... 11
Programming for Artificial Intelligence (AI).............................................................................................. 12
Automata Theory and Theory of Computer Science............................................................................. 13
Compiler Construction/Language Processors........................................................................................ 19
Discrete Mathematics and Graph Theory............................................................................................... 21
Essence Series............................................................................................................................................ 25
Error Control............................................................................................................................................ 26
Bioinformatics............................................................................................................................................ 27
Advanced Computer Architecture........................................................................................................... 29
Computer Organization and Architecture............................................................................................... 32
System Simulation...................................................................................................................................... 37
Mobile Computing / Mobile Communication........................................................................................ 39
Genetic Algorithms/Soft Computing....................................................................................................... 43
Data Warehousing and Data Mining........................................................................................................ 47
Database Systems...................................................................................................................................... 51
Decision Support Systems........................................................................................................................ 63
Digital Design/Digital Electronics............................................................................................................. 65
Distributed Database Systems.................................................................................................................. 93
E-Commerce............................................................................................................................................. 95
IT Infrastructure......................................................................................................................................... 97
IT Fundamentals........................................................................................................................................ 99
Programming Methodology.................................................................................................................... 102

00_FM.indd 3 4/5/2017 4:45:18 PM

 Computer Graphics................................................................................................................................ 104
Human Computer Interaction/User Interface Designing..................................................................... 109
Multimedia............................................................................................................................................... 112
Virtual Reality/Augmented Reality......................................................................................................... 115
Data Communications and Computer Networking.............................................................................. 116
Network Management............................................................................................................................ 128
Network Security.................................................................................................................................... 130
Neural Networks / Fuzzy Logic............................................................................................................. 138
Network Programming........................................................................................................................... 142
Distributed Systems................................................................................................................................ 143
Operating Systems.................................................................................................................................. 146
Parallel Processing................................................................................................................................... 153
C Programming....................................................................................................................................... 154
C++ Programming.................................................................................................................................. 161
Data Structures Using C......................................................................................................................... 170
Data Structures Using C++.................................................................................................................... 176
Data Structures Using Java...................................................................................................................... 177
File Structures/File Management............................................................................................................ 179
Java Programming.................................................................................................................................... 180
Programming Languages......................................................................................................................... 195
Real Time Systems................................................................................................................................... 207
Visual Programming................................................................................................................................. 209
Visual C#................................................................................................................................................. 209
Express Learning...................................................................................................................................... 210
Object Oriented Software Engineering.................................................................................................. 218
Software Engineering............................................................................................................................... 219
Software Project Management............................................................................................................... 225
Software Testing...................................................................................................................................... 226

iv

00_FM.indd 4 4/5/2017 4:45:19 PM

 Unified Modeling Language (UML)......................................................................................................... 230
System Engineering.................................................................................................................................. 232
Systems/Assembly Language Programming.......................................................................................... 233
Internet/Web Programming.................................................................................................................. 234
Big Data and Data Analytics................................................................................................................... 240
Cloud Computing / Grid computing / Cluster Computing................................................................. 248
Android Programming ........................................................................................................................... 256
iOS Development................................................................................................................................... 271
Internet of Things (IoT).......................................................................................................................... 274

00_FM.indd 5 4/5/2017 4:45:19 PM

00_FM.indd 6 4/5/2017 4:45:19 PM
 Algorithm Design
The Design and Analysis of Computer
Algorithms
Alfred V. Aho • John E. Hopcroft • Jeffrey D. Ullman
ISBN: 9788131702055 | © Year: 2002 | Pages: 480

About the Book

The Design and Analysis of Computer Algorithms introduces the basic data structures
and programming techniques often used in efficient algorithms. It covers the use
of lists, push-down stacks, queues, trees, and graphs. With this text, you gain an
understanding of the fundamental concepts of algorithms, the very heart of computer
science. It introduces the basic data structures and programming techniques often used
in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs.
Later chapters go into sorting, searching and graphing algorithms, the string-matching
algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides
numerous graded exercises at the end of each chapter.
Contents
1. Models of Computation 7. The Fast Fourier Transform and its Applications
2. Design of Efficient Algorithms 8. Integer and Polynomial Arithmetic
3. Sorting and Order Statistics 9. Pattern-Matching Algorithms
4. Data Structures for Set Manipulation Problems 10. NP-Complete Problems
5. Algorithms on Graphs 11. Some Provably Intractable Problems
6. Matrix Multiplication and Related Operations 12. Lower Bound on Numbers of Arithmetic Operations
About the Authors
Alfred V. Aho is head of the Computing Principles Research Department at AT&T Bell Laboratories in Murray Hill,
New Hersey.
Jeffrey D. Ullman is currently Professor of Computer Science at Stanford University.

Computer Algorithms: Introduction to

Design and Analysis, 3/e
Sara Baase • Allen Van Gelder
ISBN: 9788131702444 | © Year: 2002 | Pages: 708

About the Book

Drawing upon combined decades experience, Professors Sara Baasse and Allen Van
Gelder have extensively revised this best seller on algorithm design and analysis
to make it the most current and accessible book available. This edition features an
increased emphasis on algorithm design techniques such as divide-and-conquer and
greedy algorithms, along with the addition of new topics and exercises. It continues the
tradition of solid mathematical analysis and clear writing style that made this book so
popular in previous editions.

Features
• Emphasizes the development of algorithms through a • Stresses the importance of the algorithm analysis
step-by-step process rather than by merely presenting process—continuously re-evaluating, modifying
the end result. and perhaps rejecting algorithms until a satisfactory
solution is attained.

Untitled-1 1 05/04/2017 12:48:19

Algorithm Design

• Provides extensive treatment of recursion with a clear, • Uses a Java-like pseudo code; includes an appendix
student-friendly review of how it works and why it is a with Java examples.
valuable programming technique.
Features
• Material on accelerated version of Heapsort, section • Review of abstract data types, with Java class
on computing with DNA, chapter on Dynamic Sets. definitions for several commonly used ADTs such as
• Expanded treatment of recursion with a clear, student- list, tree, stack, and priority queue.
friendly review of how it works, and why it is a • Pseudocode updated from Pascal-like to Java-like;
valuable programming technique. includes an appendix with Java examples.
• Expanded mathematical background emphasizes • More than 100 new exercises.
practical techniques, including solutions to recurrence
equations.
Contents
1. Analyzing Algorithms and Problems: Principles and 8. Graph Optimization Problems and Greedy Algorithms
Examples 9. Transitive Closure, All-Pairs Shortest Paths
2. Data Abstraction and Basic Data Structures 10. Dynamic Programming
3. Recursion and Induction 11. String Matching
4. Sorting 12. Polynomials and Matrices
5. Selection and Adversary Arguments 13. NP-Complete Problems
6. Dynamic Sets and Searching 14. Parallel Algorithms
7. Graphs and Graph Traversals 15. Java Examples and Techniques
About the Authors
Sara Baase is a Professor of Computer Science at San Diego State University and has been teaching CS for 25 years. Dr.
Baase is a three-time recipient of the San Diego State University Alumni Association’s Outstanding Faculty Award, and she
has written a number of text books in the areas of algorithms, assembly language, and social and ethical issues related to
computing. She earned her doctorate at the University of California, Berkeley.
Allen Van Gelder is a Professor of Computer Science at the University of California at Santa Cruz,where he has been
teaching CS for 12 years. He received his Ph.D. in Computer Science at Stanford University and is a past recipient of the
Presidential Young Investigator Award.

Fundamentals of Algorithmics
Gilles Brassard • Paul Bratley
ISBN: 9789332549999 | © Year: 2015 | Pages: 524

About the Book

This is an introductory-level algorithm text. It includes worked-out examples and
detailed proofs. Presents Algorithms by type rather than application.

Features
• Structures material by long introduction to proofs by contradiction and
techniques employed, mathematical induction. This serves to fill the gaps
not by the application that many undergraduates have in their mathematical
area, so students can knowledge.
progress from the • Gives a paced, thorough introduction to the analysis of
underlying abstract algorithms, and uses coherent notation and unusually
concepts to the concrete application essentials. detailed treatment of solving recurrences.
• Begins with a compact, but complete introduction
to some necessary math, and also includes a

Untitled-1 2 05/04/2017 12:48:25

 Algorithm Design
• includes a chapter on probabilistic algorithms, and an • approaches the analysis and design of algorithms by
introduction to parallel algorithms, both of which are type rather than by application.
becoming increasingly important.

Contents
1. Preliminaries 8. Dynamic Programming
2. Elementary Algorithmicss 9. Exploring Graphs
3. Asymptotic Notation 10. Probabilistic Algorithms
4. Analysis of Algorithms 11. Parallel Algorithms
5. Some Data Structures 12. Computational Complexity
6. Greedy Algorithms 13. Heuristic and Approximate Algorithms
7. Divide-And-Conquer

Design and Analysis of Algorithms, 2/e

Parag H. Dave • Himanshu B. Dave
ISBN: 9788131799437 | © Year: 2013 | Pages: 1112

About the Book

The revised 2nd edition has been updated with topics on branch and bound, backtracking
and greedy method. All aspects of algorithm design and analysis have been discussed
in 22 chapters which are divided into two parts. The first part chapters, explains the
problem-solving techniques, algorithm design and data structures. The second part
explains the concepts of algorithm analysis.

Features
• The basic concepts such as problem solving, • A total of 218 examples/algorithms.
statements, functions and loops are covered in detail. • A total of 350 exercises.
• Includes design issues, computation models and proof
rules.
Contents
1. Introduction 12. Abstract Algorithms 4—Backtracking
2. Problem Solving with a Computer 13. Natural Algorithms—GA, SA, ANN, TS
3. Top-Down Design 14. Efficiency of Algorithms
4. Iterative Algorithm Design Issues 15. Examples of Complexity Calculation
5. Computation Models and Design by Refinement 16. Time-Space Trade-Off
6. Proof Rules—Basics 17. Tractable and Non-Tractable Problems
7. Design by Proof Rules 18. Some NP and NP-Complete Problems
8. Design using Recursion 19. Randomized and Approximate Algorithms
9. Abstract Algorithms 1—Divide-and Conquer 20. Formal Specifications—1 Model Oriented
10. Abstract Algorithms 2—Greedy Methods 21. Formal Specifications—2 Algebraic
11. Abstract Algorithms 3—Dynamic Programming
About the Authors
Dr. Parag H. Dave, Senior Lecturer in Computer Engineering of Dharmsinh Desai University, Gujarat.
Himanshu B. Dave, Ex-Professor and Head of Department in Department of Computer Engineering of Dharmsinh Desai
University, Gujarat.

Untitled-1 3 05/04/2017 12:48:32

Algorithm Design

Algorithm Design
Jon Kleinberg • Éva Tardos
ISBN: 9789332518643 | © Year: 2013 | Pages: 827

About the Book

Algorithm Design introduces algorithms by looking at the real-world problems that
motivate them. The book teaches students a range of design and analysis techniques for
problems that arise in computing applications. The text encourages an understanding
of the algorithm design process and an appreciation of the role of algorithms in the
broader field of computer science.

Features
• Focus on problem analysis and design techniques. • Each problem has been class tested for usefulness
• Discussion is grounded in concrete problems and and accuracy in the authors’ own undergraduate
examples rather than abstract presentation of algorithms courses.
principles, with representative problems woven • Broad coverage of algorithms for dealing with
throughout the text. NP-hard problems and the application of
• Over 200 well crafted problems with several coming randomization, increasingly important topics in
from companies such as Yahoo!® and Oracle®. algorithms

Contents
1. Introduction: Some Representative Problems 8. NP and Computational Intractability
2. Basics of Algorithms Analysis 9. PSPACE: A Class of Problems Beyond NP
3. Graphs 10. Extending the Limits of Tractability
4. Divide and Conquer 11. Approximation Algorithms
5. Greedy Algorithms 12. Randomized Algorithms
6. Dynamic Programming 13. Local Search
7. Network Flow

Untitled-1 4 05/04/2017 12:48:35

 Algorithm Design
Introduction to the Design and
Analysis of Algorithms, 3/e
Anany Levitin
ISBN: 9789332583771 | © Year: 2017 | Pages: 592

About the Book

Based on a new classification of algorithm design techniques and a clear delineation of
analysis methods, Introduction to the Design and Analysis of Algorithms presents
the subject in a coherent and innovative manner. Written in a student-friendly style, the
book emphasizes the understanding of ideas over excessively formal treatment while
thoroughly covering the material required in an introductory algorithms course. Popular
puzzles are used to motivate students’ interest and strengthen their skills in algorithmic
problem solving. Other learning-enhancement features include chapter summaries,
hints to the exercises, and a detailed solution manual.
Features
• Employs an innovative and more comprehensive • Treats algorithms as problem-solving tools and
taxonomy of algorithm design techniques. develops algorithmic thinking by using puzzles and
• Covers mathematical analysis of both nonrecursive games.
and recursive algorithms, as well as empirical analysis • Contains over 600 exercises with hints for students
and algorithm visualization. and detailed solutions for instructors.
• Discusses limitations of algorithms and ways to • New exercises and engaging puzzles.
overcome them.
Contents
1. Introduction 4. Decrease-and-Conquer 9. Greedy Technique
2. Fundamentals of the Analysis of 5. Divide-and-Conquer 10. Iterative Improvement
Algorithm Efficiency 6. Transform-and-Conquer 11. Limitations of Algorithm Power
3. Brute Force and Exhaustive 7. Space and Time Trade-Offs 12. Coping with the Limitations of
Search 8. Dynamic Programming Algorithm Power
About the Author
Anany Levitin, Villanova University.

Also Available

ISBN: 9788131708682
Pages: 766

Untitled-1 5 05/04/2017 12:48:40

Artificial Intelligence (AI)

Introduction to Artificial Intelligence

Eugene Charniak • Drew McDermott
ISBN: 9788131703069 | © Year: 2002 | Pages: 720

Contents
1. AI and Internal Representation
2. Lisp
3. Vision
4. Parsing Language
5. Search
6. Logic and Deduction
7. Memory Organization and Deduction
8. Abduction, Uncertainty and Expert Systems
9. Managing Plans of Action
10. Language Comprehension
11. Learning

Artificial Intelligence: Structures and

Strategies for Complex Problem Solving, 5/e
George F. Luger
ISBN: 9788131723272 | © Year: 2008 | Pages: 928

About the Book

Much has changed since the early editions of Artificial Intelligence were published. To
reflect this the introductory material of this fifth edition has been substantially revised
and rewritten to capture the excitement of the latest developments in AI work.
Artificial intelligence is a diverse field. To ask the question “what is intelligence?” is to
invite as many answers as there are approaches to the subject of artificial intelligence.
These could be intelligent agents, logical reasoning, neural networks, expert systems,
evolutionary computing and so on. This fifth edition covers all the main strategies used
for creating computer systems that will behave in “intelligent” ways. It combines the broadest approach of any text in
the marketplace with the practical information necessary to implement the strategies discussed, showing how to do this
through Prolog or LISP programming.
Features
• A thorough and balanced treatment of the foundations • A unique discussion of the social and philosophical
of AI. issues of AI.
• Contains a combination of theoretical foundations of • Model-based reasoning and planning examples
intelligent problem solving with the data structures from the NASA space program. Comments on the
and algorithms needed for implementation. AI endeavor from the perspectives of philosophy,
• Example programs written in LISP and PROLOG. psychology and neuro-physiology.
• Puts practical applications of AI into context.
Contents
Part I: Artificial Intelligence: its Routes and Scope Part V: Advanced Topics for AI Problem Solving
Part II: Artificial Intelligence as Representation and Search Part VI: Languages and Programming Techniques for
Part III: Representation and Intelligence: The AI Artificial Intelligence
Challenge Part VII: Epilogue
Part IV: Machine Learning

Untitled-1 6 05/04/2017 12:48:48

 Artificial Intelligence (AI)
Introduction to Artificial Intelligence
and Expert Systems
Dan W. Patterson
ISBN: 9789332551947 | © Year: 2015 | Pages: 464

About the Book

Dan W. Patterson’s Introduction to Artificial Intelligence and Expert Systems, is a
comprehensive book for Computer Science graduation and post-graduation students.
It comprises of various concepts of knowledge-system approach and stresses on the
relevant use of its knowledge in particular expert systems. The book discusses topics
such as Introduction and Overview of Artificial Intelligence; Knowledge Representation
and Formalized Symbolic Logics; Knowledge Organization and Manipulation and
Search and Control Strategies; Perception, Communication and Expert Systems and
Natural Language Processing; and Knowledge Acquisition and General Concepts in
Knowledge Acquisition.

Contents
Preface Matching Techniques
Part 1: Introduction to Artificial Intelligence_Overview of Knowledge Organization and Management
Artificial Intelligence Part 4: Perception, Communication and Expert Systems_
Knowledge: General Concepts Natural Language Processing
LISP and Other AI Programming Languages Pattern Recognition
Part 2: Knowledge Representation_Formalized Symbolic Visual Image Understanding
Logics Expert Systems Architectures
Dealing with Inconsistencies and Uncertainties Part 5: Knowledge Acquisition_General Concepts in
Probabilistic Reasoning Knowledge Acquisition
Structured Knowledge: Graphs, Frames and Related Early Work in Machine Learning
Structures Learning by Induction
Object Oriented Representations Examples of Other Inductive Learners
Part 3: Knowledge Organization and Manipulation_Search Analogical and Explanation Based Learning
and Control Strategies References

Artificial Intelligence: A Modern

Approach, 3/e
Stuart Russell • Peter Norvig
ISBN: 9789332543515 | © Year: 2015 | Pages: 1168

About the Book

This edition captures the changes that have taken place in the field of artificial
intelligence (AI) since the last edition in 2003.
There have been important applications of AI technology, such as the widespread
deployment of practical speech recognition, machine translation, autonomous vehicles,
and household robotics. There have been algorithmic landmarks, such as the solution
of the game of checkers. There has also been a great deal of theoretical progress,
particularly in areas such as probabilistic reasoning, machine learning, and computer
vision.

Untitled-1 7 05/04/2017 12:48:55

Artificial Intelligence (AI)

Features
• Nontechnical learning material provides a simple • Comprehensive, up-to-date coverage — Includes a
overview of major concepts. unified view of the field organized around the rational
• Expanded coverage of topics such as constraint decision making paradigm.
satisfaction, local search planning methods, multi- • In-depth coverage of basic and advanced topics which
agent systems, game theory, statistical natural language provides students with a basic understanding of the
processing and uncertain reasoning over time. frontiers of AI without compromising complexity and
• More detailed descriptions of algorithms for depth.
probabilistic inference, fast propositional inference, • Pseudo-code versions of the major AI algorithms are
probabilistic learning approaches including EM, and presented in a uniform fashion, and Actual Common
other topics. Lisp and Python implementations of the presented
• Updated and expanded exercises . algorithms are available via the Internet.
• A unified, agent-based approach to AI — Organizes the
material around the task of building intelligent agents.

Contents
1. Introduction 14. Probabilistic Reasoning
2. Intelligent Agents 15. Probabilistic Reasoning over Time
3. Solving Problems by Searching 16. Making Simple Decisions
4. Beyond Classical Search 17. Making Complex Decisions
5. Adversarial Search 18. Learning from Examples
6. Constraint Satisfaction Problems 19. Knowledge in Learning
7. Logical Agents 20. Learning Probabilistic Models
8. First-Order Logic 21. Reinforcement Learning
9. Inference in First-Order Logic 22. Natural Language Processing
10. Classical Planning 23. Natural Language for Communication
11. Planning and Acting in the Real World 24. Perception
12. Knowledge Representation 25. Robotics
13. Quantifying Uncertainty 26. Philosophical Foundations

About the Author

Stuart Russell is a Fellow and former Executive Council member of the American Association for Artificial Intelligence.
He has published over 100 papers on a wide range of topics in artificial intelligence.
Peter Norvig is currently Director of Research at Google, Inc., and was the director responsible for the core Web search
algorithms from 2002 to 2005. He is a Fellow of the American Association for Artificial Intelligence and the Association
for Computing Machinery.

Artificial Intelligence, 3/e

Patrick Henry Winston
ISBN: 9788131715055 | © Year: 1992 | Pages: 764

About the Book

This book explains how it is possible for computers to reason and perceive, thus
introducing the field called artificial intelligence. This book would appeal to programmers,
professionals and students. This completely rewritten and updated edition reflects the
revolutionary progress made since the previous edition was published.

Untitled-1 8 05/04/2017 12:49:01

 Artificial Intelligence (AI)
Features
• Semiformal representation and procedure • Application examples provide a glimpse of the ideas
specifications bring the ideas to within a step or two at work in real-world systems.
implementation and highlight unifying themes. • Powerful ideas and principles are identified ad
emphasized.

Contents
1. The Intelligent Computer 15. Planning
2. Semantic Nets and Description Matching 16. Learning by Analyzing Difference
3. Generate and Test, Means-Ends Analysis, and 17. Learning by Explaining Experience
Problem Reduction 18. Learning by Correcting Mistakes
4. Nets and Basic Search 19. Learning by Recording Cases
5. Nets and Optimal Search 20. Learning by Managing Multiple Models
6. Trees and Adversarial Search 21. Learning by Building Identification Trees
7. Rules and Rule Chaining 22. Learning by Training Neural Nets
8. Rules, Substrates, and Cognitive Modeling 23. Learning by Training Perceptions
9. Frames and Inheritance 24. Learning by Training Approximation Nets
10. Fames and Commonsense 25. Learning by Simulating Evolution
11. Numeric Constraints and Propagation 26. Recognizing Objects
12. Symbolic Constraints and Propagation 27 Describing Images
13. Logic and Resolution Proof 28. Expressing Language Constrains
14. Backtracking and Truth Maintenance 29. Responding to Questions and Commands

About the Author

Patrick Henry Winston is Director of the Artificial Intelligence Laboratory at the Massachusetts Institute of Technology,
and a past resident of the American Association for Artificial Intelligence. He is co-author of a related book, Lisp, which
introduces the LISP programming language.

Also Available

ISBN: 9788131787472 ISBN: 9788131720493 ISBN: 9788131713310

Pages: 296 Pages: 440

Untitled-1 9 05/04/2017 12:49:05

Computer Vision

Computer Vision: A Modern Approach, 2/e

David A. Forsyth • Jean Ponce
ISBN: 9789332550117 | © Year: 2015 | Pages: 792

About the Book

This textbook provides the most complete treatment of modern computer vision
methods by two of the leading authorities in the field. This accessible presentation
gives both a general view of the entire computer vision enterprise and also offers
sufficient detail for students to be able to build useful applications. Students will learn
techniques that have proven to be useful by first-hand experience and a wide range of
mathematical methods.

Features
• Broad coverage—Coverage of a wide range of topics • Application surveys—Describe numerous important
allows customization to fit instructor, student, and application areas such as image based rendering and
course needs. digital libraries.
• Most comprehensive and up-to-date text on computer • Many important algorithms broken down and
vision—Includes essential topics that either reflect illustrated in pseudo code.
practical significance or are of theoretical importance. • Excellent pedagogy throughout the text—Includes
• Depth of the material accessible to various levels of numerous worked examples, exercises, programming
students—Topics are discussed in substantial and assignments, and extensive illustrations.
increasing depth.

Contents
1. Geometric Camera Models 8. Structure from Motion
2. Light and Shading 9. Segmentation by Clustering
3. Colo 10. Grouping and Model Fitting
4. Linear Filters 11. Tracking
5. Local Image Features 12. Registration
6. Texture 13. Smooth Surfaces and Their Outlines
7. Stereopsis 14. Range Data

About the Author

David A. Forsyth, University of Illinois at Urbana-Champaign.
Jean Ponce, Ecole Normale Superieure, Paris.

10

Untitled-1 10 05/04/2017 12:49:10

 Pattern Recognition
Pattern Recognition and Image Analysis
Earl Gose • Richard Johnsonbaugh • Steve Jost
ISBN: 9789332549791 | © Year: 2015 | Pages: 496

About the Book

Over the past 20 to 25 years, pattern recognition has become an important part of
image processing applications where the input data is an image. This book is a complete
introduction to pattern recognition and its increasing role in image processing. It covers
the traditional issues of pattern recognition and also introduces two of the fastest
growing areas: Image Processing and Artificial Neural Networks. Examples and digital
images illustrate the techniques, while an appendix describes pattern recognition using
the SAS statistical software system.

11

Untitled-1 11 05/04/2017 12:49:13

Programming for Artificial Intelligence (AI)

PROLOG: Programming for Artificial

Intelligence, 3/e
Ivan Bratko
ISBN: 9788131711347 | © Year: 2002 | Pages: 704

About the Book

The third edition of this best-selling guide to Prolog and Artificial Intelligence has been
updated to include key developments in the field while retaining its lucid approach to
these topics. Prolog has its roots in logic, however the main aim of this book is to teach
Prolog as a practical programming tool. This text therefore concentrates on the art of
using the basic mechanisms of Prolog to solve interesting problems.

Features
• Combined approach to Prolog and AI allows flexibility • The addition of belief networks for handling
for learning and teaching. uncertainty.
• Provides a thorough representation of AI, emphasizing • A major update on machine learning.
practical techniques and Prolog implementations. • Additional techniques for improving Program
• Prolog programs for use in projects and research are efficiency.
available for download on the World Wide Web. • Meta-programming is updated to show how Prolog
New and/or revised in this edition can be used to implement other languages (including
• Constraint Logic Programming object-oriented programming).
• Qualitative Reasoning • A new Companion Web site will contain further
• Inductive Logic Programming teaching materials and updates.

Contents
1. The Prolog Language • Best-First Heuristic Search
• Introduction to Prolog • Problem Decomposition and AND/OR Graphics
• Syntax and Meaning of Prolog Programs • Constraint Logic Programming
• Lists, Operators, Arithmetic • Knowledge Representation and Expert Systems
• Using Structures: Example Programs • An Expert System Shell
• Controlling Backtracking • Planning
• Input and Output • Machine Learning
• More Built-in Predicates • Inductive Logic Programming
• Programming Style and Techniques • Qualitative Reasoning
• Operations on Data Structures • Language Processing with Grammar Rules
2. Prolog in Artificial Intelligence • Game Playing
• Basic Problem-Solving Strategies • Meta-Programming

About the Author

Professor Ivan Bratko leads the AI groups in the Faculty of Computer and Information Science at both Ljubljana University
and the Jozef Stefan Institute in Slovenia.

12

Untitled-1 12 05/04/2017 12:49:18

 Automata Theory and Theory of Computer Science
Introduction to Automata Theory,
Languages, and Computation, 3/e
John E. Hopcroft • Rajeev Motwani • Jeffrey D. Ullman
ISBN: 9788131720479 | © Year: 2008 | Pages: 554

About the Book

This classic book on formal languages, automata theory, and computational complexity
has been updated to present theoretical concepts in a concise and straightforward
manner with the increase of hands-on, practical applications. This new edition comes
with Gradiance, an online assessment tool developed for computer science.
Gradiance is the most advanced online assessment tool developed for the computer
science discipline. With its innovative underlying technology, Gradiance turns basic
homework assignments and programming labs into an interactive learning experience
for students. By using a series of “root questions” and hints, it not only tests a student’s capability, but actually simulates a
one-on-one teacher-student tutorial that allows for the student to more easily learn the material. Through the programming
labs, instructors are capable of testing, tracking, and honing their students’ skills, both in terms of syntax and semantics,
with an unprecedented level of assessment never before offered.

Features
• Presents theoretical concepts in a concise and • Challenges readers with extensive exercises at various
accessible style. levels of difficulty at the end of each chapter.
• Emphasizes modern applications of the theory. • Includes additional practice and tests comprehension
• Uses numerous figures to help convey ideas. of important concepts with Gradiance an online
• Provides more detail and intuition for definitions homework and tutorial system.
and proofs.

Contents
1. Automata: The Methods and the Madness 7. Properties of Context-Free Languages
2. Finite Automata 8. Introduction to Turing Machines
3. Regular Expressions and Languages 9. Undecidability
4. Properties of Regular Languages 10. Intractable Problems
5. Context-Free Grammars and Languages 11. Additional Classes of Problems
6. Pushdown Automata

Introduction to Automata Theory, Formal

Languages and Computation
Shyamalendu Kandar
ISBN: 9788131793510 | © Year: 2013 | Pages: 656

About the Book

Formal languages and automata theory is the study of abstract machines and how
these can be used for solving problems. The book has a simplistic approach to topics
like automata theory, formal languages and theory of computation and explains
them exhaustively. The difficult topics are described in a step-wise manner, which
makes it easy for the students to comprehend them. These descriptions are followed
by numerous relevant examples related to the topic. A brief introductory chapter on
compilers explaining its relation to theory of computation is also given.

13

Untitled-1 13 05/04/2017 12:49:25

Automata Theory and Theory of Computer Science

Features
• Exhaustive coverage on finite automata covering topics • Excellent and exhaustive pedagogy:
like Mealy and Moore machines, interconversion, – 500+ figures
two-way finite automata, application and limitation of – 500+ solved examples
finite automata. – 277+ objective-type questions with answers
• Detailed and in-depth discussion on Turing machine – 135+ unsolved questions
and its variations. • Summary at the end of each chapter for fast
• Over 15 years of GATE question papers discussed in recapitulation of concepts.
the book.
• Discussion of previous years’ questions (related to
the subject) that appeared in different university
examinations.

Contents
1. Basic Terminology 8. Turing Machine
2. Language & Grammar 9. Variation of Turing Machine
3. Finite Automata 10. Undecidability
4. Finite State Machine 11. Recursive Function
5. Regular Expression 12. Computational Complexity
6. Context Free Grammar 13. Basic of Compiler
7. Pushdown Automata 14. Advance Topics Related to Automata

About the Author

Shyamalendu Kandar is currently working as Assistant Professor of computer science and engineering at Haldia Institute
of Technology, Haldia, West Bengal. He acted as a Coordinator of HIT centre for the course M.Tech (IT) distance mode
conducted by Jadavpur University. He teaches subjects like formal language & automata theory, compiler design, analysis
of algorithms, web technology, and object oriented programming. He has a number of research papers in different national
& international conferences/ journals of repute. His research interests are secret sharing, visual cryptography, etc.

Introduction to Formal Languages,

Automata Theory and Computation
Kamala Krithivasan • Rama R.
ISBN: 9788131723562 | © Year: 2009 | Pages: 436

About the Book

Introduction to Formal Languages, Automata Theory and Computation presents the
theoretical concepts in a concise and clear manner, with an in-depth coverage of formal
grammar and basic automata types. The book also examines the underlying theory
and principles of computation and is highly suitable to the undergraduate courses in
computer science and information technology. An overview of the recent trends in the
field and applications are introduced at the appropriate places to stimulate the interest
of active learners.

Features
• Numerous worked-out examples and problems to models of computation for the benefit of the students
facilitate easier recapitulation of the concepts learnt. contemplating an in-depth research.
• Exhaustive coverage of computability and decidability • Multiple-choice questions designed in a way to help
through Turing machines. students understand the basics.
• Advanced topics on formal languages and new

14

Untitled-1 14 05/04/2017 12:49:31

 Automata Theory and Theory of Computer Science
Contents
1. Preliminaries 8. Context-Free Grammars–properties and parsing
2. Grammars 9. Turing Machine
3. Finite State Automata 10. Variations of Turing Machines
4. Finite State Automata: Characterization, Properties, 11. Universal Turing Machine and Decidability
and Decidability 12. Time and Space Complexity
5. Finite State automata with Output and Minimization 13. Recent trends and applications
6. Variants of Finite Automata 14. New Models of Computation
7. Pushdown Automata

About the Authors

Kamala Krithivasan received her Ph.D. from the University of Madras,and she joined the Indian Institute of Technology
Madras (IITM) in 1975. With more than 30 years of teaching and research experience at IITM, she is currently Professor
at the Department of Computer Science and Engineering,in which she served as Chairperson during 1992–1995. Her
research interests include formal language theory and unconventional models of computing like DNA computing,
membrane computing and discrete tomography. A recipient of the Fulbright fellowship in 1986, Professor Kamala is also
a fellow of the Indian National Academy of Engineering.
Rama R. was awarded a doctoral degree by Anna University in 1989. She taught in the College of Engineering, Anna
University, before joining the Department of Mathematics, Indian Institute of Technology Madras (IITM), as Assistant
Professor in 1996. She was subsequently elevated as Professor in 2006 and has been in that position ever since. Professor
Rama has 20 years of teaching and research experience, and has guided four research students in their PhD theses. Her
domain of interest is in the area of formal languages and automata, and natural computing. She is also a life member of
the Indian Society for Technical Education.

Elements of the Theory of Computation, 2/e

Harry Lewis
ISBN: 9789332549890 | © Year: 2015 | Pages: 480

About the Book

This is the long awaited Second Edition of Lewis and Papadimitriou’s best-selling
theory of computation text. In this substantially modified edition, the authors have
enhanced the clarity of their presentation by making the material more accessible to a
broader undergraduate audience with no special mathematical experience.

Features
• Offers a mathematically sound introduction to the • Introduces asymptotic analysis and O- notation.
classical and contemporary theory of computation, • Features a more “student-friendly” approach.
and provide deep insights into the fundamental • Truncates long proofs and presents them as exercises.
paradigms of computer science. • Provides problems after each section to check student
• Would you like a theory of computation text comprehension.
that provides a solid, specialized introduction to • Considers automata in the context of their
algorithms? applications.
• Informally introduces algorithms, complexity analysis, • Includes extensive discussion of state minimization,
and algorithmic ideas in Ch. 1 (in connection to the Myhill-Nerode Theorem, string matching, and
transitive and other closures), and explores them parsing.
throughout the book. • Complexity starts with a proof that P = EXP.

15

Untitled-1 15 05/04/2017 12:49:38

Automata Theory and Theory of Computer Science

• Many combinatorial problems are introduced and • Introduces the Turing machine notation more
analyzed (including variants of satisfiability), and their informally.
apparent complexity contrasted. • Uses the terms recursive and recursively innumerably.
• Would you like to teach NP—completeness, as well as • Quantitatively analyzes simulations between machine
ways of coping with it, in your course? models.
• Features a separate chapter on NP-completeness. • Introduces and analyzes a model of random access
• Extensive section on coping with NP - completeness Turing machines, similar to RAMs.
that covers special cases, approximation algorithms, • Offers a more succinct treatment of general grammars
backtracking, and local search heuristics. and …¿¿-recursive functions.
• Covers NP - completeness including state • Uses random access Turing machines to bridge the
minimization problem of nondeterministic finite “credibility gap” between Turing machine model and
automata. the empirical concept of an algorithm.
• Logic coverage has been limited to propositional logic • Includes some recursion theory (up to Rice’s theorem).
in relation to NP - completeness. • Provides an informal, concise development of
• Considers Cook’s Theorem again via the tiling A-recursive functions.
problem. • Explores Chomsky normal form and the resulting
• Discusses approximation and its complexity. dynamic programming algorithm.

Contents
1. Sets, Relations, and Languages 5. Undecidability
2. Finite Automata 6. Computational Complexity
3. Context-free Languages 7. NP-completeness
4. Turing Machines

Languages and Machines: An Introduction to

the Theory of Computer Science, 3/e
Thomas A. Sudkamp
ISBN: 9788131714751 | © Year: 2007 | Pages: 672

About the Book

The third edition of Languages and Machines: An Introduction to the Theory of
Computer Science provides readers with a mathematically sound presentation of the
theory of computer science at a level suitable for junior and senior level computer science
majors. The theoretical concepts and associated mathematics are made accessible by
a “learn as you go” approach that develops an intuitive understanding of the concepts
through numerous examples and illustrations. In this edition the presentation has been
enhanced by increasing the number of examples, expanding the selection of topics
particularly in the area of computational complexity, and providing a flexible format
giving instructors the ability to design their courses that concentrate on specific areas
such as automata theory, computability theory, or computational complexity.

Features
• Expansion coverage of computational complexity. • Increased coverage of space complexity including
• Over 100 new examples and exercises. Examples Savitch’s Theorem and P-space completeness.
of programming syntax are given using the BNF • Organized to provide flexibility to design courses that
description of the programming language Java. concentrate in specific areas such as automata theory,
• A new chapter following the definition of NP- computability theory, or computational complexity.
completenss and Cook’s Theorem presents strategies • Topics covered with greater emphasis include the
for demonstrating that a problem is NP-complete. use of diagonalization and self-reference in proofs by

16

Untitled-1 16 05/04/2017 12:49:42

 Automata Theory and Theory of Computer Science
contradiction, the application of regular expressions role of the problem representation in the assessment
in text searching using grep as an example, the of computational complexity, and the significance of
CYK parsing algorithm, the motivation for and problem reduction in decidability and undecidability.
interpretation of nondeterministic computation, the

Contents
I. Foundations IV. Computational Complexity
1. Mathematical Preliminaries 14. Time Complexity
2. Languages 15. P, NP, and Cook’s Theorem
II. Grammars, Automata, and Languages 16. NP-Complete Problems
3. Context-Free Grammars 17. Additional Complexity Classes
4. Normal Forms for Context-Free Grammars V. Deterministic Parsing
5. Finite Automata 18. Parsing: An Introduction
6. Properties of Regular Languages 19. LL(k) Grammars
7. Pushdown Automata and Context-Free Languages 20. LR(k) Grammars
III. Computability • Appendix I
8. Turing Machines • Appendix II
9. Turing Computable Functions • Appendix III
10. The Chomsky Hierarchy • Appendix IV
11. Decision Problems and the Church-Turing Thesis • Bibliography
12. Undecidability • Subject Index
13. Mu-Recursive Functions

Formal Languages and Automata Theory

K.V.N. Sunitha • N. Kalyani
ISBN: 9789332537286 | © Year: 2015 | Pages: 480

About the Book

Formal Languages and Automata Theory deals with the mathematical abstraction
model of computation and its relation to formal languages. This book is intended to
expose students to the theoretical development of computer science. It also provides
conceptual tools that practitioners use in computer engineering. An assortment of
problems illustrative of each method is solved in all possible ways for the benefit of
students. The book also presents challenging exercises designed to hone the analytical
skills of students.

Features
• Probes the concepts methodically with an extensive • Explores regular languages, covering the mechanisms
use of definitions, proofs, solved examples, exercises for representing languages, the closure properties of
and applications of the models. such languages, the existence of other languages and
• Includes a summary, additional (progressively other structural properties.
challenging) problems, multiple-choice and fill-in-the- • Includes frequently asked university questions.
blanks questions for each chapter.
• Examines the importance of Turing machines as
language recognizers, language generators and as
computing models.

17

Untitled-1 17 05/04/2017 12:49:48

Automata Theory and Theory of Computer Science

Contents
1. Mathematical Preliminaries and Formal Languages 7. Undecidability and Computability
2. Finite Automata 8. Non-deterministic Polynomial Completeness
3. Regular Languages and Regular Grammars 9. LR(k) and LL(1) Grammars
4. Context Free Grammars and Context Free Languages Appendix A: Proposition and Predicate Logic
5. Push Down Automata Appendix B: Frequently Asked University Questions
6. Turing Machines with Solutions

About the Authors

Dr K. V. N. Sunitha, Principal, BVRIT Hyderabad College of Engineering for Women, Nizampet, Hyderabad, obtained
her B.Tech in ECE from Nagarjuna University and M.Tech in Computer Science from REC Warangal. She is a JNTUH
ratified professor with 23 years of teaching experience. She received ‘;Academic Excellence Award’ from the management
of G. Narayanamma Institute of Technology & Science in 2005.
Dr N. Kalyani obtained B.Tech in Civil from Osmania University in 1994, M.Tech in Computer Science from JNTUH
in 2001 and Ph.D. from JNTUH in 2012. She has working experience of 5 years as Design Engineer in R. K. Engineers,
Hyderabad and 14 years of teaching for both UG and PG students.

Also Available

ISBN: 9788131760772 ISBN: 9788131708705 ISBN: 9788131788226

Pages: 376 Pages: 476 Pages: 1120

18

Untitled-1 18 05/04/2017 12:49:51

 Compiler Construction/Language Processors
Compilers: Principles, Techniques,
and Tool, 2/e
Alfred V. Aho • Monica S. Lam • Ravi Sethi • Jeffrey D. Ullman
ISBN: 9789332518667 | © Year: 2013 | Pages: 966

About the Book

Compilers: Principles, Techniques and Tools, known to professors, students, and
developers worldwide as the “Dragon Book,” is available in a new edition. Every
chapter has been completely revised to reflect developments in software engineering,
programming languages, and computer architecture that have occurred since 1986,
when the last edition published. The authors, recognizing that few readers will ever go
on to construct a compiler, retain their focus on the broader set of problems faced in
software design and software development.
Features
• Introduces the theory and practice of compiler design. • Covers topics like context-free grammars, fine state
machines, and syntax-directed translation.
Contents
1. Introduction 5. Syntax-Directed Translation 9. Machine-Independent
2. A Simple Syntax-Directed 6. Intermediate-Code Generation Optimizations
Translator 7. Run-Time Environments 10. Instruction-Level Parallelism
3. Lexical Analysis 8. Code Generation 11. Optimizing for Parallelism and
4. Syntax Analysis Locality
About the Authors
Alfred V. Aho is Lawrence Gussman Professor of Computer Science at Columbia University. Professor Aho has won
several awards including the Great Teacher Award for 2003 from the Society of Columbia Graduates and the IEEE John
von Neumann Medal. He is a member of the National Academy of Engineering and a fellow of the ACM and IEEE.
Monica S. Lam is a Professor of Computer Science at Stanford University, was the Chief Scientist at Tensilica and the
founding CEO of moka5. She led the SUIF project which produced one of the most popular research compilers, and
pioneered numerous compiler techniques used in industry.
Ravi Sethi launched the research organization in Avaya and is president of Avaya Labs. Previously, he was a senior vice
president at Bell Labs in Murray Hill and chief technical officer for communications software at Lucent Technologies. He
has held teaching positions at the Pennsylvania State University and the University of Arizona, and has taught at Princeton
University and Rutgers. He is a fellow of the ACM.
Jeffrey D. Ullman is CEO of Gradiance and a Stanford W. Ascherman Professor of Computer Science at Stanford
University. His research interests include database theory, database integration, data mining, and education using the
information infrastructure. He is a member of the National Academy of Engineering, a fellow of the ACM, and winner of
the Karlstrom Award and Knuth Prize.

19

Untitled-1 19 05/04/2017 12:49:55

Compiler Construction/Language Processors

Compiler Design in C
Allen I. Holub
ISBN: 9789332549500 | © Year: 2015 | Pages: 768

About the Book

This book is highly accessible to both computer science students and programmers.
The approach is similar to that taken by Tanenbaum for operating systems in the
C-language code that implements all algorithms.

Contents
1. Preface Appendix B: Notes on Pascal
2. Basic Concepts Compilers
3. Input and Lexical Analysis Appendix C: A Grammar for C
4. Context-Free Grammars Appendix D: LEX
5. Top-Down Parsing Appendix E: LLama and Occs
6. Bottom-Up Parsing Appendix F: A C-code Summary
7. Code Generation Bibliography
8. Optimization Strategies Cross Reference by Symbol
Appendix A: Support Functions

Also Available

ISBN: 9788131764916 ISBN: 9788131708132 ISBN: 9789332500297 ISBN: 9788131761267

Pages: 536 Pages: 832 Pages: 472 Pages: 184

20

Untitled-1 20 05/04/2017 12:49:59

Discrete Mathematics and Graph Theory

Discrete Mathematics
Babu Ram
ISBN: 9788131733103 | © Year: 2010 | Pages: 584

About the Book

Discrete Mathematics is an integral part of any undergraduate as well as post graduate
courses in Computer Science and Mathematics. The syllabi of all these courses have
been studied in depth and utmost care has been taken to ensure that all the essential
topics in discrete structures are adequately emphasized. The book will enable the
students to develop the requisite computational skills needed in software engineering.

Features
• C Programs of important algorithms . • 550 Solved examples and 170 practice problems with
• Extensive coverage of Boolean Algebra, Algebraic hints/answers.
Structures and Graph Theory.

Contents
1. Sets, Relations and Functions 7. Boolean Algebra
2. Counting 8. Graphs
3. Recurrence Relations 9. Finite State Automata
4. Logic 10. Languages and Grammars
5. Algebraic Structures Appendix on problems solved using ‘C’
6. Lattices

About the Author

Babu Ram received his Ph.D. degree in mathematics in 1973 from Kurukshetra University, Kurukshetra, India. He was
formerly Professor of Mathematics and Dean, Faculty of Physical Sciences at Maharshi Dayanand University, Rohtak
and has been teaching mathematics for the past 36 years. A member of Indian Mathematical Society and the American
Mathematical Society, Professor Babu Ram has published 42 research papers in Real and Functional Analysis in
international journals of repute. He is on the board of reviewers of both American Mathematical Reviews and Zentralblatt
fur Mathematik und ihre Grengebiete, Berlin. Presently, he is working as Director MCA at Manav Rachna International
University, Faridabad.

Introductory Combinatorics, 4/e

Richard A. Brualdi
ISBN: 9788131718827 | © Year: 2008 | Pages: 640

About the Book

This, the best selling book in its market, emphasizes combinatorial ideas including
the pigeon-hole principle, counting techniques, permutations and combinations, Pólya
counting, binomial coefficients, inclusion-exclusion principle, generating functions and
recurrence relations, and combinatortial structures (matchings, designs, graphs), flows
in networks.

21

Untitled-1 21 05/04/2017 12:50:05

Discrete Mathematics and Graph Theory

Features
• NEW - New problems in each chapter-Many more Theoremthat doesn’t assume students have seen group
challenging problem sets have been added. theory.
• Presents an excellent treatment of Polya’s Counting • Many worked examples.

Contents
1. What Is Combinatorics? 8. Special Counting Sequences
2. The Pigeonhole Principle 9. Matchings in Bipartite Graphs
3. Permutations and Combinations 10. Combinatorial Designs
4. Generating Permutations and Combinations 11. Introduction to Graph Theory
5. The Binomial Coefficients 12. Digraphs and Networks
6. The Inclusion-Exclusion Principle and Applications 13. More on Graph Theory
7. Recurrence Relations and Generating Functions 14. Polya Counting

Discrete and Combinatorial Mathematics:

An Applied Introduction, 5/e
Ralph P. Grimaldi • B. V. Ramana
ISBN: 9788177584240 | © Year: 2006 | Pages: 1056

About the Book

This fifth edition continues to improve on the features that have made it the market
leader. The text offers a flexible organization, enabling instructors to adapt the book
to their particular courses. The book is both complete and careful, and it continues
to maintain its emphasis on algorithms and applications. Excellent exercise sets
allow students to perfect skills as they practice. This new edition continues to feature
numerous computer science applications-making this the ideal text for preparing
students for advanced study.

Features
• Historical reviews and biographies bring a human • Expanded treatment of discrete probability in Chapter 3.
element to their assignments. • New material on cryptology, private-key
• Chapter summaries allow students to review what cryptosystems in Chapter 13, public-key RSA
they have learned. cryptosystems in Chapter 15.

Contents
1. Fundamental Principles of Counting 10. Recurrence Relations
2. Fundamentals of Logic 11. An introduction to graph theory
3. Set theory 12. Trees
4. Properties of the integers:Mathematical Induction 13. Rings and modular arithmetic
5. Relations and Functions 14. Boolean algebra and switching functions
6. Language:Finite State Machines 15. Algebraic
7. Relations:The Second Time Around structures,semigroups,monoids,groups,coding theory
8. The Principle of Inclusion and Exclusion and polya’s method of enumeration
9. Generating Functions 16. Finite fields and combinatorial designs

About the Authors

Ralph P. Grimaldi, Rose-Hulman Institute of Technology.
B.V. Ramana, Professor of Mathematics, JNTU College of Engineering, Kakinada, India & Professor of Mathematics,
Eritrean Institute of Technology, Eritrea (N. E. Africa) (0n Special duty).

22

Untitled-1 22 05/04/2017 12:50:12

 Discrete Mathematics and Graph Theory
Discrete Mathematics, 5/e
Kenneth A. Ross • Charles R. B. Wright
ISBN: 9788131790618 | © Year: 2012 | Pages: 635

About the Book

Revised for extra clarity, the distinguishing characteristic of Ross and Wright is a sound
mathematical treatment that increases smoothly in sophistication. The text presents
utility-grade discrete math tools so students can understand them, use them, and move
on to more advanced mathematical topics

Features
• NEW - Over 270 supplementary exercises—All with • NEW - Chapter on algebraic structures.
answers. • Comprehensive coverage of logic and proofs.
• NEW - Full chapter on discrete probability. • Full chapter on recursion.

Contents
1. Sets, Sequences, and Functions 8. Digraphs
2. Elementary Logic 9. Discrete Probability
3. Relations 10. Boolean Algebra
4. Induction and Recursion 11. More on Relations
5. Counting 12. Algebraic Structures
6. Introduction to Graphs and Trees 13. Predicate Calculus and Infinite Sets
7. Recursion, Trees and Algorithms

Introduction to Graph Theory, 4/e

Robin J. Wilson
ISBN: 9788131706985 | © Year: 2002 | Pages: 184

About the Book

Graph Theory has recently emerged as a subject in its own right, as well as being
an important mathematical tool in such diverse subjects as operational research,
chemistry, sociology, and genetics. This book provides a comprehensive introduction
to the subject.

Features
• Provides a basic foundation for the course. • Full solutions are provided for many of the exercises.
• Text has been completely revised. • Includes a chapter on matroid theory, which is used
• Includes full range of exercises of varying difficulty. to consolidate some of the material from earlier
• Incorporates new material on algorithms, tree- chapters.
searches, and graph-theoretical puzzles.

23

Untitled-1 23 05/04/2017 12:50:18

Discrete Mathematics and Graph Theory

Contents
1. Introduction 6. Coloring Graphs
2. Definitions and Examples 7. Digraphs
3. Paths and Cycles 8. Matching, Marriage and Menger’s Theorem
4. Trees 9. Matroids
5. Planarity

About the Author

Robin J. Wilson is Dean and Director of Studies in the Faculty of Mathematics and Computing at the Open University.

Also Available

ISBN: 9788131717288 ISBN: 9788131717943 ISBN: 9789332521391

Pages: 464 Pages: 332 Pages: 576

ISBN: 9788131791462 ISBN: 9788131714058

Pages: 496 Pages: 568

24

Untitled-1 24 05/04/2017 12:50:22

 ESSENCE SERIES
Essence Series

ISBN: 9788131756737 ISBN: 9788131756812 ISBN: 9788131756782 ISBN: 9788131756744

Pages: 228 Pages: 208 Pages: 248 Pages: 184

ISBN: 9788131756775 ISBN: 9788131756751 ISBN: 9788131756805 ISBN: 9788131756768

Pages: 208 Pages: 212 Pages: 256 Pages: 240

25

Untitled-1 25 05/04/2017 12:50:25

Error Control

Error Control Coding, 2/e

Shu Lin • Daniel J. Costello, Jr.
ISBN: 9788131734407 | © Year: 2010 | Pages: 1272

About the Book

A reorganized and comprehensive major revision of a classic textbook. This text
provides a bridge between introductory courses in digital communications and more
advanced courses in information theory. Completely updated to cover the latest
developments. It presents state-of-the-art error control techniques.

Features
• Mathematical background required is kept to a developments of coded modulation, trellises for codes,
minimum. soft-decision decoding algorithms, turbo coding for
• Fundamental ideas from modern algebra necessary to reliable data transmission and other areas.
understand algebraic coding techniques are covered in • New and revised problems-Most problems are direct
one chapter. applications of material covered in the text. Some
• Fundamentals and philosophy of the first edition more challenging problems are included for
remain unchanged. advanced students.
• Coverage of the fundamentals of coding and the • Hundreds of new and revised examples-And more
applications of codes to the design of real error control than 200 illustrations of code structures, encoding
systems. and decoding circuits and error performance of many
• Coverage of all developments in coding since the important codes and error control coding systems.
first edition was published-Contains the most recent

Contents
1. Coding for Reliable Digital Transmission and Storage 13. Sequential and Threshold Decoding of Convolutional
2. Introduction to Algebra Codes
3. Linear Block Codes 14. Trellis-Based Soft-Decision Algorithms for Linear
4. Important Linear Block Codes Block Codes
5. Cyclic Codes 15. Concatenated Coding, Code Decomposition ad
6. Binary BCH Codes Multistage Decoding
7. Nonbinary BCH Codes, Reed-Solomon Codes, and 16. Turbo Coding
Decoding Algorithms 17. Low Density Parity Check Codes
8. Majority-Logic Decodable Codes 18. Trellis Coded Modulation
9. Trellises for Linear Block Codes 19. Block Coded Modulation
10. Reliability-Based Soft-Decision Decoding Algorithms 20. Burst-Error-Correcting Codes
for Linear Block Codes 21. Automatic-Repeat-Request Strategies
11. Convolutional Codes
12. Trellis-Based Decoding Algorithms for Convolutional
Codes

26

Untitled-1 26 05/04/2017 12:50:30

 Bioinformatics
Introduction to Bioinformatics
T K Attwood • D J Parry-Smith • Samiron Phukan
ISBN: 9788177586411 | © Year: 2007 | Pages: 256

About the Book

Bioinformatics, the application of computers in the biological sciences, especially
analysis of biological sequence data, is becoming an essential tool in molecular biology
as genome projects generate vast quantities of data. With new sequences being added
to DNA databases on an average of once a minute, there is a pressing need to convert
this information into biochemical and biophysical knowledge by deciphering the
structural, functional and evolutionary clues encoded in the language of biological
sequences.

Features
• Unique guide to bioinformatics linked to an • The Web link integrates conventional and Web-
interactive practical on the World Wide Web. based publishing, allowing interactive exploration of
• Introduces key databases, tools and resources, and concepts discussed in the book.
outlines pitfalls of methods. • Includes numerous Further Reading suggestions,
Web references and a useful Glossary.
Contents
1. Overview 7. Pairwise alignment techniques
2. Introduction 8. Multiple sequence alignment
3. Information networks 9. Secondary database searching
4. Protein information resources 10. Building a sequence search protocol
5. Genome information resources 11. Analysis packages
6. DNA sequence analysis 12. Probability and statistics

About the Authors

Dr T. K. Attwood is a Royal Society University Research fellow and Senior Lecturer in the School of Biological Sciences,
University of Manchester, UK, Visiting Fellow at the European Bioinformatics Institute, and author and curator of the
PRINTS protein fingerprint database.
Dr D. J. Parry-Smith is Informatics Director at Cambridge Drug Discovery Limited, Cambridge, UK, and works mainly
with algorithm development.
Dr Samiron Phukan is Senior Scientist, SDMD Drug Discovery at Jubilant Biosys Limited, Bangalore, India.

27

Untitled-1 27 05/04/2017 12:50:35

Bioinformatics

Bioinformatics Computing
Brayan Bergeron, M.D.
ISBN: 9789332549418 | © Year: 2015 | Pages: 462

About the Book

The field of bioinformatics is growing at an unprecedented rate, as molecular biologists
discover the extraordinary range of computational techniques and applications that
apply directly to their work. Now, Harvard Medical School and MIT faculty member
Bryan Bergeron has written a comprehensive, practical guide to bioinformatics
for biology students at every level. Bergeron illuminates key advances in computer
visualization, large database design, advanced pattern matching, machine learning,
statistical methods, and distributed computing—and demonstrates exactly how these
advances can be used to advance research into biological systems. Bergeron also
identifies technologies and approaches on the near horizon that will have a significant
impact on bioinformatics, and introduces the key global and societal issues most likely
to shape bioinformatics in the coming years.
Features
• Comprehensive introduction to computing techniques designs, advanced pattern matching and other key
for Molecular Biologists. bioinformatics techniques.
• Bioinformatics is an IT growth sector ($10.4 Billion in • Bryan Bergeron is on the faculty at both Harvard
2000, forecasted to $38 Billion by 2006). Medical School and MIT.
• Chapters on computing visualization, large database

Contents
Preface 6. Statistics
1. The Central Dogma 7. Data Mining
2. Databases 8. Pattern Matching
3. Networks 9. Modeling and Simulation
4. Search Engines 10. Collaboration
5. Data Visualization

About the Author

Bryan Bergeron is a faculty member at both Harvard Medical School and MIT, Editor-in-Chief of e.MD, editorial board
member of Healthcare Informatics, and Fellow of the American College of Medical Informatics. He has authored more
than 300 publications on topics ranging from AI to computers in medicine.

Also Available

ISBN: 9788177587579
Pages: 328

28

Untitled-1 28 05/04/2017 12:50:40

 Advanced Computer Architecture
ARM System-on-Chip Architecture
Steve Furber
ISBN: 9789332555570 | © Year: 2016 | Pages: 432

About the Book

ARM System-on-Chip Architecture presents and discusses the major issues of system-
on-chip design, including memory hierarchy, caches, memory management, on-chip
buses, on-chip debug and production tests. It provides an overview of the ARM
processor family, enabling the reader to decide which ARM is best for the job in hand,
describes the ARM and Thumb programming models enabling the designer to begin
to develop applications. It also covers all the latest ARM products and developments,
including StrongARM, the ARM9 and ARM10 series of cores, and the ARM-based
SoC components at the heart of Ericsson’s Bluetooth technology, the Psion Series 5
PDA and Samsung’s SGH2400 GSM handset. It includes details on the AMULET
asynchronous ARM cores and the AMULET3H asynchronous SoC subsystem. ARM System-on-Chip Architecture is an
essential handbook for system-on-chip designers using ARM processor cores and engineers working with the ARM. It
can also be used as a course text for undergraduate and masters students of computer science, computer engineering and
electrical engineering.

Features
• ARM system-on-chip architecture. • Covers all the latest ARM products and
• Presents and discusses the major issues of system- developments, including StrongARM, the ARM9
on-chip design, including memory hierarchy, caches, and ARM10 series of cores, and the ARM-based
memory management, on-chip buses, on-chip debug SoC components at the heart of Ericssons Bluetooth
and production tests. technology, the Psion Series 5 PDA and Samsungs
• Provides an overview of the ARM processor family, SGH2400 GSM handset.
enabling the reader to decide which ARM is best for • Includes details on the AMULET asynchronous
the job in hand. ARM cores and the AMULET3H asynchronous SoC
• Describes the ARM and Thumb programming models, subsystem.
enabling the designer to begin to develop applications.

Contents
An Introduction to Processor Design
1. The ARM Architecture 8. ARM Processor Cores
2. ARM Assembly Language Programming 9. Memory Hierarchy
3. ARM Organization and Implementation 10. Architectural Support for Operating Systems.
4. The ARM Instruction Set 11. ARM CPU Cores
5. Architectural Support for High-Level Languages 12. Embedded ARM Applications
6. The Thumb Instruction Set 13. The AMULET Asynchronous ARM Processors
7. Architectural Support for System Development

29

Untitled-1 29 05/04/2017 12:50:46

Advanced Computer Architecture

Advanced Computer Architecture:

A Systems Design Approach
Richard Y. Kain
ISBN: 9789332551923 | © Year: 2015 | Pages: 907

About the Book

This is an advanced level text on computer architecture presenting a coherent
approach to computer system design and encompasses most of the design problems
and solution options_starting from the structures of contemporary programming
languages and operating systems, extending inward to the processor’s architecture and
its implementation. It provides basic techniques covering the relationships between
software and hardware levels of system implementation and operation.

Features
• Shows examples of historically important processor • Draws examples from contemporary microprocessors
designs. such as PowerPC601, SPARC-Version 9, MIPs, and
• Lists important concepts and design options at the end DEC’s Alpha AXP.
of each chapter. • Helps to understand the choices in designing a
• Many examples written in C++. complete computer system.

Contents
Preface 7. Single I-Stream Parallelism
1. Acknowledgments 8. Parallelism by Message Passing
2. Illusions 9. Shared-Resource Systems
3. Instruction Set Design 10. Protection and Security
4. Memory Organization 11. Appendixes
5. Single Stream Control 12. References
6. Object-Oriented Processing

Advanced Computer Architectures:

A Design Space Approach
Dezso Sima • Terence Fountain • Peter Kacsuk
ISBN: 9788131702086 | © Year: 2002 | Pages:792

About the Book

This timely book provides an unconventional and up-to-date overview of all the
important computer architectures and is one of the first texts to present all the relevant
concepts of advance architecture classes by exploring their design spaces. Advanced
Computer Architectures will prove an indispensable guide for anyone who needs to
be acquainted with the relevant concepts and solutions introduced in recent years to
the dramatically changing world of computer architecture. For the student of advance
level courses in computer architecture, this book will provide a comprehensive and
accessible overview of the subject whilst its strong orientation will make it an invaluable
reference for the practitioner.
Features
• Explores design spaces for each architecture class and
Exposes evolution of concepts and design issues.

30

Untitled-1 30 05/04/2017 12:50:55

 Advanced Computer Architecture
• Provides an up-to-date overview of significant illustrates significant trends and surpasses and viable
architecture classes, including unique in-depth concepts.
coverage of superscalar architectures as well as • Case Studies and tables show micro architectural
multithreaded, shared and distributed memory details of relevant processors, including the Pentium
MIMDs, and associative and neural architectures. Pro, Power PC 604, Power PC 620 and R10000,
• Identifies which concepts and design choices have allowing comparisons between them.
been made use of in important processors and

Contents
1. Computational Models 11. SIMD Architectures
2. The Concept of Computer Architecture 12. Introduction to MMID Architectures
3. Introduction to Parallel Processing 13. Data-Parallel Pipelined and Systolic Architectures
4. Introduction to ILP-Processors 14. Vector Architectures
5. Pipelined Processors 15. Introduction to MIMD Architectures
6. VLIW Architectures 16. Multi-threaded Architectures
7. Superscalar Processors 17. Distributed Memory MIMD Architectures
8. Processing of Control Transfer Instructions 18. Shared Memory MIMD Architectures
9. Code Scheduling for ILP-Processors 19. Outlook
10. Introduction to Data-Parallel Architectures

About the Authors

Professor Dezos Sima is Director of the Department of Informatics at the Kando Polytechnic in Budapest where he has
specialized in computer architecture since 1972. He has published two books and over thirty papers.
Terry Fountain is reader in Applied Physics at University College London. He has published four previous books on
computer architecture.
Prof Peter Kacsuk is Head of the Laboratory of Parallel and Distributed System at the MTA SZTAKI research institute of
the Hungarian Academy of Sciences.

Also Available

ISBN: 9788177584837
Pages: 744

31

Untitled-1 31 05/04/2017 12:50:58

Computer Organization and Architecture

Computer Systems:
A Programmer’s Perspective, 3/e
Randal E. Bryant • David R. O’Hallaron
ISBN: 9789332573901 | © Year: 2016 | Pages: 1120

About the Book

Computer systems: A Programmer’s Perspective explains the underlying elements
common among all computer systems and how they affect general application
performance. Written from the programmer’s perspective, this book strives to teach
students how understanding basic elements of computer systems and executing real
practice can lead them to create better programs.

Features
A carefully planned 12 chapter layout that covers all of of temporal locality and slopes of spatial locality.
the core topics of computer programming: Students learn that improving temporal and spatial
• uses a simple “hello world” program to introduce the locality improves performance.
major concepts and themes of computer programming. • discusses both static and dynamic linking, areas
• dives into the topic of computer arithmetic, considering included in most systems text where programmers
how numbers are represented in computer programs make their most confusing errors.
and how they affect value coding. The chapter places • explains exceptional control flow at all levels of the
a special emphasis on the properties of unsigned and system, from simple hardware interrupts to nonlocal
two’s-compliment number representations. It gives jumps in C that break the stack discipline. This
students necessary insight into arithmetic from the chapter introduces the fundamental idea of a process
programmers perspective and why it’s so important. by teaching students how it works and how it is
• teaches students how to read the x86-64 code created and manipulated from application programs.
generated by a C compiler, covering the basic • shows students key characteristics of the virtual
instruction patterns for different control constructs, memory system and how it works, addressing issues
implementation procedures, and the allocation of such as managing and manipulating. This chapter
different data structures. This chapter also discusses shows the benefits of covering the hardware and
the implementation of integer and floating point software aspects of computer systems in a unified way,
arithmetic and takes a machine-level view of programs which most books do not.
to understand certain code vulnerabilities. • covers the basic concepts of Unix I/O, such as files and
• introduces students to basic combinational and descriptors. It explains how files are shared, how I/O
sequential logic elements and shows how they can be redirection works, and how to access file metadata.
used in a simplified subset of the x86-64 instruction • discusses networks, I/O devices that tie together many
set called Y86-64. It starts with a single-cycle datapath of the ideas presented earlier in the text. It describes the
and moves onto a discussion of pipelining. client-server model that underlies all network applications
• gives students techniques for improving code and presents a programmer’s view of the internet.
performance with transformations that reduce work • uses internet design as an example that introduces
and enhance instruction-level parallelism. students to concurrent programming. By comparing
• covers different types of RAM and ROM memory and contrasting the three basic mechanisms for
systems, describing their hierarchical arrangement. writing concurrent programs (processes, I/O
The chapter makes the abstract concept tangible by multiplexing, and threads) students learn how to build
using the analogy of a “memory mountain” with ridges concurrent internet servers.
Contents
I. Program Structure and Execution 6. The Memory Hierarchy
1. A Tour of Computer Systems II. Running Programs on a System
2. Representing and Manipulating Information 7. Linking
3. Machine-Level Representation of Programs 8. Exceptional Control Flow
4. Processor Architecture 9. Virtual Memory
5. Optimizing Program Performance

32

Untitled-1 32 05/04/2017 12:51:26

 Computer Organization and Architecture
Computer Systems Organization and
Architecture
John D. Carpinelli
ISBN: 9788177587678 | © Year: 2002 | Pages: 608

About the Book

Computer Systems Organization and Architecture provides up-to-date coverage of
fundamental concepts for the design of computer and their subsystems. Professor John
Carpinelli presents material in this book in the same way he does in his classroom—by
using simple examples to help readers understand concepts without getting bogged
down in details. To make the material accessible to all readers, he has included
two examples of increasing complexity: the Very Simple CPU which contains four
instructions to illustrate very simple CPU design, and the somewhat more complex
Relatively Simple CPU that builds upon the same design techniques and introduces
some more advanced techniques.
Features
• Uses a finite state machine approach to provide a • Contains extensive examples of real-world
clear understanding of how the CPU performs a components and systems such as the Itanium
sequence of operations to fetch, decode, and execute microprocessor and cache and virtual memory
instructions. management in Windows computer, and commodity
• Covers completely the design of computer systems, used standards like the IEEE 754 Floating Point
including memory hierarchies, input/output Standard and the Universal Serial Bus Standard.
processing, interrupts and direct memory access, • Provides “Practical Perspective” sidebars to help
as well as advanced architectural aspects of parallel readers understand why systems are designed the way
processing. they are by applying them to real systems.
• Integrates open-ended design problems throughout • Includes access to a CPU Simulator which animates
the book to encourage readers to think through the the flow of data within the CPU to give readers
design process. unique insight into how the CPU works.
Contents
1. Digital logic fundamentals 7. Microsequencer control unit design
2. Introduction to finite state machines 8. Computer arithmetic
3. Instruction set architectures 9. Memory organization
4. Introduction to computer organization 10. Input/output organization
5. Register transfer languages 11. Advanced Topics
6. CPU design 12. Introduction to parallel processing
About the Author
John D. Carpinelli is an Associate Professor at New Jersey Institute of Technology, where he holds appointments in both
the Department of Electrical and Computer Engineering and the Department of Computer and Information Sciences.

33

Untitled-1 33 05/04/2017 12:51:41

Computer Organization and Architecture

Computer System Architecture, 3/e (Updated)

M. Morris Mano
ISBN: TBA | © Year: 2017 | Pages: 648

About the Book

Focused primarily on hardware design and organization — and the impact of software
on the architecture — this volume first covers the basic organization, design, and
programming of a simple digital computer, then explores the separate functional units
in detail.

Features
• Develops an elementary computer to demonstrate • Uses a simple register transfer language to specify
by example the organization and design of digital various computer operations.
computers.

Contents
1. Digital Logic Circuits 8. Central Progressing Unit (CPU)
2. Digital Components 9. Pipeline and Vector Processing
3. Data Representation 10. Computer Arithmetic
4. Register Transfer and Microoperations 11. Input-Output Organization
5. Basic Computer Organization and Design 12. Memory Organization
6. Programming the Basic Computer 13. Multiprocessors
7. Microprogrammed Control Index

Computer Organization and

Architecture, 10/e
William Stallings
ISBN: 9789332570405 | © Year: 2016 | Pages: 864

About the Book

With clear, concise, and easy-to-read material, the tenth edition of Computer
Organization and Architecture is a user-friendly source for students studying computers.
Subjects such as I/O functions and structures, RISC, and parallel processors have
been integrated with real-world examples throughout. Using brand new material and
strengthened pedagogy, this text ensures that students are effectively engaged in the
world of computer organization and architecture.

Features
• Chapter on GPUs (General Purpose Computing on • Embedded Systems and Microcontrollers overview
Graphics Processing Units), highlighting one of the has been greatly expanded and revised.
most important new developments in computer science. • Cloud Computing is newly discussed in the text.
• Heterogeneous Multicore Processors are surveyed in a • System Performance issues coverage has been revised,
new section of the text. expanded, and reorganized for a clearer and more

34

Untitled-1 34 05/04/2017 12:51:55

 Computer Organization and Architecture
thorough treatment throughout the text. PCRAM, and ReRAM are newly covered.
• Flash Memory coverage has been revised and • Intel Core Microarchitecture continues to be used
expanded with new information, including a new as a major example throughout with information
discussion of technology and organization of flash reflecting newer Intel systems such as Intel Core
memory for internal and external memory. Microarchitectur.
• Nonvolatile RAM technologies like STT-RAM,

Contents
I. Overview IV. The Central Processing Unit
1. Basic Concepts and Computer Evolution 12. Instruction Sets: Characteristics and Functions
2. Performance Issues 13. Instruction Sets: Addressing Modes and Formats
II. The Computer System 14. Processor Structure and Function
3. A Top-Level View of Computer Function and 15. Reduced Instruction Set Computers (RISCs)
Interconnection 16. Instruction-Level Parallelism and Superscalar
4. Cache Memory Processors
5. Internal Memory Technology V. Parallel Organization
6. External Memory 17. Parallel Processing
7. Input/Output 18. Multicore Computers
8. Operating System Support 19. General-Purpose Graphic Processing Units
III. Arithmetic And Logic VI. The Control Unit
9. Number Systems 20. Control Unit Operation
10. Computer Arithmetic 21. Microprogrammed Control
11. Digital Logic 15. Multiprocessors

Structured Computer Organization,6e

Andrew S. Tanenbaum • Todd Austin
ISBN: 9789332571242 | © Year: 2016 | Pages: 784

About the Book

Structured Computer Organization, specifically written for undergraduate students, is
a best-selling guide that provides an accessible introduction to computer hardware and
architecture. This text will also serve as a useful resource for all computer professionals
and engineers who need an overview or introduction to computer architecture.
This book takes a modern structured, layered approach to understanding computer
systems. It’s highly accessible - and it’s been thoroughly updated to reflect today’s
most critical new technologies and the latest developments in computer organization
and architecture. Tanenbaum’s renowned writing style and painstaking research make
this one of the most accessible and accurate books available, maintaining the author’s
popular method of presenting a computer as a series of layers, each one built upon the
ones below it, and understandable as a separate entity.

Features
• Comprehensive coverage of computer hardware and • Accessible to all students — Covers common devices
architecture basics — Uses a clear, approachable in a practical manner rather than with an abstract
writing style to introduce students to multilevel discussion of theory and concepts.
machines, CPU organization, gates and Boolean • Designed for undergraduate students — Not simply a
algebra, microarchitecture, ISA level, flow of controls, watered-down adaptation of a graduate-level text.
virtual memory, and assembly language.

35

Untitled-1 35 05/04/2017 12:52:11

Computer Organization and Architecture

Contents
1. Structured Computer Organization 6. Virtual Memory
2. Processors 7. Introduction to Assembly Language
3. Gates and Boolean Algebra 8. On-Chip Paralellism
4. An Example Microarchitecture 9. Suggestions for Further Reading
5. Overview of The Isa Level

About the Authors

Andrew S. Tanenbaum has a B.S. Degree from M.I.T. and a Ph.D. from the University of California at Berkeley. He is
currently a Professor of Computer Science at the Vrije Universiteit in Amsterdam, The Netherlands, where he heads the
Computer Systems Group. Until 2005, he was the Dean of the Advanced School for Computing and Imaging, an inter-
university graduate school doing research on advanced parallel, distributed, and imaging systems.
Todd Austinis a Professor of Electrical Engineering and Computer Science at the University of Michigan in Ann Arbor.
His research interests include computer architecture, reliable system design, hardware and software verification, and
performance analysis tools and techniques.

Also Available

ISBN: 9788131763476 ISBN: 9788131761557 ISBN: 9788131773390

Pages: 752 Pages: 576 Pages: 312

36

Untitled-1 36 05/04/2017 12:52:14

 System Simulation
Discrete-Event System Simulation, 5/e
Jerry Banks • John S. Carson, II • Barry L. Nelson
David M. Nicol
ISBN: 9789332518759 | © Year: 2013 | Pages: 530

About the Book

While most books on simulation focus on particular software tools, Discrete Event
System Simulation examines the principles of modeling and analysis that translate
to all such tools. This language-independent text explains the basic aspects of
the technology, including the proper collection and analysis of data, the use of
analytic techniques, verification and validation of models, and designing simulation
experiments. It offers an up-to-date treatment of simulation of manufacturing and
material handling systems, computer systems, and computer networks.

Features
• Simulation of Communications Systems includes new • Application topics promote understanding of real-
material on simulation beta distribution, negative world uses.
binomial distribution and non-stationary processes. • Interpretation of simulation software output explains
• Subset selection methods used for output analysis of how to use software tools correctly.
several alternatives are discussed. • Discussion of simple tools for complex input
• Numerous solved examples enhance understanding of modeling problems develops more realistic valid
concepts. models.
• Abundant figures, tables and end-chapter exercises are
provided.

Contents
I. Introduction to Discrete-Event System Simulation IV. Analysis of Simulation Data
1. Introduction to Simulation 9. Input Modeling
2. Simulation Examples 10. Verification and Validation of Simulation Models
3. General Principles 11. Output Analysis for a Single Model
4. Simulation Software 12. Comparison and Evaluation of Alternative
II. Mathematical and Statistical Models System Designs
5. Statistical Models in Simulation V. Applications
6. Queueing Models 13. Simulation of Manufacturing and Material-
III. Random Numbers Handling Systems
7. Random-Number Generation 14. Simulation of Computer Networks
8. Random-Variate Generation

About the Authors

Jerry Banks retired in 1999 as a professor in the School of Industrial and Systems Engineering, Georgia Institute of
Technology, after which he worked as senior simulation technology advisor for Brooks Automation; he is currently a
professor at Techno´ogico de Monterrey, M´exico.
John S. Carson II is an independent simulation consultant. He has over 30 years experience in simulation in a wide range
of application areas and has taught simulation and operations research at the Georgia Institute of Technology and the
University of Florida.
Barry L. Nelson is the Charles Deering McCormick Professor and Chair of the Department of Industrial Engineering and
Management Sciences at Northwestern University.
David M. Nicol is professor of electrical and computer engineering at the University of Illinois at Urbana-Champaign. He
is a long-time contributor in the field of parallel and distributed discrete-event simulations.

37

Untitled-1 37 05/04/2017 12:52:27

System Simulation

System Simulation, 2/e

Geoffrey Gordon
ISBN: 9789332550247 | © Year: 2015 | Pages: 336

About the Book

Besides providing an excellent coverage of fundamental concepts and applications,
the author uses simulation programming languages and covers also socio-economic
problems. He introduces students to topics and techniques of system simulation and
covers both continuous and discrete simulation. The book’s illustrative problems
come from a wide diversity of realistic situations in engineering, economics, business,
medicine, biology, and socio-economics. Basic concepts of statistics and probability
theory are reviewed in detail, and techniques for analyzing system simulation results
are presented.

Contents
1. System Models 8. Discrete System Simulation
2. System Studies 9. Introduction to GPSS
3. System Simulation 10. GPSS Examples
4. Continuous System Simulation 11. Introduction to SIMSCRIPT
5. System Dynamics 12. Management of Sets in SIMSCRIPT
6. Probability Concepts in Simulation 13. Simulation Programming Techniques
7. Arrival Patterns and Service Times 14. Analysis of Simulation Output

About the Author

Gordon Rogers was, until retirement, Professor of Engineering Thermodynamics at the University of Bristol, He is author,
with Y.R. Mayhew, of Engineering Thermodynamics Work and Heat Transfer, 4th edition. The late Henry Cohen, was
formerly University Lecturer and Director of Studies in Engineering at Queen’s College, Cambridge.

38

Untitled-1 38 05/04/2017 12:52:37

 Mobile Computing / Mobile Communication
Pervasive Computing
Jochen Burkhardt • Horst Henn • Stefan Hepper
Klaus Rindtorff • Thomas Schaeck
ISBN: 9788177582802 | © Year:2004 | Pages: 432

About the Book

This book offers a complete introduction to pervasive computing, also known as
mobile computing, ubiquitous computing and anywhere/anywhen computing. The
book features case studies of applications and gives a broad overview of pervasive
computing (devices, standards, protocols,architectures). The book also covers and
includes analysis and categorisation of existing technologies and solid information to
help integrate pervasive computing applications into existing e-business applications.

Features
• Introduction to pervasive devices and their • Server-side programming in Java.
applications. • Pervasive web application architecture.
• Overview of the key technologies and protocols. • Device-independent example application.
• Web application concepts. • Accessing the example application via PC, PDA,
• WAP and beyond. WAP and voice.
• Voice Technology.

Contents
I. Technologies II. Architectures
1. Past, Present, Future 8. Server-side Programming in Java
2. Application Examples 9. Pervasive Web Application Architecture
3. Device Technology 10. Example Application
4. Web Application Concepts 11. Access from PCs
5. WAP and Beyond 12. Access via WAP
6. Voice Technology 13. Access from Personal Digital Assistants
7. Personal Digital Assistants 14. Access via voice 379

About the Authors

Jochen Burkhardt works in the IBM Pervasive Computing Division and has been involved in several projects in this area
since the beginning of the mobile internet and pervasive computing revolution.
Dr. Horst Henn works in the IBM Pervasive Computing Division and has been involved in several projects in this area
since the beginning of the mobile internet and pervasive computing revolution.
Stefan Hepper works in the IBM Pervasive Computing Division and has been involved in several projects in this area since
the beginning of the mobile internet and pervasive computing revolution.
Klaus Rindtorff works in the IBM Pervasive Computing Division and has been involved in several projects in this area
since the beginning of the mobile internet and pervasive computing revolution.
Thomas Schack works in the IBM Pervasive Computing Division and has been involved in several projects in this area
since the beginning of the mobile internet and pervasive computing revolution.

39

Untitled-1 39 05/04/2017 12:52:49

Mobile Computing / Mobile Communication

Mobile Computing: Theory and Practice

Kumkum Garg
ISBN: 9788131731666 | © Year: 2010 | Pages: 232

About the Book

An undergraduate text on mobile computing, covering all the basic concepts of
mobile computing as well as mobile communication. The book also deals with the
new concepts that have emerged in recent years like Bluetooth Security and topics on
Nokia Handhelds (a topic exclusive to this book).

Features
• Case-Studies on topics like Coda File System, Mica • An appendix on Java and Network Programming for
Mote and Tiny OS present in the book. mobile applications is provided.
• Topics like Bluetooth Security, WAP, Wireless Sensor • Excellent pedagogy – Subjective and Objective Type
Networks discussed. questions.

Contents
1. Introduction to Mobility 7. Wireless Sensor Networks
2. Wireless and Cellular communication 8. Mobile Handheld devices
3. Wireless Networks 9. The mobile Internet and Wireless web
4. Logical mobility I – Migrating Processes 10. Logical mobility II - Mobile Agents
5. Physical mobility 11. Security Issues in Mobile Computing
6. Mobile Adhoc Networks 12. Design and Programming Projects

About the Author

Prof. Kumkum Garg is Professor of Computing at IIT Roorkee. She obtained her M.Tech. in CSE from the University
of Roorkee (now IIT Roorkee), and Ph.D. from Imperial College, London. She was awarded the Apple Distinguished
Educator (ADE) award in 2006, for ‘commitment to the promise of educational technology in the classroom and beyond’.
Dr Garg is a Senior Member of IEEE, Fellow of the Institution of Engineers (I) and Life Member of various professional
societies, including the ISTE, SMATAC and ISCEE. She has over 38 years experience in teaching and research.

Principles and Applications of GSM

Vijay K. Garg • Joseph E. Wilkes
ISBN: 9788177588798 | © Year: 2002 | Pages: 504

About the Book

The book presents fundamental concepts providing a foundation for understanding the
technical aspects of speech and channel coding, modulation, propagation, and other
items which are used for GSM and common with its derivative. It provides sufficient
details so that the reader can understand the related wireless standards. Also, it allows
the reader to apply the concepts to practical wireless systems.

40

Untitled-1 40 05/04/2017 12:53:03

 Mobile Computing / Mobile Communication
Features
• The complete guide to designing wireless systems with • Planning, design, traffic engineering and network
GSM -- the hottest mobile technology on Earth. management.
• Soup to nuts coverage: GSM architecture, interfaces, • Wireless data, low mobility adjuncts, and future GSM
radio links, logical channels, coding, and much more. enhancements.

Contents
1. An Overview of Wireless Communications Systems 11. Privacy and Security in GSM
2. Standards for Wireless Communications Systems 12. Modulation and Demodulation
3. Access Technologies 13. Propagation Path Loss and Propagation Models
4. Cellular Communications Fundamentals 14. Planning and Design of a GSM Wireless Network
5. GSM Architecture and Interfaces 15. Management of GSM Networks
6. Radio Link Features in GSM Systems 16. Low-Mobility Adjunct to GSM
7. GSM Logical Channels and Frame Structure 17. An Overview of Signaling System
8. Speech Coding in GSM 18. Telecommunication Traffic Engineering
9. Messages, Services, and Call Flows in GSM 19. Comparison of TDMA Systems for Cellular/PCS
10. Data Services in GSM 20. Future Wireless Services

About the Authors

Vijay K. Garg is a Distinguished Member of Technical Staff at Lucent Technologies (formerly AT&T Bell Laboratories).
His responsibilities include design of GSM-based systems, evaluation of the performance. and capacity of mobile switching
centers, and specification of operations system requirements for wireless networks.
Joseph E. Wilkes was on the team that designed the world’s first cellular system, and is principal author of the original EIA
compatibility specification for cellular telephones. He is currently a Senior Research Scientist at Bellcore.

Mobile Communications, 2/e

Jochen Schiller
ISBN: 9788131724262 | © Year: 2008 | Pages: 512

About the Book

Mobile Communications introduces the topic by providing a thorough grounding in
the field of mobile communications. A wide range of examples is combined with a
strong pedagogy to allow the book’s use in high level courses and for self-study. This
book provides a non-mathematical, computer science focus.

Features
• Contains over 150 questions, over 250 illustrations, • Conclude chapters with a set of exercises for self-
and a comprehensive glossary. study and references to standards, organizations, and
• Explains the most current developments in mobile research work related to the topic.
communications in both research and industry in a well- • Provides an up-to-date idea of the mobile/wireless
structured context with detailed technical background. communications field.
• Significant changes to be on top of this fast-
developing topic.

41

Untitled-1 41 05/04/2017 12:53:10

Mobile Computing / Mobile Communication

Contents
1. Introduction 7. Wireless LAN
2. Wireless transmission 8. Mobile network layer
3. Medium access control 9. Mobile transport layer
4. Telecommunications systems 10. Support for mobility
5. Satellite systems 11. Outlook
6. Broadcast systems

About the Author

Jochen H. Schiller received his Masters and PhD degrees in computer science from the University of Karlsruhe, Germany,
in 1993 and 1996, respectively. In 1996 -1997 he was a DFG postdoctoral research fellow at the Department of Computer
Systems, Uppsala University, Sweden.

42

Untitled-1 42 05/04/2017 12:53:12

 Genetic Algorithms/Soft Computing
Genetic Algorithms in search, Optimization
and Machine Learning
David E. Goldberg
ISBN: 9788177588293 | © Year: 2006 | Pages: 432

About the Book

The text introduces the theory, operation, and application of genetic algorithms—
search algorithms based on the mechanics of natural selection and genetics. This book,
suitable for both course work and self-study, brings together for the first time, in an
informal, tutorial fashion, the computer techniques, mathematical tools, and research
results that will enable both students and practitioners to apply genetic algorithms
to problems in many fields: programmers, scientists, engineers, mathematicians,
statisticians and management scientists will all find interesting possibilities here. Major
concepts are illustrated with running examples, and Pascal computer programs illustrate
major algorithms. Chapter concludes with exercises and computer assignments. No
prior knowledge of Gas or genetics is assumed.

Contents
1. A Gentle Introduction to Genetic Algorithms 5. Advanced Operators and Techniques in Genetic
2. Genetic Algorithms Revisited: Mathematical Search
Foundations 6. Introduction to Genetics-Based Machine Learning
3. Computer Implementation of a Genetic Algorithm 7. Applications of Genetics-Based Machine Learning
4. Some Applications of Genetic Algorithms 8. A Look Back, A Glance Ahead

About the Author

David E. Goldberg is presently Associate Professor of Engineering Mechanics at the University of Alabama. He received his
Ph.D. from the University of Michigan. As a graduate student at the University of Michigan, he spearheaded a successful
project applying genetic algorithms and classifier systems to the control of natural gas pipelines. He has continued his
research in genetic algorithms and classifier systems, and has had 12 years of consulting experience in industry and
government and has published numerous articles and papers.

Neuro-Fuzzy & Soft Computing:

A Computational Approach to
Learning and Machine Intelligence
J.-S. R. Jang • C.-T. Sun • E. Mizutani
ISBN: 9789332549883 | © Year: 2015 | Pages: 614

About the Book

This text provides the first comprehensive treatment of the methodologies underlying
neuro-fuzzy and soft computing, an evolving branch within the scope of computational
intelligence. The book places equal emphasis on theoretical aspects of covered
methodologies, empirical observations and verifications of various applications in
practice.

Features
• The book is oriented toward methodologies that examples are included to complement explanations in
are likely to be of practical use; many step-by-step the text. Pg.___.

43

Untitled-1 43 05/04/2017 12:53:21

Genetic Algorithms/Soft Computing

• Specially designed figures provide a visual suitable term projects. This will provide the student
reinforcement for as many ideas and concepts as with hands-on programming experiences for practical
possible. These figures were generated using MATLAB problem-solving. Pg.___.
and these MATLAB files are available via FTP or • Each chapter includes a reference list to the research
WWW. Pg.___. literature. This will enable students to pursue
• Includes exercises, some of which involve MATLAB individual topics in greater depth. Pg._.
programming tasks which can be expanded into

Contents
1. Introduction to Neuro-Fuzzy and Soft Computing 13. Coactive Neuro-Fuzzy Modeling: Towards
I. Fuzzy Set Theory Generalized ANFIS
2. Fuzzy Sets V. Advanced Neuro-Fuzzy Modeling
3. Fuzzy Rules and Fuzzy Reasoning 14. Classification and Regression Trees
4. Fuzzy Inference Systems 15. Data Clustering Algorithms
II. Regression And Optimization 16. Rulebase Structure Identification
5. Least-Squares Methods for System Identification VI. Neuro-Fuzzy Control
6. Derivative-Based Optimization 17. Neuro-Fuzzy Control I
7. Derivative-Free Optimization 18. Neuro-Fuzzy Control II
III. Neural Networks VII. Advanced Applications
8. Adaptive Networks 19. ANFIS Applications
9. Supervised Learning Neural Networks 20. Fuzzy-Filtered Neural Networks
10. Learning from Reinforcement 21. Fuzzy Theory and Genetic Algorithms in Game
11. Unsupervised Learning and Other Neural Networks Playing
IV. Neuro-Fuzzy Modeling 22. Soft Computing for Color Recipe Prediction
12. ANFIS: Adaptive-Networks-based Fuzzy
Inference Systems

Soft Computing and Intelligent Systems

Design: Theory, Tools and Applications
Fakhreddine O. Karray • Clarence De Silva
ISBN: 9788131723241 | © Year: 2009 | Pages: 584

About the Book

Traditional artificial intelligence (AI) techniques are based around mathematical
techniques of symbolic logic, with programming in languages such as Prolog and LISP
invented in the 1960s. These are referred to as “crisp” techniques by the soft computing
community. The new wave of AI methods seeks inspiration from the world of biology,
and is being used to create numerous real-world intelligent systems with the aid of soft
computing tools. These new methods are being increasingly taught at the upper end
of the curriculum, sometimes as an adjunct to traditional AI courses, and sometimes
as a replacement for them. Where a more radical approach is taken and the course is being taught at an introductory
level, we have recently published Negnevitsky’s book. Karray and Silva will be suitable for the majority of courses which
will be found at an advanced level. Karray and de Silva cover the problem of control and intelligent systems design
using soft-computing techniques in an integrated manner. They present both theory and applications, including industrial
applications, and the book contains numerous worked examples, problems and case studies. Covering the state-of-the-art
in soft-computing techniques, the book gives the reader sufficient knowledge to tackle a wide range of complex systems
for which traditional techniques are inadequate.

44

Untitled-1 44 05/04/2017 12:53:27

 Genetic Algorithms/Soft Computing
Features
• Integrates theory and practice through the use of • Extensive coverage of control applications.
numerous worked examples. • Extensive student and lecturer support available via
• Includes case studies in different areas where soft- the Web (including Matlab files).
computing techniques are applied in real-world
situations.

Contents
I. Fuzzy Logic and Fuzzy Control 6. Dynamic neural networks and their applications
1. Introduction to intelligent systems and soft to control and chaos prediction
computing 7. Neuro-fuzzy systems
2. Fundamentals of fuzzy logic systems III. Evolutionary and Soft Computing
3. Fuzzy logic control 8. Evolutionary computing
II. Connectionist Modeling and Neural Networks IV. Applications and Case Studies
4. Fundamentals of artificial neural networks 9. Soft computing for smart machine design
5. Major classes of neural networks 10. Tools of soft computing in real-world applications

About the Authors

Fakhreddine O. Karray is Professor of Electrical and Computer Engineering and Systems Design Engineering at the
University of Waterloo, Canada. He was Program Chair of the 2002 IEEE International Symposium on Intelligent Control,
is Associate Editor of four related journals and writes extensively in the area.
Clarence De Silva is Professor of Mechanical Engineering at the University of British Columbia, Vancouver, Canada. He
is Editor-in-Chief of the International Journal of Control and Intelligent Systems, writes extensively in the area and has
served as a consultant for IBM and Westinghouse in the US.

A Beginner’s Approach to Soft Computing

Samir Roy • Udit Chakraborty
ISBN: 9788131792469 | © Year: 2013 | Pages: 608

About the Book

Soft computing is a branch of computer science that deals with a family of methods
that imitate human intelligence. This is done with the goal of creating tools that will
contain some human-like capabilities (such as learning, reasoning and decision-
making). This book covers the entire gamut of soft computing, including fuzzy logic,
rough sets, artificial neural networks, and various evolutionary algorithms. It offers a
learner-centric approach where each new concept is introduced with carefully designed
examples/instances to train the mindset of the learner.

Features
• Excellent pedagogy. • MATLAB implementation.
• 145 unsolved and 112 solved questions. • Summary at the end of every chapter.
• More than 500 figures. • Detailed case studies are included to help the students
• MCQs at the end of every chapter; more than 500 get a practical perspective of the subject.
MCQs in total.

Contents
1. Introduction to Soft Computing 4. Fuzzy Inference Systems
2. Fuzzy Set Theory 5. Rough Sets
3. Fuzzy Logic 6. Artificial Neural Networks

45

Untitled-1 45 05/04/2017 12:53:33

Genetic Algorithms/Soft Computing

7. Pattern Classification with ANN’s 11. Elementary Search Techniques

8. Pattern Classification with ANN’s 12. Evolutionary Search Techniques
9. Competitive Neural Nets 13. Hybrid Systems
10. Backpropagation

About the Authors

Samir Roy teaches at the Department of Computer Science & Engineering, National Institute of Technical Teachers’
Training and Research (NITTTR), Kolkata, an autonomous institution under the Ministry of HRD, Government of India.
He has taught different subjects of computer science for about twenty years at the undergraduate and postgraduate levels
in various engineering colleges and training institutes. He has published about forty articles in international and national
journals and conference proceedings. His areas of interest include artificial intelligence, soft computing, mathematical logic
and educational informatics.
Udit Chakraborty is currently working with the Sikkim Manipal Institute of Technology as Associate Professor in the
Department of Computer Science & Engineering. He has about ten years of teaching experience. His areas of interest
include soft computing, natural language processing and algorithms. He has several research papers published in national
and international conferences.

Also Available

ISBN: 9788177585742
Pages: 352

46

Untitled-1 46 05/04/2017 12:53:36

 Data Warehousing and Data Mining
Data Mining
Pieter Adriaans • Dolf Zantinge
ISBN: 9788131707173 | ©Year: 2002 | Pages: 168

About the Book

Data Mining deals with discovering hidden data and unexpected patterns and rules in
large databases. It can bring significant gains to organizations, for example, through
better-targeted marketing and enhanced internal performance. This is the first book
to offer a comprehensive introduction to data mining. Its aim is to provide essential
insights and guidelines to help you make the right decisions when setting up a data
mining environment.
The whole data mining process, including data selection, cleaning, coding, different
pattern recognition techniques and reporting is illustrated by means of an extensive
case study and numerous examples.

Features
• What is Data mining? • How do I set up a data mining environment?
• Which techniques are suitable for my data? • How do I justify the costs?

Contents
1. Introduction 5. Setting Up a KDD Environment
2. What is Learning? 6. Some Real - life Applications
3. Data Mining and the Data Warehouse 7. Some Formal Aspects of Learning Algorithms
4. The Knowledge Discovery Process

About the Authors

Pieter Adriaans is a director of Syllogic, where he is responsible for the development of tools for the management of
client/server systems and databases.
Dolf Zantinge has broad experience in setting up large client/server projects. He is also a director of Syllogi.

Data Warehousing in the Real World:

A Practical Guide for Building Decision Support
Systems
Sam Anahory • Dennis Murray
ISBN: 9788131704592 | © Year: 2002 | Pages: 368

About the Book

Data warehouses are the primary means by which businesses can gain competitive
advantage through analyzing and using the information stored in their computerized
systems. Data Warehousing in the Real World provides comprehensive guidelines
and techniques for the delivery of decision support solutions using open-systems data
warehouses. Written by practitioners for practitioners, this book describes each stage
of the implementation process in detail.

Features
• Learn the fundamentals of designing large-scale data • Take advantage of product-independent
warehouses using relational technology. comprehensive guidelines which cover all the issues

47

Untitled-1 47 05/04/2017 12:53:43

Data Warehousing and Data Mining

you need to take into account when planning and • Apply to your own situation the examples of real-life
building a data warehouse. solutions taken from a variety of different business
• Benefit from the authors’ experience distilled into sectors.
helpful hints and tips. • Make use of the templates for project-plans, system
architectures and database designs.
Contents
Part I: Introduction Part IV: Hardware and Operational Design
1. Introduction 12. Hardware Architecture
2. Delivery Process 13. Physical Layout
Part II: Data Warehouse Architecture 14. Security
3. System Process 15. Backup and Recovery
4. Process Architecture 16. Service Level Agreement
17. Operating the Data Warehouse
Part III: Design
5. Database Schemes Part V: Capacity Planning, Tuning and Testing
6. Partitioning Strategy 18. Capacity Planning
7. Aggregations 19. Tuning the Data Warehouse
8. Data Marting 20. Testing the Data Warehouse
9. Metadata Part VI: Futures
10. System and Data Warehouse 21. Data Warehouse Futures
11. Process Managers

About the Authors

Sam Anahory is Director of Systems Integration at SHL Systemhouse, an MCI Company, where he runs their Data
Warehousing practice, delivering end-to-end data warehousing business solutions to clients.
Dennis Murray is the Principal Consultant responsible for Large Scalable Solutions in Oracle Corporation’s Europe,
Middle East and Africa advanced technologies group.

Data Mining: Introductory and Advanced

Topics
Margaret H. Dunham
ISBN: 9788177587852 | © Year: 2006 | Pages: 328

About the Book

Market: For undergraduate courses in Computer Science and Information Technology /
MCA. In this book the author provides the reader with a comprehensive coverage of
data mining topics and algorithms. Data base perspective is maintained throughout the
book which provides students with a focused discussion of algorithms, data structures,
data types and complexity of algorithms and space. It also emphasizes the use of data
mining concepts in real-world applications with large database components.

Features
• Covers advanced topics such as Web Mining and • Offers clearly written algorithms to better understand
Spatial/Temporal Mining. techniques.
• Includes succinct coverage of Data Warehousing, • Algorithms are presented in a pseudocode.
OLAP, Multidimensional Data, and Preprocessing. • Includes a reference on how to use Prototypes and
• Concise coverage on distributed, parallel, and DM products.
incremental algorithms.
• Provides case studies.

48

Untitled-1 48 05/04/2017 12:53:51

 Data Warehousing and Data Mining
Contents
I. Introduction 5. Clustering
1. Introduction 6. Association Rules
2. Related Concepts III. Advanced Topics
3. Data Mining Techniques 7. Web Mining
II. Core Topics 8. Spatial Mining
4. Classification 9. Temporal Mining
About the Authors
Margaret H. Dunham received the B.A. and the M.S. in mathematics from Miami University in Oxford, Ohio. She earned
the Ph.D. degree in computer science from Southern Methodist University. Professor Dunham’s research interests encompass
main memory databases, data mining, temporal databases, and mobile computing. She is currently an Associate Editor for
IEEE Transactions on Knowledge and Data Engineering. She has published numerous technical papers in such research areas
as database concurrency control and recovery, database machines, main memory databases, and mobile computing.
S. Sridhar is currently the director of Arunai Engineering College, Tiruvannamalai, Tamil Nadu, India.

Introduction to Data Mining

Vipin Kumar • Pang-Ning Tan • Michael Steinbach
ISBN: 9789332571402 | © Year: 2016 | Pages: 780

About the Book

Introduction to Data Mining presents fundamental concepts and algorithms for those
learning data mining for the first time. Each concept is explored thoroughly and
supported with numerous examples.
Each major topic is organized into two chapters, beginning with basic concepts
that provide necessary background for understanding each data mining technique,
followed by more advanced concepts and algorithms.

Features
• Provides both theoretical and practical coverage of all • Assumes only a modest statistics or mathematics
data mining topics. background without any requirement of database
• Includes extensive number of integrated examples knowledge.
and figures. • Important topics such as predictive modeling,
• Offers instructor resources including solutions for association analysis, clustering, anomaly detection,
exercises and complete set of lecture slides. visualization covered.
Contents
1. Introduction 6. Association Analysis: Basic Concepts and Algorithms
2. Data 7. Association Analysis: Advanced Concepts
3. Exploring Data 8. Cluster Analysis: Basic Concepts and Algorithms
4. Classification: Basic Concepts, Decision Trees, and 9. Cluster Analysis: Additional Issues and Algorithms
Model Evaluation 10. Anomaly Detection
5. Classification: Alternative Techniques
About the Authors
Pang-Ning Tan, Michigan State University
Michael Steinbach, University of Minnesota
Vipin Kumar, University of Minnesota

49

Untitled-1 49 05/04/2017 12:53:57

Data Warehousing and Data Mining

Also Available

ISBN: 9788131773406 ISBN: 9788131708767 ISBN: 9788131715123

Pages: 272 Pages: 288 Pages: 404

50

Untitled-1 50 05/04/2017 12:53:58

 Database Systems
Database Systems: A Practical Approach to
Design, Implementation and Management, 4/e
Thomas Connolly • Carolyn Begg
ISBN: 9788131720257 | © Year: 2008 | Pages: 140

About the Book

This book places a strong emphasis on good design practice, allowing students to
master design methodology in an accessible, step-by-step fashion. A clear introduction
to design implementation and management issues, as well as an extensive treatment of
database languages and standards, make this book an indispensable complete reference
for database students and professionals. The book is designed to be used in database
courses for technical and non-technical students.

Features
• Uses UML notation for ER diagrams. • Comprehensive introduction to data warehousing,
• Database design methodology is explicitly divided OLAP, and data mining.
into three phases: conceptual, logical, and physical. • Extensive treatment of the Web as an emerging
Each phase is described in a separate chapter with an platform for database applications with many code
example of the methodology working in practice. samples for accessing databases from the Web
• Extensive treatment of SQL in three tutorial style including JDBC, SQLJ, ASP, ISP, and Oracle’s PSP.
chapters.

Contents
I. Background V. Selected Database Issues
1. Introduction to Databases 19. Security
2. Database Environment 20. Transaction management
II. The Relational Model And Languages 21. Query processing
3. The relational model 22. Programming SQL
4. Relational algebra and relational calculus VI. Distributed DBMSs and Replication
5. SQL: data manipulation 23. Distributed DBMSs - concepts and design
6. SQL: data definition 24. Distributed DBMSs - advanced concepts
7. Query-By-Example (QBE) 25. Replication and mobile databases
8. Commercial DBMSs: Access and Oracle VII. Object DBMSs
III. Database Analysis And Design Techniques 26. Introduction to Object DBMSs
9. Database planning, design and administration 27. Object-oriented DBMSs - concepts and design
10. Fact-finding techniques 28. Object-oriented DBMSs - standards and languages
11. Entity-relationship modeling 29. Object-relational DBMSs
12. Enhanced entity-relationship modeling VIII. Web and DBMSs
13. Normalization 30. Web technology and DBMSs
14. Advanced normalization. 31. emistructured data and XML
IV. Methodology IX. Business Intelligence (or Decision Support)
15. Methodology - conceptual database design 32. Data warehousing concepts
16. Methodology - logical database design for 33. Data warehousing design
relational model 34. OLAP
17. Methodology - physical database design for 35. Data mining
relational databases Appendices
18. Methodology - monitoring and tuning the
operational system

51

Untitled-1 51 05/04/2017 12:54:10

Database Systems

About the Book

Thomas Connolly is the head of the Computing and Information Systems division at the University of Paisley.
Carolyn Begg is a lecturer at the University of Paisley, with research interests in Information Systems, Database Management
Systems, and Decision Support Systems within medicine.

An Introduction to Database Systems, 8/e

C. J. Date • A. Kannan • S. Swamynathan
ISBN: 9788177585568 | © Year: 2006 | Pages: 968

About the Book

An introduction to database systems provides a comprehensive introduction to the
very large field of database systems. It furnishes a solid grounding in the foundations of
database technology, while shedding some light on how the field is likely to develop in
the future. This edition has been expanded and rewritten to stay current with database
system trends and developments, however the overall emphasis remains on insight and
understanding, and not just on formalisms.

Features
• SQL coverage has been upgraded to the level of • Chapter 20 on Type Inheritance and chapter 23 on
current standard. Temporal Databases have been completely rewritten
• Provides exceptionally strong and expanded coverage to reflect latest research developments.M
of the relational model. • Chapter 27 on XML covers the relationship between
• Material on types or domains has been expanded for databases and emerging XML standards.
wider coverage. • The appendices include An overview of the
• Chapter 9 on Integrity has been completely rewritten TransRelational Model, A BNF grammar for
for better understanding. SQL expressions, A glossary of important
• Chapter 15 on Recovery and Chapter 16 on abbreviations,acronyms and symbols used in the text
Concurrency provides extensive details. and Storage Structures and Access Methods.
• Includes careful analysis of some unorthodox
transactions.

Contents
I. Preliminaries III. Database Design
1. An Overview of Database Management 11. Functional Dependencies
2. Database System Architecture 12. Further Normalization I: 1NF, 2NF, 3NF, BCNF
3. An Introduction to Relational Databases 13. Further Normalization II: Higher Normal Forms
4. An Introduction to SQL 14. Semantic Modeling
II. The Relational Model IV. Transaction Management
5. Types 15. Recovery
6. Relations 16. Concurrency
7. Relational Algebra V. Further Topics
8. Relational Calculus 17. Security
9. Integrity 18. Optimization
10. Views 19. Missing Information

52

Untitled-1 52 05/04/2017 12:54:22

 Database Systems
20. Type Inheritance 27. The World Wide Web and XML
21. Distributed Databases Appendix A. The TransRelationTM Model
22. Decision Support Appendix B. SQL Expressions
23. Temporal Databases Appendix C. Abbreviations, Acronyms, and
24. Logic Based Databases Symbols
VI. Objects, Relations, and XML Appendix D. Storage Structures and Access
25. Object Databases Methods
26. Object/Relational Databases Index

Fundamentals of Database Systems:

Models, Languages, Design and Application
Programming, 7/e
Ramez Elmasri • Shamkant B. Navathe
ISBN: TBA | © Year: 2017 | Pages: 1240

About the Book

This book introduces the fundamental concepts necessary for designing, using, and
implementing database systems and database applications. Our presentation stresses
the fundamentals of database modeling and design, the languages and models
provided by the database management systems, and database system implementation
techniques.
The goal is to provide an in-depth and up-to-date presentation of the most
important aspects of database systems and applications, and related technologies. It is assumed that readers are familiar
with elementary programming and data-structuring concepts and that they have had some exposure to the basics of
computer organization.

Features
• Chapters have been reorganized to allow for flexible • Pedagogy and real world examples enhance the text
use of material. throughout.
• Chapters have been added and restructured to
keep the text up-to-date with recent concepts and
technology regarding database systems.

Contents
1. Databases and Database Users 12. Object and Object-Relational Databases
2. Database Systems Concepts and Architecture 13. XLM: Extensible Markup Language
3. Data Modeling Using the Entity Relationship (ER) 14. Basics of Functional Dependencies and Normalization
Model for Relational Databases
4. The Enhanced Entity Relationship (EER) Model 15. Relational Database Design Algorithms and Further
5. The Relational Data Model and Relational Database Dependencies
Constraints 16. Disc Storage, Basic File Structures, Hashing, and
6. Basic SQL Modern Storage Architectures
7. More SQL: Complex Queries, Triggers, Views, and 17. Indexing Structures for Files and Physical Database
Schema Modification Design
8. The Relational Algebra and Relational Calculus 18. Strategies for Query Processing
9. Relational Database Design by ER- and EER-to- 19. Query Optimization
Relational Mapping 20. Introduction to Transaction Processing Concepts and
10. Introduction to SQL Programming Techniques Theory
11. Web Database Programming Using PHP 21. Concurrency Control Techniques

53

Untitled-1 53 05/04/2017 12:54:30

Database Systems

22. Database Recovery Techniques Temporal, Spatial, Multimedia, and Deductive

23. Distributed Database Concepts Databases
24. NOSQL Databases and Big Data Storage Systems 27. Introduction to Information Retrieval and Web Search
25. Big Data Technologies Based on MapReduce and 28. Data Mining Concepts
Hadoop 29. Overview of Data Warehousing and OLAP
26. Enhanced Data Models: Introduction to Active, 30. Database Security
About the Authors
Ramez Elmasri is a professor and the associate chairperson of the Department of Computer Science and Engineering
at the University of Texas at Arlington. He has over 140 refereed research publications, and has supervised 16 PhD
students and over 100 MS students. His research has covered many areas of database management and big data, including
conceptual modeling and data integration, query languages and indexing techniques, temporal and spatio-temporal
databases, bioinformatics databases, data collection from sensor networks, and mining/analysis of spatial and spatio-
temporal data. He has worked as a consultant to various companies, including Digital, Honeywell, Hewlett Packard, and
Action Technologies, as well as consulting with law firms on patents.
Shamkant B. Navathe is a professor and the founder of the database research group at the College of Computing,
Georgia Institute of Technology, Atlanta. He has worked with IBM and Siemens in their research divisions and has been
a consultant to various companies including Digital, Computer Corporation of America, Hewlett Packard, Equifax, and
Persistent Systems.

Database Systems: The Complete Book , 2/e

Hector Garcia-Molina • Jeffrey D. Ullman • Jennifer Widom
ISBN: 9789332518674 | © Year: 2013 | Pages: 1139

About the Book

This book introduces the fundamental concepts necessary for designing, using, and
implementing database systems and database applications. Our presentation stresses
the fundamentals of database modeling and design, the languages and models
provided by the database management systems, and database system implementation
techniques.
The goal is to provide an in-depth and up-to-date presentation of the most
important aspects of database systems and applications, and related technologies. It is
assumed that readers are familiar with elementary programming and data-structuring
concepts and that they have had some exposure to the basics of computer organization.
Features
• Chapters have been reorganized to allow for flexible • Chapters have been added and restructured to
use of material. keep the text up-to-date with recent concepts and
technology regarding database systems.
• Pedagogy and real world examples enhance the text
throughout.

Contents
1. Databases and Database Users 7. More SQL: Complex Queries, Triggers, Views, and
2. Database Systems Concepts and Architecture Schema Modification
3. Data Modeling Using the Entity Relationship (ER) 8. The Relational Algebra and Relational Calculus
Model 9. Relational Database Design by ER- and EER-to-
4. The Enhanced Entity Relationship (EER) Model Relational Mapping
5. The Relational Data Model and Relational Database 10. Introduction to SQL Programming Techniques
Constraints 11. Web Database Programming Using PHP
6. Basic SQL 12. Object and Object-Relational Databases

54

Untitled-1 54 05/04/2017 12:54:36

 Database Systems
13. XLM: Extensible Markup Language 21. Concurrency Control Techniques
14. Basics of Functional Dependencies and Normalization 22. Database Recovery Techniques
for Relational Databases 23. Distributed Database Concepts
15. Relational Database Design Algorithms and Further 24. NOSQL Databases and Big Data Storage Systems
Dependencies 25. Big Data Technologies Based on MapReduce and
16. Disc Storage, Basic File Structures, Hashing, and Hadoop
Modern Storage Architectures 26. Enhanced Data Models: Introduction to Active,
17. Indexing Structures for Files and Physical Database Temporal, Spatial, Multimedia, and Deductive
Design Databases
18. Strategies for Query Processing 27. Introduction to Information Retrieval and Web Search
19. Query Optimization 28. Data Mining Concepts
20. Introduction to Transaction Processing Concepts and 29. Overview of Data Warehousing and OLAP
Theory 30. Database Security

Introduction to Database Systems

ITL Education Solutions Limited
ISBN: 9788131731925 | © Year: 2010 | Pages: 580

About the Book

The book deals with implementation, design and application of DBMS and complicated
topics such as relational algebra and calculus, and normalization are explained in a
very simple manner.

Features
• Includes chapter objectives at the beginning of each with the summary.
chapter. • Two chapters with case study each on Hospital
• Each chapter has 10 MCQ’S and 10 Fill in the Blanks management and Railway reservation system.
• More than 250 descriptive questions. • Running marginalia with additional information on
• More than 70 practical questions. the subject.
• Each chapter at the end has a list of Key terms along

Contents
1. Database System 10. Concurrency Control Techniques
2. Conceptual Modelling 11. Database Recovery System
3. The Relational Model 12. Database Security
4. Relational Algebra and Calculus 13. Database System Architectures
5. Structured Query Language 14. Data Warehousing, OLAP, and Data Mining
6. Relational Database Design 15. Information Retrieval
7. Data Storage and Indexing 16. Object-Based Databases
8. Query Processing and Optimisation 17. XML and updated Appendices
9. Introduction to Transaction Management 18. Leading Database Systems

55

Untitled-1 55 05/04/2017 12:54:42

Database Systems

About the Author

ITL Education Solution Limited (ITL ESL) is a part of 2000 million ITL group which has operations all over the world
with significant presence in computer education and IT-enabled sevices. It specializes in handling IT implementation
projects in various IT domains with a dedicated R7D wing of industry experts that helps in designing and developing
content.

Database Processing, 13/e

David M. Kroenke • David J. Auer
ISBN: 9789332549951 | © Year: 2015 | Pages: 640

About the Book

Database Processing reflects a new teaching method that gets students straight to the
point with its thorough and modern presentation of database processing fundamentals.
The thirteenth edition has been thoroughly updated to reflect the latest software.

Features
• Spiral approach to database design. Rather than teach • The Latest Software. This edition has been updated to
database design once from the data models, this text reflect the latest database software, including Access,
gives professors a significant pedagogical opportunity SQL Server, and MySQL.
to teach database design three times—once from each • NEW. Material on big data and the evolving NoSQL
of the three sources. movement has been moved to Chapter 12 and
• Existing data from spreadsheets, data files, and expanded upon. Big data is the theme for the chapter.
database extracts. New material on virtualization, cloud computing,
• The development of new information systems and the development of non-relational unstructured
projects. data stores (such as Cassandra and HBase) and the
• The need to redesign an existing database to adapt to Hadoop Distributed File System (HDFS) is also
changing requirements. included
• Early Introduction of SQL. This text provides an early • NEW. An independent Case Question set (in each
introduction to SQL data manipulation language chapter).
(DML) SELECT statements. By presenting SQL • NEW. Microsoft Office 2013. This book has been
SELECT statements in Chapter 2, students learn early revised to update all references to Microsoft Access
in the class how to query data and obtain results, and other Microsoft Office products (e.g., Microsoft
seeing firsthand how database technology will be Excel) to the recently released Microsoft Office 2013
useful to them. versions.

56

Untitled-1 56 05/04/2017 12:54:48

 Database Systems
• NEW. Microsoft SQL Server 2012. Although most Windows for installations on computers with the
of the topics covered are backward compatible with Windows operating system.
Microsoft SQL Server 2008 R2 and Microsoft SQL • NEW. Big Data and the Not Only SQL movement.
Server 2008 R2 Express edition, all material in the Coverage of Big Data and the Not Only SQL
book now uses SQL Server 2012 in conjunction with movement has been added.
Office 2013, exclusively. • NEW. Although Oracle’s Oracle Database 11g Release
• NEW. Oracle MySQL 5.6. The new edition has been 2 remains the version of Oracle Database discussed in
updated to include Oracle MySQL 5.6, which is the the book, all Oracle Database 11g material have been
current generally available (GA) release of MySQL. updated to reflect use of the current version of the
The authors also now use the MySQL Installer for Oracle SQL Developer GUI tool.

Contents
I. GETTING STARTED V. DATABASE ACCESS STANDARDS
1. Introduction 11. The Web Server Environment
2. Introduction to Structured Query Language 12. Big Data, Data Warehouses, and Business
II. DATABASE DESIGN Intelligence Systems
3. The Relational Model and Normalization Online Appendix A. Getting Started with Microsoft
4. Database Design Using Normalization Access 2013
5. Data Modeling and the Entity-Relationship Model Online Appendix B. Getting Started in Systems
6. Transforming Data Models in Database Designs Analysis and Design
Online Appendix C. E-R Diagrams and the IDEF1X
III. DATABASE IMPLEMENTATION
Standard
7. SQL for Database Construction and Application
Online Appendix D. E-R Diagrams and the UML
Processing
Standard
8. Database Redesign
Online Appendix E. Getting Started with MySQL
IV. MULTIUSER DATABASE PROCESSING Workbench Data Modeling Tools
9. Managing Multiuser Databases Online Appendix F. Getting Started with Microsoft
10. Managing Databases with SQL Server 2012, Vision 2010
Oracle Database 11g, and MySQL 5.6 Online Appendix G. Data Structures for Database
Online Chapter: 10A. Managing Databases with SQL Processing
Server 2012 Online Appendix H. The Semantic Object Model
Online Chapter: 10B. Managing Databases with Online Appendix I. Getting Started with Web
Oracle 11g Servers, PHP and the Eclipse PDT
Online Chapter: 10C. Managing Databases with Online Appendix J. Business Intelligence Systems
MySQL 5.6

About the Authors

David M. Kroenke has more than 35 years’ experience in the computer industry. He began as a computer programmer for
the U.S. Air Force, working both in Los Angeles and at the Pentagon, where he developed one of the world’s first DBMS
products while part of a team that created a computer simulation of World War III. That simulation served a key role for
strategic weapons studies during a 10-year period of the Cold War.
David J. Auer has more than 30 years’ experience teaching college-level business and information systems courses and for
the past 20 years has worked professionally in the field of information technology. He served as a commissioned officer in
the U.S. Air Force, with assignments to NORAD and the Alaskan Air Command in air defense operations. He later taught
both business administration and music classes at Whatcom Community College and business courses for the Chapman
College Residence Education Center at Whidbey Island Naval Air Station. He was a founder of the Puget Sound Guitar
Workshop (now in its 41st year of operations).

57

Untitled-1 57 05/04/2017 12:54:58

Database Systems

A First Course in Database Systems, 3/e

Jeffrey D. Ullman • Jennifer Widom
ISBN: 9789332535206 | © Year: 2014 | Pages: 520

About the Book

Written by well-known computer scientists, this accessible and succinct introduction
to database systems focuses on database design and use. The authors provide in-
depth coverage of databases from the point of view of the database designer, user,
and application programmer, leaving implementation for later courses. It is the first
database systems text to cover such topics as UML, algorithms for manipulating
dependencies in relations, extended relational algebra, PHP, 3-tier architectures, data
cubes, XML, XPATH, XQuery, XSLT.

Features
• Large variety of real-world examples ensure the • Discussion of how to successfully plan a database
presentation is readable and engaging. application before building it reflects how these plans
• Extensive treatment of database modeling teaches are developed in the real world.
about this important first step of the planning process. • Extensive exercises in almost every section provide
• Coverage of advanced issues important to database students with the opportunity to practice and apply
designers and users includes discussions of views, the concepts they’ve learned in each chapter.
integrity constraints, assertions, triggers, transactions,
authorization, and recursion in SQL: 1999.

Contents
I. RELATIONAL DATABASE MODELING 7. SQL Constraints and Triggers
1. The Worlds of Database Systems 8. SQL Indexes and Views
2. Introduction to the Relational Model 9. SQL in a Service Environment
3. Relational Database Schema Design 10. Advanced Topics in SQL
4. Higher-Level Models for Relational Design Appendix A. More About Datalog
II RELATIONAL DATABASE PROGRAMMING III MODELING AND PROGRAMMING IN
5. Algebraic and Logical Query Languages SEMISTRUCTURED-DATA MODELS
6. The Database Language SQL 11. Semistructured Data Models

About the Authors

Jeffrey D. Ullman is the Stanford W. Ascherman Professor of Computer Science at Stanford University. He is the author
of co-author of 15 books and 170 technical publications, including A First Course in Database Systems (Prentice Hall
1997) and Elements of ML Programming (Prentice Hall 1998) His research interests include database theory, database
integration, data mining, and education using the information infrastructure.
Jennifer Widom is an Associate Professor in the Computer Science and Electrical Engineering Departments at Stanford
University. She has served on numerous editorial boards and program committees, she has published widely in computer
science conferences and journals, and is co-author of A First Course in Database Systems

58

Untitled-1 58 05/04/2017 12:55:07

 Database Systems
Modern Database Management, 10/e
Jeffrey A. Hoffer • Heikki Topi • V Ramesh
ISBN: 9788131761434 | © Year: 2011 | Pages: 620

About the Book

The tenth edition of the popular Modern Database Management has been expanded
and upgraded to make it more relevant to improved managerial practices, database
design tools and methodologies, and database technology. In addition to the expanded
coverage of SQL with frequently used components, the text includes new figures to
graphically depict the set-processing logic of SQL queries, thereby providing new tools
to students.

Features
• A separate chapter on data quality and integration, • The problems and exercises are arranged in an
which are extremely important with national increasing order of difficulty to make it easier for
and international regulations such as the instructors and students to select problems and
Sarbanes–Oxley Act, Basel II, COSI, and HIPAA. exercises for practice and assignments.
• Specific examples of how to connect to databases • Standard data-naming conventions are used
from popular programming languages such as Java throughout the book to make it easier for students to
and VB.NET as well as Web development languages distinguish data elements from conceptual to physical
such as Java Server Pages (JSP), ASP.NET, and PHP. forms.
• New and updated field exercises, case studies, and a • New screen captures to reflect the latest database
set of hands-on mini-cases that could be assigned to technologies and an updated Web Resources section
an individual or to a team. in each chapter.

Contents
I. The Context of Database Management V. Advanced Database Topics
1. The Database Environment and Development 10. Data Quality and Integration
Process 11. Data and Database Administration
II. Database Analysis 12. Overview: Distributed Databases
2. Modeling Data in the Organization 13. Overview: Object-Oriented Data Modeling
3. The Enhanced E-R Model 14. Overview: Using Relational Databases to Provide
Object Persistence
III. Database Design
Appendices
1. Logical Database Design and the Relational Model
Appendix A: Data Modeling Tools and Notation
2. Physical Database Design and Performance
Appendix B: Advanced Normal Forms
IV. Implementation Appendix C: Data Structures
6. Introduction to SQL Glossary of Acronyms
7. Advanced SQL Glossary of Terms
8. Database Application Development Index
9. Data Warehousing

59

Untitled-1 59 05/04/2017 12:55:15

Database Systems

Introduction to Database Management

Systems
Atul Kahate
ISBN: 9788131700785 | © Year: 2004 | Pages: 536

About the Book

Designed specifically for a single semester, first course on Database Systems, there are
4 aspects that differentiate our book from the rest.
• Simplicity: Normally, the technology of database systems can be quite difficult to
understand. There are so many terms, acronyms and buzzwords associated with the
technology that people find highly complicated. This book explains each of these with
very simple examples, lucid language and a lot of illustrations.
• Coverage: The book covers all the essential aspects of database systems, and also
covers the areas of RDBMS. There are very few books, which cover all the theory and
practice of database systems. This book covers both these aspects.
• Illustrative approach: The book contains over 400 diagrams – about one per page. This makes this book unique in terms
of its visual approach. With this, even the most difficult concepts become a lot easier to understand.
• Modern topics: The book covers all the modern topics, such as OODBMS, database systems and the Internet, Data
warehousing, Mobile databases, Multimedia databases, Deductive databases.

Features
• Detailed coverage of Database models, theory and • Explanation of Data warehousing, Data mining, and
architectures. OLAP.
• Focus on Transaction management and Concurrency • Liberal use and explanation of SQL.
issues. • Unique appendices on Data Structures, Sorting and
• A separate chapter on Database security. Searching, Database Management with Access and
• Coverage of Object technology and OODBMS. Case Studies with real life programs in COBOL, DB2
• Distributed databases explained in depth. and C.

Contents
1. File Systems 7. Query Execution and Optimisation
2. An Introduction to Database Systems 8. Distributed Databases
3. The Relational Model 9. Decision Support Systems, Data Warehousing and
4. Database Design Data Mining
5. Transaction Processing and Management 10. Object Technology and DBMS
6. Database Security 11. Advanced Topics in DBMS

About the Author

Atul Kahate has over 13 Years of experience in the IT industry in varying capacities in India and abroad. Author of 18
highly acclimated text books. Winner of several awards for contribution to IT education and other achievements. Visiting
faculty and guest speaker in several reputed educational institutions across the country.

60

Untitled-1 60 05/04/2017 12:55:23

 Database Systems
Database Systems Using Oracle, 2/e
Nilesh Shah
ISBN: 9789332549722 | © Year: 2015 | Pages: 456

About the Book

Updated to cover Oracle 9i, this text first introduces students to relational database
concepts and database designing techniques, then teaches them how to design
and implement accurate and effective database systems. With its subsequent in-
depth coverage of SQL (the universal query language for relational databases) and
PL/SQL (Oracle’s procedural language extension to SQL), this text serves not only
as an introductory guide but also as a valuable future reference. Part IV, Advanced
Topics, allows students to further understand and utilize Oracle 9i architecture and
administration.
Features
• NEW - Updated material for Oracle 9 i—Introduces add to the already numerous hands-on exercises and
the new features of Oracle 9i. lab activities for each chapter.
• NEW - More examples—Provided throughout the • Two sample databases—Used throughout the book
text; coding examples are replaced by more than 250 as examples and for lab activities; the first is a
actual screen shots. typical college student’s database with demographic,
• NEW - Enhanced material—Provides new and schedule, and registration information; the second is
enhanced information all existing topics, including a corporation’s employee database with demographic
Oracle’s data dictionary; and updated ERD. and job-related data.
• NEW - New chapters—Includes Database • Versatility—Covers the SQL and PL/SQL features that
Administration with Enterprise Manager and a new work with any version of Oracle.
chapter on database connectivity with Java/C++ and • SQL Review section—Provides a review of SQL
SQLJ. statements covered in chapters 3-9, and includes a
• NEW - New lesson on SQL*Plus—Includes exercises sample database.
for SQL workshet and iSQL*Plus environments; these
Contents
I. RELATIONAL DATABASE CONCEPTS III. PL/SQL
1. Database Concepts: A Relational Approach 10. PL/SQL: A Programming Language
2. Database Design: Data Modeling and 11. More on PL/SQL: Control Structures and
Normalization Embedded SQL
II. ORACLE SQL 12. Cursors and Exceptions
3. Oracle 9i: An Overview 13. PL/SQL Composite Data Types: Records, Tables,
4. Oracle Tables: Data Definition Language (DDL) and Varrays
5. Working with Tables: Data Manipulation and 14. PL/SQL Named Blocks: Procedure, Function,
Retrieval Package, and Trigger
6. Working with Tables: Functions and Grouping IV. ADVANCED TOPICS
7. Multiple Tables: Joins and Set Operators 15. Connecting to Oracle Database: JDBC, SQLJ
8. Subqueries: Nested Queries 16. Oracle 9i Architecture and Administration
9. Advanced Features: Objects, Transactions, and Appendix A: Sample Databases—Table Definitions
Data Control Appendix B: Quick Reference to SQL & PL/SQL
SQL Review: Review of SQL Statements Covered Syntax
in Chapters 3-9 with a Sample Database Appendix C: Reference to SQL*Plus Commands
Appendix D: Object Orientation with Oracle
Appendix E: Additional References—Websites and
Books

About the Author

Nilesh D. Shah, DeVry College of Technology and Monroe College.

61

Untitled-1 61 05/04/2017 12:55:36

Database Systems

Also Available

ISBN: 9788131704134 ISBN: 9788131760802 ISBN: 9788131703748 ISBN: 9789332526280

Pages: 672 Pages: 672 Pages: 624 Pages: 264

62

Untitled-1 62 05/04/2017 12:55:38

 Decision Support Systems
Decision Support and Business Intelligence
Systems, 9/e
Efraim Turban • Ramesh Sharda • Dursur Delen
ISBN: 9789332518254 | © Year: 2013 | Pages: 676

About the Book

Appropriate for all courses in Decision Support Systems (DSS), computerized decision
making tools, and management support systems.
Decision Support and Business Intelligence Systems, 9e provides the only
comprehensive, up-to-date guide to today’s revolutionary management support system
technologies, and showcases how they can be used for better decision-making.
The 9th edition focuses on Business Intelligence (BI) and analytics for enterprise
decision support in a more streamlined book.

Features
• Introduction of management support systems (MSS) • Comprehensive coverage of knowledge-based decision
technologies. support.
• BI and analytics for enterprise decision • Organizational and societal impacts.
support. • Detailed coverage of implementation and integration.
• Extensive supply chain and ERP coverage. • Links to Teradata University Network (TUN).
• Comprehensive coverage of data warehousing. • Software Support.

Contents
I. Decision Support and Business Intelligence 8. NBusiness Performance Management
1. Decision Support Systems and Business IV. Collaboration, Communication, Group Support
Intelligence Systems, and Knowledge Management
II. Computerized Decision Support 9. Collaborative Computer-Supported Technologies
2. Decision Making, Systems, Modeling, and Support and Group Support Systems
3. Decision Support Systems Concepts, 10. Knowledge Management
Methodologies, and Technologies: An Overview V. Intelligent Systems
4. Modeling and Analysis 11. Artificial Intelligence and Expert Systems
III. Business Intelligence 12. Advanced Intelligent Systems
5. Data Mining for Business Intelligence 13. Management Support Systems: Emerging Trends
6. Artificial Neural Networks for Data Mining and Impacts
7. Data Warehousing

About the Authors

Efraim Turban Efraim Turban (M.B.A., Ph.D., University of California, Berkeley) is a visiting scholar at the Pacific Institute
for Information System Management, University of Hawaii. Prior to this, he was on the staff of several universities,
including City University of Hong Kong; Lehigh University; Florida International University; California State University,
Long Beach; Eastern Illinois University; and the University of Southern California.
Ramesh Sharda (M.B.A., Ph.D., University of Wisconsin—Madison) is Director of the PhD in Business for Executives
Program and Institute for Research in Information Systems (IRIS), ConocoPhillips Chair of Management of Technology,
and a Regents Professor of Management Science and Information Systems in the Spears School of Business at Oklahoma
State University (OSU).
Dursun Delen (Ph.D, Oklahoma State University) is the Spears and Patterson Chairs in Business Analytics, Director of
Research for the Center for Health Systems Innovation and Professor of Management Science and Information Systems
in the Spears School of Business at Oklahoma State University (OSU).

63

Untitled-1 63 05/04/2017 12:55:50

Decision Support Systems

Modern Information Retrieval

Ricardo Baeza-Yates • Berthier Ribiero-Neto
ISBN: 9788131709771 | © Year: 2003 | Pages: 534

About the Book

We live in the information age, where swift access to relevant information in whatever
form or medium can dictate the success or failure of businesses or individuals. The
timely provision of relevant information with minimal ‘noise’ is critical to modern
society and this is what information retrieval (IR) is all about. It is a dynamic subject,
with current changes driven by the expansion of the World Wide Web, the advent
of modern and inexpensive graphical user interfaces and the development of reliable
and low-cost mass storage devices. Modern Information Retrieval discusses all these
changes in great detail and can be used for a first course on IR as well as graduate
courses on the topic. The book comprises two portions which complement and balance
each other. The core portion includes nine chapters authored or co-authored by the designers of the book. The second
portion, which is fully integrated with the first, is formed by six state-of-the-art chapters written by leading researchers
in their fields. From IR models to indexing text, from IR visual tools and interfaces to the Web, from IR. multimedia to
digital libraries, the book provides both breadth of coverage and richness of detail. It is our hope that, given the now clear
relevance and significance of information retrieval to modern society. The book will contribute to further disseminate the
study of the discipline at information science, computer science, and library science departments throughout the world.
Features
• Text IR - all the main IR models, query operations, • Multimedia IR: Models and Languages - including
text operations, indexing and searching (three of them MULTOS and SQL3 (Elisa Bertino, Barbara Catania
co-authored with Gonzalo Navarro or Nivio Ziviani) and Elena Ferrari)
• The Web - challenges, measures and models, search • Multimedia IR: Indexing and Searching - R-trees and
engines, directories, query languages, meta searches GEMINI and QBIC (Christos Faloutsos)
and trends • Libraries and Bibliographical Systems - online systems
• Parallel and Distributed IR - algorithms and and public access catalogs (Edie M. Rasmussen)
architectures (Eric Brown) • Digital Libraries - the main challenges for effective
• User Interfaces and Visualization - the main interface deployment (Edward A Fox and Ohm Sornil)
paradigms for query formation and visualization of
results (Marti A. Hearst)
Contents
1. Introduction 11. Multimedia IR: models and languages (Elisa Bertino,
2. Modeling Barbara Catania and Elena Ferrari)
3. Retrieval evaluation 12. Multimedia IR: indexing and searching (Christos
4. Query languages (with Gonzalo Navarro) Faloutsos)
5. Query operations 13. Searching the web
6. Text languages and properties (with Nivio Ziviani) 14. Libraries and bibliographical systems (Edie
7. Text operations Rasmussen)
8. Indexing and searching (with Gonzalo Navarro) 15. Digital libraries (Edward A. Fox and Ohm Sornil)
9. Parallel and distributed IR (Eric Brown) 16. Appendix: Porter’s algorithm
10. User interfaces and visualization (Marti Hearst) 17. Glossary
18. Bibliography
About the Authors
Ricardo Baeza-Yates received his Ph.D. in Computer Science from the University of Waterloo, Canada in 1989. In 1992
and 1996, he was elected president of the Chilean Computer Science Society. In 1993, he received the Organization of
American States award for young researcher in exact sciences.
Berthier Ribeiro-Neto reveived his Ph.D. in Computer Science from the University of California, Los Angeles in 1995.
He is involved with various research projects financed by Braziliam agencies; the two main projects deal with wireless
information systems and video on demand. He has chaired distinguished conferences in South America and is a member
of ACM, IEEE and ASIS.

64

Untitled-1 64 05/04/2017 12:56:02

 Digital Design/Digital Electronics
Advanced Digital Design with the
Verilog HDL, 2e
Michael D. Ciletti
ISBN: 9789332584464 | © Year: 2017 | Pages: 992

About the Book

For an advanced course in digital design for seniors and first-year graduate students in
electrical engineering, computer engineering, and computer science.
This book builds on the student’s background from a first course in logic design
and focuses on developing, verifying, and synthesizing designs of digital circuits. The
Verilog language is introduced in an integrated, but selective manner, only as needed
to support design examples (includes appendices for additional language details). It
addresses the design of several important circuits used in computer systems, digital
signal processing, image processing, and other applications.

Features
• Provides a brief review of basic principles in • Provides several problems with a wide range of
combinational and sequential logic. difficulty after each chapter.
• Focuses on modern digital design • Combines a solution manual with an on-line
methodology. repository of additional worked exercises.
• Demonstrates the utility of ASM and ASMD charts • Inclusion of an appendix introducing semiconductor
for behavioral modeling. technology.
• Clearly distinguishes between synthesizable and
nonsynthesizable loops.

Contents
1. Introduction to Digital Design Methodology 7. Design and Synthesis of
2. Review of Combinational Logic Design Datapath Controllers
3. Fundamentals of Sequential Logic Design 8. Programmable Logic and Storage Devices
4. Introduction to Logic Design with Verilog 9. Algorithms and Architectures for
5. Logic Design with Behavioral Models of Digital Processors
Combinational and Sequential Logic 10. Architectures for Arithmetic Processors
6. Synthesis of Combinational and Sequential Logic 11. Postsynthesis Design Tasks

About the Author

Michael D. Ciletti is Professor Emeritus in the Department of Electrical and Computer Engineering at the University
of Colorado, Colorado Springs. His areas of interest include Modeling, synthesis and verification of digital systems with
hardware description languages, system-level design languages, and embedded systems with FPGAs.

65

Untitled-1 65 05/04/2017 12:56:13

Digital Design/Digital Electronics

Digital Fundamentals, 11/e

Thomas L. Floyd
ISBN: TBA | © Year: 2011 | Pages: 944

About the Book

For courses in digital circuits, digital systems (including design and analysis), digital
fundamentals, digital logic, and introduction to computers
Digital Fundamentals, Eleventh Edition, continues its long and respected tradition
of offering students a strong foundation in the core fundamentals of digital technology,
providing basic concepts reinforced by plentiful illustrations, examples, exercises, and
applications.

Features
• Teaching and Learning Experience. • The chapter on programmable logic has been
• Provides a strong foundation in the core fundamentals modified and improved.
of digital technology. • A discussion of memory hierarchy has been added.
• Covers basic concepts reinforced by plentiful • A new chapter on data transmission has been added
illustrations, examples, exercises, and applications. and includes extensive coverage of standard busses.
• Provides a strong foundation in the core fundamentals • The chapter on computers has been completely
of digital technology. revised and is now entitled Data Processing.
• Boolean simplification coverage now includes the
Quine-McClusky method, and the Expresso method
is introduced.

New features for this edition:

• The System Application Activities (formerly Digital • Boolean simplification coverage now includes the
System Applications) have been thoroughly revised. Quine-McClusky method in an appendix.
• More end-of-chapter problems. • Coverage of the cyclic redundancy code (CRC).
• A true/false quiz at the end of every chapter. • Introduction to multi-core processors.

Contents
1. Digital Concepts 9. Counters
2. Number Systems, Operations, and Codes 10. Programmable Logic
3. Logic Gates 11. Data Storage
4. Boolean Algebra and Logic Simplification 12. Signal Conversion and Processing
5. Combinational Logic Analysis 13. Data Transmission
6. Functions of Combinational Logic 14. Data Processing
7. Latches, Flip-Flops, and Timers 15. Integrated Circuit Technologies
8. Shift Registers

About the Author

Thomas L. Floyd received his BS degree in electrical engineering from the University of Florida in 1964 and began his
industrial experience at Texas Instruments Inc. in Dallas, Texas the same year.He also did consulting work for Martin-
Marietta during this time. While at VCC, Mr. Floyd wrote his first textbook, Digital Fundamentals, which was published
in 1977 and is now in its eleventh edition.

66

Untitled-1 66 05/04/2017 12:56:22

 Digital Design/Digital Electronics
An Engineering Approach to Digital Design
William I. Fletcher
ISBN: 9789332555228 | © Year: 2015 | Pages: 768

About the Book

Providing an engineering-based approach to digital design, this book develops general
design methodology (stressing documentation) that is useful for a wide range of diverse
applications. The text builds up conceptual understanding through a survey of selected
theories and examples. Besides, it also considers the ‘how-to’ of practical time- efficient
design methods (for well-documented reliable and debug-gable hardware) for simple
combinational systems, traditional sequential machines, high speed system controllers
and programmable finite state machines.

Contents
Preface 8. System Controllers Utilizing Combinational MSI/LSI
1. Introductory Digital Design Concepts Circuits
2. Digital Design Fundamental 9. Introduction to Programmable System Controllers
3. Minimization and Design of Combinational Circuits 10. Asynchronous Finite State Machines
4. MSI and LSI Circuits and their Applications Appendix A: Drafting and Documentation Standards
5. Sequential Machine Fundamentals Manual
6. Traditional Approaches to Sequential Analysis and Appendix B: Boozer Program
Design Index
7. Introduction to Multi-input System Controller Design

High Speed Digital Design:

A Handbook of Black Magic
Howard Johnson • Martin Graham
ISBN: 9788131714126 | © Year: 2003 | Pages: 464

About the Book

Focusing on a combination of digital and analog circuit theory, this comprehensive
volume will help engineers who work with digital systems, shorten their product
development cycles, and fix their latest high-speed design problems.

Features
• Covers signal reflection, crosstalk, and noise • Explains the trade-offs between signal cross talk,
problems that occur in high-speed digtal machines mechanical fabrication of tolerances, and trace
(above 10 megahertz). routing density.
• lncludes checklists that ask the questions an • Presents a methodology for determining how many
experienced designer would about a new system. layrs will be required to route a printed circuit board.
• Offers useful formulas for inductance, capacitance,
resistance, rise time, and Q.

67

Untitled-1 67 05/04/2017 12:56:29