E-Book Details:

Title:	Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson
Publisher:	McGraw-Hill Osborne
Author:	Thomas H. Cormen, Charles E. Leiserson
Edition:	Second Edition
EditionNumber:	2
ISBN:	0070131511
EAN:	9780027263367
No. of Pages:	984

Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.
                        In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book’s original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage.
                                                               As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudo code to make the book easily accessible to students from all programming language backgrounds . Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course’s needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.

Publisher:
There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudo code designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage
                                                    The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

Computer Networks

Computer Netwoks By Andrew S.Tanenbaum
The world’s leading introduction to networking–fully updated for tomorrow’s key technologies
Computer Networks, fourth edition, is the ideal introduction to today’s networks–and tomorrow’s. This classic bestseller has been thoroughly updated to reflect the newest and most important networking technologies with a special emphasis on wireless networking, including 802.11, Bluetooth’”, broadband wireless, ad hoc networks, i-mode, and WAP. But fixed networks have not been ignored either, with coverage of ADSL, Internet over cable, gigabit Ethernet, peer-to-peer networks, NAT, and MPLS. And there is lots of new material on applications, including over 60 pages on the Web, plus Internet radio, Voice over IP, and video on demand. Finally, the coverage of network security has been revised and expanded to fill an entire chapter.
Author, educator, and researcher Andrew S. Tanenbaum, winner of the ACM Karl V. Karlstrom Outstanding Educator Award, carefully explains how networks work on the inside, from underlying hardware at the physical layer up through the top-level application layer. Tanenbanm covers all this and more:
· Physical layer (e.g., copper, fiber, wireless, satellites, and Internet over cable)
· Data link layer (e.g., protocol principles, protocol verification, HDLC, and PPP)
· MAC sublayer (e.g., gigabit Ethernet, 802.11, broadband wireless, and switching)
· Network layer (e.g., routing algorithms, congestion control, QoS, IPv4, and IPv6)
· Transport layer (e.g., socket programming, UDP, TCP, RTP, and network performance)
· Application layer (e.g., e-mail, the Web, PHP, wireless Web, MP3, and streaming audio)
· Network security (e.g., AES, RSA, quantum cryptography, IPsec, and Web security)
The book gives detailed descriptions of the principles associated with each layer and presents many examples drawn from the Internet and wireless networks.

NAME
Computer Networks(4th Edition)
AUTHOR
Andrew S. Tanenbaum

PUBLISHERS
Prentice Hall
USEFUL FOR
Engineering Students

 

Data Structures And Algorithm Analysis
Data Structures And Algorithm Analysis By Mark Allen Weiss

In this book describes data structures, methods of organizing large amounts of data, and algorithm analysis, the estimation of the running time of algorithms. As computers become faster and faster, the need for programs that can handle large amounts of input becomes more acute. Paradoxically, this requires more careful attention to efficiency, since inefficiencies in programs become most obvious when input sizes are large. By analyzing an algorithm before it is actually coded, students can decide if a particular solution will be feasible. For example, in this text students look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from 16 years to less than a second. Therefore, no algorithm or data structure is presented without an explanation of its running time. In some cases, minute details that affect the running time of the implementation are explored.

Once a solution method is determined, a program must still be written. As computers have become more powerful, the problems they solve have become larger and more complex, thus requiring development of more intricate programs to solve the problems. The goal of this text is to teach students good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency.

This book is suitable for either an advanced data structures (CS7) course or a first-year graduate course in algorithm analysis. Students should have some knowledge of intermediate programming, including such topics as pointers and recursion, and some background in discrete math.

NAME
Data Structures And Algorithm Analysis in C
AUTHOR
Mark Allen Weiss

PUBLISHERS
Addison Wesley
USEFUL FOR
Engineering Students

Computer Graphics

Computer Graphics By Donald Hearn,M.Pauline Baker

This timely new version of a popular computer graphics book features the C language in programming examples to demonstrate the implementation of graphics application. These well-known authors assume no prior knowledge of computer graphics when presenting the basic principles for the design, use, and
understanding of computer graphics systems. However, some knowledge of C programming is assumed as the reader learns how to use algorithms for creating and manipulating graphics displays.

From the Publisher
Reflecting the rapid expansion of the use of computer graphics and of C as a programming language of choice for implementation, this new version of the best-selling Hearn and Baker text converts all programming code into the C language. Assuming the reader has no prior familiarity with computer graphics, the authors present basic principles for design, use, and understanding of computer graphics systems. The authors are widely considered authorities in computer graphics, and are known for their accessible writing style.

From the Back Cover
This timely new version of a popular computer graphics book features the C language in programming examples to demonstrate the implementation of graphics application. These well-known authors assume no prior knowledge of computer graphics when presenting the basic principles for the design, use, and understanding of computer graphics systems. However, some knowledge of C programming is assumed as the reader learns how to use algorithms for creating and manipulating graphics displays.

NAME
Computer Graphics
AUTHOR
Donald Hearn,M.Pauline Baker

PUBLISHERS
Prentice Hall
USEFUL FOR
Engineering Students

IF YOU LIKE THIS THEN CLICK ON FACEBOOK LIKE BUTTON

DOWNLOAD

CLICK HERE 

DOWNLOAD