Written in Accordance with CBSE Syllabus for Board Examination to be Held in 2009 and 2010 This textbook is a sequel to the Textbook of Computer Science for Class XI. It is written in a simple, direct style for maximum clarity. It comprehensively covers the Class XII CBSE syllabus of Computer Science (subject code 083). The goal of the book is to develop the student’s proficiency in fundamentals and make the learning process creative, engrossing and interesting. There are practice exercises and questions throughout the text, designed on the pattern of sample question papers published by CBSE. The approach of this book is to teach the students through extensive “skill and drill” type exercises in order to make them high-ranking achievers in the Board examinations. KEY FEATURES  Provides accurate and balanced coverage of topics as prescribed in the CBSE syllabus code 083.  Builds a solid programming foundation in C++.  Students can prepare a Practical File with solved programming examples given in the text.  End-of-chapter questions help teachers prepare assignments for self-practice by the students.  End-of-chapter Programming Exercises help students in preparing for the Board practical examination.  Solved questions at the end of each chapter prepare students for the Board theory examination. For further guidance on how to use this book effectively, e-mail the author using [email protected]

This text is intended for use in the second programming course Programming is a matter of learning by doing. Eric Roberts' Programming Abstractions in C++ gives students opportunities to practice and learn with engaging graphical assignments. A client-first approach to data structures helps students absorb, and then apply the material. Teaching and Learning Experience This program presents a better teaching and learning experience--for you and your students. It will help: Improve Student Comprehension with a Client-first Approach to Data Structures: To aid in student understanding, this book presents the full set of collection classes early. Defer the Presentation of C++ Features that Require a Detailed Understanding of the Underlying Machine: Introducing collection classes early enables students to master other equally important topics without having to struggle with low-level details at the same time. Engage Students with Exciting Graphical Assignments: An open-source library supports graphics and interactivity in a simple, pedagogically appropriate way. Support Instructors and Students: The companion website provides source code, sample run PDFs, answers to review questions, and more.

This practically-oriented textbook presents an accessible introduction to discrete mathematics through a substantial collection of classroom-tested exercises. Each chapter opens with concise coverage of the theory underlying the topic, reviewing the basic concepts and establishing the terminology, as well as providing the key formulae and instructions on their use. This is then followed by a detailed account of the most common problems in the area, before the reader is invited to practice solving such problems for themselves through a varied series of questions and assignments. Topics and features: provides an extensive set of exercises and examples of varying levels of complexity, suitable for both laboratory practical training and self-study; offers detailed solutions to many problems, applying commonly-used methods and computational schemes; introduces the fundamentals of mathematical logic, the theory of algorithms, Boolean algebra, graph theory, sets, relations, functions, and combinatorics; presents more advanced material on the design and analysis of algorithms, including asymptotic analysis, and parallel algorithms; includes reference lists of trigonometric and finite summation formulae in an appendix, together with basic rules for differential and integral calculus. This hands-on study guide is designed to address the core needs of undergraduate students training in computer science, informatics, and electronic engineering, emphasizing the skills required to develop and implement an algorithm in a specific programming language.

Based on the tenet that good habits are formed early, the authors consistently emphasize the principles of structured programming and software engineering. Every complete programme uses a consistent style and as programmes are analyze, styles and standards are further explained.