|
Discrete Event System Simulation by Jerry Banks,John S. Carson, II,Barry L. Nelson,David M. Nicol Design and Analysis of Algorithms by PANNEERSELVAM, R. Design & Analysis of Computer Algorithms by Alfred V. Aho Artificial Intelligence by George F. Luger Introduction To Automata Theory, Languages, And Computation By John E. Hopcroft,rajeev Motwani, 0000 To 8085: Introduction To Microprocessors For Engineers And Scientists By Ghosh & Sridhar Languages And Machines: An Introduction To The Theory Of Computer Science By Thomas A. Sudkamp Compilers: Principles, Techniques, & Tools by Alfred V. Aho,Ravi Sethi, Jeffrey D. Ullman  |
|
|
|
Home of the highest quality of Computer Books. Our books provides a basic treatment of discrete-event simulation, including the proper collection and analysis of data, the use of analytic techniques, verification and validation of models, and designing simulation experiments
|
|
| 
| Discrete Event System Simulation by Jerry Banks,John S. Carson, II,Barry L. Nelson,David M. Nicol  This book provides a basic treatment of discrete-event simulation, including the proper collection and analysis of data, the use of analytic techniques, verification and validation of models, and designing simulation experiments. It offers an up-to-date treatment of simulation of manufacturing and material handling systems, computer systems, and computer networks.
|
Design and Analysis of Algorithms by PANNEERSELVAM, R. This highly structured text provides comprehensive coverage of design techniques of algorithms. It traces the complete development of various algorithms in a stepwise approach followed by their pseudo-codes to build an understanding of their application in practice.
With clear explanations, the book analyzes different kinds of algorithms such as distance-based network algorithms, search algorithms, sorting algorithms, probabilistic algorithms, and single as well as parallel processor scheduling algorithms. Besides, it discusses the importance of heuristics, benchmarking of algorithms, cryptography, and dynamic programming.
|
|
|
| Design & Analysis of Computer Algorithms by Alfred V. Aho The Design and Analysis of Computer Algorithms introduces the basic data structures and programming techniques often used in efficient algorithms. It covers the use of lists, push-down stacks, queues, trees, and graphs.
With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter.
|
Artificial Intelligence by George F. Luger Much has changed since the early editions of Artificial Intelligence were published. To reflect this the introductory material of this fifth edition has been substantially revised and rewritten to capture the excitement of the latest developments in AI work.
Artificial intelligence is a diverse field. To ask the question "what is intelligence?" is to invite as many answers as there are approaches to the subject of artificial intelligence. These could be intelligent agents, logical reasoning, neural networks, expert systems, evolutionary computing and so on. This fifth edition covers all the main strategies used for creating computer systems that will behave in "intelligent" ways. It combines the broadest approach of any text in the marketplace with the practical information necessary to implement the strategies discussed, showing how to do this through Prolog or LISP programming
|
|
|
| Introduction To Automata Theory, Languages, And Computation By John E. Hopcroft,rajeev Motwani, 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.
* Companion Site
* Post Review
* View User Reviews
* View Published Reviews
|
0000 To 8085: Introduction To Microprocessors For Engineers And Scientists By Ghosh & Sridhar The popular 8085 processor and its peripherals have been used to explain the basic concepts of microprocessor operation and system realization. The text can be used by electrical engineering undergraduates in their first course on microprocessors, and by engineering students in other disciplines and students of science with some preparation in digital electronics.
|
|
|
| Languages And Machines: An Introduction To The Theory Of Computer Science By Thomas A. Sudkamp The third edition of languages and machines: an introduction to the theory of computer science provides readers with a mathematically sound presentation of the theory of computer science at a level suitable for junior and senior level computer science majors. The theoretical concepts and associated mathematics are made accessible by a "learn as you go" approach that develops an intuitive understanding of the concepts through numerous examples and illustrations. In this edition the presentation has been enhanced by increasing the number of examples, expanding the selection of topics particularly in the area of computational complexity, and providing a flexible format giving instructors the ability to design their courses that concentrate on specific areas such as automata theory, computability theory, or computational complexity.
|
Compilers: Principles, Techniques, & Tools by Alfred V. Aho,Ravi Sethi, Jeffrey D. Ullman Compilers: principles, techniques and tools, known to professors, students, and developers worldwide as the "dragon book," is available in a new edition. Every chapter has been completely revised to reflect developments in software engineering, programming languages, and computer architecture that have occurred since 1986, when the last edition published. The authors, recognizing that few readers will ever go on to construct a compiler, retain their focus on the broader set of problems faced in software design and software development.
|
|
|
© Elbee Marketing. All Rights Reserved (Terms of Use)