#
#

Introduction to Programming Using Python (Record no. 2029)

MARC details
000 -LEADER
fixed length control field 03559nam a22002297a 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20181205104827.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 181205b ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 978-93-325-5184-8
028 ## - PUBLISHER NUMBER
Source Allied Informatics, Jaipur
Bill Number 5670
Bill Date 27/11/2018
Purchase Year 2018-19
040 ## - CATALOGING SOURCE
Original cataloging agency BSDU
Language of cataloging English
Transcribing agency BSDU
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.133
Item number LIA
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Liang, Y. Daniel
245 ## - TITLE STATEMENT
Title Introduction to Programming Using Python
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Chennai
Name of publisher, distributor, etc. Pearson India Education Services Pvt. Ltd.
Date of publication, distribution, etc. 2018; c2017
300 ## - PHYSICAL DESCRIPTION
Extent 557
500 ## - GENERAL NOTE
General note Introduction to Programming Using Python is intended for use in the introduction to programming course.<br/><br/>Daniel Liang is known for his “fundamentals-first” approach to teaching programming concepts and techniques. “Fundamentals-first” means that students learn fundamental programming concepts like selection statements, loops and functions, before moving into defining classes. Students learn basic logic and programming concepts before moving into object-oriented programming and GUI programming. <br/><br/>Another aspect of Introduction to Programming Using Python is that in addition to the typical programming examples that feature games and some math, Liang gives an example or two early in the chapter that uses a simple graphic to engage the students. Rather than asking them to average 10 numbers together, they learn the concepts in the context of a fun example that generates something visually interesting.<br/>Fundamentals-first approach introduces basic programming concepts and techniques on selections, loops, functions, before writing custom classes. Liang introduces and uses objects in Chapter 3, but defining custom classes is covered later in Chapter 7.<br/>Problem-driven approach teaches programming in a problem-driven way that focuses on problem solving rather than syntax. Liang captures students’ interest by using interesting examples in a broad context (areas include math, science, business, financials, gaming, animation and multimedia). Appropriate syntax and libraries are introduced in order to solve the problems.<br/>Flexible GUI Coverage gives instructors the flexibility to skip graphics topics or cover these topics later in the course. The book use Python’s built-in Turtle graphics module in Chapters 1-6 and Tkinter in the rest of the book. Both Turtle and Tkinter are simple, easy to learn and valuable pedagogical tools for teaching the fundamentals of programming and object-oriented programming. GUI Examples are offered early in every chapter and a special set of GUI exercises appears at the end of every chapter.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Contents:<br/>Chapter 1 Introduction to Computers, Programs and Python<br/>Chapter 2 Elementary Programming<br/>Chapter 3 Introduction to Functions, Strings and Objects<br/>Chapter 4 Selections<br/>Chapter 5 Loops<br/>Chapter 6 Functions<br/>Chapter 7 Object-Oriented Programming<br/>Chapter 8 Thinking in Objects<br/>Chapter 9 GUI Programming Using Tkinter<br/>Chapter 10 Lists<br/>Chapter 11 Multi-dimensional Lists<br/>Chapter 12 Inheritance and Polymorphism<br/>Chapter 13 Files and Exception Handling<br/>Chapter 14 Tuples, Sets and Dictionaries<br/>Chapter 15 Recursion<br/><br/>Chapters 16-23 are bonus Web chapters on DS<br/>Chapter 16 Developing Efficient Algorithms<br/>Chapter 17 Sorting<br/>Chapter 18 Linked Lists, Stacks, Queues and Priority Queues<br/>Chapter 19 Binary Search Trees<br/>Chapter 20 AVL Trees<br/>Chapter 21 Hashing<br/>Chapter 22 Graphs and Applications<br/>Chapter 23 Weighted Graphs and Applications
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Science Engineering
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Programming
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Shelving location Date acquired Cost, normal purchase price Total Checkouts Full call number Barcode Date last seen Date last checked out Cost, replacement price Price effective from Koha item type
    Dewey Decimal Classification     BSDU Knowledge Resource Center, Jaipur BSDU Knowledge Resource Center, Jaipur General Stacks 12/05/2018 729.00 10 005.133 LIA 017639 08/14/2023 05/19/2023 729.00 12/05/2018 Books