0
Your cart

Your cart is empty

Browse All departments
  • All departments
Price
  • R1,000 - R2,500 (16)
  • R2,500 - R5,000 (6)
  • -
Status
Brand

Showing 1 - 22 of 22 matches in All departments

Analytic Combinatorics (Hardcover): Philippe Flajolet, Robert Sedgewick Analytic Combinatorics (Hardcover)
Philippe Flajolet, Robert Sedgewick
R1,913 Discovery Miles 19 130 Ships in 10 - 15 working days

Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

Algorithms in Java, Part 5 - Graph Algorithms (Paperback, 3rd edition): Robert John Fuller Algorithms in Java, Part 5 - Graph Algorithms (Paperback, 3rd edition)
Robert John Fuller; Robert Sedgewick
R1,405 Discovery Miles 14 050 Ships in 7 - 11 working days

Algorithms in Java, Third Edition, Part 5: Graph Algorithms, contains six chapters that cover graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks. The descriptions here are intended to give students an understanding of the basic properties of as broad a range of fundamental graph algorithms as possible. In the third edition, many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. Unlike any other book on algorithms, not only will students get practical information on using algorithms in their work, they can also be assured that these algorithms rest on the most solid scientific foundations. And a new emphasis on abstract data types throughout the books makes the programs more broadly useful and relevant in modern object-oriented programming environments.

This book is useful as a text early in the computer science curriculum, after students have acquired basic programming skills and familiarity with computer systems, but before they have taken specialized courses in advanced areas of computer science or computer applications. There is sufficient coverage of basic material for the book to be used to teach data structures to beginners, and there is sufficient detail and coverage of advanced material for the book to be used to teach the design and analysis of algorithms to upper-level students. Some instructors may wish to emphasize implementations and practical concerns; others may wish to emphasize analysis and theoretical concepts. For a more comprehensive course, this book is also available in a special bundle with Parts 1-4 (ISBN for bundle of Parts 1-4 and Part 5 is 0201775786); thereby instructors can cover fundamentals, data structures, sorting, searching, and graph algorithms in one consistent style.

Algorithms in C, Part 5 - Graph Algorithms (Paperback, 3rd edition): Robert Sedgewick Algorithms in C, Part 5 - Graph Algorithms (Paperback, 3rd edition)
Robert Sedgewick
R1,605 Discovery Miles 16 050 Ships in 7 - 11 working days

Graph algorithms are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In the third edition, many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. Source code for the implementations is available via the Internet.

Algorithms in C, Parts 1-4 - Fundamentals, Data Structures, Sorting, Searching (Paperback, 3rd edition): Robert Sedgewick Algorithms in C, Parts 1-4 - Fundamentals, Data Structures, Sorting, Searching (Paperback, 3rd edition)
Robert Sedgewick
R2,069 Discovery Miles 20 690 Ships in 7 - 11 working days

Parts 1-4 of Robert Sedgewick's work provide extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. They reflect the third edition's greater emphasis on abstract data types (ADTs). Coverage includes more than 100 key algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations. Also included are new implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, and multiway tries. Increased quantitative information gives students a more solid basis for comparing algorithms, and hundreds of new exercises reinforce their learning. Algorithms and data structures described in the book are expressed in concise implementations in C, so that students can both appreciate their fundamental properties and test them on real applications.

Algorithms in Java, Parts 1-4 (Paperback, 3rd edition): John Fuller Algorithms in Java, Parts 1-4 (Paperback, 3rd edition)
John Fuller; Robert Sedgewick
R1,675 Discovery Miles 16 750 Ships in 7 - 11 working days

For the first time Sedgewick's seminal work on algorithms and data structures is available with implementations in Java. Michael Schidlowsky and Sedgewick have developed new Java code that both expresses the methods in a concise and direct manner, and also provides programmers with the practical means to test them on real applications. This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. Its four parts are fundamentals, data structures, sorting, and searching. It has expanded coverage of arrays, linked lists, strings, trees, ADT's, and object-oriented programming.

