Mathematics III Year

Paper 1

S.No	Unit	Topic	Link
1	Unit 1	Ramanujan	Link
2	Unit 1	Bisection	Link
3	Unit 1	Regula falsi	Link
4	Unit 1	secant	Link
5	Unit 1	NEWton raphson	Link
6	Unit 2	lagrangen -Interpolation	Link
7	Unit 2	Finite difference operators	Link
8	Unit 2	Interpolation formula using difference	Link
9	Unit 2	gregory newton forward diff interpolation	Link
10	Unit 2	gregory newton BAck ward diff interpolation	Link
11	Unit 2	numerical integration	Link
12	Unit 2	NEWTOn cots	Link
13	Unit 2	trapezoidal rule	Link
14	Unit 2	simpson 1/3rule	Link
15	Unit 2	simpson 3/8 rule	Link
16	Unit 2	gauss integrtion	Link
17	Unit 3	direct method for solving system of linear equ	Link
18	Unit 3	Gauss	Link
19	Unit 3	LU decomposition	Link
20	Unit 3	cholesky decomposition	Link
21	Unit 3	Iterative method	Link
22	Unit 3	jecobi	Link
23	Unit 3	gauss seidel	Link
24	Unit 4	Numerical soulation of ordinary differential equ	Link
25	Unit 4	picaed	Link
26	Unit 4	Taylor	Link
27	Unit 4	Euler	Link
28	Unit 4	Runge Kutta	Link
29	Unit 4	mulitistep method	Link
30	Unit 4	ular method	Link

Paper 2

S.No	Unit	Topic	Link
1	Unit 1	origins,the school vaisheshika,catuskoti,nyaya,jainlogic,buddhist logic,navya nyaya	Link
2	Unit 1	the school vaisheshika	Link
3	Unit 1		Link
4	Unit 1		Link
5	Unit 1		Link
6	Unit 1	buddhist logic Boolean logic and Indian thoughts Influence of Indian logic on modern logic	Link
7	Unit 1	Relations	Link
8	Unit 1	Binary inverse composition and equivalence relation	Link
9	Unit 1		Link
10	Unit 1	Particles of a set Hasse diagram Partial order relation partial order and totally order set	Link
11	Unit 1		Link
12	Unit 1		Link
13	Unit 1	Lattices Definitions and examples Dual,bounded distributive and complementary lattices	Link
14	Unit 1		Link
15	Unit 2	Definition and properties switching circuit and its application logic gate and circuit Bullion function Disjunctive And conjunctive normal forms bools extension theorem Minimize the bullion function using karnaugh map	Link
16	Unit 2	Boolean algebra defination pro. switching circuit and its application	Link
17	Unit 2		Link
18	Unit 2	logic gate and circuit Bullion function	Link
19	Unit 2	Disjunctive And conjunctive normal forms	Link
20	Unit 2		Link
21	Unit 2	bools extension theorem	Link
22	Unit 2		Link
23	Unit 2	Minimize the bullion function using karnaugh map	Link
24	Unit 2		Link
25	Unit 3	Definition and type of graph	Link
26	Unit 3	Subgraphs	Link
27	Unit 3	Walk path and circuit	Link
28	Unit 3	Connected and disconnected graph	Link
29	Unit 3	Euler graph	Link
30	Unit 3	Hamiltonian path and circuit	Link
31	Unit 3	Dijkstra algorithm for shortest path in weighted graph	Link
32	Unit 4	i) Tree and its properties	Link
33	Unit 4	Route binary and spanning tree	Link
34	Unit 4	Rank and nullity graph	Link
35	Unit 4	Krusklas and prims algorithm	Link
36	Unit 4	Cut set and its property	Link
37	Unit 4	Fundamental circuit and cut set	Link
38	Unit 4	Planar graph	Link
39	Unit 4	Kuratowski two graphs	Link
40	Unit 4	Matrix representations of group	Link
41	Unit 4	Incidence adjacency circuit cut set path	Link
42	Unit 4		Link
43	Unit 4		Link