SPECIFIC_TOPIC/Introduction to Computer Science
PASTE EVERYTHING IN ONE SECTION OF THIS FILE AS DONE BELOW(Formatting not requited)
- Find world renowned algorithm/DS books (Discuss on Whatsapp first) Format Book, Edition(see other examples)
- Find APA Reference of the Book
- Find relatively long summary of the book 400-800 words
- Find 2 high resolution Photos of the Cover(Simple SCan of the Cover)
- Find meta-data like the Link to the book(published:paid) publisher website if not then Amazon.COM as last resort. Find Publishing date. Find ISBN Number of all volumes. Add your name to at the end as Contributor: XYZ
- Proof-read and create pull request.
[ ] Add multiple high-resolution pictures to the Books [ ] Check for errors in current entries [ ] Fix Airtable and fields and formula tab [ ] Define scope of the Books and catagories [ ] Remove unecessary fields [ ] Sync order of Books w/ Airtable [ ] Add tags to books in Airtable / sort|search by tags [ ] Add corresponding resources in notes of each book. [ ]Work out Edition System or eliminate [ ] Universal Citation system/ Change APA ref system [ ] Warning on Citation System
-
Introduction to Computer programming CLRS
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely 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 pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.
978-0262033848
- Data Structures and Algorithms by Alfred V. Aho Jeffrey D. Ullman John E. Hopcroft(1983-01-11)
Alfred V. Aho, John E. Hopcroft, and Jeffrey Ullman. 1983. Data Structures and Algorithms (1st. ed.). Addison-Wesley Longman Publishing Co., Inc., USA.
This book presents the data structures and algorithms that underpin much of today's computer programming. The basis of this book is the material contained in the first six chapters of our earlier work, The Design and Analysis of Computer Algorithms. We have expanded that coverage and have added material on algorithms for external storage and memory management. As a consequence, this book should be suitable as a text for a first course on data structures and algorithms. The only prerequisite we assume is familiarity with some high-level programming language such as Pascal.
Alfred V. Aho Jeffrey D. Ullman John E. Hopcroft
- Structure and Interpretation of Computer Programs - 2nd Edition (MIT Electrical Engineering and Computer Science
Forbus, K. (1985). Structure and Interpretation of Computer Programs, by H. Abelson, G.J. Sussman with J. Sussman: Artificial Intelligence.
In this revised and updated edition, the editors have integrated a completely new set of contributions from the leading researchers in the field to describe the latest research in evolutionary medicine, providing a fresh summary of this rapidly expanding field 10 years after its predecessor was first compiled. It continues to adopt a broad approach to the subject, drawing on medically relevant research from evolutionary genetics, human behavioral ecology, evolutionary microbiology (especially experimental evolution of virulence and resistance), the evolution of aging and degenerative disease, and other aspects of biology or medicine where evolutionary approaches make important contributions.
https://mitpress.mit.edu/sites/default/files/sicp/full-text/book/book.html
H. Abelson, G.J. Sussman with J. Sussman
- The Art of Computer Programming
Knuth, D. E. (1969). The Art of computer programming. Reading, Mass: Addison-Wesley.
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.
–Byte, September 1995
I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.
–Charles Long
If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing.
–Bill Gates
It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.
–Jonathan Laventhol
- Robert Sedgewick and Kevin Wayne’s Algorithms
Sedgewick, R., Wayne, K. (2011). Algorithms, 4th Edition.. Addison-Wesley. ISBN: 978-0-321-57351-3 \
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.
https://www.amazon.com/Algorithms-Part-II-Robert-Sedgewick-ebook/dp/B00I50LKWY
Sedgewick, R., Wayne, K.
- Algorithm Design, Jon Kleinberg
Kleinberg, J., & Tardos, E. (2006). Algorithm design. Boston: Pearson/Addison-Wesley.
Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.
https://www.amazon.com/exec/obidos/ASIN/0321295358/acmorg-20
Kleinberg, J., & Tardos, E.
- Algorithms Unlocked, 2013
Cormen, T. H. (2013). Algorithms unlocked.
ISBN: 9780262518802 , 2013
For anyone who has ever wondered how computers solve problems, an engagingly written guide for nonexperts to the basics of computer algorithms.
Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen—coauthor of the leading college textbook on the subject—provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems.
https://mitpress.mit.edu/books/algorithms-unlocked
Thomas H. Cormen
An introduction to the analysis of algorithms
https://airtable.com/shrMDYFv3uFlFxAAY
978-0-201-40009-0
Robert Sedgewick and Philippe Flajolet. 1996. An introduction to the analysis of algorithms. Addison-Wesley Longman Publishing Co., Inc., USA.
Robert Sedgewick, Philippe Flajolet
Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field.
Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematics and computer science, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They emphasize the mathematics needed to support scientific studies that can serve as the basis for predicting algorithm performance and for comparing different algorithms on the basis of performance.
Techniques covered in the first half of the book include recurrences, generating functions, asymptotics, and analytic combinatorics. Structures studied in the second half of the book include permutations, trees, strings, tries, and mappings. Numerous examples are included throughout to illustrate applications to the analysis of algorithms that are playing a critical role in the evolution of our modern computational infrastructure.
"[Sedgewick and Flajolet] are not only worldwide leaders of the field, they also are masters of exposition. I am sure that every serious computer scientist will find this book rewarding in many ways."
―From the Foreword by Donald E. Knuth
978-0-201-40009-0
https://aofa.cs.princeton.edu/online/
Math
Concrete Mathematics: A Foundation for Computer Science (2nd Edition)
## learning resources/
https://cs50.harvard.edu/college/2020/fall/
## tools+projects/
https://scratch.mit.edu/users/cs50/
## opportunities/
https://www.edx.org/macquarie-scholarship-application
## people+researchers/
https://cs.harvard.edu/malan/
## conferences+events/
## workshops+talks/
https://www.youtube.com/watch?v=7BObROUFCsE
https://www.youtube.com/watch?v=gQ1y5NUD_RI
## Refereneces