Computer Science BooksPrograming Theory Books

Theory in Programming Practice (PDF 250P)

Advertisement

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.

Author(s):

s250 Pages

Advertisement

Advertisement

Similar Books
Notes on coding theory

Notes on coding theory

This note covers the following topics: The naive way of coding, Coding schemes for binary channels and Shannon theorem, Shannon theorem, Exponential growth rate, Binary codes, The Hamming bound and perfect codes, The Gilbert-Varshamov bound, Error probability estimations, Union bound for BER, State representations and trellises of general codes, Convolutional codes, Tanner graphs and factor graphs.

sNA Pages
Programming Languages Theory and Practice

Programming Languages Theory and Practice

This note covers the following topics: Inductive Definitions, Transition Systems, Defining a Language, Concrete Syntax, Abstract Syntax Trees, Abstract Binding Trees, Functional Language, Control and Data Flow, Imperative Functional Programming, Cost Semantics and Parallelism, Data Structures and Abstraction, Lazy Evaluation, Dynamic Typing, Subtyping and Inheritance, Concurrency.

s277 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
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
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
How to Think Like a Computer Scientist

How to Think Like a Computer Scientist

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

s Pages