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.
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.
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,
main focus of this book is the design process that leads from problem statements
to well-organized solutions; it deemphasizes the study of programming language
details, algorithmic minutiae, and specific application domains. It covers the
following topics: Processing Simple Forms of Data, Processing Arbitrarily Large
Data, Abstracting Designs, Generative Recursion, Accumulating Knowledge,
Changing the State of Variables, Changing Compound Values.
Felleisen, Robert Bruce Findler, Matthew Flatt and Shriram Krishnamurthi
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.