Computer Science BooksPrograming Theory Books

Programming from the Ground Up (J. Bartlett)

Advertisement

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.

Author(s):

s326 Pages

Advertisement

Advertisement

Similar Books
Programming Language Concepts Lecture Notes

Programming Language Concepts Lecture Notes

This note explains the following topics: Object-oriented programming, Data encapsulation with classes, Subclasses and inheritance, Abstract classes, Exception handling, Reflection, Concurrent programming, Functional programming, Logic programming, Scripting languages.

s182 Pages
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
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
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.

s Pages
The Programmers Stone (Alan  Colston)

The Programmers Stone (Alan Colston)

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

s 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
Programming from Specifications (Carroll Morgan)

Programming from Specifications (Carroll Morgan)

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

s Pages