Revel for Introduction to Python Programming and Data Structures -- Access Card, 1st edition
Unfortunately, this item is not available in your country.
For introductory courses in Python Programming and Data Structures.
A fundamentals first approach to programming helps students create efficient, elegant code
Revel™ Introduction to Python Programming and Data Structures introduces students to basic programming concepts using a fundamentals-first approach that prepares students to learn object-oriented programming and advanced Python programming. This approach presents programming concepts and techniques that include control statements, loops, functions, and arrays before designing custom classes. Students learn basic logic and programming concepts prior to moving into object-oriented and GUI programming. The content incorporates a wide variety of problems with various levels of difficulty and covers many application areas to engage and motivate students.
Revel is Pearson’s newest way of delivering our respected content. Fully digital and highly engaging, Revel replaces the textbook and gives students everything they need for the course. Informed by extensive research on how people read, think, and learn, Revel is an interactive learning environment that enables students to read, practice, and study in one continuous experience – for less than the cost of a traditional textbook.
NOTE: Revel is a fully digital delivery of Pearson content. This ISBN is for the standalone Revel access card. In addition to this access card, you will need a course invite link, provided by your instructor, to register for and use Revel.
Table of contents
1. Introduction to Computers, Programs, and Python
2. Elementary Programming
4. Mathematical Functions, Strings, and Objects
8. Multidimensional Lists
9. Objects and Classes
10. Basic GUI Programming Using Tkinter
11. Advanced GUI Programming Using Tkinter
12. Inheritance and Polymorphism
13. Files and Exception Handling
14. Tuples, Sets, and Dictionaries
16. Developing Efficient Algorithms
18. Linked Lists, Stacks, Queues, and Priority Queues
19. Binary Search Trees
20. AVL Trees
22. Graphs and Applications
23. Weighted Graphs and Applications
Appendix A. Python Keywords
Appendix B. The ASCII Character Set
Appendix C. Number Systems
Appendix D. Command Line Arguments
Appendix E. Regular Expressions
Appendix F. Bitwise Operations
Published by Pearson (January 4th 2019) - Copyright © 2020