Corporate Finance

ISBN-10: 0470444649
ISBN-13: 9780470444641
Edition: 2014
List price: $209.95 Buy it from $1.52 Rent it from $118.75
eBook available
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: More and more programmers are turning to Python and this book will give them the understanding they need. Necaise introduces the basic array structure and explores the fundamentals of implementing and using multi-dimensional arrays. The underlying  More...

Used Starting from $1.52
New Starting from $256.99
Rent Starting from $118.75
eBooks Starting from $73.88
Rent
Buy
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Medical Terminology Online content $4.95 $1.99
Add to cart
Study Briefs
Medical Math Online content $4.95 $1.99
Add to cart
Study Briefs
Business Ethics Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $209.95
Copyright year: 2014
Publisher: John Wiley & Sons, Incorporated
Publication date: 1/4/2013
Binding: Hardcover
Pages: 832
Size: 8.75" wide x 11.00" long x 1.25" tall
Weight: 4.048
Language: English

More and more programmers are turning to Python and this book will give them the understanding they need. Necaise introduces the basic array structure and explores the fundamentals of implementing and using multi-dimensional arrays. The underlying mechanisms of many of Python's built-in data structures and constructs are covered. A number of ADTs and applications are discussed as threads throughout the book to allow for multiple implementations as new data structures are introduced. Real-world applications of the various chapter topics are also presented. This gives programmers complete coverage of abstraction and the basic data structures and algorithms in the Python language.

Abstract Data Types 1
Introduction
Abstractions
Abstract Data Types
Data Structures
The Date ADT
Preconditions and Postconditions
Using the ADT
Implementing the ADT
The Bag ADT
Using the ADT
Selecting a Data Structure
The Class Definition
Iterators
The Set ADT
Using the ADT
Implementing the ADT
The Map ADT
Defining the ADT
Implementing the Map ADT
Alternate Implementation
Application: Histograms
Building a Histogram
Implementing the Histogram ADT
Programming Problems
Arrays and Vectors 43
The Array Structure
Simulating an Array
The Array ADT
Implementing the ADT
The Python List (Vector)
Multi���Dimensional Arrays
The MultiArray ADT
Data Organization
Variable Length Arguments
MultiArray Implementation
The Matrix ADT
Matrix Operations
Implementing the ADT
Application: The Game of Life
Rules of the Game
Designing a Solution
ADT Implementation
Exercises
Programming Problems
Algorithm Analysis 81
Complexity Analysis
Big���O Notation
Classes of Algorithms
Empirical Analysis
Evaluating ADT Implementations
Evaluating the Python List
Evaluating the Set ADT
Searching
Linear Search
Binary Search
Working with Ordered Lists
Building An Ordered List
Merging Ordered Lists
The Set ADT Revisited
Application: The Sparse Matrix
Implementation
Analysis
Exercises
Programming Problems
The Linked List 123
A Linked Structure
The Singly���Linked List
Basic Operations
Evaluating the Linked List
The Bag ADT Revisited
Implementation Details
Linked List Iterator
Using a Tail Pointer
The Ordered Linked List
The Sparse Matrix Revisited
The New Implementation
Comparing Implementations
Application: Polynomials
Polynomial Operations
The Polynomial ADT
ADT Implementation
Exercises
Programming Problems
Advanced Linked Lists 125
Doubly���Linked List
Organization
List Operations
Circular Linked List
Organization
List Operations
Multi���Linked Lists
Multiple Chains
The Sparse Matrix
Complex Iterators
Application: Text Editor
Typical Editor Operations
The Edit Buffer ADT
Implementing the ADT
Exercises
Programming Problems
Stacks 127
The Stack ADT
Implementing the Stack
Vector Based
Linked List Version
Stack Applications
Balanced Delimiters
Evaluating Postfix Expressions
Application: Solving a Maze
Backtracking
Designing a Solution
The Maze ADT
ADT Implementation
Exercises
Programming Problems
Queues 129
The Queue ADT
Implementing the Queue
Vector Based
Circular Array
Linked List Version
The Priority Queue
Application: Computer Simulations
Airline Ticket Counter
Class Specifications
Exercises
Programming Problems
Hash Tables 131
Introduction
Hash Functions
Open Addressing
Linear Probing
Collision Resolution
Bucket Hashing
Hashing Efficiency
The Map ADT Revisited
Application: The Color Histogram
Exercises
Programming Problems
Recursion 133
Recursive Functions
Properties of Recursion
Classic Example: The Factorial Function
Greatest Common Divisor
Recursion and Stacks
The Towers of Hanoi
Backtracking Revisited
The Eight���Queens Problem
Solving the Four���Queens
Recursive Solution
Application: Sudoku Puzzles
Exercises
Programming Problems
Binary Trees and Heaps 135
Tree Structure
The Binary Tree
Traversals
Arithmetic Expresssions
Tree Threading
Heaps
Insertions
Removals
Evaluating the Heap
The Priority Queue Revisited
Application: Morse Code
Exercises
Programming Problems
Advanced Search Trees 137
The Binary Search Tree
Searching
Insertions
Deletions
Evaluating the BST
AVL Trees
Insertions
Deletions
Evaluating the AVL Tree
2���3 Trees
Splay Trees
Application: Improved Map ADT
Exercises
Programming Problems
Sorting Algorithms 139
The Simple Algorithms
Bubble Sort
Selection Sort
Insertion Sort
Radix Sort
Basic Algorithm
Bucket Sorting
Divide and Conquer
Merge Sort
Quick Sort
Heap Sort
Application: Empirical Analysis
Exercises
Programming Problems
Python Review
Basic Concepts
Functions
Sequence Types
Classes
Copying Objects
Exceptions
Object���Oriented Programming 143
Introduction
Encapsulation
Inheritance
Polymorphism

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×