# 1
| |||

| |||

Tnau ait |

# 3
| |||

| |||

Re: Tnau ait
The syllabus of B. Tech (Agricultural Information Technology) Program offered by TNAU (Tamil Nadu Agricultural University) is as follows: AIT 101 Introduction to Information Technology and ProgrammingTheory UNIT I: Computer Basics Introduction to Computer Evolution and Generation of Computers - Classification of Computers Components of computer system Applications of computers Unit II: Information technology Basics Information - Prerequisites of Information Need for Information Components of Information Technology Role of Information Information technology and the Internet Unit III : Programming concepts Developing a program Program Development Cycle Algorithm Flow chart Flow chart Symbols Guidelines for preparing flowcharts Benefits of Flow charts Limitations of flowchart Decision tables steps to develop a decision table Benefits of decision tables Limitation of Decision tables Pseudocode Pseudocode Guidelines Benefits of Pseudocode Limitations of Pseudocode Unit IV: Introduction to UML(Unified Modeling Language) Use case diagrams Class diagrams Sequence Diagrams Statechart Diagrams Activity diagram. Solution Development Problem analysis chart Interativity chart IPO chart Coupling diagram and data dictionary Unit V: Introduction to Program structures Program control structures sequence control structure Programming paradigms Characteristics of good program - Programming Languages Processing arrays Pointer techniques File concepts. PracticalWorking with basic Computer Hardware - Construction of Algorithm - Construction of Flow chart - Construction of Decision tables - Construction of Pseudocode - Construction of Use case diagrams - Construction of Class diagrams - Construction of Sequence Diagrams - Construction of State chart Diagrams - Construction of Activity diagram. - Construction of Problem analysis chart - Construction Sequence Control structure - Construction of Selection control structure - Construction Repetition control structure -Working with Arrays and pointers - Working with Files Theory Lecture Schedule1. Introduction to Computer Evolution of Computer 2. Generation of Computers 3. Classification of Computers 4. Components of computer system 5. Applications of computers 6. Information - Prerequisites of Information 7. Need for Information 8. Components of Information Technology Role of Information Information technology and the Internet 9. Components of Information Technology 10. Role of Information 11. Information technology and the Internet 12. Developing a program Program Development Cycle 13. Algorithm 14. Flow chart - Flow chart Symbols Guidelines for preparing flowcharts Benefits of Flow charts Limitations of flowchart. 15. Decision tables steps to develop a decision table Benefits of decision tables Limitation of Decision tables. 16. Pseudocode Pseudocode Guidelines Benefits of Pseudocode Limitations of Pseudocode 17. Mid-semester examination 18. Use case diagrams 19. Class diagrams 20. Sequence Diagrams 21. Statechart Diagrams 22. Activity diagram. 23. Solution Development Problem analysis chart 24. Interativity chart 25. IPO chart 26. Coupling diagram and data dictionary 27. Program control structures 28. sequence control structure 29. Programming paradigms 30. Characteristics of good program 31. Programming Languages 32. Processing arrays 33. Pointer techniques 34. File concepts Practical Schedule1 Working with basic Computer Hardware 2 Construction of Algorithm. 3 Construction of Flow chart 4 Construction of Decision tables 5 Construction of Pseudocode 6 Construction of Use case diagrams 7 Construction of Class diagrams 8 Construction of Sequence Diagrams 9 Construction of Statechart Diagrams 10 Construction of Activity diagram 11 Construction of Problem analysis chart 12 Construction Sequence Control structure 13 Construction of Selection control structure 14 Construction Repetition control structure 15 Working with Arrays and pointers 16 Working with Files 17 Final Practical Examination |