Algorithms in C++, Parts 1-4 - Fundamentals, Data Structure, Sorting, Searching (Paperback, 3rd edition): Robert Sedgewick Algorithms in C++, Parts 1-4 - Fundamentals, Data Structure, Sorting, Searching (Paperback, 3rd edition)
Robert Sedgewick
R1,791 Discovery Miles 17 910 Ships in 7 - 11 working days

  • For this version of Robert Sedgewick's popular textbook on algorithms and data structures, Christopher Van Wyk and Robert Sedgewick have developed new C++ implementations that both express the presented methods in a concise and direct manner, and also provide students with the practical means to test them on real applications.
  • This particular book, Parts 1-4, represents a substantial update of the first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The update features expanded coverage of arrays, linked lists, strings, trees, and other basic data structures, and greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions. It includes over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations, and over 1,000 new exercises to help students learn the properties of algorithms.

Bundle of Algorithms in Java, Pts. 1-5 - Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Paperback,... Bundle of Algorithms in Java, Pts. 1-5 - Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Paperback, 3rd ed)
Robert Sedgewick
R2,637 Discovery Miles 26 370 Out of stock

This is a shrink-wrapped bundle of Algorithms in Java, Third Edition, Parts 1-4 and Algorithms in Java, Third Edition, Part 5. The price of the bundle is $10 off the cost of buying the volumes individually.

All five parts are completely revamped, illuminating today's best algorithms for an exceptionally wide range of tasks. This bundle is suited for a comprehensive course, where the professor wants to cover fundamentals, data structures, sorting, searching, and graph algorithms in one consistent style. For detailed descriptions of each part of the bundle, please see the individual listing in this manual for Algorithms in Java, Third Edition, Parts 1-4, 0201361205 and Algorithms in Java, Part 5: Graph Algorithms, 0201361213.

Algorithms in C++ (Paperback): Robert Sedgewick Algorithms in C++ (Paperback)
Robert Sedgewick
R1,629 Discovery Miles 16 290 Out of stock

The latest addition to Robert Sedgewick's popular series of bookscarries his comprehensive collection of algorithms into anobject-oriented programming (OOP) environment with implementationin the C++ programming language. These algorithms cover a broadrange of fundamental and more advanced methods: sorting,searching, string-processing, geometric, graph, and mathematicalalgorithms. The algorithms are all expressed in terms of conciseimplementations in C++, so that readers can both appreciate theirbasic properties and test them on real applications. The treatment of analysis of algorithsm is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are prefered, and in some cases, therelationship of the proactical algorithms being discussed topurely theoretical results is also described. The ultimate aim of the book is to improve programming practice,whatever the environment, whatever the implementation language. Sedgweick describes the basic methods to be considered in everycase. Features *Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work. *Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms. *Six chapters discuss fundamental concepts, including a briefintroduction to data structures. Algorithms in C++ provides readers with the tools to implement,run, and debug useful algorithms with confidence. This book is ahelpful guide for users engaged in the transition to orexperimentation with OOP and/or the C++ language. It may be usedfor self study, or as a reference for developers or computersystems or applications programs.

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and... Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO) (Paperback, 6th ed.)
Lars Arge, Giuseppe Itallano, Robert Sedgewick
R1,849 R1,385 Discovery Miles 13 850 Save R464 (25%) Out of stock

The aim of the annual ALENEX workshop is to provide a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures. This research presents significant studies in experimental analysis or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios. The paper presentations address specific applied areas that present unique challenges in their underlying algorithmic problems as well as methodological issues and standards in the context of empirical research on algorithms and data structures. The ANALCO workshop presents a collection of original research in the analysis of algorithms and associated combinatorial structures. The papers study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and address the precise analysis of algorithms for processing such structures, including average-case analysis; analysis of moments, extrema, and distributions; and probabilistic analysis of randomized algorithms. This proceedings collects extended versions of the 14 papers that were selected for presentation from the ALENEX workshop and 10 papers selected for presentation from the ANALCO workshop.

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics... Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO) (Paperback)
Camil Demetrescu, Roberto Tamassia, Robert Sedgewick
R2,143 R1,599 Discovery Miles 15 990 Save R544 (25%) Out of stock

