Concepts, Techniques, and Models of Computer Programming (P. Roy, S. Harid, PDF, 939p) Mirror
Advertisement
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.
This PDF Programming Fundamentals covers the following topics
related to Programing Theory : Introduction to Programming Systems, Data and
Operators, Functions, Conditions, Loops, Arrays, Strings and Files,
Object-Oriented Programming.
Author(s): Kenneth Leroy Busbee, Dave
Braunschweig
This note covers the following
topics: Sphere Packing and Shannon’s Theorem, Linear Codes, Hamming Codes,
Generalized Reed-Solomon Codes, Modifying Codes, Codes over Subfields, Cyclic
Codes, Weight and Distance Enumeration.
This book has been written as
lecture notes for students who need a grasp of the basic principles of linear
codes. Topics covered includes: Shannon theory and coding, Coding theory,
Decoding of linear codes and MacWilliams identity, Coding theory - Constructing
New Codes, Coding theory - Bounds on Codes, Reed-Muller codes, Fast decoding of
RM codes and higher order RM codes.
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.
Covered topics
are: Text Compression, Error Detection and Correction, Cryptography, Finite
State Machines, Recursion and Induction, Relational Database, String
Matching and Parallel Recursion.
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.
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.