Effective theories in programming practice / (Record no. 52176)

MARC details
000 -LEADER
fixed length control field 02082nam a22002537a 4500
003 - CONTROL NUMBER IDENTIFIER
control field IN-BdCUP
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240429164758.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 240429b ii ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781450399715
040 ## - CATALOGING SOURCE
Language of cataloging eng
Transcribing agency IN-BdCUP
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.13
Item number MIS
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Misra, Jayadev
Relator term Author
245 ## - TITLE STATEMENT
Title Effective theories in programming practice /
Statement of responsibility, etc. Jayadev Mishra.
250 ## - EDITION STATEMENT
Edition statement 1st Edition
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. New York :
Name of publisher, distributor, etc. Association for Computing Machinery,
Date of publication, distribution, etc. 2022.
300 ## - PHYSICAL DESCRIPTION
Extent xx, 541 p.;
Dimensions 26 cm
Type of unit PB
490 ## - SERIES STATEMENT
Series statement ACM Series Books, #47.
International Standard Serial Number 23746769
520 ## - SUMMARY, ETC.
Summary, etc. Set theory, logic, discrete mathematics, and fundamental algorithms (along with their correctness and complexity analysis) will always remain useful for computing professionals and need to be understood by students who want to succeed. This textbook explains a number of those fundamental algorithms to programming students in a concise, yet precise, manner. The book includes the background material needed to understand the explanations and to develop such explanations for other algorithms. The author demonstrates that clarity and simplicity are achieved not by avoiding formalism, but by using it properly. The book is self-contained, assuming only a background in high school mathematics and elementary program writing skills. It does not assume familiarity with any specific programming language. Starting with basic concepts of sets, functions, relations, logic, and proof techniques including induction, the necessary mathematical framework for reasoning about the correctness, termination and efficiency of programs is introduced with examples at each stage. The book contains the systematic development, from appropriate theories, of a variety of fundamental algorithms related to search, sorting, matching, graph-related problems, recursive programming methodology and dynamic programming techniques, culminating in parallel recursive structures
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer programming
Topical term or geographic name entry element Computer programming Textbooks
Topical term or geographic name entry element Textbooks
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type Book
Suppress in OPAC No
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection Home library Current library Date acquired Source of acquisition Order Number Cost, normal purchase price Bill number Total checkouts Full call number Barcode Date last seen Actual Cost, replacement price Bill Date Koha item type
    Dewey Decimal Classification     Computer Science and Technology Ranganathan Library Ranganathan Library 13/03/2024 Today & Tomorrow's Printers and Publishers 23-24/389 2650.00 TTPP/573/23-24   005.13 MIS 050467 29/04/2024 3312.00 08/03/2024 Book
This system is made operational by the in-house staff of the CUP Library.