Computer Programming : Syllabus/Content
01_Syllabus and Introduction 01A_History of Computing hardware 01B_Evolution of Programming Languages 01C_Evolving Comp Sc in JU
02_Historical developments in NS Logic and Boolean Algebra Number System and Binary numbers Data_representation Binary Arithmetic Text_representation
03_Computer_Architecture Computer_memory CPP_IDE_Compiler Header_ C_Libraries C_PreProcessor
04_Algorithms and Flowcharts Structure of a C Program IO_&_File_IO
C_Expressions C_Variables Arrays and Strings Control Statements
C_Function C_Pointer Array & Function Pointers DMA
Structures_Unions Link List macro_enum_CLA C_codes
PS_Total PS_Quiz PS_CT1 PS_CT2
Introduction_Total GgDrvFldr
Numerical Methods : Syllabus/Content
1. Approximations and Errors associated with numerical methods.
2. Solution of non-linear equations: Bisection method, method of false position, Newton-Raphson method.
3. Solution of linear simultaneous equations: Direct methods / Gauss-Jordan elimination, matrix inversion using Gauss-Jordan elimination
Iterative methods / Jacobi’s method
4. Methods for interpolation: Newton’s forward difference formula, Newton’s backward difference formula, Lagrange’s formula.
5. Curve fitting: Method of least squared error
6A. Methods for differentiation: Computation of derivatives using Newton’s forward/backward/central difference formulae.
6B. Methods for Integration: Trapezoidal method, Simpson’s method.
7A. Solution of differential equations: Euler’s method, modified Euler’s method, Runge-Kutta 2nd and 4th order formulae
7B. ----- optional ------ . Solution of partial differential equations