Presents the aim of the annual ALENEX workshop, which is to provide a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures.

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop (Paperback): Rajeev Raman,... Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop (Paperback)
Rajeev Raman, Robert Sedgewick, Matthias F. Stallmann
R2,219 Discovery Miles 22 190 Out of stock

The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. The workshop was sponsored by SIAM, the Society for Industrial and Applied Mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. The aim of ANALCO is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures.

Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and... Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics (Paperback, 9th)
David Applegate, Gerth Stolting Brodal, Daniel Panario, Robert Sedgewick
R2,614 Discovery Miles 26 140 Out of stock

Proceedings of the Seventh SIAM International Conference on Data Mining

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments and the Fifth Workshop on Analytic Algorithmics and... Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments and the Fifth Workshop on Analytic Algorithmics and Combinatorics (Paperback)
Ian Munro, Robert Sedgewick, Dorothea Wagner, Wojciech Szpankowski
R2,717 Discovery Miles 27 170 Out of stock
Algorithms in C (paperback) (Paperback, Digital print ed): Robert Sedgewick Algorithms in C (paperback) (Paperback, Digital print ed)
Robert Sedgewick
R1,440 Discovery Miles 14 400 Out of stock

This new version of the best-selling book, Algorithms, SecondEdition, provides a comprehensive collection of algorithmsimplemented in C. A variety of algorithms are described in eachofthe following areas: sorting, searching, string-processing,geometric, graph, and mathematical algorithms. These algorithmsare expressed in terms of concise implementations in C, so thatreaders can both appreciate their fundamental properties and testthem on real applications. The treatment of analysis of algorithms is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are preferred, and in some cases, therelationship of the practical algorithms being disussed to purelytheoretical results is also described. Features *Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work. *Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms. *Six chapters present fundamental concepts, including a briefintroduction to data structures. Algorithms in C provides readers with the tools to confidentlyimplement, run, and debug useful algorithms.This book may beuseful for self-study, or as a reference for people engaged inthe development of computer systems for applications programs.

Introduction to Programming in Java - An Interdisciplinary Approach (Paperback): Robert Sedgewick, kevin wayne Introduction to Programming in Java - An Interdisciplinary Approach (Paperback)
Robert Sedgewick, kevin wayne
R2,529 Discovery Miles 25 290 Out of stock

KEY MESSAGE: By emphasizing the application of computer programming not only in success stories in the software industry but also in familiar scenarios in physical and biological science, engineering, and applied mathematics, Introduction to Programming in Java takes an interdisciplinary approach to teaching programming with the Java (TM) programming language. KEY TOPICS: Elements of Programming: Your First Program; Built-in Types of Data; Conditionals and Loops; Arrays; Input and Output. Functions and Modules: Static Methods; Libraries and Clients; Recursion. Object-Oriented Programming: Data Types; Creating Data Types; Designing Data Types. Algorithms and Data Structures: Performance; Sorting and Searching; Stacks and Queues; Symbol Tables. MARKET: For all readers interested in introductory programming courses using the Java programming language.

Computer Science - An Interdisciplinary Approach (Hardcover): Robert Sedgewick, kevin wayne Computer Science - An Interdisciplinary Approach (Hardcover)
Robert Sedgewick, kevin wayne
R1,955 Discovery Miles 19 550 Out of stock

Named a Notable Book in the 21st Annual Best of Computing list by the ACM! Robert Sedgewick and Kevin Wayne's Computer Science: An Interdisciplinary Approach is the ideal modern introduction to computer science with Java programming for both students and professionals. Taking a broad, applications-based approach, Sedgewick and Wayne teach through important examples from science, mathematics, engineering, finance, and commercial computing. The book demystifies computation, explains its intellectual underpinnings, and covers the essential elements of programming and computational problem solving in today's environments. The authors begin by introducing basic programming elements such as variables, conditionals, loops, arrays, and I/O. Next, they turn to functions, introducing key modular programming concepts, including components and reuse. They present a modern introduction to object-oriented programming, covering current programming paradigms and approaches to data abstraction. Building on this foundation, Sedgewick and Wayne widen their focus to the broader discipline of computer science. They introduce classical sorting and searching algorithms, fundamental data structures and their application, and scientific techniques for assessing an implementation's performance. Using abstract models, readers learn to answer basic questions about computation, gaining insight for practical application. Finally, the authors show how machine architecture links the theory of computing to real computers, and to the field's history and evolution. For each concept, the authors present all the information readers need to build confidence, together with examples that solve intriguing problems. Each chapter contains question-and-answer sections, self-study drills, and challenging problems that demand creative solutions. Companion web site (introcs.cs.princeton.edu/java) contains Extensive supplementary information, including suggested approaches to programming assignments, checklists, and FAQs Graphics and sound libraries Links to program code and test data Solutions to selected exercises Chapter summaries Detailed instructions for installing a Java programming environment Detailed problem sets and projects Companion 20-part series of video lectures is available at informit.com/title/9780134493831

