DISCRETE MATHEMATICS-HINDI: DISCRETE MATHEMATICS - HINDI

· ·
Ram Prasad Publications(R.P.H.)
3.0
Maoni 2
Kitabu pepe
208
Kurasa
Ukadiriaji na maoni hayajahakikishwa  Pata Maelezo Zaidi

Kuhusu kitabu pepe hiki

Unit-1 Boolean functions-disjunctive and cunjunctive normal forms (canonical and dual canonical), Bool's expansion theorem. Relations–Binary relation. Inverse relation, Composite relation. Equivalence relation, Equivalence classes and its properties Partition of a set.

Unit-2 Partial order relation, partially ordered sets, totally ordered sets. Hasse diagram, maximal and minimal element, first and last element. Lattice—definition and examples, dual lattice, bounded lattice, distributive lattice, complemented lattice.

Unit-3 Graph—Definition, type of graphs, Subgraphs, walk, path, circuit, connected and disconnected graphs. Euler graph. Hamiltonian path and circuit, shortest path in weighted graph. Dijkstra's Algorithm for shortest paths.

Unit-4 Tree and its properties, Rooted tree, Binary tree, Spanning tree, Rank and nullity of a graph. Kruskal's Algorithm and Prim's Algorithm.

Unit-5 Matrix representation of graphs—Incidence and Adjacency matrix. Cutset and its properties, Planar graphs (definition) Kuratowski's two graphs.

Ukadiriaji na maoni

3.0
Maoni 2

Kadiria kitabu pepe hiki

Tupe maoni yako.

Kusoma maelezo

Simu mahiri na kompyuta vibao
Sakinisha programu ya Vitabu vya Google Play kwa ajili ya Android na iPad au iPhone. Itasawazishwa kiotomatiki kwenye akaunti yako na kukuruhusu usome vitabu mtandaoni au nje ya mtandao popote ulipo.
Kompyuta za kupakata na kompyuta
Unaweza kusikiliza vitabu vilivyonunuliwa kwenye Google Play wakati unatumia kivinjari cha kompyuta yako.
Visomaji pepe na vifaa vingine
Ili usome kwenye vifaa vya wino pepe kama vile visomaji vya vitabu pepe vya Kobo, utahitaji kupakua faili kisha ulihamishie kwenye kifaa chako. Fuatilia maagizo ya kina ya Kituo cha Usaidizi ili uhamishe faili kwenye visomaji vya vitabu pepe vinavyotumika.