 |
|
|
|
 SQL DemystifiedThere’s no easier, faster, or more practical way to learn the really tough subjects
SQL Demystified explains how to use SQL (Structured Query Language)--the ubiquitous programming language for databases. Readers will learn to create database objects, add and retrieve data from a database, and modify... |  |  Add Interactivity to Your Site: The Mini Missing Manual
The days of Web pages that have nothing more than text and a picture or two are long gone. To be competitive in today’s Internet landscape, you need pages that pop. This Mini Missing Manual shows you how to add interactive elements to your pages: menus that expand when a visitor clicks on them, images that change with a mouse roll, and... |  |  Elementary Computability, Formal Languages, and Automata
This book is an introduction to theoretical computer science emphasizing two interrelated areas: the theory of computability {how to tell whether problems are algorithmically solvable) and the theory of formal languages (how to design and use special languages, as for algorithms). Automata {idealized computer devices) are used as precise... |
|
 Parallel Program Design: A Foundation
It is not often that we can welcome the advent of a new theory of programming. Twelve years ago, E.W. Dijkstra published his Discipline of Programming, which is still a definitive source-book on the development of sequential algorithms. And now Chandy and Misra have shown how Dijkstra's methods, and other more recent developments, can be... |  |  Canvas Pocket Reference: Scripted Graphics for HTML5
The Canvas element is a revolutionary feature of HTML5 that enables powerful graphics for rich Internet applications, and this pocket reference provides the essentials you need to put this element to work. If you have working knowledge of JavaScript, this book will help you create detailed, interactive, and animated graphics -- from... |  |  Introduction to Algorithms, Third Edition
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively... |
|
| Result Page: 443 442 441 440 439 438 437 436 435 434 433 432 431 430 429 428 427 426 425 |