Computer Science BooksPrograming Theory Books

A Gentle Introduction to Programming (A. Cumming)

Advertisement

A Gentle Introduction to Programming (A. Cumming)

A Gentle Introduction to Programming (A. Cumming)

Currently this section contains no detailed description for the page, will update this page soon.

Author(s):

s Pages

Advertisement

Advertisement

Similar Books
Essential Coding Theory

Essential Coding Theory

This book explains the following topics: Linear Codes, Probability as Fancy Counting and the q-ary Entropy Function, Combinatorics, The Greatest Code of Them All: Reed-Solomon Codes, What Happens When the Noise is Stochastic: Shannon's Theorem, Bridging the Gap Between Shannon and Hamming: List Decoding, Code Constructions, Code Concatenation, Algorithms, Decoding Concatenated Codes, Efficiently Achieving the Capacity of the BSCp, Efficient Decoding of Reed-Solomon Codes, Efficiently Achieving List Decoding Capacity, Applications.

sNA Pages
Structure and Interpretation of Computer Programs

Structure and Interpretation of Computer Programs

This note covers the following topics: Functions, Values and Side Effects, Control and Higher-Order Functions, Environments and Lambda, Newton's Method and Recursion, Data Abstraction, Sequences and Iterables, Objects, Lists, and Dictionaries, Mutable Data Types, Object-Oriented Programming, Inheritance, Generic Functions, Coercion and Recursive Data, Functional Programming, Declarative Programming, Unification, MapReduce, Parallelism.

sNA Pages
Theory     in Programming Practice (PDF 250P)

Theory in Programming Practice (PDF 250P)

Covered topics are: Text Compression, Error Detection and Correction, Cryptography, Finite State Machines, Recursion and Induction, Relational Database, String Matching and Parallel Recursion.

s250 Pages
Algorithmic Introduction to Coding Theory

Algorithmic Introduction to Coding Theory

This note introduces the theory of error-correcting codes to computer scientists. This theory, dating back to the works of Shannon and Hamming from the late 40's, overflows with theorems, techniques, and notions of interest to theoretical computer scientists. The course will focus on results of asymptotic or algorithmic significance. Principal topics include: Construction and existence results for error-correcting codes, Limitations on the combinatorial performance of error-correcting codes, Decoding algorithms, Applications in computer science.

sNA Pages
Programming from the Ground Up (J. Bartlett)

Programming from the Ground Up (J. Bartlett)

This book covers the following topics: Computer Architecture, Functions, Files, Reading and Writing Simple Records, Developing Robust Programs, Sharing Functions with Code Libraries, Intermediate Memory Topics, High-Level Languages and Optimization.

s326 Pages
Structure and Interpretation of Computer Programs, 2nd Edition, (H. Abelson, G.J. Sussman) Videos

Structure and Interpretation of Computer Programs, 2nd Edition, (H. Abelson, G.J. Sussman) Videos

This book emphasizes the role of computer languages as vehicles for expressing knowledge and it presents basic principles of abstraction and modularity, together with essential techniques for designing and implementing computer languages.

sNA Pages
Concepts, Techniques, and Models of Computer Programming (P. Roy, S. Harid, PDF, 939p) Mirror

Concepts, Techniques, and Models of Computer Programming (P. Roy, S. Harid, PDF, 939p) Mirror

This book covers the following topics: Introduction to Programming, General Computation Models, Declarative Programming Techniques, Declarative Concurrency, Relational Programming, Object-Oriented Programming, Encapsulated State, Concurrency and State, Specialized Computation Models, Semantics and Virtual Machines.

s567 Pages
Learn to Program A Tutorial for the Future Programmer (Chris Pine)

Learn to Program A Tutorial for the Future Programmer (Chris Pine)

Currently this section contains no detailed description for the page, will update this page soon.

s Pages