The author is the leading programming language designer of our time and in this book, based on a course for 2nd-year students at, he closes the gap between hardware and software design. He encourages students to put the theory to work in exercises that include lab work culminating in the design of a simple yet complete computer. In short, a modern introduction to designing circuits using state-of-the-art technology and a concise, easy to master hardware description language (Lola).

This practical introduction explains exactly how digital circuits are designed, from the basic circuit to the advanced system. It covers combinational logic circuits, which collect logic signals, to sequential logic circuits, which embody time and memory to progress through sequences of states. The primer also highlights digital arithmetic and the integrated circuits that implement the logic functions.Based on the author's extensive experience in teaching digital electronics to undergraduates, the book translates theory directly into practice and presents the essential information in a compact, digestible style. Worked problems and examples are accompanied by abbreviated solutions, with demonstrations to ensure that the design material and the circuits' operation are fully understood.This is essential reading for any electronic or electrical engineering student new to digital electronics and requiring a succinct yet comprehensive introduction.

This book focuses on the basic principles of digital electronics and logic design. It is designed as a textbook for undergraduate students of electronics, electrical engineering, computer science, physics, and information technology. The text covers the syllabi of several Indian and foreign universities. It depicts the comprehensive resources

This textbook provides a thorough and systematic introduction to designing digital circuits. The author is the leading programming language designer of our time and in this book, based on a course for 2nd-year students at the Federal Institute of Technology (ETH) in Zurich, he aims to close the gap between hardware and software design. He encourages the student to put the theory to work in exercises that include lab work culminating in the design of a simple yet complete computer. The lab work is based on a workstation equipped with a single field programmable gate array chip and software tools for entering, editing, and analyzing designs. This text is a modern introduction to designing circuits using state-of-the-art technology and a concise, easy to master hardware description language (Lola).

This textbook covers latest topics in the field of digital logic design along with tools to design the digital logic circuits. It is designed for the undergraduate students pursuing courses in areas of engineering disciplines such as Electrical and Electronics, Electronics and Communication, Electronics and Instrumentation, Telecommunications, and Computer Science and Engineering. It is also useful as a text for MCA, M.Sc. (Electronics) and M.Sc. (Computer Science) students. The contents of this book have been organized in a systematic manner so as to inculcate sound knowledge and concepts amongst its readers. It covers basic concepts in combinational and sequential circuit design such as digital electronics, digital signal processing, number system, data and information representation and, computer arithmetic. Besides this, advanced topics in digital logic design such as various types of counter design, register design, ALU design, threshold circuit and, digital computer design are also discussed in the book. Key features • Question Bank containing numerous multiple choice questions with their answers • Short answer questions, long answer questions and multiple choice questions at the end of each chapter • Extensive use of graphs and diagrams for better understanding of the subject

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.