This One Week Series is Written in English Language in Question Answer Series According to syllabus of Rajasthan University. 

UNIT-I Number Systems:-

 Number systems- natural numbers, integers numbers, Real Numbers, complex numbers, arithmetic modulo a positive Integer. Radix representation decimal and binary). Change of radix decimal to binary and vice versa). Binomial Theorem and Mathematical Induction: Binomial theorem for positive integral indices general and middle term in binomial expansion with simple applications. Some simple problems of Principle of Mathematical induction.

Recurrence Relations and Generating Functions: Recurrence relation, linear recurrence relations with constant coefficients, solution of linear recurrence relation with constant coefficients Controlling functions, Solution of recurrence relations using generating functions

UNIT-II Sets: Definition of sets, representation of sets, type of sets, Operations on sets, Sub sets, Power set, Universal set, Complement of a set, Union and Intersection of two sets. Venn diagrams, De-Morgans law of sets, Partition of sols, Duality Principles. Relations: Relation, Types of relations reflexive, symmetric, anti-symmetric, transitive equivalence and partial order relation. Relation and diagraphs, Cartesian product of two sets. Functions Function, domain and range, One to one and onto functions, composite functions, inverse of a functions. Binary operations

UNIT -III Logic & Proofs Proposition, Conjunction, Disjunction, Negation Compound proposition Conditional proposition (hypothesis, conclusion, necessary and sufficient condition and logical equivalence, Application of Booleat algebra cond closed switches in series and parallel). Logic gals ad Circuits

UNIT-IV Graph: Basic terminology. Directed and undirected graphs, path and connectivity, types of graphs Null, Regular, Complementary. Complete, Weighted and Biparte. Subgraphs, Operation on graphs- union, intersection, complement product and composition Representation of graphs in computer tomory matrix representation). Adjacency matrix, lielce matrix Fusion of Graphs

Isomorphic and Homeomorphic graphs, paths and Cyles, Eulerian and Hamilton graphs, shortest path algorithms, Planar grapes, graph online. Shortest path in the Tranche salesman

UNIT-V Tree Definition of tree, Fundamental terminologies Node, Child, Parent, Root, Leal, Level Height and Sabling Rooled trees, Ordered tree, Binary tree, Complete binary true, Tree of an algebrale expression, Tree searching traversel algorithms) Preorder, Inorder and Postorder. Distance and centre, Relation between general tree and binury tree, Spanning tress, Algorithms for minimal spanning trees (Kruski's and Prim's), Game Tree

Its also useful for Shekhawati, Matsya, Brij, JNU, MGSU, MDS, Kota, MLSU University Students. Almost All Units are covered according to syllabus.