CART

(0) items

Introduction to Corporate Finance, Canadian Edition,9780470444641
This item qualifies for
FREE SHIPPING!

FREE SHIPPING OVER $59!

Your order must be $59 or more, you must select US Postal Service Shipping as your shipping preference, and the "Group my items into as few shipments as possible" option when you place your order.

Bulk sales, PO's, Marketplace Items, eBooks, Apparel, and DVDs not included.

Introduction to Corporate Finance, Canadian Edition

by ;
ISBN13:

9780470444641

ISBN10:
0470444649
Format:
Hardcover
Pub. Date:
9/1/2011
Publisher(s):
Wiley
List Price: $262.70

Rent Textbook

(Recommended)
 
Term
Due
Price
$91.95

Hurry!

Only one copy
in stock at this price.

Buy Used Textbook

In Stock Usually Ships in 24 Hours.
U9780470444641
$147.11

Buy New Textbook

In Stock Usually Ships in 24 Hours.
N9780470444641
$252.19

eTextbook


 
Duration
Price
$100.98
More New and Used
from Private Sellers
Starting at $84.85
See Prices

Questions About This Book?

Why should I rent this book?
Renting is easy, fast, and cheap! Renting from eCampus.com can save you hundreds of dollars compared to the cost of new or used books each semester. At the end of the semester, simply ship the book back to us with a free UPS shipping label! No need to worry about selling it back.
How do rental returns work?
Returning books is as easy as possible. As your rental due date approaches, we will email you several courtesy reminders. When you are ready to return, you can print a free UPS shipping label from our website at any time. Then, just return the book to your UPS driver or any staffed UPS location. You can even use the same box we shipped it in!
What version or edition is this?
This is the edition with a publication date of 9/1/2011.
What is included with this book?
  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any CDs, lab manuals, study guides, etc.
  • The Used copy of this book is not guaranteed to inclue any supplemental materials. Typically, only the book itself is included.
  • The Rental copy of this book is not guaranteed to include any supplemental materials. You may receive a brand new copy, but typically, only the book itself.

Summary

Because students are motivated to learn finance if they are shown how it is relevant to their world, each chapter of Introduction to Corporate Finance is written with engaging examples and a wealth of detail. In addition, the following features are also included: * Finance in the News: Each chapter includes an article or item from the financial press that is integrated into the main discussion of the chapter, to help students draw the connection between theory and application. * Ethics and Corporate Governance: Found at the end of each part in the text, this feature includes an item relating to ethics and corporate governance and how these issues affect corporations today. These items are accompanied by questions to help launch in-class analysis and discussion * Financial Calculator Keystrokes: All relevant demonstration problems include actual keystrokes for the TI BAII calculator. * Excel Spreadsheet Commands: All relevant demonstration problems include Excel spreadsheet commands. Because students cannot learn finance unless they practice homework problems, Introduction to Corporate Finance comes complete with WileyPLUS--a powerful online tool that includes an electronic version of the text. WileyPLUS provides the technology to create an environment where students reach their full potential and experience academic success that will last them a lifetime! Instructors are provided with a wealth of resources, including presentation and preparation tools, easy-to-navigate assignment and assessment tools, and a complete system to enable them to administer and manage their course exactly as they wish.

Table of Contents

