Learning with Python (Record no. 5007)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05023nam a22002177a 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20230322103746.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 230322b ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9789351198147 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.133 |
| Item number | DOW |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Downey, Allen |
| 245 ## - TITLE STATEMENT | |
| Title | Learning with Python |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Name of publisher, distributor, etc. | Wiley India Pvt. Ltd. |
| Place of publication, distribution, etc. | New Delhi |
| Date of publication, distribution, etc. | 2016 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xxviii, 250 p. |
| 365 ## - TRADE PRICE | |
| Price type code | INR |
| Price amount | 369.00 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | Table of content<br/>1. The way of the program<br/><br/>The Python programming language<br/>What is a program?<br/>What is debugging?<br/>Formal and natural languages<br/>The first program<br/> <br/><br/>2. Variables, expressions and statements<br/><br/>Values and types<br/>Variables<br/>Variable names and keywords<br/>Statements<br/>Evaluating expressions<br/>Operators and operands<br/>Order of operations<br/>Operations on strings<br/>Composition<br/>Comments<br/> <br/><br/>3. Functions<br/><br/>Function calls<br/>Type conversion<br/>Type coercion<br/>Math functions<br/>Composition<br/>Adding new functions<br/>Definitions and use<br/>Flow of execution<br/>Parameters and arguments<br/>Variables and parameters are local<br/>Stack diagrams<br/>Functions with results<br/> <br/><br/> 4. Conditionals and recursion<br/><br/>The modulus operator<br/>Boolean expressions<br/>Logical operators<br/>Conditional execution<br/>Alternative execution<br/>Chained conditionals<br/>Nested conditionals<br/>The return statement<br/>Recursion<br/>Stack diagrams for recursive functions<br/>Infinite recursion<br/>Keyboard input<br/> <br/><br/> 5. Fruitful functions<br/><br/>Return values<br/>Program development<br/>Composition<br/>Boolean functions<br/>More recursion<br/>Leap of faith<br/>One more example<br/>Checking types<br/> <br/><br/>6. Iteration<br/><br/>Multiple assignment<br/>The while statement<br/>Tables<br/>Two-dimensional tables<br/>Encapsulation and generalization<br/>More encapsulation<br/>Local variables<br/>More generalization<br/>Functions<br/> <br/><br/> 7. Strings<br/><br/>A compound data type <br/>Length<br/>Traversal and the for loop<br/>String slices<br/>String comparison<br/>Strings are immutable<br/>A find function<br/>Looping and counting<br/>The string module<br/>Character classification<br/> <br/><br/> 8. Lists<br/><br/>List values<br/>Accessing elements<br/>List length<br/>List membership<br/>Lists and for loops<br/>List operations<br/>List slices<br/>Lists are mutable<br/>List deletion<br/>Objects and values<br/>Aliasing<br/>Cloning lists<br/>List parameters<br/>Nested lists<br/>Matrices<br/>Strings and lists<br/> <br/><br/>9. Tuples<br/><br/>Mutability and tuples<br/>Tuple assignment<br/>Tuples as return values<br/>Random numbers<br/>List of random numbers<br/>Counting<br/>Many buckets<br/>A single-pass solution<br/> <br/><br/> 10. Dictionaries<br/><br/>Dictionary operations<br/>Dictionary methods<br/>Aliasing and copying<br/>Sparse matrices<br/>Hints<br/>Long integers<br/>Counting letters<br/> <br/><br/> 11. Files and exceptions<br/><br/>Text files<br/>Writing variables<br/>Directories<br/>Pickling<br/>Exceptions<br/> <br/><br/>12. Classes and objects<br/><br/>User-defined compound types<br/>Attributes<br/>Instances as arguments<br/>Sameness<br/>Rectangles<br/>Instances as return values<br/>Objects are mutable<br/>Copying<br/> <br/><br/> 13. Classes and functions<br/><br/>Time<br/>Pure functions<br/>Modifiers<br/>Which is better?<br/>Prototype development versus planning<br/>Generalization<br/>Algorithms<br/> <br/><br/> 14. Classes and methods<br/><br/>Object-oriented features<br/>printTime<br/>Another example<br/>A more complicated example<br/>Optional arguments<br/>The initialization method<br/>Points revisited<br/>Operator overloading<br/>Polymorphism<br/><br/>15. Sets of objects<br/><br/>Composition<br/>Card objects<br/>Class attributes and the str method<br/>Comparing cards<br/>Decks<br/>Printing the deck<br/>Shuffling the deck<br/>Removing and dealing cards<br/> <br/><br/>16. Inheritance<br/><br/>Inheritance<br/>A hand of cards <br/>Dealing cards<br/>Printing a Hand<br/>The CardGame class<br/>OldMaidHand class<br/>OldMaidGame class<br/> <br/><br/>17. Linked lists<br/><br/>Embedded references<br/>The Node class<br/>Lists as collections<br/>Lists and recursion<br/>Infinite lists<br/>The fundamental ambiguity theorem<br/>Modifying lists<br/>Wrappers and helpers<br/>The Linked List class<br/>Invariants<br/> <br/><br/> 18. Stacks<br/><br/> Abstract data types<br/> The Stack ADT. . .<br/> Implementing stacks with Python lists<br/> Pushing and popping<br/> Using a stack to evaluate postfix<br/> Parsing<br/> Evaluating postfix<br/> Clients and providers<br/> <br/><br/> 19. Queues<br/><br/>The Queue ADT<br/>Linked Queue<br/>Performance characteristics<br/>Improved Linked Queue<br/>Priority queue<br/>The Golfer class<br/> <br/><br/> 20. Trees<br/><br/>Building trees<br/>Traversing trees<br/>Expression trees<br/>Tree traversal<br/>Building an expression tree<br/>Handling errors<br/>The animal tree<br/> <br/><br/>Debugging<br/><br/> Syntax errors<br/> Runtime errors<br/> Semantic errors<br/> <br/><br/>Creating a new data type<br/><br/>Fraction multiplication<br/>Fraction addition<br/>Euclid’s algorithm<br/>Comparing fractions<br/>Taking it further |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | The book is designed to introduce the important concepts of Python programming language in detail. The reader will be able to develop and execute the programs in Python. This book will also help the readers to learn about Functions, Recursion, Iterative Statements, Strings, Lists, Tuples, Dictionaries, Files and Exceptions, Classes and Objects, Methods, Inheritance, Linked Lists, Stacks, Queues and Trees. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Machine learning |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Python (Computer program language) |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Big data |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Dewey Decimal Classification |
| Koha item type | Book |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Bill No | Bill Date | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Total Checkouts | Full call number | Accession Number | Date last seen | Copy number | Cost, replacement price | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | IT & Decisions Sciences | TB3162 | 16-02-2023 | Indian Institute of Management LRC | Indian Institute of Management LRC | General Stacks | 03/22/2023 | Technical Bureau India Pvt. Ltd. | 258.30 | 005.133 DOW | 004866 | 03/22/2023 | 1 | 369.00 | 03/22/2023 | Book |