Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Department of Computer Applications B.C.A. Full-Time (Bachelor’s of Computer Applications 3 Year Course) M.C.A. Full-Time (Master’s of Computer Applications 3 Year Course) M. Tech (Artificial Intelligence) (3 Year Course) Highlights of the syllabi of BCA & MCA Programs 1. The Six semesters BCA and MCA Programs are offered by the Department of Computer Applications of Suresh Gyan Vihar University is based on the credit system and provides a student with wide choice of courses. 2. The program includes courses covering the core of Computer Science and Engineering discipline and several electives in areas of Intelligent Systems and Knowledge Engineering, Theoretical Computer Science, Networks and Distributed Systems and Hardware Systems. 3. Program contains job oriented and advanced practical labs. 4. This program contains the best combination of various computing technologies. 5. It is the most dynamic program and provides foundation for research. Highlights of the syllabi of M.Tech. (AI) 1. The Four semesters M.Tech. Program in Artificial Intelligence is offered by the Department of Computer Applications of Suresh Gyan Vihar University is based on the credit system and provides a student with wide choice of courses. 2. The program includes courses covering the core of Artificial Intelligence discipline and several electives in areas of Robotics, Image Processing, Pattern Recognition, Natural Language Processing, Computational Intelligence, Text Processing, Machine Learning, Human Computer Interaction and Knowledge Engineering etc. 3. Program comprises of several core and elective courses and project work. 4. Program contains job oriented and advanced practical labs. 5. This program contains the best combination of various computing technologies. 6. It is the most dynamic program and provides foundation for research. 7. Compulsion to publish research papers in repute journals makes this program more effective and research oriented. GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS TEACHING AND EXAMINATION SCHEME AND DETAILED SYLLABUS FOR Bachelor’s of Computer Applications (BCA) 3 Year Course EFFECTIVE FROM ACADEMIC SESSION 2011-14 GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS Teaching and Examination Scheme for Bachelor’s of Computer Applications 3 Year Course EFFECTIVE FROM ACADEMIC SESSION 2011-12 Year: I S. No. Course Code 1 2 3 4 5 6 CA 101 CA 103 EE 103 EN 103 MA 103 ES 101 7 8 9 CA 151 EN 153 EE 153 10 DE 101 Semester: I Course Name A. Theory Fundamentals of Computer PC Package Electrical & Electronics Engineering Communication English Elementary Mathematics Environmental Studies B. Practicals / Sessionals PC Package lab Communication & Soft Skill Lab Electrical & Electronics Engineering Lab C. Discipline and Extra Curricular Activities Discipline and Extra Curricular Activities - I Total Total Teaching Load Credits Contact Hrs/Wk. L T/S P 4 4 4 4 4 2 3 3 3 3 3 2 1 1 1 1 1 - - 2 2 2 - 2 30 Course Code 1 CA 108 2 3 4 5 6 CA 102 EN 106 BM 114 CA 104 CA 106 7 8 9 10 CA 152 CA 153 CA 156 CA 158 11 DE 102 Weightage (in %) CE ESE - 3 3 3 3 3 3 30 30 30 30 30 30 70 70 70 70 70 70 - 3 3 3 2 2 2 60 60 60 40 40 40 - - - - 100 - 17 31 05 09 Year: I S. No. Exam Hrs. Semester: II Course Name A. Theory Fundamentals of Accounting and Financial Management Programming in C Technical English Business Organization & System Desktop Publishing & Multimedia Internet Technology & Programming B. Practicals / Sessionals Computer Programming Lab Tally Lab DTP & Multimedia Lab Internet Programming Lab C. Discipline and Extra Curricular Activities Discipline and Extra Curricular Activities – II Total Total Teaching Load Credits Contact Hrs/Wk. L T/S P Exam Hrs. Weightage (in%) CE ESE 4 3 1 - 3 30 70 4 3 3 4 3 3 3 3 3 3 1 1 - - 3 3 3 3 3 30 30 30 30 30 70 70 70 70 70 2 2 2 2 - - 3 3 3 3 2 2 2 2 60 60 60 60 40 40 40 40 2 - - - - 100 - 30 18 32 2 12 GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS Teaching and Examination Scheme for Bachelor’s of Computer Applications 3 Year Course EFFECTIVE FROM ACADEMIC SESSION 2012-13 Year: II S. No. Course Code 1 2 3 4 5 6 MA 207 CA 201 CA 203 CA 205 EC 220 CA 207 7 CA 251 8 9 10 EC 260 CA 253 CA 255 11 DE 201 Semester: III Course Name A. Theory Numerical Analysis Object Oriented Programming & C++ System Analysis & Design Software Engineering-I Digital Electronics Management Information System B. Practical’s / Sessionals Object Oriented Programming & C++ Lab Digital Electronics Lab Software Engineering Lab Advance Programming Lab C. Discipline and Extra Curricular Activities Discipline and Extra Curricular Activities – III Total Total Teaching Load Credits 4 3 3 3 4 3 Contact Hrs/Wk. L T/S P 3 3 3 3 3 3 1 1 Course Code 1 CA 202 2 3 4 5 6 CA 204 CA 214 CA 208 CA 210 CA 212 7 8 9 10 CA 252 CA 260 CA 256 CA 258 11 DE 202 Weightage (in%) CE ESE 3 3 3 3 3 3 30 30 30 30 30 30 70 70 70 70 70 70 2 3 2 60 40 2 2 2 3 3 3 2 2 2 60 60 60 40 40 40 2 30 100 18 32 2 12 Year: II S. No. Exam Hrs. Semester: IV Course Name A. Theory Computer Organization & Architecture Database Management System Programming in Visual Basic Data Structure & Algorithm E-Commerce Information Security B. Practical’s / Sessionals Database Lab Visual Basic Lab Data Structure Algorithm Lab Information Security Lab C. Discipline and Extra Curricular Activities Discipline and Extra Curricular Activities - IV Total Total Teaching Load Credits Contact Hrs/Wk. L T/S P 4 3 3 4 3 3 3 3 3 3 3 3 1 1 2 2 2 2 3 3 3 3 2 30 Exam Hrs. Weightage (in%) CE ESE 3 30 70 3 3 3 3 3 30 30 30 30 30 70 70 70 70 70 2 2 2 2 60 60 60 60 40 40 40 40 100 18 32 2 12 GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS Teaching and Examination Scheme for Bachelor’s of Computer Applications 3 Year Course EFFECTIVE FROM ACADEMIC SESSION 2013-14 Year: III S. No. Course Code 1 2 3 4 5 CA 301 CA 303 CA 206 CA 305 CA 307 6 7 8 9 CA 351 CA 254 CA 353 PE 303 10 DE 301 Semester: V Course Name A. Theory Fundamentals of Operating System Programming in Java Data Communication & Networking Web Designing Software Engineering-II B. Practicals / Sessionals Java Programming Lab Computer Networking Lab Web Designing lab Minor project C. Discipline and Extra Curricular Activities Discipline and Extra Curricular Activities – V Total Total Teaching Load Credits 3 4 4 3 3 Contact Hrs/Wk. L T/S P 3 3 3 3 3 1 1 2 2 2 3 3 3 3 3+3 28 Course Code 1 2 3 4 CA 302 CA 304 CA 306 CA 308 5 6 7 8 CA 352 CA 354 PE 304 SM 302 9 DE 302 Weightage (in%) CE ESE 3 3 3 3 3 30 30 30 30 30 70 70 70 70 70 2 2 2 3 60 60 60 60 40 40 40 40 2 100 15 32 2 15 Year: III S. No. Exam Hrs. Semester: VI Course Name A. Theory ASP.Net using C# Open Source Technology Artificial Intelligence Principles of Programming language B. Practicals / Sessionals ASP .Net Lab (using c#) Operating System Lab Major Project Seminar C. Discipline and Extra Curricular Activities Discipline and Extra Curricular Activities - VI Total Total Teaching Load Credits 4 4 4 4 Contact Hrs/Wk. L T/S P 3 3 3 3 1 1 1 1 2 2 3 1 3 3 3+3 2 2 26 Exam Hrs. Weightage (in%) CE ESE 3 3 3 3 30 30 30 30 70 70 70 70 2 2 3 2 60 60 60 60 40 40 40 40 100 12 30 4 14 GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS TEACHING AND EXAMINATION SCHEME AND DETAILED SYLLABUS FOR Master’s of Computer Applications (MCA) 3 Year Course EFFECTIVE FROM ACADEMIC SESSION 2011-14 GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS Teaching and Examination Scheme for Master’s of Computer Applications 3 Year Course EFFECTIVE FROM ACADEMIC SESSION 2011-12 Year: I Semester: I S. No. Course Code 1 2 3 4 5 CA 501 CA 503 CA 505 CA 507 BM 517 6 CA 511 7 8 9 10 CA 551 CA 553 CA 555 CA 557 Course Name A. Theory Papers Fundamentals of Operating System Discrete Mathematics structure Computer Architecture C and C++ Language Accounting and Financial Management Data Communication and Networking B. Practical & Sessional: Office Automation Lab Communication & soft Skill Lab C and C++ Language Lab Networking Lab Total Total Teaching Load Credits Contact Hrs/Wk. L T/S P 3 4 3 4 3 3 3 3 3 3 3 3 2 2 2 2 28 18 32 1 1 2 3 3 3 3 12 Year: I S. No. Course Code 1 2 3 4 CA 502 CA 504 CA 506 CA 508 5 6 CA 510 CA 512 7 8 9 CA 552 CA 554 CA 556 10 CA 558 Exam Hrs. Weightage (in%) CE ESE 3 3 3 3 3 30 30 30 30 30 70 70 70 70 70 3 30 70 2 2 2 2 60 60 60 60 40 40 40 40 Semester: II Course Name A. Theory Papers Programming in Java Data Structure and Algorithm Database Management System Computer Oriented Numerical Methods System Analysis and Design Web Technologies & Development B. Practical & Sessional: Java Lab Data Structure and Algorithm Lab Computer Oriented Numerical Methods lab Web Programming & Designing Lab Total Total Teaching Load Credits Contact Hrs/Wk. L T/S P 3 4 3 4 3 3 3 3 3 3 3 3 2 28 18 32 30 30 30 30 70 70 70 70 3 3 30 30 70 70 3 3 3 2 2 2 60 60 60 40 40 40 3 12 2 60 40 1 2 Weightage (in%) CE ESE 3 3 3 3 1 2 2 2 Exam Hrs. GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS Teaching and Examination Scheme for Master’s of Computer Applications 3 Year Course EFFECTIVE FROM ACADEMIC SESSION 2012-13 S. No. Year: II Course Code 1 2 3 4 5 6 CA 601 CA 603 CA 605 CA 607 CA 609 CA 611 7 8 9 10 CA 651 CA 653 CA 655 CA 657 Course Name A. Theory Papers Advanced Database System System Programming Computer Graphics Advance Java E-Commerce Advance Computer Architecture B. Practical & Sessional: Advance Java Lab System Programming Lab Computer Graphics Lab Advanced DBMS Lab (PLSQL) Total Total Teaching Load Credits 3 3 3 4 3 4 2 2 2 2 28 Contact Hrs/Wk. L T/S P 3 3 3 3 3 3 18 32 1 1 2 3 3 3 3 12 Year: II S. No. Course Code 1 2 3 4 5 6 CA 602 CA 604 CA 606 CA 608 CA 610 CA 612 7 8 9 10 PE 652 CA 654 CA 656 CA 658 Semester: III Exam Weightage (in%) Hrs. CE ESE 3 3 3 3 3 3 30 30 30 30 30 30 70 70 70 70 70 70 2 2 2 2 60 60 60 60 40 40 40 40 Semester: IV Course Name A. Theory Papers Software Engineering ASP.Net Framework Real Time System Artificial Intelligence Wireless & Mobile Computing Information Protection & Security B. Practical & Sessional: Minor Project -I ASP.Net Lab Information Protection & Security Lab Colloquium (Group Discussion) Total Total Teaching Load Credits 3 4 3 3 4 3 2 2 2 2 28 Contact Hrs/Wk. L T/S P 3 3 3 3 3 3 18 32 1 1 2 3 3 3 3 12 Exam Hrs. Weightage (in%) CE ESE 3 3 3 3 3 3 30 30 30 30 30 30 70 70 70 70 70 70 2 2 2 2 60 60 60 60 40 40 40 40 GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS Teaching and Examination Scheme for Master’s of Computer Applications 3 Year Course EFFECTIVE FROM ACADEMIC SESSION 2013-14 Year: III S. No. Course Code 1 2 3 4 CA 701 CA 703 CA 705 CA 707 CA 709 CA 711 5 CA 713 CA 715 CA 717 6 7 8 9 PE 703 CA 751 PE 701 SM 701 Semester: V Course Name A. Theory Papers Object Oriented Software Engineering Analysis And Design of algorithms Bio Informatics Elective I Soft Computing ERP Systems Decision Support System Elective II Simulation & Modeling Distributed System Data Mining & Warehousing B. Practical & Sessional: Dissertation Analysis & Design of Algorithm Lab Major Project Seminar Total Total Teaching Load Credits Contact Hrs/Wk. L T/S P Course Code 1 2 PT 702 PE 702 Weightage (in%) CE ESE 4 4 4 4 3 3 3 3 1 1 1 1 3 3 3 3 30 30 30 30 70 70 70 70 4 3 1 3 30 70 2 2 2 2 60 60 60 60 40 40 40 40 2 2 2 2 28 15 32 5 3 3 3 3 12 Year: III S. No. Exam Hrs. Semester: VI Course Name Practical & Sessional: Industrial Training Thesis work Total Total Teaching Load Credits 9 9 18 Contact Hrs/Wk. L T/S P L T P 18 18 0 0 36 36 Exam Hrs. 3 3 Weightage (in%) CE ESE 60 60 40 40 GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS TEACHING AND EXAMINATION SCHEME AND DETAILED SYLLABUS FOR M. Tech Full-Time (Core) (Artificial Intelligence) (2 Year Course) EFFECTIVE FROM ACADEMIC SESSION 2011-13 GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS Teaching and Examination Scheme for M. Tech. FULL-TIME (Core) (Artificial Intelligence) EFFECTIVE FROM ACADEMIC SESSION 2011-12 Year I S. No. Course Code 1 2 3 4 CA513 CA 515 CA 517 CA519 CA521 CA523 5 CA 559 Semester – I Course Name A. Theory Papers Advances in Artificial Intelligence Problem Solving Methods Application Designing using LISP Elective I Image Processing and Pattern Recognition Genetic Algorithm and Applications Robotics B. Practical & Sessional: LISP LAB Total Total Teaching Load Credits Contact Hrs/Wk. L T/S P Course Code 1 2 3 4 CA 514 CA 516 CA 518 CA 520 CA 522 CA 524 5 CA 560 Weightage (in%) CE ESE 3 3 3 3 3 3 3 3 - - 3 3 3 3 30 30 30 30 70 70 70 70 2 14 - 12 15 0 - 3 3 - 3 60 180 - 40 320 - Year I S. No. Exam Hrs. - Semester – II Course Name A. Theory Papers Document Analysis & Recognition Knowledge Representation & Reasoning Logic Programming using Prolog Elective II Natural Language Processing Computational Intelligence Text Processing B. Practical & Sessional: Prolog LAB Total Total Teaching Load Credits Contact Hrs/Wk. L T/S P Exam Hrs. Weightage (in%) CE ESE 3 3 3 3 3 3 3 3 - - 3 3 3 3 30 30 30 30 70 70 70 70 2 14 - 12 15 0 - 3 3 - 3 60 180 - 40 320 - - GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS Teaching and Examination Scheme for M. Tech. FULL-TIME (Core) (Artificial Intelligence) EFFECTIVE FROM ACADEMIC SESSION 2012-13 Year II S. No. 1 2 3 Course Code CA 613 CA 615 CA 617 CA 619 CA 621 4 5 CA 659 SM 601 Semester – III Course Name Credits A. Theory Papers Artificial Neural Network Data Mining for Business Intelligence Elective III Machine Learning Knowledge Engineering and Expert Systems Human Computer Interaction B. Practical & Sessional: MATLab Seminar Total Total Teaching Load Contact Hrs/Wk. L T/S P 1 Course Code DI 602 Weightage (in%) CE ESE 3 3 3 3 3 3 - - 3 3 3 30 30 30 70 70 70 2 5 16 - 9 21 0 - 3 9 12 - 3 5 60 60 210 - 40 40 290 - Year II S. No. Exam Hrs. - Semester – IV Course Name Credits Contact Hrs/Wk. L T/S P Exam Hrs. 20 min./ student for presentation A. Practical & Sessional: M. Tech. Dissertation / Thesis 16 0 0 - Total Total Teaching Load 16 - 0 - 0 - - - Weightage (in%) CE ESE 60 40 60 - 40 - GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS LIST OF COURSES OFFERED BY THE DEPARTMENT EFFECTIVE FROM ACADEMIC SESSION 2011-14 Course Code Course Name Credits Contact Hrs/Wk. L T/S P Exam Hrs. Weightage (in%) CE ESE 1. CA 101 Fundamentals of Computer 3 3 - - 3 30 70 2. CA 102 Programming in C 4 3 1 - 3 30 70 3. CA 103 PC Package 3 3 - - 3 30 70 4. CA 104 Desktop Publishing & Multimedia 3 3 - - 3 30 70 5. CA 106 Internet Technology & Programming 3 3 - - 3 30 70 6. CA 108 4 3 1 - 3 30 70 7. CA 151 Fundamentals of Accounting and Financial Management PC Package lab 2 - - 3 2 60 40 8. CA 152 Computer Programming Lab 2 - - 3 2 60 40 9. CA 153 Tally Lab 2 - - 3 2 60 40 10. CA 156 DTP & Multimedia Lab 2 - - 3 2 60 40 11. CA 158 Internet Programming Lab 2 - - 3 2 60 40 12. CA 201 Object Oriented Programming & C++ 3 3 - - 3 30 70 13. CA 202 Computer Organization & Architecture 4 3 1 - 3 30 70 14. CA 203 System Analysis & Design 3 3 - - 3 30 70 15. CA 204 Database Management System 3 3 - - 3 30 70 16. CA 205 Software Engineering-I 3 3 - - 3 30 70 17. CA 206 Data Communication & Networking 4 3 1 - 3 30 70 18. CA 207 Management Information System 3 3 - - 3 30 70 19. CA 208 Data Structure & Algorithm 3 3 - - 3 30 70 20. CA 210 E-Commerce 3 3 - - 3 30 70 21. CA 212 Information Security 3 3 - - 3 30 70 22. CA 214 Programming in Visual Basic 4 3 1 3 30 70 23. CA 251 Object Oriented Programming & C++ Lab 2 - - 3 2 60 40 24. CA 252 Database Lab 2 - - 3 2 60 40 25. CA 253 Software Engineering lab 2 - - 3 2 60 40 26. CA 254 Computer Networking Lab 2 - - 3 2 60 40 27. CA 255 Advance Programming Lab 2 - - 3 2 60 40 28. CA 256 Data Structure Algorithm Lab 2 - - 3 2 60 40 29. CA 258 Information Security Lab 2 - - 3 2 60 40 30. CA 260 Visual Basic Lab 2 3 2 60 40 31. CA 301 Fundamentals of Operating System 3 3 - - 3 30 70 32. CA 302 ASP.Net using C# 3 3 - - 3 30 70 33. CA 303 Programming in Java 4 3 1 - 3 30 70 34. CA 304 Open Source Technology 3 3 - - 3 30 70 35. CA 305 Web Designing 3 3 - - 3 30 70 36. CA 306 Artificial Intelligence 4 3 1 3 30 70 37. CA 307 Software Engineering-II 3 3 - 3 30 70 38. CA 308 Principles of Programming language 4 3 1 3 30 70 39. CA 351 Java Programming Lab 2 - - 2 60 40 3 40. CA 352 ASP .Net Lab (Using c#) 2 - - 3 2 60 40 41. CA 353 Web Designing Lab 2 42. CA 354 Operating System Lab 2 - - 3 2 60 40 - - 3 2 60 40 43. 44. 45. 46. 47. 48. 49. 50. 51. 52. CA 501 CA 502 CA 503 CA 504 CA 505 CA 506 CA 507 CA 508 CA 510 CA 511 Fundamentals of Operating System Programming in Java Discrete Mathematics structure Data Structure and Algorithm Computer Architecture Database Management System C and C++ Language Computer Oriented Numerical Methods System Analysis and Design Data Communication and Networking 3 3 4 4 3 3 4 4 3 3 3 3 3 3 3 3 3 3 3 3 1 1 1 1 - - 3 3 3 3 3 3 3 3 3 3 30 30 30 30 30 30 30 30 30 30 70 70 70 70 70 70 70 70 70 70 53. CA 512 Web Technologies & Development 3 3 - - 3 30 70 54. 55. CA 513 Advances in Artificial Intelligence 3 3 - - 3 30 70 CA 514 Document Analysis & Recognition 3 3 - - 3 30 70 56. CA 515 Problem Solving Methods 3 3 - - 3 30 70 57. CA 516 Knowledge Representation & Reasoning 3 3 - - 3 30 70 58. CA 517 Application Designing using LISP 3 3 - - 3 30 70 59. CA 518 Logic Programming using Prolog 3 3 - - 3 30 70 60. CA 519 Image Processing and Pattern Recognition 3 3 - - 3 30 70 61. CA 520 Natural Language Processing 3 3 - - 3 30 70 62. CA 521 Genetic Algorithm and Applications 3 3 - - 3 30 70 63. CA 522 Computational Intelligence 3 3 - - 3 30 70 64. CA 523 Robotics 3 3 - - 3 30 70 65. CA 524 Text Processing 3 3 - - 3 30 70 66. CA 551 Office Automation Lab 2 - - 3 2 60 40 67. CA 552 Java Lab 2 - - 3 2 60 40 68. CA 553 Communication & soft Skill Lab 2 - - 3 2 60 40 69. CA 554 Data Structure and Algorithm Lab 2 - - 3 2 60 40 70. CA 555 C and C++ Language Lab 2 - - 3 2 60 40 71. CA 556 Computer Oriented Numerical Methods Lab 2 - - 3 2 60 40 72. CA 557 Networking Lab 2 - - 3 2 60 40 73. CA 558 Web Programming & Designing Lab 2 - - 3 2 60 40 74. CA 559 LISP LAB 2 - - 3 3 60 40 75. CA 560 Prolog LAB 2 - - 3 3 60 40 76. CA 601 Advanced Database System 3 3 - - 3 30 70 77. CA 602 Software Engineering 3 3 - - 3 30 70 78. CA 603 System Programming 3 3 - - 3 30 70 79. CA 604 ASP.Net Framework 4 3 1 - 3 30 70 80. CA 605 Computer Graphics 3 3 - - 3 30 70 81. CA 606 Real Time Systems 3 3 - - 3 30 70 82. CA 607 Advance Java 4 3 1 - 3 30 70 83. CA 608 Artificial Intelligence 3 3 - - 3 30 70 84. CA 609 E-Commerce 3 3 - - 3 30 70 85. CA 610 Wireless & Mobile Computing 4 3 1 - 3 30 70 86. CA 611 Advance computer Architecture 4 3 1 - 3 30 70 87. CA 612 Information Protection & Security 3 3 - - 3 30 70 88. CA 613 Artificial Neural Network 3 3 - - 3 30 70 89. CA 615 Data Mining for Business Intelligence 3 3 - - 3 30 70 90. CA 617 Machine Learning 3 3 - - 3 30 70 91. CA 619 Knowledge Engineering and Expert Systems 3 3 - - 3 30 70 92. CA 621 Human Computer Interaction 3 3 - - 3 30 70 93. CA 651 Advance Java Lab 2 - - 3 2 60 40 94. CA 653 System Programming Lab 2 - - 3 2 60 40 95. CA 654 ASP.Net Lab 2 - - 3 2 60 40 96. CA 655 Computer Graphics Lab 2 - - 3 2 60 40 97. CA 656 Information Protection & Security Lab 2 - - 3 2 60 40 98. CA 657 Advanced DBMS Lab (PL-SQL) 2 - - 3 2 60 40 99. CA 658 Colloquium (Group Discussion) 2 - - 3 2 60 40 100. CA 659 MAT Lab 2 - - 3 3 60 40 101. CA 701 Object Oriented Software Engineering 4 3 1 - 3 30 70 102. CA 703 Analysis and Design of Algorithms 4 3 1 - 3 30 70 103. CA 705 Bio Informatics 4 3 1 - 3 30 70 104. CA 707 Soft Computing 4 3 1 - 84. CA 709 ERP Systems 4 3 1 3 30 70 - 3 30 70 85. CA 711 Decision Support System 4 3 1 - 3 30 70 86. CA 713 Simulation & Modeling 4 3 1 - 3 30 70 87. CA 715 Distributed System 4 3 1 - 3 30 70 88. CA 717 Data Mining & Warehousing 4 3 1 3 30 70 105. CA 751 Analysis & Design of Algorithm Lab 2 - - 3 2 60 40 106. BM 114 Business Organization & System 3 3 - - 3 30 70 107. BM 517 Accounting and Financial Management 3 3 - - 3 30 70 108. DE 101 Discipline and Extra Curricular Activities - I 2 - - - - 100 - 109. DE 102 Discipline and Extra Curricular Activities - II 2 - - - - 100 - 110. DE 201 Discipline and Extra Curricular Activities - III 2 - - - - 100 - 111. DE 202 Discipline and Extra Curricular Activities - IV 2 - - - - 100 - 112. DE 301 Discipline and Extra Curricular Activities - V 2 - - - - 100 - 113. DE 302 Discipline and Extra Curricular Activities - VI 2 - - - - 100 - 114. DI 602 Dissertation 16 - - - 60 40 115. EC 220 Digital Electronics 4 3 1 - 20 min/ student for presentation 3 30 70 116. EC 260 Digital Electronics lab 2 - - 3 2 60 40 117. EE 103 Electrical & Electronics Engineering 3 3 - - 3 30 70 118. EE 153 Electrical & Electronics Engineering Lab 2 - - 3 2 60 40 119. EN 103 Communication English 3 3 - - 3 30 70 120. EN 106 Technical English 3 3 - - 3 30 70 121. EN 153 Communication & Soft Skill Lab 2 - - 3 2 60 40 122. ES 101 Environmental Studies 2 2 - - 3 30 70 123. MA 103 Elementary Mathematics 3 3 - - 3 30 70 124. MA 104 Mathematics-I 4 3 1 - 3 30 70 125. MA 207 Numerical Analysis 4 3 1 - 3 30 70 126. PE 303 Minor Project 3 - - 6 3 60 40 127. PE 304 Major Project 3 - - 6 3 60 40 128. PE 652 Minor Project -I 2 - - 3 2 60 40 129. PE 701 Major Project 2 - - 3 2 60 40 130. PE 702 Thesis work 9 - - 18 3 60 40 131. PE 703 Dissertation 2 - - 3 2 60 40 132. PT 702 - Industrial training 9 - - 18 3 60 40 133. SM 302 Seminar 1 - - 2 2 60 40 134. SM 601 Seminar 5 - - 9 5 60 40 135. SM 701 Seminar 2 - - 3 2 60 40 CA 101 FUNDAMENTALS OF COMPUTER Units 1 2 3 4 5 C(L,T,P)=3(3,0,0) Course Contents Brief history of development of computers, Computer system concepts, Computer system characteristics, Capabilities and limitation, Types of computer, Generation of Computers, Personal Computer (PCs)- evolution of PCs, configurations of PCsPentium and Newer, PCs specification and main characteristics. Basic components of a computer system – Control unit, ALU, Input/Output functions and characteristics, memory –RAM, ROM, EPROM, PROM and other types of memory. Input/Output & Storage Units:- Keyboard, Mouse, Trackball, Joystick, Digitizing, tablet, Scanners, Digital Camera, MICR, OCR,OMR, Bar-code Reader, Voice Recognition, Light pen, Touch Screen, Monitors – characteristics and types of monitor – Digital, Analog, Size, Resolution, Refresh Rate, Interlaced / Non Interlaced, Dot Pitch, Video Standard – VGA, SVGA, XGA etc, Printers & Types – Daisy wheel, Dot Matrix, Inkjet, Laser, Line Printer, Plotter, Sound Card, and Speakers. Number System: Binary, octal, decimal and hexadecimal representation of numbers. Integers and floating numbers. Representation of character, ASCII and EBCDIC codes. Binary arithmetic: addition, subtraction, complements. Storage fundamentals – Primary Vs Secondary Data Storage and Retrieval methods – Sequential, Direct and Index Sequential, SIMM, Various Storage Devices- Magnetic Tape, Magnetic Disks, Cartridge Tape, Hard Disk Drivers, Floppy Disks (Winchester Disk ), Optical Disks, CD, VCD, CD- R, CD-RW, Zip Drives, Flash drives Video Disk, Blue Ray Disc, SD/MMc Memory cards, Physical structure of floppy & hard disk, drive naming conventions in PC. DVD, DVD-RW. Software and its Needs, Types of Software- System software, Application software, System Software- Operating system, Utility Program, Programming language, Assemblers, Compilers and Interpreter, Introduction to operating system for PCsDOS Window, Linux, File Allocation Table(FAT & FAT32), files & directory structure and its naming rules, booting process details of DOS and Windows, DOS system files Programming languages- Machine, Assembly, High Level, 4GL, their merits and demerits, Application Software and its types- Word-processing, Spreadsheets, Presentation Graphics, Data Base Management Software, characteristics, Uses and example and area of applications of each of them, Virus working principles, Virus working principles, Types of viruses, Virus detection and prevention viruses on network. Total Hrs. 7 8 7 8 7 37 Reference Books: 1. Computer Fundamentals by P.K.Sinha, BPB Publications 2. Fundamentals of information Technology and Computer Programming by V.K.Jain 3. Introduction to Computers and Information Systems by Dr. Sushila Madan, Taxmann Publications CA 102 Units 1 2 3 4 5 PROGRAMMING IN C C(L,T,P)=4(3,1,0) Course Contents C program structures, Variables, Data Types, Declarations, Operators (Arithmetic, Relational, Logical), increment and decrement operators, Assignment operators and expressions, Arithmetic expressions, statements, symbolic constants, conditional expressions, Bitwise operators, precedence and order of evaluations, input-output functions. Statements and Blocks, branching statements (if, switch), Loops (while, for, do-while, repeat-until), Break and continue, go to and labels. Array, Type of Array, Strings, Functions, external variables, scope rules, header files, static variables, initialization, parameter passing (call-by-value, call-by-reference), recursion Pointers and addresses, pointers and function arguments, pointer and arrays, Pointer as Function Arguments. Memory allocation in C, storage Classes C preprocessor. Structures: Defining and processing, passing to a function, Unions. Files: Standard input and output, formatted output, formatted input, file access, Total Reference Books: 1. Programming in C by E. Balaguruswamy, TMH Publications 2. Programming with C by Gottfried, Schaums, TMH Publications 3. Thinking in C by Mahapatra, PHI Publications Hrs. 7 7 7 8 8 37 CA 103 Unit 1 2 3 4 5 I II III IV V C(L,T,P)=3(3,0,0) Course Contents Ms Window: Introduction to M.S Window; Features of Window; Various version of Window & it use; Working with Window ;My computer & recycle bin; Desktop, Icon And Window Explorer; Screen description & working style of window ;Dialog Boxes & Toolbars; Working with Windows; My Computer & Recycle bin; Desktop, Icons and Windows; Dialog Boxes & Toolbars; Windows Explorer; Screen description & working Styles of Windows; Dialog Boxes & Toolbars; Working with files & Folder; Simple operations like copy, delete, moving of files and folders from one drive to another, Shortcuts & Auto starts; Accessories and Windows Settings using Control Panel, modem, printers, audio, networks, fonts, creating users, internet settings, Starts button & Program lists; Installation and Uninstalling new Hardware & Software program on your computer; Office Package- Office activates and their software requirements, Word-processing, Spreadsheets, Presentation graphics, Database, introduction to MS Office; Introduction to MS-Word; Features & areas of use. Working with MS Word.; Menus & Commands; Toolbars & Buttons; Shortcuts Menus, Wizards & Templates; Creating a New Document; Different Page Views and layouts; Applying various Text Enhancements; Working with - Styles, Text Attributes; Paragraph and Page Formatting; Text Editing using various features; Bullets, Numbering, Auto Formatting, Printing & various print options. Advanced Features of MS-Word: Spell Check, Thesaurus, Find & Replace; Headers & Footers; Inserting - Page Numbers, Pictures, Files, Auto texts, Symbols etc.; Working with Columns, Tabs & Indents; Creations & Working with Tables including conversion to and from text; Margins & Space management in Documents; Adding Reference and Graphics; Mail Merge, Envelopes and mailing labels, Importing and Exporting to and from various formats . MS Excel: Introduction and area of use; Working with MS- Excel.; concepts of Workbook & Worksheets; Using Wizard; Various Data Types; Using different features with Data, Cell and Texts; Inserting, Removing & Resizing of Columns & Rows; Working with Data & Ranges; Different views of Worksheets; Column Freezing, Labels, Headings, Splitting etc; Using different Features with Data and Text; Use of Formulas, calculation and function; Cell formatting including Models Shading; Working with different Chart Types ; Printing of Workbook and Worksheet with various option . MS-PowerPoint: Introduction and area of Use; Working with MS-PowerPoint; Creating A New Presentation; Working with Presentation; Using Wizard; Slides and its different views; Inserting, Deleting and Copying of Slides; Working with notes, Handouts, Columns and lists; Adding Graphics, Sound and movies to a slide; Working with PowerPoint objects; Designing and presentation of a Slide show; Printing Presentation, nodes, Handouts with print option, Outlook Express and its features Total Reference Books: 1. Windows XP Complete Reference, BPB Publication 2. MS-Office XP Complete Reference, BPB Publication 3. MS-Windows XP Home Edition Complete Reference CA 104 Units PC PACKAGE DESKTOP PUBLISHING & MULTIMEDIA Hrs. 7 8 6 7 7 35 C(L,T,P)=3(3,0,0) Course Contents Introduction to Multimedia: definition, classification (discrete, continuous, passive, interactive), properties. Medium perception, representation, presentation, storage, and transmission, MM hardware, application areas, stages of MM project, design issues (speed, simplicity, clarity, consistency, ease of use, and navigation) Media and data stream, transmission modes, authoring tools (types, features, card/page-based, time-based, and icon-based) Text: text importance, encoding, fonts (type, size, style, leading, and kerning), text in MM (font design, menus, buttons, fields, portrait, landscape), editing design tools, hypertext vs. hypermedia, Sound terminology (acoustic, electromagnetic wave, cycle, frequency, amplitude, decibel), Digital audio (sampling, quantization, file size, size vs. quality, formats). MIDI files (creation, size, advantages, and disadvantages). MIDI vs. digital audio, Speech: generation (TTS), recognition (STT), applications, difficulties, program learning), Sound summary, Digital image (bitmap, vector graphic), Bitmap (pixels, color encoding, palette, and models, resolution), Image scanning, capturing, editing, morphing, dithering, file size, format (BMP, GIF, PNG, JPEG, etc), Vector graphics (types, properties, drawing, advantages, disadvantages, file size) Bitmap image vs. vector graphic, Image processing and programming skills. Animation: transition, cell animation (key frames, tweening, layers, morphing, formats), Video: concepts, standards, capturing, analog vs. digital, TV vs, computer video, compression and streaming. Encoding requirements (entropy, source, and adaptive), fixed length vs. variable length encoding, compression (HW vs. SW, lossy vs. lossless Compression (symmetric vs. asymmetric, dialogue mode vs. retrieval mode, RLE, Huffman), Compression techniques (JPEG and MPEG). Total Reference Books: 1. Vaughan Tay, Multimedia: Making it work, Berkeley Osborne McGraw-Hill, 6th Edition 2004. 2. Ralf Steinmetz & Klara Nahrstedt, Multimedia fundamentals Volume 1: Media coding and content processing, Prentice-Hall, 2002. 3. Stephen McLoughlin, Multimedia: Concepts and Practice, Prentice hall, 2001. 4. Ze-Nian Li & Mark S Drew, Fundamentals of Multimedia, Prentice hall, 2004. 5. Jen Dehaan, Macromedia FLASH MX 2004, training from the source, Macromedia press Hrs. 7 8 6 7 7 35 CA 106 Units 1 2 3 4 5 INTERNET TECHNOLOGY & PROGRAMMING Course Contents Internet Connection Concepts – Server, Client and Parts, DNS, Telephone, Cable and Satellite connections- Dialup, ISDN, ADSL and Leased live based connection, Cable and DSS a/c, Web TV and Internet, ISP features. TCP and UDP protocols, URL’s, CGI, MIME and introduction to SGML. HTML: Introduction to HTML, Elements of HTML syntax, Head and Body sections, Building HTML documents, Inserting text, images, hyperlinks, Backgrounds and Color Control, ordered and unordered lists, content layout & presentation. Tables: use of table tags,DIV and SPAN and various other HTML tags .. forms – frames – table Introduction of intranet - Intranet v/s LAN, Components of Internet-Workstations and Client software, Server and Network operating system. Network cards, cabling and hubs, steps for creating an intranet. Maintenance and connecting to internet. Web technology - Elements of web – clients and servers languages and protocols, web page and web sites, special kinds of web sites, web resources – search engines, massage boards, clubs, news groups and chat, web page creation concepts – planning, navigation, themes and publishing. Analyzing web traffic – log file data, analyzing log file and product for analyzing web traffic. E-mail technology - features and concepts – massage headers, address book, attachment, filtering and forwarding mails. Scripting languages HTML –webpage design – java script introduction – control structures – functions – arrays – objects – simple web applications. Total Reference Books: 1. C. L. Liu.: Elements of Discrete Mathematics, Tata Mac-Graw Hill. 2. Thomas, G.B. and R. L. Finney: Calculus & Analytical Geometry, Addison-Wesley, 9th edition. 3. Chandrika Prasad: Mathematics for Engineers, Prasad Mudranalaya, Allahabad, 19th edition 4. Shanti Narayan: Differential Calculus, S.Chand & Co. 5. Shanti Narayan: Integral Calculus, S.Chand & Co CA 108 FUNDAMENTAL OF ACCOUNTING AND FINANCIAL MANAGEMENT Units 1 2 3 4 5 2 3 4 5 6 7 8 PC PACKAGE LAB Hrs. 7 6 8 7 7 35 C(L,T,P) = 4(3,1,0) Course Contents Definition of Accounting and its advantages & limitations, Scope of accounting, Branches of Accounting – Financial Accounting – Cost Accounting – Management Accounting, users of Accounting information, Methods of Accounting, Double Entry Accounting System, Types of Accounts and Rules for Debit and Credit. Cash and Credit Transaction, Cash discount and Trade discount. Preparation of Journal, Ledger and Trial Balance. Final Accounts and Accounting Ratios, Preparation of Final Accounts (Sole Proprietorship only), Preparation of Trading A/c, Profit & Loss A/c and Balance Sheet covering simple adjustments Accounting Ratios: Meaning, Advantages and Limitations of Accounting ratios Computation of following ratios only. Gross Profit Ratio, Net Profit Ratio, Stock Turnover Ratio, Operating Ratio, Current Ratio, Liquid Ratio, Debtors Ratio, Creditors Ratio, Return on Capital Employed, Earning Per Share, Return on shareholders fund. Cost Accounting: Meaning and definition of Cost Accounting – its Advantages & Limitations Budgetary Control, Definitions – Advantages – Limitations, Procedure for setting up Budgetary Control, Different types of budgets, Advantages and limitations of Cash Budget and preparation of Cash Budget. Marginal Costing: Meaning-Advantages- Limitations, Break Even Point, Margin of Safety, Profit Volume Ratio, Application of Marginal Costing including simple problems on make or buy and product mix.. Total Reference Books: 1. Accounting by Steven M. Bragg 2. Accounting and financial management CA 151 S.No. 1 C(L,T,P)=3(3,0,0) Hrs. 8 7 7 8 7 37 C(L,T,P)=2(0,0,3) List of Experiment Installation of Operating Systems. Introduction to control panel, Add remove hardware and software, Installation of Hard disk, RAM,CD, ROM,CPU, Mother Board, Keyboard, Mouse, Ms-Word Basics: Working with MS Word; Menus Commands; Toolbars & Buttons; Shortcut Menus, Wizards & Templates; Creating a New Document Ms-Word Lab 2:Spell Check, Thesaurus, Find & Replace; Headers & Footers; inserting-Page Number, Pictures, File, Auto texts, Symbols etc. Ms-Word lab 3 Working with Columns, Tabs & Indent; Creation & Working with Tables including conversion to and from text; Margins & Space management in Document; adding References and Graphics. Ms-Word lab 4: Mail Merge, Envelops& Mailing Labels. Importing and exporting to and from various formats. MS Excel Lab 1: Working with Ms Excel; concepts of Workbook & Worksheets; using Wizards; Various Data Types; Using Different features with Data, Cell and Texts; Inserting, Removing & Resizing of Columns & Rows; Working with Data & Ranges; different Views of Worksheets; Column Freezing,Labels, Hiding, Splitting etc. Ms Power Point: Working with MS Power Point; Creating a New Presentation; Working with Presentation & Presentation of Slide Show; Printing Presentation. Hrs. 3 hrs Weekly CA 152 S.No. 1 2 3 4 5 6 7 8 3 4 5. 2 3 4 5 6 7 8 9 3 hrs Weekly C(L,T,P)=2(0,0,3) Hrs Stock in Tally - Creating a stock group - Displaying a stock group -Creating multiple stock groups -Displaying multiple stock groups -Creating a godoun -Displaying a single godoun -Creating multiple godouns -Displaying multiple godoun Report in Tally -Displaying the detailed view of the day book report - Trial balance -Ratio analysis - Balance sheet DTP & MULTIMEDIA LAB 3 hrs Weekly C(L,T,P)=2(0,0,3 ) List of Experiments Create resume in html language. Create list of sports celebrities in order list. Create a program to show a picture. Create list of sports celebrities in unordered list. Create buttons (checkbox, radio button etc) in html. Create a program of hyperlink in html. Create a program in html to link up a picture, a word file & a text. File Create a rectangle in dream weaver. CA 158 S.No. 1 TALLYLAB Hrs. List of experiments Introduction to Tally Groups, Ledgers, Vouchers, Orders, cost centers and categories CA 156 S.No. 1. 2. 3. 4. 5. 6. 7. 8. C(L,T,P)=2(0,0,3) List of Experiments Simple input output program integer, real character and string. (Formatted & Unformatted) Conditional statement programs (if, if-else-if, switch-case). Looping Program. (for, while, do-while). Program based on array (one, two, and three dimensions). Program using structure and unions. Program using Function (With and without recursion). Simple programs using pointers. File handling. CA 153 Units 1 2. COMPUTER PROGRAMMING LAB INTERNET PROGRAMMING LAB Hrs. 3 hrs Weekly C(L,T,P)=2(0,0,3) List of Experiments Create a biodata of self using HTML with a photograph on the page and containing marks in a table. Develop your web page with the following properties. 2 Photographs display at the same place flip on mouse over. Link to separate HTML file for academic, sports and other interests. Enhance your wep page using style sheets frams and setup a hyper link to your friends page. And 5 Make a form for submission of Querying about the interest rates of bank (use Text fields of HTML) and submit buttons of HTML. Make a local query form, which takes in the input the range of marks through Text fields (of Java) and display the list of students having marks in that range in another window. Enchance the above query through password protection. & 9. Build a shoping Cart page in which items of 10 types are picked and quantity and a bill is gererated by the wep page. Enchance the above page for making a payment through electronic billing system. Associate guest book in your web page. Hrs. 3 hrs Weekly CA 201 Units I II III IV V I II III IV V I II III IV V COMPUTER ORGANIZATION AND ARCHITECTURE Hrs. 7 7 7 8 6 35 C(L,T,P)=4(3,1,0) Contents of the Subject Hrs Data Movement around registers, Data movement from/to memory arithmetic and logic micro operations. Concept of bus and timings in register transfer. 7 Addressing Modes, Instruction Format, CPU organization with large registers, stacks and handling of interrupts & subroutines Instruction pipelining. 6 Array multiplier Booth's algorithm, Addition/subtraction for signed/unsigned number and 2's complement number. Basic organization of micro programmed controller, Horizontal & Vertical formats, Address sequencer. 6 Concept of RAM/ROM, basic cell of RAM, Associative memory, Cache memory organization, Vertical memory organization. 7 Introduction to Peripherals & their interfacing. Strobe based and handshake based communication, DMA based transfer, I/O 7 Processor. Total = 33 References Books : 1. J.P. Hayes-Computer Architecture & Organization, Mc-Graw Hill. 2. Heuring-Computer System Design and Architecture, Pearson Education. 3. M.Morrismanno-Computer System Architecture Prentice Hall of India. 4. Bartee-Computer Architecture, Tata Mc-Graw Hill. 5. Stallings-Computer Organization and Architecture Pearson Education CA 203 Units C(L,T,P)=3(3,0,0) Course Contents Introduction to OOPs and C++ Element - Introduction to OOPs, Features & Advantages of OOPs, Different element of C++ (Tokens, Keywords, Identifiers, Variable, Constant, Operators, Expression, String). Program Control Statements – Sequential Constructs, Decision Making Construct, Iteration / Loop Construct, Arrays, Functions (User defined Function, Inline Function, Function Overloading), User Defined Data Types (Structure, Union and Enumeration). Class, Object, Constructor & Destructor – Class, Modifiers (Private, Public & Protected), Data Member, Member Function, Static Data Member, Static Member Function, Friend Function, Object, Constructor (Default Constructor, Parameterized Constructor and Copy Constructor), Destructor. Pointer, Polymorphism & Inheritance – Pointer (Pointer to Object, this Pointer, Pointer to Derive Class), Introduction to Polymorphism (Runtime Polymorphism, Compile time Polymorphism), Operator Overloading, Virtual Function, Inheritance (Single Inheritance, Multiple Inheritance, Multilevel Inheritance, Hierarchical Inheritance, Hybrid Inheritance), Virtual Base Class, Abstract Class File Handling, Exception Handling - Files I/O, Exception Handling (Exception Handling Mechanism, Throwing Mechanism, Catching Mechanism, Re-throwing an Exception). Total Reference Books: 1. Object Oriented programming with C++ by E. Balaguruswami 2. Success with C++ by Kris James 3. Object Oriented programming with C++ by David Parsons 4. Programming in C++ by D. Ravichandran 5. Mastering C++ by Venugopal, Ravishankar, Rajkumar CA 202 Units OBJECT ORIENTED PROGRAMMING & C++ SYSTEM ANALYSIS & DESIGN C(L,T,P)=3(3,0,0) Course Contents System Concept: Definition, Characteristics, Elements of system, Physical and abstract system, open and closed system, manmade information systems. System Development Life Cycle: Various phases of system development, Considerations for system planning and control for system success. System Planning. Initial Investigation: Determining user’s requirements and analysis, fact finding process and techniques. Feasibility study: Determination of feasibility study, Technical, Operational & Economic Feasibilities, System performance constraints, and identification of system objectives, feasibility report. Cost/Benefit Analysis of the new/proposed system Structured Analysis: Tools of System Analysis. Structured Design: Tools of System Design with I/O and Form Design. Documentation for the new system: User Manual, system development manual, programming manual, programming specifications, operator manual. System testing & quality: System testing and quality assurance, steps in system implementation and software maintenance. System security: Data Security, Disaster/ recovery and ethics in system development, threat and risk analysis. Hardware and software procurement – In-house purchase v/s hiring and lease Total Reference Books: 1. System Analysis & Design by V K Jain, Dreamtech Press 2. Modern System Analysis & Design by A Hoffer, F George, S Valaciah Low Priced Edn. Pearson Education. Hrs. 7 7 7 8 6 35 CA 204 Units I II III IV V DATABASE MANAGEMENT SYSTEM C(L,T,P)=3(3,0,0) Course Contents Overview of DBMS, Basic DBMS terminology, data base system v/s file system, data independence. Architecture of a DBMS Introduction to data models: entity relationship model, hierarchical model: from network to hierarchical, relational model, comparison of network, hierarchical and relational models Data modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER diagrams to tables, extended ER model, relationships of higher degree Relational model: storage organizations for relations, relational algebra, relational calculus. Normalization: Functional dependencies, normal forms, first, second, third normal forms, BCNF, inclusion dependencies, loss less join decompositions, normalization using FD, MVD, and JDs, alternative approaches to database design Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL data types and literals, Types of SQL commands, SQL operators and their procedure, Tables, views and indexes, Queries and sub queries, Aggregate functions, insert, update and delete operations, Joins, Unions, Intersection, Minus in SQL Total Hrs. 7 7 8 8 8 38 Reference Books: 1. Database Management Systems by Raghu Ramakrishnan 2. Fundamentals of Database Management Systems by Mark L. Gillenson 3. Database System Concepts by Abraham Silberschatz, Henry F. Korth, and S. Sudarshan 4. Database Systems: Design, Implementation, and Management by Peter Rob and Carlos Coronel 5. Fundamentals of Database Systems (6th Edition) by Ramez Elmasri and Shamkant Navathe CA 205 Units I II III IV V SOFTWARE ENGINEERING-I C(L,T,P)=3(3,0,0) Course Contents Introduction to Software Engineering: Introduction, Definitions of Software Engineering, Program V/s. Software, Software Characteristics, Software Components, Software Applications, Software Crisis, Software Processes, Software Quality Attributes, Key challenges faced by the Software Engineering, Software Engineer, SDLC, Software System Development Methodologies, Project Management and Matrices, CASE tools Software Project Management: Project Management Process, Feasibility Study, Software Project Planning, Project Execution, Monitoring and Control, Project Termination Analysis, SCM, Process Management Process, CMM, QIP, GQM, ISO 9000, Risk Management Process, Software Project Planning, SPMR, Scheduling a Software Project, Work Breakdown Structure, Activity Chart, Critical Path Method, Gantt Chart, Project Evaluation Review Technique Requirement Engineering: Introduction to Requirement Engineering, Functional Requirements, Non-Functional Requirements, Domain Requirements, Requirement Engineering Process, Software Requirements Specification (SRS) Structured Analysis & Design: Data Modeling, Data Objects, Attributes And Relationships, Cardinality And Modality, Entity – Relationship Diagram, Functional Modeling, Data Flow Diagram, Logical And Physical DFDs, Leveling Of DFDs, Control Flow Diagram, Behavioral Modeling, Data Dictionary, Structured English, Decision Trees, Decision Table, Software Design Model, Conceptual and Technical Designs, Characteristics of a Good Design, Design Principles, Design Guidelines, Decomposition and Modularity Quality Assurance Activities: Types of Quality Assurance Activities , Verification and Validation, Testing, Testing Fundamentals, Strategic Issues in Testing, Test Plan, Testing Principles, General Testing Strategies, Code Testing, Specification Testing, Black Box Testing, White Box Testing, Testing Process Total 1. 2. 3. Reference Books: Oehm B. W., A Spiral Model of Software Development and Enhancement, IEEE Computer, 21.pp 61-72, May 1988. Fairley R., Software Engineering Concepts, McGraw Hill, New York, 1985. C. Banerjee, Software Engineering, Genius Publications, 2009 4. Gill N.S., Software Engineering: Software Reliability, Testing and Quality Assurance, Khanna Book Publishing Co (P) Ltd, New Delhi, 2002 5. Sabharwal S., Software Engineering: Principles, Tools and Techniques, Second Ed., Umesh Publications, Delhi, 2005. Hrs. 6 7 7 8 6 34 CA 206 DATA COMMUNICATION & NETWORKING Units I II III IV C(L,T,P)=4(3,1,0) Contents of the Subject Overview, evolution of computer networks, computer telephony. Data communications – advantages of digital communication, transmission media, fundamentals of digital communications, transmission media, modulation techniques and modems. The OSI seven layer network model, LAN technologies – protocols and standards, LAN hardware, TCP/IP and the Internet, Internet Architecture, Internet protocol and data grams., Routing protocols, UDP, Internet standard services, DNS. Networking Technologies, ISDN, Cable Modem System, DSL, SMDS, Frame relay, fast Ethernet, 100VG-anyLAN and Gigabit Ethernet, FDDI and CDDI, Asynchronous Transfer, SONET, DWDM. Switching and Virtual LAN, Non-ATM Virtual LANs, IEEE 802.1Q VLAN standard, Network Performance, Analytical approaches, simulation, traffic monitoring. Network Management – SNMP, RMON and RMNv2, T MN, Directory services and network management. Issues related to network reliability and security, SSL and VPN, Introduction only to firewalls and Kerberos, Cyber Laws. Hrs Total 35 7 7 7 8 6 V Reference Books: 1. Data Communications and Networking (McGraw-Hill Forouzan Networking) by Behrouz A. Forouzan 2. Introduction to Data Communications and Networking by Wayne Tomasi 3. Networking and Data Communications by V. C. Marney-Petix CA 207 MANAGEMENT INFORMATION SYSTEM Units C(L,T,P)=3(3,0,0) Course Contents Introduction, MIS concept, Definition, role & Impact of MIS, Process of management, organization structure & behavior. Hrs. 6 Basic of Management Information System Decision Making, Information concepts, System concepts & control Types of system handling system complexity System development model Development of Management Information System Requirement and implementation of MIS, Choice of information Technology for Management Information System. Application of Management Information system Application in manufacturing sector using for personal management, financial management, Production Management, Material Management, Marketing Management Application in Service Sector. Enterprise Resource Planning (ERP), EMS, ERP, Benefits implementation, EMS & MIS. Case Studies- Application of SAPTMtechnoligies in manufacturing sector 7 I II III IV V 7 8 6 Total 34 Reference Books: 1. W.S. Jawadekar-Management Information System, Tata McGraw Hill. 2. Loudon & Loudon-Management Information, Pearson Education Asia CA 208 Units I II III IV V DATA STRUCTURE & ALGORITHM C(L,T,P)=3(3,0,0) Contents of the Subject The concept of data structure, Abstract data type, Concept of list & array Introduction to stack, Stack as an abstract data type, primitive operation on stack, Stacks application: Infix, post fix, Prefix and Recursion, Multiple Stack. Introduction to queues, Primitive Operations on the Queues, Queue as an abstract data type, Circular queue, Dequeue, Priority queue, Applications of queue Introduction to the Linked List , Basic operations on linked list, Stacks and queues linked list, Header nodes, Doubly Linked List, Circular Linked List, Stacks & Queues as a Circular Linked List, Application of Linked List TREES - Basic Terminology, Binary Trees, Tree Representations using Array & Linked List, Basic operation on Binary tree, Traversal of binary trees:- In order, Preorder & post order, Application of Binary tree, Threaded binary tree, B-tree & Height balanced tree, Binary tree representation of trees Analysis of algorithm, complexity using big ‘O’ notation. Searching: linear search, Binary search, their comparison. Sorting: Insertion sort, Selection sort, Quick sort, Bubble sort, Heap sort, Comparison of sorting methods. Hash Table, Collision resolution Techniques Introduction to graphs, Definition, Terminology, Directed, Undirected & Weighted graph, Representation of graphs, Graph Traversal-Depth first & Breadth first search. Spanning Trees, minimum spanning Tree, Shortest path algorithm Total Reference Books: 1. Fundamentals Of Data Structure, By S. Sawhney & E. Horowitz 2. Data Structure : By Trembley & Sorrenson 3. Data Structure : By lipschuists (Schaum's Outline Series Mcgraw Hill Publication) 4. Fundamentals Of Computer Algorithm: By Ellis Horowitz and Sartaj Sawhney Hrs 8 7 7 7 7 36 CA 210 Units I II III IV V I II III IV V INFORMATION SECURITY I II III IV V 8 8 7 7 7 Hrs. 8 8 7 6 6 35 C(LTP) = 4(3,1 ,0) Contents of the Subject Object model, Visual Basic Environment Visual Basic Code Statements, Controls, Coding for the controls, variables, constants and calculations, decision control structure Loop control structure, nested Ifs statements, Input validations, Calling event procedures, Menus, Sub Procedures and Sub Functions, Multiple forms, Variables and Constants in Multiple Form Projects List Boxes and Combo Boxes, Using Mfg Box and String Function Arrays, using List Boxes and Arrays, Multidimensional Arrays, Classes, initializing and terminating events, Collections, using the Object browser Data Files, Sequential File Organization, Random Data Files. Accessing Database files, Navigating the database in Code, Displaying Data in Grids, Validation and Error Trapping Dragging and Dropping Multiple Objects, Graphics, Layering, Simple Animation, Active X, Dynamic Link Libraries, Object Linking and Optimizing VB Code, OLE Automation and VBA, automating Word, Excel and Outlook 98. Reference Books: 1. 2. 3. Hrs C(L,T,P)=3(3,0,0) Contents of the Subject Introduction : Attacks ,services and mechanism ,security attacks, security services ,model for Internet work security Conventional Encryption : Principles, algorithms, cipher block modes of operation ,location of encryption devices ,key distribution . Public Key Cryptography : Approaches to message authentication, secure Hash function & HMAC, public key cryptography principles ,algorithms ,digital signature ,key management . Authentication Applications Kerberos , X 509 Directory authentication service. IP Security : Overviews ,Architecture ,Authentication header .Encapsulating security payload, Combining security associations ,key manangent Web Site : Requirement ,Secure Sockets Layer (SSL) & Transport Layer Security (TLS), Secure Electronic Transaction (SET Intruders ,Viruses & Firewall : Intruders , Viruses & related threats Firewall Design Principles ,Trusted Systems E-Mail Security : Pretty Gard Privacy (PGP) & S/MIME. Total Reference Books: 1. Stallings -Network Security Essentials ,Pearson Eduction Asia , 2003 2. Nick Galbreath -Cryptography for database and Internet applications, Wiley-Dreamtech, 2002 Stallings - Cryptography & Network Security ,Pearson Eduction Asia , 2nd Ed. CA 214 PROGRAMMING IN VISUAL BASIC Units C(L,T,P)=3(3,0,0) Contents of the Subject Introduction: Motivation, Forces behind E-Commerce Industry Framework, Brief history of ECommerce, Inter Organizational E-Commerce Intra Organizational E-Commerce, and Consumer to Business Electronic Commerce, Architectural framework, Network Infrastructure for E-Commerce Network Infrastructure for ECommerce, Market forces behind I Way, Component of I way Access Equipment, Global Information Distribution Network, Broad band Telecommunication. Mobile Commerce: Introduction to Mobile Commerce, Mobile Computing Application, Wireless Application Protocols, WAP Technology, Mobile Information Devices, Web Security, Introduction to Web security, Firewalls &Transaction Security, Client Server Network, Emerging Client Server Security Threats, firewalls & Network Security. Encryption: World Wide Web & Security, Encryption, Transaction security, Secret Key Encryption, Public Key Encryption, Virtual Private Network (VPM), Implementation Management Issues. Electronic Payments: Overview of Electronics payments, Digital Token based Electronics payment System, Smart Cards, Credit Card I Debit Card based EPS, Emerging financial Instruments, Home Banking, Online Banking. Net Commerce: EDI, EDI Application in Business, Legal requirement in E -Commerce, Introduction to supply Chain Management, CRM, issues in Customer Relationship Management. Reference Books: 1. David Whiteley-E-Commerce Strategy, Technology and Applications, Tata McGraw Hill. 2. Mathew Reynolds-Beginning E-commerce with visual Basic ASP, SQL Server 7.0 and MTS, 3. Shroff Publishers & Distributors Pvt. Ltd. 4. Perrone & Chaganti-Building Java Enterprise Systems with J2EE, Techmedia. 5. Kalakota-Frontiers of Electronic Commerce, Pearson Education CA 212 Units E-COMMERCE Julin Case Bradley and Anita C. Millspaugh: Programming in Visual Baisc 6.0, Tata Mc Graw Hill. Dan Rahmel: Visual Basic 6, Tata Mc Graw Hill. Wayne S. Freeze : Visual Baic 6, BPB Publications Hrs 7 8 7 6 8 CA 251 OBJECT ORIENTED PROGRAMMING & C++ LAB C(L,T,P)=2 (0,0,3) S.No. 1 2 3 4 List of Experiments Write a program to perform the complex arithmetic. Write a program to perform the rational number arithmetic. Write a program to perform the matrix operations (Transpose, addition, subtraction, multiplication). Implement Morse code to text conversion and vice-versa. 5 6 7 8 9 10 11 12 To calculate GCD of given numbers. To implement Tower of Hanoi problem. To implement spell checker using dictionary. To implement a Color selector from a given set of colors. To implement a shape selector from a given set of shapes. By mapping keys to pens of different colours, implement Turtle graphics. To implement a calculator with its functionality. To implement a graph and display BFS/DFS order of nodes. CA 252 S.No. 1 2 3 4 5 6 7 7 8 9 10 11 12 13 3 hrs Weekly C(L,T,P)=2 (0,0,3) List of Experiments (a) Write a C++ program to store students records (roll no, name, father name) of a class using file handling. (Use C++ and File handling). (b) Re-write program 1, using any DBMS and any compatible language.(C++/MySQL) (VB and MS-Access) Database creation/ deletion, table creation/ deletion. (a) Write a program to take a string as input from user. Create a database of same name. Now ask user to input two more string, create two tables of these names in above database. (b) Write a program, which ask user to enter database name and table name to delete. If database exist and table exist then delete that table Write a program, which ask user to enter a valid SQL query and display the result of that query Write a program in C++ to parse the user entered query and check the validity of query. (Only SELECT query with WHERE clause) Create a database db1, having two tables t1 (id, name, age) and t2 (id, subject, marks). (a) Write a query to display name and age of given id (id should be asked as input). (b) Write a query to display average age of all students. (c) Write a query to display mark-sheet of any student (whose id is given as input). (d) Display list of all students sorted by the total marks in all subjects. Design a Loan Approval and Repayment System to handle Customer's Application for Loan and handle loan repayments by depositing installments and reducing balances Design a Video Library Management System for managing issue and return of Video tapes/CD and manage customer's queries. CA 253 S.No. 1 2 3 4 5 6 DATABASE LAB SOFTWARE ENGINEERING LAB Hrs Hrs 3 hrs Weekly C(L,T,P)=2 (0,0,3) List of Experiments Write a program to count non blank lines with multi line, single line, half line and documentation (only in java) comments Write a program to count global, external variables and their size (i.e. no of characters) and go to statements Write a program to analyze whether every line of code can be statically determined or not Write a program to check it brackets and loops are properly in dented or not. If not then output indented program Write a program to count recursive and non recursive program and how many places the functions are called Extend the program in Expt. 5 to determine the level of recursion and estimate the size of stack required Generate the function wise report consisting. Function type-recursive/non recursive Parameter names and types Return types Global variables used Public/private/protested type variable/methods and over loaded methods. (In C++/Java only) Estimate the space required by the program. Estimate the time required for execution in the program. Implement a TSR program. Write a program to test Keyboard/Monitor services, using system interrupts. Write a program to test keyboard/Monitor services, using system interrupts. Write a program to test Keyboard/Monitor serviced without using system interrupts Hrs 3 hrs Weekly CA 254 COMPUTER NETWORKING LAB S.No. 1 2 3 4 5 6 7 8 9 10 11 12 C(L,T,P)=2 (0,0,3) List of Experiments Write an echo client and server using socket. Design a clock synchronization protocol. Build a client for the protocol. Build a domain name system client program. Build a DHCP client. Capture and decode Ethernet frames. Decode an IP header. Build a packet analyzer. Extract data from a TCP stream. Observe concurrent TCP connections. Extract data from a TCP stream Observe concurrent TCP connections CA 255 ADVANCE PROGRAMMING LAB Hrs 3 hrs Weekly C(L,T,P)=2 (0,0,3) The experiment will be based on the topic to covered in the syllabus CA 256 S.No. 1 2 3 4 5 6 7 8 9 10 11 12 13 DATA STRUCTURE ALGORITHM LAB 03 hrs (weekly) C(L,T,P)=2 (0,0,3) List of Experiments Program on array searching, sorting (Bubble sort, Quick sort, Marge sort etc.) Program to insert element at desire position, replacing element, deletion in array. Various matrices operations. Addition, multiplication and transpose of sparse matrices represented in array form. Addition, multiplication and transpose of sparse matrices represented in linked list form. Polynomial addition, multiplication (8th degree polynomials). Implementation of stack and queue using link lists. Implementation of circular queue using link lists. Polynomial addition, multiplication. Two-way link lists programs. Hrs 3 hrs weekly Infix to postfix/prefix conversion. BST implementation (addition, deletion, searching). Graph traversal (BFS, DFS). CA 258 INFORMATION SECURITY LAB C(L,T,P)=2 (0,0,3) The experiment will be based on the topic to covered in the syllabus CA 260 VISUAL BASIC LAB S.No. 1. 2. 3. 4. 5. 3 hrs weekly C(LTP) = 2 (0,0,3) List of Experiments Five experiments based on the following topics: Object model, Visual Basic Environment Visual Basic Code Statements, Controls, Coding for the controls, variables, constants and calculations, decision control structure Five experiments based on the following topics: Loop control structure, nested Ifs statements, Input validations, Calling event procedures, Menus, Sub Procedures and Sub Functions, Multiple forms, Variables and Constants in Multiple Form Projects List Boxes and Combo Boxes, Using Mfg Box and String Function Five experiments based on the following topics: Arrays, using List Boxes and Arrays, Multidimensional Arrays, Classes, initializing and terminating events, Collections, using the Object browser Five experiments based on the following topics: Data Files, Sequential File Organization, Random Data Files. Accessing Database files, Navigating the database in Code, Displaying Data in Grids, Validation and Error Trapping Five experiments based on the following topics: Dragging and Dropping Multiple Objects, Graphics, Layering, Simple Animation, Active X, Dynamic Link Libraries, Object Linking and Optimizing VB Code, OLE Automation and VBA, automating Word, Excel and Outlook 98. Hrs. 3 hrs Weekly CA 301 FUNDAMENTALS OF OPERATING SYSTEM Units I II III IV V C(L,T,P)=3 (3,0,0) Contents of the Subject Introduction: Definition and types of operating systems, Batch Systems, multi programming, time–sharing parallel, distributed and real-time systems, Operating system structure, Operating system components and services, System calls, system programs, Virtual machines. Process Management: Process concept, Process scheduling, Cooperating processes, Threads, Inter-process communication, CPU scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Real-time scheduling and Algorithm evaluation. Process Synchronization and Deadlocks: The Critical-Section problem, synchronization hardware, Semaphores, Classical problems of synchronization, Critical regions, Monitors, Deadlocks-System model, Characterization, Deadlock prevention, Avoidance and Detection, Recovery from deadlock, Combined approach to deadlock handling. Storage management: Memory Management-Logical and Physical Address Space, Swapping, Contiguous Allocation, Paging, Segmentation with paging, Virtual Memory, Demand paging and its performance, Page replacement algorithms, Allocation of frames, Thrashing, Page Size and other considerations, Demand segmentation, File systems, secondary Storage Structure, File concept, access methods, directory implementation, Efficiency and performance, recovery, Disk structure, Disk scheduling methods, Disk management, Recovery, Disk structure, disk scheduling methods, Disk management, Swap-Space management, Disk reliability. Protection and Security-Goals of protection, Domain of protection, Access matrix, Implementation of access Matrix, Revocation of Access Rights, language based protection, The Security problem, Authentication, One Time passwords, Program threats, System threats, Threat Monitoring, Encryption. Case study : Windows NT-Design principles, System components, Environmental subsystems, File system, Networking and program interface. Total Hrs. 7 7 8 8 8 38 Reference Books: 1. Tannenbaum, "Operating System Design and Implementation", PHI. 2. Gary Nutt, "Operating System, A Modern Perspective", Addision Wesley. 3. Stalling, Willium, "Operating System", Maxwell Macmillan 4. Silveschatza, Peterson J, "Operating System Concepts", Willey. CA 302 Units 1 2 3 4 5 ASP.NET USING C# C(LTP) = 3(3,0,0) Course Contents Asp .Net Basics - Understanding the .Net framework – principal, feature, design, gole, Benefits of .Net framework, Event Logging, Performance Counter, Tracing, CTS, CLS, CLR, .Net class library, GIT, Type of GIT, Assemblies - version, culture, strong name, Type of Assemblies, Metadata, Manifest, MSIL, Managed and Unmanaged code, Memory Management, Garbage Collection, Security, Reflection, WPF, WCF, Window Card Space, GAC, CASPOL, REGEN, ILASM, ILDASM. DLL HELL Problem, Page life cycle. Introduction Ado.NET - Ado.Net Basics, Ado.Net object model, Ado.Net class for OLE DB data source, SQL Server, DataSet, Data View, Data Reader, Data Adapter, Data Table, Data Column, Data Row, Difference between Ado and Ado.Net, Communication with OLEDB data source using Ado.Net. Understanding Caching - Overview, Introduction to Caching, Client dedicated server, Reverse proxy, Absolute expiration and Relative expiration, Http Cache Policy, HttpCacheability, @ Output Cache, HttpCacheVaryByParams, HttpCacheVaryByHeaders, CachingPageOutput, Data caching, PageFragment Caching, PageOutput caching. State Management - Client state management- View state, Hidden field, Cookies, QueryString Server state management- Application state, Session state, Advantage and Disadvantage of database support. Web Services and XML - Introduction to xml, Advantage of xml, xml Element, Naming Rules, Attributes Introduction to web service, web service Infrastructure, SOAP, UDDI, WSDL. Total Reference Books: 1. Beginning ASP.NET 3.5 in C# 2008: From Novice to Professional, Second Edition by Matthew MacDonald 2. ASP .NET Programming with C# & SQL Server (The Web Technologies) by Don Gosselin 3. Developing Web Applications with ASP.NET and C# by Hank Meyne and Scott Davis 4. Beginning ASP.NET 2.0 with C# (Wrox Beginning Guides) by Chris Hart, John Kauffman, David Sussman, and Chris Ullman Hrs. 7 6 8 7 7 35 CA 303 Units I II III IV V PROGRAMMING IN JAVA C(LTP) = 4(3,1,0) Course Contents Overview of Object Oriented Concepts in Java. Introduction Java & internet, Java applets and its applications, Java features like security, portability, byte code, java virtual machine, object oriented, robust, multithreading, architectural neutral, distributed and dynamic Data types and control structures, operators, array, Java methods and classes. Inheritance of procedures and Data, packages and interface, exception handling, multithreaded programming thread priorities, synchronization, messaging, creating and controlling of threads. I/O and applets. String handling and various string functions Java utilities like java.lang, java.util and their uses, java.io, basics of networking using Java. Java applets and their use – Event Handling – AWT and working with Windows – Event Handling – Event Handling Mechanisms, Delegation Event Model, Event Class, Event Listener Interfaces, Adapter Classes, Inner Class. AWT and working with windows – AWT Classes, Window fundamentals, frame windows, frame window in An Applet, Working with Graphics, color, fonts and text. Java Beans – BDK, JAR files, Introspection, Developing simple bean using BDK, Bound Properties, Bean Info, Interface, Constrained properties, Persistence, Customizes Servlets - Life cycle of servlet, use of tomcat for servlet, servlet API, Javax.Servlet package, servlet parameters, Javax.Servlet.http package, Handling HTTP requests and Responses, Cookies JDBC – JDBC API, JDBC Drivers, Products, JDBC Design considerations, Two Tier and Three Tier client server model, Basic steps to JDBC, setting up a connection to database, Creating and executing SQL statements, Result set and Result set Meta Data Object Total Hrs. 7 7 8 8 7 37 Reference Books: 1. Java 2 Computer Reference (Tata McGraw Hill) 2. Core Java-I (Addison Wesley) - horstmann 3. Core Java - II (Addison Wesley) 4. Thinking in Java (Bruce Eckel) CA 304 Units 1 2 3 4 5 OPEN SOURCE TECHNOLOGY C(LTP)= 3(3,0,0) Course Contents Open source technology (OST): Introduction, Evolution & development of OST and contemporary technologies, Factors leading to its growth, Free Software Foundation and the GNU Project, principle and methodologies. Applications of open source, Risk Factors, Myths regarding open source. Philosophy of Software Freedom: Free Software, OSS, Closed software, Public Domain Software, Shared software, Shared source. Detail of few OSS like Open Audio, Video, 2d & 3d graphics software, system tools, office tools, Networking & internet, Security, Educational tools and Games. Open Source Development Model: Starting and Maintaining an Open Source Project, Open Source Hardware, Open Source Design, Ongoing OS Projects. Case Study: - Linux, Wikipedia etc. Licenses of open source: What Is A License, How to create your own Licenses? Important FOSS Licenses (Apache, BSD, GPL, LGPL), copyrights and copy lefts. Economics of FOSS: Social and Financial impacts of open source technology, Zero Marginal Cost, Income generation opportunities, Problems with traditional commercial software, Internationalization, Open Source as a Business Strategy. Total Reference Books: 1. Embedded Linux Primer by Hallinan 2. Embedded Linux: Hardware, Software, and Interfacing by Hollabaugh 3. Linux Kernel Programming by Beck 4. Open Source Development with Lamp: Using Linux Apache, MySQL, Perl and PHP by LEE Hrs. 7 8 8 6 7 36 1 CA 305 WEB DESIGNING C(LTP)= 3(3,0,0) Contents of the Subject The internet: history of the world wide web, hardware and software trend, object technology – java script object, scripting for the web-browser portability. 7 2 Introduction of HTML: introduction, markup language, editing HTML : common tags, headers, text styles, linking, images, formatting text, horizontal rules and more line breaks, unordered lists, nested and ordered lists, basic HTML tables : intermediate HT ML tables and formatting : basic HTML forms, more complex HTML forms, internal linking, creating and using image maps. Java script – introduction to scripting: introduction- memory concepts- arithmetic- decision making. Java script control structures, Java script functions: introduction – program modules in java script - function definitions, duration of identifiers, scope rules, recursion, java script global functions. Java script arrays: introduction, array-declaring and allocating arrays, references and reference parameters – passing arrays to functions, multiple subscripted arrays. Java script objects: introduction, math, string, data, Boolean and number objects. Dynamic HTML : CSS : introduction – inline styles, creating style sheets with the style element, conflicting styles, linking external style sheets, positioning elements, backgrounds, element dimensions, text flow and the box model, user style sheets. Dynamic HTML: object model and collections: introduction, object referencing, collections all and children, dynamic style, dynamic positioning, using the frames collection, navigator object. Dynamic HTML: event model : introduction, event ON CLICK, event ON LOAD – error handling with ON ERROR, tracking the mouse with event, more DHTML events. Filters and Transitions: Dynamical HTML: Client side scripting with VB script: Introduction - operators- data types and control structures – VB script functions – arrays –string manipulation classes and objects. Introduction to PHP – Advantages of PHP – Functions – Data types – Arrays – SQL – Connecting Databases using ODBC – Files – Forms – Images –I map objects. Total Reference Books: 1. Pro XML Development with Java Technology: From ... - by Ajay Vohra, Deepak Vohra 2. Information Technology and Economic Development - by Yutaka Kurihara, Sadayoshi Takaya, Hisashi 8 Units 3 4 5 Units 1 2 3 4 5 1. 2. 3. 4. Units I II III CA 306 ARTIFICIAL INTELLIGENCE C(LTP)= 4(3,1,0) Course Contents Intelligence: concept of intelligence, Artificial intelligence, areas of application. Search techniques, state space, Production rules, problem characteristics, production system characteristic, depth first, breadth first search methods and their analysis, Heuristic search method, generate and test, hill climbing, best first method. Knowledge Representation: concept of knowledge, characteristics and representation schemes, Logic, prepositional and predicate calculus, resolution, semiotics nets, frames, conceptual dependency. No monotonic Reasoning: default reasoning, minimalist reasoning, statistical reasoning – Bay’s theorem, certainty factors, dumpsters Shafer theory, Fuzzy logic, Forward and Backward reasoning, logical reasoning etc. Learning: concept of learning, various techniques used in learning, inductive and deductive. Knowledge acquisition, rote learning, discovery and analogy. Expert System: concept of expert system, need for an expert system, Component and categories of an expert system, Stages in the development of an expert system, application & future scope of expert system. Total Reference Books: Programming for Artificial Intelligence,:- by Prolog Artificial Intelligence,:- by Rich &Night Learning and Soft Computing: Support Vector Machines, Neural Networks, and Fuzzy Logic Models by Kecman Lisp by Winton CA 307 SOFTWARE ENGINEERING II C(LTP) = 4(3,0,0) Course Contents Software Project Estimation and Decomposition Techniques: Software Decomposition, Software Decomposition Techniques, Software Sizing, Problem based estimation, Process-based estimation, Empirical Estimation Techniques, Heuristic Estimation Techniques, COCOMO, Analytical Estimation Techniques, Function Point Analysis Object Oriented Analysis: The object–oriented paradigm, Object–Oriented Concepts, Classes and Objects, Attributes, Methods, Messages, Abstraction, Data Encapsulation,. Inheritance, Polymorphism, Dynamic Binding, Function Overriding, Operator Overloading, Message Communication, Object–Oriented Analysis, Domain Analysis, Use Cases, Class– Responsibility–Collaborator Modeling, Classification and Assembly Structures, Defining Subjects, Instance Connections & Message Paths, OOA and Prototyping, The Object–Relationship Model, The Object–Behavior Model Design: Abstraction, Stepwise Refinement, Software Architecture, Control Hierarchy, Data Structure, Software Procedure, Structural Partitioning, Information Hiding, Software Design Process, Effective Modular Design, Module Types, Functional Independence, Cohesion, Coupling, Effective Modular Design Heuristics, Data Design, Architectural Design, Procedural Design, Design Documentation, Hrs 6 7 7 35 Hrs. 7 7 7 7 7 35 Hrs. 8 7 6 Programming and Quality Assurance Activities: Fundamentals of Software Programming, Internal Documentation, Code IV V Verification and Validation Techniques, Code Monitoring & Control Activities, Black Box testing, White Box testing methods Software Maintenance and Re-engineering: The Maintenance Process, Type of Maintenance, Corrective Maintenance, Adaptive Maintenance, Perfective Maintenance, Preventive Maintenance, Maintenance Costs, Measuring Effectiveness, Controlling Maintenance Requests, Software Re-engineering Process Total Reference Books: 1. Roger S. Pressman-fifth Edition, Mc-Graw hill Publications. 2. Ali Behforooz and frederick J. Hudson Oxford Press 1998. 3. Ian Sommerville-Software Engineering, Pearson Education India 6 6 33 CA 308 Units 1 2 3 4 5 2 3 4 5 6 2 3 4 5 6 7 8 9 10 ASP .NET LAB (USING C#) WEB DESIGNING LAB Hrs. 7 7 7 7 7 35 C(LTP) = 2(0,0,3) Hrs. 3 hrs Weekly C(LTP) = 2(0,0,3) List of Experiments By using SQL Data source sow the record in Grid view, Detail View, Form view, Repeater and List view By using SQL Data source put the record in the dropdown Manu than find the detail information of the selected item from the dropdown Manu By using North wind Database find out some of the unit in stock. Show the use of Eval and Bind property in the form view Create the master page and show the implementation in the aspx page. Create the Theme as blue theme or green theme and show the use of it. By using Ado.Net insert and Display the record. Show the use of SQL data reader class in Ado.Net. Create the DLL file and implement in the aspx page. Put the multiple values in the dropdown list1 select the particular information in dropdown list1 and find out different information in dropdown list2 related to DDL1 CA 353 S.No. 1 2 3 4 5 6 7 8 9 10 11 12 JAVA PROGAMMING LAB List of Experiments Simulate a traveling guide which displays major cities of Rajasthan on screen and connecting roads, provide a facility to display shortest path between two cities and also a traveling salesman route. Generate symbol table and perform lexical analysis of C program. Write a program to draw Circle/Rectangle/Triangle/Ellipse on screen and perform different transformation operation (Shift, rotate, resize) on the object created. Draw a rectangular box of size 4:3:2 and generate its different views. Animate a car on the screen such that when car moves its wheels rotates. Simulation of digital clock (display as 7-segment LED). CA 352 S.No. 1 C(LTP) = 4(3,1,0) Course Contents Introduction – Role of programming languages - Effects of Environments on languages – Language. Design issues - Virtual computers and binding times, Language Paradigms Data types - Specification of data types, implementation of elementary data types, Declarations, type, checking and type conversion - Assignment and Initializations - Structured data types - Specification of, data structure types, Implementation of data structure type - Declarations and type checking for data structures Abstract data types, Encapsulation by subprogram - Type definition, storage management – Sequence, Control - Implicit and Explicit sequence control, sequencing with arithmetic expressions, sequence, control between statements. Subprogram control - Subprogram sequence control, attributes of data control, Shared data in subprograms - Abstract data types revisited, Inheritance, Polymorphism Advances in Language design - Variations of subprogram control, Parallel programming, Introduction to exception handling Exception handling in JAVA, Hardware developments, software architecture. Total Reference Books: 1. V.Rajaraman :Fundamentals of Computers 2. Ghezzi: Programming Language Concepts, Addison Wesley. 3. Kernighan, Ritchie :Programming in C 4. Structure :Programming in C++ 5. Ravi Shetty:Programming Language CA 351 S.No. 1 PRINCIPLES OF PROGRAMMING LANGUAGE Hrs. 3 hrs Weekly C(LTP) = 2(0,0,3) List of Experiments Use of HTML tags Text formatting, text styles, lists(ordered list and unordered list with nesting control) Tables with Rowspan and colspan Linking documents( hyper linking and image maps) linking to a particular location(within page, another page) Frames: use of frames set, targeting frames Preparation of the static website with the help of HTML tag CSS:In line,internal,external Use of the Java Script Use of the forms in HTML(buttons,text,drop down menu etc) Adding graphics to HTML documents Use of VB script Introduction to PHP Hrs 3 hrs Weekly CA 354 S.No. 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 C(LTP)=2(0,0,3) List of Experiments CPU simulator: Write a program to read mnemonics for 8085 CPU and produce appropriate machine language instruction. Tape Drive simulator: Write a program to declare 512 kb portion of RAM memory as a Magnetic Tape Drive on which sequential file can be stored and accessed .Files are to be written as blocks of fixed or variable size. Make appropriate assumption about start time, stop time, tape speed ,load point and last point of tape. Floppy Disk Drive Simulator: Write a program to declare 512 kb portion of RAM memory as a double sided disk drive of 64 tracks 32 sectors per track of unformatted capacity. Format it to store at least 64 byte /sector of user data as sequential and /or random access files. Assume that both heads move together. File Manager: Write a file manager for above disk drive. It should maintain file directory, record of used/free sectors, good/bad(assumed) sectors .Create ,delete ,rename file/directories. Memory Manager: Write a memory manager for 64 kb of RAM memory for use with 8085 CPU for segmented memory management (fixed/ variable size segments. ). At least one segment of 8kb must be reserved for O.S. and other may be given to users (max. 7 processor). Implement memory compaction .garbage collection and best fit/worst fit allocation schemes. Long Term Scheduler: Write a job analyzer to inspect incoming job, evaluate its system resource requirement and execution priority and schedule it for execution. Short Term Scheduler: Write a process scheduler allowing two different time quanta for CPU scheduling and I/O Scheduling in which process can change various states. Write a print scheduler which examine output file an schedules them for printing on a slow printer or fast printer to optimize the system throughput. Write a interput handler for 8085. Write a system call handler for creating, deleting and terminating (Normally/Abnormally) process. CA 501 Units OPERATING SYSTEM LAB FUNDAMENTALS OF OPERATING SYSTEM 3 hrs Weekly C(L,T,P) = 3(3,0,0) Course Contents Introduction: Definition and types of operating systems, Batch Systems, multi programming, time–sharing parallel, distributed and real-time systems, Operating system structure, Operating system components and services, System calls, system programs, Virtual machines. Process Management: Process concept, Process scheduling, Cooperating processes, Threads, Inter-process communication, CPU scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Real-time scheduling and Algorithm evaluation. Process Synchronization and Deadlocks: The Critical-Section problem, synchronization hardware, Semaphores, Classical problems of synchronization, Critical regions, Monitors, Deadlocks-System model, Characterization, Deadlock prevention, voidance and Detection, Recovery from deadlock, Combined approach to deadlock handling. Storage management: Memory Management-Logical and Physical Address Space, Swapping, Contiguous Allocation, Paging, Segmentation with paging, Virtual Memory, Demand paging and its performance, Page replacement algorithms, Allocation of frames, Thrashing, Page Size and other considerations, Demand segmentation, File systems, secondary Storage Structure, File concept, access methods, directory implementation, Efficiency and performance, recovery, Disk structure, Disk scheduling methods, Disk management, Recovery, Disk structure, disk scheduling methods, Disk management, Swap-Space management, Disk reliability. Protection and Security-Goals of protection, Domain of protection, Access matrix, Implementation of access Matrix, Revocation of Access Rights, language based protection, The Security problem, Authentication, One Time passwords, Program threats, System threats, Threat Monitoring, Encryption. Case study : Windows NT-Design principles, System components, Environmental subsystems, File system, Networking and program interface. Total Reference Books: 1. Milenekovie, "Operating System Concept", McGraw Hill. 2. Petersons, "Operating Systems", Addision Wesley. 3. Dietal, "An Introduction to Operating System", Addision Wesley. 4. Tannenbaum, "Operating System Design and Implementation", PHI. 5. Gary Nutt, "Operating System, A Modern Perspective", Addision Wesley. 6. Stalling, Willium, "Operating System", Maxwell Macmillan Hrs Hrs. 7 8 7 8 7 37 Units 1 2 3 4 5 CA 502 PROGRAMMING IN JAVA C(L,T,P) = 3(3,0,0) Course Contents Overview of Java, Object Oriented Concepts in Java. Abstraction, OOP Principles and Java applications, Java features like security, portability, byte code, java virtual machine, object oriented, robust, multithreading, architectural neutral, distributed and dynamic, Data types and Keyword Operators: Arithmetic, Bitwise, Relation, increment Decrement, logical, special, Assignment Control Structures, Type Casting , Array, Java methods, Classes, Constructor, method overriding, method overloading, abstract class, Inheritance of procedures and Data, packages java. lang, java.util and their uses, java.io, basics of networking using Java,Javap,javadoc command And interface, Inner class. String handling and various string functions, String Buffer, object class method toString (), hasCode (), equals (), Exception handling, multithreaded programming thread priorities, synchronization, messaging, creating and controlling of threads. New(),run(),Wait() ,join() method of thread class, Runnable thread and method ,i/o stream, garbage collection, externalization Java utilities like Applets, Java applets and their use – Event Handling – AWT and working with Windows – Event Handling – Event Handling Mechanisms, Delegation Event Model, Event Class, Event Listener Interfaces, Adapter Classes, Inner Class. AWT and working with windows – AWT.Classes, Window fundamentals, frame windows, frame window in An Applet, Working with Graphics, color, fonts and text. , JAR files JDBC – JDBC API, JDBC Drivers, Products, JDBC Design considerations, Two Tier and Three Tier client server model, Basic steps to JDBC, setting up a connection to database, Creating and executing SQL statements, Result set and Result set Metadata Object. Total Reference Books: 1. The Complete Reference: Patrick Naughton and Herbert Schildt 2. Khalid Maugham LPE Publisher 3. Head First Java : Keith Sherrie CA 503 DISCRETE MATHEMATICS STRUCTURE C(L,T,P) = 4(3,1,0) Course Contents Fundamentals: Sets & Relations- Sets, Types of Sets, Multi Sets, Operations on Sets, Relations and Properties of Relations, Representation of Relations, Equivalence Relation, Closures of Relations, recurrence relation Formal logic-statement, tautologies, quantifier, predicator and validity, normal form, propositional logic predicate logic, Proposition Methods of Proof-Direct Proofs, Indirect Proofs, Mathematical Induction, Method of Contradiction., 2 Permutations and Combinations, Lattices, Pigeon Hole Principle Groups: definition of semi group, sub semi group, cyclic semi group, homomorphism and isomorphisem, monoid, Group, abelian group, properties of group, subgroup, group homomorphism, kernel of homomorphisem, permutation group, dihedral 3 group, cyclic group, cosets, normal subgroup Graphs and Tree: Basic Introduction of Graphs, treminilogy, types of graph-simple 4 graph,multigraph,pseudograph,,subgraph,isomorphisem,path,circuits,cycles,connected graph, cutest, euler path ,circuit, euler graph, Hamilton graph. weighted graph and shortest path algo, planner graph, graph colorning, polya’s theory of enumeration Finite State Machines and Languages: Grammar and Languages- Phrase structure Grammar, Types of Grammars and 5 Languages, Finite State Machines and Languages, Minimization of Finite State Machines. Total Reference Books:1. Liptschutz, Seymour, “Discrete Mathematics”, McGraw Hill. 2. Trembley, J.P & R. Manohar, “Discrete Mathematical Structure with Application to Computer Science”, McGraw Hill. 3. Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill. 4. Deo, Narsingh, “Graph Theory With application to Engineering and Computer.Science.”,PHI. 5. Krishnamurthy, V., “Combinatorics Theory & Application”, East-West Press Pvt. Ltd., NewDelhi. Units 1 Units 1 2 3 CA 504 DATA STRUCTURE AND ALGORITHM C(L,T,P) = 4(3,1,0) Course Contents Introduction of data structure, definition, importance of data structure ,types, operation ,application of data structure ,algorithm, performance and analysis of algorithm, complexity of algorithm, asymptotic notations, Array-one-D array ,initialization, traversal,, insertion, deletion, searching(linear binary)address calculation,2-D array ,initialization ,implementation of 2-D array(Row, Column major),address calculation ,sparse matrix Linked list-dynamic memory allocation(function),advantage of link list over array, definition ,types, single linklist, insertion ,deletion, searching of node, doubly link list, advantage, insertion, deletion of node, circular link list, insertion, deletion, circular doubly linklist, insertion, deletion, polynomial using link list Stack & Queue: definition, array representation of stack, linklist representation of stack, stack application, arithmetic expression conversion, evolution of prefix and postfix, infix expression, recursion(tower of Hanoi),Queue, concept, simple queue, insertion, deletion in simple queue, circular queue, priority queue,Dequeue Hrs. 6 7 9 7 8 37 Hrs. 6 7 7 7 8 35 Hrs. 7 7 7 Tree: definition, tree treminilogy, binary tree, strictly binary tree, complete binary tree, binary tree traversal(preorder, inorder, postorder), expression tree, binary search tree, creation, insertion ,deletion, AVL tree, insertion, deletion,, multiday search tree-tree 8 4 Graph, Sorting and searching, their complexity,: graph definition, terminology ,computer representation of graph ,graph 8 5 traversal(Breadth first traversal, Depth first traversal),,minimum spanning tree(pram’s algo kruscal’s algo),shortest path alga(dijkastra algo),types of sorting,buble sort, selection sort, insertion sort ,radix sort, quick sort, merge sort. Heap sort, hashing Total Reference books: 1) Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and John E. Hopcroft 2) Sams Teach Yourself Data Structures and Algorithms in 24 Hours by Robert Lafore 37 Units 1 2 3 4 5 Units 1 2 3 4 5 Units 1 2 3 4 5 CA 505 COMPUTER ARCHITECTURE Course Contents C(L,T,P) = 3(3,0,0) Gates, Boolean Functions and Expressions, Designing Gate Networks, von Neumann machine , Data representation :- Number System, Decimal representation, Computational Data representation, Fixed point representation, Error Hamming error correction code , Interrupts , K-Map, Half Adder, Full Adder, Half Subtracter , Full Subtracter, Comparator, Multiplexer ,De-Multiplexer, Encoder, Decoder , Flip-Flops(D,JK,RS,T) , Shift Registers, Counters, Bus Interconnection (Daisy Chaining, Polling, Independent Requesting) Register Transfer Language , Register Transfer ,Bus and Memory Transfers, Arithmetic Micro operations , 4 bit Adder Subtracter , Logic Micro operation, Selective-set, selective complement, selective clear, Mask, Insert, Clear Basic Computer Organization and Design: Instruction Codes , Computer Registers, Computer Instructions, Timing and Control, Instruction Cycle, Memory-Reference Instructions, Input-Output and Interrupt Machine Language, Assembly Language, Assembler Directives, Pseudo Instructions, Macroinstructions, Single , General, Stack organization and Polish notation , Addressing Modes Multiplication Algorithms, Binary Multiplier, Booth Algorithms, Hardwired and Micro programmed control unit, Processor and Co-Processor. Memory System Design: Main Memory Concepts, Cache Memory Organization, Associative ,Direct, Set Associative Mapping, Mass Memory Concepts, Virtual Memory and Paging , Input/ Output Organization : Input /Output Module , Input /Output Techniques: Programmed I/O, Interrupt Drive I/O , DMA and IOP Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, Vector Processing, Memory Interleaving And Array Processors, Shared-Memory, Multiprocessing, Distributed Multi Computing. Total Reference Books: 1. J.P. Hayes-Computer Architecture & Organization, Mc-Graw Hill. 2. Heuring-Computer System Design and Architecture, Pearson Education. 3. M.Morrismanno-Computer System Architecture Prentice Hall of India. 4. Bartee-Computer Architecture, Tata Mc-Graw Hill. CA 506 DATABASE MANAGEMENT SYSTEM Course Contents Hrs. 7 7 7 7 7 35 C(L,T,P) = 3(3,0,0) Overview of DBMS, Basic DBMS terminology, data base system v/s file system, data independence. Architecture of a DBMS. Introduction to data models: entity relationship model, hierarchical model: from network to hierarchical, relational model, comparison of network, hierarchical and relational models. Data modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER diagrams to tables, extended ER model, relationships of higher degree. Relational model: storage organizations for relations, relational algebra, relational calculus. Normalization: Functional dependencies, normal forms, first, second, third normal forms, BCNF, inclusion dependencies, loss less join decompositions, normalization using FD, MVD, and JDs, alternative approaches to database design. Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL data types and literals, Types of SQL commands, SQL operators and their procedure, Transaction Manager, Recovery, Concurrency control Total Reference Books: 1. Database Management Systems by Raghu Ramakrishnan 2. Fundamentals of Database Management Systems by Mark L. Gillenson 3. Database System Concepts by Abraham Silberschatz, Henry F. Korth, and S. Sudarshan 4. Database Systems: Design, Implementation, and Management by Peter Rob and Carlos Coronel 5. Database Systems: The Complete Book (2nd Edition) by Hector Garcia-Molina, Jeffrey D. Ullman, and Jennifer Widom CA 507 C AND C++ LANGUAGE C(L,T,P) = 4(3,1,0) Course Contents Problem Solving with Computers: Algorithms, and Flowcharts. Data types, constants, variables, operators, data input and output, assignment statements, conditional statements, string and character handling, data validation examples. Iteration, arrays, strings processing, String method Defining function, types of functions, function prototype, passing parameters, recursion. Storage class specifies, pre-processor, header files and standard functions. Pointers: Definition and uses of pointers, pointer arithmetic, pointers and array, pointers and functions, pointer to pointer. Structures, union, pointers to structures, user-defined data types, enumeration. Data file mode , Opening, closing, creating, processing and unformatted data files. Hrs. 6 8 7 8 6 35 Hrs. 9 10 Evolution of OOPS, OOPS Paradigm, advantages of OOPS, Comparison between functional programming and OOP Approach, characteristics of object oriented language – objects, classes, inheritance, reusability, user defined data types, polymorphism, overloading Classes, member functions, objects, arrays of class objects, pointers and classes, nested classes, constructors, destructors, inline member functions, static class member, friend functions, dynamic memory allocation. Inheritance, single inheritance, types of base classes, types of derivations, multiple inheritance, container classes, member access control Function overloading, operator overloading, 8 polymorphism, early binding, polymorphism with pointers, virtual functions, virtual Destructor, late binding, pure virtual functions, opening and closing of files, stream state member functions, binary file operations, structures and file operations, classes and file operations, random access file processing, Exception Handling, Generic Programming function templates, class Templates 10 Total 45 Reference Books: 1. A.R.Venugopal Rajkumar , T.Ravishanker”Mastering c++”,TMH 1997. 2. R.Lafore, ”Object Oriented Programming using C++” BPB publication,2004. 3. “Object Oriented Programming with C++ and C” BY B.E Balagurusamy. 4. A.R.Venugopal Rajkumar ,T.Ravishanker”Mastering c”,TMH 1997. 8 CA 508 Units 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 Hrs. 7 7 8 backward formula, Central Difference Formulae: Gauss forward and backward formula, Sterling’s, Bessel’s, Everett’s formula. Interpolation with unequal intervals: Lang range’s Interpolation, Newton Divided difference formula, Hermit’s Interpolation, Approximation of function by Taylor’s series and Chebyshev polynomial. Numerical Differentiation and Integration: Introduction, Numerical Differentiation, Numerical Integration, Trapezoidal rule, Simpson’s rules, Weddle’s Rule EulerMaclaurin Formula. Solution of differential equations: Picard’s Method, Euler’s Method, Taylor’s Method, Runge- Kutta methods, Predictorcorrector method, Automatic error monitoring, stability of solution. Curve fitting and Approximation: Method of least squares, fitting of straight lines, polynomials, exponential curves etc. (Emphasis must be given to algorithmic approach) Total Reference Books: 1. Numerical Mathematics and Computing by Ward Cheney and David 2. Computer Oriented Numerical Methods by Dutta SYSTEM ANALYSIS AND DESIGN DATA COMMUNICATION AND NETWORKING 6 7 35 C(L,T,P) = 3(3,0,0) Course Contents System Concepts and Information Systems Environment: The System Concept: Definition, Characteristics of Systems, Elements of a System, Open and Closed System, Formal and Informal Information Systems, Computer based Information Systems, Management Information System, Decision Support System, System Development Life Cycle: Recognition of needs, need for System Change, Feasibility Study, Analysis, Design, Implementation, Post implementation and Maintenance Role of the Systems Analyst, Systems Planning and Initial Investigation: Strategies for Determining Information Requirement, Problem Definition & Project initiation, Background Analysis, Fact Analysis, Review of Written Documents, Onsite Observations, Interviews and Questionnaires, Fact Analysis, Performance Analysis, Efficiency Analysis, Service Analysis. Information Gathering: need, , Information gathering tools, Interviewing, Arranging the Interview, Guides to a Successful Interview, Types of Interviews and Questionnaires, . Tools of Structured Analysis: The Dataflow Diagram (DFD), Data Dictionary, Decision Trees and Structured English. Feasibility Study: System performance, Economic Feasibility, Technical Feasibility, Behavioral Feasibility, Steps in Feasibility Analysis. Input/Output and Forms Design: Input Design, CRT Screen Design, Output Design, and Requirements of form Design. H/W / S/W Selection, Make V/s Buy decision and Maintenance, Documentation: Importance, Types of documentation, Security and disaster planning and management. Total Reference Books: 1. System Analysis Design and Development by Charles S Wasson CA 511 Units C(L,T,P) = 4(3,1,0) Course Contents Floating point Arithmetic: Representation of floating point numbers, Operations, Normalization, Pitfalls of floating point representation, Errors in numerical computation Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial using Bisection Method, Iteration Method, Regula-Falsi method, Newton Rap son method, Secant method, Rate of convergence of iterative methods. Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss Elimination direct method and pivoting, Ill Conditioned system of equations, Refinement of solution. Gauss Seidal iterative method, Rate of Convergence. Interpolation and approximation: Finite Differences, Difference tables, Polynomial Interpolation: Newton’s forward and CA 510 Units COMPUTER ORIENTED NUMERICAL METHODS Hrs. 7 8 6 7 8 36 C(L,T,P) = 3(3,0,0) Course Contents Network, Network Protocols, Edge, Access Networks and Physical Media, Protocol. Layers and their services models, Internet Backbones, NAP’s and ISPs. Application Layer: Protocol and Service Provided by application layer, transport Protocols. The world wide web. HTTP, Message formats, User Server Interaction And Web caches. FTP commands and replies. Electronic Mail, SMTP, Mail Message Formats and MIME and Mail Access Protocols DNS The internet’s directory service DNS records and Message. Transport Layer: Transport Layer Service and Principles, Multiplexing and Demultiplexing applications, connectionless Transport. UDP Segment structure and UDP Checksum. Principles of Reliable Data Transfer-Go back to N and Selective Repeat. Connection Oriented Transport TCP Connection and Segment Structure, Sequence Numbers and acknowledgement numbers, Telnet, Round trip time and Timeout. TCP connection management. Network Layer and Routing: Network service model, Routing principles. Link State routing Algorithm, A distant Vector routing & OSPF algorithm. Router Components; Input Prot, Switching fabric and output port. IPV6 Packet format. Point To Point Protocol (PPP), transition States, PPP Layers-Physical Layer and Data Link Layer, Link Control Protocols. LCP Packets and options. Authentication PAP and CHAP, Network Control Protocol (NCP). Sonet/SDH :Synchronous Transport Signals. Physical configuration-SONET Devices, Sections, Lines and Paths. SONET Layers-Photonic Layer, section layer, Line layer, path layer and device layer relationship. Sonnet Frame format. Section Overhead, Line overhead and path overhead. Virtual Tributaries and types of VTs. Total Reference Books: 1. Data Communications and Networking (McGraw-Hill Forouzan Networking) by Behrouz A. Forouzan 2. Introduction to Data Communications and Networking by Wayne Tomasi 3. Networking and Data Communications by V. C. Marney-Petix Hrs. 7 7 8 8 7 37 Units 1 2 3 4 5 Units 1 2 3 4 5 1. 2. 3. 4. 5. 6. 7. 8. Units 1 2 3 4 5 1. 2. 3. 4. 5. 6. 7. CA 512 WEB TECHNOLOGIES AND DEVELOPMENT C(L,T,P) = 3(3,0,0) Course Contents The internet: history of the world wide web, hardware and software trend, object technology – java script object, scripting for the web-browser portability. Introduction of HTML: introduction, markup language, editing HTML : common tags, headers, text styles, linking, images, formatting text, horizontal rules and more line breaks, unordered lists, nested and ordered lists, basic HTML tables : intermediate HT ML tables and formatting : basic HTML forms, more complex HTML forms, internal linking, creating and using image maps. Java script – introduction to scripting: introduction- memory concepts- arithmetic- decision making. Java script control structures, Java script functions: introduction – program modules in java script - function definitions, duration of identifiers, scope rules, recursion, java script global functions. Java script arrays: introduction, array-declaring and allocating arrays, references and reference parameters – passing arrays to functions, multiple subscripted arrays. Java script objects: introduction, math, string, data, Boolean and number objects. Dynamic HTML : CSS : introduction – inline styles, creating style sheets with the style element, conflicting styles, linking external style sheets, positioning elements, backgrounds, element dimensions, text flow and the box model, user style sheets. Dynamic HTML: object model and collections: introduction, object referencing, collections all and children, dynamic style, dynamic positioning, using the frames collection, navigator object. Dynamic HTML: event model : introduction, event ON CLICK, event ON LOAD – error handling with ON ERROR, tracking the mouse with event, more DHTML events. Filters and Transitions: Dynamical HTML: Client side scripting with VB script: Introduction - operators- data types and control structures – VB script functions – arrays –string manipulation classes and objects. Total Reference Books: 1. Pro XML Development with Java Technology: From ... - by Ajay Vohra, Deepak Vohra 2. Information Technology and Economic Development - by Yutaka Kurihara, Sadayoshi Takaya, Hisashi 3. Learning Query: Better Interaction Design and Web Development with Simple JavaScript Techniques CA 513 ADVANCES IN ARTIFICIAL INTELLIGENCE Contents of the course Hrs. 6 7 8 7 7 35 C(L,T,P) = 3 (3,0,0) Introduction: AI problems, foundation of AI and history of AI intelligent agents: Agents and Environments, the concept of rationality, the nature of environments, structure of agents, problem solving agents, problem formulation. Knowledge Representation & Reasons logical Agents, Knowledge – Based Agents, logic, propositional logic, Resolution patterns in propositional logic, Resolution, Forward & Backward. Chaining. Propositional Vs. first order inference, unification & lifts forward chaining, Backward chaining, Resolution. Advances in Artificial Intelligence: Cybernetics, Brain Simulation, Cognitive Systems Social Intelligence, Introduction to AI based programming Tools, Robotics. Reference Books: Artificial Intelligence – A Modern Approach. Second Edition, Stuart Russel, Peter Norvig, PHI/ Pearson Education. Artificial Neural Networks B. Yagna Narayana, PHI Artificial Intelligence , 2nd Edition, E.Rich and K.Knight (TMH). Artificial Intelligence and Expert Systems – Patterson PHI. Expert Systems: Principles and Programming- Fourth Edn, Giarrantana/ Riley, Thomson. PROLOG Programming for Artificial Intelligence. Ivan Bratka- Third Edition – Pearson Education. Neural Networks Simon Haykin PHI Artificial Intelligence, 3rd Edition, Patrick Henry Winston., Pearson Edition. CA 514 DOCUMENT ANALYSIS AND RECOGNITION C(L,T,P) = 3 (3,0,0) Contents Introduction to documents and processing: Introduction; to documents and models of document processing, top-down, bottom up approaches, document understanding approaches, image extraction and foreground background separation, layout analysis, text and graphics separation, form document processing. Classification Principles: Patterns and feature vectors, Bayesian classification, clustering, neural classifiers, other classifiers, including string and edit distances. Optical Character Recognition: Categories of text, printed and handwriting, printed fixed and variable font methods, numeral recognition of hand-written cursive scripts, holistic and analytic methods. Graphics Recognition Methods: Region segmentation, vectorization, feature extraction, graphics recognition and interpretation. Tools and Techniques: Statistical PR Lib, OCR Software Image Processing Library Applications: Various applications and Scripts, multi lingual form analysis, Forensic document examination: examining signatures, handwriting, obliterations erasures and overwriting etc., Reference Books: Duda and Hart: " Pattern Classification and Scene Analysis", J.Wiley and Sons. Earl Gose et al: "Pattern Recognition and Image Analysis", Prentice Hall of India, New Delhi, 1998. Baird, Bunke and Yamamoto. (Eds): "Structured Document Image Analysis", Chapters on understanding of printed documents and graphics recognition. Springer Verlag 1992. L. O'Gorman and R.Kasturi: "Document Image Analysis: An Executive Briefing", IEEE Computer Society Press 1998. H. Bunke and P. S. P. Wang (Eds.): "Handbook of Character Recognition and Document Image Analysis" World Scientific Press, Singapore 1997. E. G. Mallach, “Decision Support and Data Warehouse Systems", Tata McGraw Hill. Michael Berry and Gordon Linoff “Mastering Data Mining- Art & science of CRM”, Wiley Student Edition Hrs 7 6 7 8 7 Hrs 7 7 7 7 7 CA 515 Units PROBLEM SOLVING METHODS C(L,T,P) = 3 (3,0,0) Contents Hrs 1 2 3 4 General introduction of AI, Intelligent systems etc, AI Applications Search techniques, single-agent path-finding problem, two player game, interleaving search Constraint satisfaction problems Logic, modus ponens, Satisfiability, Resolution, Refutation, Unification 7 6 7 8 5 AI Planning, Distributed AI 7 Reference Books: 1. N.J.Nilsson: Principles of Artificial Intelligence, Narosa Publications. 2. D. W. Patterson: Introduction to AI & Expert System, PHI. 3. S. Russell and P. Norvig. AI: A Modern Approach, 2nd Edn., McGraw-Hill, 2003. CA 516 Units 1 2 3 4 5 1. 2. 3. KNOWLEDGE PEPRESENTATION & REASONING C(L,T,P) = 3(3,0,0) Contents Survey of Representation techniques: representation schemes: Logic: Procedural representations: Semantic networks: Conceptual structures Production systems: Analogical representation: Semantics primitives: Frames and Scripts: conceptual Dependency: Applications of Knowledge Representation Languages, Syntax and well-formed formulas (wffs), Semantics, Properties of Wffs. Formal deduction Inference Rules, Logical Axioms, Formal Proofs, Theories and Theorem Proving Lowentheim-skolem Theorems Classical first order logics-Propositional logic, Predicate Calculus. Non-classical Logics and their application to knowledge representation and processing. Brief Introduction - Many sorted Logics, Non-monatomic Logics, Multi-valued Logics, Fuzzy Logic, Model Logic, Temporal Logic, Intentional Logic. Hrs 7 8 7 6 6 Reference Books: Knowledge Representation and Reasoning by Ronald Brachman and Hector Levesque, Morgan Kaufmann Publishers Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning by Michael Gelfond, 1st Edition, 2011, XIII, 513 p.p, Springer. Knowledge Representation, Reasoning and Declarative Problem Solving by Alex M. Andrew, Kybernetes, Vol. 33 Issue:1,Emerald Group Publishing Limited CA 517 APPLICATION DESIGNING USING LISP C(L,T,P) = 3 (3,0,0) Units Contents of the course Hrs 1 7 3 Introduction and scope of LISP, Flow of control: function calls, recursion, iteration, conditionals, LISP map functions. Data structures: lists, generalized sequences, association lists, properties, sets, trees, stacks, hash tables, characters, strings. Variables: local and global scope, control of parameters, optional parameters, lambda variables. 4 Lambda forms, Macros, LISP internal representation. 8 5 Problem decomposition, data abstraction, debugging, program development. 7 2 Reference Books: 1. Common Lisp: The Language by Guy Steele, Digital Press 2. Common Lisp: A Gentle Introduction to Symbolic Computation by David S. Touretzky, Symbolic Technology Ltd. 3. On Lisp: Advanced Techniques for Common Lisp by Paul Graham 6 7 CA 518 Units 1 2 3 4 5 LOGIC PROGRAMMING USING PROLOG C(L,T,P) = 3 (3,0,0) Contents of the course Prepositional logic: syntax and semantics: Validity and consequence. Normal forms. Representing world knowledge using prepositional logic. First order logic: World knowledge representation and the need for quantifiers. Syntax, semantics validity consequence clause normal from Introduction to prolog: Syntax of prolog, Structured data representation. Execution model Introduction to Programming in Prolog, Illustrative examples The connection between logic and logic programming interpreting logic programs in terms of Horn clauses Deduction from clause form formulas resolution for prepositional logic Ground resolution. Unification and first order resolution SLD resolution; the computation and search rules. SLD trees and interpretation of nondeclarative features of Prolog. Advanced prolog features: programming techniques: Structural Induction and Recursion, Extra Logical features: Cut and Negation Case studies. Hrs 7 8 6 7 7 Reference Books: 1. Stoll, set Theory and logic, Dover publishers, New York, 1963. 2. Clocksin, W.F. and Mellish, C.S., Programming in Prolog 2nd edition, Springer -Verlag, 1984 3. Gries, The Science of Programming, Narosa Publishers, 1985 4. O’ Keefe, R., The Craft of Prolog. The MIT Press, 1991. 5. Lloyd, J. W., Foundation of Logic Programming, Springer, 1984. CA 519 Units 1 2 3 4 5 IMAGE PROCESSING & PATTERN RECOGNITION C(L,T,P) = 3 (3,0,0) Contents INTRODUCTION: Imaging in ultraviolet and visible band. Fundamental steps in image processing. Components in image processing. Image perception in eye, light and electromagnetic spectrum, Image sensing and acquisition using sensor array. DIGITAL IMAGE FUNDAMENTALS: Image sampling and quantization, Representing digital images, Basic Relationship Between Pixels, Zooming and Shrinking digital images, INTENSITY TRANSFORMATION: Basic Intensity transformation functions, Histogram processing, Fundamental of Spatial Filtering. Sharpening Spatial filters. IMAGE RESTORATION: Image restoration model, Noise Models, Spatial and frequency properties of noise, noise probability density functions, Restoration in presence of noise - only spatial filter, Mean filter, order Statistic filter and Adaptive filter, Frequency domain filters - Band reject filter, Band pass filter and Notch filter. IMAGE COMPRESSION: Compression Fundamentals - Coding Redundancy, Interpixel redundancy, Psycho visual redundancy and Fidelity criteria. Image Compression models, Source encoder and decoder, Channel encoder and decoder, Lossy compression and compression standards. IMAGE SEGMENTATION: Fundamentals, point , edge and line detection., Thresholding, Region based segmentation., Region based segmentation, Region Growing & Splitting & merging. EXPERT SYSTEM AND PATTERN RECOGNITION: Use of computers in problem solving, information representation, searching, theorem proving, and pattern matching with substitution. Methods for knowledge representation, searching, spatial, temporal and common sense reasoning, and logic and probabilistic inference. Applications in expert systems and robotics. Reference Books: 1. Duda R O and P E Hart, Patten classification and scene analysis, John Wiley & Sons, NY 1973 2. K.S.Fu, Syntactic pattern recognition and applications, Prentice Hall, NJ, 1982 3. T.Pavlidis, Structural pattern recognition, Springer-Verlag, NY, 1977 4. D.H.Ballad and C.M.Brown, Algorithms for computer vision, Prentice Hall, 1982 5. R.Schalkoff, Pattern Recognition: Statistical, Structural and Neural Approaches, John Wiley & Sons, NY, 1992. 6. Digital Image Processing : Gonzalez & Wood, Addison-Wisley Publisher Comp. 1993. 7. Digital Image Processing : A.K Jain, PHI, Edition 1995. Hrs 7 7 8 6 7 CA 520 Units 1 2 3 4 5 2 3 4 5 C(L,T,P) = 3 (3,0,0) Contents Introduction: Knowledge in speech and language processing – Ambiguity – Models and Algorithms – Language, Thought and Understanding. Regular Expressions and automata: Regular expressions – Finite-State automata. Morphology and Finite-State Transducers: Finite-State Morphological parsing – Combining FST lexicon and rules Word classes and part-of-speech tagging: English word classes – Tagsets for English – Part-of-speech tagging – Rule-based part-of-speech tagging – Stochastic part-of-speech tagging – Transformation-based tagging – Other issues. Context-Free Grammars for English: Constituency – Context-Free rules and trees – Sentence-level constructions – The noun phrase – Coordination – Agreement – The verb phase and sub categorization – Auxiliaries – Spoken language syntax – Grammars equivalence and normal Features and Unification: Feature structures – Unification of feature structures – Features structures in the grammar – Implementing unification – Parsing with unification constraints – Types and Inheritance. Lexicalized and Probabilistic Parsing: Probabilistic context-free grammar – problems with PCFGs – Probabilistic lexicalized CFGs – Dependency Grammars – Human parsing. Representing Meaning: Computational desiderata for representations – Meaning structure of language – First order predicate calculus – Some linguistically relevant concepts – Related representational approaches – Alternative approaches to meaning. Semantic Analysis: Syntax-Driven semantic analysis. Word Sense Disambiguation and Information Retrieval: Selectional restriction-based disambiguation – Robust word sense disambiguation – Information retrieval – other information retrieval tasks. Natural Language Generation: Introduction to language generation – Architecture for generation – Surface realization – Discourse planning – Other issues. Machine Translation: Language similarities and differences – The transfer metaphor – The interlingua idea: Using meaning – Direct translation – Using statistical techniques – Usability and system development. Reference Books: 1. James Allen: Natural Language Understanding, The Benjamin/Cummings Publishing Co, Inc. 2. Eugene Cherniak: Statistical Language Learning, MIT Press, 1993. 3. Michael P. Oakes: Statistics for Corpus Linguistics, Edinburgh University Press, 1998. 4. Daniel Jurafsky & James H.Martin, “ Speech and Language Processing”, Pearson Education (Singapore) Pte. Ltd., 2002. 5. James Allen, “Natural Language Understanding”, Pearson Education, 2003. CA 521 Units 1 NATURAL LANGUAGE PROCESSING GENETIC ALGORITHMS AND APPLICATIONS 10 11 10 8 C(L,T,P) = 3 (3,0,0) Contents INTRODUCTION TO EVOLUTIONARY COMPUTATION : Biological and artificial evolution – Evolutionary computation and AI – Different historical branches of EC-GAs- EP- ES- GP - A simple evolutionary algorithm. SEARCH AND SELECTION OPERATORS: Recombination/Crossover for strings- one-point- multi- ointuniform crossover operators - Mutation for strings- bit-flipping – Recombination / Crossover and mutation rates - Recombination for real-valued representations- Fitness proportional selection and fitness scaling – Ranking methods – Tournament selection. EVOLUTIONARY COMBINATORIAL OPTIMIZATION: TSP - Evolutionary algorithms for TSPs – Hybrid evolutionary and local search algorithms. Schema theorems - Convergence of EAs - Computational time complexity of EAs - No free lunch theorem. CONSTRAINT HANDLING: Common techniques- penalty methods- repair methods - Analysis –Some examples. Pareto optimality - Multiobjective evolutionary algorithms. GENETIC PROGRAMMING: Trees as individuals - Major steps of genetic programming-, functional and terminal sets- initialization- crossover-mutation- fitness evaluation - Search operators on trees – Examples. Reference Books: 1. Goldberg and David E, "Genetic Algorithms in Search. Optimization and Machine Learning", Pearson Education, 2. Hrs 6 New Delhi, 2006. Kalyamoy Deb, "Multiobjective Optimization using Evolutionary Algorithms", John Wiley & Sons, First Edition, USA, 2003. Hrs 7 8 6 7 7 CA 522 Units 1 2 3 4 5 2 3 4 5 C(L,T,P) = 3 (3,0,0) Contents Introduction to Computational Intelligence / Soft computing: Soft versus Hard Computing, Various paradigms of computing, Foundations of Biological Neural Networks: Introduction to Neural Networks, Humans and Computers, Organization of the Brain, Biological Neuron, Biological and Artificial Neuron Models, HodgkinHuxley, Neuron Model, Integrate-and-Fire Neuron Model, Spiking Neuron Model, Introduction to Neural Networks, Humans and Computers, Organization of the Brain, Biological Neuron, Biological and Artificial Neuron Models, Hodgkin-Huxley, Neuron Model, Integrate-and-Fire Neuron Model, Spiking Neuron Model, Characteristics of ANN(Learning, Generalization, Memory, Abstraction, Applications), McCulloch-Pitts Model, Historical Developments Essentials of Artificial Neural Networks: Introduction, Artificial Neuron Model, Operations of Artificial Neuron, Types of Neuron Activation Function, ANN Architectures, Classification Taxonomy of ANN –Connectivity (Feed forward, feedback, Single and Multi-layer Neural Dynamics (Activation and Synaptic), Learning Strategy (Supervised, Unsupervised, Reinforcement), Learning Rules (Error Correction, Hebbian, Competitive, Stochastic), Types of Application (Pattern Classification, Pattern Clustering, Pattern Association / Memory, Function Approximation, Prediction, Optimization) Neural Architectures with Supervised Learning: Single Layer Feed Forward Neural Networks (Perceptron), Multilayer Feed forward Neural Networks (Backpropagation learning), Radial BasisFunction Networks, Support Vector Machines, Simulated Annealing, Boltzmann Machine, Feedback (Recurrent) Networks and Dynamical Systems Associative Memories: Matrix memories, Bidirectional Associative Memory Basic concepts, fuzzy set theory, basic operations, fuzzification, defuzzification, neurofuzzy approach, applications Evolutionary and Genetic Algorithms: Basic concepts of evolutionary computing, genetic operators, fitness function and selection, genetic programming, other models of evolution and learning, ant Reference Books: 1. Andonie, R., Cataron, A. Computational Intelligence (in Romanian), Transylvania University Press, Brasov, Romania, 2002. 2. Zurada, J. Introduction to Artificial Neural Systems. West Publishing Company, St. Paul, 1992. 3. Haykin, S. Neural Networks - A Comprehensive Foundation. Macmillan College Publishing Company, New York, 1999 (second edition). 4. M. T. Hagan, H. B. Demuth, M. Beale, Neural Network Design, PWS Publishing Co., Boston, 1996. 5. Rao, V. C++ Neural Networks and Fuzzy Logic, M&T Books, IDG Books Worldwide. CA 523 Units 1 COMPUTATIONAL INTELLIGENCE ROBOTICS Hrs 8 7 7 6 7 C(L,T,P) = 3 (3,0,0) Contents Definition and classification of ROBOTS and manipulators, motion and degrees of freedom, motion categories, uses, field of applications. Robot Arm Kinematics: Direct and Inverse, Robot arm dynamics, Manipulator trajectories, control of robot manipulators. Introduction to sensing and vision in robotics. Trajectory Generation: Introduction, general considerations in path description and generation, joint space schemes, Cartesian space schemes, Path generation in runtime, Planning path using dynamic model. Linear control of manipulators: Introduction, feedback and closed loop control, second order linear systems, control of second-order systems, Trajectory following control, modeling and control of a single joint. Robot Programming languages & systems: Introduction, the three level of robot programming, requirements of a robot programming language, problems peculiar to robot programming languages. Reference Books: 1. John J. Craig, “Introduction to Robotics”, Addison Wesley publication 2. Richard D. Klafter, Thomas A. Chmielewski, Michael Negin, “Robotic Engineering – An integrated approach”, PHI Publication 3. Tsuneo Yoshikawa, “Foundations of Robotics”, PHI Publication 4. B. K. P. Horn, Robot Vision, MIT Press, Cambridge,1986. 5. J. J. Craig, Introduction to Robotics, Addision-Wesley,1989. 6. Y. Koren, Robotics for Engineers, MsGraw Hill,1985. Hrs 7 8 6 7 7 CA 524 Units Unit-I UnitII UnitIII UnitIV UnitV TEXT PROCESSING C(L,T,P) = 3 (3,0,0) Contents String Processing - Efficient techniques for string processing. String searching algorithms - Knuth- Morris-Pratt, Boyer-Moore and Rabin-Karp algorithms. Processing binary strings. Incremental search techniques. Pattern Matching - Regular Expressions, regular grammars, deterministic and nondeterministic finite state machines for pattern matching. Corpus Analysis - Corpus creation. Storage and indexing techniques. Morpheme, word and sentence level statistics. Zipf's law. Corpus indexing techniques. Word and sentence level n-grams. Analysis for Hidden Morkov models. Text tagging. Computational Techniques in Lexicography - From corpus to lexicon. Lexical knowledge bases - Electronic dictionaries and thesauri. Efficient storage and retrieval - B-Trees, TRIE, and Hashing.Dictionary analysis tools. Text layout - Justification, placement of figures, equations, etc. : Paragraph and page formatting. Table of Contents, Index, and Bibliography creation. Footnotes and cross references. Spell Checking, Grammar Checking and Style Checking - Statistical and linguistic approaches to better writing tools. Isolated and context dependent spell and grammar checking tools Introduction to Grammars and Parsers. Active Chart Parsing. Acceptance based, Relaxation based and Expectation based techniques. Multi-Script and Multi-lingual text processing - Scripts and Fonts - Multi- Script processing and GIST technology. Fonts and font libraries. Bilingual and Multi-lingual dictionaries, thesauri and word processors. Cryptology - Techniques for text encryption and decryption. Text Compression for efficient storage and transmission of textual data. Applications to Natural Language processing, Speech Recognition, Optical Character Recognition, Information Retrieval and Office Automation. Hrs 8 8 6 6 7 Reference Books: 1. Gerald Salton, "Automatic Text Processing", Addison-Wesley, 1989. 2. Bran Boguraev, Ted Briscoe (Eds), Computational Lexicography for Natural Language Processing, Longman, 1989. 3. Robert Sedgewick, "Algorithms in C", Addison Wesley, 19904. J.E. Hopcroft and J.D.Ullman, "Automata Theory, Languages and Computation", Narosa, 1992. 5. A V Aho, Ravi Sethi, J D Ullman, "Compilers: Principles, Techniques and Tools", Addison-Wesley, 1986. 6. S.N. Srihari, "Computer Text Recognition and Error Correction", IEEE Computer Soceity Press, 1984. CA 551 S.No. 1 2 3 4 5 6 7 8 9 10 OFFICE AUTOMATION LAB C(L,T,P) = 2(0,0,3) List of Experiments Introduction to MS windows: Control Panel- setting common devices using control panel, modem, printers, audio, network, fonts, creating users, internet settings, Start button & Program lists; Installing and Uninstalling new Hardware & Software program on your computer. Office package: Word-processing, Spreadsheet, Presentation graphics. MS Word Basics: Working with MS Word.; Menus & Commands; Toolbars & Buttons; Shortcut Menus, Wizards & Templates; Creating a New Document. MS-Word lab 2: Spell Check, Thesaurus, Find & Replace; Headers & Footers ; Inserting – Page Numbers, Pictures, Files, Auto texts, Symbols etc. MS- Word lab 3: Working with Columns, Tabs & Indents; Creation & Working with Tables including conversion to and from text; Margins & Space management in Document; Adding References and Graphics. MS-Word lab 4: Mail Merge, Envelops & Mailing Labels. Importing and exporting to and from various formats. MS Excel Lab 1: Working with MS Excel.; concepts of Workbook & Worksheets; Using Wizards; Various Data Types; Using different features with Data, Cell and Texts; Inserting, Removing & Resizing of Columns & Rows; Working with Data & Ranges; Different Views of Worksheets; Column Freezing, Labels, Hiding, Splitting etc. MS Excel Lab 2:Using different features with Data and Text; Use of Formulas, Calculations & Functions; Cell Formatting including Borders & Shading; Working with Different Chart Types; Printing of Workbook & Worksheets with various options. MS PowerPoint: Working with MS PowerPoint; Creating a New Presentation; Working with Presentation; Using Wizards; Slides & its different views; Inserting, Deleting and Copying of Slides; Working with Notes, Handouts, Columns & Lists; Adding Graphics, Sounds and Movies to a Slide; Working with PowerPoint Objects; Designing & Presentation of a Slide Show; Printing Presentations, Notes, Handouts with print options. MS Access: Creation of table with primary key, fire the different queries, creation of reports. Hrs. 4 hrs Weekly CA 552 S.No. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 C(L,T,P) = 2(0,0,3) List of Experiments WAP is the different between a constructor and a method WAP is constructor overloading. WAP for type conversing using method overloading. WAP to concept of method overriding. WAP to see the use of for each loop and retrieve the element one by one from an array and display it. WAP for using the switch statement to execute a particular task depending on color value. WAP to generating Fibonacci series. WAP which accepts the marks of a student into a 1D array from the keyboard and finds total marks and percentage. WAP to take a 2D array and display its element in the form of a matrix. WAP to display the command line arguments. WAP to compare two strings using ‘= =’operator, and see the result. WAP to test the immutability of strings. WAP by taking Myclass as an anonymous inner class whose name is not mentioned in the But class’s add Action Listener() method. WAP to find the areas of Square and Rectangle by deriving them from shape. WAP in which Maruti subclass implements the abstract method of the super class, Car. Compile this code to get Maruti. Class. WAP which depicts how to use the addition class of packages pack. WAP to accept a website name and return its IPAddress, after checking it on internet. WAP showing execution of multiple tasks with a single thread. CA 553 S.No. 1 2 3 JAVA LAB COMMUNICATION & SOFT SKILL LAB DATA STRUCTURE AND ALGORITHM LAB List of Experiments 4 hrs Weekly C(L,T,P) = 2(0,0,3) List of Experiments Practice for communication skill and per market standard Weekly group discussion Presentation skill development CA 554 Hrs. Hrs. 4 hrs Weekly C(L,T,P) = 2(0,0,3) Hrs. Program on array searching, sorting (Bubble sort, Quick sort, Marge sort etc.) Program to insert element at desire position, replacing element, deletion in array. Various matrices operations. Addition, multiplication and transpose of sparse matrices represented in array form. Addition, multiplication and transpose of sparse matrices represented in linked list form. 4 hrs Polynomial addition, multiplication (8th degree polynomials). Weekly Implementation of stack and queue using link lists Implementation of circular queue using link lists. Polynomial addition, multiplication. Two-way link lists programs. Infix to postfix/prefix conversion. BST implementation (addition, deletion, searching). Graph traversal (BFS, DFS). CA 555 S.No. 1 2 3 4 5 6 7 7 8 9 C AND C++ LANGUAGE LAB List of Experiments Simple input output program integer, real character and string. (Formatted & Unformatted) Conditional statement programs (if, if-else-if, switch-case) Looping Program. (for, while, do-while) Program based on array (one, two, and three dimensions) Program based on String Program using structure and unions. Class and object program in c++ with inheritance,overloading,overriding,operator overloading Program using Function (With and without recursion),inline function, friend function, virtual function. Simple programs using pointers. File handling program using c and c++. CA 556 COMPUTER ORIENTED NUMERICAL METHODS LAB S.No. 1 2 3 4 5 6 7 8 9 10 11 12 13 WEB PROGRAMMING AND DESIGNING LAB 4 hrs Weekly Hrs. 4 hrs Weekly C(L,T,P) = 2(0,0,3) List of Experiments Write an echo client and server using socket. Design a clock synchronization protocol. Build a client for the protocol. Build a domain name system client program. Build a DHCP client. Capture and decode Ethernet frames. Decode an IP header. Build a packet analyzer. Extract data from a TCP stream. Observe concurrent TCP connections. CA 558 S.No. 1 2 3 4 5 6 7 8 9 10 11 NETWORKING LAB Hrs. C(L,T,P) = 2(0,0,3) List of Experiments Programming for Bisection method Programming for Secant Method Programming for Eyler’s method Programming for Runga-Kutta method Programming for Divide & difference method Programming for false position method Programming for Newton’s difference method Programming for Trapezoid method Programming for Simpson one third rule Programming for three eight rule Programming for Runga-kutta second order Programming for Eyler’s modified method Programming for Newton’s forward diff.method CA 557 S.No. 1 2 3 4 5 6 7 8 9 10 C(L,T,P) = 2(0,0,3) Hrs. 4 hrs Weekly C(L,T,P) = 2(0,0,3) List of Experiments Use of HTML tags Text formatting, text styles, lists(ordered list and unordered list with nesting control) Tables with Rowspan and colspan Linking documents( hyper linking and image maps) linking to a particular location(within page, another page) Frames: use of frames set, targeting frames Preparation of the static website with the help of HTML tag CSS:In line,internal,external Use of the Java Script Use of the forms in HTML(buttons,text,drop down menu etc) Adding graphics to HTML documents Use of filters Hrs. 4 hrs Weekly CA 559 LISP LAB C(L,T,P) = 2 (0,0,3) Units 1. 2. 3. 4. 5. 1. 2. 3. 4. 5. 6. 7. Contents Flow of control: function calls, recursion, iteration, conditionals, LISP map functions. Data structures: lists, generalized sequences, association lists, properties, sets, trees, stacks, hash tables, characters, strings. Variables: local and global scope, control of parameters, optional parameters, lambda variables Lambda forms, LISP internal representation, Macros Problem decomposition, data abstraction, debugging, program development. Sample Exercises: Write a LISP Program to solve the water-jug problem using heuristic function. Create a compound object using Turbo Prolog. Write a Prolog Program to show the advantage and disadvantage of green and red cuts. Write a prolog program to use of BEST-FIRST SEARCH applied to the eight puzzle problem. Implementation of the problem solving strategies: Forward Chaining, Backward Chaining, Problem Reduction. Write a Lisp Program to implement the STEEPEST-ASCENT HILL CLIMBING. Write a Prolog Program to implement COUNTE PROPAGATION NETWORK. CA 560 Units 1. 2. 3. 4. 5. PROLOG LAB Hrs 6 9 6 4 4 C (L,T,P) = 2(0,0,3) Contents Syntax and Unification: Prolog's slim syntax will be described. Unification will be described with examples to show how pattern matching is achieved. Lists, terms and arithmetic: The Prolog syntax is used to create lists and terms, and to perform simple arithmetic. Graphs: Classic graph algorithms are presented in the declarative Prolog style. Trees: Classic tree algorithms are presented in the declarative Prolog style. Difference structures: Difference lists are described and students participate in a re-write of programs from classical lists to difference lists. Reference Books: Hrs 6 9 6 4 4 PROLOG programming for artificial intelligence by Bratko, Addison-Wesley (3rd ed). CA 601 Units 1 2 3 4 5 ADVANCED DATABASE SYSTEM C(L,T,P) = 3(3,0,0) Course Contents Distributed database: Homogeneous and heterogeneous database, distributed data storage, distributed Transaction, commit protocols, concurrency control in distributed databases, Availability, heterogeneous Transaction management: Introduction of transaction management, serializability and recoverability, view Serializability, resolving deadlocks, distributed databases, distributed commit, Distributed locking Concurrency control Serializability, enforcing serializability by locks, locking systems with several Lock modes, architecture for a locking scheduler managing hierarchies of Database elements, concurrency control by timestamps, concurrency control by Validation Pl/sql basic block, architecture, variables, constants, attributes, pl/sql sentence structure, data types, precompiled, conditional and sequential, control statement, cursor, exception, triggers, procedures, and packages. Object-oriented databases: overview of object-oriented concepts, object identity, object structure, and type constructors, encapsulation of operations, methods, and persistence, type hierarchies and inheritance, type extents and queries, complex objects; database schema design for oodbms; oql, persistent programming languages; oodbms architecture and storage issues; transactions and concurrency control, example of odbms Object relational and extended relational databases: database design for an ORDBMS – nested relations and collections; storage and access methods, query processing and optimization; an overview of sql3, implementation issues for extended type; systems comparison of RDBMS, OODBMS, and ORDBMS. Total Reference Books: 1. Database Management Systems by Raghu Ramakrishnan 2. Fundamentals of Database Management Systems by Mark L. Gillenson 3. Database System Concepts by Abraham Silberschatz, Henry F. Korth, and S. Sudarshan 4. Database Systems: Design, Implementation, and Management by Peter Rob and Carlos Coronel 5. Database Systems: A Practical Approach to Design, Implementation and Management (5th Edition) by Thomas M. Connolly and Carolyn E. Begg Hrs. 7 8 7 8 6 36 CA 602 Units 1 2 3 4 5 C(L,T,P) = 3(3,0,0) Course Contents Introduction to Software Engineering: Introduction, Program Vs Software, Software Characteristics, Components, Applications, Software Crisis, Software Process, Four Ps., Component Software Process, Software Quality Attributes, Software Engineer, Key Challenges faced by the Software Engineering. Requirement Engineering: Functional, Non-Functional and Domain requirements, Requirement Engineering Process, Software Requirement Specification (SRS) and Software Requirement Analysis (SRA), Project estimation & decomposition techniques Object- Oriented Programming, Component based development, Problem based & process based estimation, Empirical (Expert judgment, Delphi Cost Estimation), Heuristic (COCOMO) and Analytical (Halstead’s Software Science, McCabe’s Cyclomatic Complexity Metric, Function Point Analysis) estimation techniques, Software sizing. Structured Analysis: Elements of Analysis Model, Data modeling, Functional Modeling, Behavioral Modeling, tools of structured analysis, Objected Oriented Analysis. Design, Implementation & Quality Assurance: Design model, characteristics of a good design, design principles, guidelines, design fundamentals, design process, design methods, design documentation, fundamentals of software programming, Types of Quality Assurance Activities, Testing fundamentals, strategic issues, test plan, testing principles, general testing strategies, testing process, Maintenance process, types of maintenance, maintenance cost, measuring effectiveness, controlling maintenance requests, software re-engineering process. Total Reference Books: 1. Roger, S. Pressman, “Software Engineering-A Practitioner’s Approach”, Third Edition, McGraw Hill 2. R.E. Fairley, “Software Engineering Concepts”, McGraw Hill 3. Jalote “An Integrated Approach to Software Engineering”, Narosa Publishing House. CA 603 Units 1 SOFTWARE ENGINEERING SYSTEM PROGRAMMING Hrs. 7 7 7 7 7 35 C(L,T,P) = 3(3,0,0) Course Contents Overview: Comparison of machine language, assembly language and high level languages, External and internal representation of instructions and data. Data allocation structures, search structures and addressing modes. Activities and Hrs. 6 system software for program generation, translation and execution. Editors for source code and object code/executable code files. 2 3 4 5 Assemblers: Assembly language specification. Machine dependent and independent features of assembler. Classification of assemblers. Pass structure of assemblers (problem and associated for IBM-PC. Loader and Linkers: Functions and classification. Machine dependent and independent features of loaders, Design of bootstrap, absolute and relocatable loaders, Design of linker. Case study of MS-DOS linker. Macro processors: Macro definition, call and expansion. Macro processor algorithm and data structure. Machine independent features (parameters, unique labels, conditional expansion, nesting and recursion).Pass structure and design of microprocessor and macro assembler, Case study of MASM macro processor. High level language processor: HLL specification: Grammars and parse trees, expression and precedence. Lexical analysis: Classification of tokens, scanning methods, character recognition, lexical ambiguity. Syntactic analysis: Operator precedence parsing, recursive descent parsing. Symbol Table Management: Data structure for symbol table, basing functions for symbols, overflow technique, block structure in symbol table. Total Reference: 1. Introduction to system software by D.M.Dhamdhere, TMH 2. System programming and operating system by D.M.Dhamdhere, PHI CA 604 ASP.NET FRAMEWORK Units 1 2 3 4 5 7 8 7 7 35 C(L,T,P) = 4(3,1,0) Course Contents Introduction to .NET Framework : Genesis of .Net – Features of .Net - .Net binaries – Microsoft Intermediate Language – Meta Data - .Net types and .net name spaces – Common Language Runtime – Common Type System – Common Language Specification - .Net. Applications using command line compiler and visual studio .net IDE. Basics of ASP. NET : Introducing ASP .NET – Creating and deploying ASP .NET applications – Web forms – Web controls – working with events – Rich web controls – Custom web controls – Validation controls – Debugging ASP .NET pages. Advanced ASP .NET : ASP .NET configuration – Business objects – HTTP Handlers – Caching in ASP .NET – ASP .NET security – Localizing ASP .NET applications – Deployment projects. Building Web Services : Introduction to web services – Web services Infrastructure – SOAP – Building a web service – Deploying and publishing web services – Finding web services – Consuming web services. Ado .NET: Basics of ADO .NET – Changes from ADO – Data T able – Data Views – Data Set – Data Relation Type – ADO .NET Managed Providers – OLEDB and SQL Managed Providers – Oledb Data Adapter type. Total Reference: 1. Advanced ASP.NET AJAX Server Controls for .net Framework by Calderon Understanding .Net by Chappell 2. Framework Design Guidelines: Conventions, Idioms, and Patterns for Reuable .NET Libraries, 3. Bible Asp.Net Hrs. 7 7 7 7 7 35 CA 605 COMPUTER GRAPHICS Units 1 2 3 4 5 C(L,T,P) = 3(3,0,0) Course Contents Introduction: What is Computer Graphics, Elements of a Graphics, Workstation, Graphics hardware, I/O devices, Introduction to Raster scan displays, Storage tube displays, refreshing, flicking, interlacing, color monitors, display processors resolution Point Clipping. Line Clipping Algorithms, Polygon Clipping algorithms, Introduction to Hidden Surface elimination, Basic illumination model, diffuse reflection, specular reflection, phong shading, Gourand shading ray tracing, color models like RGB, YIQ, CMY, HSV etc. Scan conversion techniques, image representation, line drawing, simple DDA, Bresenham’s Algorithm, Circle drawing, general method, symmetric DDA, Bresenham’s Algorithm, curves, parametric function, Beizier Method, B-sp-line Method. 2D & 3D Co-ordinate system, Translation, Rotation, Scaling, Reflection Inverse. Transformation, Composite transformation, Hrs. 7 8 7 8 world coordinate system, screens coordinate system, parallel and perspective projections, Representation of 3D object on 2D screen. Visibility: Image and object precision, z- buffer algorithms, area based algorithms, floating horizon. Total 7 37 Reference books: 1. D.Rogers and J. Adams, Mathematical Elements for Computer Graphics, 2. McGraw –Hill International Edition. 3. David F. Rogers, Procedural Elements for Computer Graphics, McGraw Hill 4. Computer Graphics (Schaum Series) by Lipschutz (MC Graw Hill) 5. Hearn and P. Baker. Computer Graphics, Prentice Hall. 6. C.Graphics by Yashwant Kanetkar. CA 606 Units 1 2 3 4 5 REAL TIME SYSTEMS Course Contents Introduction: Concept of Real Time System, Issues in real time computing, Performance measures of Real Time System, Issues in Real Time Computing, Performance measures of Real time Systems, Real Time Application. Model of Real Time System: Processor, resources, temporal parameter, Periodic Task Model, Sporadic Task Model, Precedence Constraints and Data Dependencies, Scheduling hierarchy Task Assignment and Scheduling: Different task model, Scheduling hierarchy, offline vs Online Scheduling, Clock Drives. Scheduling of Periodic Task: Assumptions, fixed versus dynamic priority algorithms, schedulability test for fixed priority task with arbitrary deadlines. Scheduling of periodic and Sporadic Tasks: Assumptions and approaches, deferrable, sporadic servers, slack stealing in deadline driven and fixed priority systems. Two level schemes for integrated scheduling, Scheduling for applications having flexible constrains. Hrs. 8 Resources and Resource Access Control: Assumptions on resources and their usage, resource contention, resource access control (Priority Ceiling Protocol, Priority Inheritance protocol, Slack Based Priority Ceiling Protocol, Preemption Ceiling Protocol). 8 Multi Processor Scheduling: Model of multi processor and distributed systems, Scheduling algorithms for end to end periodic tasks in homogeneous/heterogeneous systems, Predictability and validation of dynamic multiprocessor system. Real time Communication: Model of real time Communication, Priority base service for switched network, Weighted Round Robin Service, Medium access Control Protocol, Real Time Protocol. Total Reference Books:1 Jane .W. S. Liu “Real Time Systems” Pearson Education. 2 Krishna .C.M “Real Time Systems” Mc-Graw Hill Publication. 6 CA 607 ADVANCE JAVA Units 1 2 3 4 5 C(L,T,P) = 3(3,0,0) Head First Servlet and JSP Kethy Sierra C. Horstmann and G. Cornell (Prentice-Hall). P.Wang (Thomson). T.Budd (Addison-Wesley). Patrick, Naughton, Herbert 7 36 C(L,T,P) = 4(3,1,0) Course Contents Introduction to Java Enterprise, J2EE Architecture, API JDBC,API J2EE fundamentals, J2EE multi-tier architecture, Web Applications in J2EE,Apache Tomcat5.0 Server Configuration and important file. Httpprotocal with client and server model Servlets fundamentals – architecture, life cycle of a servlet,method of Servlet life cycle, initialization, javax.servlet and javax.servlet.http package and method of this package, servlets and HTML, Handling HTTP requests and Responses, retrieving data in servlet using GET and POST methods, JDBC Driver , Servlets with JDBC and Inter servlet communications – JDBC, JDBC servlet, inter servlet communication, different packages of JSP and servlets. Servlet sessions management technique using cookies,URL Rewritting, Hidden Form ,HttpSession methods, JDBC connection pool, servlet security JSP fundamentals – architecture, JSP Life Cycle, Difference between JSP and Servlet, JSP elements( JSP Expression, JSP Scriptlet ,JSP Directives, JSP Declaration) standard actions, (set Properties, get Properties, get Parameter ,set Parameter ,use Bean ,param), Implicit objects, JSP errors, JSP with JDBC connection. J2ME – introduction, building MID lets, creating a user interface, event handling with commands, tickers, screens, textbox, lists and forms. Total Reference books: 1. 2. 3. 4. 5. 7 Hrs. 7 8 9 8 7 39 CA 608 Units 1 2 3 4 5 1. 2. 3. 4. 1 2 3 4 5 E-COMMERCE 1 2 3 4 5 Hrs. 7 7 7 7 7 35 C(L,T,P) = 3(3,0,0) Course Contents Introduction: Definition, Objectives, Advantages and disadvantages, Forces driving E-Commerce, Traditional commerce Vs. E-Commerce, E-Commerce opportunities for industries, Growth of E-Commerce. E-Commerce Models: Business to Consumer, Business to Business, Consumer to Consumer, Other models – Brokerage Model, Aggregator Model, Info-mediary Model, Community Model and Value Chain Model. Electronic Payment Systems: Special Features required in payment systems., Types of E-payment systems, E-Cash, E-Cheque, Credit Card, Smart Card, Electronic Purses, E-Marketing, E-Customer Relationship Management, E-Supply Chain Management Mobile Commerce: Introduction to Mobile Commerce, Mobile Computing Application, Wireless Application Protocols, WAP Technology, Mobile Information Devices, Web Security, Introduction to Web security, Firewalls &Transaction Security, Client Server Network, Emerging Client Server Security Threats, firewalls & Network Security. Security Issues in E-Commerce: Security risk of E-Commerce, Types of Threats, Security Tools and risk management approach, Cyber Laws, Business Ethics, EDI Application in business. Total Reference Books: 1. E commerce by T N Chandra 2. The E Commerce Book: Building the E empire – by Steffano Korper, Juanita Ellis 3. C. Banerjee, E-Banking and Security Transactions, Genius Publications, 2009 CA 610 WIRELESS & MOBILE COMPUTING Units C(L,T,P) = 3(3,0,0) Course Contents Concept of intelligence, Artificial intelligence, definition turning test, areas of application. Search techniques, state space, Production rules, problem characteristics, production system characteristic, depth first, breadth first search methods and their analysis, Heuristic search method, generate and test, hill climbing, best first method, graph search, AND OR search methods, constraint satisfaction, backtracking. Introduction to list and string processing and dynamic databases concept of knowledge, characteristics and representation schemes, Logic, prepositional and predicate calculus, resolution, semiotics nets, frames, conceptual dependency, scripts Monotonic reasoning, logical reasoning induction, natural deduction. No monotonic reasoning – default reasoning minimalist reasoning, statistical reasoning – Bay’s theorem, certainty factors, dumpsters Shafer theory, Fuzzy logic, Forward and Backward reasoning Concept of learning, various techniques used in learning, inductive and deductive. Knowledge acquisition, rote learning, discovery analogy. Concept of expert system, need for an expert system, Component and categories of an expert system, need for an expert system, Stages in the development of an expert system Total Reference: Programming for Artificial Intelligence, :- by Prolog Artificial Intelligence, :- by Rich &Night Learning and Soft Computing : Support Vector Machines, Neural Networks, and Fuzzy Logic Models by Kecman Lisp by Winton CA 609 Units ARTIFICIAL INTELLIGENCE Hrs. 7 8 6 7 8 36 C(L,T,P) = 4(3,1,0) Course Contents Introduction: Applications, A short history of wireless communication. Wireless Transmission: Frequency for radio transmission, Signals, Antennas, Signal propagation, ‘Multiplexing, Modulation, Spread spectrum, Cellular systems. Medium Access Control: Motivation for a specialized MAC: Hidden and Exposed terminals, Near and Far terminals; SDMA, FDMA, TOMA: Fixed TDM, Classical Aloha, Slotted Aloha, Carrier sense multiple access, Demand assigned multiple access, PRMA packet reservation multiple access, Reservation TDMA, Multiple access with collision avoidance, Polling, Inhibit sense multiple access; COMA: Spread Aloha multiple access. Telecommunication Systems: GSM: Mobile services, System architecture, Radio interface, Protocols, Localization And Calling, Handover, Security, New data services; DECT: System architecture, Protocol architecture; TETRA, UMTS and IMT2000: UMTS Basic architecture, UTRA FDD mode, UTRA TDD mode. Mobile Network Layer: Mobile IP: Goals, assumptions and requirements, Entities and Terminology, IP packet delivery, Agent advertisement and discovery, Registration, Tunneling and Encapsulation, Optimizations, Reverse tunneling, Ipv6; Dynamic host configuration protocol, Ad hoc .networks: Routing Destination sequence distance vector, Dynamic source routing, Hierarchical algorithms, Alternative metrics. Mobile Transport Layer: Traditional TCP: Congestion control, Slow start, Fast retransmit/fast recovery, Implications on mobility; Indirect TCP, Snooping TCP, Mobile TOR, Fast retransmit/fast recovery, Transmission time-out freezing, Selective retransmission, Transaction oriented TCP . Total Reference Books: 1. Jochen Schiller, “Mobile Communications”, PHI/Pearson Education, Second Edition, 2003. 2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson Education, 2002. Hrs. 8 7 8 6 7 36 CA 611 ADVANCE COMPUTER ARCHITECTURE Units 1 2 3 4 5 C(L,T,P) = 4(3,1,0) Course Contents .Parallel Computer Model: The state of computing: Computer Development Milestones, Elements of Modern Computers, Evolution of computer Architecture, System Attributes of Performance. Multiprocessors & Multicomputer: Shared-Memory Multiprocessors, Distributed Memory Multicomputer, Taxonomy of MIMD Computer. Multifactor & SIMD Computers: Vector Supercomputer, SIMD Supercomputer PRAM and VLSI Models: Parallel Random Access Machines, VLSI Complexity model Program And Network Properties: Condition of Parallelism: Data and Resource Dependences, Hardware & Software Parallelism, The Role Of Compilers. Program Partioning and Scheduling: Grain Sizes And Latency, Grain Packing and Scheduling, Static Multiprocessors Scheduling. Program flow Mechanism: Control Flow v/s Data Flow, Demand Driven Mechanisms, Comparison of Flow Mechanism. System Interconnect Architecture: Network Properties and Routing, Static Connection Networks, Dynamic Connection Networks. Processor and Memory Hierarchy: Advance Processor Technology: Design Space of Processors, Instruction-set Architecture, CISC Scalar Processor, RISC Scalar Processor. Super Scalar & Vector Processor: Super Scalar Processor, The VLIW Architecture, Vector & Symbolic Processor. Memory Hierarchy Technology, Inclusion, Coherence & Locality, Memory Capacity Planning. Virtual Memory Models, TLB, Paging & Segmentation, Memory Replacement Policies. Bus, Cache and Shared Memory: Backplane Bus System: BackPlane Bus Specification, Addressing and Timing Protocols, Arbitration, Transaction and Interrupt, The IEEE Future Bus+ Standards. Cache Memory Organizations: Cache Performance Issues. Shared Memory Organizations: Interleaved Memory Organization, Bandwidth and Fault Tolerance, Memory Allocation Schemes Pipelining and Superscalr Techniques: Linear Pipeline Processors, Nonlinear Pipeline Processors, Instruction Pipeline Design, Arithmetic Pipeline Design, Cache Coherance, Synchronization Mechanism: The Cache Coherence Problem, Snoopy Bus Protocols ,Directory-Based Protocols, Total Hrs. 7 7 7 7 7 35 Reference Books: 1.Advance computer architecture by Ki hwang CA 612 Units 1 2 3 4 5 INFORMATION PROTECTION & SECURITY C(L,T,P) = 3(3,0,0) Course Contents Introduction to security attacks, services and mechanism, introduction to cryptography. Conventional Encryption: Conventional encryption model, classical encryption techniques- substitution ciphers and transposition ciphers, cryptanalysis, stereography, stream and block ciphers. Modern Block Ciphers: Block ciphers principals, Shannon’s theory of confusion and diffusion, fiestal structure, data encryption standard(DES), strength of DES, differential and linear crypt analysis of DES, block cipher modes of operations, triple DES, IDEA encryption and decryption, strength of IDEA, confidentiality using conventional encryption, traffic confidentiality, key distribution, Principals of public key crypto systems, RSA algorithm, security of RSA, key management, Diffle-Hellman key exchange algorithm, introductory idea of Elliptic curve cryptography, Elganel encryption Message Authentication and Hash Function: Authentication requirements, authentication functions, message authentication code, hash functions, birthday attacks, security of hash functions and MACS, MD5 message digest algorithm, Secure hash algorithm(SHA). Digital Signatures: Digital Signatures, authentication protocols, digital signature standards (DSS), proof of digital signature algorithm. Authentication Applications: Kerberos and X.509, directory authentication service, electronic mail security-pretty good privacy (PGP), S/MIME. IP Security: Architecture, Authentication header, Encapsulating security payloads, combining security associations, key management. Web Security: Secure socket layer and transport layer security, Secure Electronic Transaction (SET). System Security: Intruders, Viruses and related threads, firewall design principals, trusted systems. Total Reference Books: 1. Atul Kahate,” Cryptography and Network Security” TMH 2. William Stallings,” Cryptography and Network Security” Prentice Hall /Pearson Education Hrs. 8 7 8 6 7 36 CA 613 Units 1 2 3 4 5 ARTIFICIAL NEURAL NETWORKS C(L,T,P) = 3 (3,0,0) Contents INTRODUCTION TO ARTIFICIAL NEURAL NETWORKS : Introduction, Artificial Neural Networks, Historical Development of Neural Networks, Biological Neural Networks, Comparison Between Brain and the Computer, Comparison Between Artificial and Biological Neural Networks, Network Architecture, Setting the Weights, Activation Functions, Learning Methods. FUNDAMENTAL MODELS OF ARTIFICIAL NEURAL NETWORKS: Introduction, McCulloch – Pitts Neuron Model, Architecture, Learning Rules, Hebbian Learning Rule, Perceptron Learning Rule, Delta Learning Rule (Windrow-Hoff Rule or Leastmean Squre (LMS) rule, Competitive Learning Rule, Memory Based Learning. FEED FORWARD NETWORKS: Single Layer Perceptron Architecture, Algorithm, Perception Algorithm for Several Output Classes, Perceptron Convergence Theorem, Back Propagation Network (BPN), Generalized Delta Learning Rule, Back Propagation rule, Architecture, Training Algorithm, Selection of Parameters, Learning in Back Propagation, Application Algorithm, Local Minima and Global Minima, Radial Basis Function Network (RBFN). ADALINE AND MADALINE NETWORKS: Adaline Architecture, Algorithm, Applications, Madaline, Architecture, MRI Algorithm, MRII Algorithm. COUNTER PROPAGATION NETWORKS : Winner Take – all learning, out star learning, Kohonen Self organizing network, Grossberg layer Network, Full Counter Propagation Network (Full CPN), Architecture, Training Phases of Full CPN, Training Algorithm, Application Procedure, Forward Only counter Propagation Network, Architecture, Training Algorithm, Applications, Learning Vector Quantizer (LVQ). Hrs 7 7 7 7 7 Reference Books: 1. Introduction to Artificial Neural Systems - J.M.Zurada, Jaico Publishers, 3rd Edition. 2. Introduction to Neural Networks Using MATLAB 6.0 - S.N. Shivanandam, S. Sumati, S. N. Deepa, TMH. 4. Artificial Neural Network – Simon Haykin, Pearson Education, 2nd Ed. 5. Fundamental of Neural Networks – Laurene Fausett, Pearson, 1st Ed. 6. Artificial Neural Networks - B. Yegnanarayana, PHI. CA 615 Units 1 2 3 4 5 DATA MINING FOR BUSINESS INTELLIGENCE C(L,T,P)=3(3,0,0) Contents Data Mining-Definition, Functionalities & Classification, DM task primitives, Integration of a Data Mining system with a Database or a Data Warehouse, Major issues in Data Mining. Data Warehousing (Overview Only): Overview of concepts like star schema, fact and dimension tables, OLAP operations, From OLAP to Data Mining. Data Preprocessing: Why? Descriptive Data Summarization, Data Cleaning: Missing Values, Noisy Data, Data Hrs. 8 6 Integration and Transformation. Data Reduction:-Data Cube Aggregation, Dimensionality reduction, Data Compression, Numerosity Reduction, Data Discretization and Concept hierarchy generation for numerical and categorical data. Mining Frequent Patterns, Associations, and Correlations: Market Basket Analysis, Frequent Itemsets, Closed Itemsets, and Association Rules, Frequent Pattern Mining, Efficient and Scalable Frequent Itemset Mining Methods, The Apriori Algorithm for finding Frequent Itemsets Using Candidate Generation, Generating Association Rules, Mining Multilevel Association Rules. Classification & Prediction, Issues regarding Classification and prediction, Classification methods, Cluster Analysis, Categories of clustering methods, Partitioning methods, Hierarchical Clustering-Agglomerative and Divisive Clustering, BIRCH and ROCK methods, DBSCAN, Outlier Analysis Spatial Data and Text Mining: Spatial Data Cube Construction and Spatial OLAP, Mining Spatial Association and Co-location Patterns, Spatial Clustering Methods, Spatial Classification and Spatial Trend Analysis. Text Mining Text Data Analysis and Information Retrieval, Dimensionality Reduction for Text, Text Mining Approaches. Web Mining: Web mining introduction, Web Content Mining, Web Structure Mining, Web Usage mining, Automatic Classification of web Documents. Data Mining for Business Intelligence Applications: Data mining for business Applications like Balanced Scorecard, Fraud Detection, Market Segmentation, retail industry, telecommunications industry, banking & finance and CRM etc. Reference Books: 1. Han, Kamber, "Data Mining Concepts and Techniques", Morgan Kaufmann 2nd Edition 2. P. N. Tan, M. Steinbach, Vipin Kumar, “Introduction to Data Mining”, Pearson Education 3. MacLennan Jamie, Tang ZhaoHui and Crivat Bogdan, “Data Mining with Microsoft SQL Server 2008”, Wiley India Edition. 4. G. Shmueli, N.R. Patel, P.C. Bruce, “Data Mining for Business Intelligence: Concepts, Techniques, and Applications in Microsoft Office Excel with XLMiner”, Wiley India. 5. Michael Berry and Gordon Linoff “Data Mining Techniques”, 2nd Edition Wiley Publications. 6. Alex Berson and Smith, “Data Mining and Data Warehousing and OLAP”, McGraw Hill 8 6 7 CA 617 Units 1 2 3 4 5 MACHINE LEARNING C(L,T,P) = 3 (3,0,0) Contents Review Basic Tasks, Machine Learning Overview, Concept Learning, Version Space Learning, Learning Theory, Decision Tree Learning, Neural Network Learning. Methods and underlying problems of Machine Learning, Learning methods such as role, analogical, EBG, EBL, Chunking. Evaluating hypotheses, Bayesian learning, Minimum Description Length, Naïve Bayes, Custering Reinforcement Learning Learning by examples - Version space algorithm and ID3 algorithm. Utilizing ensembles of classifiers, Bagging and boosting, Instance based learning, RIPPER, Rule Learning PCA, Multi dimensional scaling.Important systems and applications to the problem of knowledge acquisition for expert system. Hrs 7 7 8 6 7 Reference Books: 1. Michalsky, T. Mitchell, J.Corbonell, Machine Learning Springer-Verlag. 2. T. M. Mitchell. Machine Learning, McGraw-Hill, 1997. CA 619 Units 1 2 3 4 5 1 2 3 4 5 C(L,T,P) = 3 (3,0,0) Contents History of expert system research, Current research activities. Conventional programs vs. Expert Systems Advantages and limitations of expert systems Architecture of an expert system Components of expert system Knowledge base, Inference mechanism User Interface Knowledge Engineering. Nature of expert knowledge., Knowledge acquisition and knowledge representative e.g. rule based systems, Semature nets, frames, Validity nature base , working memory Inference Engine and user interface, Techniques for inference mechanism, forward chaining and backward chaining , Interface language, terminal interface Development of expert systems Problem formulation, Search spaces, Task for expert system, application to engineering analysis and design Reference Books: 1. A guide to expert system- Waterman D.A., PHI 2. Introduction to expert systems- Jackson, P. Willy Publications CA 621 Units KNOWLEDGE ENGINEERING AND EXPERT SYSTEMS HUMAN COMPUTER INTERACTION Hrs 7 8 6 7 7 C(L,T,P) = 3 (3,0,0) Contents Introduction: Importance of user Interface – definition, importance of good design. Benefits of good design. A brief history of Screen design. The graphical user interface – popularity of graphics, the concept of direct manipulation, graphical system, Characteristics, Web user – Interface popularity, characteristics- Principles of user interface. Design process – Human interaction with computers, importance of human characteristics human consideration, Human interaction speeds, understanding business junctions. Screen Designing:- Design goals – Screen planning and purpose, organizing screen elements, ordering of screen data and content – screen navigation and flow – Visually pleasing composition – amount of information – focus and emphasis – presentation information simply and meaningfully – information retrieval on web – statistical graphics – Technological consideration in interface design. Windows – New and Navigation schemes selection of window, selection of devices based and screen based controls. Reference Books: 1. The essential guide to user interface design, Wilbert O Galitz, Wiley DreamTech. 2. Designing the user interface. 3rd Edition Ben Shneidermann , Pearson Education Asia 3. Human – Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd, Abowd, Russell Bealg, Pearson Education 4. Interaction Design Prece, Rogers, Sharps. Wiley Dreamtech 5. User Interface Design, Soren Lauesen , Pearson Education Hrs 7 8 6 7 7 CA 651 S.No. 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3 4 5 4 5 6 7 8 9 10 11 SYSTEM PROGRAMMING LAB Hrs. 4 hrs Weekly C(L,T,P) = 2(0,0,3) List of Experiments In this lab we will practice how source code is processed by compiler/ assembler/ pre-processor.All programs have to be written in C++ Write a class for file handling, having functions to open/ read/ write/ close/ reset. Develop a program which takes input a file of C language (a) Print Lines of Codes and print signature of all function (including main) (b) Print number of variables in every function (with type) I Generate a new file without the comments. (/* */ and //) (d) Process all #define (i.e. #define MAX 100, than replace every occurrence of MAX with 100). (Macro value 100 can be an expression also.) Write a program to create a symbol table. Write a program which can parse a given C file and store all variables and functions in symbol table. Write a program to convert given C program into RTL code. Assumption (a) Input C file will have only main function, (b) Only two type of statements, either variable declaration statements (int sub1=23;) OR mathematical expression (sub1 = sub2 – sub3 ;). I System has 16 registers (R1 to R16) (d) RTL opcode available are: ADD, LOAD, MOVE, SUB, MULTIPLY, DIVIDE (e) No control-flow (i.e. if-else, loop, jump etc.) expression is there in input code e.g. Int main () { int sub1=72, sub2=85, sub3=63 ; float per; per=(sub1+sub2+sub3)/(100+100+100); } CA 654 S. No. 1 2 3 C(L,T,P) = 2(0,0,3) List of Experiments Installation and configuration of Apache Tomcat server. Deploy and Setup the Environment for web Application in tomcat server. Write a program to print Hello World using Tomcat and Servlet. Write program to Explain and verify servlet life cycle. Retrieving form data using servlet and HTML Servlet sessions – session tracking using cookies,URL sing ing,hidden,Httpsession methods Write java program to perform type4 driver using JDBC and Servlet Develop Login Application Using Servlet and JDBC JSP life cycle implementation and elements using jsp Develop Registration Application Using JSP and JDBC J2ME – introduction, building MID lets, creating a user interface, Event handling with commands, tickers, screens, textbox, lists and forms. CA 653 S.No. ADVANCE JAVA LAB ASP.NET LAB Hrs. 4 hrs Weekly C(L,T,P) = 2(0,0,3) List of Experiments Introduction to SQL data source , grid view, detail view, Data list By using SQL data source insert the data in the grid view, detail view, repeater, form view , Data list By using grid view insert the record in the grid view and select particular record and find out the detail to the another grid view with in page or another page. By using Ado.net insert the record in the database and also the display the record.(with different validation controls) Use of the master page Use of themes Insert the data in the drop down menu and select the particular record from the drop down menu and find out the related information into the another drop down menu Use of three tier architecture Use of the config file Use of the XML Use of the Panel control, callender control Hrs. 4 hrs Weekly CA 655 COMPUTER GRAPHICS LAB C(L,T,P) = 2(0,0,3) List of Experiments Implementation of line generation using slope’s method, DDA and Bresenham’s algo. Implementation of circle generation using Mid point method. Implementation of Ellipse generation using Mid point method. Implementation of polygon filling using Flood fills, Boundaryfilland Scan line algo. Implementation of 2D transformation: Translation, Scaling, Rotation, Mirror reflection and Shearing. Implementation of Line clipping using Cohen Sutherland algo and Bisection method. Implementation of 3D geometric transformations: Translation, Scaling and Rotation. Implementation of any one of the Back face removal algo such as Depth-Buffer, Scan line algo, Warnock’s algo S.No. 1 2 3 4 5 6 7 8 CA 656 INFORMATION PROTECTION & SECURITY LAB S.No. List of Experiments 1 Write a Program in C++ to encrypt & decrypt a text message using stream cipher. 2 Write a Program in C++ to encrypt & decrypt a text message using block cipher. 3 Write a Program in C++ to encrypt & decrypt a text/document file. 4 Write a Program in C++ to implement fiestel Cipher model. 5 Write a Program in C++ to implement Diffie- Hellman Key Exchange 6 Write a Program in C++ to implement Hashing Techniques 7 . Write a Program in C++ to implement RSA Algorithm. 8 Write a Program in C++ to implement enveloping of keys. 9 Write a Program in C++ to implement Digital Signature. 10 Write a Program in C++ to implement Secure Electronic Transaction model(SET). S.No. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 CA 657 ADVANCED DBMS LAB (PL-SQL) List of Experiments Introduction to SQL Characteristics and Advantages of SQL Types of SQL commands SQL operators and their procedure Write queries using Tables Write programes usingViews Write programes using Indexes Write various Queries , Sub Queries Write various Sub Queries Write programes using Aggregate functions Write programes usingt Insert, Update and delete operations Write quries using Joins Write quries using Unions Write quries using Intersection Write quries using Minus CA 658 Units 1 2 Hrs. 4 hrs Weekly C(L,T,P) = 2(0,0,3) Hrs. 4 hrs Weekly C(L,T,P) = 2(0,0,3) Hrs. 4 hrs Weekly COLLOQUIUM (GROUP DISCUSSION) C(L,T,P) = 2(0,0,3) Course Contents Group discussion on different technical topics by small group of students Preparing student on small and latest topic as per industry requirement. CA 659 Units 1 2 3 4 5 MAT LAB C(L,T,P) = 2 (0,0,3) List of Experiments Matlab Interactive Sessions, Menus and the toolbar, Computing with Matlab, Script files and the Editor Debugger, Matlab Help System, Programming in Matlab. Arrays, Multidimensional Arrays, Element by Element Operations, Polynomial Operations Using Arrays , Cell Arrays , Structure Arrays Elementary Mathematical Functions , User Defined Functions, Advanced Function Programming , Working with Data Files Program Design and Development , Relational Operators and Logical Variables , Logical Operators and Functions , Conditional statements , Loops , The Switch Structure , Debugging Mat Lab Programs XY- plotting functions , Subplots and Overlay plots , Special Plot types , Interactive plotting , Function Discovery , Regression , 3-D plots Reference Books: Hrs. 4 hrs weekly rd 1. 2. 3. G. H. Golub and C. F. Van Loan, Matrix Computations, 3 Ed., Johns Hopkins University Press, 1996. B. N. Datta, Numerical Linear Algebra and Applications, Brooks/Cole, 1994 (out of print) L. Elden, Matrix Methods in Data Mining and Pattern Recognition, SIAM Press, 2007 Hrs 6 8 6 6 6 CA 701 OBJECT ORIENTED SOFTWARE ENGINEERING Units 1 2 3 4 5 Course Contents Unified Modeling Language, Basic structures and modeling classes, common modeling techniques, relationships, common mechanism, class diagrams Advanced structured modeling, advanced classes and relationships, interfaces, types and roles, instances and object diagram. Basic idea of behavioral modeling. Object- oriented concepts and principles. Identifying the elements of an object model. Object oriented projects metrics and estimation. Design for object – oriented systems. The system design process. Object – oriented testing – testing OOA and OOD models. The object – oriented testing strategies. Inter class testing. Technical metrics for O-O systems. Class oriented metrics and metrics for O-O projects. Advanced topics in software engineering. Component based software engineering and development. Classifying and retrieving components. Total Reference Books: 1. Object oriented software engineering by Timothy C. Lethbridge and Robert Laganière CA 703 ANALYSIS AND DESIGN OF ALGORITHMS Units 1 2 3 4 5 1 2 3 4 5 BIO-INFORMATICS Hrs. 7 7 7 7 7 35 C(L,T,P) = 4(3,1,0) Course Contents Introduction:- algorithm definition and specification – Design of Algorithms, and Complexity of Algorithms, Asymptotic Notations, Growth of function, Recurrences. Performance analysis – Elementary Data structures:- stacks and queues – trees – dictionaries – priority queues –sets and disjoint set union – graphs – basic traversal and search techniques. Divide – and – conquer:- General method – binary search – merge sort – Quick sort – The Greedy method:General method – knapsack problem – minimum cost spanning tree – single source shortest path. Dynamic Programming – general method – multistage graphs – all pair shortest path – optimal binary search trees – 0/1 Knapsack – traveling salesman problem – flow shop scheduling. Backtracking:- general method – 8-Queens problem – sum of subsets – graph coloring – Hamiltonian cycles – knapsack problem – Branch and bound:- The Method – 0/1 Knapsack problem – traveling salesperson. Parallel models:-Basic concepts, performance Measures, Parallel Algorithms: Parallel complexity, Analysis of Parallel Addition, Parallel Multiplication and division, parallel Evaluation of General Arithmetic Expressions, First-Order Linear recurrence. Total Reference Books: 1. Computer Algorithms by Horowitz, Sahni, Rajasekaran 2. Brassard & Bratley, Fundamentals of Algorithmics CA 705 Units C(L,T,P) = 4(3,1,0) Hrs. 7 7 7 7 7 35 C(L,T,P) = 4(3,1,0) Course Contents Introduction – Importance of Bioinformatics – Biological Sequence Structure – Deficit –Genome Projects – Status – Sequence analysis – Homology and analogy. EMBNET – NCBI – virtual Tourism Primary Sequence Databases Biological data base – Primary Sequence Database – Composite. Protein Sequence Database – Secondary Database - Composite Protein – Pattern database structure and classification of database. Genome Information Resources – DNA Sequence data base – Specialized genomic Resources. DNA Sequence analysis : Why analyze DNA? – Gene structure – Features of DNA sequence analysis – Issues in the interpretation and EST search – Approach of Gene hunting – Cell CDNA libraries and EST’s – Approaches to EST analysis – Effect of EST data on DNA data base examples of EST analysis. Data Base Searchers and Pair Wise Alignment Data base searching – Alphabets and Complexity – Comparing Two Sequences – Sub-Sequence – Identity and Similarity – Dot plots– Simple alignment – Gaps – Scoring Matrices – Dynamic programming – BLAST and its relative – FSTA and related algorithms – Alignment scores and statistical significance of data base sequences. Total Reference Books: 1. T.K. Attwood and D.J. Parry-Smith, Introduction to Bioinformatics, Pearso 2. Arthur M. Lesk, Introduction to Bioinformatics, Oxford University Press, Hrs. 7 8 8 6 6 35 CA 707 SOFT COMPUTING Units 1 2 3 4 5 Course Contents Overview of Crisp sets and fuzzy sets : Basic concepts of crisp sets and fuzzy sets, Basic types of fuzzy sets, Fuzzy sets verses crisp sets, Representation and extension principle for fuzzy sets, Operations on Fuzzy sets Fuzzy Relations and Fuzzy Logic: Crisp versus Fuzzy relations, Binary relations on fuzzy sets, Equivalence, compatibility and ordering relations, Morphemes and compositions of relations, Fuzzy relations equations, Fuzzy measures and possibility theory, Classical logic and multivolume logics, Fuzzy propositions and approximate reasoning Fuzzy systems and neuron fuzzy systems : Relevance of integration between fuzzy sets and neural networks – pros and cons, Fuzzy neurons, Fuzzy neural networks, Neuron fuzzy systems, Fuzzy associative memories. Introduction to Genetic Algorithms : What are genetic algorithms?, Robustness of traditional optimization and search methods, The Goals of optimization, A simple genetic algorithm, Genetic algorithms at work – a Simulation by hand, Grist for the Search Mill – Important Similarities, Similarity Templates (Schemata), Learning the Lingo. Genetic Algorithms Revisited : Mathematical Foundations, The fundamental Theorem, Schema processing at work: An example by hand revisited. The two-armed and karmed bandit problem, The building block hypothesis, Another perspective: The minimal deceptive problem, Schemata revisited: similarity templates as hyper planes. Computer Implementation of A Genetic Algorithm : Data Structures, Reproduction, Crossover, and mutation, A Time to reproduce, a time to cross, Get with the main program, Mapping objective functions to fitness form, Fitness scaling, Codlings, A multiparameter, Mapped, Fixed-Point coding, Discrimination, Constraints. Introduction To Genetic-Based Machine Learning : Genetics-Based machine learning, Rule and message system, Apportionment of credit: The bucket brigade, Genetic algorithm, A simple classifier system in Pascal, Results using the simple classifier system. Total Reference Books: 1 Neuro-Fuzzy and Soft Computing by Mohammad Jamshidi CA 709 Units 1 2 3 4 5 1. 2. 3. 4. ERP SYSTEMS DECISION SUPPORT SYSTEM Hrs. 7 7 7 7 7 35 C(L,T,P) = 4(3,1,0) Course Contents Enterprise wide information system, Custom built and packaged approaches, Needs and Evolution of ERP Systems, Common myths and evolving realities, ERP and Related Technologies, Business Process Reengineering and Information Technology, Supply Chain Management, Relevance to Data Warehousing, Data Mining and OLAP, ERP Drivers, Decision support system. ERP Domain, ERP Benefits classification, Present global and Indian market scenario, milestones and pitfalls, Forecast, Market players and profiles, Evaluation criterion for ERP product, ERP Life Cycle: Adoption decision, Acquisition, Implementation, Use & Maintenance, Evolution and Retirement phases, ERP Modules. Framework for evaluating ERP acquisition, Analytical Hierarchy Processes (AHP), Applications of AHP in evaluating ERP, Selection of Weights, Role of consultants, vendors and users in ERP implementation; Implementation vendors evaluation criterion, ERP Implementation approaches and methodology, ERP implementation strategies, ERP Customization, ERP-A manufacturing Perspective. Critical success and failure factors for implementation, Model for improving ERP effectiveness, ROI of ERP implementation, Hidden costs, ERP success inhibitors and accelerators, Management concern for ERP success, Strategic Grid: Useful guidelines for ERP Implementations. Technologies in ERP Systems and Extended ERP, Case Studies Development and Analysis of ERP Implementations in focusing the various issues discussed in above units through Soft System approaches or qualitative Analysis tools, Learning and Emerging Issues, ERP and E- Commerce. Concept of E-Governance : Concept, E-Governance frame work, area of application like public sector, service industry. Total Reference Books: 1. ERP A Managerial CA 711 Units C(L,T,P) = 4(3,1,0) Hrs. 7 7 7 7 7 35 C(L,T,P) = 4(3,1,0) Course Contents Prerequisite: Information System Design and Implementation. Review of Decision making process in business and 1 industrial environment, Quantitative techniques for decision making, Gaming and game theory, Group decision Evolution of Decision Support System (DSS) Specific DSS, DSS generator and DSS Tools, Data, Model and Dialog 2 Management Systemand Interfacesbetween them Graphical and quantitive tools to build model and model management 3 Group decision Evolution of Decision Support System (DSS) 4 Adaptive Design approach to DSS development. Accommodatmg cognitive style in DSS, Integrating Expert and decision support system and case studies 5 Integrating Expert and decision support system and case studies Total Reference Books: 1.Bennry, J.L. : Building Decilsion Support System Addision, Wesley Publ,Comp- 1983 2.Sprague, R.H,& Watson, HJ (Edn.) : Decision Support System, Putting Theory and PractIces PrentIce-Hall, New Jersey, 1986. Keen, P.G.W. & Mortan, M,S,S, : DecIsion Support System:An odeling ional Perspective, Addision-Wesley Pub1. David: Applied Decision Support System, Prentice-Hall International1989.e: Hrs. 7 7 7 7 7 35 CA 713 SIMULATION AND MODELING Units 1 2 3 4 5 C(L,T,P) = 4(3,1,0) Course Contents Introduction and Motivation – System concepts & theories in brief, Systems – contllllloUS ( discrete, stochastic/deterministic, open/closed System Dynamics (SO) : Foundations of SO, Elements of SO odeling – physical flows, flow diagrams, Table functions. Causal loop diagramming, Order of a system – first/second order positive/negative feedback systems, steps in SD odeling, Building and simulating SD models – developing model equations, dependence among model variables, algorithm for Euler – integration, Features of simulation packages – DYNAMO, DYSBASE, Simulation-inventory control model, productiondistribution problem Generation of Random Numbers and their Applications: Pseudo random numbers and algorithm for generating themmiddle-square method, linear congruently method, Testing and validating pseudo random sequences, Non-uniform variatesInverse-transform method, Generation of nornlal random numbers (binomialJy, exponentially)-Monte Carlo (MC) integration – Integration, (hit or miss MC method error analysis, Sample mean MC method, efficiency of MC method. Discreta System, Simulation and Model Validation: Simulation terminology,Time management methods, Object gereration, Events and event synchronization, Queue management and list processing, Collecting and recording simulation data, Evaluation of the simulation model. Design of simulation Experiments and Output Analysis: Validation of simulator, completely randomized design, Randomized complete block design Factorial design, Network simulation model performance analysis, Estimation of model parameters, Analysis of simulation results, estimation and confidence limits Languages for Discrete System Simulation: Language characteristics, Use of Multipurpose languanges, example; Simulation languages – GPSS, Special-purpose languages: SIMCRIPT 11.5,GASP IVQueueing Theory and Simulation: Queueing system, MM/l 00/FIFO system, Measures for M/M/I oo/FIFO – expected number in system/queue, expected time in the system/queue, M/M/1/K/FIFO system, MlM/C? oo/FIFO system, Priority queueing system. Total Hrs. 7 7 7 7 7 35 Reference Books: 1. simulation, modeling and analysis, third edition,TMH 2. jerry banks,john and barry l nelson & david m nicol CA 715 DISTRIBUTED SYSTEM Units 1 2 3 4 5 C(L,T,P) = 4(3,1,0) Course Contents CHARACTERIZATION OF DISTRIBUTED SYSTEMS: Introduction, Examples of distributed Systems, Resource sharing and the Web Challenges. System Models: Architectural models, Fundamental Models Theoretical Foundation for Distributed System: Limitation of Distributed system, absence of global clock, shared memory, Logical clocks, Lamport’s & vectors logical clocks, Causal ordering of messages, global state, termination detection. Distributed Mutual Exclusion: Classification of distributed mutual exclusion, requirement of mutual exclusion theorem, Token based and non token based algorithms, performance metric for distributed mutual exclusion algorithms. .DISTRIBUTED DEADLOCK DETECTION: system model, resource Vs communication deadlocks, deadlock prevention, avoidance, detection & resolution, centralized dead lock detection, distributed dead lock detection, path pushing algorithms, edge chasing algorithms. DISTRIBUTED OBJECTS AND REMOTE INVOCATION: SECURITY: Overview of security techniques, Cryptographic algorithms, Digital signatures Cryptography pragmatics, Case studies: Needham Schroeder, Kerberos, SSL & Millicent. TRANSACTIONS AND CONCURRENCY CONTROL: Transactions, Nested transactions, Locks, Optimistic Concurrency control, Timestamp ordering, Comparison of methods for concurrency control. DISTRIBUTED FILE SYSTEMS: File service architecture, Sun Network File System, The Andrew File System, Recent advances DISTRIBUTED ALGORITHMS: Introduction to communication protocols, Balanced sliding window protocol, Routing algorithms, Destination based routing, APP problem, Deadlock free Packet switching, Introduction to Wave & traversal algorithms, Election algorithm. CORBA CASE STUDY: CORBA RMI, CORBA services. Total Reference Books: 1. Coulousis,dollimore,kindberg “distributed system concept and design” 2. Distributed system,principles and paradigm by AS tannenbaum Hrs. 7 7 7 7 7 35 CA 717 Units 1 2 3 4 5 2 3 4 5 6 7 ANALYSIS & DESIGN OF ALGORITHMS LAB 2 3 4 5 Hrs. 7 7 7 7 7 35 C(L,T,P) = 2(0,0,3) List of Experiments Programming assignments on each algorithmic strategy: • Divide and conquer method (quick sort, merge sort, Strassen’s matrix multiplication), Greedy method (knapsack problem, job sequencing, optimal merge patterns, minimal spanning trees). Dynamic programming (multistage graphs, OBST, 0/1 knapsack, traveling salesperson problem). Back tracking (n-queens problem, graph coloring problem, Hamiltonian cycles). Sorting : Insertion sort, Heap sort, Bubble sort Searching : Sequential and Binary Search Selection : Minimum/ Maximum, Kth smallest element BM 114 BUSINESS ORGANIZATION & SYSTEM Units 1 C(L,T,P) = 4(3,1,0) Course Contents Overview, Motivation(for Data Mining),Data Mining-Definition & Functionalities, Data Processing, Form of Data Preprocessing, Data Cleaning: Missing Values, Noisy Data,(Binning, Clustering, Regression, Computer and Human inspection), Inconsistent Data, Data Integration and Transformation. Data Reduction:-Data Cube Aggregation, Dimensionality reduction, Data Compression, Numerosity Reduction, Clustering, Discretization and Concept hierarchy generation. Concept Description: Definition, Data Generalization, Analytical Characterization, Analysis of attribute relevance, Mining Class comparisons, Statistical measures in large Databases. Measuring Central Tendency, Measuring Dispersion of Data, Graph Displays of Basic Statistical class Description, Mining Association Rules in Large Databases, Association rule mining, mining Single-Dimensional Boolean Association rules from Transactional Databases–. What is Classification & Prediction, Issues regarding Classification and prediction, Decision tree, Bayesian Classification, Classification by Back propagation, Multilayerfeed-forward Neural Network, Back propagation Algorithm, Classification methods Knearest neighbor classifiers, Genetic Algorithm. Cluster Analysis, Data Warehousing: Overview, Definition, Delivery Process, Difference between Database System and Data Warehouse, Multi Dimensional Data Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept hierarchy, Process Architecture, 3 Tier Architecture, Data Marting. Aggregation, Historical information, Query Facility, OLAP function and Tools. OLAP Servers, ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and Recovery, Tuning Data Warehouse, Testing Data Warehouse. Total Reference Books: 1 Alex bezon,Stephen j.smith”data warehousing,data mining and olap” McGraw hill edition 2001. 2 W.H Immam” Building the data warehouse 3rd edition wiley 2003 CA 751 S.No. 1 DATA MININIG AND WAREHOUSING Hrs. 4 hrs Weekly C(LTP)=3(3,0,0) Course Contents Business –Meaning and Contents, Business as a system, Business and Legal and Economic Environment, Forms of Business Organization (meaning, merits & demerits). Management- Management Principles, Henry fayol’s principles of management, Taylor’s Scientific Management, Management Process, Basic Functions (in short),Meaning, Nature and Process, Role of Manager. Organizational Behavior- Need of Understanding human behavior in organizations, Challenges and opportunities for OB, Contributing disciplines to the field of OB Conceptual Models of OB. Managing Personnel- HRM- Meaning and Functions, Man Power Planning, Job Analysis and Design, Training, Career Planning & Development, Motivation, Compensation Management Managing Finance-Concept of fixed and Working Capital, Main Sources of Finance, Accounting, Meaning, Users, Budgeting- Meaning,Type of Budgets. Managing Production- Basic Concepts,Objectives, Elements of Productions, Planning, and Control. Managing Sales and Marketing- Basic Concepts of marketing, Sales Promotions (including Salesmanship). Total Reference Books: 1. B.P. Singh & T.N. Chabbra, Business Organisation and Management Functions, Dhanpat Rai & Co. 2000. 2. Philip Kotler, Marketing Management –(9th Ed.) Prentice Hall of India. 3. Dr. S.N. Maheshwari, Financial Management – Principles and Practice (6th revised Ed.) S. Chand & Sons. 4. Stephen P. Robbins, Organisational Behaviour (8th Ed.) Prentice Hall of India. Hrs. 7 7 8 7 7 36 BM 517 ACCOUNTING AND FINANCIAL MANAGEMENT Units 1 2 3 4 5 Course Contents Definition of Accounting and its advantages & limitations, Scope of accounting, Branches of Accounting – Financial Accounting – Cost Accounting – Management Accounting, users of Accounting information, Methods of Accounting, Double Entry Accounting System, Types of Accounts and Rules for Debit and Credit. Cash and Credit Transaction, Cash discount and Trade discount. Preparation of Journal, Ledger and Trial Balance. Final Accounts and Accounting Ratios, Preparation of Final Accounts (Sole Proprietorship only), Preparation of Trading A/c, Profit & Loss A/c and Balance Sheet covering simple adjustments Accounting Ratios: Meaning, Advantages and Limitations of Accounting ratios Computation of following ratios only. Gross Profit Ratio, Net Profit Ratio, Stock Turnover Ratio, Operating Ratio, Current Ratio, Liquid Ratio, Debtors Ratio, Creditors Ratio, Return on Capital Employed, Earning Per Share, Return on shareholders fund. Cost Accounting: Meaning and definition of Cost Accounting – its Advantages & Limitations Budgetary Control, Definitions – Advantages – Limitations, Procedure for setting up Budgetary Control, Different types of budgets, Advantages and limitations of Cash Budget and preparation of Cash Budget. Marginal Costing: Meaning-Advantages- Limitations, Break Even Point, Margin of Safety, Profit Volume Ratio, Application of Marginal Costing including simple problems on make or buy and product mix.. Total Reference Books: 1. Accounting by Steven M. Bragg 2. Accounting and financial management DE 101 DISCIPLINE AND EXTRA CURRICULAR ACTIVITIES – I C(LTP)=2(0,0,0) DE 102 DISCIPLINE AND EXTRA CURRICULAR ACTIVITIES - II C(LTP)=2(0,0,0) DE 201 DISCIPLINE AND EXTRA CURRICULAR ACTIVITIES - III C(LTP)=2(0,0,0) DE 202 DISCIPLINE AND EXTRA CURRICULAR ACTIVITIES – IV C(LTP)=2(0,0,0) DE 301 DISCIPLINE AND EXTRA CURRICULAR ACTIVITIES – V C(LTP)=2(0,0,0) DE 302 DISCIPLINE AND EXTRA CURRICULAR ACTIVITIES – VI C(LTP)=2(0,0,0) DI 602 S.No. DISSERTATION 1 2 3 4 5 Hrs. 8 7 7 8 7 37 C(LTP)=16(0,0,32) List of Experiments Original research work carried out by the candidate under the guidance of faculty of the department and to be submitted in a bounded form. Evaluation of the Dissertation shall be done by the board of examiners appointed by the University. (Dissertation Report = 60% component, Dissertation Viva-Voce = 40% component) General Guidelines for students are given as under, 1. Undertaking a project on recent topic of the latest and emerging technologies; 2. Conduct feasibility study of the project; 3. Prepare documentation; 4. Pre-implementation of the project. 5. Final implementation of the assigned project; 6. Publication of the findings in an International / National Journal having ISSN/ISBN numbers. 7. Presentation of research work before the Evaluation board. EC 220 DIGITAL ELECTRONICS Units C(L,T,P) = 3(3,0,0) Hrs. 32 hrs per week C(LTP)=4(3,1,0) Course Contents Number systems and different types of number systems,1’s & 2’s complement, Binary Fixed- Point Representation, Arithmetic operation on Binary numbers, Overflow & underflow, Floating Point Representation, ASCII, EBCDIC codes, Gray code, Excess-3 & BCD Logic Gates, AND, OR, NOT GATES and their Truth tables, NOR, NAND & XOR gates, Boolean Algebra, Basic Boolean Law's, Demurrage’s theorem, MAP Simplification, Minimization techniques, K -Map, Sum of Product & Product of Sum. Combinational & Sequential circuits, Half Adder & Full Adder, Full subtract or Binary serial and parallel adders. BCD adder. Binary multiplier. Decoder: Binary to Gray decoder, BCD to decimal, BCD to 7-segment decoder. Flip-flops - RS, D, JK & T Flip-flops, RAM and ROM, Multiplexer, Demultiplexer, Encoder, Octal to binary, BCD to excess-3 encoder. Decoder, Idea about Arithmetic Circuits, Program Control, Instruction Sequencing. Counters, Asynchronous (ripple), synchronous and synchronous decade counter, Modulus counter, skipping state counter, counter design. Ring counter. Counter applications. Registers: buffer register, shift register Total Reference Books: 1. BARTEE, “Digital Computer Fundamentals ” TMH Publication ISBN 0-07-003899-6 2. MALVINO, “ Digital Computer Electronics ” TMH Publication ISBN 0-07-462235-8 3. MORRIS MANO, “Computer System Architecture ” PHI Publication ISBN 81-203-0417-9 Hrs. 6 8 7 7 8 36 EC 260 DIGITAL ELECTRONICS LAB S.No. 1 2 3 4 5 6 7 8 List of Experiments To verify the truth tables of basic logic gates: AND, OR, NOR, NAND, NOR. Also to verify truth table of Ex-OR, Ex-NOR (For 2, 3, & 4 inputs using gates with 2, 3, & 4 inputs). To verify the truth table of OR, AND, NOR, Ex-OR, Ex-NOR realized using NAND & NOR gates. To realize an SOP and POS expression. To realize Half adder/ Subtractor & Full Adder/ Subtractor using NAND & NOR gates and to verify their truth tables. To realize a 4-bit ripple adder/ Subtractor using basic Half adder/ Subtractor & basic Full Adder/ Subtractor To verify the truth table of 4-to-1 multiplexer and 1-to-4 demultiplexer. Realize the multiplexer using basic gates only. Also to construct and 8-to-1 multiplexer and 1-to-8 demultiplexer using blocks of 4-to-1 multiplexer and 1-to-4 demultiplexer Using basic logic gates, realize the R-S, J-K and D-flip flops with and without clock signal and verify their truth table Construct a divide by 2,4 & 8 asynchronous counter. Construct a 4-bit binary counter and ring counter for a particular output pattern using D flip flop. MA 207 NUMERICAL ANALYSIS Units I II III IV V I II III IV V Hrs. 3 hrs weekly C(LTP) = 4(3,1,0) Course Contents Number system: types of number system, floating point arithmetic representation of floating point numbers, Operations, normalization, Errors in numerical computation. Iterative Methods: Zeros of a single transcendental equation and zeros of polynomial using Bisection Method, Iteration Method, Regula-Falsi method, Newton Raphson method, Secant method. Simultaneous Linear Equations: Solutions of system of Linear equations, Gauss Elimination direct method and pivoting, Ill Conditioned system of equations, Inversion matrix method, Refinement of solution. Gauss Seidal iterative method. Interpolation with equal intervals: Finite Differences, Difference tables, Polynomial Interpolation: Newton’s forward and backward formula, Central Difference Formulae: Gauss forward and backward formula, Stirling’s, Bessel’s formula. Interpolation with unequal intervals: Langrange’s Interpolation, Newton Divided difference formula. Numerical Differentiation and Integration: Introduction, Numerical Differentiation, Numerical Integration, Trapezoidal rule, Simpson’s rules, Weddle’s Rule. Solution of differential equations: Picard’s Method, Euler’s Method, Taylor’s Method, Runge- Kutta methods, Predictorcorrector method, Automatic error monitoring, stability of solution etc. Total Reference Books: 1. S. S Sastry: Introduction to Numerical methods: PHI Learning 2. Jain Iyenger, Jain:Numerical methods for scientific and engineering computation, New Age International Publication 3. Numerical Analysis: Biswal: PHI Learning EE 103 ELECTRICAL & ELECTRONICS ENGINEERING Units C(LTP)=2(0,0,3) Hrs. 6 7 8 7 8 36 C(LTP)=3(3,0,0) Course Contents DC NETWORKS: Kirchhof’s Laws, Node Voltage and Mesh Current Analysis, Delta-Star and Star-Delta Transformation, Source Conversion, Classification of Networks Elements, Super position theorem, Theremin’s Theorem. SINGLE PHASE AC CIRCUITS: Generation of Single Phase AC Voltage, EMI Equation, Average, RMS and Effective Values, RLC Series, Parallel and Series- Parallel Circuits, Complex, Representation of Impedance, Phasor Diagram, Power & Power Factor. TRASFORMER: Transformer: EMF equation, Faradays Laws of Electromagnetic Induction, Construction and Operation of Single Phase Voltage and Current Relationship and Pharos Diagram of Ideal Transformer. TRANSISTORS: Bipolar Junction Transistor, Transistor Current Components, Characteristics of CE, CB and CC Transistors Amplifiers. COMMUNICATION SYSTEM: Introduction to modulation (AM, FM and PM), Demodulation, Demuliplexing, Super heterodyne Radio Receiver, Television, Elementary Concept of Optical, Satellite and Mobile Communication. Total References books: 1. Electric Circuit Analysis by B.Subramanyam 2. Basic Electrical Engineering by K.N.Srinivas 3. Semiconductor Devices by Yaduvir Singh & Swarajya Agnihotri Hrs. EE 153 S. No. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. ELECTRICAL AND ELECTRONICS ENGINEERING LAB List of Experiments Single line diagram of a power system and a distribution sub-station and basic functional study of main components used in power systems. Make house wiring including earthing for 1-phase energy meter, MCB, ceiling fan, tube light, three pin socket and a lamp operated from two different positions. Basic functional study of components used in house wiring. Study the construction and basic working of ceiling fan, single phase induction motor and three phase squirrel cage induction motor. Connect ceiling fan along with regulator and single phase induction motor through auto-transformer to run and vary speed. (a) Basic functional study and connection of moving coil & moving iron ammeters and voltmeters, dynamometer, wattmeter and energy meter. (b) Run a 3-phase squirrel cage induction motor at no load and measure its voltage, current, power and power factor. Reverse the direction of rotation. Study the construction, circuit, working and application of the following lamps: (i) Fluorescent lamp, (ii) Sodium vapour lamp, (iii) Mercury vapour lamp, (iv) Halogen lamp and (v) Neon lamp (a) Study the construction and connection of single phase transformer and auto-transformer. Measure input and output voltage and fin turn ratio. (b) Study the construction of a core type three phase transformer. Perform star and delta connection on a 3-phase transformer and find relation between line and phase voltage. Identification, testing and applications of resistors, inductors, capacitors, PN-diode, Zener diode, LED, LCD, BJT, FET, UJT, SCR, Photo diode and Photo transistor. (a) Functional study of CRO, analog & digital multi-meters and function / signal generator. (b) Study the single phase half wave and bridge rectifier and effects of filters on waveform. Study the BJT amplifier in common emitter configuration. Measure voltage gain, plot gain frequency response and calculate its bandwidth. (a) Study the construction and basic working of SCR. (b) Study the single phase half wave and bridge controlled rectifier and observe the effect of firing angle on waveform. EN 103 COMMUNICATION ENGLISH Units 1 2 3 4 5 1. 2. Hrs. 3 hrs week ly C (L, T, P) = 3 (3, 0, 0) Course Contents Sentence Elements, Part of Speech( Brief introduction), Sentence and its Type: Simple, Compound, Complex, Assertive, Interrogative, Imperative, and Exclamatory Noun and its different types, Pronoun and its different types, Adjective and its different types, Adverbs and its different types Tenses: Simple Present, Progressive Perfect, Present Perfect, progressive along-with Past Tense and indications of futurity Reported Speech Voice: Active and Passive Modals, Preposition, Determiners and Articles, The Infinitive & the ING form Sub-verb agreement, Relative clauses, Common Errors Total Reference Books: KR Lakshiminarayana: English for /technical Communication-vols. 1&2, SCITECH Publications (India) Pvt. Ltd., T.Nagar, Chenna 600 017 Edmund H weiss: Writing Remedies: Practical Excercies for Technical Wriring. Universities Press Hyderabad. EN 106 TECHNICAL ENGLISH Units 1 2 3 4 5 C (L, T, P) = 2 (0, 0, 3) Hrs. 7 8 7 8 7 37 C (L, T, P) = 3 (3, 0, 0) Course Contents The writing process: Gathering, writing, reviewing, editing, indexing testing etc. Review writing, Repot Writing, Précis writing, Paragraph writing, business overviews Letter writing: letter of inquiry. Letter of adjustment. Claim letter. Follow-up letter. Letter of acceptance. Letter of refusal Job-search correspondence: Including cover letter and curriculum vitae, Resume Writing emails User guides reference guides Online help and websites. Technical Proposal writing Total Reference Books: 1. KR Lakshiminarayana: English for Technical Communication – vols. 1 and 2, SCITECH Publications (India) Pvt. Ltd., T.Nagar, Chenna 600 017 2. Edmund H weiss: Writing Remedies: Practival Exercises for Technical Writing. Universities Press, Hyderabad. Hrs. 8 8 7 6 6 35 EN 153 COMMUNICATION & SOFT SKILL LAB C (L, T, P) = 2 (0, 0, 3) S.No. 1 2 3 4 5 6 7 8 9 10 List of Experiment Hrs. Personality and its types Personality development 3 hrs Body Language weekly Emotion Leadership and team building Goal setting Time management Stress management Group discussion Interview techniques Reference Books: 1. KR Lakshiminarayana: English for /technical Communication-vols. 1&2, SCITECH Publications (India) Pvt. Ltd., T.Nagar, Chenna 600 017 2. Edmund H weiss: Writing Remedies: Practical Excercies for Technical Wriring. Universities Press Hyderabad ES 101 Units 1 2 3 4 5 ENVIRONMENTAL STUDIES C(L,T,P)=2(2,0,0) Course Contents UNIT I – Man & Environment Definition of Environment & its various components. Ecosystem concepts. Dependence of Man on nature for its various various needs. Human population growth & its impacts on environment. Environment & human health. Environmental concerns including climate change, Global warming, Acid Rain, Ozone layer Depletion etc. Environmental ethics. Traditional ways of utilising various components of environment. Sustainable developments. UNIT II – Natural Resources Forest resources, Mining , Dams & their effects on forests & tribal people. Water resources-over utilization of water, floods, droughts and conflicts over water resources. Mineral Resources- Use of various minerals for Human welfare & environmental effects of mining. Food resources -World food problem. Impacts of changing Agriculture practices on Environment. Energy Resources-Renewable and non renewable energy Resources & exploration of alternative energy sources. Land Resources- land degradation, soil erosion, desertification & soil contamination. UNIT III – Ecosystems Structure & function, energy flow, food chains, food webs, Ecological pyramids. Basics of forest grasslands, desert & aquatic ecosystem (Ponds, Streams, Lakes, Rivers, Oceans & Estuaries) UNIT IV – Biological Diversity Genetic, species & ecosystem diversity, Values of Biodiversity, Global, National & Local Biodiversity. Hot-spots of Biodiversity, threat to biodiversity. Endangered & endemic species of India. Conservation of biodiversity in situ & ex-situ Unit V- Environment pollution Causes, effects & control of- Air pollution, Water pollution, Soil pollution, Noise Pollution, Thermal pollution & Nuclear Hazards. Solid wastes & their Management. Disaster Management-Flood, Drought, Earthquake, Land slides etc. Total Reference Books: 1. Agarwal KC, 2001. Environmental Biology, Nidi Publishers Ltd. Bikaner. 2. Bharucha Erach, 2003. The Biodiversity of India, Mapin Publishing Pvt. Ltd, Ahmedabad – 380013,India. Email: [email protected] 3. Brunner RC, 1989, Hazardous Waste Incineration, McGraw Hill Inc. 480pgs. 4. Clark RS, Marine Pollution, Clanderson Press, Oxofrd (TB). 5. Cunningham WP, Cooper TH, Gorhani E & Hepworth MT, 2001. Environmental Encyclopaedia, 6. Jaico Publishing House, Mumbai, 1196pgs. 7. De AK, Environmental Chemistry, Wiley Eastern Ltd. 8. Down to Earth, Center for Science and Environment (R) 9. Gleick HP, 1993. Water in Crisis, Pacific Institute for Studies in Development, Environment and Security. Stockholm Environmental Institute, Oxford University Press, 473pgs. 10. Hawkins RE, Encyclopedia of Indian Natural History, Bombay Natural History Society, Bombay (R) Heywood VH, and Watson RT, 1995. global Biodiversity Assessment. Cambridge University Press 1140pgs. 11. Jadhav H and Bhosale VM, 1995. Environmental Protection and Laws. Himalaya Publishing House, Delhi 284pgs. 12. Mckinney ML and Schoch RM, 1996. Environmental Science Systems and Solutions. Web enhanced edition, 639pgs. 13. Mhaskar AK, Matter Hazardous, Techno-Science Publications (TB) 14. Miller TG, Jr. Environmental Science, Wadsworth Publishing CO. (TB) 15. Odum EP, 1971. Fundamentals of Ecology. WB Saunders Co. USA, 574pgs. 16. Rao MN and Datta AK, 1987. Waste Water Treatment. Oxford and IBH Publishing Co. Pvt. Ltd. 345pgs. Hrs. 7 7 8 7 7 36 MA 103 ELEMENTARY MATHEMATICS C (L, T, P) = 3(3, 0, 0) Units 1 Course Contents SETS: Sets, subsets, equal sets, null set, universal set, Venn diagrams, Finite & infinite sets, open & closed sets etc., Union, Intersection, Difference and Compliment of sets, Partition of sets, Cartesian product, Inclusion & Exclusion Principle, Induction method. Hrs. 7 2 LIMITS & CONTINUITY: Limit at a point, properties of limit, computation of limits of various types of functions. Continuity at a point, continuity over an interval, intermediate value theorem. Type of discontinuities. DIFFERENTIATION: Derivative, derivatives of sum, differences, product & quotients, chain rule, logarithmic differentiation, Rolle’s theorem, mean value theorem, expansion of functions (Taylor’s & Maclaurin’s theorem.), Indeterminate forms, L’Hospital rule, maxima & minima, successive differentiation & Liebnitz theorem.’ INTEGRATION: Integral as limit of a sum, fundamental theorem of calculus, indefinite & definite integrals, methods of integration: substitution, by parts, partial fractions, integration of algebraic and transcendental functions,, reduction formulae for trigonometric functions. MATRIX & DETERMINANTS: Introduction, definition of matrix, types of matrices, algebra of matrices, determinants, minors & cofactors, properties of determinants, inverse of a matrix, adjoint of a matrix, rank of a matrix, solution of linear system of equations. Total Reference Books: 1. Shanti Narayan: Integral Calculus, S.Chand & Co. 2. Sharma, Gokhroo, Saini: Elements of matrices and Determinants, Jaipur Publishing House 3. Schum Series: Discrete mathematics, Tata Mac-Graw Hill 6 3 4 5 PE 303 MINOR PROJECT Units 1 Units 1 C(L,T,P) = 2(0,0,3) Hrs. 3 hrs weekly C(L,T,P) = 2(0,0,3) THESIS WORK Hrs. 4 hrs weekly C(L,T,P) = 9(0,0,18) Course Contents Writing of thesis work related to findings during the training period. PE 703 Units 1 Hrs. 8 hrs weekly Course Contents Development of projects discussed in minor projects PE 702 Units 1 MAJOR PROJECT DISSERTATION Course Contents Analysis and designing for proposed research work 36 C(LTP) =3(0,0,6) Course Contents Software application design PE 701 Units 1 MINOR PROJECT -I 7 Hrs. 6 hrs weekly Course Contents Development of projects discussed in minor projects PE 652 Units 1 MAJOR PROJECT 8 C(LTP) = 3(0,0,6) Course Contents Software application design PE 304 8 Hrs. 18 hrs. C(L,T,P) = 2(0,0,3) Hrs. 4 hrs weekly PT 702 Units 1 INDUSTRIAL TRAINING C(L,T,P) = 9(0,0,18) Course Contents Trainings as per the industrial requirements. Hrs. 18 hrs week SM 302 SEMINAR S.No. 1 List of Experiments Presentations on advance topics of Computers Science. SM 601 S.No. C(LTP)=1(0,0,2) SEMINAR Hours 2 hrs weekly C(L,T,P) =5 (0,0,3) List of Experiments 1 1. 2. SM 701 S.No. 1 Hrs/week. Undertaking a seminar on an assigned recent topic of the latest technical field. 3 Preparation and presentations of review articles/papers for National/International Journal, conferences, and symposiums. SEMINAR Course Contents Seminar on various topics C(L,T,P) = 2(0,0,3) Hrs. 4 hrs weekly