Introduction to Programming Using Python plus Pearson MyLab Programming with Pearson eText [Global Edition]
Y. Liang(Author)
Pearson Education Limited (Publisher)
Published on 10. June 2022
Book
Mixed media product
978-1-292-42411-8 (ISBN)
Description
Forintroductory courses in Python Programming and Data Structures.
A fundamentalsfirst approach to programming helps students create efficient, elegantcode
Introductionto Python Programming and Data Structures introducesstudents to basic programming concepts using a fundamentals-first approach thatprepares students to learn object-oriented programming and advanced Pythonprogramming. This approach presents programming concepts and techniques thatinclude control statements, loops, functions, and arrays before designingcustom classes. Students learn basic logic and programming concepts prior tomoving into object-oriented and GUI programming. The content incorporates awide variety of problems with various levels of difficulty and covers manyapplication areas to engage and motivate students.
Forintroductory courses in Python Programming and Data Structures.
A fundamentalsfirst approach to programming helps students create efficient, elegantcode
Introductionto Python Programming and Data Structures introducesstudents to basic programming concepts using a fundamentals-first approach thatprepares students to learn object-oriented programming and advanced Pythonprogramming. This approach presents programming concepts and techniques thatinclude control statements, loops, functions, and arrays before designingcustom classes. Students learn basic logic and programming concepts prior tomoving into object-oriented and GUI programming. The content incorporates awide variety of problems with various levels of difficulty and covers manyapplication areas to engage and motivate students.
A fundamentalsfirst approach to programming helps students create efficient, elegantcode
Introductionto Python Programming and Data Structures introducesstudents to basic programming concepts using a fundamentals-first approach thatprepares students to learn object-oriented programming and advanced Pythonprogramming. This approach presents programming concepts and techniques thatinclude control statements, loops, functions, and arrays before designingcustom classes. Students learn basic logic and programming concepts prior tomoving into object-oriented and GUI programming. The content incorporates awide variety of problems with various levels of difficulty and covers manyapplication areas to engage and motivate students.
Forintroductory courses in Python Programming and Data Structures.
A fundamentalsfirst approach to programming helps students create efficient, elegantcode
Introductionto Python Programming and Data Structures introducesstudents to basic programming concepts using a fundamentals-first approach thatprepares students to learn object-oriented programming and advanced Pythonprogramming. This approach presents programming concepts and techniques thatinclude control statements, loops, functions, and arrays before designingcustom classes. Students learn basic logic and programming concepts prior tomoving into object-oriented and GUI programming. The content incorporates awide variety of problems with various levels of difficulty and covers manyapplication areas to engage and motivate students.
More details
Language
English
Place of publication
Harlow
United Kingdom
Target group
College/higher education
ISBN-13
978-1-292-42411-8 (9781292424118)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Person
Dr. Y.Daniel Liang earned his Ph.D. inComputer Science from the University of Oklahoma in 1991, and an MS and BS inComputer Science from Fudan University in Shanghai, China, in 1986 and 1983.Prior to joining Armstrong, he was an associate professor in computer scienceat Purdue University in Fort Wayne, where he twice received the Excellence inResearch award.
D r. Liangwas trained in theoretical computer science. He was active in graph algorithmsfrom 1990 to 1995 and published more than ten papers in several establishedjournals such as SIAM Journal on Computing, Discrete Applied Mathematics, ActaInformatics, and Information Processing Letters. Since 1996, he has devoted towriting texts and published more than thirty books with Prentice Hall. Hispopular computer science texts are widely adopted in the world.
Dr. Liangwas elected a Java Champion in 2005 by Sun Microsystems and has given lectureson Java internationally.
Dr. Y.Daniel Liang earned his Ph.D. inComputer Science from the University of Oklahoma in 1991, and an MS and BS inComputer Science from Fudan University in Shanghai, China, in 1986 and 1983.Prior to joining Armstrong, he was an associate professor in computer scienceat Purdue University in Fort Wayne, where he twice received the Excellence inResearch award.
D r. Liangwas trained in theoretical computer science. He was active in graph algorithmsfrom 1990 to 1995 and published more than ten papers in several establishedjournals such as SIAM Journal on Computing, Discrete Applied Mathematics, ActaInformatics, and Information Processing Letters. Since 1996, he has devoted towriting texts and published more than thirty books with Prentice Hall. Hispopular computer science texts are widely adopted in the world.
Dr. Liangwas elected a Java Champion in 2005 by Sun Microsystems and has given lectureson Java internationally.
D r. Liangwas trained in theoretical computer science. He was active in graph algorithmsfrom 1990 to 1995 and published more than ten papers in several establishedjournals such as SIAM Journal on Computing, Discrete Applied Mathematics, ActaInformatics, and Information Processing Letters. Since 1996, he has devoted towriting texts and published more than thirty books with Prentice Hall. Hispopular computer science texts are widely adopted in the world.
Dr. Liangwas elected a Java Champion in 2005 by Sun Microsystems and has given lectureson Java internationally.
Dr. Y.Daniel Liang earned his Ph.D. inComputer Science from the University of Oklahoma in 1991, and an MS and BS inComputer Science from Fudan University in Shanghai, China, in 1986 and 1983.Prior to joining Armstrong, he was an associate professor in computer scienceat Purdue University in Fort Wayne, where he twice received the Excellence inResearch award.
D r. Liangwas trained in theoretical computer science. He was active in graph algorithmsfrom 1990 to 1995 and published more than ten papers in several establishedjournals such as SIAM Journal on Computing, Discrete Applied Mathematics, ActaInformatics, and Information Processing Letters. Since 1996, he has devoted towriting texts and published more than thirty books with Prentice Hall. Hispopular computer science texts are widely adopted in the world.
Dr. Liangwas elected a Java Champion in 2005 by Sun Microsystems and has given lectureson Java internationally.
Content
Welcome
1.Introduction to Computers, Programs, and Python
2.Elementary Programming
3.Selections
4.Mathematical Functions, Strings, and Objects
5. Loops
6.Functions
7. Lists
8. MultidimensionalLists
9.Objects and Classes
10. BasicGUI Programming Using Tkinter
11.Advanced GUI Programming Using Tkinter
12.Inheritance and Polymorphism
13. Filesand Exception Handling
14.Tuples, Sets, and Dictionaries
15.Recursion
16.Developing Efficient Algorithms
17.Sorting
18.Linked Lists, Stacks, Queues, and Priority Queues
19.Binary Search Trees
20. AVLTrees
21.Hashing
22.Graphs and Applications
23.Weighted Graphs and Applications
AppendixA. Python Keywords
AppendixB. The ASCII Character Set
AppendixC. Number Systems
AppendixD. Command Line Arguments
AppendixE. Regular Expressions
AppendixF. Bitwise Operations
SymbolIndex
SupplementalMaterial
Glossary
1.Introduction to Computers, Programs, and Python
2.Elementary Programming
3.Selections
4.Mathematical Functions, Strings, and Objects
5. Loops
6.Functions
7. Lists
8. MultidimensionalLists
9.Objects and Classes
10. BasicGUI Programming Using Tkinter
11.Advanced GUI Programming Using Tkinter
12.Inheritance and Polymorphism
13. Filesand Exception Handling
14.Tuples, Sets, and Dictionaries
15.Recursion
16.Developing Efficient Algorithms
17.Sorting
18.Linked Lists, Stacks, Queues, and Priority Queues
19.Binary Search Trees
20. AVLTrees
21.Hashing
22.Graphs and Applications
23.Weighted Graphs and Applications
AppendixA. Python Keywords
AppendixB. The ASCII Character Set
AppendixC. Number Systems
AppendixD. Command Line Arguments
AppendixE. Regular Expressions
AppendixF. Bitwise Operations
SymbolIndex
SupplementalMaterial
Glossary