Algorithms in C++ Part 5 - Graph Algorithms (Paperback, 3rd edition): Robert Sedgewick Algorithms in C++ Part 5 - Graph Algorithms (Paperback, 3rd edition)
Robert Sedgewick
R1,405 Discovery Miles 14 050 Out of stock

Bundle of Algorithms in C++, Parts 1-5 - Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Paperback,... Bundle of Algorithms in C++, Parts 1-5 - Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Paperback, 3rd edition)
Peter Gordon, Robert Sedgewick
R2,873 Discovery Miles 28 730 Out of stock

Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms for C++. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C++, Third Edition, Parts 1-4 and his new Algorithms in C++, Third Edition, Part 5. Together, these books are the most definitive, up-to-date, and practical algorithms resource available.KEY TOPICS:The first book introduces fundamental concepts associated with algorithms; then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents. Together, these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs.MARKET:For all software developers, researchers, and students of computer science.

Algorithms, Fourth Edition (Deluxe) - Book and 24-Part Lecture Series (Hardcover, Special edition): Robert Sedgewick, kevin... Algorithms, Fourth Edition (Deluxe) - Book and 24-Part Lecture Series (Hardcover, Special edition)
Robert Sedgewick, kevin wayne
R3,247 Discovery Miles 32 470 Out of stock

**Included in this Bundle** THE PRINT BOOK: This fourth edition of Robert Sedgewick and Kevin Wayne's Algorithms is one of the most popular textbooks on algorithms today and is widely used in colleges and universities worldwide. The algorithms in this book - including 50 algorithms every programmer should know - represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering and for students who use computation in the liberal arts. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. THE LECTURE SERIES: There are 24 lecture videos that will be streamed on the Informit.com site; each lecture is approximately 60 to 75 minutes in length and focuses on a specific topic related to the Algorithms book. The lecture videos introduce viewers to fundamental data types, algorithms, and data structures, with emphasis on applications and scientific performance analysis of Java implementations. They also cover graph-processing algorithms, including minimum spanning tree and shortest paths algorithms, and string processing algorithms, including string sorts, tries, substring search, regular expressions, and data compression, and concludes with an overview placing the contents of the course in a larger context. The first 12 lecture videos cover elementary data structures, sorting, and searching. Topics covered in these videos include union-find, binary search, stacks, queues, bags, insertion sort, selection sort, shellsort, quicksort, 3-way quicksort, mergesort, heapsort, binary heaps, binary search trees, red-black trees, separate chaining and linear probing hash tables, Graham scan, and id-trees. Lecture videos 13 through 24 focus on graph and string-processing algorithms. Topics covered in these lecture videos include depth-first search, breadth-first search, topological sort, Kosaraju-Sharir, Kruskal, Prim, Dijkistra, Bellman-Ford, Ford-Fulkerson, LSD radix sort, MSD radix sort, 3-way radix quicksort, multiway tries, ternary search tries, Knuth-Morris-Pratt, Boyer-Moore, Rabin-Karp, regular expression matching, run-length coding, Huffman coding, LZW compression, and the Burrows-Wheeler transform. Used books, rentals, and purchases made outside of Pearson If purchasing or renting from companies other than Pearson, the access code for the Video Lectures may not be included, may be incorrect, or may be previously redeemed. Check with the seller before completing your purchase.

