Special Priced Indian Edition Computer Science and Engineering
Total Page：16
File Type：pdf, Size：1020Kb
springer.com Special Priced Indian Edition Computer Science and Engineering * (To be sold in India, Pakistan, Bangaldesh, Sri Lanka and Nepal) Catalogue 2014 Contents Highlights 1 Order Form Artificial Intelligence 25 Communication Networks 26 Computational Biology 27 Computer Systems 27 Database Systems 28 Digital Systems 29 Discrete Mathematics 29 Image Technology 30 Information Systems 31 Programming Techniques 31 Security 32 Software Engineering 33 Theoretical Computer Science 34 Distributor’s Code 39 Distributor’s Addresses 41 South Asian Retailer’s Addresses 52 springer.com Highlights 1 A Concise and Practical Introduction to Programming Algorithms in Java Frank Nielsen, Ecole Polytechnique, Paris, France About the Book A Concise and Practical Introduction to Programming Algorithms in Java has two main goals. The first is for novice programmers to learn progressively the basic concepts underlying most imperative programming languages using Java. The second goal is to introduce new programmers to the very basic principles of thinking the algorithmic way and turning the algorithms into programs using the programming concepts ISBN: 9788132202318 of Java. The book is divided into two parts and includes: The fundamental notions of variables, expressions Page: XXVIII, 252 p. 27 illus.. and assignments with type checking - Conditional and loop statements - Explanation of the concepts of Price: ` 295.00 functions with pass-by-value arguments and recursion - Fundamental sequential and bisection search Market: Open techniques - Basic iterative and recursive sorting algorithms. Each chapter of the book concludes with a Reprint Year: Feb-11 set of exercises to enable students to practice concepts covered. Contents Preface - Part 1 Getting Started - Expressions, Variables and Assignments - Conditional Structures and Loops - Functions and Recursive Functions - Arrays - Part II Data - structures and Algorithms - Objects and Strings - Searching and Sorting - Linked Lists - Object - oriented Data Structures - Paradigms for Optimization Problems - The Science of Computing - Part III Exam Review - Exam and Solution - Bibliography. A Practical Introduction to Computer Architecture Daniel Page, University of Bristol, UK About the Book This book blends traditional teaching approaches with the use of mathematics, together with the use of a hardware description language and a concrete processor as vehicles for 'hands-on' modelling and experimenting with digital logic and processor design. This unique approach encourages readers to derive their own conclusions via experimentation, enabling them to discover for themselves the fundamental and exciting topics of computer architecture. Features: includes a wide-ranging introductory chapter; ISBN: 9788132202967 outlines basic methods for evaluating processors; investigates advanced topics in processor design; Page: XXII, 642 p. 162 presents a detailed description of a development tool-chain; provides a stand-alone tutorial on using illus. SPIM; focuses on aspects of compilers which are closely tied to the processor; examines the concept of Price: ` 599.00 efficient programming; concludes every chapter with a set of example problems. This practical, reader- Market: Open friendly textbook has been written with undergraduates in mind, and is suitable for self-study. Reprint Year: Jun-11 Contents Introduction - Part I: Tools and Techniques - Mathematical Preliminaries - Basics of Digital Logic - Hardware Design using Verilog - Part II Processor Design - A Historical and Functional Perspective - Basic Processor Design - Arithmetic and Logic - memory and Storage - measuring Performance - Advanced Processor Design - Part III: The Hardware/Software Interface - Assemblers, Compilers and Linkers - Operating Systems - Efficient Programming - Part IV: Appendices - Selected Topics - SPIM: AMIPS32 Simulator - Bibliography. Prices are subject to change without prior notice Computer Science and Engineering These titles are for sale only in India, Pakistan, Bangladesh, Sri Lanka and Nepal. Sale outside the designated territory is strictly prohibited. 2 Highlights springer.com Algorithms and Data Structures: The Basic Toolbox Kurt Mehlhorn, Max-Planck-Institut für Informatik, Saarbrücken, Germany Peter Sanders, University of Karlsruhe, Germany About the Book Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving ISBN: 9788132205272 algorithmic problems. This book is a concise introduction addressed to students and professionals Page: XII, 300 p. 112 familiar with programming and basic mathematical language. Individual chapters cover arrays and linked illus. lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph Price: ` 359.00 representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms Market: Open are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such Reprint Year: Dec-11 as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java. The authors have extensive experience teaching these subjects to undergraduates and graduates, and they offer a clear presentation, with examples, pictures, informal explanations, exercises, and some linkage to the real world. Most chapters have the same basic structure: a motivation for the problem, comments on the most important applications, and then simple solutions presented as informally as possible and as formally as necessary. For the more advanced issues, this approach leads to a more mathematical treatment, including some theorems and proofs. Finally, each chapter concludes with a section on further findings, providing views on the state of research, generalizations and advanced solutions. Contents Appetizer: Integer Arithmetic - Introduction - Representing Sequences by Arrays and Linked Lists - Hash Tables and Associative Arrays - Sorting and Selection - Priority Queues - Sorted Sequences - Graph Representation - Graph Traversal - Shortest Paths - Minimum Spanning Trees - Generic Approaches to Optimization - App. A - Notation - Bibliography. An Introduction to Mathematical Cryptography Jeffrey Hoffstein, Brown University, Providence, RI, USA Jill Pipher, Brown University, Providence, RI, USA J.H. Silverman, Brown University, Providence, RI, USA About the Book This self-contained introduction to modern cryptography emphasizes the mathematics behind the theory of public key cryptosystems and digital signature schemes. The book focuses on these key topics while developing the mathematical tools needed for the construction and security analysis of diverse ISBN: 9788132204053 cryptosystems. Only basic linear algebra is required of the reader; techniques from algebra, number theory, Page: XVI, 524 p. 29 and probability are introduced and developed as required. The book covers a variety of topics that are illus. considered central to mathematical cryptography. This book is an ideal introduction for mathematics and Price: ` 599.00 computer science students to the mathematical foundations of modern cryptography. The book includes Market: Open an extensive bibliography and index; supplementary materials are available online. Reprint Year: Oct-11 Contents An Introduction to Cryptography - Discrete Logarithms and Diffie-Hellman - Integer Factorization and RSA - Probability Theory and Information Theory - Elliptic Curves and Cryptography - Lattices and Cryptography - Digital Signatures - Additional Topics in Cryptology. Computer Science and Engineering Prices are subject to change without prior notice These titles are for sale only in India, Pakistan, Bangladesh, Sri Lanka and Nepal. Sale outside the designated territory is strictly prohibited. springer.com Highlights 3 Analysis and Design of Information Systems, 3e Arthur M. Langer, Columbia University, New York, NY, USA About the Book In any software design project, the analysis stage – documenting and designing technical requirements for the needs of users - is vital to the success of the project. This book provides a thorough introduction and survey to all aspects of analysis. This edition provides new features including: Additional chapters on system Development Life Cycle and Data Element Naming Conventions and Standards; more coverage on converting logical models to physical models, how to generate DDL and testing database functionalities; ISBN: 9788132204404 expansion of database section with concepts such as denormalization, security and change control; Page: XIV, 418 p. 249 developments on new design and technologies, particularly in the area of web analysis and design. A illus. revised Web/Commerce chapter addresses component middleware for complex systems design; new Case Price: ` 499.00 Studies. This book is a valuable resource and guide for all information systems students, practitioners and Market: Open professionals who need an in-depth understanding of the principles of the analysis and design process. Reprint