design concepts in programming languages ebook free download

E-Book Details:

Title:	Design Concepts in Programming Languages
Publisher:	Phi Learning & MIT press
Author:	Franklyn A. Turbak & David K. Gifford
Edition:	Paperback,2nd
EditionNumber:	2
ISBN:	8120339967
EAN:	978-0-262-20175-9
No. of Pages:	1347

Table of Contents:

           The book presents a set of tools (a mathematical met language, abstract syntax, operational and denotation semantics) and uses it to explore a comprehensive set of programming language design dimensions, including dynamic semantics (naming, state, control, data), static semantics (types, type reconstruction, polymorphism, effects), and pragmatics (compilation, garbage collection). The many examples and exercises offer students opportunities to apply the foundational ideas explained in the text. Specialized topics and code that implements many of the algorithms and compilation methods in the book can be found on the book's Web site, along with such additional material as a section on concurrency and proofs of the theorems in the text. The book is suitable as a text for an introductory graduate or advanced undergraduate programming languages course.
About the Authors:
Franklyn A. Turbak is an Associate Professor in the Computer Science Department at Wellesley College.
David K. Gifford is Professor of Computer Science and Engineering at MIT.

Table of Contents:
UNIT I :

Introduction: Algorithm,Psuedo code for expressing algorithms,Performance Analysis-Space complexity,

Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little oh

notation,Probabilistic analysis, Amortized analysis.

UNIT II :

Disjoint Sets- disjoint set operations, union and find algorithms, spanning trees, connected components

and biconnected components.

UNIT III :

Divide and conquer: General method , applications-Binary search, Quick sort, Merge sort, Strassen’s

matrix multiplication.

UNIT IV :

Greedy method: General method, applications-Job sequencing with dead lines, 0/1 knapsack problem,

Minimum cost spanning trees, Single source shortest path problem.

UNIT V :

Dynamic Programming: General method, applications-Matrix chain multiplication, Optimal binary search

trees, 0/1 knapsack problem, All pairs shortest path problem,Travelling sales person problem, Reliability

design.

UNIT VI :

Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph coloring,

Hamiltonian cycles.

UNIT VII :

Branch and Bound: General method, applications - Travelling sales person problem,0/1 knapsack

problem- LC Branch and Bound solution, FIFO Branch and Bound solution.

UNIT VIII :

NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP - Hard and

NPComplete classes, Cook’s theorem.

Download: