Search results
Results from the WOW.Com Content Network
Concepts, Techniques, and Models of Computer Programming is a textbook published in 2004 about general computer programming concepts from MIT Press written by Université catholique de Louvain professor Peter Van Roy and Royal Institute of Technology, Sweden professor Seif Haridi.
Structure and Interpretation of Computer Programs (SICP) is a computer science textbook by Massachusetts Institute of Technology professors Harold Abelson and Gerald Jay Sussman with Julie Sussman. It is known as the "Wizard Book" in hacker culture . [ 1 ]
Program comprehension (also program understanding or [source] code comprehension) is a domain of computer science concerned with the ways software engineers maintain existing source code. The cognitive and other processes involved are identified and studied. [1] The results are used to develop tools and training. [2]
Compilers: Principles, Techniques, and Tools [1] is a computer science textbook by Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman about compiler construction for programming languages. First published in 1986, it is widely regarded as the classic definitive compiler technology text.
The methods of neuro-linguistic programming are the specific techniques used to perform and teach neuro-linguistic programming, [1] [2] which teaches that people are only able to directly perceive a small part of the world using their conscious awareness, and that this view of the world is filtered by experience, beliefs, values, assumptions, and biological sensory systems.
The program evaluation and review technique (PERT) is a statistical tool used in project management, which was designed to analyze and represent the tasks involved in completing a given project. PERT was originally developed by Charles E. Clark for the United States Navy in 1958; it is commonly used in conjunction with the Critical Path Method ...
Nakayama's lemma: Let U be a finitely generated right module over a (unital) ring R. If U is a non-zero module, then U · J( R ) is a proper submodule of U . [ 17 ]
In mathematics, a Nakayama algebra or generalized uniserial algebra is an algebra such that each left or right indecomposable projective module has a unique composition series. They were studied by Tadasi Nakayama ( 1940 ) who called them "generalized uni-serial rings".