Mathematical Foundations of Computer Science (For II Year B.Tech. (I Semester) and I Year M.C.A. (I Semester) Students)КНИГИ » ПРОГРАММИНГ
Название: Mathematical Foundations of Computer Science (For II Year B.Tech. (I Semester) and I Year M.C.A. (I Semester) Students) Автор: G. Shanker Rao Издательство: I.K. International Pvt. Ltd./Dreamtech Press Год: 2020 Страниц: 454 Язык: английский Формат: pdf (true) Размер: 11.8 MB
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 Comprehensive discussion on logic, function, algebraic systems, recurrence relations and graph theory Wide variety of exercises at all levels Several worked out examples.
Chapter 1: Deals with mathematical logic. Propositions, well formed formulas, logical equivalence, tautologies, fallacies, and duality principle were briefly discussed in this chapter. Chapter 2: This chapter provides an introduction to predicate logic. Rules of inference and different methods were briefly discussed in this chapter. Chapter 3: Deals with set theory. Properties of set containment, union of sets. Intersection of sets, complement of a set, difference of sets and their properties were discussed. This chapter presents the notions of relations and functions. It also deals with partially ordered sets, lattices and Hasse diagrams. Chapter 4: Deals with algebraic system. In this chapter we give the basic theory of graphs. Semigraphs, normal subgraphs, cosets. Permutations. Groups Homomorphism and Isomorphism were briefly discussed in this chapter. Chapter 5: Covers elementary combinatorics. Permutations, Combinations and Binomial theorem have been discussed in this chapter. Chapter 6: Deals with recurrence relations. Generating functions, and the methods of solving recurrence relations were discussed in this chapter. Chapter 7: It is devoted to graph theory. This chapter presents the terminology. Connected graphs, bipartite graphs, planarity, trees, spanning trees and binary trees were discussed. Chapter 8: Deals with applications of graph theory. Euler’s, graphs and Hamiltonian graphs have been discussed. Coloring of graphs, and Chromatic polynomial have been explored in this chapter.
The book has a wide variety of exercises at all levels and it can be used for either a one or two semester course.
Скачать Mathematical Foundations of Computer Science
Maths For Computing: A Beginner's Guide Название: Maths For Computing: A Beginner's Guide Автор: Quentin Charatan, Aaron Kans Издательство: Springer Серия: Undergraduate Topics in Computer...
Mathematical Foundations of Computer Science (2025) Название: Mathematical Foundations of Computer Science Автор: Ashwin Lall Издательство: CRC Press Год: 2025 Страниц: 228 Язык: английский Формат: pdf...
Discrete Mathematics: An Open Introduction Название: Discrete Mathematics: An Open Introduction Автор: Oscar Levin Издательство: University of Northern Colorado Год: 2018 Формат: pdf...
Информация
Посетители, находящиеся в группе Гости, не могут оставлять комментарии к данной публикации.
Навигация
Вход на сайт
Реклама
Mathematical Foundations of Computer Science (For II Year B.Tech. (I Semester) and I Year M.C.A. (I Semester) Students) 
