Buy used Bachelor of Technology (B.Tech) books online in India
Buy Second Hand Books, Used Books Online In India
Switching Theory and Logic Design
This comprehensive text on switching theory and logic design is designed for the undergraduate students of electronics and communication engineering, electrical and electronics engineering, electronics and computers engineering, electronics and instrumentation engineering, telecommunication engineering, computer science and engineering, and information technology. It will also be useful to M.Sc (electronics), M.Sc (computers), AMIE, IETE and diploma students. Written in a student-friendly style, this book, now in its Third Edition, provides an in-depth knowledge of switching theory and the design techniques of digital circuits. Striking a balance between theory and practice, it covers topics ranging from number systems, binary codes, logic gates and Boolean algebra to minimization using K-maps and tabular method, design of combinational logic circuits, synchronous and asynchronous sequential circuits, and algorithmic state machines. The book discusses threshold gates and programmable logic devices (PLDs). In addition, it elaborates on flip-flops and shift registers. Each chapter includes several fully worked-out examples so that the students get a thorough grounding in related design concepts. Short questions with answers, review questions, fill in the blanks, multiple choice questions and problems are provided at the end of each chapter. These help the students test their level of understanding of the subject and prepare for examinations confidently.
A Book On C
Now in its fourth edition, A Book on C retains the features that have made it a proven best-selling tutorial and reference on the ANSI C programming language. This edition builds on the many existing strength of the text to improve, update, and extend the coverage of C, and now includes information on transitioning to Java and C++ from C. New and updated programming examples and dissections--the authors' trademark technique for illustrating and teaching language concepts. Recursion is emphasized with revised coverage in both text and exercises. Multifile programming is given greater attention, as are the issues of correctness and type safety. Function prototypes are now used throughout the text. Abstract Data Types, the key concept necessary to understanding objects are carefully covered. Updated material on transitioning to C++, including coverage of the important concepts of object-oriented programming. New coverage is provided on transitioning from C to Java References to key programming functions and C features are provided in convenient files. Preface Starting from Zero An Overview of C Lexical Elements, Operators, and the C System The Fundamental Data Types Flow of Control Functions Arrays, Pointers, and Strings Bitwise Operators and Enumeration Types The Preprocessor Structures and Unions Structures and List Processing Input/Output and the Operating System Advanced Applications Moving from C to C++ Moving from C to Java Appendices The Standard Library Language Syntax ANSI C Compared to Traditional C ASCII Character Codes Operator Precedence and Associability Index A.L. Kelley & Ira Pohl are professors of computer science at the University of California, Santa Cruz.
Theory of Computer Science
This Third Edition, in response to the enthusiastic reception given by academia and students to the previous edition, offers a cohesive presentation of all aspects of theoretical computer science, namely automata, formal languages, computability, and complexity. Besides, it includes coverage of mathematical preliminaries. NEW TO THIS EDITION • Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2) • A rigorous proof of Kleene’s theorem (Chapter 5) • Major changes in the chapter on Turing machines (TMs) – A new section on high-level description of TMs – Techniques for the construction of TMs – Multitape TM and nondeterministic TM • A new chapter (Chapter 10) on decidability and recursively enumerable languages • A new chapter (Chapter 12) on complexity theory and NP-complete problems • A section on quantum computation in Chapter 12. • KEY FEATURES • Objective-type questions in each chapter—with answers provided at the end of the book. • Eighty-three additional solved examples—added as Supplementary Examples in each chapter. • Detailed solutions at the end of the book to chapter-end exercises. The book is designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students offering courses in computer applications.
Fundamentals of Computer Algorithms
Fundamentals of Computer Algorithms is a comprehensive book for undergraduate students of Computer Science Engineering. The book comprises chapters on elementary data structures, dynamic programming, backtracking, algebraic problems, lower bound theory, pram algorithms, mesh algorithms, and hypercube algorithms. In addition, the book consists of several real-world examples to understand the concepts better. This book is indispensable for computer engineers preparing for competitive examinations like GATE and IES.
