000			02082nam a22002537a 4500
003			IN-BdCUP
005			20240429164758.0
008			240429b ii ||||| |||| 00| 0 eng d
020			_a9781450399715
040			_beng _cIN-BdCUP
041			_aeng
082			_a005.13 _bMIS
100			_aMisra, Jayadev _eAuthor
245			_aEffective theories in programming practice / _cJayadev Mishra.
250			_a1st Edition
260			_aNew York : _bAssociation for Computing Machinery, _c2022.
300			_axx, 541 p.; _c26 cm _fPB
490			_aACM Series Books, #47. _x23746769
520			_aSet 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			_aComputer programming
650			_aComputer programming Textbooks
650			_aTextbooks
942			_2ddc _cBK _n0
999			_c52176 _d52176