JEFFREY D. ULLMAN Book order (chronological)

This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with the increase of hands-on, practical applications. This new edition comes with Gradiance, an online assessment tool developed for computer science. Gradiance is the most advanced online assessment tool developed for the computer science discipline. With its innovative underlying technology, Gradiance turns basic homework assignments and programming labs into an interactive learning experience for students. By using a series of root questions and hints, it not only tests a student's capability, but actually simulates a one-on-one teacher-student tutorial that allows for the student to more easily learn the material. Through the programming labs, instructors are capable of testing, tracking, and honing their students' skills, both in terms of syntax and semantics, with an unprecedented level of assessment never before offered. For more information about Gradiance, please visit www.aw.com/gradiance .

This textbook was designed for a second course in the computer science database sequence at Stanford, and is preceded by A First Course in Database Systems, 1997. It covers the implementation of a DBMS, notably storage structure, query processing, and transaction management. Annotation c. Book News

Das Lehrbuch richtet sich an Leser mit Grundkenntnissen in Programmierung und behandelt zentrale Modelle und Konzepte der Informatik sowie die erforderlichen Grundlagen der diskreten Mathematik und Logik.

Enthusiastically reviewed by professors and successfully tested at several schools to ensure classroom effectiveness, this authoritative text skillfully integrates the discrete mathematics students of computer science need to know with the models, concepts, logic, and techniques of the field.

This is an introduction to compiler design and covers topics such as context-free grammars, fine state machines, and syntax-directed translation.

This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.