![]() Composite and inverse functions., (b) Relations: Definition and examples. ![]() Injective, surjective and bijective, functions. Domain, co domain and the range of, a function. These concepts are useful to study or, describe objects or problems in computer algorithms and programming, languages., Expected Learning Outcomes:, 1) To provide overview of theory of discrete objects, starting with, relations and partially ordered sets., 2) Study about recurrence relations, generating function and operations, on them., 3) Give an understanding of graphs and trees, which are widely used in, software., 4) Provide basic knowledge about models of automata theory and the, corresponding formal languages., Unit I :, Recurrence Relations, (a) Functions: Definition of function. This course, introduces sets and functions, forming and solving recurrence relations, and different counting principles. (CS) Discrete Mathematics, Semester I (CBCS), Objectives:, The purpose of the course is to familiarize the prospective learners, with mathematical structures that are fundamentally discrete.
0 Comments
Leave a Reply. |