Abstract Data Types 1
Introductionp. 1
Abstractionsp. 2
Abstract Data Typesp. 4
Data Structuresp. 5
The Date ADTp. 6
Preconditions and Postconditionsp. 8
Using the ADTp. 8
Implementing the ADTp. 8
The Bag ADTp. 14
Using the ADTp. 15
Selecting a Data Structurep. 16
The Class Definitionp. 18
Iteratorsp. 19
The Set ADTp. 22
Using the ADTp. 24
Implementing the ADTp. 25
The Map ADTp. 28
Defining the ADTp. 29
Implementing the Map ADTp. 30
Alternate Implementationp. 33
Application: Histogramsp. 35
Building a Histogramp. 37
Implementing the Histogram ADTp. 37
Programming Problemsp. 40
Arrays and Vectors 43
The Array Structurep. 43
Simulating an Arrayp. 44
The Array ADTp. 45
Implementing the ADTp. 46
The Python List (Vector)p. 47
Multi‚«ŰDimensional Arraysp. 54
The MultiArray ADTp. 54
Data Organizationp. 55
Variable Length Argumentsp. 59
MultiArray Implementationp. 60
The Matrix ADTp. 64
Matrix Operationsp. 65
Implementing the ADTp. 67
Application: The Game of Lifep. 69
Rules of the Gamep. 70
Designing a Solutionp. 72
ADT Implementationp. 74
Exercisesp. 77
Programming Problemsp. 78
Algorithm Analysis 81
Complexity Analysisp. 82
Big‚«ŰO Notationp. 83
Classes of Algorithmsp. 87
Empirical Analysisp. 88
Evaluating ADT Implementationsp. 88
Evaluating the Python Listp. 89
Evaluating the Set ADTp. 91
Searchingp. 92
Linear Searchp. 92
Binary Searchp. 95
Working with Ordered Listsp. 99
Building An Ordered Listp. 99
Merging Ordered Listsp. 100
The Set ADT Revisitedp. 106
Application: The Sparse Matrixp. 112
Implementationp. 112
Analysisp. 116
Exercisesp. 118
Programming Problemsp. 120
The Linked List 123
A Linked Structurep. 124
The Singly‚«ŰLinked Listp. 124
Basic Operationsp. 124
Evaluating the Linked Listp. 124
The Bag ADT Revisitedp. 124
Implementation Detailsp. 124
Linked List Iteratorp. 124
Using a Tail Pointerp. 124
The Ordered Linked Listp. 124
The Sparse Matrix Revisitedp. 124
The New Implementationp. 124
Comparing Implementationsp. 124
Application: Polynomialsp. 124
Polynomial Operationsp. 124
The Polynomial ADTp. 124
ADT Implementationp. 124
Exercisesp. 124
Programming Problemsp. 124
Advanced Linked Lists 125
Doubly‚«ŰLinked Listp. 126
Organizationp. 126
List Operationsp. 126
Circular Linked Listp. 126
Organizationp. 126
List Operationsp. 126
Multi‚«ŰLinked Listsp. 126
Multiple Chainsp. 126
The Sparse Matrixp. 126
Complex Iteratorsp. 126
Application: Text Editorp. 126
Typical Editor Operationsp. 126
The Edit Buffer ADTp. 126
Implementing the ADTp. 126
Exercisesp. 126
Programming Problemsp. 126
Stacks 127
The Stack ADTp. 128
Implementing the Stackp. 128
Vector Basedp. 128
Linked List Versionp. 128
Stack Applicationsp. 128
Balanced Delimitersp. 128
Evaluating Postfix Expressionsp. 128
Application: Solving a Mazep. 128
Backtrackingp. 128
Designing a Solutionp. 128
The Maze ADTp. 128
ADT Implementationp. 128
Exercisesp. 128
Programming Problemsp. 128
Queues 129
The Queue ADTp. 129
Implementing the Queuep. 129
Vector Basedp. 129
Circular Arrayp. 129
Linked List Versionp. 129
The Priority Queuep. 129
Application: Computer Simulationsp. 129
Airline Ticket Counterp. 129
Class Specificationsp. 129
Exercisesp. 129
Programming Problemsp. 129
Hash Tables 131
Introductionp. 131
Hash Functionsp. 131
Open Addressingp. 131
Linear Probingp. 131
Collision Resolutionp. 131
Bucket Hashingp. 131
Hashing Efficiencyp. 131
The Map ADT Revisitedp. 131
Application: The Color Histogramp. 131
Exercisesp. 131
Programming Problemsp. 131
Recursion 133
Recursive Functionsp. 133
Properties of Recursionp. 133
Classic Example: The Factorial Functionp. 133
Greatest Common Divisorp. 133
Recursion and Stacksp. 133
The Towers of Hanoip. 133
Backtracking Revisitedp. 133
The Eight‚«ŰQueens Problemp. 133
Solving the Four‚«ŰQueensp. 133
Recursive Solutionp. 133
Application: Sudoku Puzzlesp. 133
Exercisesp. 133
Programming Problemsp. 133
Binary Trees and Heaps 135
Tree Structurep. 135
The Binary Treep. 135
Traversalsp. 135
Arithmetic Expresssionsp. 135
Tree Threadingp. 135
Heapsp. 135
Insertionsp. 135
Removalsp. 135
Evaluating the Heapp. 135
The Priority Queue Revisitedp. 135
Application: Morse Codep. 135
Exercisesp. 135
Programming Problemsp. 135
Advanced Search Trees 137
The Binary Search Treep. 138
Searchingp. 138
Insertionsp. 138
Deletionsp. 138
Evaluating the BSTp. 138
AVL Treesp. 138
Insertionsp. 138
Deletionsp. 138
Evaluating the AVL Treep. 138
2‚«Ű3 Treesp. 138
Splay Treesp. 138
Application: Improved Map ADTp. 138
Exercisesp. 138
Programming Problemsp. 138
Sorting Algorithms 139
The Simple Algorithmsp. 140
Bubble Sortp. 140
Selection Sortp. 140
Insertion Sortp. 140
Radix Sortp. 140
Basic Algorithmp. 140
Bucket Sortingp. 140
Divide and Conquerp. 140
Merge Sortp. 140
Quick Sortp. 140
Heap Sortp. 140
Application: Empirical Analysisp. 140
Exercisesp. 140
Programming Problemsp. 140
Python Reviewp. 141
Basic Conceptsp. 141
Functionsp. 141
Sequence Typesp. 141
Classesp. 141
Copying Objectsp. 141
Exceptionsp. 141
Object‚«ŰOriented Programming 143
Introductionp. 143
Encapsulationp. 143
Inheritancep. 143
Polymorphismp. 143
Table of Contents provided by Publisher. All Rights Reserved.


Please wait while the item is added to your cart...