Found 7985 Computer Science Textbooks Products.
Fundamentals of Computing: Logic Problem Solving Programs and Computers (Computer Science Series)
Embracing the joint ACM/IEEE curriculum reforms for undergraduate computer science courses, this text covers such topics as: algorithms and data structures, architecture, artificial intelligence and operating systems. It aims to provide a broad and integrated overview of the field, relating practical activities to the broad principles of computer programming. The book is accompanied by a PASCAL lab manual.
Mathematical Foundations of Computer Science
Mathematical Foundations of Computer Science explains the fundamental concepts in mathematics. It can be used by the students in computer science as an introduction to the underlying ideas of mathematics for computer science. It explains topics like mathematical logic, predicates, relations, functions, combinatorics, algebraic structures and graph theory. It would be useful for the students of B.Tech, BCA, & MCA. Key Features: Comprehensive discussion on logic, function, algebraic systems, recurrence relations and graph theory Wide variety of exercises at all levels Several worked out examples
LR parser: Computer science, Parsing, Context- free grammar, Lookahead, Programming language, Source code, Compiler- compiler, Bottom- up parsing, Deterministic context- free language
In computer science, an LR parser is a parser that reads input from Left to right (as it would appear if visually displayed) and produces a Rightmost derivation. The term LR(k) parser is also used; where the k refers to the number of unconsumed "look ahead" input symbols that are used in making parsing decisions. Usually k is 1 and the term LR parser is often intended to refer to this case. The syntax of many programming languages can be defined by a grammar that is LR(1), or close to being so, and for this reason LR parsers are often used by compilers to perform syntax analysis of source code. In typical usage a parser is referred to in associations with the name of the language whose source code it parses, e.g., a "C++ parser" parses "C++ source code". An LR parser can be created from a context-free grammar by a program called a parser generator or hand written by a programmer. A context-free grammar is classified as LR(k) if there exists an LR(k) parser for it, as determined by the parser generator. An LR parser is said to perform bottom-up parsing because it attempts to deduce the top level grammar productions by building up from the leaves.
Basics of Computer Science (T.N. Diploma)
Main features of this book are: exactly as per syllabus, suggested by the board; includes solution for lab assignments and viva question bank; very easy language used for learning; American English pattern followed throughout the book; a question bank, titled 'Exercises' have been inserted at the end of each chapter; practical guidelines in the form of step by step instructions at the end of each chapter; and, lots of examples and figures have been included in each chapter. This book will serve as a perfect teaching guide for the teachers and a good reference book for the students.
1 · 2 · 3 · 4 · 5 · 6 · 7 · 8 · 9 · 10 · 11 · 12 · 13 · 14 · 15 · 16 · 17 · 18 · 19 · 20
21 · 22 · 23 · 24 · 25 · 26 · 27 · 28 · 29 · 30 · 31 · 32 · 33 · 34 · 35 · 36 · 37 · 38 · 39 · 40
41 · 42 · 43 · 44 · 45 · 46 · 47 · 48 · 49 · 50 · 51 · 52 · 53 · 54 · 55 · 56 · 57 · 58 · 59 · 60
61 · 62 · 63 · 64 · 65 · 66 · 67 · 68 · 69 · 70 · 71 · 72 · 73 · 74 · 75 · 76 · 77 · 78 · 79 · 80
81 · 82 · 83 · 84 · 85 · 86 · 87 · 88 · 89 · 90 · 91 · 92 · 93 · 94 · 95 · 96 · 97 · 98 · 99 · 100
21 · 22 · 23 · 24 · 25 · 26 · 27 · 28 · 29 · 30 · 31 · 32 · 33 · 34 · 35 · 36 · 37 · 38 · 39 · 40
41 · 42 · 43 · 44 · 45 · 46 · 47 · 48 · 49 · 50 · 51 · 52 · 53 · 54 · 55 · 56 · 57 · 58 · 59 · 60
61 · 62 · 63 · 64 · 65 · 66 · 67 · 68 · 69 · 70 · 71 · 72 · 73 · 74 · 75 · 76 · 77 · 78 · 79 · 80
81 · 82 · 83 · 84 · 85 · 86 · 87 · 88 · 89 · 90 · 91 · 92 · 93 · 94 · 95 · 96 · 97 · 98 · 99 · 100









Top Search
Last Search