University of Madras - Syllabus of Bachelor of Science (BSc) Nutrition, Food Service Management and Dietetics - Semester IV - Allied Subject IV - Basic Computer Science and Applications
UNIVERSITY OF MADRAS
B.Sc. Degree Course in Nutrition Food Service Management and Dietetics
SEMESTER SYSTEM WITH CREDITS
(Effective from the Academic Year 2003-2004)
SYLLABUS
Semester IV - Allied Subject IV - Basic Computer Science and Applications
Number of Lectures: 4
Duration of Examination: 3 hrs
Maximum Marks: 75
Credits: 4
Unit I
Introduction to programming - Efficiency of a language - Constituents of a language - Comparison of language - Data processing techniques - modes of data processing - Flowcharting techniques.
Unit II
C Fundamentals - Character set - Identifier and keywords - data types - constants -
Variables - Declaration Expressions - Statements - Arthimetic, Unary, Relationals
and logical, Assignment and conditional operators - Library functions.
Unit III
Data input / output functions - simple C programs - flow of control - Control structures
- Switch, break and continue, go to statements - Comma operator.
Unit IV
Functions - Defining, accessing functions - functional prototypes - passing arguments
- Recursions - storage classes - Multi - file programs.
Unit V
Pointers - Declarations - Passing pointers to functions operations in pointers - pointer
and arrays - array of pointers - structures and pointers - Files Creating Processing,
Opening and closing - Bit wise operation.
ALLIED PRACTICAL II
PROGRAMMES TO :
1. Find the area and circumference of a circle given the radius.
2. Find the simple and compound interest
3. Sort the given numbers and hence find the minimum and the maximum.
4. Find the sum of a general series
5. Find the exponential value using series
6. Find the cosine value using series
7. Find the sine value using series
8. String handling - to find the occurence of a particular character.
9. Find the occurence of a substring.
10. Count the number of characters, vowels, digits, etc.
11. Understand the concept of recursion - factorial and nor value.
12. String palindrome checking.
13. Understand the concepts of pointers - pass by value and pass by reference.
14. Matrix addition subtraction and multiplication using pointers.
15. Trace of a matrix using pointers.
Paper I
References Books:
1. M.M. Mano, Digital Logic and Computer Design, Prentice Hall of India, 1994.
2. M.M. Mano, Digital Design, 3rd Ed., Peason Education, 2002.
3. G. Counter and A. Marquir, Microsoft Office 2000, BPB Pub. 1999.
4. M. Levine Yomg, Internet - The Complete Reference, TMH, 1999.
5. H. Hahn, Internet Complete reference, TMH Edition, 1996.
Paper II
References Books:
1. B.W. Kernighan and D.M. Ritchie. The C Programming Languages, 2nd Edition PHI, 1988.
2. H. Schildt, C. The Complete Reference, 4th Edition, TMH Edition, 2000.
3. Goltfried B.S, Programming with C, Second Edition, TMH Pub. Co. Ltd. New Delhi 1996.
4. Kanetkar Y., Letus C, BPB Pub., New Delhi 1999.