#1
| |||
| |||
Bharathidasan University UG Syllabus
I am a UG BCA student of Bharathidasan University and I am searching here for my syllabus of the course so please can you give me the syllabus and provide me the page where I can download the syllabus? As you are looking for the syllabus of the UG BCA of Bharathidasan University here I am giving you its syllabus as given below:- I-Semester course:- Language Course – I (LC) – Tamil*/Other Languages II English Language Course - I (ELC) III Core Course – I (CC) Core Course – II (CC) First Allied Course –I (AC) First Allied Course – II (AC) CORE COURSE – I – PROGRAMMING IN C Unit I Introduction to C – Constants, Variables, Data types – Operator and Expressions. Unit II Managing Input and Output operations – Decision Making and Branching – Decision making and Looping. Unit III Arrays – Character Arrays and Strings – User defined Functions. Unit IV Structures and unions – Pointers – File management in C. Unit V Dynamic memory allocation – Linked lists- Preprocessors – Programming Guide lines. Text Book: 1.Balagurusamy E .,Programming in ANSI C , Third edition, Tata McGraw-Hill, 2006 ( ISBN – 0-07-053477-2 ) [Unit-1 (Chapters - 1, 2, 3 ) ; Unit-2 (Chapters – 4, 5, 6 ) ; Unit-3 (Chapters – 7,8,9) ; Unit-4 (Chapters – 10, 11,12); Unit-5 (Chapters – 13,14,15) ] Reference Book: 1. Byron S Gottfried,“Programming with C”, Schaum‟s Outline Series – Tata McGraw Hill Publications, New Delhi. ******* Core Course II – Programming in C: LAB 1. Solution of a Quadratic Equation (all cases). 2. Sum of Series (sine, cosine, exponential). 3. Ascending and descending order of numbers using Arrays (Use it to find Largest and Smallest Numbers). 4. Sorting of names in Alphabetical order. 5. Matrix operations (Addition, Subtraction, Multiplication – using functions. 6. Finding factorials, generating Fibonacci Numbers using recursive functions. 7. String manipulations without using string functions (string length, string comparison, string copy, palindrome checking, counting words and lines in strings (Use function pointers). 8. Creation and processing of Sequential files for payroll and Mark list preparation (use structures for Record Description). 9. Basic exercise in dynamic memory allocation & Pointer usage. 10. Solution of Algebraic and transcendental Equations: Newton-Ralphson method. 11. Numerical Integration – Trapezoidal Rule. 12. Numerical Integration –Simpson‟s (1/3, 3/8) Rules. ******* ALLIED COURSE I (AC) - ALGEBRA AND CALCULUS UNIT I Theory of Equations: Relation between roots & coefficients – Transformations of Equations – Diminishing ,Increasing & multiplying the roots by a constant- Forming equations with the given roots –Rolle‟s Theorem, Descarte‟s rule of Signs(statement only) –simple problems. UNIT II Matrices : Singular matrices – Inverse of a non-singular matrix using adjoint method - Rank of a Matrix –Consistency - Characteristic equation , Eigen values, Eigen vectors – Cayley Hamilton‟s Theorem (proof not needed) –Simple applications only UNIT III Differentiation: Maxima & Minima – Concavity , Convexity – Points of inflexion - Partial differentiation – Euler‟s Theorem - Total differential coefficients (proof not needed ) –Simple problems only. UNIT IV Integration : Evaluation of integrals of types 1] dxcbxaxqpx2 2] dxcbxaxqpx2 3] xbadxsin 4] xbadxcos Evaluation using Integration by parts – Properties of definite integrals – Fourier Series in the range ( 0 , 2 ) – Odd & Even Functions – Fourier Half range Sine & Cosine Series UNIT V Differential Equations: Variables Separables – Linear equations – Second order of types ( a D 2 + b D + c ) y = F ( x ) where a,b,c are constants and F ( x ) is one of the following types ( i ) e K x ( ii ) sin ( kx ) or cos ( kx ) ( iii ) x n , n being an integer (iv ) e K x f (x ) TEXT BOOK(S) [1] T.K.Manickavasagam Pillai & others, Algebra, Volume I, S.V Publications , 1985 Revised Edition (Units I, II ) [2] S. Narayanan, T.K. Manicavachagam Pillai, Calculus, Vol.II, S. Viswanathan Pvt Limited, 2003. (Units III, IV and V) REFERENCE(S) [1] M.L. Khanna, Differential Calculus, Jaiprakashnath and Co., Meerut-2004. ******* ALLIED COURSE – II (AC) NUMERICAL ANALYSIS AND STATISTICS UNIT I Algebraic & Transcendental equations : Bisection Method , Newton Raphson Method, Iteration method - Finite differences –Forward , Backward differences – Newton‟s forward & backward difference interpolation formulae. Lagrange‟s interpolating polynomial. UNIT II Numerical differentiation - Numerical Integration using Trapezoidal rule and Simpson‟s first & second rules (proof not needed ) - Solutions to Linear Systems – Gaussian Elimination Method – Jacobi & Gauss Siedal iterative methods – Theory and problems UNIT III Numerical solution of ODE : Solution by Taylor Series Method , Euler‟s Method, Runge - Kutta 2nd order method- Adam‟s Predictor Corrector Method and Milne‟s Predictor Corrector Methods UNIT IV Mean , Median , Mode , Standard Deviation -Expectation –Variance and covariance – Correlation and Regression –Properties of Simple Correlation and regression coefficients – Simple Numerical Problems only . UNIT V Distributions : Discrete & Continuous distributions : Binomial, Poisson , Normal distributions- Properties of normal distributions –Relation between Binomial, Poisson, Normal distributions TEXT BOOK(S) [1] S.S.Sastry, Numerical Analysis (Unit 1 , 2 , 3 ) [2] Gupta.S.C & Kapoor,V.K, Fundamentals of Mathematical Statistics, Sultan Chand & sons, New Delhi -1994. (Units 4 & 5) REFERENCE(S) [1] M.K. Jain, S.R.K. Iyengar and R.K. Jain, Numerical Methods for Scientific and Engineering Computation, New Age International Private Limited, 1999. [2] C.E. Froberg, Introduction to Numerical Analysis, II Edn., Addison Wesley, 1979. CORE COURSE III – DIGITAL ELECTRONICS Unit I Number Systems and Codes: Binary Number System – Binary to Decimal Conversion – Decimal to Binary Conversion – Binary Addition – Binary Subtraction – Binary Multiplication and Division – Octal Numbers – Hexadecimal Numbers – Binary Codes – Error Detecting Codes – Error Correcting Codes . Unit II Logic Gates and Circuits: Boolean Algebra and Logic Gates – AND,OR,NOT,NAND,NOR,Exclusive OR and Exclusive OR Gates – Applications of XOR Gate – The Exclusive NOR Gate – Positive and Negative Logic – Logic Chararcteristics – Bipolar Logic Families – Integrated Circuits – Boolean Algebra: Definitions – Fundamentals of Boolean Algebra – Boolean Functions – Minterms and Maxterms – Laws and Theorems of Boolean Algebra – DeMorgan‟s Theorem – Universal Building Blocks (UBB) – NAND Gate as UBB – NOR Gate as UBB . Unit III Boolean Algebra: Simplifying Logic Circuits – Sum of Products – AND-OR Networks – Sum of Products and Product of Sums Forms – Karnaugh Maps – Product of Sums Simplification – NAND and NOR Implementation – AND-OR-INVERT Implementation – OR-AND-INVERT Implementation – Don‟t Care Conditions – Overlapping Groups – Rolling the Map – Eliminating Redundant Groups . Unit IV Combinational Logic Circuits: Introduction – Adders – The Half Adder – The Full Adder – Subtractors – BCD Adder – Multiplexers – Demultiplexers – Decoders – Encoders – Floating Point Number System – Range of Stored Numbers. Unit V Sequential Logic Circuits: Flip Flops – RS Flip Flop – Clocked RS Flip Flop – D Flip Flop – JK Flip Flop – T Flip Flop – Triggering of Flip Flops – Master Slave Flip Flop – Conversion of D Flip Flop – Conversion of T Flip Flop – Transfer Circuit – Clock – Counters and Shift Registers: Counters – Asynchronous or Ripple Counter – Ring Counter – Twisted Ring Counter – State Diagrams and State Tables – Magnitude Comparator – Programmable Arrays of Logic Cells – Shift Registers. Text Book: 1. Principles of Digital Electronics, Dr. K. Meena, PHI Learning Private Limited, New Delhi 2009. Reference Book: 1. Digital Design: M.Morris Mano , Prentice Hall of India. ******* CORE COURSE IV – COMPUTER GRAPHICS AND ANIMATION LAB Photoshop : 1. (i) Handling different file formats and interchanging them, changing the resolution, color, grayscales and size of the images (ii) Using brushes and creating multicolor real life images 2. Cropping, rotating, overlapping, superimposing, pasting photos on a page 3. Creation of a single image from selected portions of many 4. Developing a commercial brochure with background tints 5. Creating an image with multi-layers of images and texts. 6. Applying masks and filtering on images Flash : Develop an image(s) and do the following. 1. Basic Drawing and Painting. 2. Working with Strokes and Fills 3. Creating Custom Colors, Gradients, and Line Styles Transforming and Grouping Objects 4. Creating and Managing Multiple Layers 5. Converting Text into Shapes 6. Animate using motion, shape, Tweening , and actions ALLIED COURSE – II (AC) NUMERICAL ANALYSIS AND STATISTICS UNIT I Algebraic & Transcendental equations : Bisection Method , Newton Raphson Method , Iteration method - Finite differences –Forward , Backward differences – Newton‟s forward & backward difference interpolation formulae. Lagrange‟s interpolating polynomial. UNIT II Numerical differentiation - Numerical Integration using Trapezoidal rule and Simpson‟s first & second rules (proof not needed ) - Solutions to Linear Systems – Gaussian Elimination Method – Jacobi & Gauss Siedal iterative methods – Theory and problems UNIT III Numerical solution of ODE : Solution by Taylor Series Method , Euler‟s Method , Runge - Kutta 2nd order method- Adam‟s Predictor Corrector Method and Milne‟s Predictor Corrector Methods UNIT IV Mean , Median , Mode , Standard Deviation -Expectation –Variance and covariance – Correlation and Regression –Properties of Simple Correlation and regression coefficients – Simple Numerical Problems only . UNIT V Distributions : Discrete & Continuous distributions : Binomial, Poisson , Normal distributions- Properties of normal distributions –Relation between Binomial, Poisson, Normal distributions TEXT BOOK(S) [1] S.S.Sastry, Numerical Analysis (Unit 1 , 2 , 3 ) [2] Gupta.S.C & Kapoor,V.K, Fundamentals of Mathematical Statistics, Sultan Chand & sons, New Delhi -1994. (Units 4 & 5) REFERENCE(S) [1] M.K. Jain, S.R.K. Iyengar and R.K. Jain, Numerical Methods for Scientific and Engineering Computation, New Age International Private Limited, 1999. [2] C.E. Froberg, Introduction to Numerical Analysis, II Edn., Addison Wesley, 1979. ******* If you want to see whole syllabus then see given below attachment:- Last edited by Aakashd; December 17th, 2019 at 05:36 PM. |