Algorithms in C, Parts 1-5 (Bundle) - Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Paperback, 3rd... Algorithms in C, Parts 1-5 (Bundle) - Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Paperback, 3rd edition)
Robert Sedgewick
R2,934 Discovery Miles 29 340 Out of stock

Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C, Third Edition, Parts 1-4 and his new Algorithms in C, Third Edition, Part 5. Together, these books are definitive: the most up-to-date and practical algorithms resource available.KEY TOPICS:Sedgewick masterfully blends theory and practice, making Bundle of Algorithms in C, Third Edition an essential resource for computer science researchers, students, and working developers alike. The first book introduces fundamental concepts associated with algorithms; then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Together, these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs. In both books, Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents.MARKET:For all developers, computer science researchers, engineers, and students of algorithms.

Algorithms (Hardcover, 4th edition): Robert Sedgewick, kevin wayne Algorithms (Hardcover, 4th edition)
Robert Sedgewick, kevin wayne
R2,026 Discovery Miles 20 260 Out of stock

This fourth edition of Robert Sedgewick and Kevin Wayne's Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.

The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts.

The companion web site, algs4.cs.princeton.edu contains An online synopsisFull Java implementationsTest dataExercises and answersDynamic visualizationsLecture slidesProgramming assignments with checklistsLinks to related material

The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants.

Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience.

Introduction to Programming in Java - An Interdisciplinary Approach (Paperback, 2nd edition): Robert Sedgewick, kevin wayne Introduction to Programming in Java - An Interdisciplinary Approach (Paperback, 2nd edition)
Robert Sedgewick, kevin wayne
R1,618 Discovery Miles 16 180 Out of stock

Programming skills are indispensable in today's world, not just for computer science students, but also for anyone in any scientific or technical discipline. Introduction to Programming in Java, Second Edition, by Robert Sedgewick and Kevin Wayne is an accessible, interdisciplinary treatment that emphasizes important and engaging applications, not toy problems. The authors supply the tools needed for students and professionals to learn that programming is a natural, satisfying, and creative experience, and to become conversant with one of the world's most widely used languages. This example-driven guide focuses on Java's most useful features and brings programming to life for every student in the sciences, engineering, and computer science. Coverage includes Basic elements of programming: variables, assignment statements, built-in data types, conditionals, loops, arrays, and I/O, including graphics and sound Functions, modules, and libraries: organizing programs into components that can be independently debugged, maintained, and reused Algorithms and data structures: sort/search algorithms, stacks, queues, and symbol tables Applications from applied math, physics, chemistry, biology, and computer science Drawing on their extensive classroom experience, throughout the text the authors provide Q&As, exercises, and opportunities for creative engagement with the material. Together with the companion materials described below, this book empowers people to pursue a modern approach to teaching and learning programming. Companion web site (introcs.cs.princeton.edu/java) contains Chapter summaries Supplementary exercises, some with solutions Detailed instructions for installing a Java programming environment Program code and test data suitable for easy download Detailed creative exercises, projects, and other supplementary materials Companion studio-produced online videos (informit.com/sedgewick) are available for purchase and provide students and professionals with the opportunity to engage with the material at their own pace and give instructors the opportunity to spend their time with students helping them to succeed on assignments and exams.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Loot
Nadine Gordimer Paperback  (2)
R336 R283 Discovery Miles 2 830
STEM Activity: Sensational Science
Steph Clarkson Paperback  (3)
R216 R154 Discovery Miles 1 540
Home Quip Usb Powered Aromatherapy…
R230 R179 Discovery Miles 1 790
College Originals Multi-Functional…
R999 R499 Discovery Miles 4 990
Star Wars: Rogue One - Death Trooper…
R197 R107 Discovery Miles 1 070
Sackboy: A Big Adventure
R1,299 R1,187 Discovery Miles 11 870
Crayola Jumbo Decorated Pencils (Pack of…
R113 Discovery Miles 1 130
Chromatica
Lady Gaga CD  (2)
R160 R125 Discovery Miles 1 250
Star Wars: Episode 8 - The Last Jedi 2D…
Daisy Ridley, John Boyega, … Blu-ray disc R292 Discovery Miles 2 920
Loot
Nadine Gordimer Paperback  (2)
R336 R283 Discovery Miles 2 830

 

Partners