Sociology will always remain a dynamic and living science due to its roots in the study of the human condition with reference to human action and interaction. Nursing sociology aims to understand society and how individuals function within it, within the health sector and specifically within the current nursing scenario, in order to provide holistic patient care. Nursing sociology is written from a multicultural perspective, reflecting on South Africa's diversity and explaining complex sociological ideas in a way that is easy to follow. In this 6th edition, substantial attention has been given to aspects of socialisation, social interaction, structure and relationships, social stratification, group dynamics, institutions, organisations and social problems encountered in nursing practice. Pertinent examples of the manifestation of sociology in the nursing profession and its practice as currently experienced in South Africa are also included. Activities allow students to debate issues arising from sociology in the nursing context in group format in order to promote creative thinking and comprehension. Nursing sociology provides students with a clear, easy-to-understand sociological text specifically oriented towards nursing, that emphasises specific aspects and creativity within the nursing environment.

Praise for the First Edition "...complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity." -Zentralblatt MATH A thorough revision based on advances in the field of computational complexity and readers feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as: * A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science * Additional exercises at varying levels of difficulty to further test comprehension of the presented material * End-of-chapter literature reviews that summarize each topic and offer additional sources for further study Theory of Computational Complexity, Second Edition, is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research. A thorough revision based on advances in the field of computational complexity and readers feedback, the Second Edition of Theory of Computational Complexity presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered. Maintaining extensive and detailed coverage, Theory of Computational Complexity, Second Edition, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The Second Edition also features recent developments on areas such as NP-completeness theory, as well as: A new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science Additional exercises at varying levels of difficulty to further test comprehension of the presented material End-of-chapter literature reviews that summarize each topic and offer additional sources for further study Theory of Computational Complexity, Second Edition, is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research.

A practical introduction to essential topics at the core of computer science

Automata, formal language, and complexity theory are central to the understanding of computer science. This book provides, in an accessible, practically oriented style, a thorough grounding in these topics for practitioners and students on all levels.

Based on the authors’ belief that the problem-solving approach is the most effective, Problem Solving in Automata, Languages, and Complexity collects a rich variety of worked examples, questions, and exercises designed to ensure understanding and mastery of the subject matter. Building from the fundamentals for beginning engineers to more advanced concepts, the book examines the most common topics in the field, including:

• Finite-state automata
• Context-free grammars
• Turing machines
• Recursive and recursively enumerable languages
• Computability theory
• Complexity classes
• NP-completeness

Focused, practical, and versatile, Problem Solving in Automata, Languages, and Complexity gives students and engineers a solid grounding in essential areas in computer science.

First published in 1981. Routledge is an imprint of Taylor & Francis, an informa company.

The Pathways series assists students in achieving the National Certificate (Vocational) qualification. Pathways not only equips students with the required knowledge, understanding and practical skills, but also empowers them to apply this learning with confidence in the classroom and ultimately in the workplace. Each Pathways Student Book is clearly structured and easy to use. Each topic covers every Subject Outcome, Learning Outcome and Assessment Standard. Accessible, easy-to-understand language makes learning easy. Concepts are clearly defined. A glossary at the beginning of each topic clearly explains important words and terminology. Informative artwork supports the text. This Student Book is accompanied by a Lecturer’s Guide.

The Pathways series assists students in achieving the National Certificate (Vocational) qualification. Pathways not only equips students with the required knowledge, understanding and practical skills, but also empowers them to apply this learning with confidence in the classroom and ultimately in the workplace. Each Pathways Student Book is clearly structured and easy to use. Each topic covers every Subject Outcome, Learning Outcome and Assessment Standard. Accessible, easy-to-understand language makes learning easy. Concepts are clearly defined. A glossary at the beginning of each topic clearly explains important words and terminology. Informative artwork supports the text. This Student Book is accompanied by a Lecturer’s Guide.