Search results
Results From The WOW.Com Content Network
The magazine said that the book was not easy to read, but that it would expose experienced programmers to both old and new topics. [8] A review of SICP as an undergraduate textbook by Philip Wadler noted the weaknesses of Scheme as an introductory language for a computer science course. [9]
This article is a list of notable unsolved problems in computer science. A problem in computer science is considered unsolved when no solution is known or when experts in the field disagree about proposed solutions.
Brian W. Kernighan, Rob Pike - The Practice of Programming; Donald Knuth - The Art of Computer Programming; Ellen Ullman - Close to the Machine; Ellis Horowitz - Fundamentals of Computer Algorithms; Eric Raymond - The Art of Unix Programming; Gerald M. Weinberg - The Psychology of Computer Programming; James Gosling - The Java Programming Language
Structured Programming: Theory and Practice Computer Graphics: Principles and Practice is a textbook written by James D. Foley , Andries van Dam , Steven K. Feiner , John Hughes , Morgan McGuire, David F. Sklar, and Kurt Akeley and published by Addison–Wesley .
Computer Applications is one of several academic events sanctioned by the University Interscholastic League Computer Applications is designed to test students' abilities to use word processing, spreadsheet, and database applications software, including integration of applications.
The Independent Examinations Board (IEB) is a South African independent assessment agency which offers examinations for various client schools, mostly private schools.It is most prominent in setting examinations for the school-leaving National Senior Certificate (NSC) examination, a qualification that replaced the Senior Certificate and Further Education and Training Certificate.
They cover Artificial Intelligence, a field of computer science. Noteworthy memos in the series include: AI Memo 39, "The New Compiler", describing the first implementation of a self-hosting compiler (for LISP 1.5) AI Memo 41, "A Chess Playing Program", describing Kotok-McCarthy, the first computer program to play chess convincingly
[9]: xii Section 2.5 of ‘Fundamental Algorithms’ is on Dynamic Storage Allocation. Parts of this are used in the Burroughs approach to memory management. Knuth claims credit for “The “boundary-tag” method, introduced in Section 2.5, was designed by the author in 1962 for use in a control program for the B5000 computer.” [9]: 460