top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Computational science and engineering / / editors, Arpan Deyasi, Department of Electronics and Communication Engineering, RCC Institute of Information Technology, Kolkata, West Bengal, India, Soumen Mukherjee, Department of Computer Application
Computational science and engineering / / editors, Arpan Deyasi, Department of Electronics and Communication Engineering, RCC Institute of Information Technology, Kolkata, West Bengal, India, Soumen Mukherjee, Department of Computer Application
Pubbl/distr/stampa London : , : Taylor & Francis Group, , [2017]
Descrizione fisica 1 online resource (355 pages) : illustrations
Disciplina 004
Soggetto topico High performance computing
ISBN 1-315-34932-9
1-315-37502-8
1-4987-8461-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Technical session I : VLSI and MEMS -- Track II : distributing system and ICT -- Track III : medical instrument based system -- Track IV : image processing -- Track V : communication and embedded system -- Track VI : soft computing -- Track VII : antenna design and wave propagation -- Track VIII : heterojunction devices and circuits -- Track IX : quantum and photonic devices -- Track X : wireless communication and computer vision -- Track XI : image processing and system security.
Record Nr. UNINA-9910155242003321
London : , : Taylor & Francis Group, , [2017]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Concepts of programming languages [[electronic resource] /] / Robert W. Sebesta ; global edition contributions by Soumen Mukherjee, Arup Kumar Bhattacharjee
Concepts of programming languages [[electronic resource] /] / Robert W. Sebesta ; global edition contributions by Soumen Mukherjee, Arup Kumar Bhattacharjee
Autore Sebesta Robert W.
Edizione [Eleventh, global edition.]
Pubbl/distr/stampa Boston : , : Pearson, , 2016
Descrizione fisica 1 online resource (785 pages) : illustrations (some color)
Disciplina 005.13
Collana Always Learning
Soggetto topico Programming languages (Electronic computers)
ISBN 9781292100562
9781292100555
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910154762703321
Sebesta Robert W.  
Boston : , : Pearson, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Distributed systems : concepts and design / / George Coulouris [and five others]
Distributed systems : concepts and design / / George Coulouris [and five others]
Autore Coulouris George F.
Edizione [Fifth edition.]
Pubbl/distr/stampa Boston : , : Addison-Wesley, , [2012]
Descrizione fisica 1 online resource (1,064 pages) : illustrations
Disciplina 004.36
Altri autori (Persone) BhattacharjeeArup Kumar
MukherjeeSoumen
Soggetto topico Electronic data processing - Distributed processing
Distributed operating systems (Computers)
ISBN 1-4479-3017-7
9781447930174
9780273760597
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover -- CONTENTS -- PREFACE -- 1 CHARACTERIZATION OF DISTRIBUTED SYSTEMS -- 1.1 Introduction -- 1.2 Examples of distributed systems -- 1.3 Trends in distributed systems -- 1.4 Focus on resource sharing -- 1.5 Challenges -- 1.6 Case study: The World Wide Web -- 1.7 Summary -- 2 SYSTEM MODELS -- 2.1 Introduction -- 2.2 Physical models -- 2.3 Architectural models -- 2.4 Fundamental models -- 2.5 Summary -- 3 NETWORKING AND INTERNETWORKING -- 3.1 Introduction -- 3.2 Types of network -- 3.3 Network principles -- 3.4 Internet protocols -- 3.5 Case studies: Ethernet, WiFi and Bluetooth -- 3.6 Summary -- 4 INTERPROCESS COMMUNICATION -- 4.1 Introduction -- 4.2 The API for the Internet protocols -- 4.3 External data representation and marshalling -- 4.4 Multicast communication -- 4.5 Network virtualization: Overlay networks -- 4.6 Case study: MPI -- 4.7 Summary -- 5 REMOTE INVOCATION -- 5.1 Introduction -- 5.2 Request-reply protocols -- 5.3 Remote procedure call -- 5.4 Remote method invocation -- 5.5 Case study: Java RMI -- 5.6 Summary -- 6 INDIRECT COMMUNICATION -- 6.1 Introduction -- 6.2 Group communication -- 6.3 Publish-subscribe systems -- 6.4 Message queues -- 6.5 Shared memory approaches -- 6.6 Summary -- 7 OPERATING SYSTEM SUPPORT -- 7.1 Introduction -- 7.2 The operating system layer -- 7.3 Protection -- 7.4 Processes and threads -- 7.5 Communication and invocation -- 7.6 Operating system architecture -- 7.7 Virtualization at the operating system level -- 7.8 Summary -- 8 DISTRIBUTED OBJECTS AND COMPONENTS -- 8.1 Introduction -- 8.2 Distributed objects -- 8.3 Case study: CORBA -- 8.4 From objects to components -- 8.5 Case studies: Enterprise JavaBeans and Fractal -- 8.6 Summary -- 9 WEB SERVICES -- 9.1 Introduction -- 9.2 Web services -- 9.3 Service descriptions and IDL for web services -- 9.4 A directory service for use with web services -- 9.5 XML security -- 9.6 Coordination of web services -- 9.7 Applications of web services -- 9.8 Summary -- 10 PEER-TO-PEER SYSTEMS -- 10.1 Introduction -- 10.2 Napster and its legacy -- 10.3 Peer-to-peer middleware -- 10.4 Routing overlays -- 10.5 Overlay case studies: Pastry, Tapestry -- 10.6 Application case studies: Squirrel, OceanStore, Ivy -- 10.7 Summary -- 11 SECURITY -- 11.1 Introduction -- 11.2 Overview of security techniques -- 11.3 Cryptographic algorithms -- 11.4 Digital signatures -- 11.5 Cryptography pragmatics -- 11.6 Case studies: Needham-Schroeder, Kerberos, TLS, 802.11 WiFi -- 11.7 Summary -- 12 DISTRIBUTED FILE SYSTEMS -- 12.1 Introduction -- 12.2 File service architecture -- 12.3 Case study: Sun Network File System -- 12.4 Case study: The Andrew File System -- 12.5 Enhancements and further developments -- 12.6 Summary -- 13 NAME SERVICES -- 13.1 Introduction -- 13.2 Name services and the Domain Name System -- 13.3 Directory services -- 13.4 Case study: The Global Name Service -- 13.5 Case study: The X.500 Directory Service -- 13.6 Summary -- 14 TIME AND GLOBAL STATES -- 14.1 Introduction -- 14.2 Clocks, events and process states -- 14.3 Synchronizing physical clocks -- 14.4 Logical time and logical clocks -- 14.5 Global states -- 14.6 Distributed debugging -- 14.7 Summary -- 15 COORDINATION AND AGREEMENT -- 15.1 Introduction -- 15.2 Distributed mutual exclusion -- 15.3 Elections -- 15.4 Coordination and agreement in group communication -- 15.5 Consensus and related problems -- 15.6 Summary -- 16 TRANSACTIONS AND CONCURRENCY CONTROL -- 16.1 Introduction -- 16.2 Transactions -- 16.3 Nested transactions -- 16.4 Locks -- 16.5 Optimistic concurrency control -- 16.6 Timestamp ordering -- 16.7 Comparison of methods for concurrency control -- 16.8 Summary -- 17 DISTRIBUTED TRANSACTIONS -- 17.1 Introduction -- 17.2 Flat and nested distributed transactions -- 17.3 Atomic commit protocols -- 17.4 Concurrency control in distributed transactions -- 17.5 Distributed deadlocks -- 17.6 Transaction recovery -- 17.7 Summary -- 18 REPLICATION -- 18.1 Introduction -- 18.2 System model and the role of group communication -- 18.3 Fault-tolerant services -- 18.4 Case studies of highly available services: The gossip architecture, Bayou and Coda -- 18.5 Transactions with replicated data -- 18.6 Summary -- 19 MOBILE AND UBIQUITOUS COMPUTING -- 19.1 Introduction -- 19.2 Association -- 19.3 Interoperation -- 19.4 Sensing and context awareness -- 19.5 Security and privacy -- 19.6 Adaptation -- 19.7 Case study: Cooltown -- 19.8 Summary -- 20 DISTRIBUTED MULTIMEDIA SYSTEMS -- 20.1 Introduction -- 20.2 Characteristics of multimedia data -- 20.3 Quality of service management -- 20.4 Resource management -- 20.5 Stream adaptation -- 20.6 Case studies: Tiger, BitTorrent and End System Multicast -- 20.7 Summary -- 21 DESIGNING DISTRIBUTED SYSTEMS: GOOGLE CASE STUDY -- 21.1 Introduction -- 21.2 Introducing the case study: Google -- 21.3 Overall architecture and design philosophy -- 21.4 Underlying communication paradigms -- 21.5 Data storage and coordination services -- 21.6 Distributed computation services -- 21.7 Summary -- REFERENCES -- INDEX.
Record Nr. UNINA-9910151656503321
Coulouris George F.  
Boston : , : Addison-Wesley, , [2012]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Internet & world wide web : how to program / / Paul Deitel, Harvey Deitel, Abbey Deitel ; international edition contributions by Soumen Mukherjee, Arup Kumar Bhattacharjee
Internet & world wide web : how to program / / Paul Deitel, Harvey Deitel, Abbey Deitel ; international edition contributions by Soumen Mukherjee, Arup Kumar Bhattacharjee
Autore Deitel Paul J.
Edizione [Fifth edition.]
Pubbl/distr/stampa Boston : , : Deitel : , : Pearson, , [2012]
Descrizione fisica 1 online resource (955 pages) : illustrations
Disciplina 006.7/6
Collana Always Learning
Soggetto topico Internet programming
ISBN 1-292-01406-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover -- Title -- Contents -- Preface -- Before You Begin -- 1 Introduction to Computers and the Internet -- 1.1 Introduction -- 1.2 The Internet in Industry and Research -- 1.3 HTML5, CSS3, JavaScript, Canvas and jQuery -- 1.4 Demos -- 1.5 Evolution of the Internet and World Wide Web -- 1.6 Web Basics -- 1.7 Multitier Application Architecture -- 1.8 Client-Side Scripting versus Server-Side Scripting -- 1.9 World Wide Web Consortium (W3C) -- 1.10 Web 2.0: Going Social -- 1.11 Data Hierarchy -- 1.12 Operating Systems -- 1.12.1 Desktop and Notebook Operating Systems -- 1.12.2 Mobile Operating Systems -- 1.13 Types of Programming Languages -- 1.14 Object Technology -- 1.15 Keeping Up-to-Date with Information Technologies -- 2 Introduction to HTML5: Part 1 -- 2.1 Introduction -- 2.2 Editing HTML5 -- 2.3 First HTML5 Example -- 2.4 W3C HTML5 Validation Service -- 2.5 Headings -- 2.6 Linking -- 2.7 Images -- 2.7.1 alt Attribute -- 2.7.2 Void Elements -- 2.7.3 Using Images as Hyperlinks -- 2.8 Special Characters and Horizontal Rules -- 2.9 Lists -- 2.10 Tables -- 2.11 Forms -- 2.12 Internal Linking -- 2.13 meta Elements -- 2.14 Web Resources -- 3 Introduction to HTML5: Part 2 -- 3.1 Introduction -- 3.2 New HTML5 Form input Types -- 3.2.1 input Type color -- 3.2.2 input Type date -- 3.2.3 input Type datetime -- 3.2.4 input Type datetime-local -- 3.2.5 input Type email -- 3.2.6 input Type month -- 3.2.7 input Type number -- 3.2.8 input Type range -- 3.2.9 input Type search -- 3.2.10 input Type tel -- 3.2.11 input Type time -- 3.2.12 input Type url -- 3.2.13 input Type week -- 3.3 input and datalist Elements and autocomplete Attribute -- 3.3.1 input Element autocomplete Attribute -- 3.3.2 datalist Element -- 3.4 Page-Structure Elements -- 3.4.1 header Element -- 3.4.2 nav Element -- 3.4.3 figure Element and figcaption Element -- 3.4.4 article Element.
3.4.5 summary Element and details Element -- 3.4.6 section Element -- 3.4.7 aside Element -- 3.4.8 meter Element -- 3.4.9 footer Element -- 3.4.10 Text-Level Semantics: mark Element and wbr Element -- 4 Introduction to Cascading Style Sheets™(CSS): Part 1 -- 4.1 Introduction -- 4.2 Inline Styles -- 4.3 Embedded Style Sheets -- 4.4 Conflicting Styles -- 4.5 Linking External Style Sheets -- 4.6 Positioning Elements: Absolute Positioning, z-index -- 4.7 Positioning Elements: Relative Positioning, span -- 4.8 Backgrounds -- 4.9 Element Dimensions -- 4.10 Box Model and Text Flow -- 4.11 Media Types and Media Queries -- 4.12 Drop-Down Menus -- 4.13 (Optional) User Style Sheets -- 4.14 Web Resources -- 5 Introduction to Cascading Style Sheets™(CSS): Part 2 -- 5.1 Introduction -- 5.2 Text Shadows -- 5.3 Rounded Corners -- 5.4 Color -- 5.5 Box Shadows -- 5.6 Linear Gradients -- Introducing Vendor Prefixes -- 5.7 Radial Gradients -- 5.8 (Optional: WebKit Only) Text Stroke -- 5.9 Multiple Background Images -- 5.10 (Optional: WebKit Only) Reflections -- 5.11 Image Borders -- 5.12 Animation -- Selectors -- 5.13 Transitions and Transformations -- 5.13.1 transition and transform Properties -- 5.13.2 Skew -- 5.13.3 Transitioning Between Images -- 5.14 Downloading Web Fonts and the @font-face Rule -- 5.15 Flexible Box Layout Module and :nth-child Selectors -- 5.16 Multicolumn Layout -- 5.17 Media Queries -- 5.18 Web Resources -- 6 JavaScript: Introduction to Scripting -- 6.1 Introduction -- 6.2 Your First Script: Displaying a Line of Text with JavaScript in a Web Page -- 6.3 Modifying Your First Script -- 6.4 Obtaining User Input with prompt Dialogs -- 6.4.1 Dynamic Welcome Page -- 6.4.2 Adding Integers -- 6.5 Memory Concepts -- 6.6 Arithmetic -- 6.7 Decision Making: Equality and Relational Operators -- 6.8 Web Resources -- 7 JavaScript: Control Statements I.
7.1 Introduction -- 7.2 Algorithms -- 7.3 Pseudocode -- 7.4 Control Statements -- 7.5 if Selection Statement -- 7.6 if...else Selection Statement -- 7.7 while Repetition Statement -- 7.8 Formulating Algorithms: Counter-Controlled Repetition -- 7.9 Formulating Algorithms: Sentinel-Controlled Repetition -- 7.10 Formulating Algorithms: Nested Control Statements -- 7.11 Assignment Operators -- 7.12 Increment and Decrement Operators -- 7.13 Web Resources -- 8 JavaScript: Control Statements II -- 8.1 Introduction -- 8.2 Essentials of Counter-Controlled Repetition -- 8.3 for Repetition Statement -- 8.4 Examples Using the for Statement -- 8.5 switch Multiple-Selection Statement -- 8.6 do...while Repetition Statement -- 8.7 break and continue Statements -- 8.8 Logical Operators -- 8.9 Web Resources -- 9 JavaScript: Functions -- 9.1 Introduction -- 9.2 Program Modules in JavaScript -- 9.3 Function Definitions -- 9.3.1 Programmer-Defined Function square -- 9.3.2 Programmer-Defined Function maximum -- 9.4 Notes on Programmer-Defined Functions -- 9.5 Random Number Generation -- 9.5.1 Scaling and Shifting Random Numbers -- 9.5.2 Displaying Random Images -- 9.5.3 Rolling Dice Repeatedly and Displaying Statistics -- 9.6 Example: Game of Chance -- Introducing the HTML5audio and video Elements -- 9.7 Scope Rules -- 9.8 JavaScript Global Functions -- 9.9 Recursion -- 9.10 Recursion vs. Iteration -- 10 JavaScript: Arrays -- 10.1 Introduction -- 10.2 Arrays -- 10.3 Declaring and Allocating Arrays -- 10.4 Examples Using Arrays -- 10.4.1 Creating, Initializing and Growing Arrays -- 10.4.2 Initializing Arrays with Initializer Lists -- 10.4.3 Summing the Elements of an Array with for and for...in -- 10.4.4 Using the Elements of an Array as Counters -- 10.5 Random Image Generator Using Arrays -- 10.6 References and Reference Parameters -- 10.7 Passing Arrays to Functions.
10.8 Sorting Arrays with Array Method sort -- 10.9 Searching Arrays with Array Method indexOf -- 10.10 Multidimensional Arrays -- 11 JavaScript: Objects -- 11.1 Introduction -- 11.2 Math Object -- 11.3 String Object -- 11.3.1 Fundamentals of Characters and Strings -- 11.3.2 Methods of the String Object -- 11.3.3 Character-Processing Methods -- 11.3.4 Searching Methods -- 11.3.5 Splitting Strings and Obtaining Substrings -- 11.4 Date Object -- 11.5 Boolean and Number Objects -- 11.6 document Object -- 11.7 Favorite Twitter Searches: HTML5 Web Storage -- 11.8 Using JSON to Represent Objects -- 12 Document Object Model (DOM):Objects and Collections -- 12.1 Introduction -- 12.2 Modeling a Document: DOM Nodes and Trees -- 12.3 Traversing and Modifying a DOM Tree -- 12.4 DOM Collections -- 12.5 Dynamic Styles -- 12.6 Using a Timer and Dynamic Styles to Create Animated Effects -- 13 JavaScript Event Handling: A Deeper Look -- 13.1 Introduction -- 13.2 Reviewing the load Event -- 13.3 Event mousemove and the event Object -- 13.4 Rollovers with mouseover and mouseout -- 13.5 Form Processing with focus and blur -- 13.6 More Form Processing with submit and reset -- 13.7 Event Bubbling -- 13.8 More Events -- 13.9 Web Resource -- 14 HTML5: Introduction to canvas -- 14.1 Introduction -- 14.2 canvas Coordinate System -- 14.3 Rectangles -- 14.4 Using Paths to Draw Lines -- 14.5 Drawing Arcs and Circles -- 14.6 Shadows -- 14.7 Quadratic Curves -- 14.8 Bezier Curves -- 14.9 Linear Gradients -- 14.10 Radial Gradients -- 14.11 Images -- 14.12 Image Manipulation: Processing the Individual Pixels of a canvas -- 14.13 Patterns -- 14.14 Transformations -- 14.14.1 scale and translate Methods: Drawing Ellipses -- 14.14.2 rotate Method: Creating an Animation -- 14.14.3 transform Method: Drawing Skewed Rectangles -- 14.15 Text.
14.16 Resizing the canvas to Fill the Browser Window -- 14.17 Alpha Transparency -- 14.18 Compositing -- 14.19 Cannon Game -- 14.19.1 HTML5 Document -- 14.19.2 Instance Variables and Constants -- 14.19.3 Function setupGame -- 14.19.4 Functions startTimer and stopTimer -- 14.19.5 Function resetElements -- 14.19.6 Function newGame -- 14.19.7 Function updatePositions: Manual Frame-by-FrameAnimation and Simple Collision Detection -- 14.19.8 Function fireCannonball -- 14.19.9 Function alignCannon -- 14.19.10Function draw -- 14.19.11Function showGameOverDialog -- 14.20 save and restore Methods -- 14.21 A Note on SVG -- 14.22 A Note on canvas35D -- 15 XML -- 15.1 Introduction -- 15.2 XML Basics -- 15.3 Structuring Data -- 15.4 XML Namespaces -- 15.5 Document Type Definitions (DTDs) -- 15.6 W3C XML Schema Documents -- 15.7 XML Vocabularies -- 15.7.1 MathML™ -- 15.7.2 Other Markup Languages -- 15.8 Extensible Stylesheet Language and XSL Transformations -- 15.9 Document Object Model (DOM) -- 15.10 Web Resources -- 16 Ajax-Enabled Rich Internet Applicationswith XML and JSON -- 16.1 Introduction -- 16.1.1 Traditional Web Applications vs. Ajax Applications -- 16.1.2 Traditional Web Applications -- 16.1.3 Ajax Web Applications -- 16.2 Rich Internet Applications (RIAs) with Ajax -- 16.3 History of Ajax -- 16.4 "Raw" Ajax Example Using the XMLHttpRequest Object -- 16.4.1 Asynchronous Requests -- 16.4.2 Exception Handling -- 16.4.3 Callback Functions -- 16.4.4 XMLHttpRequest Object Event, Properties and Methods -- 16.5 Using XML and the DOM -- 16.6 Creating a Full-Scale Ajax-Enabled Application -- 16.6.1 Using JSON -- 16.6.2 Rich Functionality -- 16.6.3 Interacting with a Web Service on the Server -- 16.6.4 Parsing JSON Data -- 16.6.5 Creating HTML5 Elements and Setting Event Handlers on the Fly -- 16.6.6 Implementing Type-Ahead.
16.6.7 Implementing a Form with Asynchronous Validation.
Altri titoli varianti Internet and world wide web
Record Nr. UNINA-9910153151203321
Deitel Paul J.  
Boston : , : Deitel : , : Pearson, , [2012]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Introduction to the design & analysis of algorithms / / Anany Levitin ; international edition contributions by Soumen Mukherjee, Aruf Kumar Bhattacharjee
Introduction to the design & analysis of algorithms / / Anany Levitin ; international edition contributions by Soumen Mukherjee, Aruf Kumar Bhattacharjee
Autore Levitin Anany
Edizione [Third edition.]
Pubbl/distr/stampa Boston : , : Pearson, , 2012
Descrizione fisica 1 online resource (589 pages) : illustrations
Disciplina 005.1
Soggetto topico Computer algorithms
ISBN 9781292014111
9780273764113
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover -- Title Page -- Contents -- New to the Third Edition -- Preface -- 1 Introduction -- 1.1 What Is an Algorithm? -- Exercises 1.1 -- 1.2 Fundamentals of Algorithmic Problem Solving -- Understanding the Problem -- Ascertaining the Capabilities of the Computational Device -- Choosing between Exact and Approximate Problem Solving -- Algorithm Design Techniques -- Designing an Algorithm and Data Structures -- Methods of Specifying an Algorithm -- Proving an Algorithm's Correctness -- Analyzing an Algorithm -- Coding an Algorithm -- Exercises 1.2 -- 1.3 Important Problem Types -- Sorting -- Searching -- String Processing -- Graph Problems -- Combinatorial Problems -- Geometric Problems -- Numerical Problems -- Exercises 1.3 -- 1.4 Fundamental Data Structures -- Linear Data Structures -- Graphs -- Trees -- Sets and Dictionaries -- Exercises 1.4 -- Summary -- 2 Fundamentals of the Analysis of Algorithm Efficiency -- 2.1 The Analysis Framework 68 -- Measuring an Input's Size -- Units for Measuring Running Time -- Orders of Growth -- Worst-Case, Best-Case, and Average-Case Efficiencies -- Recapitulation of the Analysis Framework -- Exercises 2.1 -- 2.2 Asymptotic Notations and Basic Efficiency Classes -- Informal Introduction -- O-notation -- Ω-notation -- Θ-notation -- Useful Property Involving the Asymptotic Notations -- Using Limits for Comparing Orders of Growth -- Basic Efficiency Classes -- Exercises 2.2 -- 2.3 Mathematical Analysis of Nonrecursive Algorithms -- Exercises 2.3 -- 2.4 Mathematical Analysis of Recursive Algorithms -- Exercises 2.4 -- 2.5 Example: Computing the nth Fibonacci Number -- Exercises 2.5 -- 2.6 Empirical Analysis of Algorithms -- Exercises 2.6 -- 2.7 Algorithm Visualization -- Summary -- 3 Brute Force and Exhaustive Search -- 3.1 Selection Sort and Bubble Sort -- Selection Sort -- Bubble Sort -- Exercises 3.1.
3.2 Sequential Search and Brute-Force String Matching -- Sequential Search -- Brute-Force String Matching -- Exercises 3.2 -- 3.3 Closest-Pair and Convex-Hull Problems by Brute Force -- Closest-Pair Problem -- Convex-Hull Problem -- Exercises 3.3 -- 3.4 Exhaustive Search -- Traveling Salesman Problem -- Knapsack Problem -- Assignment Problem -- Exercises 3.4 -- 3.5 Depth-First Search and Breadth-First Search -- Depth-First Search -- Breadth-First Search -- Exercises 3.5 -- Summary -- 4 Decrease-and-Conquer -- 4.1 Insertion Sort -- Exercises 4.1 -- 4.2 Topological Sorting -- Exercises 4.2 -- 4.3 Algorithms for Generating Combinatorial Objects -- Generating Permutations -- Generating Subsets -- Exercises 4.3 -- 4.4 Decrease-by-a-Constant-Factor Algorithms -- Binary Search -- Fake-Coin Problem -- Russian Peasant Multiplication -- Josephus Problem -- Exercises 4.4 -- 4.5 Variable-Size-Decrease Algorithms -- Computing a Median and the -- Interpolation Search -- Searching and Insertion in a Binary Search Tree -- The Game of Nim -- Exercises 4.5 -- Summary -- 5 Divide-and-Conquer -- 5.1 Mergesort -- Exercises 5.1 -- 5.2 Quicksort -- Exercises 5.2 -- 5.3 Binary Tree Traversals and Related Properties -- Exercises 5.3 -- 5.4 Multiplication of Large Integers and Strassen's Matrix Multiplication -- Multiplication of Large Integers -- Strassen's Matrix Multiplication -- Exercises 5.4 -- 5.5 The Closest-Pair and Convex-Hull Problems by Divide-and-Conquer -- The Closest-Pair Problem -- Convex-Hull Problem -- Exercises 5.5 -- Summary -- 6 Transform-and-Conquer -- 6.1 Presorting -- Exercises 6.1 -- 6.2 Gaussian Elimination -- LU Decomposition -- Computing a Matrix Inverse -- Computing a Determinant -- Exercises 6.2 -- 6.3 Balanced Search Trees -- AVL Trees -- 2-3 Trees -- Exercises 6.3 -- 6.4 Heaps and Heapsort -- Notion of the Heap -- Heapsort -- Exercises 6.4.
6.5 Horner's Rule and Binary Exponentiation -- Horner's Rule -- Binary Exponentiation -- Exercises 6.5 -- 6.6 Problem Reduction -- Computing the Least Common Multiple -- Counting Paths in a Graph -- Reduction of Optimization Problems -- Linear Programming -- Reduction to Graph Problems -- Exercises 6.6 -- Summary -- 7 Space and Time Trade-Offs -- 7.1 Sorting by Counting -- Exercises 7.1 -- 7.2 Input Enhancement in String Matching -- Horspool's Algorithm -- Boyer-Moore Algorithm -- Exercises 7.2 -- 7.3 Hashing -- Open Hashing (Separate Chaining) -- Closed Hashing (Open Addressing) -- Exercises 7.3 -- 7.4 B-Trees -- Exercises 7.4 -- Summary -- 8 Dynamic Programming -- 8.1 Three Basic Examples -- Exercises 8.1 -- 8.2 The Knapsack Problem and Memory Functions -- Memory Functions -- Exercises 8.2 -- 8.3 Optimal Binary Search Trees -- Exercises 8.3 -- 8.4 Warshall's and Floyd's Algorithms -- Warshall's Algorithm -- Floyd's Algorithm for the All-Pairs Shortest-Paths Problem -- Exercises 8.4 -- Summary -- 9 Greedy Technique -- 9.1 Prim's Algorithm -- Exercises 9.1 -- 9.2 Kruskal's Algorithm -- Disjoint Subsets and Union-Find Algorithms -- Exercises 9.2 -- 9.3 Dijkstra's Algorithm -- Exercises 9.3 -- 9.4 Huffman Trees and Codes -- Exercises 9.4 -- Summary -- 10 Iterative Improvement -- 10.1 The Simplex Method -- Geometric Interpretation of Linear Programming -- An Outline of the Simplex Method -- Further Notes on the Simplex Method -- Exercises 10.1 -- 10.2 The Maximum-Flow Problem -- Exercises 10.2 -- 10.3 Maximum Matching in Bipartite Graphs -- Exercises 10.3 -- 10.4 The Stable Marriage Problem -- Exercises 10.4 -- Summary -- 11 Limitations of Algorithm Power -- 11.1 Lower-Bound Arguments -- Trivial Lower Bounds -- Information-Theoretic Arguments -- Adversary Arguments -- Problem Reduction -- Exercises 11.1 -- 11.2 Decision Trees.
Decision Trees for Sorting -- Decision Trees for Searching a Sorted Array -- Exercises 11.2 -- 11.3 P, NP, and NP-Complete Problems -- P and NP Problems -- NP-Complete Problems -- Exercises 11.3 -- 11.4 Challenges of Numerical Algorithms -- Exercises 11.4 -- Summary -- 12 Coping with the Limitations of Algorithm Power -- 12.1 Backtracking -- n-Queens Problem -- Hamiltonian Circuit Problem -- Subset-Sum Problem -- General Remarks -- Exercises 12.1 -- 12.2 Branch-and-Bound -- Assignment Problem -- Knapsack Problem -- Traveling Salesman Problem -- Exercises 12.2 -- 12.3 Approximation Algorithms for NP-Hard Problems -- Approximation Algorithms for the Traveling Salesman Problem -- Approximation Algorithms for the Knapsack Problem -- Exercises 12.3 -- 12.4 Algorithms for Solving Nonlinear Equations -- Bisection Method -- Method of False Position -- Newton's Method -- Exercises 12.4 -- Summary -- Epilogue -- APPENDIX A -- Useful Formulas for the Analysis of Algorithms -- Properties of Logarithms -- Combinatorics -- Important Summation Formulas -- Sum Manipulation Rules -- Approximation of a Sum by a Definite Integral -- Floor and Ceiling Formulas -- Miscellaneous -- APPENDIX B -- Short Tutorial on Recurrence Relations -- Sequences and Recurrence Relations -- Methods for Solving Recurrence Relations -- Common Recurrence Types in Algorithm Analysis -- References -- Hints to Exercises -- Index -- Numbers and Symbols.
Altri titoli varianti Introduction to the design and analysis of algorithms
Record Nr. UNINA-9910153150703321
Levitin Anany  
Boston : , : Pearson, , 2012
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Java : an introduction to problem solving & programming / / Walter Savitch ; contributor, Kenrick Mock ; global edition contributors, Arup Bhattacharjee, Soumen Mukherjee
Java : an introduction to problem solving & programming / / Walter Savitch ; contributor, Kenrick Mock ; global edition contributors, Arup Bhattacharjee, Soumen Mukherjee
Autore Savitch Walter J. <1943->
Edizione [Seventh, Global edition.]
Pubbl/distr/stampa Boston : , : Pearson, , [2015]
Descrizione fisica 1 online resource (1,024 pages) : illustrations
Disciplina 005.133
Collana Always Learning
Soggetto topico Java (Computer program language)
ISBN 1-292-06989-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Cover -- Preface for Instructors -- Preface for Students -- Acknowledgments -- Dependency Chart -- Brief Contents -- Contents -- Chapter 1: Introduction to Computers and Java -- 1.1 Computer Basics -- Hardware and Memory -- Programs -- Programming Languages, Compilers, and Interpreters -- Java Bytecode -- Class Loader -- 1.2 A Sip of Java -- History of the Java Language -- Applications and Applets -- A First Java Application Program -- Writing, Compiling, and Running a Java Program -- 1.3 Programming Basics -- Object-Oriented Programming -- Algorithms -- Testing and Debugging -- Software Reuse -- 1.4 Graphics Supplement -- A Sample Graphics Applet -- Size and Position of Figures -- Drawing Ovals and Circles -- Drawing Arcs -- Running an Applet -- Chapter Summary -- Chapter 2: Basic Computation -- 2.1 Variables and Expressions -- Variables -- Data Types -- Java Identifiers -- Assignment Statements -- Simple Input -- Simple Screen Output -- Constants -- Named Constants -- Assignment Compatibilities -- Type Casting -- Arithmetic Operators -- Parentheses and Precedence Rules -- Specialized Assignment Operators -- Case Study: Vending Machine Change -- Increment and Decrement Operators -- More About the Increment and Decrement Operators -- 2.2 The Class String -- String Constants and Variables -- Concatenation of Strings -- String Methods -- String Processing -- Escape Characters -- The Unicode Character Set -- 2.3 Keyboard and Screen I/O -- Screen Output -- Keyboard Input -- Other Input Delimiters (Optional) -- Formatted Output with printf (Optional) -- 2.4 Documentation and Style -- Meaningful Variable Names -- Comments -- Indentation -- Using Named Constants -- 2.5 Graphics Supplement -- Style Rules Applied to a Graphics Applet -- Creating a Java GUI Application with the JFrame Class -- Introducing the Class JOptionPane.
Reading Input as Other Numeric Types -- Programming Example: Change-Making Program with Windowing I/O -- Chapter Summary -- Chapter 3: Flow of Control: Branching -- 3.1 The if-else Statement -- The Basic if-else Statement -- Boolean Expressions -- Comparing Strings -- Nested if-else Statements -- Multibranch if-else Statements -- Programming Example: Assigning Letter Grades -- Case Study: Body Mass Index -- The Conditional Operator (Optional) -- The exit Method -- 3.2 The Type boolean -- Boolean Variables -- Precedence Rules -- Input and Output of Boolean Values -- 3.3 The switch Statement -- Enumerations -- 3.4 Graphics Supplement -- Specifying a Drawing Color -- A Dialog Box for a Yes-or-No Question -- Chapter Summary -- Chapter 4: Flow of Control: Loops -- 4.1 Java Loop Statements -- The while Statement -- The do-while Statement -- Programming Example: Bug Infestation -- Programming Example: Nested Loops -- The for Statement -- Declaring Variables Within a for Statement -- Using a Comma in a for Statement (Optional) -- The for-each Statement -- 4.2 Programming With Loops -- The Loop Body -- Initializing Statements -- Controlling the Number of Loop Iterations -- Case Study: Using a Boolean Variable to End a Loop -- Programming Example: Spending Spree -- The break Statement and continue Statement in Loops (Optional) -- Loop Bugs -- Tracing Variables -- Assertion Checks -- 4.3 Graphics Supplement -- Programming Example: A Multiface Applet -- The drawString Method -- Chapter Summary -- Chapter 5: Defining Classes and Methods -- 5.1 Class and Method Definitions -- Class Files and Separate Compilation -- Programming Example: Implementing a Dog Class -- Instance Variables -- Methods -- Defining void Methods -- Defining Methods That Return a Value -- Programming Example: First Try at Implementing a Species Class -- The Keyword this -- Local Variables.
Blocks -- Parameters of a Primitive Type -- 5.2 Information Hiding and Encapsulation -- Information Hiding -- Precondition and Postcondition Comments -- The public and private Modifiers -- Programming Example: A Demonstration of Why Instance Variables Should Be Private -- Programming Example: Another Implementation of a Class of Rectangles -- Accessor Methods and Mutator Methods -- Methods Calling Methods -- Programming Example: A Purchase Class -- Encapsulation -- Automatic Documentation with javadoc -- UML Class Diagrams -- 5.3 Objects and References -- Variables of a Class Type -- Defining an equals Method for a Class -- Programming Example: A Species Class -- Boolean-Valued Methods -- Case Study: Unit Testing -- Parameters of a Class Type -- Programming Example: Class-Type Parameters Versus Primitive-Type Parameters -- 5.4 Graphics Supplement -- The Graphics Class -- Programming Example: Multiple Faces, but with a Helping Method -- The Graphics2D Class and the Java2DTM API -- The init Method -- Adding Labels to an Applet -- Chapter Summary -- Chapter 6: More About Objects and Methods -- 6.1 Constructors -- Defining Constructors -- Calling Methods from Constructors -- Calling a Constructor from Other Constructors (Optional) -- 6.2 Static Variables and Static Methods -- Static Variables -- Static Methods -- Dividing the Task of a main Method into Subtasks -- Adding a main Method to a Class -- The Math Class -- Wrapper Classes -- 6.3 Writing Methods -- Case Study: Formatting Output -- Decomposition -- Addressing Compiler Concerns -- Testing Methods -- 6.4 Overloading -- Overloading Basics -- Overloading and Automatic Type Conversion -- Overloading and the Return Type -- Programming Example: A Class for Money -- 6.5 Information Hiding Revisited -- Privacy Leaks -- 6.6 Enumeration as a Class -- 6.7 Packages -- Packages and Importing.
Package Names and Directories -- Name Clashes -- 6.8 Graphics Supplement -- Adding Buttons -- Event-Driven Programming -- Programming Buttons -- Programming Example: A Complete Applet with Buttons -- Adding Icons -- Changing Visibility -- Programming Example: An Example of Changing Visibility -- Chapter Summary -- Chapter 7: Arrays -- 7.1 Array Basics -- Creating and Accessing Arrays -- Array Details -- The Instance Variable length -- More About Array Indices -- Initializing Arrays -- 7.2 Arrays in Classes and Methods -- Case Study: Sales Report -- Indexed Variables as Method Arguments -- Entire Arrays as Arguments to a Method -- Arguments for the Method main -- Array Assignment and Equality -- Methods That Return Arrays -- 7.3 Programming with Arrays and Classes -- Programming Example: A Specialized List Class -- Partially Filled Arrays -- 7.4 Sorting and Searching Arrays -- Selection Sort -- Other Sorting Algorithms -- Searching an Array -- 7.5 Multidimensional Arrays -- Multidimensional-Array Basics -- Multidimensional-Array Parameters and Returned Values -- Java's Representation of Multidimensional Arrays -- Ragged Arrays (Optional) -- Programming Example: Employee Time Records -- 7.6 Graphics Supplement -- Text Areas and Text Fields -- Programming Example: A Question-and-Answer Applet -- The Classes JTextArea and JTextField -- Drawing Polygons -- Chapter Summary -- Chapter 8: Inheritance, Polymorphism, and Interfaces -- 8.1 Inheritance Basics -- Derived Classes -- Overriding Method Definitions -- Overriding Versus Overloading -- The final Modifier -- Private Instance Variables and Private Methods of a Base Class -- UML Inheritance Diagrams -- 8.2 Programming with Inheritance -- Constructors in Derived Classes -- The this Method-Again -- Calling an Overridden Method -- Programming Example: A Derived Class of a Derived Class.
Another Way to Define the equals Method in Undergraduate -- Type Compatibility -- The Class Object -- A Better equals Method -- 8.3 Polymorphism -- Dynamic Binding and Inheritance -- Dynamic Binding with toString -- 8.4 Interfaces and Abstract Classes -- Class Interfaces -- Java Interfaces -- Implementing an Interface -- An Interface as a Type -- Extending an Interface -- Case Study: Character Graphics -- Case Study: The Comparable Interface -- Abstract Classes -- 8.5 Graphics Supplement -- The Class JApplet -- The Class JFrame -- Window Events and Window Listeners -- The ActionListener Interface -- What to Do Next -- Chapter Summary -- Chapter 9: Exception Handling -- 9.1 Basic Exception Handling -- Exceptions in Java -- Predefined Exception Classes -- 9.2 Defining Your Own Exception Classes -- 9.3 More About Exception Classes -- Declaring Exceptions (Passing the Buck) -- Kinds of Exceptions -- Errors -- Multiple Throws and Catches -- The finally Block -- Rethrowing an Exception (Optional) -- Case Study: A Line-Oriented Calculator -- 9.4 Graphics Supplement -- Exceptions in GUIs -- Programming Example: A JFrame GUI Using Exceptions -- Chapter Summary -- Chapter 10: Streams, File I/O, and Networking -- 10.1 An Overview of Streams and File I/O -- The Concept of a Stream -- Why Use Files for I/O? -- Text Files and Binary Files -- 10.2 Text-File I/O -- Creating a Text File -- Appending to a Text File -- Reading from a Text File -- 10.3 Techniques for any File -- The Class File -- Programming Example: Reading a File Name from the Keyboard -- Using Path Names -- Methods of the Class File -- Defining a Method to Open a Stream -- Case Study: Processing a Comma-Separated Values File -- 10.4 Basic Binary-File I/O -- Creating a Binary File -- Writing Primitive Values to a Binary File -- Writing Strings to a Binary File -- Some Details About writeUTF.
Reading from a Binary File.
Record Nr. UNINA-9910154798903321
Savitch Walter J. <1943->  
Boston : , : Pearson, , [2015]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui