ࡱ> ^ ` K L M N O P Q R S T U V W X Y Z [ \ ] M .bjbj==  WWN l~~~~D2 hhh\2 L^(qqq$ Jq_qqq~~q7~q {7hGt `^B2 6|hf"7LGtm0L?N&gbGt2 2 ~~~~ APPROVED SYLLABI OF B.Tech in INFORMATION TECHNOLOGY FROM 2003 2004 ONWARDS HIMACHAL PRADESH UNIVERSITY SUMMER HILL SHIMLA-5  GROUP A (FIRST YEAR) First SemesterExam SchedulePractical ScheduleCourse No.SubjectsLTPTotalTheorySessPractSessTotalAS- 1001Applied Maths I31-410050--150AS 1002Applied Physics I21-310050--150ME 1001Engg. Graphics Drawing006610050--150HU 1003Comm. & Prof. Skills in English310410050--150EC 1001Basic Electronics31-410050--150CS 1001Introduction to Computers & Programming in C31-410050--150(PRACTICALS / DRAWING/ DESIGN)AS 1003Applied Physics Lab--22-5050100EC - 1002Basic Electronics Lab--22-5050100ME-1002/ 1004/IT-1001(Workshop Practice I/ II) / (Information Technology Trainer Workshop I/II) 1-34-5050100CS 1002Computer Programming Lab.--22-5050100Total15515356003002002001300 Note: In campus 4 week vocational training for all branches will be held after the second semester and credit for the same will be given in the IIIrd Semester. In place of this UIIT will go for this 4 week vocational training during winter vacation at the end of Ist Semester. However, Credits for the same will be given in the IIIrd Semester. University Institute of Information Technology (UIIT) will offer Information Technology Trainer Workshop I/II (IT-1001) in place of Workshop I/II.(ES-1005)  GROUP B (FIRST YEAR) Second SemesterExam SchedulePractical ScheduleCourse No.SubjectsLTPTotalTheorySessPractSessTotalAS- 1006Applied Maths II31-410050--150AS 1007Applied Physics II31-410050--150AS 1004/ IT 1002Chemistry/ Foundation of Information Technology31-410050--150HU- 1002Science, Technology & Society31-410050--150EE 1001Basic Electrical Engineering31-410050--150ME 1003Basic Mechanical Engineering31-410050--150(PRACTICALS / DRAWING/ DESIGN)AS 1005/IT 1003Applied Chemistry Lab/ MATLAB Laboratory--22-5050100EE 1002Basic Electrical Engg. Lab--22-5050100ME 1004/ IT 1004(Workshop Practice II/I)/ (Information Technology Trainer Workshop II/I)1-45-5050100ME 1005Basic Mechanical Engineering Lab--22-5050100Total19610356003002002001300 Note: University Institute of Information Technology (UIIT) will have the option to offer Foundation of Information Technology (IT - 2001) in place of Chemistry (AS-2003) and MATLAB Laboratory (IT - 2002) in place of Applied Chemistry Laboratory (AS-2004). However, there will be no change in the scheme for all other affiliated Technical Institutes of the University.  Third Semester (Information Technology)Exam Schedule Practical scheduleCourse No.Subjects LTPTotal Theory SessPract SessTotal HU-3001Fundamentals of Economics31-410050--150IT 3001Computer Organisation31-410050--150IT 3002Object Oriented Methods & Programming31-410050--150IT 3003Data Structures & Algorithms31-410050--150IT 3004Computer Graphics31-410050--150EC 3001Digital Electronics 31-410050--150(PRACTICALS/ DRAWING/ DESIGN)EC- 3002Digital Electronics Laboratory--22--5050100IT- 3005Data Structure laboratory--22--5050100IT- 3006Object Oriented Methods & Programming Lab--44--5050100IT- 3007Computer Graphics Lab --22--5050100Total18610346003002002001300  Fourth Semester (Information Technology)Exam Schedule Practical scheduleCourse No.Subjects LTPTotal Theory SessPract SessTotal IT 4001Computer Architecture31-410050--150IT- 4002Operating System Concepts31-410050--150IT- 4003Discrete Mathematics & Logic Design31-410050--150EC 4001Digital Communication 31-410050--150IT- 4004System Analysis and Design31-410050--150AS 4001Probability/Statistics/Queuing Theory31-410050--150PRACTICALS / DRAWING /DESIGN)IT- 4005Operating System Lab (Windows NT)--22--5050100IT- 4006Operating System Lab II ( LINUX/UNIX lab)--22--5050100EC 4002Digital Communication Lab--22--5050100IT- 4007SAD Project--22--5050100Total1868326003002002501300 Fifth Semester (Information Technology)Exam Schedule Practical scheduleCourse No.Subjects LTPTotal Theory SessPract SessTotal IT- 5001Software Engineering31-410050--150HU 5001Management for IT Professionals31-410050--150IT 5002Database Management System31-410050--150IT 5003Computer Networks31-410050--150IT 5004Visual Programming31-410050--150EC 5001Microprocessor, Micro computers and Interfaces31-410050--150PRACTICALS / DRAWING /DESIGN)IT/EC 5005Microprocessor and Computer Network laboratory--22--5050100IT 5006Visual Programming Laboratory--22--5050100IT 5007RDBMS Laboratory--22--5050100ES - 5001Vocational Training ------5050100Total18610346003002002001300  Sixth Semester (Information Technology)Exam Schedule Practical scheduleCourse No.Subjects LTPTotal Theory SessPract SessTotal IT 6001Management Information System31-410050--150IT 6002Web Technology31-410050--150AS 6001Numerical and Stat Methods & Scientific Computing31-410050--150IT 6003Artificial Intelligence 31-410050--150IT 6004Multimedia Technology31-410050--150IT- 6005Parallel Computing31-410050--150PRACTICALS / DRAWING /DESIGN)IT- 6006Artificial Intelligence Laboratory--22--5050100IT- 6007Web Technology Laboratory--22--5050100AS 6002Scientific Computing Laboratory/ Parallel Computing Laboratory--22--5050100IT- 6008Multimedia Technology Laboratory-22--5050100GP 6001Seminar-------Total1868346003002002001300  Seventh Semester (Information Technology)Exam Schedule Practical scheduleCourse No.Subjects LTPTotal Theory SessPract SessTotal IT 7001Natural Language Processing31-410050--150IT 7002Modeling & Simulations31-410050--150IT 7003e-Commerce & ERP31-410050--150IT 7004Internet Technology31-410050--150XX-XXXOpen Elective I31-410050--150XX-XXXProfessional Elective I31-410050--150PRACTICALS / DRAWING /DESIGN)IT 7005Internet Technology Lab--22--5050100IT 7006Modeling and Simulation Laboratory--22--5050100IT 7008E- Commerce Laboratory--22--5050100IT 7009Project I--44--5050100ES - 7001Vocational Training *------5050100Total18610326003002502501400 *Note: 6 Week training  Eighth Semester (Information Technology)Exam Schedule Practical scheduleCourse No.Subjects LTPTotal Theory SessPract SessTotal IT 8001Human Computer Interaction User Interface Design31-410050--150IT 8002Security of Information Systems/ Internet Security31-410050--150IT 8003Data Warehouse and Data Mining31-410050--150XX-XXXOpen Elective II31-410050150XX-XXXProfessional Elective II31-410050150PRACTICALS / DRAWING /DESIGN)IT 8004*Project-II/ Industrial Training--88150100250IT- 8005Project Seminar--445050100GP 8001General Fitness for the Profession Seminar & G.D------5050100Total15512325002502502501200 - This will start with training in winter vacation for the students of UIIT  Professional Electives- IIOpen Electives IIIT-8006GPS and ApplicationIT-8012Development of Knowledge Management*IT-8007Mobile Computing*EC-8001Computer Based Measurement and Control*ES-8001Neural NetworksIT-8013Professional Issues in IT.IT-8008Multilingual Applications *EC-8002VLSI TechnologyIT-8009Speech Image & Coding*IT-8014Computer Aided Fine ArtsIT-8010Computer Network ManagementCS-8001Quantum ComputersIT-8011Digital Image ProcessingIT-8015Bio-informatics Professional Electives- IIOpen Electives IIIT-8006GPS and ApplicationIT-8012Development of Knowledge Management*IT-8007Mobile Computing*EC-8001Computer Based Measurement and Control*ES-8001Neural NetworksIT-8013Professional Issues in IT.IT-8008Multilingual Applications *EC-8002VLSI TechnologyIT-8009Speech Image & Coding*IT-8014Computer Aided Fine ArtsIT-8010Computer Network ManagementCS-8001Quantum ComputersIT-8011Digital Image ProcessingIT-8015Bio-informaticsCODES: AS Applied Science HU Humanities ES Engineering Science EC Electronics & Communication EE Electrical Engineering IT Information Technology CS Computer Science GP General Proficiency * Titles approved contents of courses to be decided later. B.TECH Ist Year (Common to all Branches) Group - A Applied Maths I (AS 1001) Course CodeAS-1001  Credits-4L-3, T-1, P -0Name of the CourseApplied Maths - ILectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50 Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Function of several variables, limits and continuity, partial derivatives, higher order partial derivatives, Eulers theorem, Jacobians, maxima and minima of functions of two variables. Lagranges method of multipliers, double and triple integrals, change of variables, applications of double and triple integrals, beta and gamma functions Section B Reduction formulae, definite integral as limit of a sum, area under a curve, length of an arc of a curve. Linear differential equations of second order with constant coefficients: complementary functions, particular integrals, Euler homogeneous form, and variation of parameters. Convergence of series, Taylors theorem with remainder, power series expansion of functions, Taylors and Maclaurins series. Section C Matrices: review of properties of determinants. Elementary operations on matrices. Homogeneous and nonhomogenius system of linear equations and their properties, bilinear, quadratic, hermitian and skew hermitian forms. Eigenvalues of hermitian, skew- hermitian and unitary matrices. Section D Complex analytic functions: brief review of complex numbers, complex variable, concept of limit, continuity and derivatives of analytical function, cauchy- riemann equations, harmonic functions, complex series, some elementary functions, logarithm Books: Kryszig, Thomas- Finny, Advanced Engineering Mathematics. S.S. Sastri, Engineering Mathematics, ( 2nd edition) Vol-I and Vol-II. B.S. Grewal, Higher Engineering Mathematics. Piskunov, Differential and Integral Calculus. R.K. Jain and S.R.K. Iyengar, Advanced Engineering. Mathematics. Michael D. Greenberg, Advanced Engg. Mathematics. Applied Physics I (AS 1002) Course Code AS 1002 Credits-3L- 3, T-1, P-0Name of the CourseApplied Physics ILectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Physical optics: Interference- division of wavefront-fresnels biprism, division of amplititude, interference by Newtons rings, michelsons interferometer and its applications Diffraction- difference between fraunhofer and fresnel diffraction through slit, plane transmission grating, its dispersal and resolving powers Polarization- polarized and unpolarised light,double refraction, nicol prism, quarter and half wave plates, polarimetry. biquartz and laurents half shade polarimeters, simple concepts of photoelasticity. Special theory of Realitivity: Michelson-Moreley experiment, Realitivistic transformations,Variation of mass with velocity, mass energy equivalence. Section B Wave and oscillations: Simple harmonic oscillations, simple concepts of harmonic oscillator, resonance, quality factor, E.M wave theory, Review of basic ideas, Maxwells equations and their experimental basis. Simple plane wave equations, simple concepts of wave-guides and co-axial cables, poynting vector. Dielelectrics: Molecular Theory, polarization, displacement susceptibility, dielectric coefficient, permitivity and various relations between these Gausss law in the presence of dielectric, energy stored in an electric field. Behaviour of dielectric in field simple concepts, dielectric losses. Section C Quantum Physics: Difficulties with classical physics, Introduction to quantum mechanics-simple concepts, discovery of Plancks constant.De Broglie Waves, Phase and Group Velocities, Particle diffraction, Uncertainty Principle, the wave equation., Postulates of quantum mechanics, Time dependent and independent Schrodinger equation, Expectation Values, Eigen Values and Eigen functions, Particle in a box, Finite Potential Well, Tunnel Effect, Harmonic oscillator. Statistical distributions, Maxwell Boltzmann Statistics, Quantum statistics. Section D Nuclear Physics: Neutron cross-section, nuclear fission, moderators, nuclear reactors, reactor criticality, interaction of radiation with matter-basic concepts, Radiation Detectors-ionization chamber, G.M counter, scintillations & solid state detectors, cloud Chamber & bubble chamber Books: Arthur Beiser, Concepts of Modern Physics, 5th International edition Tata McGraw Hill Wehr, Richards & Adair , Physics of the Atom. A.S.Vasudeva, Modern Engg. Physics- Engg. Graphics Drawing (ME 1001) Course Code ME 1001 Credits-6L- 2, T-0, P-4Name of the CourseEngg. Graphics DrawingLectures to be Delivered66 (L= 22, P=44)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Min. Pass Marks: 50%Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. This course will be conducted in drawing hall fitted with drawing tables and drafters. Section A Drawing Techniques: Various types of lines, principal of dimensioning, size and location as per IS Code of practice (SP-46) for general engg. Drawing. Practice of drawing, various types of lines and dimensioning exercises. Drawing exercises pertaining to symbols. Conventions and Exercise of lettering techniques. Free hand printing of letters and numerals in 3, 5, 8 and 12mm sizes, vertical and inclined at 75 degree. Instrumental lettering in single stroke. Linear Scale, Diagonal scale & vernier scale. Projection Of Points, Lines And Planes: Concept of horizontal and vertical planes. First and third angle projections: projections of point and lines, true length of lines and their horizontal and vertical traces, projection of planes and their traces. Auxiliary planes. Section B Projections Of Solids: Right regular solids of revolution and polyhedrons etc. and their auxiliary views Section - C Sectioning Of Solids: Principal of sanctioning, types of sanctioning, and their practice on projection of solids, sectioning by auxiliary planes. Isometric Projections: Concept of isometric views: isometric scale and exercise on isometric views. Section D Practice In: Orthographic projections Development Of Surfaces: Development of surfaces of cylinders, cones, pyramid, prism etc. Exercises involving development of unique surfaces like Y-piece, hopper, tray, truncated pieces etc. Intersection Of Surfaces: Intersection of cylinders, cones and prisms with their axes being vertical, horizontal or inclines. Exercise on intersection of solids-cylinder and cylinder, cylinder and cone, prism and prism. Note: Some exercises in each Section should be done using Auto CAD. books: N.D. Bhatt, Elementary Engineering Drawing. P.S. Gill, Engineering Drawing & Engg. Graphics. L.V. Lakshminarayan & R.S. Vaish. Engineering Graphics. N.D. Bhatt and V.M. Panchal, Engineering Drawing Plane and Solid Geometry, 44th Edition 2002, Charotar Publishing House,. James D. Bethune, Engineering Graphics with AutoCAD 2002, Publisher Pearson Education. P.S. Gill, Engineering Graphics and Drafting, S.K. Kataria and Sons Millennium Edition. T.Jeyapoovan, Engineering Graphics using AUTOCAD 2000, 1st Edition 2002, Vikas Publishing House. K. Venugopal: Engineering Drawing and Graphics + AutoCAD, 4th Edition, New Age International Publishers Ltd. New Delhi. Communication & Professional Skills in English (HU 1003) Course CodeHU-1003 Credits-4L 3, T-1, P- 0Name of the CourseCommunication & Professional Skills in EnglishLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50 Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. SECTION A Reading Skills: The skill of effective reading - eye movements, fixations, regression and visual wandering, the right approach to reading.;Factors affecting the style of reading - reader related material related and environmental; Memory, retention, association of read material. Kinds of Reading: Introduction to phonetics - familiarization with speech sounds and their symbols - articulation of speech sounds - stress and intonation. Grammar: Word building use of punctuation marks, articles, tenses, abbreviations, prepositions, idioms & phrases transformation of sentences, incorrect to correct English, single word for a group of words. SECTION B Writing Skills: Business letters: principles, structure and style of writing business letters i.e., sales letters, claim and adjustment letters, inviting quotations/tenders, writing a memo, job application letters, preparing a personal resume; Effective Meetings : Qualities i.e. planning, processing the discussion, conducting a meeting use of different type of questions, summaries, handling problem situations and problem people, writing notices, agenda, and minutes of meetings; Report writing : Characteristics, types of reports, structure of technical/research reports, preparatory steps to report writing; Elements of style : Definition of style, characteristics of a good technical style - practical hints to improve the style of writing; Precis writing; Comprehension of passages ( May be picked up from the books recommended for reading). SECTION C Listening Skills: Barriers to listening, effective listening and feedback skills; Telephone techniques - Considerations of listening and voice, developing telephone skills - preparing for the call, controlling the call, follow up action. Handling difficult calls and difficult callers. SECTION D Speaking And Discussion Skills: Effective speaking: Preparation i.e., deciding the objective, preparing the environment, organizing the material, selection of words, voice modulation, speed, expression, body language, dealing with questions, dealing with nervousness, presentation of audio-visual aids; Group Discussion: The art of participating in group discussion i.e., initiative, cooperation with group members, analysis of the issue, putting one's views effectively, establishing leadership. Assignments/ seminars/ discussions may be given for following skill development. Word processing a document Report writing Preparing agenda for meeting Preparing minutes of the meetings/seminars Press Releases Preparing a Brochure Advertisements Preparing a power point slide show on a PC/ OHP Any other exercise decided by the course Professor. RECOMMENDED BOOKS 1. Sheila HA Smith, M and Thomas, L., Methuen, Reading to Learn; London, 1982. 2. McGraw, SJ; Basic Managerial Skills for all, Prentice Hall of India, New Delhi 1991 3. Technical Reporting Writing British Association for commercial and Industrial Education, BACIE, 1972 4. Chrissie Wright (Ed.); Handbook of Practical Communication Skills; JAICO Books. 5. K.K. Sinha, Business Communication, Galgotia Publishing Company, New Delhi, 1999. 6. English Grammar 7. David Cameron, Mastering Modern English. 8. Robert L Shuster, Written Communication in Business. 9. Ron Ludlow & Ferous panton, The Essence of Effective Communication. 10. Ragmond & Petit, business Communication. 11. Common Errors in English, by Sudha Publications (P) Ltd., B-5, Prabhat Kiran Building, Rajendra Place, New Delhi 110 008. 12. Abul Hashem, Common Errors in English, Ramesh Publishing House, Daryagang New Delhi. 13. Objective English by Tata McGraw Hill Publishing Co. Ltd. New Delhi. 14. R.K. Bansal & J.B. Harrison, Spoken English for India, Orient Longman. 15. Veena Kumar, The Sounds of English, Makaav Educational Software, New Delhi. 16. R.C. Sharma & Krishana Mohan, Business Correspondence and Report writing, Tata McGraw Hill Publishing Co. Ltd. New Delhi. 17. Group Discussion by Sudha Publications and Ramesh Publishing House, New Delhi. RECOMMENDED READINGS 1. Business @ The Speed of thought, Bill Gates. 2. My Experiments with Truth, M.K. Ghandhi.. 3. Wings of Fire, A.P.J. Kalam 4. An Autobiography, Jwahar Lal Nehru. Basic Electronics (EC 1001) Course CodeEC- 1001 Credits-4L 3 , T- 1, P-0Name of the CourseBasic ElectronicsLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50 Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Brief review of Band Theory, Transport phenomenon in semiconductors, Electrons and Holes in Intrinsic semiconductor, Donor and acceptor impurities, charge densities in semiconductor. PN Junction, Reverse and Forward Bias conditions, Diode Characteristic and parameter, Ideal vs Practical diode, equivalent circuits and frequency response, rectification-half and full wave, Zener and Avalanche Diode. Section B Bipolar junction transistor (BJT), Junction Field effect transistor ( JFET) and metal oxide semiconductor (MOSFET) and their characteristics as circuit and gain elements Two port network analysis, h-parameter and trans-conductance, equivalent circuits for FET, CE, CB and CC amplifiers and comparison of their circuit parameters Unijunction transistor (UJT), UJT characteristics, parameters and circuit operation. Photo transistor Section C Bias for transistor amplifier: fixed bias, emitter feed back bias. Feedback principles. Types of feedback, Stabilization of gain, reduction of non-linear distortion, change of inputs and output resistance by negative feed back in amplifiers. Amplifiers coupling, types of coupling, Amplifier pass band, Eq circuits for BJT at high frequency response of CE, RC- Coupled amplifiers at mid, low and high frequencies. Section D Semi Conductor processing, active and passive elements, integrated circuits, bias for integrated circuits. Basic operational amplifiers, Application of operational amplifiers- adder, subtractor, integrator, differentiator and Comparator. Books: A.P. Malvino , Electronic Principles. J.D. Ryder Electronic Fundamentals and Applications. J. Millian and C.C. Halkias, Integrated Electronics J. Millman and C.C. Halkias , Electronic Circuits and Devices. N.N. Bhargava & Kulshrestha: Electronic Devices. Course CodeCS-1001 Credits-4L 3, T-1, P-0Name of the CourseIntroduction To Computers & Programming In CLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50 Introduction to Computers & Programming in C (CS 1001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Fundamental Computer Concepts; Operating system fundamentals, disk basics, VDU Basics, Keyboard basics. Introduction to compiler, interpreter, assembler, liner and loader and their inter relationship. Introduction to Basics of Information Technology. Section B Problem Solving with Computers : Algorithms , pseudocodes and Flowcharts, Debugging, testing, and documentation, structure-programming concepts, top down and bottom up design approaches. Data Types, Constants, variables, arithmetic and logical expressions, data inputs and output, assignments statements, conditional statements. Section C Iteration, arrays processing, Use-defined data types, functions, functions, recursion, parameter passing by reference and by value. Section D Structure, Multiple structure, Arrays of structure, Unions, Files: reading, writing text and binary files, pointers , Character pointers, pointers to arrays, arrays of pointers to structures. (The programming language C is to be taught along with the course in detail) Books: Kanetkar, let Us C, BPB Publications Richie and Kerningham , C Programming V Rajaraman Fundaments of computers D. Dromey, How to solve it by computers ( Prentics- Hall ) E. Balaguruswamy, Programming in C , Tata M.Graw Hill Applied Physics Lab (AS 1003) Course CodeAS-1003 Credits-2L 0, T-0, P- 2Name of the CourseApplied Physics LabLectures to be Delivered26 hours of Lab work (2 hours per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 40 Maximum Time:3hrs Continuous Assessment Lab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25 Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical exercises assigned by the examiner (25 marks). Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of Experiments Note: (Two experiments to be done from each section, total number of experiments required to be performed 10 to be decided by the teacher concerned and availability of equipment) Optics & Waves: Section A To find the wavelength of sodium light by Newtons rings experiment. To find the wavelength of sodium light by Fresnels Biprism experiment. To find the wavelength of sodium light by using the phenomenon of diffraction of light at a straight edge To find the wavelength of various colours of white light with the help of a plane transmission diffraction grating To find the wavelength of sodium light by Michelson interferometer Section B To find the refractive index and cauchys constant of a prism by using spectrometer To find the resolving power of a telescope To study the beam parameters of a helium-neon laser. To find the specific rotation of sugar solution by using a polarimeter To find the velocity of Ultrasonic Waves in a given liquid. To find the specific rotation of sugar using polarimeter. Electricity and Magnetism Section C To compare the capacitances of two capacitors by Desauty Bridge To find the flashing & quenching potentials of Argon & also to find the capacitance of unknown capacitor To find the temperature coefficient of resistance by using platinum resistance thermometer and Callender & Griffithbridge Section D To find the frequency of AC mains by using sonometer To find the low resistance by carrey Fosters bridge. To find the resistance of a galvanometer by Thomsons constant difelection method using a post office box. To find the value of high resistances by Substitution method. To find the value of high resistances by Leakage method. To convert a galvanometer into an ammeter of a given range. To study the variation of magnetic field with distance and to find the radius of coil by Stewart and Gees apparatus. The find the reduction factor of two turn coil of tangent galvanometer by using a copper voltameter. Modern Physics: Section E To find the value of e/m for electrons by Helical method. To determine the charge of an electron by Millikans oil drop method. To find the ionization potential of Argon/ Mercury using a thyratron tube. To find the value of Plancks constant by using a photoelectric cell. Section F To study the various crystal structures using Beed Model. To calculate the hysteresis loss by tracing a B-H curve for a given sample. To determine the band gap of an intrinsic semiconductor by four probe method. To Determine the resistivity of a semi-conductor by four probe method at different temperatures. To determine the Hall co-efficient To study the photovoltaic cell & hence to verify the inverse square law BOOKS: Practical Physics S.L. Gupta & V.Kumar Advanced Practical Physics Vol. I & II S.P. Singh Practical physics for B.Sc I, II and III, C.L. Arora. Course CodeEC-1002 Credits-2L 0, T-0, P- 2Name of the CourseBasic Electronics LabLectures to be Delivered24 hours of Lab work (2 hours per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 40% Maximum Time:3hrsLaboratory Continuous Assessment Lab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25 Basic Electronics Lab (EC 1002) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of Experiments: 1. (a) To study the use and scope of using an oscilloscope as a measuring device in an electronic laboratory. (b) To study the use and scope of using a multimeter (digital and analog) as a measuring device in an electronics laboratory. (c) To study the use and scope of function generator as a signal source in an electronics laboratory. Set up an experiment to: 2. Draw forward bias and reverse bias characteristics of a pn junction diode and use it as a half wave and full wave rectifier. Draw the characteristics of a zener diode and use it as a voltage regulator. Draw characteristics of common base configuration of pnp transitor. Draw characteristics of common emitter configuration of an npn transitor. Draw characteristics of common drain configuration of a MOSFET Find the voltage and current gain of single stage common emitter amplifier. Draw the characteristics curve of UJT. Find the voltage gain of single stage voltage series feedback amplifier. Use operational amplifier as Inverting amplifier Non-inverting amplifier Comparator Use operational amplifier as Integrator Differentiator Use operational amplifier as Adder Precision amplifier Find the overall voltage gain and current gain of a two stage RC coupled amplifier. Basic electronics should stress on interfacing with real life devices and general purpose linear units. Emphasis is on system design and not on discrete components, some of the components around which excercises can be built are SCR as triacs and power control Power supplies starting with zener Op to compliers and isolations where photo diode, transistors, leds are used. Laser diode (laser pointer) Op amps Op amps for instrument amplifiers. Note:- Record to be maintained in the laboratory record book for evaluation. Usage of bread board approach to be encouraged. Course CodeME-1002 Credits-4L -1, T-0, P- 4Name of the CourseWorkshop Practice ILectures to be Delivered65 Hours (2 hr. each) (L=13, Lab sessions = 26 (2 hrs each))Semester End Examination Max. Marks: 50Min. Pass Marks: 40Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25 Workshop Practice I (ME 1002) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of Experiments: - Fitting Shop: - Introduction to the tools used in Fitting Shop and various processes in Fitting shop To make a square piece of mild steel. To make V-matching joint of mild steel. To make a V-notch Machine Shop: - Introduction to various machine tools and machine parts, such as Lathes, drilling machine, grinders etc. Cutting tools and operations. Facing and turning on mild steel rod on Lathe Machine to make a groove on lathe machine. Taper turning operation on Lathe Machine. Carpentry and Pattern making Shop: - Carpentry and Pattern Making Various types of timber and practice boards, defects in timber, seasoning of wood, tools, operations, and joints. Introduction to the tools used in carpentry shop To make the T lap joint. To make T Dove-tail joint. To make Mortise & Tennon joint. Welding Shop: - Introduction to different welding methods, welding equipment, electrodes, welding joints, awareness of welding defects. To make a lap joint. To make a T joint. To make a V- butt joint. Smithy and Forging: - Introduction to forging tools, equipments and operations, Forgability of metals. To make a ring of mild steel by cold forging process. To make S-hook by hot forging process. .To make chisel by hot forging process. Foundry Shop: - Introduction to moulding materials, moulds, use of cores, melting furnaces, tools and equipment used in Foundry. Make a single piece pattern mould To make split pattern mould To make mould and core and assemble it. Electrical and Electronics Shop:- Introduction to electric wiring Exercises Preparation of PCBs, involving soldering of electrical & electronic application BOOKS:- 1. Workshop Technology by Chapman 2. Manufacturing Processes by Begman 3. Manufacturing Materials and Processes by JS Campbell NOTE: Industrial visits can be undertaken to various industries available in the vicinity of the concerned Engineering College. One project at the end of semester has to be submitted by a group of six students Course CodeME-1004 Credits-4L -1, T-0, P-3Name of the CourseWorkshop Practice IILectures to be Delivered52 Hours (L=13, Lab Sessions= 20 (2hrs each))Semester End Examination Max. Marks: 50Min. Pass Marks: 40 Maximum Time:3hrsLaboratory Continuous Assessment Lab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25 Workshop Practice II (ME 1004) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of Experiments: - Fitting Shop: - Drilling and Tapping in a M.S. piece To make a male - female joint (Taper type) of mild steel. Machine Shop: - To perform boring operation on lathe machine To perform knurling and threading operation on lathe machine Step turning operation on a lathe machine. Carpentry and Pattern making Shop: - To make a single piece pattern of connecting rod To make a self cod pattern To make a split pattern Welding Shop: - To make a V butt joint in horizontal position To make a V butt joint in vertical position To perform Gas Welding operation. Smithy and Forging: - To make a cube from a circular bar. To make a tong using hot forging operations To perform drawing down operation Foundry Shop: 1. To make a mould and perform casting operation Study of casting defects and its remedies BOOKS: 1. Workshop Technology by Chapman 2. Manufacturing Processes by Begman 3. Manufacturing Materials and Processes by JS Campbell NOTE: Industrial visits can be undertaken to various industries available in the vicinity of the concerned Engineering College. One project at the end of semester has to be submitted by a group of six students Information Technology Trainer Workshop I (IT 1001) Course CodeIT-1001 Credits-4L -1, T-0, P-4 Name of the CourseInformation Technology Trainer Workshop ILectures to be Delivered63 (L= 13, Lab Sessions = 20 (2 Hr Each))Semester End Examination Max. Marks: 50Min. Pass Marks: 40 Maximum Time:3hrsLaboratory Continuous Assessment Lab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25 Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. This workshop will provide training of hardware and software theory of a computer based on Pentium IV CPU with windows 98 as an operating system with DMP/ Deskjet Printer/ Laser Printer. Study of Computer Mother board- CPU, DMA, Wait state, RAM/ROM, NMI, Logic Address, reset, I/O Ports, Device Drivers, Power Management, Block Diagram. Study of bus, Slots and Ports- ISA, EISA, VESA, PCI, MCA, AGP, USB, AMR Parallel, Serial RS 232C, USB Study of Memories on a PC- Memory - Types, Selection, Installation ROM BIAS - Types, Setup, Installation Floppy Drive Types, R/W head, Control Card, Spindle Motor, Stepper Motor, Termination Resistor, Block Diagram, write protect, Testing. Hard Disk- Jumper Setting, configuration, HDC, Installation Software, Testing, Block Diagram. Study of Input/ Output Devices- Monitor Types, Working Principle, Configuration, modes, Scanning, Block diagram Adapter Cards Types, Dot pitch, Resolution Keyboard Types, Construction, Working Principle. Mouse Types, Construction, Working Principle Study of Hardware, Accessories (Mechanical/ Electrical)- Cabinet Types, Selections S.M.P.S. Rating, Green PC, EPA Compliance Cables HD Cable, FDD Cable, Printer Cable. Connectors 9 pin M/F. 25 Pin M/F Study of Printers Printers Types, construction, working Principle, Fonts, Desk Jet, Dot Matrix, Laser Jet, Line Printers, Plotters, Block Diagram Study of Multimedia Hardware Modules CDROM drive jumper setting, Installation, Cables, Block diagram, Configuration DVD drive Types, Working Principle, Installation, Configuration Speakers/Mike Different Types Tuner Cards Different Types Digital Cameras Different types Video Conferencing Kit. Study of Clean Power Supply Equipments CVTs UPS NOTE : Industrial visits can be undertaken to various industries available in the vicinity of the concerned Engineering College/ Institutes. One project at the end of semester has to be submitted by a group of six students Computer Programming Lab (CS 1002) Course CodeCS-1002 Credits-2L 0, T-0, P- 2Name of the CourseComputer Programming LabLectures to be Delivered26 hours of Lab work (2 hours per week) Semester End Examination Max. Marks: 50Min. Pass Marks: 40 Maximum Time:3hrsLaboratory Continuous Assessment Lab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. Dos 6.2(through ms-dos prompt, usage of basic commands, idea of .bat, .sys, .com, .exe files etc, and usage of an editor to be done in consultation with the faculty incharge for the course) Windows (usage of GUI for working effectively in laboratory to be done in consultation with the faculty incharge for the course) Microsoft office(projects based on word, excel, power point, access, to prepare reports, presentations and databases to be done in consultation with the faculty incharge for the course) Programming of fundamental algorithms in c in the form of projects in groups of two (based on how to solve it , Dromey and let us c by Kanitker and in consultation with the faculty incharge for the course). List of Lab excercises to be displayed in advance covering whole of the course. Tentative list is given below to be developed in the form of Projects. 10 more excercises to be added by the faculty incharge. Write a program to find the largest of three numbers (if-then-else) Write a program to find the largest number out of ten numbers (for-statement) Write a program to find the average mail height & average female heights in the class (input is in form of sex code, height). Write a program to find roots of quadratic equation using functions and switch statements. write a program using arrays to find the largest and second largest no. Write a program to multiply two matrices Write a program to read a string and write it in reverse order Write a program to concatenate two strings Write a program to sort numbers using the Quicksort Algorithm. Represent a deck of playing cards using arrays. Note: -Record to be maintained both electronically and hard copy for evaluation Group - B Applied Maths II (AS 1006) Course CodeAS-1006 Credits-4L 3, T- 1, P-0Name of the CourseApplied Maths IILectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Vector Calculus: Curves, arc length, tangent, curvature and torsion. Directional derivative, Gradient of a scalar field, divergence and curl of a vector field. Line, surface and volume integrals, theorem of Gauss, Stokes and Greens (proofs not needed), consequences and applications. Section B Integral Transforms: Fourier series, Eulers formula, even and odd functions, half range expansions. Fourier integral. Fourier and Laplace transform, Inverse transform, Laplace transform of derivatives and integrals, Shifting theorem, application to periodic functions, unit step function, impulse function. Secton C Second order Differential Equations, Solution by: Power series method and its basis, Solution of Bessel and Legendre differential equations, properties of Bessel and Legendre functions. Section D Partial Differential Equations (PDE): Formulation and classification. Solution of wave equation, heat equation in one dimension and Laplace equation in two dimensions by the method of separation of variables Books: E Kreyszig, Advanced Engineering Mathematics (Wiley Eastern Pvt Ltd) S.S. Sastri , Engineering Mathematics, ( 2nd edition) Vol-I and Vol-II. B.S. Grewal, Higher Engineering Mathematics. Piskunov, Differential and Integral Calculus. R.K. Jain and S.R.K. Iyengar, Advanced Engineering. Mathematics. Michael d. Greenberg, Advanced Engg. Mathematics. Applied Physics II (AS 1007) Course CodeAS-1007 Credits-4L 3, T- 1, P-0Name of the CourseApplied Physics - IILectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Crystal Structure: Space lattice, unit cell and translation vectors, miller indices, Simple crystal structure, bonding in solids, Experimental x-ray diffraction method, laue method, powder method Free electron theory: Elements of classical free electron theory and its limitations, Quantum theory of free electrons, Fermi level, density of states, fermi dirac distribution function, Thermionic emission, Richardsons equation Section B Band Theory of Solids: Origin of energy bands, kronig, Penney Model (qualitative), E-K diagrams, Brillouin Zones, Concept of effective mass and holes, Classification into metals, semiconductors and insulators, fermi energy & its variation with temperature Section C Photoconductivity & Photovoltaics: Photoconductivity in insulating crystals, variation with illumination, Effect of traps, application of photoconductivity, Photovoltaic cell & their characteristics Properties of Solids: Atomic Magnetic Moments, Orbital Diamagnetism, Classical Theory of Para magnetism, Ferromagnetism Molecular Field theory and Domains, Magnetic circuit, Its Comparison with Electric circuit and its Applications, Super Conductor (Introduction, Types and Application), Hall Effect Section D Laser: Spontaneous and stimulated emission, Laser action, Characteristics of Laser Beam-Concept of coherence, Types of lasers based on pumping techniques, He-Ne Laser. Semiconductor Laser (Simple Ideas) with applications Fibre Optics: Optical communication: Communication through open space , optical wave guides with special reference to Propagation of light in Fibers, Numerical Aperture, single mode and multi-mode Fibers, applications. Books: Charles Kittel; Introduction to Solid State Physics. B.S.Saxena,R.C.Gupta & P.N.Saxena; Solid state Physics. M.B.Avadhanulu & P.G.Kshirsagar, A Text Book of Engineering Physics. Arthur Beiser , Concepts of Modern Physics, 5th International edition Tata McGraw Hill. A.J Dekkar , Introduction to solid state Physics. Chemistry (AS 1004) Course CodeAS-1004 Credits-4L 3, T- 1, P-0Name of the CourseChemistry Lectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Thermodynamics - Second law concept of Entropy, Entropy change for an ideal gas, free energy and work functions, Free energy change, Gibbs Helmholtz eqation, Clausius Clapeyron eqation, Related numerical problems with above topics. Phase Rule: Introduction, One Component System, Two Components System (Water, Sulphur and Alloy System), thermal Analysis, auxiliary. Section B Water Treatment; Introduction, Sources of water, Impurities, Hardness, Analysis, Oxidations, (BOD & COD), Boiler Corrosion Sewage & Treatment. Pollution and Control: Introduction, Causes/Reasons, Types of Pollutions, Air, Water, Soil and Radioactive Pollutions &Controls. Corrosion and Its Controls: Introductions, types of Corrosions, Electrochemical Theory, Pitting, Water Line, Differential Aerations Corrosions, Stress Corrosions, Factors affecting Corrosions, Preventive measures. Section C Lubricants: Introductions, Frictions and Wear, Lubricants, Mechanism of Lubrication, Base Oil, Additives, Greases and Emulsions. Fuel and Combustion: Introduction, class of fuels (Solid, Liquid and Gases), Coal & its origin, Analysis of Coals, Petroleum fuels, Crude Petroleum and its refining , Cracking, Hydrofinishings & Diesel, Kerosene, Gesoline as fuels. Gases fuels, Water Gas, Gio- Gas, nuclear Fuel, Breeder Reactors. Section D Solid State Chemistry: Introduction, Lattices & Periodicity, Elements of Band Theory, Conductors, Insulators and Semi- Conductors, Structure Determination by I.R. NMR, X-Ray UV, Mass Spectroscopy. Catalysis: Introduction, criteria of Catalysts, Types of Catalyst, Enzyme Catalysis, Mechanism of Catalysis, (Homogeneous & Hetrogeneous Catalysis). Books: Engineering Chemistry: By P.C. Jain & Monika Jain, Dhanpat Rai and Sons. A Text Book of Engineering Chemistry:- Bu Shastri Chawla, Dhanpat Rai & Sons. Physical Chemistry: By R.P. Verma, Pardeep Publishers Jallandhar. Principles of Physical Chemistry: By Puri, Sharma, Pathania, Shobhan Lal Nagin Chand & Co. Chemistry in Engineering & Technology, Vol. I & Vol. II, Rajaram, Kuriacose (TMH). Physical Chemistry, P.W. Atkin (ELBS, Oxford Press). Physical Chemistry, W.J. Moore (Orient Longman) Foundation of Information Technology (IT 1002) Course CodeIT- 1002 Credits-4L 3, T- 1, P-0Name of the CourseFoundation of Information TechnologyLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Information concept & Processing: Definition of Information, Need for Information, Quality of Information, Value of Information, Categories and Levels of Information in Business Organization, Data concepts and Data Processing, data Representation-Number System. Computer Appreciation: Definition of an Electronic Digital Computer, History, Generations, Characteristics and applications of Computers, Classification of Computers. Elements of Computers Processing System Hardware CPU, Peripherals, Storage Media, Software Definition, Role and Categories, Firmware and Human-ware. Section B Communication: Need for communication, Data Transmission, Baud, Bandwidth, Data transmission rate, Channel Capacity, transmission impairments, Signal t noise ratio. Transmission media (twisted cables, Micro Wave and radio wave, Optical fiber and satellite) and communication through these media. A/D and D/A, Modulation, Multiplexing- FDM, TDM. Communication techniques: circuit switching, message switching and packet switching and their advantages and disadvantages. Section C Networking Essentials: Networking of Computer- Introduction of LAN & WAN, Types of LAN, Basic ISO-OSI model of LAN, Client-Sever Architectures. Programming Language Classification: Computer Languages, Generation of Languages, Translators-Interpreters, Compilers, Assembles, Introduction to 4GLS. Section - D Information Technology Applications: Multimedia introduction, tools graphics, sound, video and animations. Artificial intelligence (AI)- Basic concepts of AI and Expert systems. Latest IT enabled business applications; Basic concepts with definitions and short introduction of Enterprise Resource Planning (ERP), Customer relationship Management (CRM), Supply Chain Management (SCM), E-Commerce. Awareness of Ongoing IT Projects in India such as NICNET, ERNET, INFLIBNET, etc. Books Rajaraman, V.: Introduction to Computer. Morris: Computer Organization. Hamacher: Computer Organization. Kanter: Managing Information system. Vital N: Information Technology India Tomorrow. Murthy C.S. V: Fundamentals & Information Technology. Course CodeHU-1002 Credits-4L 3, T- 1, P-0Name of the CourseScience, Technology & SocietyLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Science, Technology & Society (HU 1002) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. (It is an innovative course dealing with social, human and ethical implications of engineering and technology, with special reference to the Indian situation. Its three main components are: Social and Cultural history of technology, Social and Human critiques of technology, Engineering Ethics and Professional Ethics.) Section A Science, Technology and Engineering, as knowledge and as social and professional activities. Inter-relationship of technology growth and social, economic and cultural growth; historical perspective. Ancient, medieval and modern technology/Industrial revolution and its impact. The Indian Science and Technology. Section B Social and Human critiques of technology: Mumford and Ellul. Rapid technological growth and depletion of resources. Reports of the club of Rome. Energy crisis; renewable energy resources. Environmental degradation and pollution. Eco-friendly technologies. Environmental regulations. Environmental ethics. Section C Technology and the arms race. The nuclear threat. Appropriate technology movement Schumacher; later developments. Technology and the developing nations. Problems of technology transfer. Technology assessment/impact analysis. Human operator in engineering projects and industries Problems of man machine interaction. Impact of assembly line and automation. Human centered technology. Section D Industrial hazards and safety. Safety regulations. Safety engineering. Politics and technology. Authoritarian versus democratic control of technology. Social and ethical audit of industrial organisations. Engineering profession. Ethical issues in engineering practice. Conflicts between business demands and professional ideals. Social and Ethical responsibilities of the engineer. Codes of professional ethics. Whistle blowing and beyond. Case studies. Books: Appleyard, R.ed. 1989. the impact of international migration on developing countries paris:OECD, Barger, Bernard 1952. Science and the social order New York: Free Press. Gaillard, J 1991. Scientists in the third world Lexington: Kentucky University Press. Gaillard, J., V.V. Krishna and R. Waast, eds. 1997. Scientific communities in the developing world New Delhi: Sage. Kamala Cahubey ed. 1974. science policy and national development New Delhi: Macmillan. Krishna, V.V. 1993. S.S. Bhatangar on science, technology, and development, 1938-54 New Delhi: Wiley Eastern. Kornhauser, William. 1962 Scientists in industry, Berkley: University of California Press, price, Derek J.deSolla. 1963 little science, big science New York: Columbia University Press. Rahman, A. 1972. Trimuti: Science, technology and society- A collection of essays New Delhi: Peoples Publishing House. Storer, Norman W. 1966. The social system of science New York: Holt Rinehart and Winston. UNCTAD/CSIR Case study in reverse transfer of technology: A survey of problems and policy in India Doc. TD/B/C/. 6/AC.4/6 and Corr.1, Geneva. Crane, Diana.1965. scientists at major and minor universities: A study of productivity and recognition, American sociological review, 30 (5), Pp. 699- 714. Coler, Myron A. ed. 1963. Essays on the creativity in the sciences New York: New York University Press. Debroy, Bibek. 1996. Beyond the Uruguay round: The Indian perspective on GATT New Delhi: Sage. Gilpin, Robert, and Christopher Wright eds. 1964. Scientists and national policy making New York: Columbia University press. Kumar, Nagesh and N. S. Siddharthan. 1997. Technology, market structure and internationalization: Issues and policies for developing countries London; Routlege and The United Nations University. MacLeod, Roy and Deepak Kumar. 1995. Technology and the raj: Western technology and technical transfers to India, 1700-1947 New Delhi: Sage. Merton, Robert K. 1938. Science, technology and society in seventeenth century England, Osiris (Bruges, Belgium), 14, Pp.360-632. Basic Electrical Engineering (EE 1001) Course CodeEE-1001 Credits-4L 3, T- 1, P-0Name of the CourseBasic Electrical EngineeringLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50 Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section - A D.C. Circuits: Ohms Law, Kirchoffs Laws, Thevenin, Norton, superposition, Max m power transfer, reciprocity, compensation, Millman and Tellegans Theorems. D.C. Circuits, Nodal and Loop methods of analysis. A.C. Circuits : Sinusoidal signal, instantaneous and peak values, RMS and average values, phase angle, polar & rectangular, exponential and trigonometric representations; R.L and C components, behaviors of these components in A.C. Circuits. Concept of complex power, power factor. Transient Response: Transient response RL, RC and RLC Circuits withstep input. Section - B Series and Parallel A.C. Circuits: Series and parallel A.C Circuits, series and parallel resonance, Q factor, cut-off frequencies and bandwidth Three Phase Circuits: Phase and line voltages and currents, balanced star and delta circuits, power equation, measurement of power by two wattmeter method, Importance of earthing. Section - C Transformers: Principle, construction & working of transformer, Efficiency and regulation. Electrical Machines: Introduction to D.C. Machines, Induction motor, Synchronous machines. Section - D Measuring Instruments: Voltmeter, Ammeter, Wattmeter, Energy meter. Batteries: Storage Batteries: - types, construction, charging and discharging, capacity and efficiency. Books Kothari & Nagarath: Basic Electrical Engg. (2nd Edition), TMH B.L. Theraja & AK Theraja. S.Chand: Electrical Technology (Vol-1). Deltoro: Electrical Engineering Fundamentals, PHI Basic Mechanical Engineering (ME 1003) Course CodeME-1003 Credits-4L -4, T-1, P-0Name of the CourseBasic Mechanical EngineeringLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Min. Pass Marks: 50 Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course . For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section - A First Law of Thermodynamics: Essence and corollaries of the First law. Analytical expression applicable to a process and cycle; internal energy, enthalpy and specific heats; first law analysis of steady flow, applications of steady flow energy equation to engineering devices. Applications of first Law of Thermodynamics: Closed and open systems, analysis of non-flow and flow processes for an Ideal gas under constant volume (Isochoric), constant pressure (Isobaric). Constant temperature (isothermal), adiabatic and polytropic conditions. Analysis of free expansion and throttling processes. Representation of these processes on P-V charts and analysis of property changes and energy exchange (work and heat) during these processes. Section B Second Law of Thermodynamics: Limitations of first law, various statements of second law and their equivalence, application of statements of second law to heat engine, heat pump and refrigerator, Philosophy of Carnot cycle and its consequences, carnot theorem for eat engines & heat pump, classius inequality, concept and philosophy of entropy and entropy changes during various processes. Temperature entropy chart and representation of various processes on i. Third law of thermodynamics. Section - C Simple Stresses & Strains: Concept & types of Stresses and strains, Polsons ration, stresses and strain in simple and compound bars under axial loading, stress strain diagrams, Hooks law, elastic constants & their relationships, temperature stress & strain in simple & compound bars under axial loading, Numerical problems. Shear Force and Bending Moments: Definitions, SF & BM diagrams for cantilevers, simply supported beams with or without over-hang and calculation of maximum BM and SF and the point of contraflexture under (i) concentrated loads, (ii) uniformly distributed loads over whole span or a part of it, (iii) combination of concentrated loads and uniformly distributed loads. Relation between the rate of loading, the shear force and the bending moments, Numerical problems. Section D Bending Stresses in Beams: Bending stresses in beams with derivation, of bending equations & its application to beams of circular, rectangular I and T sections, composite beams, shear stresses in beams with derivation combined bending torsion & axial loading of beams. Numerical. Torsion of Circular Members: Torsion of thin circular tube, Solid and hollow circular shafts, Combined bending and torsion, equivalent torque, Numerical problems. Books: Strength of Materials G.H. Ryder Third Edition in SI units 1969 Macmillarn India Mechanics of Materials Dr. Kirpal Singh, Standard Publishers Distributors- New Delhi. Strength of Materials Popov, PHI, New Delhi. Strength of Materials A Rudimentary Approach M.A. Jayaram, Revised Ed. 2001, Sapna Book House, Bangalore. Strength of Materials U.C. Jindal. Nag, P.K., Engineering Thermodynamics, Tata McGraw-Hill, New Delhi. Yadav, R., Thermal Science and Engineering, Central Publishing House, Allahabad. Moran, M.J. and Shapiro, H.N., Fundamentals of Engineering Thermodynamics, John Wiley, New York Van Wylen, G.J., Fundamental of Classic Thermodynamics, John Wiley, New York. Spalding, D.B and Cole, E.H,, Engineering Thermodynamics, ELBS, New Delhi. Hibbeler, R.C., Engineering Mechanics Statics, Addison Wesley Longman, New Delhi. Mechanics of Materials Dr. Kirpal Singh, Standard Publishers Distributors, New Delhi. Course CodeAS-1005 Credits-2L -0, T-0, P- 2Name of the CourseApplied Chemistry LabLectures to be Delivered26 hours of Lab work (2 Hr per week) Semester End Examination Max. Marks: 50Min. Pass Marks: 40 Maximum Time:3hrsLaboratoryContinuous Assessment (based on Lab work (2) 30%, Lab Record 30%, Viva/ Hands on 30%, Attendance 10%)Max. Marks: 50Min. Pass Marks: 25Applied Chemistry Lab (AS 1005) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. Note: At least 8 Experiments to be performed. LIST OF EXPERIMENTS To determine the Surface Tension of the given liquid by drop number method using Stalgmometer and identify the given liquid. To determine the insoluble,soluble and total solids in a given sample of sewage. To determine the solid carbon, volatile matter, ash content and percentage of moisture in a given sample of coal by proximate analysis method and classify the coal. To determine the total alkalinity in a given sample of water using a standard acid. Ask for what you want. To determine the percentage of Chlorine in a given sample of Caocl2 which has been dissolved in one litre of the solution. To determine the Surface tension of the two given unknown liquids by drop number method using a stalagmometer, to identify the two given liquids. To determine the fineness of a given sample of cement by solving through standard 75:90 micro sieve. To determine the coefficient of viscosity of the unknown given liquids by using Ostwalds Viscometer and identify the given liquid. To determine the coefficient of viscosity of the given liquids by using Ostwalds Viscometer and identify the given liquid. To determine the viscosity of a given lubricating oil using Red Wood Viscometer. To determine the viscosity of a given lubricating oil using Seybolt Viscometer. To determine the flash point and fire point of a given sample of oil using Penskey Martens apparatus. To determine the amount of Chlorine in a given sample of water approximate N/20 Sodium Thiosulphate solution. Ask for your requirement. Estimation of Calcium as CaO volumetrically in cement. To determine the maximum wavelength of a solution of cobalt chloride. To determine Beers Law and apply it to find the concentration of a given unknown solution by spectro photometer. To determine the chemical oxygen demand of waste water. To determine the half life period of a given radio active sample using GM counter. Course CodeIT-1003 Credits-2L -0, T-0, P- 2Name of the CourseMATLAB LaboratoryLectures to be Delivered26 hours (2hrs per week) Semester End Examination Max. Marks: 50Min. Pass Marks: 40% Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25MATLAB Laboratory (IT 1003) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. The aim of this laboratory is to help students get an idea about a programming environment very widely used by Engineer to solve problem in their respective disciplines. After exposing the students to the MATLAB environment the students will be required to do following Exercises on the Computer Roots of a quadratic equation. Guessing a number Units Conversion Factorial Program Simulation of an RC Circuit I-V characteristics of a MOSFET Finding average with a dynamic array. Writing a binary file. Reading a binary file. Plotting one and two dimensional graphs using various MATLAB 2-D Plot types Using functions in MATLAB environment. The teacher concerned will give at least 10 more exercises to solve non trivial problems using MATLAB environment. Books: Programming in MATLAB, Marc E. Herniter, Thomson ASIA Ptc ltd. Singapore (2001). MATLAB, The Language of Computing; The Maths work Inc. Course CodeEE-1002 Credits-2L -0, T-0, P- 2Name of the CourseBasic Electrical Engineering LabLectures to be Delivered26 hours of lab work (2 hrs per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 40% Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Basic Electrical Engineering Lab (EE 1002) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of Experiments: To verify KCL and KVL. To study frequency response of a series RLC Circuit and determine resonance frequency and Q factor for various values of R, L, C To study frequency response of a parallel RLC Circuit and determine resonance frequency and Q factor for various values of R, L, C To perform direct load test of a transformer and plot efficiency v/s load characteristic To perform direct load test of a DC shunt generator and plot load voltage v/s load current curve. To study and verify Thevenin, Norton, Superposition, Milliman, maximum power, reciprocity. To perform O.C. and S.C. test of a transformer. To study various types of meters. Measurement of power by 3 voltmeter / 3 ammeter method Measurement of power in a 3-phase system by 2-wattmeter method. Workshop Practice - II (ME 1004) Course CodeME-1004Credits-5L -1, T-, P- 4Name of the CourseWorkshop Practice - IILectures to be Delivered52 hrs ( L=13 hrs, Lab sessions= 20 (2hrs each)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsLaboratory Continuous Assessment Lab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25 Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of Experiments: - Fitting Shop: - Drilling and Tapping in a M.S. piece To make a male - female joint (Taper type) of mild steel. Machine Shop: - To perform boring operation on lathe machine To perform knurling and threading operation on lathe machine Step turning operation on a lathe machine. Carpentry and Pattern making Shop: - To make a single piece pattern of connecting rod To make a self cod pattern To make a split pattren Welding Shop: - To make a V butt joint in horizontal position To make a V butt joint in vertical position To perform Gas Welding operation . Smithy and Forging: - To make a cube from a circular bar. To make a tong using hot forging operations To perform drawing down operation Foundry Shop: 1. To make a mould and perform casting operation 2. Study of casting defects and its remedies Books: Workshop Technology by Chapman Manufacturing Processes by Begman Manufacturing Materials and Processes by JS Campbell Introduction to Electrical Wiring Exercises & preparation of PCBs involving soldering of electrical & electronic applications. Note: Industrial visits can be undertaken to various industries available in the vicinity of the concerned Engineering College. One Project at the end of semester has to be submitted by group of six students. Course CodeIT-1004 Credits-L -1, T-4, P-0 Name of the CourseInformation Technology Trainer Workshop IILectures to be Delivered52 hrs (L=13, Lab session = 20 (2 hrs each)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Information Technology Trainer Workshop II (IT 1004) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. This workshop will provide training of different types of operating systems (Windows 98, LINUX) with hands on experiments on the following: Installation of Operating System Configuration of Hard Disk Configuration of Display Cards. Configuration of Sound Cards. Configuration of CDROM Configuration of Mouse. Configuration of Printer Configuration of Display Cards. Configuration of Network Cards. Configuration of Modem Understanding boot up process. Creating and Using emergency Disk. Troubleshooting exercises related to various components of computer like Monitor drives, memory, printers etc. Assembling a PC. NOTE: Industrial visits can be undertaken to various industries available in the vicinity of the concerned Engineering College. One project at the end of semester has to be submitted by a group of six students Course CodeME-2005 Credits-2L -0, T-0, P-2Name of the CourseBasic Mechanical Engg. LabLectures to be Delivered26 hours of lab work (2 hrs per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Basic Mechanical Engg. Lab (ME 1005) Instructions for paper setter/ Candidates Laboratory examination will consist of three parts: Performing a practical exercises assigned by the examiner (25 marks). Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. LIST OF EXPERIMENTS: To study low-pressure boilers. To study high-pressure boilers. Calibration of thermometers. Calibration of pressure gauges. Study of discharge measuring devices. To determine co-efficient of discharge of orificemeter. To verify the Bernoullis Theorem To find Youngs Modulus of Elasticity using Searls apparatus To find Youngs Modulus of Elasticity of a beam with deflection beam apparatus To find modulus of rigidity with the help of torsion apparatus. SEMESTER - III Semester-III Fundamentals of Economics (HU 3001) Course CodeAS-3001 Credits-4L 3, T-1, P-0Name of the CourseFundamentals of EconomicsLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50 Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Market Dynamics: Demand Theory and Demand forecasting, Production Theory, Cost Theory, X-Inefficiency, Forms of Market, elements of Competition, Monopoly and Price Discrimination, Imperfect Competition Oligopoly. Section B Theory of Firm: Profit Concepts and Measurements, entry Deterring Pricing, Predatory Pricing, Implicit Price Fixing, Multi-Product Pricing, Peak Load Pricing, Two Part Tariff, Product Life Cycle, Information Problems and Associated Cost, Objectives of the Firm, Types of the Firm, firm versus Markets, Uncertainty and Firm, Vertical and Horizontal Integration, Diversification, Merges and Takeovers. Section C Macro Economics: Macroeconomic Aggregates and Concepts, simple Macroeconomic Models, Business Cycles, Inflation, Unemployment, Input-Output Analysis. Section D Indian Economy: Pre and Post Colonial Characteristics, Planning In India, Trends in Economic growth, Saving, Investment and Foreign Trade (BOP), Project Formulation and Appraisal, Indias Overall Economic Policy since Independence, Sustainable Development, Economic Liberalization, Global trade Regimes. Books: Alfred W Stonier & Douglus C Hague, A Textbook of Economic Theory, 5th edition, 1980, Longman, London. A. Kotosoyiannis, Modern Microeconomics, 2nd edition, English Language Book Society, Macmillan, London James M. Anderson, Richard E. Quandt, Microeconomic Theory, 1980. Hal R. Varian, Intermediate Microeconomics: A Modern Approach, 2nd Edition, Norton, International Student Edition, Norton and Company, London. Rudiger Dornbusch and Stanley Fischer, Macroeconomics, . sixth edition, 1994, Mc GrawHill, Inc. Gardner Ackley, Macroeconomics Theory and Practice, Coolier Macmiilan Editions, London, (1987) William H Branson, Macroeconomic Theory and Plicy, 3rd Edition, Harper & Row, Publishers, Singapore. Uma Kapila: Indian Economy since Independence, Academic fondation, New Delhi. K.S.G ill: Evolution of the Indian Economy a Textbook in Economics for class XI, NCERT. Project Formulation in Developing countries: OECD, Paris. Course Code(ID) IT-3001 Credits-4L-3, T-1, P-0Name of the CourseComputer Organisation Lectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%) Max. Marks: 50Semester-III Computer Organisation (ID) (IT 3001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course . For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E.. Use of non-programmable calculators is allowed. Section A Basics: An introduction to computers with block diagrams , Computers generations, Impact of technology . Logic Design Techniques: Designing Combinations logic using Karnaughs maps with building blocks of basic gates, Mulitplexers, de-multiplexers, decoders, encoders , arithmetic/logic unit. Instruction codes, Computers registers and instructions, timing, and control, Instructions cycle, memory reference instruction, I-O interruption, Basic sequential logic blocks of flip-flops, registers, shift registers and counters, Finite state Machine using state tables. Section B Computer Arithmetic- Adder, and Subtractor circuits, Booth Multiplication Algorithm, Performance bench marks. Control Path Design: Sequence counter method, Micro programmed controllers address sequencing, symbolic micro-instructions. Section C Central Processing Unit: Registers General register origination, stack organization, instructions formats, address instructions, addressing modes, data transfer and manipulations, program control, RISC instruction set design, three address instructions and arithmetic pipelines with example of floating point adder, instructions pipelines , advanced pipelining using instruction level parallelism. Section D Memory origination : Memory device characteristics, random access memory, serial access memory, virtual memory, associative memory, cache memory, memory management hardware. I/O Organization: I/O interface asynchronous data transfer, DMA interrupt, I/O processor. Books: 1. M. Morris Mano ,Computer system & Architecture PHI 2. Hayes .J.P ,Computer architecture and organisation , 3. M.Morris and Charles R. Kinre , Logic and computer design Fundamentals . PHI 1995 Semester-III Object Oriented Methods & Programming (ID) (IT-3002) Course Code(ID) IT-3002 Credits-4L-3, T-1, P-0Name of the CourseObject Oriented Methods & ProgrammingLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%) Max. Marks: 50 Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section- A Introduction to Object oriented concepts: Overview, Abstract data types: object, Modularization, classes, creating and destroying objects; Garbage collection strategies, overloading, dynamic binding, polymorphism, constants. Inheritance: Class inheritance, Inheriting instance variable, inheriting methods, meta classes, object inheritance, multiple and multilevel inheritance. Section B C++ Programming Language: Overview: Programming paradigm, support for data abstraction and object oriented programming, declaration and constants, expression and statements , functions and files, Classes and Objects: Definitions of Class declaration, data numbers class function definition, member function definition scope resolution operator, private and public member function , nesting of member functions, creating objects, accessing class data members functions, array of objects, objects as function arguments. Operator overloading: Operator function, user defined typed conversion large objects, assignments and initialization and subscripting and functions call, referencing , increment and decrement, a string class, friends and members . Section C Inheritance through extending classes, Base and drive classes, visibility modes, single inheritance, protected member and inheritance, multilevel inheritance, nesting of classes. Streams, templates and designs of libraries. Out put, input, formatting files and streams, C-I/O, design of libraries, Section D Object Oriented Analysis and Design: Object oriented analysis and systems design, objected design, semantic and entity relationship modeling, Contrasting design for databases and OOA, OOD. Books The C++ Programming Language, Bjarne Stroustrup, Addison Wesley, 2000. Objecting Modeling and Design, James, Rumbaugh, Michael Blaha, William Premerlani, Frederick Eddy and William Lorensen, PHI 1998. Object Oriented Programming in TURBO C++, Robert Lafore, Galgotia Publications Pvt. Ltd., 1994. Object Oriented Programming with C++, Balagurusamy, Tata McGraw Hill Publishing Co. Ltd., 2000. Programming with C++, D.Ravichandran, Tata McGraw Hill, 1996. Course Code(ID) IT-3003 Credits-4L 3, T-1, P-0Name of the CourseData Structures & AlgorithmsLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester-III Data Structures & Algorithms (ID) (IT 3003) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section- A Basic concepts and notions, data structures and data structure operation, mathematical notation and functions, algorithmic complexity, linked list, representation of linked list, multi -linked structures. Section B Trees- definitions and basic concepts, linked tree representation, representation in contiguous storage, binary trees, binary trees traversal , searching, insertion and deletion in binary trees, heap trees and heap sort algorithm, Height balanced trees and AVL trees. Section C Graphs an their application , sequential and linked representations of graph, adjacency matrix, operation on graph, traversing a graph, Dijkstras algorithm for shortest distance. Tables, searching sequential tables, Hash tables and symbol tables Section D Searching and Sorting: Use of various data structure for searching and sorting , linear and binary search, insertion sort, selection sort, merge sort, radix sort, bubble sort Note: 1 Programs are to be implemented in C 2. Insertion, deletion, search and traversal operation are to be performed on all the data structures. Books: Tenenbaum, A. Lanhgsam, Y and Augensatein, A. J: Data structures using C, Prentice Hall of India Seymour Lipschutg: Theory an practice of Data structure, Mc. Graw Hill 1988 Horowitz E and Sahni S: Data Structure with Pascal, 3rd Editon, Galgotia, 1991 Course Code(ID) IT-3004 Credits-4L 3, T- 1, P-0Name of the CourseComputer GraphicsLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- III Computer Graphics (ID) (IT 3004) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Graphic Hardware: The Functional characteristics of the systems are emphasised. Input devices : Keyboards, Touch Panel, Light pens, Graphics tablets, Joysticks, Trackball, Data glove, Digitizer, Image scanner , Mouse, Voice Systems. Hard Copy Devices: Impact and non-impact printers, such as line printer, dot-matrix, laser, ink-jet, electrostatic, flatbed and drum plotters. Video Display Devices: Refresh cathode- ray tube, raster scan displays, random scan displays, colour CRT-monitors, direct view storage tube, flat-panel displays, 3-D viewing devices, virtual reality, raster scan systems, random scan systems, graphics monitors and workstations. Section B Scan conversion algorithms for line, circle and ellipse, Bresenhams algorithms area filling techniques, character generation. 2-dimensional Graphics : Cartesian and Homogeneous co-ordinate system, Geometric transformations (Translation, Scaling, Rotation, Reflection, Shearing), Composite transformations, Affine transformation, Two dimensional viewing transformation and clipping (line, polygon and text) Section C 3-dimensional Graphics: Geometric transformation (Translation, Scaling, Rotation, Reflection, Shearing), Composite transformation, Mathematics of Projections (parallel and perspective). 3-D viewing transformation and clipping. Hidden line and surface elimination algorithms, z-buffer, scan-line, sub-division, Painters algorithm. Section D Shading: Modeling Light intensities: Diffuse reflection, Specular reflection, refracted light, texture surface patterns, halftoning. Surface Shading Methods : Constant Intensity method, Gouraud Shading, Phong Shading. Animation: Principles of animation, animation techniques- draw erase, animation with the look-up table, storyboards for animation, key-frame system, basic requirements in animation, animation softwares. BOOKS Foley, van Dam et al: Computer Graphics: Principles and Practice In C, 2nd Ed., Addison Wesley, 1997. Hearn and Baker: Computer Graphics, 2nd Ed., Prentice Hall of India, 1999. Woo, Neider, Davis, and Shreiner: Open GL Programming Guide, 3rd Ed., Addison Wesley, 2000. Steven Harrington: Computer Graphics: A programming approach, 2nd Ed., McGraw Hill International Editions. A. Watt: Three-dimensional Computer Graphics, 3rd Ed., Addison Wesley, 2000. D.F. Rogers: Procedural Elements of Computer Graphics, 2nd Ed.,McGraw Hill, 1998. Edward Angel: Interactive Computer Graphics; a top-down Approach with Open GL, 2nd Ed., Addison Wesley, 2000. Yeshwant Kanetkar: Graphics under C Stevens: Graphic Programming in C. Plastock R.A. and Kalley G., Computer Graphics, McGraw Hill 1986. Course CodeEC-3001 Credits-4L 3, T-1, P-0Name of the CourseDigital Electronics Lectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks:50Semester-III Digital Electronics (EC-3001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Binary, Octal & Hexadecimal number systems and their inter conversion, Binary arithmetic (addition, subtraction, multiplication and division). 1's &2's complements, 9's and 10's compliments, BCD code, BCD addition, Gray code, Error Detection and correction, Hamming code. Section B Logic functions (OR, AND, NOT, NAND, NOR,XOR), Elements of Boolean Algebra (Theorems truth tables and relation's), negative and positive logic, saturated and non saturated logic, fan in, fan out, Logic IC's, de Morgan's Theorem, minterms and maxterms, Karnaugh mapping, K-map representation of logical function for 2, 4 variable, simplification of Boolean equations with the help of K-map, Various minimisation techniques, Quine's method and Quinnes Mc-Cluskey method, Half adder, full adder, half subtractor, full subtractor, serial and parallel binary adder. Section C Introduction and performance criteria for logic families, various logic families-DCTL, RTL, DTL, TTL & EC working and their characteristics in brief, MOS Gates and GMOS Gates, comparison of various logic families. Section D: Various kinds of Flip-Flop: RS Flip-Flop, Clocked RS Flip-Flop, Edge triggered D Flip-Flop, Flip-Flop Switching time, JK Flip-Flop, JK Master Slave Flip Flop, lock wave forms, 555 timer as a stable multivibrator. shift registers: serial in serial out, parallel in parallel out, ring counters, asynchronous counters, synchronous counters. D/A converter, A/D converter, clipping and clamping circuits, astable, monostable, bistable multivibrator using transistor. Books: Malvino and Leach, Digital Principles and Applications, Taub and Schilling ,Digital Integrated Electronics,. Samuel C Lee, Digital Circuits and Logic Design4. Pulse, Digital and Switching Waveforms, Millman and Taub. Lionel Warnes, Macmillan Press Limited Analogue and Digital Electronics, London, 1998. Semester-III Digital Electronics Laboratory (EC 3002) Course CodeEC-3002 Credits-2L 0, T-0, P-2Name of the CourseDigital Electronics LaboratoryLectures to be Delivered26 hours of Lab sessionsSemester End Examination Max. Marks: 50Min. Pass Marks:20 Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of Experiments: Verify truth tables of AND, OR, NOT, NAND, NOR and XOR gates. Implement (i) half adder (ii) full adder using AND-OR gates. Implement full adder using NAND gates as two level realization. Implement full subtractor using 8 to 1 Multiplexer. Verify truth tables of RS & JK flip flops and convert JK filp-flops into D type & T type flip-flops. Use 555 timer as (i) monostable (ii) astable multivibrator. (a) Use of 4-bit shift register for shift left and shift right operations. (b) Use 4-bit shift register as a ring counter. Implement mod-10 counter and draw its output waveforms. Implement 4-bit DAC using binary weighted resistance technique/R-2R ladder network technique. Implement 8-bit ADC using IC(ADC 0800/0801). a) Implement (i) Single level clipping circuit (ii) Two level clipping circuit. Implement clamping circuit to clamp, at peak +ve voltage/ peak ve voltage of an input signal. Additional Exercises: Construct bounce less features Construct a pulser of 1 Hz and 10 Hz 1k Hz and manual. Construct logic state detector. 4 Construct opto - sensor based Measurement rotational speed of motor. Measurement time elapse between two events. Measurement of linear velocity Measurement of acceleration. Construct a memory using TTL Circuits. Read and write data onto a memory from bus. Construct and security latch that can be operated by an identity card. Note: - Record to be maintained both electronically and hard copy for evaluation. Course Code(ID) IT - 3005 Credits-2L 0, T-0, P-2Name of the CourseData Structure LaboratoryLectures to be Delivered26 hours of Lab work (2 hours per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Semester-III Data Structure Laboratory (ID) (IT-3005) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of Experiments: Write a program to search an element in a two-dimensional array using linear search. Using iteration & recursion concepts write programs for finding the element in the array using Binary Search Method. Write a program to perform following operations on tables using functions only a) Addition b) Subtraction c) Multiplication d) Transpose Using iteration & recursion concepts write the programs for Quick Sort Technique. Write a program to implement various operations on string such as length of string concatenation, reverse of a string & copy of a string to another. Write a program for swapping of two numbers using call by value and call by reference strategies. Write a program to implement Binary Search Tree. (Insertion and Deletion in Binary Search Tree) Write a program to create a linked list & perform operations such as insert, delete, update, reverse in the link list. Write the program for implementation of a file and performing operations such as insert, delete, update a record in the file. Create a double linked list and perform the following operations on it. a) Add a node b) Delete a node c) count no. of nodes d) Sum of nodes Write a program to simulate various searching & sorting algorithms and compare their timings for a list of 1000 elements. Write a program to simulate various graph traversing algorithms. Write a program which simulates various tree traversal algorithms. Circular Double Linked list Sorting Bubble Sort Merge Sort Insection Sort Selection Sort Write down a program to Implement Polynomial Equation Addition in a Single linked list. Stack Implementation using a) Array b) Linked List Queue Implementation using a) Array b) Linked List Note: At least 5 to 10 more exercises to be given by the teacher concerned. Course Code(ID) IT-3006 Credits-4L 0, T-0, P-2Name of the CourseObject Oriented Methods & Programming LaboratoryLectures to be Delivered26 hours of Lab work ( 2hrs per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Semester-III object Oriented Methods & Programming Laboratory (ID) (IT-3006) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. Laboratory Exercises: 1. Raising a number n to a power p is the same as multiplying n by itself p times. Write a function called power ( ) that takes a double value for an int value for p, and returns the result as double values. Use a default argument of 2 of p, so that if this argument is omitted, the number will be squared. Write a main ( ) function that gets values from the user to test this function. 2. A point on the two dimensional plane can be represented by two numbers: an X coordinate and a Y coordinate. For example, (4,5) represents point 4 units to the right of the origin along the X-axis and 5 units up the Y-axis. The sum of two points can be defined as new point whose X and Y coordinates. Write a program that uses a structure called point to model a point. Define three points, and have the user input values to two of them. Than set the third point equal to the sum of the other two. And display the value of the new point. Interaction with the program might look like this: Enter coordinates for P1: 3 4 Enter coordinates for P2: 5 7 Coordinates of P1 + P2 are: 8 11 3. Create the equivalent of a four function calculator. The program should request the user to enter a number, an operator and another number. It should then carry out the specified arithmetical operation: adding, subtracting, multiplying, or dividing the two numbers. (it should use a switch statement to select the operation). Finally, it should display the result. When it finishes the calculation, the program should ask if the user wants to do another calculation. The response cab be Y or N Some sample interaction with the program might look like this. Enter first number, operator and second number 12 + 100 Answer = 112 Do another (Y/N) ? N 4. A phone number, such as (212) 767-8900, can be thought of as having three parts: the area code (212), the exchange (767) and the number (8900). Write a program that uses a structure to store these three parts of a phone number separately. Call the structure phone. Create two structure displaying both numbers. The interchange might look like this: Enter your area code, exchange and number : 415 555 1212 My number is (415) 555-1212 5. Create two classes DM and DB which store the value of distances. DM stores distances in meters and centimetres and DB in feet and inches. Write a program that can read values for the class objects and add one object of DM with another object of DB. Use a friend function to carry out the addition operation. The object that stores the results may be a DM object or DB object, depending on the units in which the results are required. The display should be in the format of feet and inches or metres and centimetres depending on the object on display. 6. Create a class rational which represents a numerical value by two double values NUMERATOR & DENOMINATOR. Include the following public member Functions: Constructor with no arguments (default) Constructor with two arguments. Void reduce ( ) that reduces the rational number by eliminating the highest common factor between the numerator and the denominator. Overload + operator to add two rational number Overload >> operator to enable input through cin. Overload << operator to enable input through count. Write a main ( ) to test all the functions in the class. 7. Consider the following class definition class father { Protected : int age; Public; Father (int x) {age =x;} Virtual void iam ( ) {cout < < I AM THE FATHER ,my age is : << age << end 1:} }; Derive the two classes son and daughter from the above class and for each, define iam ( ) to write our similar but appropriate messages. You should also define suitable constructors for these classes. Now, write a main ( ) that creates objects of the three classes and then call iam ( ) them. Declare pointer to father, Successively assign addresses of objects of the two derived classes to this pointer and in each case, call iam ( ) through the pointer to demonstrate polymorphism in action. 8. Write a program that creates a binary file by reading the data from the students for the terminal. The data of each students consist of roll No., name (a string of 30 or lesser No. of Characters) and marks. 9. A hospital wants to create a database regarding its indoor patients. The information to store include Name of the patient Date of admission Disease Date of discharge Create a structure to store the date (year, month and date as its members). Create a base class to store the above information. The member function should include functions to enter information and display a list of all the patients in the database. Create a derived class to store the age of the patients. List the information about all to store the age of the patients. List the information about all the pediatric patients(less than twelve years in age). 10. Make a class Employee with a name and salary. Make a class Manager inherit form Employee. Add an instance variable, named department, type string. Supply a method to String that prints the managers name, department and salary. Make a class Executive inherit form information stored in the manager superclass object. Supply a test program that test these classes and methods. 11. Imagine a tollbooth with a class called Toll Booth. The two data items are a type unsigned int to hold the total number of cars, and a type double to hold the total amount of money collected. A constructor initialises both these to 0. A member function called paying Car ( ) increments the car total and adds 0.50 to the cash total. Another function, called nopayCar ( ), increments the car total but adds nothing to the cash total. Finally, a member function called displays the two totals. Include a program to test this class. This program should allow the user to push one key to count a paying car, and another to count a non-paying car. Pushing the ESC key should cause the program to print out the total cars and total cash and then exit. 12. Write a function called reversit ( ) that reverses a string (an array of Char). Use a for loop that swaps the first and last characters, then the second and next to last characters and so on. The string should be passed to reversit ( ), and print out the result. Use an input method that allows embedded blanks. Test the program with Napoleons famous phrase, Able was I ere I saw Elba) 13. Create some objects of the string class, and put them in a Deque-some at the head of the Deque and some at the tail. Display the contents of the Deque using the for Each ( ) function and a user written display function. Then search the Deque for a particular string, using the first That ( ) function and display any strings that match. Finally remove all the items form the Deque using the get Left ( ) function and display each item. Notice the order in which the items are displayed: using GetLeft ( ), those inserted on the left (head) of the Deque are removed in last in first out order while those put on the right side are removed in first in first out order. The opposite would be true if getRight ( ) were used. 14. Assume that a blank maintains two kinds of accounts for customers. One called as savings account and the other as current account. The saving account provides compound interest and withdrawal facilities but no cheque book facility. The current account provides cheque book facility but no interest. Current account holders should also maintain a minimum balance and if the balance falls below this level, a service charge is imposed. Create a class account that stores customer name, account number and type of account. Form this derive the classes cur_acct and Sav_acct to make them more specific to their requirements. Include necessary member functions in order to achieve the following tasks: Accept deposit from a customer and update the balance. Display the balance. Compute and deposit interest. Permit withdrawal and update the balance. Check for the minimum balance, impose penalty, necessary and update the balance. Do not use any constructors. Use member functions to initialize the class members. 15. Create a base class called shape. Use this class to store two double type values that could be used to compute the area of figure. Derive two specific classes called triangle and rectangle from the base shape. Add to the base class, a member function get data ( ) to initialize base class data members and another members function display area ( ), to compute and display the area of figures. Make display_ area ( ) as a virtual function and redefine this function in the derived classes to suit their requirements. Using these three classes, design a program that will accept dimensions of a triangle or a rectangle interactively and display the area. Remember the two values given, as input will be treated as lengths of two sides in the case of rectangles and as base and height in the case of triangles and used as follows: Area of rectangle = x * y Area of Triangle = 1/2 * x * y Programming of exercises in C++ in the form of projects ( based on Object Oriented Programming in TURBO C++, Robert Lafore, Galgotia Publications Pvt. Ltd., 1994, to be done in consultation with the faculty incharge for the course) Note:-Record to be maintained both electronically and hard copy for evaluation. Course Code(ID) IT-3007 Credits-2L 0, T-0, P-2Name of the CourseComputer Graphics LabLectures to be Delivered26 hours of Lab work (2 hours per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Semester-III Computer Graphics Lab (ID) (IT-3007) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of programs to be developed: Familiarize yourself with creating and storing digital images using scanner and digital camera (compare the size of the image when stored in different formats) and convert the stored images from one format to another (BMP,GIF, JPEG,TIFF,PNG, etc.) and analyze them. Implement Bresenhams line algorithm. Also provide provision to change attributes of the graphic primitives such as stippling (Dotted and Dashed pattern), colors and Butt & round Caps. Implement Bresenhams circle algorithm. Also provide provision to change attributes the graphic primitives such as stippling (Dotted and Dashed pattern) and colors. Implement 2D transformations with translation, rotation, reflection, shearing and scaling. Construct Bezier curves and Spline curves with 6 or more control points entered through mouse. Construct fractal geometrical shapes using linear or non-linear procedures. Consider a scene with two or more three-dimensional (3D) polygonal object. Generate different perspective views of the scene by changing various 3D viewing parameters interactively. Implement tweening procedure for animation with key frames having equal or different No. of edges. Write a program for 2D line drawing as Raster Graphics Display. Write a program for circle drawing as Raster Graphics Display. Write a Program for Polygon Filling as Raster Graphics Display. Write a program for line clipping. Write a program for polygon clipping. Write a program for displaying 3D objects as 2D display using perspectives transformation. Write a program for rotation of a 3D object about arbitrary axis. Write a program for Hidden surface removal from a 3D object. Note: At least 5 to 10 more exercises to be given by the teacher concerned. SEMESTER - IV Course Code(ID) IT-4001 Credits-4L 3, T-1, P-0Name of the CourseComputer ArchitectureLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester-IV Computer Architecture (ID) (IT 4001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Fundamentals of Computer Design: Introduction, Measuring and Reporting Performance, Quantitative principles of Computer Design, The Concept of Memory Hierarchy Instruction Set Principles and Examples: Classifying Instruction Set Architectures; Memory Addressing; Operations in the Instruction Set, Type and Size of Operands, Encoding an instruction set, The DLX Architecture Section B Pipelining: What is Pipelining? The Basic Pipeline for DLX, the major hurdle of pipelining-pipeline hazards, What Makes pipelining hard to implement? The MIPS R4000 pipeline Advanced Pipelining and Instruction-Level Parallelism: Instruction-level parallelism: Concepts and Challenges, Overcoming Data Hazards with Dynamic Scheduling, Reducing Branch Penalties with Dynamic Hardware prediction, Taking advantage of more ILP with multiple issue, Compiler Support for Exploiting ILP Section C Memory-Hierarchy Design: Introduction, The concept of Cache memory, Reducing Cache misses, Reducing Cache miss Penalty, Reducing Hit Time Main Memory, Virtual Memory, and memory protection. Storage systems: Types of Storage devices, Buses-Connecting I/O Devices to CPU/Memory, I/O Performance Measures, Reliability, Availability and RAID, UNIX File system performance. Section D Interconnection Networks: A simple network, connecting the interconnection network to the computer, interconnection network media, connecting more than two computers, practical issues for commercial interconnection networks, examples of interconnection networks. Multiprocessors: Characteristics of Application Domains, Centralized Shared Memory Architectures, Distributed Shared- Memory Architectures, Synchronization. BOOKS Computer Architecture A Quantitative Approach, John L. Hennessy & David A. Patterson, 2nd Edition, Harcourt Asia Pte. Ltd., 1996. Computer Architecture & Organisation, McGraw Hill, 3rd Edition, John Hayes, 1998. Computer System Architecture PHI, 3rd edition, M. Morris Mano. Computer Architecture and Parallel Processing, McGraw Hill Book Company, Hwang and Briggs. Advanced Computer Architecture: Parallelism, Scalability, Programmability, Kai Hwang, McHill, Inc., 1993. Course CodeIT-4002 Credits-4L 3, T-1, P-0Name of the CourseOperating System ConceptsLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester-IV Operating System Concepts (IT-4002) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A What is an Operating system? Simple Batch Systems; Multiprogrammed Batched Systems; Time-Sharing Systems; Personal-Computer Systems; Parallel Systems; Distributed Systems; Real-Time Systems. System Components; Operating-System Services; System Calls, System Programs; System Structure; Virtual machines. Process Concept; Process Scheduling; Operation on processes, Cooperating Processes, Threads, Interprocess Communication CPU Scheduling fundamental Concepts, Scheduling Criteria; Scheduling Algorithms; Multi-processor Scheduling; Real-Time Scheduling. Section B Deadlocks: System Model; Deadlock Characterization; Methods of Handling Deadlocks; Deadlock Prevention; Deadlock Avoidance; Deadlock Detection; Recovery from deadlock; Combined Approach to Deadlock Handling. Protection: Goals of protection; Domain of protection; Access Matrix and its implementation; Revocation of Access Rights; Capability-Based Systems; Language-Based protection. Security: The Security problem; Authentication; One-Time passwords; program Threats; System Threats; Threat Monitoring; Encryption and decryption; Computer-Security Classifications; An Example Security Model: Windows NT. Section C Memory Management: Logical versus Physical Address Space; Swapping; Contiguous Allocation; paging; Segmentation; Segmentation with Paging. Virtual Memory: Demand paging; Performance of Demand Paging; page Replacement; Page Replacement Algorithms; Allocation of Frames; Thrashing; Other Considerations; Demand Segmentation. Cache memory and implementation. Secondary-Storage Structure: Disk Structure; Disk Scheduling; Disk Management; Swap-Space management; Disk Reliability; Stable-Storage Implementation. Section D File-System Interface: File Concept; Access Methods; Directory Structure; Protection; Consistency Semantics. File-System Implementation: File-System Structure; Allocation Methods; Free-Space Management; Directory Implementation ; Efficiency and Performance; Recovery. BOOKS Abrahanm Silberschatz, Peter Baer Galvin, Operating system Concepts, John Wiley & Sons, Inc., Vth Eduction, 2000. Deital H.M., An Introduction to Operating systems, Addison Wesley Publishing Co., 1984. Course CodeIT-4003 Credits-4L 3, T-1, P-0Name of the CourseDiscrete Mathematics & Logic DesignLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester-IV Discrete Mathematics & logic Design (IT-4003) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Mathematical Logic: Statements and Notation, Connectives; Negation; Conjunction; Disjunction; Statement Formulas and Truth Tables; Logical Capabilities of programming Languages; Conditional and Biconditional; Well-formed Formulas; Tautologies; Equivalence of Formulas; Duality Law; Tautological Implications; Formulas with Distinct Truth Tables; Functionally Complete Sets of Connectives; Other Connectives; Two-state Devices and Statement Logic; Normal Forms; disjunctive Normal Forms; Conjunctive Normal Forms; principal disjunctive Normal Forms; principal Conjunctive Normal Forms; ordering and Uniqueness of Normal Forms; Completely Parenthesized Infix Notation and Polish Notation; The Theory of Inference for the Statement Calculus; Validity Using Truth Tables; Rules of Inference; Consistency of Premises and Indirect Method of Proof; Automatic Theorem proving; The Predicate Calculus; predicates; The Statement Function, Variables, and Quantifiers; Predicate Formulas; Free and Bound Variables; The Universe of Discourse; Inference Theory of the Predicate Calculus, Valid Formulas and Equivalences; Some Valid Formulas over Finite Universes; Special Valid Formulas Involving Quantifiers; Theory of Inference for the Predicate Calculus; Formulas Involving More Than One Quantifier. Section B Permutations, Combinations and Discrete Probability: Introduction, The Rules of Sum and product; permutations; Combinations; Generation of Permutations and Combinations; Discrete probability, Conditional probability, Information and Mutual Information. Relations and Functions: Introduction, A Relational Model for Data Bases; properties of Binary Relations; Equivalence Relations and partitions; Partial Ordering Relations and Lattices; Chains and Antichains; A Job-Scheduling problem; Functions and the Pigeonhole principle. Section C Graphs and Planar Graphs: Introduction, Basic Terminology, Multigraphs and Weighted Graphs, Paths and Circuits; Shortest paths in Weighted Graphs; Eulerian paths and Circuits; Hamiltonian paths and Circuits; The Traveling Salesperson problem; Factors of a Graph; planar Graphs. Trees and Cut-sets: Trees, Rooted Trees, path Lengths in Rooted Trees; prefix Codes; Binary Search Trees; Spanning Trees and Cut-sets; Minimum Spanning Trees; Transport Networks. Section D Recurrence Relations and Recursive Algorithms: Introduction; Recurrence Relations; Linear Recurrence Relations with Constant Coefficients; Homogeneous Solutions; Particular Solutions; total Solutions; solution by the Method of Generating Functions; Sorting Algorithms; Matrix Multiplication Algorithms. Groups and Rings: Introduction, Groups; Subgroups; Generators and evaluation of Poers; Cosets and Lagranges Theorem; permutation Groups and Burnsides theorem; Codes and Group codes; Isomorphisms and Automorphisms; Homomorphisms and Normal Subgroups; Rings, Integral Domains, and Fields; Fing Homomorphisms; Polynomial Rings and Cyclic Codes. Books J.P.Trembley and R. Manohar, Discrete mathematical Structures with Applications to Computer Science, (Tata McGraw-Hill, 1997). C.L.Liu, Elements of Discrete Mathematics, 2nd Edition (Tata McGraw Hill, 1985). Course Code(ID) EC-4001 Credits-4L 3, T-1, P-0Name of the CourseDigital Communication Lectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester-IV Digital Communication (ID) (EC 4001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Analog to Digital Conversion: Noisy communication channels , the sampling theorem, low pass signals and band pass signals, pulse amplitude modulation , channels bandwidth for a PAM signal. Pulse amplitude modulation, sampling, signal recovery an holding, Quantization of signal, Quantization error, pulse code modulation (PCM), Delta Modulation , adaptive delta modulation . Section B Digital modulation techniques: Binary phase shift keying , differential phase shift keying, Differential encoded PSK, quadrature PSK, Quadrature Amplitude shift keying ( QSK) Binary frequency shift keying. Section C Data transmission: A baseband signal receiver, probability of error, the optimum filter, white noise- the matched filter, probability of error of the matched filter, coherent reception: correlation, correlation receiver for Q.PSK. Section D Noise in Pulse code and Delta Modulation systems: PCM transmission , Calculation of quantization noise, the O/P signal power, the effect of thermal noise , O/P signal to noise ratio in PCM, Delta modulation , Quantization noise in Delta modulation , the O/P signal to quantization noise ratio in delta modulation , O/P signal to noise ratio in delta modulation . Computer Communication System:Introduction , types of networks, Design features of computer communication network. Examples of Digital communication : ISDN, LAN, pocket radio and satellite, ATM , etc. Books: Taub and Schilling ,Principles of Communication systems (East West Press) John R. Freer , Principles of Communication an Network Course CodeIT-4004 Credits-4L 3, T-1, P-0Name of the CourseSystem Analysis and DesignLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester-IV System Analysis and Design (IT-4004) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Introduction To Systems(Overview): Definition of System, Common types of systems, Natural systems, Man-made system, Automated systems, General systems principles Participants to system development: Users, Management, Auditors, Systems analysts, Systems designers, Programmers, Operations personnel System development Life-cycle: phase 1: Systems Planning, phase 2: Systems Analysis, phase 3: Systems Design, phase 4: Systems Implementation, phase 5: Systems operation and support PHASE 1: Systems Planning Preliminary Investigation: Objectives and steps, Evaluation of systems requests, Evaluation of Projects, Overview of Feasibility, Operational Feasibility, Economic Feasibility, Organization Chart, Review current documentation Feasibility and Cost Analysis Tools: Classification of Costs and Benefits Cost-Benefit Analysis (Payback analysis, ROI & Present value analysis) Section B PHASE 2: Systems Analysis Determining Requirements: Role and requirement of system analysts, Systems requirements, Users requirements, Technical requirements, Interviews, Other fact finding techniques, Recording the facts Analyzing Requirements: Structured System Analysis, Functional Diagram, Data Flow Diagrams, Entity relationship diagrams, Identifying attributes, Data Dictionary: Documenting the data elements, data flows, data stores, processes, external entities, records and Reports Section C Phase 3: Systems Design Output Design: Introduction to output design, Types of output and information delivery, Designing printed reports, Designing screen output, Designing other outputs, Tools and Techniques of design Input Design: Introduction to Input design, Source document design, Input record design, screen design, automated design tools. Database design: The common problem of database design, An ideal database structure, Physical database design, Designing process, Physical storage structure design System Architecture: Processing methods, Processing functions, Processing support and software design. Section D Phase 4: Systems Implementation Application Development: Documentation review and application design, coding and testing the application. Documentation: Program documentation, system documentation, operations documentation and user documentation. Phase 5: Systems operation and support Overview: Systems support and maintenance activities Support Activities: User training and assistance, maintenance activities, Corrective maintenance, Adaptive maintenance, Perfective maintenance. Managing systems operation and support: Maintenance team, Configuration management, Managing system performance. Books Element of System Analysis. Marvin Gore, John Stubbe. Galgotia Book Source. 1994 Systems Analysis and design Methods. Whitten, Bently and Barlow. Galgotia Publication, 1995. Systems Analysis & Design, Elias M. Awad. Galgotia publication, 1995. Systems Analysis & Design, P.S. Grover, BPB Publication, 1994 System Analysis & Design, Harry Edwards. McGraw-Hill International Ed., 1995 Introduction to Systems Analysis &Design I.T. Hawryszkiewyez, Prentice Hill of India, 1994 Course CodeAS- 4001 Credits-4L 3, T- 1, P-0Name of the CourseProbability/Statistics/Queuing TheoryLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester-IV Probability/ Statistics/ Queuing Theory (AS 4001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section -A Introduction Theory of Probability, probability concepts, random experiment and events, Mathematical Notion, probability function, law of addition of probability, extension of general law of addition of probabilities, multiplication law of probability and conditional probability, extension of multiplication law of probability, probability of occurrence of at least one of the n independent events, independent events, pairwise independent events, conditions for mutual independence of n events, Bayes theorem, geometric probability. Random Variables and Distribution Functions: Randon variable, distribution function, discrete random variable, probability mass function, discrete distribution function, continuous random variable, probability density function, various emasures of central tendency, disperson, skewness and kurtosis for continuous distribution, continuous distribution function, stochastic independence, transformation of one-dimensional random variable, transformation of two-dimensional random variable Mathematical Expectation and Generating Functions: Mathematical expectation; expectation of function of a random variable, addition theorem of expectation, multiplication theorem of expectation, moments of Bivariate probability distributions, moment generating function, chebychevs inequality, generalized form of Bienayme-Chebychev inequality, convergence in probability, Probability Generating function, convolutions. Section B Discrete Distributions, Bernoulli Distribution, moments of Bernoulli distribution, binomial distribution, moments, moment generating function of binomial distribution, probability generating function of binomial distribution, fitting of binomial distribution, Poisson distribution, the Poisson process, moments of Poisson distribution, moment generating function of Poisson distribution, probability generating function of Poisson distribution, fitting of Poisson distribution, negative binomial distribution, moment generating function of negative binomial distribution, Normal distribution as a limit of binomial distribution and central limit theorem Geometric distribution, Lack of memory, moments of Geometric distribution, moment generating function of geometric distribution, power series distribution, moment generating function of p.s.d; recurrence relation for cumulants of p.s.d.; particular cases of g.p.s.d. Inequality between variance, moments and range of a variate probability distribution. Section C Measures of Central Tendency: Central tendency, arithmetic mean, median, mode. Measures of Dispersion: Meaning of dispersion, range, mean deviation, standard deviation, quartile deviation, measures of relative dispersion. Bivariate Frequency Distribution: Bivariate data, scatter diagram, correlation, correlation coefficient, properties of the correlation coefficient, calculation of correlation coefficient from grouped data. Regression lines, some important results relating to regression lines, theoretical distribution of two variables, limitations of the correlation coefficient, correlation index and correlation ratio. Multivariate Frequency distributions: Multivariate data, multiple regression, multiple correlation, partial correlation, expression of multiple correlation coefficient in terms of total and partial correlation coefficients, multivariate normal distribution. Section-D Queueing Models: Data Traffic Characteristic: Poisson process; Birth-Death Processes: Markov Chain Models; M/M/1 Queues: Delay and Littles Formula; M/M/S/K Queues: Average Queue Length, Delay and Waiting Time, Blocking Probability; M/G/1 Queues- Imbedded Markov Chains, Pollaczek-Kinchin Transform Formula, Delay Formula Using Residual Service Time; Network of Queues and Jacksons Theorem. Queueing Theory: Introduction, Queueing system, Elements of a Queueing System, Operating Characteristics of Queueing system, Probability distributions in Queueing system, Probability distributions in Queueing systems, Distribution of arrivals, Distribution of Inter arrival times, Distribution of Departures, Distribution of Service Times, classification of Queueing Models, Definition of transient and steady states, Poisson Queueing systems. Books Kishor S. Trivedi, Probability & Statistics with Reliability, Queuing, and Computer Science Applications, Prentice Hall of India Pvt. Ltd., 2000. A.M. Goon, M.K. Gupta & B. Dasgupta, Fundamentals of Statistics, Vol. 1, The World Press Pvt. Ltd., Calcutta, 2000. S.C.Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, Sultan Chand & Sons, New Delhi, 2001. J.N. Kapoor, Inequalities theory application and measurements, Mathematical Sciences Trust Society, New Delhi, 1997. Kanti Swarup, P.K. Gupta, Manmohan Operations Research, Sultan Chand and Sons, Educational Publishers, New Delhi, Ninth Edition (2000). Course CodeIT-4005 Credits-2L 0, T-0, P-2Name of the CourseOperating System lab (Windows NT)Lectures to be Delivered26 hours of lab work ( 2hrs each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Semester-IV Operating System Lab (Windows NT) (IT-4005) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. CASE STUDIES on the following operating Systems to be done in consultation with the faculty incharge for the course: Single user system :MS-DOS and Windows98 Network Operating Systems: WINDOWS 2000/Windows NT Multiuser Systems:UNIX/Linux Virtual Machine operating System Comparative features of operating systems if possible segment the work into 2 to 8 above. (A group of 2 or 3 students work on each area and prepare a report and present it as seminar to the group. The activity requires 20 hrs of work for each student). Implementation of commands text & icons Identification of command text/icon Executing the command Return of control to CLI (Command Language interpreter). Process management: Simulation various scheduling algorithms Memory management: CBI packages on virtual memory, cache memory, page replacement algorithms. File system and protection: Implement for documents Viruses and vaccines, computer security. Use application level commands like open, close, spell check or integrate, differentiate, Mat Mult, plot, evaluate. Note:- Record of the case studies to be presented as a project both electronically and hard copy for evaluation in groups of three students. Students will have to present seminars based on their case studies Course CodeIT-4006 Credits-2L 0, T-0, P-2Name of the CourseOperating System Lab II (LINUX/UNIX lab)Lectures to be Delivered26 hours of lab work (2hrs each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Semester-IV Operating System Lab- II (LINUX/UNIX lab) (IT- 4006) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. Study the Linux operating system and implement various commands and shell scripting. Implement the process synchronization using semaphores. Write the programme to mount the various devices (i.e. floppy, CD-Rom etc) Write a programme do the following thing Find the attribute of the file. To change the attribute of the file. Create the directory. Delete the directory. Create the file. Delete the file. Find the size of Hard Disk, RAM, and VRAM, cache. (Please do not use the system commands to these things). Implement the various scheduling algorithm (preemptive and non-preemptive). Implement the various page replacement algorithms. Simulate the various memory allocation methods. Paging. Segmentation. Virtual memory. Paged Segmentation. Protection and sharing. Design TSR. Implement various programs for virus and vaccine. Semester-IV Digital Communication Lab (EC - 4002) Course CodeEC- 4002 Credits-2L 0, T-0, P-2Name of the CourseDigital Communication LabLectures to be Delivered26 Hours of lab work (2 hrs each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25 Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of Experiments To study Digital to Analog Conversion. To study analog to Digital Conversion. To study amplitude Modulation. To study Frequency Modulation To study Sampling and reconstruction for TDM-PAM. To study and generate TDM-Pulse Amplitude modulation. To study Pulse code Modulation (PCM) To study delta modulation & dimod. Techniques To study adaptive delta modulation and demodulation technique. To study FSK. To study PSK, QPSK modulation techniques. To study QASK. Optical Fibre Bared Experiments (Any 3) To study PCM-TCM To study TDM-PAM Semester-IV Course Code(ID) IT-4007 Credits-2L 0, T-0, P-2Name of the CourseSAD ProjectLectures to be Delivered60 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 50Min. Pass Marks: 40% Maximum Time:3hrsLaboratory Continuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25SAD Project (ID) (IT-4007) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. Aim of this Project: Aim of this project is to equip student in the methodology of system analysis and design of a live project in the institution in which he is studying or in a place of work such as bank, school, college and office in the vicinity of the institute. This will be a guided project under the close supervision of the faculty of the institute. Project should be presented in the form of a project report giving a candidate system for solving a live problem. SEMESTER - V Course CodeIT-5001 Credits-4L 3, T-1, P-0Name of the CourseSoftware Engineering Lectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester-V Software Engineering (IT 5001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Introduction- Need for Software Engineering, issue in the design of large software, software life cycle models, overview of Software development process. Software Requirements Analysis and Specification: Requirements Engineering, Crucial process step, state of the practice, problem analysis; data dictionaries, entity relationship diagram, coad object diagram, approaches to problem analysis, Structured requirements definition, Structured analysis & design technique, Software Prototyping, Software requirements specification; nature of the SRS, characteristics of a good SRS, Organization of the SRS, Specifying Behavioral requirements; Finite state machine, decision tables & tree, PDL. Section B Software Metrics: What & Why: Definition, areas of applications, problems during implementation, sicze Metrics; The basic information Flow Model, the more sophisticated Information Flow Model, Metrics analysis: Using Statistics for Assessment, Problems with metric Data, the common of pool of Data, A pattern for successful applications. Software Project Planning: Cost Estimation: Models, Static, single Variable Model, Static, Multivariable Models, The constructive Cost Model: Basic Model, International Model, Detailed COCOMO Model, The Putnam Resource Allocation Model: The trade-off-of-time versus cost, Development sub-cycle, software Risk Management: What is Risk, Typical Software Risks, Risk Management Activities; Risk Identification, Risk Projection, Risk Management Activity. Section C Software Testing Techniques: Software Testing Fundamental testing objectives, testing principles, testability, test case design, white box testing, flow graph notation, cyclomatic complexity, driving test cases, graph matrices, black block testing, graph base testing methods, equalization partitioning, comparison testing, orthogonal Array testing, testing for real time system. Software Testing Strategies: Strategic approach to software testing, Verification and validation, unit testing, unit test procedures, Integration Testing, Top down Integration, Bottom Up Integration, regression testing, Smoke testing, Validation Testing, Alpha testing and Beta Testing, system testing; recovery testing, Security testing, Stress testing, performance testing. Section D Software Maintenance: What is software maintenance; Categories of Maintenance, Problem during maintenance, Potential solution to maintenance problems, the maintenance process: program understanding, generating particular maintenance proposal, Ripple Effect, Modified program testing, maintenance Models; Quick fix model, Iterative enhancement model, Reuse oriented model, Boehms model Estimation of maintenance cost; Beladay & Lehman model, Boehm model, Configuration Management; Configuration management activities, software version, change control process. Software Quality Assurance: Quality Concepts, quality, quality control, quality assurance, cost of quality, SQA Activities, cost impact of defects, defect amplication and removal, Review meeting, reporting and record keeping, statistical software quality assurance, software reliability, measure of reliability and availability. Books: Software Engineering A practitioner Approach, Roger. S. Pressman Software Engineering K.K. Aggarwal & Yogesh Course CodeHU-5001 Credits-4L 3, T-1, P-0Name of the CourseManagement for IT ProfessionalsLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- V Management for IT Professionals (HU-5001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Meaning, Nature and scope of management, The Emergence of Mangement thought, Japanese management vs. U.S Management; the management process Planning, Organising, Directing and controlling. Planning The Process, Premises; Types of Plans; The Process and Techniques of Decision Making. Decision Making: Bounded rationality, alternatives and their evaluation. Section B Organizing Meaning and Principles of Organization; Organizational Structure; Work Division, Departmentation; Organization charts, span of control, levels of management; delegation of authority, decentralization; line & staff relationship. Concepts of authority, responsibility, power and delegation, organizational culture, and climate. Section C Motivation Definition, content and process theories. Communication; Definition, process and barriers to communication. Leadership Meaning, theories and styles. Control Control process, Areas of control Section D Organisation theory Group dynamics: Tromp processes, group cohesiveness, stress management: Nature and potential sources of stress. Books: Joseph L. Massie; Essentials of Management Prentice Hall of India. Boone, Louis E. and David L. Kurtz; principles of Management, Random Books. McFarland, Vide balton E., Management: Principles and practices; McMillan Co. Dressler, Gray; Management Fundamentals; Modern Principles and practices, Reston Publishing. Newman, Summer and Warren; The Process of Management; Prentice Hall of India. Peter Drucker; The Practice of Management, Harper and Bros. L.M. Prasad; Principles and Practice of Management; Sultan Cand & Sons. J.S. Chandan; Management Theory and practice; Vikas Publishing House Pvt. Ltd. Koontz, H. and Weihrich, H., Essentials of Management. L.M. Prasad, Organisation Behaviour, Sultan Chand & Sons. Course CodeIT-5002 Credits-4L 3, T-1, P-0Name of the CourseDatabase Management SystemLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- V Database Management System (IT 5002) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Overview of DBMS, Components of DBMS: (users, languages, structure, data-dictionary, Data manager, DBA etc), File processing verses Data Management, File Oriented approach verses Database Oriented approach, SPARC 3-level architecture, A brief overview of three traditional models (hierarchical model, network model and relational model). Section B Properties of relational model { Codds 12 rules (Integrity rules (Concept of keys) ) }, Relational algebra ( select, project, cross product, joins (theta join, equi-join, natural join, outer join) ), Tuple relational calculus, Domain relational calculus, Entity-Relationship model as a tool for conceptual design entities, attributes and relationships, ER-diagram, Converting ER-model into relational schema. Section C Functional Dependences, Multi-valued Dependences, Normalization (up to 5th level), Structured Query Language (with special reference of SQL of Oracle): (INSERT, DELETE, UPDATE, VIEW definitions and use of Temporary tables, Nested Queries, Correlated nested queries, Integrity constraints: (Not null, unique, check, primary key, foreign key references), File Organization (Sequential file, index sequential file, direct files, Hashing, B-trees, Index files) Section D Query Processing (Introduction, Steps in Query Processing, General Processing Strategies, Query Optimization), Recovery and Security, Introduction to Object-Oriented Database, C/S Database, Knowledge Based Database & Distributed Database Management System. Books C.J. Date, An Introduction to Data Base Systems, 7th ed. Addison Wesley, 2000. Abraham Silberschatz, Henry F. Korth, S. Sudarshan, Database System Concepts, 3rd edition, The McGraw Hill Companies, Inc., 1997. Naveen Prakash, Introduction to Data Base Management, Tata McGraw Hill Publishing Company Ltd., New Delhi, 1991. Bipin C Desai, An Introduction to Database Masnagement System, H.M.HHhhhh Course CodeIT-5003 Credits-4L 3, T-1, P-0Name of the CourseComputer NetworksLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- V Computer Networks (IT-5003) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Introduction: Layered Network Architecture; ISO-OSI Model; Data Communication Techniques: Pulse Code Modulation (PCM); Differential Pulse Code Modulation (DPCM), Delta Modulation(DM), Data Modems, Multiplexing Techniques-Frequency-Division, Time-Division, Statistical time-Division Multiplexing, Multiplexing Hierarchies, Transmission Media Wires, Cables, Radio Links, Satellite Links, Fibre-optic Links. Error Detection: Parity Check Codes, Cyclic Redundancy Codes. Section B Data Link Protocols: Stop and Wait protocols: Noise free and Noisy Channels, Performance and Efficiency; Sliding Window protocols: Go Back and Selective Repeat ARQs, performance and Efficiency; Verification of Protocols using Finite State Machine; HDLC Data Link Protocol; Integrated Services Digital network: Interfaces, Devices; Channel Structure; Asynchronous Transfer Mode(ATM): ATM Cells, Header and Cell Formats, Layers in ATM, Class 1,2,3,4 Traffic. Local Area Networks (LANs): IEEE 802.3, 802.4 and 802.5 Protocols; performance of Ethernet and Token ring Protocols; FDDI protocol; Distributed Queue Dual Bus (DQDB) protocol Section C Network Layer protocols: Design Issues: Virtual Circuits and Datagrams; Routing Algorithms: Optimality principle, Shortest path routing Dijkstra, Bellman-Ford and Floyd-Warshall Algorithms, Flooding and Broadcasting, Distance Vector Routing, Link State Routing, Flow Based Routing, Multicasting Routing; Flow and Congestion Control: General principles, Window Flow Control, packet Discarding, Isarithmic Control, Traffic Shaping, Choke packets, RSVP; Dead Locks and their Avoidance; Network Layer in ATM; Interworking: Bridges, Routers and Gateways; Internet Architecture and Addressing Transport Layer protocols: Design Issues: Quality of Services, primitives; Connection Management: Addressing, Connection Establishment and Releases, Use of Timers, Flow Control and Bufferings, Multiplexing, Crash Recovery; Elements of TCP/IP protocol: User Datagram protocol (UDP)/TCP Layering, Segment Format, Check Sum, Timeout, Connection Management, Finite State Machine. Section D Session Layer protocols: Dialog Management; Synchronization; OSI Session primitives; Connection Establishment Presentation and Application Layer protocols: presentation Concepts; SNMP-abstract Syntex notation.1 (ASN.1), Structure of Management, Management Information Base; Cryptography: substitution and Transposition Ciphers; Data Encryption Standards (DES), DES Chaining, Breaking DAS, Public Key Cryptography, Authentication Protocols; Electronic Mail; World Wide Web. BOOKS A.S. Tanenbaum, Computer Networks, Second Ed., Prentice Hall, India J.F. Hayes, Modelling and analysis of Computer Communication Networks, Plenum Press (Reprinted in India by Khanna Publishers). D.Bertsekas and R.Gallager, Data Networks, Second Ed., Prentice Hall, India. D.E.Comer, Internetworking with TCP/IP, Vol. 1, Prentice Hall, India. G.E.Keiser, Local Area Networks, McGraw Hill, International Edition. W.Stalling, Data & Computer Communication, Maxwell Macmillan International Edition. Semester- V Course CodeIT-5004 Credits-4L 3, T-1, P-0Name of the CourseVisual ProgrammingLectures to be delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Visual Programming (IT-5004) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A VB environment, Properties, Methods, use of object browser, Basic Programming convention in VB, Menu and Tool bars and Programming fundamentals, flow control statements. Dialog control, Ms Common control, MDI, Control array. Section B VB Design elements, concept of classes in VB Procedures and function in VB, file handling, shell Programming, OLE, Active X in VB, win 32 AP1 in VB and AP1viewer. Section C Sql query processing and Data base basics, Data Control and Data bound control, DAO and ADO, creating reports in VB, Data aware classes, Active x environment, packaging and deployment in VB. Section D Advance VB (Developing Add in VB) CDO and MAP1 Programming, Advance ADO Techniques, VB Script, and ASP in VB, VB and Internet programming. Books: Brian Siler and Jeff spots: Using Visual basic6, by (Pub. PHI) Professional Visual basic 6 Database programming by wdox Publishers. O Reilly:Developing Visual Basic Add ins by Romen Pub. Win 32 API Programming with Visual basic by Roman Pub. OReilly. Visual Basic Shell Programming by Hamilton Pub. Oreilly CDO and MAP1 Programming in Visual basic by Grundgeiger Pub. OReilly. Visual Basic Oracle 8 Programmers reference by Tretsch Pub. OReilly. Visual basic 6.0 business Objects by Lhotka Pub Oreilly. VB. Com: Visual basic 6 Progrmmers intro to Com by Lewis Pub. OReilly. Professional VB6 Application Development Pub wrox. Semester- V Course CodeEC- 5001 Credits-4L 3, T-1, P-0Name of the CourseMicroprocessor, Micro Computers and InterfacesLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Microprocessor, Micro Computers and Interfaces (EC-5001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each question will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Microprocessors; Microprocessors Instruction Set and Computer languages; From Large Computers to Single-Chip Micro controllers. Microprocessor Architecture and Its operations; Memory; Input and Output(I/O) Devices; Example of a Microcomputer System; Review: Logic Devices for Interfacing. The 8085 MPU; Example of an 8085 Based Microcomputer; Memory Interfacing; Interfacing the 8155 Memory Segment; Testing and Troubleshooting Memory Interfacing Circuits; How Does an 8085 based Single-Board Microcomputer Work? Basic Interfacing Concepts; Interfacing Output Displays; Interfacing Input Devices; Memory-Mapped I/O; Testing and Troubleshooting I/O Interfacing Circuits. Section B The 8085 programming Model; Instruction Classification; Instruction and Data Format; How to Write, Assembly and Execute a Simple program; Overview of the 8085 Instruction Set. Data Transfer (Copy) Operations; Arithmetic Operations; Logic Operations; Branch Operations; Writing Assembly Language programs; Debugging a program; Some Puzzling questions and Their Answers. Programming Techniques: Looping, Counting, and Indexing; Additional Data Transfer and 16-Bit Arithmetic Instructions; Arithmetic Operations Related to Memory; Logic Operations: Rotate; Logic Operations: Compare; Dynamic Debugging. Counters and time Delays; Illustrative program: Hexadecimal Counter; Illustrative program: Zero-to-Nine (Modulo Ten) Counter; Illustrative Program: Generating Pulse Waveforms; Debugging Counter and Time-Delay Programs. Stack; Subroutine; Restart, Conditional Call, and Return Instructions; Advanced Subroutine Concepts. Section C The 8085 Interrupt; 8085 Vectored Interrupts; Restart as Software Instructions; Additional I/O Concepts and Processes. Digital-to-Analog (D/A) Converters; Analog-to-Digital (A/D) Converters. 8155 I/O and timer; 8279 Keyboard/Display Interface: Basic Concepts in programmable Devices; The 8155: Multipurpose programmable Device; the 8279 programmable Keyboard/Display Interface. Section - D The 8255A programmable Peripheral Interface; Illustration: Interfacing Keyboard and Seven-Segment Display; Illustration: Bidirectional Data Transfer Between Two Microcomputers; The 8254 (8253) programmable Interval Timer; The 8259A programmable Interrupt Controller; Direct Memory Access (DMA) and the 8237 DMA Controller Basic Concepts in Serial I/O; Software-Controlled Asynchronous Serial I/O; The 8085-Serial I/O Lines: SOD and SID; Hardware-Controlled Serial I/O Using Programmable Chips. Study of Architecture of Pentium family processor Processor, registers, mmu, instruction set, on chip cache, interfaces. (Only Brief Discussion) BOOKS Ramesh S. Gaonkar, Microprocessor Architecture, programming, and Applications with 8085, 4th edition, Penram International Publishing(India), 2000. Aditya P. Mathur, Introduction to Microprocessors, 3rd edition, Tata McGraw Hill Publishing House, New Delhi, 1989. Y. Rajasra, Advance Microprocessor, New Age International Publishers, New Delhi. Course CodeIT/EC -5005 Credits-2L 0, T-0, P-2Name of the CourseMicroprocessor & Computer Network LaboratoryLectures to be Delivered26 hours of lab work ( 2hrs each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 40 Maximum Time:3hrsContinuous AssessmentLab work 30%, Lab Record 25%, Viva 25%, Attendance 20%Max. Marks: 50Min. Pass Marks: 25Semester-V Microprocessor & Computer Network Laboratory (IT/EC-5005) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. Section A Computer Networks: Construct a network of 2 or 3 system. Simple communication between the systems in exchanging a binary word. Encryption and decryption on the ASCII character set being transmitted. Experimentation with standard set of protocols (Tanebaum) Experimentation with protocol kit Experimentation with modulation Asure cables, connections, crimping JDM Bridges, Routers, Hubs etc. Note:- Record to be maintained in the laboratory record book for evaluation. Section B Microprocessor Laboratory This laboratory will based on microprocessor 8085 + 8086 kits with following interfaces: Key board & display Analog to Digital conversion using DAC Analog to Digital conversing using Dual slope ADC Elevator simulator Logic controller Stepper motor DC motor General purpose PCB with connector Crystal Oscillator Modulator/Demodulator Serial data communication A few experiments, which can be performed (to be detailed later on) Hexadecimal addition Count up/count down Timing delay Flash a message like UP Moving display Display the code for the key pressed on the key-board Display a digital clock with minutes and seconds Interfacing motor, keyboard etc. Note:- Record to be maintained in the laboratory record book for evaluation. Semester-V Course CodeIT-5006 Credits-2L 0, T-0, P-2Name of the CourseVisual Programming LaboratoryLectures to be Delivered26 hours of lab work (2 hrs each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 40% Maximum Time:3hrsContinuous Assessment Lab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Visual Programming laboratory (IT 5006) Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of Practicals Basic VB programming Active x Screen Saver Report Writing ADO programming and Databases VB Script and ASP LAYERS Business Objects Classes in VB Projects Inventory Control using VB Data conversion utility in VB Editor and text handling Projects. Creation of Dynamic site using ASP and VB script Encryption control using Active X library transaction wizard. Semester-V RDBMS laboratory (IT-5007) Course CodeIT-5007 Credits-2L 0, T-0, P-2Name of the CourseRDBMS LaboratoryLectures to be Delivered26 hours of lab work ( 2hrs each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 40 Maximum Time: 3hrsContinuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Instructions for paper setter/ Candidates Laboratory examination will consist of two parts: Performing a practical examination assigned by the examiner (25 marks Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. C. RDBMS Familiarization with RDBMS (ORACLE/FOXPRO using VISUAL BASIC as front end) & developing a small application. Create a database and write the programs to carry out the following operation: Add a record in the database Delete a record in the database Modify the record in the database Generate queries Generate the report List all the records of database in ascending order. Develop a menu driven project management of database system: Library information system Engineering MCA Inventory control system c) Computer Lab d) College Store Student information system Academic Finance Time table development system CSE, IT & MCA Departments Electrical & Mechanical Departments Usage of S/W: VB, ORACLE and /or DB2 VB, MSACCESS VB, MS SQL SERVER 2002 Note: At least 5 to 10 more exercises to be given by the teacher concerned. Semester-V Vocational Training (ES 5001) Course CodeES-5001 Credits-0L 0, T-0, P-0Name of the CourseVocational Training Semester End Examination Max. Marks: 50Min. Pass Marks: 40 Maximum Time:3hrsContinuous AssessmentLab work 30%, Lab Record 25%, Viva 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25 Instructions for paper setter/ Candidates This training will be related to Industrial Projects/ Software Projects to be undertaken under the guidance of Faculty preferably at Industry/ Software Park/ Incubation Centre or related areas. This may also be undertaken with in the Institute. This training will be undertaken during vacation. Student is supposed to submit the project report at the end of the training. Evaluation will be based on Project Report, presentation and comprehensive Viva-voce examination related to the project. SEMESTER - VI Course CodeIT-6001 Credits-4L 3, T- 1, P-0Name of the CourseManagement Information Systems Lectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VI Management Information System (IT 6001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Introduction to MIS: Meaning and role of MIS, Definition of MIS, Systems approach to MIS, MIS organization within a company. MIS Planning: General business planning Derivation of MIS plans, Prioratisation and development strategies. Section B Conceptual Design of MIS: Definition of the problem , System objectives and system constraints, Analysis of information source, Conceptual system design document. Section C Detailed Systems design and Implementation: Application of basic systems design concepts to MIS, Involvement of end-user and role of MIS department and system Analyst. Role of Top Management during design and implementation. System evaluation. Review and update. Section D Discussion of the following MIS in a standard layout given in the note below. MIS for Accounting and Finance Function (see note at end) MIS for Personnel Systems (see note at end) MIS for Marketing Systems (see note at end) Note: Key Information Needs Transaction processing and Management Control Reports Design and Data Collection Methods: routing frequency etc- Input Output Control Reports Books Information System for Modern Management, Murdick, Ross & Claggett, Prentice-Hall of India. Management Information Systems, S Sadgopan, Prentice Hall of India Introduction to computer Information systems for Business, Mark G. Simkin, S. Chand & Co.1996. Management information systems, James A. Obrien, Galgotia publications. 1994. John Dearden & F.Warran MC Farlan MANAGEMENT INFORMATION SYSTEM --- TEXT AND CASES Course CodeIT-6002 Credits-4L 3, T- 1, P-0Name of the CourseWeb TechnologyLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VI Web Technology (IT 6002) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Internet: Its Architecture/structure, Current Developments modes of connecting to Internet, ISP, Internet Addressing, DNS, Hypermedia approach to seamless Integration of Information distribution like FTP, Telnet etc, MM Privacy & Security Topics: Digita Signature, firewalls, Encryption scheme etc. Section B Introduction to Web: Structure of Web pages, Basic principles of web page desing, Design and Implementation guidelines, focus on communication, case of navigation within pages. Listing of sites in database + directories. Searching Method adopted by search engine Server: Introduction to web servers: PWS, IIS, Apache Accessing & using these Servers. Section C Technique & Tools for web page design: HTML/ DHTML, Dream weaver, Flash, Macromedia directors Java Script: Java Script Language, Client & Server and programming. Form & data in Java Script. Section - D Web Database & Database Access Issues: Middleware & Current Middleware Technologies, Transaction processing Issues capacity planning, data transfer Ratio, Recovery procedure, Reliable. Books John R. Hubbard, Programming with JAVA; Schaums Outline Series, McGraw Hill International Edition (1999). Joseph L. Weber, Using Java 2 Platform, Prentice Hall of India Pvt. Ltd., 2000. Chuck Musciano & Bill Kennedy, HTML & XHTML: The Definitive Guide, OReilly & Associates Inc., 4th Edition, Aug. 2000. Ian S. Graham, XHTML 1.0 Language and Design Sourcebook, John Wiley & Sons, Inc., 2000. Peter Rossbach, Hendrik Schreiber, Java Server & Servlets, Pearson Education Ltd., 2000. The Java Developers Toolkit, Joshu Marketos, John Wiley & Sons, 1997. Java Script: Peercelll Mara. ABC of Java Script, BPB Publications Network fire wall, Kironjeet Syan, New Riden Pub.  HYPERLINK "http://www.seeinf.com" www.seeinf.com  HYPERLINK "http://www.hackers.com" www.hackers.com web Stragies www unleushed Web Technology & Design, c. Xavier, New Age International Publishers, New Delhi Course CodeAS-6001 Credits-4L 3, T-1, P-0Name of the CourseNumerical and Stat Methods & Scientific Computing Lectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VI Numerical And Stat Methods & Scientific Computing (AS 6001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Computer Arithmetic and Errors: Representation of integers and real numbers in computers. Fixed point arithmetic. Floating point arithmetic, Normalized floating point numbers , Errors due to storage imitations and safeguards, Round off and truncation errors, Relative and absolute errors Solution of Non-linear equations: Bisection method for solution of a single non-linear equation, rate of convergence of the solution. Newton-Raphson method for solution of a single non-linear equation. Radius of convergence. Generalization to several non-linear equations. Section B Interpolation and extrapolation: The Lagrange interpolating polynomial, The Gregory-Newton interpolating polynomial. The difference table and error propagation in calculating the differences. Approximating differentials using finite differences. Uniqueness of the interpolating polynomial. Numerical differentiation and integration: Numerical differentiation: Method based on finite differences, The trapezoidal rule with error estimate. The Simpsons rule with error estimate. The Gaussian quadrature methods with error estimates. Section C Solution of ordinary differential equations: Taylor series method. Eulers method with estimate of error and error propagation. Runge-Kutta methods with error estimates and error control using step size adjustment. Predictor-Corrector methods with error estimates. Solution of systems of linear equation: Gaussian elimination with pivoting. Iterative improvement of solution vector. Gauss Jordan method for finding the inverse of a matrix. Gauss Siedel method together with convergence criterion. Section D Matrix Diagonalisation: Unitary transformations. Jacobis method for diagonalization of real symmetric matrices. Statistical methods: Curve fitting using least-square method. Determining the goodness of fit using the chi-square test. Generation of pseudo-random numbers. Introduction to Monte-Carlo method for numerical integration. Introduction to genetic algorithm for optimization. Books: M.K. Jain, S.R.K. Jain, Numerical Methods for Scientific and Engineering Computation (1993), New Age Int.(P) Ltd. , New Delhi. I.R. Miller, J.E. Freund and R. Johnson, Probability and Statistics for Engineers.(1990), Prentice-Hall of India, New Delhi. S.D. Conte and C. de Boor Elementary Numerical Analysis(1980), McGraw Hill Publications E. Kreyszig Advanced Engineering Mathematics, Wiley Eastern Ltd. (7th edition),New Delhi. P.L. Meyer Introductory Probability Statistical Applications, Oxford and IBH Pvt. Ltd.(second edition), New Delhi. Course CodeIT-6003 Credits-4L 3, T- 1, P-0Name of the CourseArtificial IntelligenceLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VI Artificial Intelligence (IT-6003) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Scope of AI: Games, theorem Proving, Natural language Processing, Vision& speech processing, Robotics, Expert Systems AI techniques- Search, Knowledge, Abstraction. Problem Solving , State space search , Control Strategies, Depth first search, Breadth first search, Production system, Problem Characteristic, Decomposable, ignorable, recoverable, predictable. Use of Heuristics, Hill climbing, Best first search, A* algorithm: Admissibility, AND/OR graph 0 AO*, Constraint satisfaction, Cryptoarithmetic, Waltz line Labelling Game Playing, Minimax search, Alpha Beta pruning Knowledge Representation, Predicate Logic, Well formed formulas, quantifiers,. Prenex Normal Form. Skolemization. Unification, modus pones. Resolution refuation- various strategies Rule Based Systems, Forward reasoning: Conflict resolution, Backward reasoning: Use of No backtrack Structured Knowledge Representations. Semantic net: Slots, Inheritance; Frames exceptions and defaults- attached predicates; Conceptual dependency formalism, Object Oriented Representation. Section B AI Programming Languages PROLOG: Syntax, Procedural and Declarative meanings, Prolog unification mechanism, Anonymous variable, Lists, Use of fail, CUT, not LISP: Basic Concepts, Eval Function, Function and variables, Scoping of LISP variables, Iteration and recursion. Section C Handling uncertainty: Probabilistic reasoning, Bayes Net, Dempster shafer Theory: Use of certainty Factors, Fuzzy Logic, No monotonic reasoning, Dependencdirectedbackt, Truth maintenance systems. Learning: Concept of learning, learning automation, The Genetic algorithm, Learning by induction, Neural Networks: Hop field Networks, Perceptions-Learning algorithm, Back propagation Network, Boltzman Machine Section D Planning: Components of Planning system, Plan Generation Algorithms: Forward State Propagation, Backward State Propagation, Nonlinear Planning using constraint posting. Expert Systems: Need & justification for expert systems Coginitive problems, Expert Systems architectures: Rule Based systems, Non production systems, Knowledge acquisition, Case studies : MYCIN,RI. Natural Language Processing : Sysntactic analysis, Top down and bottom up parsing, Augmented Transition Networks, Semantic analysis, case grammars. Books Artificial Intelligence-E. Rich & K. Knight, Tata McGraw Hill (2nd Edition) Introduction to AI and Expert Systems D.W.Paterson, Prentice Hall of India (19920 Introduction to Expert Systems Peter Jackson, Addison Wesley publishing Compaby Artificial Intelligence, an Engineering Approan R.J. Schalkoff, McGraw Hill International Edition Principles of AI N.J. Nilsson, Narosa Publishing House Programming in PROLOG Clocksm 7 Mellish, Narosa Publishing House Rule Based Expert System- M. Sasikumar, S. Ramani, Narosa Publishing House Artificial Intelligence- P.H. Wisnston, 2nd edition, Addison- Wesley, 1884. Course CodeIT-6004 Credits-4L 3, T-1, P-0Name of the CourseMultimedia TechnologyLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VI Multimedia Technology (IT 6004) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course . For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Introduction: Motivation, Module Overview, Evolution of Multimedia, Structure and components of Multimedia, Application Domains, Internet and Multimedia, Multimedia and Interactivity, Primary User-Interface Hardware: - Mouse, Keyboard, Joystick., Primary Visual Interface Items :- Window, Buttons, Textbox, Icons. Basic Metaphors:- Slide Show, Book, Hypertext., Hypertext, Hypermedia, Browsers and helper Application overview, User Interface Design Issues. Technology: Sound and Audio, Psycho accoustics- Frequincy and amplitude sensitivity of hearing music and noise, stereo effects,. Masking. Frequency domain compression of analog sound signal, Digitisation of audio-signal- samplong and coding , Digital audio signal processing, Architecture of a Sound Card, Elementary Concept of Music, pitch and voice, Staff notation and scoring, Electronic Music and Synthesiser, MIDI interface, Protocol and data Format. Section B Image and Graphics, Principles of Raster Graphics, Computer Visual Display concepts, Resolution, Colour and pallets, Refresh rates and graphic accelerators, Digital image Representation and Formats, Graphic drafting Tools, Image processing and enhancement, Colour printer principles, Image scanner principle, File formats, Digital still Camera and photography. Animation and Special effects : animation Principles, Survey of animation Tools, Special visual effects-wiping, morphing etc, Video Technology: Analog Video , Principles Broadcast standards , CCD Camera, Recording formats and standard, Digital Video, Principles , PC Video and Videoconference standards, TV Cards, Frame Grabber Principles, IDTV and H.D.T.V. principles, Motion Picture to Video Conversion Section C Data Compression :Data Compression Requirement , Information Theory based and frequency domain based and compression, Basic Compression Techniques: DPCM, Runlength Coding, Huffman Coding, JPEG/ISO, Realtime encoding and CCITT H.261 (px64) standard, MPEG-1and II, DVI. Multimedia Document and Interchange formats: Hypertext, HTML, MHEG and Hypermedia, SGML, Open document Architecture (ODA), QuickTime Movie film format, Open Media framework (OMFI). Section D Synchronisation: Temporal Dependence in Multimedia presentation, Inter-Object and Intra-Object Synchronisation, Time Abstruction for authoring and visualization, Reference Modle and Specification, Application Development: Product development overview, Life cycle Models, Human Roles and Teamwork, Product Planning, Basic Authoring Paradigms: story Scripts, Authoring Metaphors and authoring Languages, Content Analysis; Message, platform, Metaphor and Navigation, Cost-quality tradeoffs, Intellectual Property Right and Copyright Issues. Books: Multimedia Systems Design, P.K.Andleigh and K. Thakrar,. Prentice hall PTR,1996. Multimedia Computing, Communications & Applications, Ralf Steinmetz and Klara Nashtedt, Prentice Hall 1995. Creating Multimedia Presentations, Douglas E. Wolfgram, Que. Crop.,1994. Multimedia Authoring: Building and Developing Documents, Scott Fisher, AP Professional, 1994. Multimedia Systems, Ed. By John F. K. Buford, Addison Wesley Publishing Co., 1994. Multimedia Technology & Applications, David Hillman, Galgotia Publications. Multimedia Systems, Rajneesh Agrawal, Excel Books. Digital Multimedia, Nigel Chapman & Jenny Chapman, Wiley Publications. Fundamentals of Computer Graphics and Multimedia, D.P. Mukherjee, Course CodeIT-6005 Credits-4L 3, T-1, P-0Name of the CourseParallel Computing Lectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VI Parallel Computing (IT-6005) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Review of Computer Architectures, A Taxonomy of MIMD Computers, Multi-vector and SIMD, Computers, Vector Supercomputers SIMD Supercomputers PRAM and VLSI Models: Parallel Random Access Machines, VLSI Complexity Model Architectural Development Tracks: Multiple Processor Tracks, Multi-vector and SIMD Tracks, Multithreaded and Dataflow Tracks Conditions and Parallelism: Data and Resource Dependences, Hardware and Software parallelism, The role of Compilers Program partitioning and scheduling: Grain Sizes and Latency, Grain Packing and Scheduling, Static Multiprocessor Scheduling Program Flow Mechanisms: Control flow Mechanism , Demand-Driven Mechanism, Comparison of Flow Mechanisms, System Interconnect Architectures: Network properties and Routing, Static Connection networks, Dynamic Connection Networks. Section B Performance Metrics and Measures: Parallelism Profile in Programs, Harmonic mean Performance, Efficiency, Utilization and Quality, Standard Performance Measures Speedup Performance Laws: Amdahls law for a fixed workload, Gustafrons Law for Sealed problems Scalability Analysis and Approaches: Scalability metrics and Goals, Evolution of Scalable Computers Advance processor Technology: Instruction set architecture, CISC and RISC Scalar processors Superscalar and Vector Processors: Superscalar Processors, The VLIW Architecture, Vector and Symbolic processors Memory Hierarchy Technology: Hierarchical Memory Technology Inclusion, Coherence and Locality, Memory Capacity Planning. Section C Multiprocessor System Interconnects: Hierarchical Bus system, Crossbar Switch and Multiport Memory, Multistage and Combining networks Cache Coherence and Synchronization Mechanisms: The cache coherence problem, Snoopy bus protocol, Hardware Synchronization Mechanisms Vector processing principles: Vector Instruction Types , Vector Access Memory Schemes Multivector Multiprocessors: Performance- Directed Design rules, Cray Y MP,C-90 and NTP SIMD Computer Organization : Implementation Models, The CM-2 architecture Section D Software for Parallel programming : Shared-variable Model, Message-passing Model, Data-parallel Model, Object-Oriented Model, Functional and Logic Models Parallel Languages and Compilers: Language features for parallelism, Parallel Langualge Constructs, Optimizing Compilers for parallelism Parallel Programming Environment: Software Tools and Environment , Y-MP, Paragon and CM-5 Environment, Visualization and Performance Tuning Synchronization and Multiprocessing Modes: Principles of synchronization, Multiprocessor execution Models , Shared-Variable Program Structures, Locks for Protected access, Semaphores and Applications, Monitors and Applications, Message-passing program Development, Distributing the Computation, Synchronous Message passing, Asynchronous message passing Mapping programs on to Multicomputers: Domain Decomposition Techniques, Control Decomposition techniques, Heterogeneous processing. BOOKS: - Kai Hwang: Advance Computer Architecture- Parallelism, Scalability and Programmability, McGraw-Hill International Edition,Computer Series, 1993. Michael J. Quinn: Parallel Computing theory and Practice, McGraw Hill International Edition, Computer Science Series, 2nd Edition, 1994. S.G. Akl: Design and Analysis of parallel algorithms, Prentice hall, Englewood Cliff NJ. S. Lakshmivarahan and S.K. Dhall: Analysis and Design of Parallel Algorithms-arithmetic and Matrix Problems, McGraw Hill International Edition, Computer Science Series. 1990. A practical approach to parallel Computing by S K Ghosal, Universities press (India) Limited. Semester- VI Artificial Intelligence Laboratory (IT 6006) Course CodeIT-6006 Credits-2L 0, T-0, P-2Name of the CourseArtificial Intelligence Lectures to be Delivered26 hours of lab work (2hrs each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsContinuous Assessment Lab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Instructions for paper setter/ Candidates Laboratory examination will consist of three parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. List of Practicals 1. Implement these practical in Lisp or Prolog in which you feel comfortable Depth-bounded depth first search. Iterative Deepening Search. Best First Search. A* Search AO* Search Minmax Search Alpha Beta pruning 2. Solve the Water Jug problem using AI technique 3. Solve the missionaries problem using AI technique 4. Design the following expert system using Lisp or Prolog in which you feel comfortable Whether forecasting System. Legal expert System. 5. Design parser for NLP using Lex and Yacc utilities. Course CodeIT-6007 Credits-2L 0, T-0, P-2Name of the CourseWeb Technology LaboratoryLectures to be Delivered26 hours of lab work (2 hrs each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20Maximum Time:3hrsContinuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Semester- VI Web Technology Laboratory (IT-6007) Instructions for paper setter/ Candidates Laboratory examination will consist of three parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. To create dynamic animation, simulations and interactive web pages using HTML, Java Script. Create databases using: HTML/Java Script/DHTML A. WEB TECHNOLOGY Setting up intranet Learning of tools DHTML, flash, director Design of web pages/sites Development of web pages/site Evaluation of web site Registering of website Course CodeAS-6002 Credits-2L 0, T-0, P-2Name of the CourseScientific Computing Laboratory/ Parallel Computing Laboratory Lectures to be Delivered26 hours of lab sessions ( 2hr each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 40% Maximum Time:3hrsContinuous Assessment Lab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Semester- VI Scientific Computing Laboratory/ Parallel Computing Laboratory (AS 6002) Instructions for paper setter/ Candidates Laboratory examination will consist of three parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. Usage of FORTRAN 77/90 for implementation of following programs. Finding the root of a non linear equation by (a) Bisection method (b) Newton Raphson method. Two point & Three point numerical differentiation with error estimates Integration by Simpson rule with error estimate. Integration by Gaussian Quadra lure with error estimate Solving an ordinary differential equation using four point Runge Kutta Method with error estimate & Control. Solution of a system of Linear equations by Gaussian-elimination Mehtod Diagonalization of Real symmetric Matrix. Evaluating a 3 dimensional integral using Monte Carlo method of integration Parallel Programming Developing following elementary programs in FORTRAN 77/C for implementation on parallel machines: Fork and Node identity Expression evaluation Matrix Addition Matrix Multiplication Linear Curve fit Gaussian elimination Simpsons 1/3rd rule. Semester- VI Course CodeIT-6008 Credits-2L 0, T-0, P-2Name of the CourseMultimedia Technology LaboratoryLectures to be Delivered26 hours of lab work (2 hrs each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time: 3hrsContinuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Multimedia Technology Laboratory (IT-6008) Instructions for paper setter/ Candidates Laboratory examination will consist of three parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. 1. Using available Multimedia software like Photoshop, Macromedia, Generator, Flash to create Backgrounds Titling Icons Pulls Buttons & Bullets Menu Bars Animation (Rotate, fade, Morquee, Twirl, Morphing etc. and submit a project in consultation with instruction tutor incharge. Overview of Flash 5 a) Menu b) Lasso Tool c) Arrow Tool d) Pen Tool Working with Drawing and Painting Tool Working with Bitmap and Raster Graphics Sound and Movie Understand of Action scripts 3D graphics Animation Write a program to read a paragraph and store it in suggested format. Study the pions notes and stimulate them using key board and store them in file. Write a program to play wave, mid file Project: Create a HTML based static website Create a Animated movie in flash Create a full motion video movie in flash Create a post table game in flash. Course CodeGP-6001 Credits-L , T-, P-Name of the CourseSeminarSemester End Examination GradingTime: 30 minutes LaboratoryBased on presentation & evaluation of terms paper Grading V. Good Good Fair PoorSemester- VI Seminar (GP 6001) The Seminar will be on topics of current technologies in the area of Information Technology student will select a topic of his/her interest and present a seminar to the faculty and students of his branch of Engineering. The student will also submit a term paper on the topic of his seminar. Participation in this seminar will be compulsory. The grading will be done by a team consisting of Head of the Department and two faculty member of the concerned branch. The candidate will be grades as V. Good Good Fair Poor SEMESTER - VII Course CodeIT-7001 Credits-4L 3, T- 1, P-0Name of the CourseNatural Language ProcessingLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII Natural Language Processing (IT-7001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Introduction: Knowledge in Speech and Language processing, Ambiguity, Models and Algorithms, Language, Thought, and Understanding, The state of the Art and the Near-Term future, Some Brief History, Foundational Insights: 1940s and 1950s,The Two Camps: 1957-1970,Four paradigms: 1970-1983,Empiricism and finite State Models Redux: 1983-1993, The field comes Together: 1994-1999,On Multiple Discoveries. Regular Expressions and Automata: Regular Expressions, Basic Regular Expression patterns, Disjunction, Grouping and Precedence, Examples, Advanced Operators, Regular Expression Substitution, Memory, and ELIZA, Finite-State Automata, Using an FSA to recognize Sheeptalk, Formal Languages, Another Example, Non-Deterministic FSAs, Using an NFSA to Accept Strings, Recognition as Search, Relating Deterministic and Non-Deterministic Automata, Regular Languages and FSAs, Word Classes and Part-of-Speech Tagging:(Mostly) English Word Classes, Tagsets for English, Part-of-speech Tagging, Rule-Based part-of-speech, Stochastic Part-of-Speech Tagging, A Motivating Example , The Actual Algorithm for HMM Tagging, Transformation-Based Tagging, How TBL Rules are applied, How TBL Rules are learned, Other Issues , Multiple Tags and Multiple Words, Unknown Words, Class-based N-grams. Section B Context-Free Grammars for English: Constituency, Context-Free rules and Trees, Sentence-Level Constructions, The Noun Phrase, Before the Head Noun, After the noun , Coordination, Agreement, The Verb Phrase and sub categorization, Auxiliaries, Spoken Language Syntax, Disfluencies, Grammar Equivalence and Normal form, Finite-State and Context-free Grammars, Grammars and Human Processing , Summary, Bibliographical and Historical, Notes, Exercises Parsing with Context-Free Grammars: Parsing as Search, Top-Down Parsing, Bottom-Up Parsing, Comparing Top-Down and Bottom-Up parsing, A Basic Top-Down Parser , Adding Bottom-Up Filtering, Problems with the Basic Top-Down parser, Left-Recursion, Ambiguity, Repeated parsing of Subtrees, The Earley Algorithm , Finite-State parsing Methods Features and Unification: Feature Structures, Unification of Feature Structures, Features Structures in the Grammar, Agreement , Head Features, Sub categorization, Long-distance Dependencies, Implementing Unification: Unification Data Structures, The unification Algorithm, Parsing with unification Constraints: Integrating Unification into an Earley Parser, Unification Parsing; Types and Inheritance, Extensions to Typing , Other Extensions to unification. Section C Representing Meaning: Computational Desiderata for representations, Verifiability, Unambiguous Representations, Canonical form, Inference and Variables, Expressiveness, Meaning Structure of Language , Predicate-Argument Structure, First Order Predicate Calculus, Elements of FOPC , The Semantics of FOPC, Variables and Quantifiers, Inference, Some Linguistically Relevant, Concepts, Categories , Events, Representing Time, Aspect, Representing Beliefs. Pitfalls, Related Representational Approaches, Alternative approaches to, Meaning, Meaning as Action, Meaning as Truth Semantic Analysis: Syntax-driven Semantic analysis, Semantic Augmentations to Context-Free Grammar Rules, Quantifier Scoping and the Translation of complex-Terms, Attachments for a Fragment of English , Sentences , Noun Phrases, Verb Phrases, Prepositional Phrases, Integrating Semantic Analysis into the Earley parser, Idioms and Compositionality, Robust Semantic Analysis, Semantic Grammars, Information Extraction. Section D Discourse: Reference Resolution, Reference phenomena, Syntactic and Semantic;Preferences in Pronoun Interpretation, An Algorithm for pronoun Resolution, Text Coherence, The Phenomenon, An Inference Based Resolution Algorithm, Discourse Structure, Psycholinguistic Studies of References and Coherence. Natural Language Generation: Introduction to Language generation , An Architecture for generation, Surface Realization, Systemic Grammar, Functional Unification Grammar, Summary, Discourse Planning, Text Schemata Rhetorical Relations, Summary, Other Issues, Microplanning, Lexical Selection, Evaluating Generation Systems, Generating Speech. Semester- VII Course CodeIT-7002 Credits-4L 3, T- 1, P-0Name of the CourseModeling and SimulationsLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Modeling And Simulations (IT-7002) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section - A Definition of systems: Types of system, continuous and discrete modelling process and definition of a model. Common type of mathematical models used for engineering and non-engineering system (such as differential and partial differential equation models). Section - B Simulation Process: Discrete and continuous simulation procedures. Random number generation and its testing discrete and continuous random variables, density and distributive functions, study of few distributions such as Poisson, Norma. Section - C Simulation of Queuing System: Elementary idea about networks of queuing with particular emphasis to computer system, environment (refer to sections 9.1, 9.2, & 9.3 of Trivedis book).] Verification & Validation: Design of simulation experiments and validation of simulation experiments comparing model data units and real system data. Section - D Simulation Language: A brief introduction to important discrete and continuous languages such as GPSS (Study & use of the language). Use of data base & AI techniques in the area of modeling and simulation. Books Deo, Narsing: System Simulation with Digital Computers. Gorden G: System Simulation, Prentice Hall (Two books above can be used as text books). Shridhar Bhai Trivedi, Kishore: Probability & Statistics with reliability Queuing, Computer science Application. Payer, T.A., Introduction to System Simulation, McGraw Hill. Reitman, J., Modelling and Performance Measurement of Computer System. Spriet, WI A., Computer Aided Modelling and Simulation (Academic Press). Course CodeIT-7003 Credits-4L 3, T- 1, P-0Name of the CourseE-Commerce & ErpLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII E-Commerce & ERP (IT-7003) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Introduction and Concepts: Networks and Commercial transactions Internet and other novelties: networks and electronic transactions today, Model for commercial transactions; Internet environment - Internet advantage, worlds wide web and other Internet sales venues; online commerce solutions. Electronic Payment Methods: Updating traditional transactions; secure online offline secure processing; private data networks, Security protocols. Section B Electronic Commerce Providers: On line Commerce options; Company profiles, Electronic Payment Systems: Digital payment systems; First virtual Internet payment system; cyber cash model. On-line Commerce environments; Servers and commercial environments; E-commerce Servers. Digital Currencies: Operational process of Digicash, Ecash Trail; Using Ecash; Smart cards; Electronic Data interchange: basics, EDI versus Internet and EDI over Internet. Strategies, Techniques and Tools, Shopping techniques and online selling techniques. Section C ERP an Enterprise Perspective: Production finance, Personnel disciplines and their relationships, Transiting environment, MIS Integration for disciplines, Information/ workflow, Network Structure, client Server Integrator System, Virtual Enterprise. ERP Resource Management Perspective; Functional and Process of Resource, Management, Introduction to basic Modules of ERP System: HRD, Personnel Management, Training and Development, Skill Inventory, Material Planning and Control, inventory, forecasting, Manufacturing, Production Planning, Production Scheduling, Production Control, Sales and Distribution, Finance, Resource Management in global scenario. Section D ERP Information System Perspective: Functional to OLAP (Online Analysis and Processing), TP, OAS, KBS, MRP, BPR, SCM, REP, CRM, and Information Communication Technology. ERP Key Managerial Issues: Concept Selling, IT Infrastructure, Implication, of ERP System on business Organization, Critical success factors in ERP System, ERP Culture Implementation Issues, resistance to change, ERP Selection issues, return on Investment, pre and Post Implementation Issues. Books: Ravi lalakota, Andrew Whinston: Frontiers of Electronics Commerce, 1996, Addison Wesley. V.K. Garg and N.K. Venkita Krishna: Enterprise Resource Planning Concepts and practice, 1998, PHI. John Antonio, Fernandz: The SAP/3 Handbook, TMH. Denial Amor: The E-Business Revolution, Addison Welsey From Edi to E-Commerce: A Business Initiative: Sokol TMH Greenstein and Feinman: E-Commerce, TMH Diwan, Sharma: E-Commerce Excel. Asset International Net Commerce TMH Bajan and Nag: E-Commerce: The cutting Edge of Business, TMH E-Commerces Jaffrey F. Rayport, Bernard J. Jaworski, 2002, tmh Electronic Commerce Security, Risk Management and Control, Greenstein, Feinman, 2002, TMH. Course CodeIT-7004 Credits-4L 3, T- 1, P-0Name of the CourseInternet TechnologyLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII Internet Technology (IT-7004) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Introduction to Java, Difference between C/C++ and Java, Applets and Applications, Java Development Kit, Advantages of Java, (Data types, modifiers, expressions, operators in Java), Control Statements in Java, Classes statements in Java, Classes, Inheritance (single, multilevel, hierarchical), Multiple Inheritance using Interfaces, Arrays, Strings and Vectors, Java packages, Exception handling, Multithreading, Applets, Graphics and AWT. Section B Multithreading: Java Thread Model, Thread Priorities, Creating Multiple Threads, Synchronization, Inter thread communication. Applets: Applet Basic, Applet Architecture, Display Methods, HTML APPLET tag. Event Handling: Event Handling Modles, Event classes, Event Listener Interfaces, Adapter Classes. AWT Classes: Window fundamentals, working with frames windows, Panels, working woth color, fonts, AWT Controls, layout Manager & Menus. Section C Swing: Swing components classes and their brief description such as buttons, boxes, panes, tables, fields and trees. JDBC: Java as a database front end, Database Client/Server methodology, Two-and three-tier database design, The JDBC API, A JDBC database example. Section D Java Beans: The Java Bean component model, The Java Bean, Bean introspection and customization, Simple Bean applications. Servlets: Servlet engines, Life cycle of servlets, Run-time environment, Servlet exceptions. Books: Programming with JAVA, John R. Hubbard, Schaums Outline Series, McGraw Hill, New York. Java Script, Don Gosselin, Thomson Learning, Cambridge, 2000. Programming with Java, E Balagurusamy, Tata McGraw Hill, New Delhi, 2002. The Complete Reference, JavaTM 2, 3rd Edition, Patrick Naughton, Herbert Schildt, Tata McGraw Hill. Semester-VII Course CodeIT-7005 Credits-2L 0, T-0, P-2Name of the CourseInternet Technology LabLectures to be Delivered26 hours of lab work (2hrs per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsContinuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Internet Technology Lab (IT-7005) Instructions for paper setter/ Candidates Laboratory examination will consist of three parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. Programming in JavaScript, ASP and Java/Swings/JDBC/Servlets/Beans *To be done in consultation with the faculty incharge for the course and should lead to the projects in groups of two. Write an application that demonstrates some static method of character class. Create a string buffer object to illustrate how to Display capacity and length of string buffer, Insert character at the beginning, Append &reverse the string. Write a program that display all the factors of a number entered by user; e.g. If user entered 8 it would response with 2&4. Write an application that defines sphere class with three constructors first from accepts no arguments . It assume that sphere is centred at origin & has radius of one unit . The record from accept one double value and represents radius and centred at origin . third from accepts four double arguments and specify radius and origin. Write down a programme to implement polymorphism using Overloading Overriding Write down a programme to implement interface and packages in java. 6. Write a programme that illustrate how to use throw statement .create a class that has static method main(),a() ,b(), c(), and d(). Mmain invokes a(),a() invokes b(),b() invokes c() and so on. Method d() declares an array with ten lements and then attempts to access 20th element . Therefore array index out of bond exception is generated. Write an application that execute two threads one after another .Create threads by implementing Thread Class Runnable Interface Write a Multithreaded programme that simulate a set of grasshoppers jumping around in a bod. Each grasshopper jumps to a different location Every 2 to 12 seconds. Display the new location of grasshopper after each of these jumps. Write down programme in java to implement following in java. Linked List Vector Class Hashtable Enumeration Write a programme to implement Applet that displays a different Images based on the days of week.The applet should accept seven parameters that Identfy the image file. Write a programme that shows a solid circle that moves from left to right. Across the applet display area .The flicker effect should be noticeable. Write a programme to event handling in java. Write a programme to implement frame, panels through different layout managers in applets and swings. Write a programme to access data from database using JDBC and modify data in the database . . Course CodeIT-7006 Credits-2L 0, T-0, P-2Name of the CourseModeling and Simulation LaboratoryLectures to be Delivered26 hours of lab work ( 2hrs each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsContinuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Semester-VII Modeling and Simulation Laboratory (IT-7006) Instructions for paper setter/ Candidates Laboratory examination will consist of three parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. (For all the given exercises student has to make GUI) Write a programme for the random number generation and do its testing and validation for various discrete and random variables. Do the modeling and simulation of queuing system (i.e. in computer system). Do the modeling and simulation of the ATC (Air Traffic Control System). Do the modeling and simulation of the Monte-Carlo method. Study the GPSS and implement various programme in it. Course CodeIT-7008 Credits-2L 0, T-0, P-2Name of the CourseE-Commerce & ERP laboratoryLectures to be Delivered26 hours of lab work ( 2hrs each per week)Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsContinuous AssessmentLab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Semester-VII E-Commerce Laboratory (IT-7008) Instructions for paper setter/ Candidates Laboratory examination will consist of three parts: Performing a practical examination assigned by the examiner (25 marks) Viva-voce examination (25 marks) Viva-voce examination will be related to the practicals performed / projects executed by the candidate related to the paper during the course of the semester. This laboratory will be self exploratory in nature with the undertaking of case studies such as by culling information from the internet on Pay roll Back office accounting Supply chain Order processing Shipments Web and value addition to traditional business Study of packages such as SAP oracle. At the end of the laboratory a student is expected to make a presentation of his exploration in the area of e-commerce and ERP. Course CodeIT-7009 Credits-4L 0, T-0, P-4Name of the CourseProject -IEvaluationOn the basis of Multimedia Presentation of the Project executedMax. Marks: 100Min. Pass Marks: 50%Semester-VIii Project -I (IT 7009) Instructions for paper setter/ Candidates This Seminar/Viva will be conducted on the project done by the candidate. At the time of seminar/ viva voce the industry guide/ supervisor be invited. Course CodeES-7001 Credits-0L 0, T-0, P-0Name of the CourseVocational Training Semester End Examination Max. Marks: 50Min. Pass Marks: 20 Maximum Time:3hrsContinuous Assessment Lab work 30%, Lab Record 25%, Viva/ Hands on 25%, Attendance 20%)Max. Marks: 50Min. Pass Marks: 25Semester-VII Vocational Training (ES 7001) Instructions for paper setter/ Candidates This training will be related to Industrial Projects/ Software Projects to be undertaken under the guidance of Faculty preferably at Industry/ Software Park/ Incubation Centre or related areas. This may also be undertaken with in the Institute. This training will be undertaken during vacation. Student is supposed to submit the project report at the end of the training. Evaluation will be based on Project Report, presentation and comprehensive Viva-voce examination related to the project. OPEN ELECTIVE - I Course CodeAS-7001 Credits-4L 3, T- 1, P-0Name of the CourseOperation ResearchLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII Operation Research (AS-7001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Operations Research: Basic Concepts, Definitions, Origin and development; Characteristics of O.R., Models in O.R., Steps (Phases) of O.R., O.R. Techniques; uses and limitations of O.R. Linear Programming: Basic Concepts, Problem Formulation and Graphical Solution. Section B Linear Programming: Mathematical Statement of the Problem, General, Canonical and Standard forms of LPP, Basic Feasible Solutions, Simples Method of LPP; Special Cases: (i) Infeasible Solution ii) n-bounded Solution (iii) Multiple Optimum Solutions (iv) Cases of Degeneracy and cycling (v) Cases of duality: Primal and dual Comparisons, Economic Interpretation, Optimal solutions, Primal and dual comparisons, Economic Interpretation, Optimal Solutions, Primal and dual problems and theorems of duality. Section C Transportation Problem: Basic Concepts, matrix form, Basic feasible solution using various methods, Optimal Solutions for Balanced and Unbalanced Transportation Problem, assignment problem; Balanced and Unbalanced Assignment problem, Travelling salesman Problem. Section D Inventory Control: Basic Concepts; Factors effecting Inventory Control; Simple EOQ models with demand known and uniform, shortages back logged, Production instantaneous or uniform. Selective Inventory control: ABC and BED analysis Queuing theory Basic Concepts; characteristic; M/M/1 model Books: Kanti Swarup, Operations Research. N.G.Nari, Operations Research. Heara and Gupta, Operations Research. S.D. Sharma, Operations Research. Goel and Mittal, Operational Research. V.K.Kapoor, problems and Solutions in Operations Research. K.V. Mittal & C.Mohan, Optimization Methods, in Operation Research and System Analysis, 3rd Edition, New Age International Publishers New Delhi. Course CodeHU-7001 Credits-4L 3, T- 1, P-0Name of the CourseIntellectual & Property RightsLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks:50Semester- VII Intellectual & Property Rights (HU-7001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. (TITLE APPROVED CONTENTS TO BE DECIDED LATER) Course CodeHU-7002 Credits-4L 3, T- 1, P-0Name of the CourseHuman ValueLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks:100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII Human Value (HU-7002) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. The objective of the course is an exploration of human values which go into making a good human being, a good human society and a good life. The context id the work life and the personal life of modern Indian professionals. The proposed Course Structure is as follows: Section - A The value crisis in the contemporary Indian Society. The nature of values: the value spectrum for a good life. The Indian System of values. Section - B Material development and its values: the challenge of science and technology. Psychological values: integrated personality; mental health Societal values: the modern search for a good society; justice, democracy, rule of law; values in the Indian constitution. Section - C Aesthetic values: perception and enjoyment of beauty. Moral and ethical values; nature of moral judgments; canons of ethics; ethics of virtue; ethics of duty; ethics of responsibility. Work ethics; professional ethics. Section - D Spiritual values; different concepts; secular spirituality. Relative and absolute values. Human values: humanism and human values; human rights; human values as freedom, creativity, love and wisdom. Management by values: Professional excellence; inter-personal relationships at work place; leadership and team building; conflict resolution and stress management; management of power. Books: Education in human Values Burrows.L, Sri Sathy Sai Books and Publishing Trust, Prasanthi Nilayam. Value Education: A Philosophical Study (Published thesis) N.N. Kar, The associated publishers, 2963/2 Kacha Bazar PO Box No. 56 Ambala Cantt. 133001 India. Education in Human Values, Madhu Kapani, sterling Publishers. Human Values and Education, Dr. S.P. Ruhela, Sterling publishers, Private Ltd. green park Extension New Delhi, 110016. Semester- VII Accounts And Financial Management (HU-7003) Course CodeHU-7003 Credits-4L 3, T- 1, P-0Name of the CourseAccounts And Financial ManagementLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Accounting: Principle, Concepts and conventions, double entry system of accounting, introduction of basic books of accounts of sole proprietary concern, control accounts for debtors and creditors, closing of books of accounts and preparation of trial balance. Final Accounts: Trading, Profit and Loss Accounts and balance sheet of sole proprietary concern with normal closing entries. Introduction to manufacturing account, Final accounts of Partnership firms, limited company. Section B Financial Management: Meaning and role Ration Analysis: Meaning, advantages, limitations, types of rations and their usefulness Fund flow Statement: Meaning of the terms fund flow and fund working capital cycle, preparation and interpretation of the fund flow statement. Section C Costing: Nature, importance and basic principles, Budget and budgetary control: Nature and scope, importance, method of finalisation of master budget and functional budgets. Marginal Costing: Nature, Scope and importance, break even analysis, its uses and limitations, construction of break even chart, practical applications of marginal costing. Section D Standard Costing: Nature and Scope, Computational and analysis of variances with reference to material cost, labour cost and overhead cost, interpreation of the variances. Introduction to computerized accounting system: coding Logic and codes required, master files transaction files; introduction to documents used for data collection, processing of different file sand outputs obtained. Books: Kellock, J.: Elements of Accounting, Heinemann, 1978. Rockely, L.E.: Finance for the Non-Accountant, 2nd Edition, and Basic Books, 1976. Levy, and Sarnet: Principle of Financial Management, Prentice Hall International Course CodeIT-7016 Credits-5L 3, T- 1, P-0Name of the CourseKnowledge ManagementLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII Knowledge Management (IT-7016) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. (TITLE APPROVED CONTENTS TO BE DECIDED LATER) Course CodeEC-7001 Credits-4L 3, T- 1, P-0Name of the CourseWireless CommunicationLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII Wireless Communication (EC-7001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section - A Introduction to Wireless Communication System: Evolution of mobile radio communications, examples of wireless comm. systems, paging systems, Cordless telephone systems. Comparison of various wireless systems. Modern Wireless Communication System: Second generation cellular networks, third generation wireless networks, wireless in local loop, wireless local area networks, blue tooth and Personal Area networks. Section - B Introduction to Cellular Mobile Systems: Spectrum Allocation, basic Cellular Systems, Performance Criteria, Operation of Cellular Systems, analog cellular systems, Digital Cellular Systems. Cellular System Design Fundamentals: Frequency Reuse, Channel assignment strategies, handoff Strategies, Interference and System capacity, tracking and grade off service, Improving Coverage and capacity. Section - C Multiple Access Techniques for Wireless Communication: Introduction to Multiple Access, FDMA, TDMA, Spread Spectrum Multiple Access, Space division multiple access, packet ratio, capacity of a cellular systems. Wireless Networking: Difference between wireless and fixed telephone networks, Development of Wireless Networks, Wireless Data Services, Common Channel Signaling, ISDN (Integrated Services Digital Networks), Advanced Intelligent Networks. Section - D Intelligent Cell Concept and Application: Intelligent cell concept, Applications of Intelligent micro cell Systems, In-Building Communication, CDMA Cellular Radio Networks. Books Wireless Communication: Theodore S. Rappaport: Pearsons. Mobile Cellular Telecommunication: W.C.Y. Lee: McGraw Hill Mobile Communications: Jochen Schiller; Pearson PROFESSIONAL ELECTIVE I Course CodeIT-7010 Credits-4L 3, T- 1, P-0Name of the CourseSoftware MaintenanceLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII Software Maintenance (IT-7010) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E.. Use of non-programmable calculators is allowed. Section A Fundamentals: Meaning of software maintenance, software change, ongoing support, economic implications of modifying software, the nomenclature and image problem, software maintenance framework, potential solutions to maintenance problem Maintenance process models: Definitions, critical appraisal of traditional process models, maintenance process models. Program understanding: Aims of program comprehension, maintainers and their information needs, comprehension process models, mental models, program comprehension strategies, factoirs that affect understanding, implications of comprehension theories and studies. Section B Reverse engineering: Definitions, purposes and objectives, levels of reverse engineering, supporting techniques, benefits, Reuse and reusability: Definitions, objectives and benefit of reuse, approach to reuse, domain ANALYSIS, COMPONENTS engineering, reuse process model, factors that impact upon reuse. Maintenance measures, Definitions, objectives of software measurement, example measures, guidelines for selecting maintenance measures Section C Configuration management: Definitions, configuration management, change control, documentation Management and organizational issues, Management responsibilities, enhancing maintenance productivity, maintenance teams, personnel education and training, organizational modes Section D Building and sustaining maintainability: Quality assurance, fourth generation languages, object oriented paradigms. Maintenance tools: Criteria for selecting tools, taxonomy of tools, program understanding and reverse engineering, testing, configuration management, other tasks Past present and future of software maintenance. Books: Software Maintenance: concepts and Practice, Armstrong A Takang and Penny A. Grubb, International Thomson Computer press, London Course CodeIT-7011 Credits-4L 3, T- 1, P-0Name of the CourseCorba /XMLLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII Corba/XML (IT 7011) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section - A Introduction to Corba: An overview, CORBA Revisited, The Evolution of CORBA, BOA vs. POA Generation, The invocation Lifecycle, The Object Lifecycle. CORBA Services Revisited: Core Services, Database Integration and Transaction processing, Scalability Issues. The Stock Watch Component, The Portfolio Manager Component, Performance Considerations Performance Implications of IDL Design, Transferring Large Amounts of Data. Section B Object Location: A Model for Locating Objects, CORBA Object Location Services, Other ways to Locate Objects, Selecting an Object Location Mechanism, Selecting Objects For Publication, Messaging, CORBA and Messaging, ORB Support for Messaging, The need for Message Oriented Middleware, Existing Message Oriented Middle ware Products, Related CORBA Services, Multicast Messaging. Security: Security Concepts,Enterprise System Security Requirements and Policies, CORBA Security, Solutions for the Real World. Section C Database Integration and Transaction Processing: Object Persistence, Introduction, Accessing Relational Data bases, Object/Relational Mapping, Object Databases, Data Consistency. Database Integration: System Architecture, Related OMG Work, Integration Aspects, CORBA Business Objects, ODBMS, CORBA Relationship Service, CORBA Query Service, Application Specific Solutions, Tradeoffs, , Stateless Servants, Stateful Servants, Database Adapters, The Billion Object CORBA System, Transactions in a CORBA Environment, Two-Tier vs. Three Tier , Architectures, Client Controlled vs. Server Controlled Transactions, Server Controlled Transactions, Client Controlled Transactions Distributed Transaction Processing: Transaction processing, CORBA Object Transaction Services, Advanced Transaction Models Section D Introduction to XML: Fundamentals of XML, XML as a Data Format, XML for Web pages, Object Method Parameter Encoding and RPC Protocol, XML and Open Exchange, The Flexibility of XML, XML Basics, Digging Into the Syntax, XML Anatomy, Elements, Attributes, Text, Entities, Character references, CDATA, Encodings, comments, Processing Instructions, Well- formed versus valid, XML Namespaces. Programming the Document Object Model: The idea behind the DOM, DOM requirements, Language and Platform Independent, Core DOM for both HTML and XML, Independent of the User Interface, Accessable elements of the document, limitations of the DOM, Objects in the DOM, Fundamental DOM Interfaces, Microsoft parse Error Object, Platform Neutrality of XML and the DOM, Generic Node methods, Wrapper Functions for Manipulating the DOM, specific node interfaces, extended interfaces, Microsoft Specific Extensions. Displaying the Nodes in a Tree Control, SAX. Using XML Queries and Transformations: Xpath query Syntax, Different Axes, Different Node Tests, Building a Path, Selecting Subsets, Built-in Functions, IE5 Conformance XSLT: working of Transformation, Some Good XSLT Processors, XSLT Elements Composing the XSLT Style sheet: Pre-defined templates, Elements that Generate output elements, commands, what if several templates Match?, control of flow, variables and Parameters, Top Level settings, Built in functions, simplified syntax, XSLT Language extensions, The IE5 Implementations, Tricks for using MSXML 2.0. Giving style to XML: using CSS in HTML, Using CSS in XML, XSLT for adding style, Client side XSLT Styling. Books: Enterprest Corba, Prentice Hall PTR by Dick Slama, Jason Gaurbis, Perry Russel Professional Visual Basic 6, XML, Wrox Press Ltd. by James Britt, Teun Duynstee. Course CodeIT-7012 Credits-4L 3, T- 1, P-0Name of the CourseObject Oriented Software EngineeringLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII Object Oriented Software Engineering (IT-7012) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section - A Review of object oriented systems: Design object, class hierarchy, inheritance, polymorphism, object relationships and associations, aggregations and object containment, object persistence, meta class, object oriented systems development life cycle, software development process object oriented systems development : a use case driven approach. Section B Methodology for object oriented design: Object modelling techniques as software engineering methodology, Rumbaugh methodology, Jacobson methodology, Booch Methodology, Patterns, Frameworks, the unified approach, unified modelling language(UML). Section - C Object Oriented Analysis : analysis process, use case driven object oriented analysis, use-case model, object classification, theory, different approaches for identifying classes, classes, responsibilities and collaborators, identifying object relationship, attributes and methods, super sub class relationships, A part of relationships aggregation class responsibilities, object responsibilities. Section - D Object oriented design process, corollaries, design axioms, design patterns, object oriented design philosophy, UML object constraint language, designing classes: The process, class visibility, refining attributes, designing methods ad protocols, packages and managing classes, designing interface objects, view layer interface design, Macro and Micro level Interface design, Macro and Micro level interface design process. Books: Object Oriented systems development, Ali Baharmi, 1999, MGH. Object Oriented Modeling and Design, Rumbaugh et.al. 1997, PHI. Object Oriented analysis and design, Grady Booch, 1995, Addison Wesley. Object Oriented software Engineering by Subhash Mehta, Suresh K. Basandra, Galgotia Publication. Course CodeIT-7013 Credits-4L 3, T- 1, P-0Name of the CourseDesign of Embedded SystemsLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII Design Of Embedded Systems (IT-7013) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section - A Real Time Operating System overview, exposure to Windows CE, QNX, Micro Kernels and c/OS of introduction to process models. Interrupt routines in an RTOs environment, encapsulating semaphores and queues, hard real-time scheduling consideration, saving memory space. 16 & 32 bit microprocessor and micro-controller and DSP hardware with reference to Embedded systems. Section B Embedded software development tools and compliers host and target machines, linker/locators for embedded software, cross compilers, cross assemblers and tool chairs, gce compiler, basic concept of device drivers, serial communication interface device driver. Section - C System synthesis of Hardware/software co-emulation. Simulation speed of emulators. JTAG OCD. Section - D Communication protocols with special reference to embedded system. TCP/IP, VDP wireless protocol, IRDA, Blue tooth IEE 8.8.11. Books: An embedded system primer by David E. Simon, 1999, Addison-Wesley. TCP/IP Lean: Web Servers for embedded systems by Jeramy Bentham, 2002. Real time programming: A guide to 32 bit embedded development, Rick Grchan, 1999. Course CodeIT-7014 Credits-4L 3, T- 1, P-0Name of the CourseIT Enabled ServicesLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII IT Enabled Services (IT-7014) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. (TITLE APPROVED CONTENTS TO BE DECIDED LATER) Course CodeIT-7015 Credits-4L 3, T- 1, P-0Name of the CourseGIS/Remote SensingLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VII GIS/Remote Sensing (IT-7015) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section - A Concepts and Foundations of Remote Sensing: Introduction, Energy Sources and Radiation Principles, energy Interactions in the Atmosphere, energy Interactions with Earth Surface Features, Data Acquisition and Interpretation, An Ideal Remote Sensing System, characteristics of Real Remote Sensing Systems, successful Application of Remote Sensing, Land and Geographic Information Systems. Section - B Multispectral, Thermal, and Hyperspectral Scanning: Introduction, Across-Track Multispectral Scanning, Along track Multispectral Scanning, across Track Thermal Scanning, Thermal Radiation principles Interpreting Thermal Scanner Imagery, geometry Characteristics of Across-Track Scanner Imagery, Radiometric Calibration of Thermal Scanners, Temperature Mapping with Thermal Scanner Data, FLIR Systems, Imaging Spectrometry. Section - C Earth Resource Satellites Operating in the Optical Spectrum: Early History of Space Imaging, Landsat Satellite Program, Orbit Characteristics of Landsat-1, -2 and 3, Sensors Onboard Landsat-1, -2 and 3, Landsat MSS image Interpretation, Orbit characteristics of Landsat-4 and 5, Sensors Onboard Landsat-4 and 5, Landsat TM Image Interpretation, Landsat-6 Planned Mission, Landsat ETM Image Simulation, Landsat 7, SPOT HRV Image Interpretation, SPOT-4 and 5, Meteorological Satellites, Ocean Monitoring Satellites, Earth Observing system Section - D Digital Image Processing: Image Rectification and Restoration, Image Enhancement, contrast Manipulation, spatial Feature Manipulation, Multi-Image Manipulation, Image Classification, Supervised classification, The Classification Stage, The Training Stage, Unsupervised Classification, The ouput Stage, Post classification Smoothing, Classification Accuracy Assessment, Data Merging and GIS Integration. Microwave Sensing: Introduction, Radar Development, SLAR System Operation, Spatial Resolution of SLAR systems, Geometric Characteristics of SLAR Imagery. Semester- VIII Course CodeIT-8001 Credits-4L 3, T- 1, P-0Name of the CourseHuman Computer Interaction User Interface DesignLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Human Computer Interaction User Interface Design (IT-8001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course . For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Developments in technology: Workstation environment e.g., Screens, keyboards, pointing devices, other I/O devices (e.g. speech), related processing and storage requirements. Developments in HCI: Virtual machines, command line input (command sets), menu selection and the methods of selection, graphical interfaces, speech, screen design for intensive data entry, intelligent HCIs, virtual personas (engaging with the computer within a virtual reality), concept of look and feel. Section - B Development in the Concept of the user: Range of users (e.g. hypertext, event driven systems, use of multimedia), modeling techniques, implication of new developments on user interfaces, implications of development on hardware (storage, processing requirements etc.) Applications: Range of applications, selection of HCLs for specific applications. Psychological Considerations: Memory (long and short-term), reasoning, perception, cognition and use of metaphors and the consequences on the design of HCI. Section - C Health & Safety considerations: Ergonomics ad the surrounding environment e.g., lighting, seating, RSI, legal implications. Information considerations: Necessity for information rich environment, examples of systems (e.g. share trading rooms or combat environments). HCIO Support for less common environments: Identification of applications (e.g. Remote interaction using virtual environments, real time simulations (fight simulators), high speed interactive interfaces (games), special needs (implications for colour blind partially sighted, blind. Physically incapacitated, slow learners), analysis of implication of an HCI selection. Modeling the Interface: Mapping the system functionality to the conceptual model, grouping of the tasks into logical sets. Section - D Analysis: Task analysis e.g., storyboarding, user needs analysis, evaluation of HCI complexity. Design: Rules and heuristics for good HCI design, review of proprietary examples, context sensitive help, online help/ documentation design tools. Production: Selection of tools, production of prototype Measuring the functionality of an HCI: Keystroke effort per task, ability to navigate within the system, time to perform a task, ability to configure the HCI user satisfaction. Books: Human Computer Interaction in the New Millennium; John M. Carrol, Editor, Addison Wesley Human Computer Interaction: Issues and Challenges; Qiyang Chen, Montclair State University, USA; Idea Group Publishing Course CodeIT-8002 Credits-4L 3, T- 1, P-0Name of the CourseSecurity Of Information Systems/ Internet SecurityLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Security Of Information Systems/ Internet Security (IT-8002) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course . For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E.. Use of non-programmable calculators is allowed. Section A Basic Encryption and Decryption: Terminology and Background: Encryption, Decryption and Cryptosystems, Plain Text and Cipher Text, Encryption algorithms, Cryptanaltysis. Introduction to Cliphers: Monoalphabetic Substitutions such as the Caesar Cipher, Cryptanalysis of Monoalphabetic ciphers, Polyalphabetic Ciphers such as Vigenere Tableaux, Cryptanalysis of Polyalphabetic Ciphers, Perfect Substitution Cipher such as the Vernam Cipher, Stream and Block Ciphers, Characteristics of Good Ciphers: Shannon Characteristics, Confusion and Diffusion, Information Theoretic Tests, Unicity Distance. Section - B Secure Encryption systems: Hard Problems: Complexity: NP Complete problems, Characteristics of NP-Complete Problems, The Meaning of NP- Completeness and Cryptography. Properties of Arithmetic Operations: Inverses, Primes, Greatest Common Divisor, Euclidean algorithm, Modular Arithmetic, Properties of Modular Arithmetic, Computing the inverse, Fermats Theorem, algorithm for computing inverses, Random number generation Public Key (Asymmetric key) Encryption Systems: Concept and Characteristics of Public Key Encryption system, Introduction to Merkle-Hellman Knapsacks, rivest Shamir-Adlman (RSA) Encryption in Detail, introduction to Digital Signature Algorithms , The Digital Signature Standard (DSA). Hash Algorithms: Hash concept, description of Hash Algorithms, Message Digest Algorithms such as MD4 and MD5, Secure Hash Algorithms such as SH1 and SHA2. Section - C Secure Secret Key (Symmetric) Systems: The Data encryption Standard (DES), Analyzing and Strengthening of DES, Key Escrow and Clipper, Introduction to Advance Encryption Standard (AES) Applied Cryptography, protocols and Practice: Key Management protocols: Solving Key Distribution Problem, Diffie-Hellman Algorithm, Key Exchange with Public Key Cryptography. Public Key Infrastructure (PKI): Concept of digital Certificate, Certificate Authorities and its roles, X509 Structure of Digital Certificate, Types of public Key Infrastructures. Legal Issues: Copyrights, Patents, Trade Secrets, Computer Crime, Cryptography and the Law. Operating System, Database and program Security. Section - D Operating Systems security: Security policies, Models of Security, Security Features of Ordinary Operating System, Security Features of Trusted Operating System. Database Security; Security Requirements of Databases, reliability and integrity, Protection of Sensitive Data, Inference problem: direct and Indirect Attacks Program Security: Kinds of Malicious Code, How viruses Attach and Gan Control, Homes for Viruses, Virus signatures, Preventing Virus Infection, Trapdoors, Convert channels, Control Against program Threats, Java Mobile codes. Network Security Network Security Issues such as Impersonation, Message Confidentiality, Message Integrity, Code Integrity, Denial of Servie, Secure Communication Mechanism such as IPSec, PKI based Authentication and Kerberos Authentication , biometrics Authentication Mechanisms, Access Control Mechanisms Firewalls Web Security: Solving privacy problems, Solving Authentication problems, secure socket Layer (SSL) protocol, Secure Electronic Transaction (SET) Protocol, Safe Guarding Web Servers. Secure Electronic Mail: Privacy Enhanced Email (PEM), Pretty Good Prvacy ( PGP), Public Key Cryptography Standards PKCS#7, Secure/ Multipurpose Internet Mail extensions (S/MIME) Books: Security in Computing (Second Edition), Charles P.Pfleeger, 1996, Prentice Hall International, Inc. Applied Cryptography protocols, Algorithms, and Source Code in C (Second edition ), Bruce Schneier, 1995, John Wiley & Sons. Inc. Security Technologies for the world wide web, Rolf Oppliger, Artech House, Inc. Digital Certificates Applied Internet Security, Jalal Feghhi, Jalli Feghhi and Peter Williams, Addison Wesley Longman, Inc. The World Wide Web Security FAQ, Lincoln D. Stein, world Wide Web Consortium, [online] Available at  HYPERLINK "http://www/w3.org/Security/Faq/www-security-faq.html" http://www/w3.org/Security/Faq/www-security-faq.html Cryptographic Message Syntax Standard, public Key Cryptography Standard, RSA Laboratiories, [online] Available at  HYPERLINK "http://www.rsasecurity.com/rsalabs/pkcs/pkcs-7/indes.html" http://www.rsasecurity.com/rsalabs/pkcs/pkcs-7/indes.html Semester- VIII Course CodeIT-8003 Credits-4L 3, T- 1, P-0Name of the CourseData Warehouse and Data Mining Lectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Data Warehouse And Data Mining (IT-8003) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course . For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E.. Use of non-programmable calculators is allowed. Section - A Data ware housing Definition, usage and trends, DBMS vs. data warehouse, Data marts, Metadata, Multidimensional data mode, Data cubes, Schemas for Multidimensional Database: stars, snowflakes and fact constellations. Data warehouse process & architecture, OLTP vs. OLAP, ROLAP vs. MOLAP types of OLAP, servers, 3 Tier data warehouse architecture, distributed and virtual data warehouses, data warehouse manager. Section - B Data mining definition & task, KDD versus data mining, data mining techniques, tools and applications. Data mining query languages, data specification, specifying knowledge, hierarchy specification, pattern presentation & visualization specification, data mining techniques, tools and applications. Section - C Data mining techniques: Association rules, Clustering techniques, Decision tree knowledge discovery through neural Networks & Genetic Algorithm, Rough Sets, Support Victor Machines and Fuzzy techniques. Section - D Mining Complex data objects, Spatial databases, Multimedia databases, Time series and Sequence data; mining Text Data bases and mining Word Wide Web. Books: Data Warehousing in the Real World; Sam Anahory & Dennis Murray; 1997, Pearson Data Mining Concepts & Techniques; Jiawei Han & Micheline Kamber 2001, Morgan Kaufmann. Data Mining Techniques; Arun Pujar; 2001, University Press; Hyderbad. Reference Books: Data Mining; Pieter Adriaans & Dolf Zantinge; 1997, Pearson Data Warehousing, Data Miniing and OLTP; Alex Berson, 1997, McGraw Hill. Data warehousing System; Mallach; 2000, McGraw Hill. Building the Data Warehouses; W.H. Longhman, C. Klelly, John Wiley & Sons. Developing the Data Warehouses; W.H. Lonhman, C.Klelly, John wiley & Sons. Managing the Data Warehouses; W.H. Inman, C.L. Gassey, John Wiley & Sons. Decision support Systems & Data Warehouses, Ravindranath, B., New Age International Publishers, New Delhi. Course CodeIT-8004 Credits-8L 0, T-0, P-8Name of the CourseProject II/ Industrial TrainingProject EvaluationOn the basis of continuous review, Project Report and Viva VoceMax. Marks: 250Min. Pass Marks: 50%Semester-VIii Project II/ Industrial Training (IT-8004) Instructions for paper setter/ Candidates Project evaluation will consist of three parts: Evaluation of the Project report along with source code in a CD in the required format by an external examiner 40% marks. Continuous Evaluation by the Internal examiner 30% marks. Viva-voce examination (20% marks) Software evaluation with test runs (10% marks) Viva-voce examination will be related to the Project executed by the candidate during the course of the semester. Aim of the Project Project is one of the culmination points of the learning process, which puts to test the acquired ability of the candidate to independently take charge of Project or system development. The effort should be made to open up a window of opportunity with the industry the project can proceed in three steps using software engineering methodology Preparation of requirement document Preparation of Design Document. Writing of Code and its testing with demonstration cases. An effort should be made by the Institute faculty to liaison with the Industry and conduct three reviews to meet the dead lines and satisfactory completion of the project. Following format for documentation for the project be followed: Forwarding Page Title of the Project Objectives Definitions of Key Term Approach to Problem solving Limitations, If any Output Generated Details of Hardware platform used Details of software Tools used Implementation Issues(Clearly defining the area of Application) Miscellaneous Signature of Candidate & date Recommended Chapters/sections (Not Mandatory but only Guidelines) Microscopic Summary Details of candidate and Supervisor alongwith certificate of Original Work; Assistance, if any; Credits; Aims and Objectives Approach to Project and Time Frame Project Design Description with Appendices to cover Flow Charts/Data Flow Diagram Macro/Micro Level Source Code; if any Hardware platform Software Tools; Security Measures Quality Assurance Auditability Test Date and Result Style of writing and presentation must follow the guidelines for effective technical writing. Times for submission Project must be submitted by the day of last paper in semester end examination Seminar/Viva a comprehensive seminar/ viva voce should be conducted as part of evaluation. At the time of seminar/ viva voce the industry guide/ supervisor may be invited. Course CodeIT-8005 Credits-4L 0, T-0, P-4Name of the CourseProject SeminarEvaluationOn the basis of Multimedia Presentation of the Project executedMax. Marks: 100Min. Pass Marks: 50%Semester-VIii Project Seminar (IT 8005) Instructions for paper setter/ Candidates This Seminar/Viva will be conducted on the project done by the candidate. At the time of seminar/ viva voce the industry guide/ supervisor be invited. Semester-VIii Course CodeGP-8001 Credits-0L 0, T-0, P-0Name of the CourseGeneral Fitness for the Profession & Group discussion Semester End Examination Max. Marks: 50Min. Pass Marks: 40% Maximum Time:3hrsLaboratoryContinuous Assessment (based on Lab work (2) 30%, Lab Record 30%, Viva/ Hands on 30%, Attendance 10%)Max. Marks: 50Min. Pass Marks: 50%General Fitness for the Profession (GP-8001) Instructions for paper setter/ Candidates Aim of this course is to judge the overall development of the candidate as a professional in the respective branch of skill and fitness to the profession To test the general fitness of the candidate for the profession of Engineering. A comprehensive viva-voce examination will be conducted by a committee of five members of the institute. Director/ Principal of the Institute Head of the Concerned branch of Engineering An eminent professional from Industry/ Public Sector/ Technical Institute nominated by the Director/Principal. A member drawn from among the faculty of Applied Science & Humanities. A Faculty member of the concerned branch of the engineering. The topic of the Group Discussion will be decided by the Committee at C. Due weightage be given to technical papers presented at National, International level, Prizes won by the candidate both in curricular and extra curricular activities. Extra Curricular activities should include participation in clubs, NCC/ NSS organizational capacity, physical education, Yoga, community service, Technology for a common man and overall conduct. Open Elective-II Course CodeIT-8012 Credits-4L 3, T- 1, P-0Name of the CourseDevelopment of Knowledge ManagementLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Development Of Knowledge Management ( IT-8012) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. (TITLE APPROVED CONTENTS TO BE DECIDED LATER) Course CodeEC-8001 Credits-4L 3, T- 1, P-0Name of the CourseComputer based Measurement and ControlLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Computer Based Measurement And Control (ec- 8001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course . For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E.. Use of non-programmable calculators is allowed. (TITLE APPROVED CONTENTS TO BE DECIDED LATER) Course CodeIT-8013 Credits-4L 3, T- 1, P-0Name of the CourseProfessional issues in ITLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Professional issues in IT (IT-8013) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course . For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Legal Issues: Introduction to legal concepts, Basic outline of Criminal and Civil Laws, Concepts relating to laws of Contract and Commercial Law, substantive Legal Issues, intellectual property issues, Cyber crime, Data protection principles and implications of the European Union Data protection Directive, Confidentially and privacy. Intellectual property rights, copyright and Industrial Property, patents, trade Marks and laws relating to designs. Software Protection and piracy, Dealing with copyright , Originality, Exception to Copyright infringement, Employees and freelance programs, devices to overcome protection Software Licensing, Methods of Licensing, Copyright and electronic publishing, copyright problems posed by electronic publishing. Section B Multimedia, Licensing and related issues: protection of Databases, Trade Marks and passing off, Internet related issues, Contract issues and Law, Basic understanding of the Types of Agreements in large Computerization projects Implementation Agreements, License Agreements, Maintenance agreements etc., Enforcement issues, dispute resolution, arbitration, legislation action. Section C Other Professional Issues: Duties of a Professional, Duties to client, Duties to employer, Duties to profession, Duties to society, Accountability for quality, timeliness and use of resources, Human relationships and change management . Avoiding computer misuse, Hacking, unauthorized access and types of Computer Crime, Introduction of Viruses , Fraud and types of Computer Fraud, Implications arising from the Draft computer crimes Act (Sri lanka). Section - D Public interest and social implications, Environmental protection, health and safety issues, Privacy, Ethics and Codes, of Professional conduct, the need for professional ethics, characteristics of professions, Integrity & Honesty, competence, professional development, judgemtn, knowledge of law, relations, standards, independence. Acting with responsibility, professional skill, comply with law, confidently, due care, contribute towards advancement of human welfare. Public Interest, Public awareness, Basic human rights, Ethics and the Internet, Netiquette and Policy approaches, Professional relationships. Are computer professionals professionals, Conflicting responsibilities and misconduct, codes of Ethics. Books: Professional Issues in Software Engineering (2nd Edition.) Bott. F et al., 1995, UCL Press. (Eds), The Responsible Software Engineer: Selected Readings in IT Professionalism, Myers C., Hall t. and Pitt D., 1997, springer BCS Code of conduct:  HYPERLINK "http://www.bcs.org/docs/01100/1194/pdg/codeofc.pdf" http://www.bcs.org/docs/01100/1194/pdg/codeofc.pdf BCS Code of Practice:  HYPERLINK "http://www1.bcs.org/docs/01100/1194/Cop.htm" http://www1.bcs.org/docs/01100/1194/Cop.htm ACS code of Ethics:  HYPERLINK "http://203.58.197.209/acs/events admin/static/national/pospaper/acs 131.htm" http://203.58.197.209/acs/events admin/static/national/pospaper/acs 131.htm ACS Professional Conduct and Professional Practice:  HYPERLINK "http://203.58.197.209/acs/events admin/static/national/pospaper/code2.htm" http://203.58.197.209/acs/events admin/static/national/pospaper/code2.htm. Course CodeEC-8002 Credits-4L 3, T- 1, P-0Name of the CourseVLSI TechnologyLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII VLSI Technology (EC-8002) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Crystal Growth: MGS, EGS, Czochralspi crystal puller, Silicon shaping, Wafer preparation. Epitaxy: Vapour Expitaxial Layer evaluation Molcullar Beam Epitaxy. Oxidation: Thermal Oxidation Kinetics, Oxidation techniques, Oxide Properties, Oxidation induced Defects. Lithography: Photolithography, e-beam lithography, X ray Lithography. Section B Reactive Plasma Etching: Plasma Properties, Feature Size control and anisotropic etching, Plasma etching techniques and equipment. Di-electric and Poly-Silicon Film Deposition: Deposition Processes for Poly-Si, SiO2, SiO3N4; Plasma assisted Depositions. Section C Diffusion: A qualitative view of atomic diffusion in Solids, diffusion mechanisms, ficks one dimensional diffusion equation, constant source and limited source diffusion, diffusion of Grp3 and 5 impurities in silicon impurity sources, diffusion apparatus, Characterization of diffused layers. Ion Implantation Equipment Annealing. Section - D Metallization: Metallization applications, choices, Physical Vapour deposition. Sputtcring, Metallization Problems. Assembly & Packaging: package Types, Design considerations, Package fabrication technologies, future trends. Isolation techniques: Bipolar IC fabrication process sequence. N MOS IC fabrication process Sequence. Books: VLSI Technology, S.M. Sze, 1998, MGH VLSI Fabrication Principles, S.K. Ghandhi Course CodeIT-8014 Credits-4L 3, T- 1, P-0Name of the CourseComputer Aided Fine ArtsLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Computer Aided Fine Arts ( it 8014) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course . For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E.. Use of non-programmable calculators is allowed. Section A Painting and drawing Software Applications: Drawing Software: Illustration applications (vector graphics), painting applications(bitmapped graphics) Drawing devices: Digitizing tablet, pressure sensitive stylus, mouse, touch screen. Collect and present examples of the use of digital painting and drawing in contemporary sources Use drawing and painting software applications creatively to present a range of work. Section - B Image Manipulation: Software Applications: Any software which will have features like distortion, adjust colour range, contrast, palettes and an range of tools with which to paint and adjust images files. Digities: Digital photography, scan, digitize. Objects: Found objects, natural objects, domestic tools. Image: photographs, found images, own visual work, hand written text, word-processed text. Digitize a range of objects and images in an appropriate file format for further development Manipulate and present scanned images in a range of way Section C Typographic design :Font design software: Any software that will enable experimentation with Bitmapped fonts, postscript fonts, and True type fonts. Typographic Design Software: Any software that will enable students to experiment with fonts and font design using a range of tools. Investigate the potential of digital typography Produce a range of work showing the creative use of typography, Combine typography with image in innovative ways. Section D: Desk-Top publishing and text editors:Text Editing Software: Proprietary word processing applications with automated routines e.g., word count, spell checker, grammar checker, formatting styles, font styles, headers and footers. Design a range of page layouts using traditional methods, Prepare digital layot grid with common page elements, Prepare image, graphic and text files for use in page layout, Format document and check for accuracy, and present in an appropriate format for print. Books: B. Saraswati, Computerizing Cultures, New Age International Publishers, New Delhi. Course CodeCS-8001 Credits-4L 3, T- 1, P-0Name of the CourseQuantum ComputersLectures to be Delivered60 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Quantum Computers (CS-8001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course . For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Theory of computation: Effective Procedures and Computability, Finite State Machines, Turing Machines, Universal Turing Machines and the Halting problem , Computability Section B: Coding and Information theory: Computing and Communication Theory, Error Detecting and Correcting codes, Shanmons Theorem, The Geometry of Message space , Data Compression and Information, Information Theory, Coding Techniques, Analogue Signal Transmission Section C Reversible Computation and the Thermodynamics of computing: The Physics Of Information reversible computation and thermodynamics of Computing, Computation : Energy Cost Versus Speed, The General Reversible Computer, the Billard Ball Computer , Quantum Computation Quantum Mechanical Computers:Computation with a Reversible Machine and A Quantum Mechanical Computer, Imperfections and Irreversible Free Energy, Loss, Simplifying the implementation. Section D Bit vs. qubit, shors quantum algorithm of efficient computation for finding period of a periodic function, quantum mechanical operators and discrete fourier transforms. Digital logic gates vs. quantum logic gates; (C, N, F and CCN gate); One qubit rotation, Aj Transformation, Bjk transformation, Link between quantum dynamics of Schrodinger equation and unitary transformations describing qlogic gates. Physical realization of quantum computation. Books: R. P. Feynman, Feymnman Lectures on Computation, Pengnin Books ( 1996). PROFESSIONAL ELECTIVE - II Semester- VIII GPS and Application (IT 8006) Course CodeIT-8006 Credits-4L 3, T- 1, P-0Name of the CourseGPS and ApplicationLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50 Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Introduction: Overview of techniques of surveying with satellites, introduction to GPS System, applications of using satellites and GPS for 3D position, velocity, determination as a function of time, interdisciplinary applications (e.g., crustal dynamics, user segment, history of GPS constellation, GPS measurement characteristics, selective availability (SA) and antisopoofing (AS). Section - B Satellite orbits and Reference Systems: Two Body problem, orbit elements, time system and time transfer using GPS, coordinate systems, GPS orbit design, orbit determination problem, tracking networks, GPS force and measurement models for orbit determination, GPS broadcast ephemeris, precise GPS ephemeris. GPS Observable: Measurement types (C/A code, P-Code, L1 and L2 frequencies for navigation, pseudoranges), atmospheric delays (tropospheric and ionospheric), data format (RINEX), data combination (narrow/wide lane combinations, ionosphere free combinations , single - , double- , triple differences), undifferenced models, carrier phase vs integrated Doppler, integer biases, cycle slips, clock error. Section - C Processing Techniques: Pseudorange and carrier phase processing, ambiguity removal, least squares method for state parameter determination, relative positioning, and dilution of precision. Section D Surveying with GPS: Kinematics positioning, differential GPS (DGPS): Traditional DGPS, wide Area Differential GPS (WADGPS), Wide Area Augmentation System (WAAS). GPS Applications: Surveying, geophysics, geodesy, airborne GPS, ground transportation, space borne GPS orbit determination, attitude control, meteorological and climate research using GPS. Books: A. Leick: GPS Satellite surveying, 2nd edition, John Wiley * Sons, 1995. B.Parkinson, J. Spilker: GPS: Theory and Applications, Jr. (Eds), Vol. I & II, AIAA, 370 L Enfant Promenade SW, Wahington. A. Kleusberb and P.teunnisen (Eds): GPS for Geodesy, Springer- Verlag, 1996. Elliott D. Kaplan: Understanding GPS Principles and Applications, Publisher: Artech House, Published: March 1996. B. Hofmann Wellenhof, H. Lichenegger and J. Collins: GPS: Theory and Practice, 4th Revised Edition ($25), Springer, Wien, New York, 1997. Scottie Barnes, Lafe Low: GPS Basic Essentials Globe Pequot Press. Course CodeIT-8007 Credits-4L 3, T- 1, P-0Name of the CourseMobile ComputingLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Mobile Computing (IT-8007) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. (TITLE APPROVED CONTENTS TO BE DECIDED LATER) Course CodeES-8001 Credits-4L 3, T- 1, P-0Name of the CourseNeural NetworksLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Neural Networks (ES-8001) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section A Overview of biological neurons: Structure of biological neurons relevant to ANNs. Fundamental concepts of Artificial Neural Networks: Models of ANNS; Feed forward & Feedback networks; learning rules; Hebbian learning rule, perception learning rule, delta learning rule, Widrow-Hoff learning rule, correction learning rule, Winner-take all elarning rule, etc. Section - B Single layer Perception classifier: Classification model, Features & Decision regions; training & classification using discrete perceptron, algorithm, single layer continuous perceptron networks for linearly separable classifications. Multiplayer Feed forward Networks: linearly non-separable pattern classification, Delta learning rule for multi-perceptron layer. Generalized delta learning rule. Error back-propagation training, learning factors. Examples Section - C Single Layer feed back Networks: Basic Concepts Hopfield networks, training & Examples.. Associative Memories: Linear Association, Basic Concepts of recurrent Auto associative memory: retrieval algorithm, storage algorithm; By directional associative memory, architecture, Association encoding & decoding, Stability. Section - D Self organizing networks: UN Supervised learning of clusters, winner take all learning, recall mode, Initialization of weights, seperability limitations of weights, seperability limitations. Books: Introduction to Artificial Neural systems by Jacek M. zurada, 1994, Jaico Publ. House. Neural Networks: A Comprehensive formulation, Simon Haykin, 1998, AW. Neural Networks, Kosko, 1992, PHI Neural Network Fundamentals N.K. Bose, P. Liang, 2002, T.M.H Course CodeIT-8008 Credits-4L 3, T- 1, P-0Name of the CourseMultilingual Applications Lectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Multilingual Applications (it-8008) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type , which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. (TITLE APPROVED CONTENTS TO BE DECIDED LATER) Course CodeIT-8009 Credits-4L 3, T- 1, P-0Name of the CourseSpeech Image & CodingLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Speech Image & Coding (IT-8009) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the Sections A, B, C and D of the question paper and all the subparts of the questions in Section E. Use of non-programmable calculators is allowed. (TITLE APPROVED CONTENTS TO BE DECIDED LATER) Course CodeIT-8010 Credits-4L 3, T- 1, P-0Name of the CourseComputer Network ManagementLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time: 3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Computer Network Management (IT-8010) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E.. Use of non-programmable calculators is allowed. Section A System Design: Introduction, Resource constraints and their metrics, Common design techniques, Performance Analysis And Tuning. Network Management Tools: Network Management Tools: Tools Catalog, Bit Error Rate Tester, Basics Software Tools, SNMP MIB Tools, The Protocol Analyzer Network Statistics Measurement Systems: Traffic Load Monitoring, Protocol Statistics, Data and Error Statistics, Using MRTG to Collect Traffic Statistics Section B Network Management Systems: History of Enterprise Management. Network Management Systems: Functional Components, Multiple NMS Configuration, Network Management System Requirements Commercial Network Management Systems: Hewlett-Packards Open View Network Node Manager, Cabletrons Spectrum platform, Sun Network Management Systems Family System Management : High-End System management, Low-End System management, Enterprise Management Solutions, Computer Associates Unicenter TNG , Tivoli Enterprise manager Network Management Applications: Configuration Management: Network Provisioning, Inventory Management , Network Topology. Fault Management: Fault detection, Fault location and isolation Techniques. Performance Management: Performance Metrics, Data Monitoring, Problem Isolation, Performance Statistics. Event Correlation Techniques: Rule-Based Reasoning, Model-Based Reasoning, Case-Based Reasoning, Codebook Correlation Model, State Transition Graph model , Finite State Machine Model. Security Management: Policies and Procedures, Security Breaches and the Resources needed to Prevent Them, Firewalls, Cryptography, Authentication and Authorization, Client/ server Authentication Systems, Message Transfer Security, Protection of Networks from Virus Attacks. Accounting Management, Report management , Policy-Based management , Service level Management. Section C Web-Based Management: NMS with Web Interface and Web-Based Management, Web Interface to SNMP Management, Embedded Web-Based management , Desktop Management Interface, Web-Based Enterprise management WBEM: Windows Management Instrumentation. Java Management Extensions: Service-Driven Network, Java Dynamic Management Kit, JMX Architecture. Management of a Storage Area Network: The Jiro Platform. Future Directions. Section D Flow Control: Model , Classification, Open-loop flow control, Closed-loop flow control, Hybrid flow control Taffic Management: Introduction, An economic framework for traffic management, Traffic models, Traffic classes, Time scales of traffic management, Scheduling , Renegotiation , Signaling, Admission Control, Peak-load pricing, Capacity planning. Books: Network Management ( Principles and Practice), Subramanian, , Pearson Education Asia. 2nd edition. An engineering approach to computer Networking, S.Keshav. Pearson Education Asia. 4th edition. Computer Networks and Internets, Douglas E. Comer, Pearson Education, 2nd Edition. Course CodeIT-8011 Credits-4L 3, T- 1, P-0Name of the CourseDigital Image ProcessingLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Digital Image Processing (IT-8011) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section - A Introduction and Fundamental to Digital Image Processing: what is digital Image Processing, Origin of Digital Image Processing, Examples that use Digital Image processing, Fundamental steps in Digital Image Processing, Components of Digital Image Processing System, Image sensing and acquisition, Image sampling, quantization and representation, Basic relationship between pixels. Image Enhancement in the Spatial Domain & Frequency domain: Background, Basic gray level transformation, Histogram processing, Basics of Spatial filtering, Smoothing and Sharpening spatial filters, Introduction to Fourier Transform and the Frequency Domain, Discrete Fourier Transform, Smoothing and Sharpening Frequency Domain filters. Section - B Image Restoration: Image Degradation/Restoration Process, Noise models, restoration in presence of noise, Inverse filtering, Minimum Mean Square Filtering, Geometric menu filter, Geometric transformations. Color Image Processing: Color Fundamentals, Color models, Basis of full color image processing, Color transformations. Section - C Image Compression: Fundamentals, Image compression models, Error free compression, Lossy compression. Image Segmentation: Detection of Discontinuities, Edge linking and boundary detection, Thresholding, Region oriented segmentation. Section - D Representation, Description and Recognition: Representation-chain codes, polygonal approximation and skeletons, Boundary descriptors-simple descriptors, shape numbers, Regional descriptors-simple, topological descriptors, Pattern and Pattern classes-Recognition based on matching techniques. Recognition: Pattern and pattern classes, Decision Theoretic Methods. Books: Digital Image Processing by Rafael C. Gonzalez & Ricahrd E. Woods-2002, Pearson Education Pte. Ltd. Digital Image Processing by A.K. Jain, 1995, PHI Two-Tone Image Processing and Recognition, B.B. Choudhari, D.Dutta Majumdar, New Age International Publishers Ltd., New Delhi. Course CodeIT-8015 Credits-4L 3, T- 1, P-0Name of the CourseBioinformaticsLectures to be Delivered52 (1 Hr Each) (L= 39, T = 13 for each semester)Semester End Examination Max. Marks: 100Min. Pass Marks: 40 Maximum Time:3hrsContinuous Assessment (based on sessional tests (2) 50%, Tutorials/Assignments 30%, Quiz/Seminar 10%, Attendance 10%)Max. Marks: 50Semester- VIII Bioinformatics (IT 8015) Instructions For Paper Setters: The question paper will consist of five sections A, B, C, D, and E. Section E will be Compulsory, it will consist of a single question with 10-20 subparts of short answer type, which will cover the entire syllabus and will carry 40% of the total marks of the semester end examination for the course. Section A, B, C and D will have two questions from the respective sections of the syllabus and each section will carry 15% of the total marks of the semester end examination for the course. For Candidates: Candidates are required to attempt five questions in all selecting one question from each of the sections A, B, C and D of the question paper and all the subparts of the questions in section E. Use of non-programmable calculators is allowed. Section - A Cell and Molecular Biology Bioinformatics- concept and scope. (2) Cell structure, Cell organelle and their function, Differences between prokaryotic & eukaryotic cells, and plant & animal cells. (3) Nucleic acid: types, structure and function. (2) Protein: structure and functions. (2) Basics of DNA replication, transcription and translation. (3) Section - B Genomics Genome, genome organization in prokaryotes and eukaryotes. (2) Genome analysis: genome mapping, sequencing, fragment assembly and annotation. (4) Basics of sequence alignments, Major alignment tools/ software- BLAST nucleic acid sequence/ gene databases and Gene identification approaches- Genscan. (5) Section - C Proteomics Basic steps in protein isolation and purification (using gel chromatography and electrophoresis) and protein sequencing. (4) Protein sequence analysis: alignment, Homology search, Prediction of secondary structure, Protein families, Protein motif, Software for protein sequence analysis and Protein database. (4) Three dimensional (3D) protein structure prediction, 3D structure databases and Software for 3D protein modeling. (4) Section D Drug designing Molecular basis of a disease, molecular approaches to curing diseases. (3) Drug target identification in genome and proteom, protein-ligand docking in drug design, drug screening, screening of drug databases. (4) Modeling protein-protein and protein- DNA docking. (3) Software for prediction of intraction between drug molecules and drug targets. (3) Books: Cell and Molecular Biology: by E. D. P. De. Robertis and E. M. F. De. Robertis, B. F. Waverly Pvt Ltd. New Delhi, Ist edition, 1996. Bioinformatics: From Genomes to Drugs, Edited by: Thomas Lengauer John Wiley & Sons, July 25, 2001 Structural Bioinformatics, Edited by: Philip E. Bourne, Helge Weissig John Wiley & Sons, October 2002. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids by Richard Durbin (Author), Sean R. Eddy (Author), Anders Krogh (Author), Graeme Mitchison (Author). Bioinformatics: Sequence and Genome Analysis, Edited by: David W. Mount Cold Spring Harbor Laboratory, 1st edition March 15, 2001. Bioinformatics: A Practical Guide to the Analysis of Genes and Proteins, Second Edition, Edited by: Andreas D. Baxevanis, B. F. Francis Ouellette Wiley-Interscience, 2nd edition, April 6, 2001. PAGE 12 PAGE 182 Proposed Scheme of Examination (Common to all branches) Scheme of Examination (Common to all branches) Scheme of Examination (Information Technology) Scheme of Examination (Information Technology) Scheme of Examination (Information Technology) Scheme of Examination (Information Technology) Scheme of Examination (Information Technology) Scheme of Examination (Information Technology) Professional/Open Electives(Information Technology) +FuG u  0 1 n c 0;R_5:OJQJ\^J5OJQJ\^J"j5CJU\mHnHsH u5>*OJQJ\^J:OJQJ^J OJQJ^J6]CJ5\j5CJU\mHnHu;CJ,;CJ8 @YZ[\y $m &P#$/If $m &P#$/If$a$Nn-H8$$m &P#$/Ifa$$$Ifl4\<%+ 14% 6Pm 0t464 ladh$m &P#$/If $m &P#$/If#579;=ADFHLMWkFf:Ffdh$m &P#$/If $m &P#$/Ifkmoqswz|~FfFftdh$m &P#$/If "&)+-12<ikmoq<Ff" Ffdh$m &P#$/Ifquxz|Ffdh$m &P#$/IfFf\ dh$m &P#$/If   +wy{} $m &P#$/IfFfFfdh$m &P#$/If $m &P#$/IfFf[Ff!dh$m &P#$/IfG   / 0 dh$! &P#$/If$! &P#$/If$! &P#$/If$a$$ & Fpa$Ffdh$m &P#$/If0 1 < E G I K bMM;;;dh$! &P#$/If$dh$! &P#$/Ifa$$$IfTl\6"(03 6P! 064 laK Q X ] c h n o x FfFfdh$! &P#$/If   ! # % ) , . 0 4 5 > \ ^ ` b d h tFfv#$! &P#$/IfFf4!dh$! &P#$/Ifh k m o s t ~ Ff'Ff%dh$! &P#$/If            . W Y [ ] _ a b H$! &P#$/IfFf~,dh$! &P#$/IfFf<*dh$! &P#$/Ifb e h l m w      $! &P#$/IfFf0Ff.dh$! &P#$/If     & G I K M O Q R U X \ ] c f h k n r v z dh$! &P#$/IfFf`5Ff3dh$! &P#$/Ifz ~ .$dh$ &P#$/Ifa$$$$^a$$ & Foa$Ff7dh$! &P#$/If.P!AEFKPnm   e06U\]^9Wqw N !!"""""#$OJPJQJ^JmH sH ,jCJOJPJQJU^JmHnHsH u>*jCJUmHnHsH u5\5OJQJ\^JjCJUmHnHuE.=PQR]giC $$IfTl\%/N3:$ $ 8 6P 034 ladh$ &P#$/If$ &P#$/Ifikmt|Ff<$ &P#$/IfFf9dh$ &P#$/If79;=?CFHJN $$ &P#$/Ifa$Ff@>dh$ &P#$/If$dh$ &P#$/Ifa$NOYvxz|~FfB$dh$ &P#$/Ifa$dh$ &P#$/IfFf@Ѡ$dh$ &P#$/Ifa$Ff$x$~&`#$/Ifa$FfXdh$~&`#$/IfFfVx$~&`#$/If>BEGIMNW{}Fff]$x$~&`#$/Ifa$Ff'[x$~&`#$/Ifdh$~&`#$/If Ffa$x$~&`#$/Ifa$Ff_x$~&`#$/Ifdh$~&`#$/If8:<>@DGIKOPn|x$~&`#$/IfFf#ddh$~&`#$/If$~&`#$/If noxxffdh$~&`#$/If$x$~&`#$/Ifa$x$~&`#$/Ifb$$IfTl00 6`~004 la  $&(*,.4Ffhdh$~&`#$/If$x$~&`#$/Ifa$Ffbfx$~&`#$/If.036:;DPRTVXZ\_bfgmprtwװҘx$~&`#$/IfFfmFfjdh$~&`#$/Ifx$~&`#$/Ifw{x$&`#$/Ifx$&`#$/If$x$&`#$/Ifa$Ff^ox$~&`#$/Ifdh$~&`#$/If d SSSSSSSSx$&`#$/If$$IfTl\t"+0$$  6`004 la  )>@BDFJMOQUV`Ffsdh$&`#$/IfFfwqx$&`#$/If$x$&`#$/Ifa$Ff4xFfux$&`#$/Ifdh$&`#$/If &(*,.2579=>Hwy{DFf|$x$&`#$/Ifa$Ffszx$&`#$/Ifdh$&`#$/If{}|uLb$$IfTl00 6`004 laFf~x$&`#$/Ifdh$&`#$/If  )+-/1358;?Ff0dh$&`#$/Ifx$&`#$/If$x$&`#$/Ifa$?@J[]_acegjmqr|Ffdh$&`#$/If$x$&`#$/Ifa$x$&`#$/IfFfoל$x$&`#$/Ifa$[$\$Ff,$x$&`#$/Ifa$Ffx$&`#$/Ifdh$&`#$/If  !"-79B $$IfTl\t"+0$$  6`004 lax$&`#$/Ifx$&`#$/If9;=DLQX]deoFfdh$&`#$/IfFfEx$&`#$/If!#%)PFfÐx$&`#$/Ifdh$&`#$/If$x$&`#$/Ifa$)*4MOQSUY\^`deoFfAdh$&`#$/If$x$&`#$/Ifa$x$&`#$/IfFf|Ff$x$&`#$/Ifa$Ffx$&`#$/Ifdh$&`#$/If "$&(+.23 zzzzuFfdh$&`#$/Ifx$&`#$/Ifb$$IfTl00 6`004 la 3<VXZ\^`behlmwÀFf=dh$&`#$/If$x$&`#$/Ifa$x$&`#$/If  !#%')+-.ҌFfdh$&`#$/IfFf|x$&`#$/If./069;=@DHLPUVWXYZ[\^Ff9dh$&`#$/If$x$&`#$/Ifa$Ffx$&`#$/If^. $$IfTl\t"+0$$  6`L004 lax$L&`#$/Ifx$L&`#$/If$x$L&`#$/Ifa$!$&(,-Ffdh$L&`#$/IfFfRx$L&`#$/If-7NPRTVZ]_aefpFfЭdh$L&`#$/If$x$L&`#$/Ifa$x$L&`#$/IfFfNdh$L&`#$/If$x$L&`#$/Ifa$Ffx$L&`#$/If!#%')-02489W|$x$L&`#$/Ifa$Ff̶$x$L&`#$/Ifa$Ffx$L&`#$/Ifdh$L&`#$/IfWXbz|~xffffdh$L&`#$/If$x$L&`#$/Ifa$x$L&`#$/Ifb$$IfTl00 6`L004 la FfJdh$L&`#$/If$x$L&`#$/Ifa$Ff x$L&`#$/If  #%')+-/259:DZ\״ $x$Ifa$ x$IfFfȿ$x$L&`#$/Ifa$Ffx$L&`#$/Ifdh$L&`#$/If\^`bdfilpqwz|dh$L&`#$/Ifx$L&`#$/If$x$L&`#$/Ifa$Ff dh$If x$If x$!&`#$/Ifx$!&`#$/If$x$!&`#$/Ifa$h^h & FqFfF  " $ & - 5 : d SSSSSSSSx$!&`#$/If$$IfTl\t"+0$$  6`!004 la : A F M N X LT$x$!&`#$/Ifa$Ffdh$!&`#$/IfFf_x$!&`#$/If !!!!#!%!'!+!.!0!2!6!7!>!Q!S!U!W!Y!FfFfx$!&`#$/Ifdh$!&`#$/IfY!]!`!a!b!f!g!n!!!!!!!!!!!!!|FfFf[x$!&`#$/Ifdh$!&`#$/If!!!!!!!!!!!!!"xsFf$x$!&`#$/Ifa$x$!&`#$/Ifb$$IfTl00 6`!004 la " """""!"""#"&")"-"."8"i"k"m"o"q"s"u"x"{"Hdh$!&`#$/IfFf$x$!&`#$/Ifa$x$!&`#$/If{""""""""""""""""""""" dh$If & FsFfdh$!&`#$/Ifx$!&`#$/IfFfWx$!&`#$/If"##*#+#3#G#O#t#I($$IfTl\H4$X\ \ 0$64 la dh$If dh$If $dh$Ifa$t#u#}#########g,^^^^g^^^^ dh$If$$IfTl\H4$X\ \ 0$64 la ##$ $($8$9$A$X$`$y$g^^^^g^^^^ dh$If$$IfTl\H4$X\ \ 0$64 la y$z$$$$$$$$$$g^^^^g^^^^ dh$If$$IfTl\H4$X\ \ 0$64 la $$$$$$$$$gl^^^^gY^$a$ dh$If$$IfTl\H4$X\ \ 0$64 la$%%*%+%3%G%O%t%I($$IfTl\H4$X\ \ 0$64 la dh$If dh$If $dh$Ifa$$%&&(.(B(K(k(w((((((((())+)6):);)L)O)P)b)c)d)))))) *+ , ,,-^.g.h./0 0 00(1*13141N1/20272p2q222333333ʾCJ5;CJH*\ 5CJ\ 5;CJ\ 5;\; 5CJ\CJ 5>*\>*\ 6>*CJ]>*CJ 5>*CJ\;CJ;CJ;CJN5\Bt%u%}%%%%%%%%%g,^^^^g^^^^ dh$If$$IfTl\H4$X\ \ 0$64 la %%& &(&8&9&A&X&`&y&g^^^^g^^^^ dh$If$$IfTl\H4$X\ \ 0$64 la y&z&&&&&&&&&&g^^^^g^^^^ dh$If$$IfTl\H4$X\ \ 0$64 la &&&&&&&&'%'>'gl^^^^g\WWW$a$ dh$If$$IfTl\H4$X\ \ 0$64 la >'_'{''''(((((( ((0(1(2(3(4(5(6(7(8(9(:(;(<(=(>($a$$a$>(?(@(A(B(j(k(w(((($&P#$/Ifxx$&P#$/If (((([LL$&P#$/If$$IfTl4\ f#t ^3{ 6P0#4 la((()4rr$&P#$/If}$$IfTl40 #t   6P0#4 la))+);)P)c)Lrrrr$&P#$/If}$$IfTl40 #t   6P0#4 lac)d)))[LL$&P#$/If$$IfTl4\ ##t { v 6P0#4 la))))+,, -^.h.xxskb[W[$xa$$h^ha$$ & Fa$ & F$h`ha$}$$IfTl40# v 6P0#4 la h.0 0*1410272q2223Y3333333333$) &P#$/Ifxx$) &P#$/If$ & Fa$$a$ $x^a$$xa$ $x^a$33333333 4 4#4V4W4q4|4444444445*5-5.5/5N5=7L7M7@8J8Z8X:w::;+<9<:<U=V=o=?????@@@@AXAYAZA[AwAAAAAAAAAAAAAB)B*BDBOBSBTBeBhBCJCJH* 5CJ\CJ 5>*\>*\ 6>*CJ]5\ 5>*CJ\>*CJ ;>*CJP3333 4L$$IfTl4\ f}#t ^ 6P) 0#4 la$) &P#$/If 4 4#4V44rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laV4W4q4444Hrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la445.5[SS$If$$IfTl4\ ##t { v 6P) 0#4 la.5/5<5=7@8J88X:::xskd]YPd  [nxx$xa$ s$ & Fa$ & F$h`ha$}$$IfTl40# v 6P) 0#4 la :+<U=V=`=???@@@A4AXAYAZA[A\A]A^A_A`AaAbAcAdAeA & F$a$ s  sxeAfAgAhAiAjAkAlAmAnAoApAqArAsAtAuAvAwAxAyAzA{A|AA$$$exx`ea$ $hxx`ha$AAAAAAA;$$IfTl\ f}#t ^ 6P0#44 la$&P#$/Ifxx$&P#$/IfAAAAB)Bt{$$IfTl0 #t   6P0#44 la$&P#$/If)B*BDBTBiB{BHtttt$&P#$/If{$$IfTl0 #t   6P0#44 lahBiBzB{B|BBBCCC6C"E2E|F}FFFHHIIIJJ'JJJKKKK8KOKKLLLLLLMMM#M$MOMPMMN NO OOOOOOO P!P-P5PBPCP»ԳOJPJQJ^JmH sH CJH*\CJ\;CJ 5;CJ\ 5;\ 5;CJ\;;CJCJ 5CJ\CJ 5CJ\ 5>*\>*>*CJ 6>*CJ] 5>*CJ\?{B|BBCC]lUUU$If$$IfTl\ ##t { v 6P0#44 laCC$C"E%F|F}FFHpcZRRPPK$a$$ & Fta$  & Ftxx $hxx`ha$$$IfTlFb#<v 6P0#    44 laHIIIJJJJKKK8KKLLLMMM$MPMMM4NNNGO & F & Fh^h$a$GOOOOOOOOOOOOOOOOOOOOOOOOOOOO[$\$ & FOOOOOOOOOOOOO P!P-P5PCPSP$&P#$/Ifxx$&P#$/IfCPSPTPgPPPPPPP Q QQQ"Q#Q5Q6Q7QQQQQQQSSSTTTTUVVV^W_WiWyWZZZZ[[\]3^=_>_Q_ddAeDeaebeneweeeǾǾǾDzǾDzǾǾݾǾǾCJ;CJ56CJOJQJ\]^J5CJOJQJ\^JCJOJQJ^J5CJOJQJ\^J5CJ 5CJ\CJ 5>*\>*\ 6>*CJ]>*CJ5\ 5>*CJ\=SPTPgPP[ LL$&P#$/If$$IfTl4\ f#t ^ 6P0#4 laPPPP4rr$&P#$/If}$$IfTl40 #t   6P0#4 laPPPQ#Q6QLrrrr$&P#$/If}$$IfTl40 #t   6P0#4 la6Q7QQQ[LL$&P#$/If$$IfTl4\ ##t { v 6P0#4 laQQQQSTTTUVxxskig[V$a$ $<<[$\$a$$ & Fua$ & Fu$h`ha$}$$IfTl40# v 6P0#4 la V^W_WiWZZZ[[[]3^N^]^z^^^^^ _=_>_Q_ & F$[$a$ $x[$\$a$x[$\$[$[$\$ $x<[$\$a$Q___b`` aaIaaaawbbcdcc5ddddddeAeBeCeDe[$\$^`[$\$Debeneweeee7$$IfTl4\ f#t ^ 6PI0#4 la$I&P#$/Ifxx$I&P#$/Ifeeeeeee f f%f0f4f5fFfIfJf\f]f^fffffffghiiiijkkkOmYmnomoooppqq qq"q#q3q4qGqtquqqqqqqqqqrrrrrrrrrrrrrttu;CJ5CJ aJmH sH CJ 5CJ\CJ 5>*\>*\ 6>*CJ]>*CJ5\ 5>*CJ\Neeeee fr4}$$IfTl40 #t   6PI0#4 la$I&P#$/If f f%f5fJf]fLrrrr$I&P#$/If}$$IfTl40 #t   6PI0#4 la]f^fff[LL$I&P#$/If$$IfTl4\ ##t { v 6PI0#4 laffffhiijjkkxxskb^WW^$<a$<$h^ha$$ & Fva$ & Fv$e`ea$}$$IfTl40# v 6PI0#4 la kJllOmYmnomoooo"pXpppppqq qq$9&P#$/Ifxx$9&P#$/If$h`ha$$ & Fa$$a$ <5$7$8$9DH$<$<a$q#q3q4qGqtqL$$IfTl4\ f#t ^ 6P90#4 la$9&P#$/Iftquqqq4rr$9&P#$/If}$$IfTl40 #t   6P90#4 laqqqqrrLrrrr$9&P#$/If}$$IfTl40 #t   6P90#4 larrrr[SS$If$$IfTl4\ ##t { v 6P90#4 larrrrrrtuuvvvvqi_]]   xx$ & Fwa$ & Fw$h`ha$}$$IfTl40# v 6P90#4 la uuvvvwwHxIxSxxxyyzzz { {{{,{-{={>{Q{e{f{{{{{{{{{{{{{{{||]|^|i|l|~||||||}}}~~~~vw<>I漹 5>*CJ\CJ 5CJ\ 6>*CJ] 5>*CJ\ 6>*CJ]>*CJ 5>*CJ\;CJCJ\CJ 5CJ\ 5>*\5\>*FvvwHxIxSxxxyyyyy!zJzqzzzzz $  h^ha$ $ & F  a$   5$7$8$9DH$ $  xxa$  x    5$7$8$9DH$$  a$zz {{{-{={$I&P#$/Ifxx$I&P#$/If={>{Q{e{[LL$I&P#$/If$$IfTl4\ #t  6PI0#4 lae{f{{{rr$I&P#$/If}$$IfTl40 #t   6PI0#4 la{{{{{{Drrrr$I&P#$/If}$$IfTl40 #t   6PI0#4 la{{{|*|^|m||[$LLLLLL$I&P#$/If$$IfTl4\ ##t { v 6PI0#4 la|||||%}F}[YTKF>$ & F a$ & F $xxa$$a$$$IfTl4\ ##d +{ v 6PI0#4 laF}}}~~~~~ V3vwՀ5| & FL`L & F ^h^h $;^`;a$$a$xxZÂ>?I~!_ՄK˅K݆ $ & F <<a$^ 0^`0h^h & F 8 & F ˅݆$%'3;HIYZmʼnƉ"9:͊Ίϊ5JŒÌKMӍԍST/0no¿; 5;CJ\ 5CJ\CJ;CJ\ 6>*CJ] 5>*CJ\ 6>*CJ]>*CJ 5>*CJ\5CJ 5>*CJ\CJ 5CJ\5\E݆!m?$%&'3;IY$) &P#$/Ifxx$) &P#$/Ifxx$ & F a$$a$ $ & F<<a$YZm[LL$) &P#$/If$$IfTl4\ f#t ^ 6P) 0#4 laʼnrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laʼnƉHrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la$:R[LLLLLLL$) &P#$/If$$IfTl4\ ##t { v 6P) 0#4 laΊϊЊ[NLJCC$xa$ $hxx`ha$$$IfTl4\ ##d +{ v 6P) 0#4 la,t5JÌMԍT0o+H $ & Fxa$$80x^8`0a$ $hx^ha$$8x^8`a$$xa$xx$a$$ & Fa$$xxa$*+GH[\st~ҐӐِؐ@A%&EFhiԒՒܒݒ}ʓ˓ޓKLfqtu ž 6>*CJ] 5>*CJ\CJ 6>*CJ]5\>*CJ 5>*CJ\56;CJ\];CJ 5;CJ\ 5CJ\KH\tӐِA&FiՒݒ~x$xa$$ & Fx^`a$ $hx^ha$ $ & Fxa$ $ & Fxa$$) &P#$/Ifxx$) &P#$/Ifʓ˓ޓL$$IfTl4\  #t   6P) 0#4 la$) &P#$/IfK\rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laKLfu@rrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laה [LL=LLL$) &P#$/If$) &P#$/If$$IfTl4\ ##t { v 6P) 0#4 la+-./0QRT~Ӗ֚ۘkl2:ÝɞʞٞڞLMgruv -ÿظظظ 6>*CJ] 5>*CJ\CJ 5>*CJ\5CJCJOJQJ^J5CJOJQJ\^J5\CJ 5CJ\ 5CJ\CJ;CJ\>*CJ 6>*CJ]B./0RSTL?=;; $hxx`ha$$$IfTl4\ ##d +{ v 6P) 0#4 la$) &P#$/IfT~ЖӖ8^2hۘ & Fd & F^^xx$^a$$ & F|a$$xxa$$xxa$ۘԙ}֚']. [$\$^[$\$ & F 8gd`g  & Fgd`g & Fdd^ & Fdd.Pl؜23;]xx $[$\$a$ [$\$^ [$\$^  & F[$\$[$\$  & F[$\$ʞٞ$) &P#$/Ifxx$) &P#$/Ifٞڞ[LL$) &P#$/If$$IfTl4\ #t % 6P) 0#4 laL rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laLMgvDrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la؟ [LL=LLL$) &P#$/If$) &P#$/If$$IfTl4\ ##t { v 6P) 0#4 la-/012TUVѡCS qx}Jɦ 89S^absvwH?_ժ֪>?Z 6>*CJ] 5>*CJ\CJ5\ 5>*CJ\CJOJQJ^J5CJOJQJ\^JCJ 5CJ\CJ;CJ\ 6>*CJ]>*CJF012UVL?=; $hxx`ha$$$IfTl4\ ##d +{ v 6P) 0#4 la$) &P#$/IfVѡCS >Yqۣ & Fdd^ & Fd & F & Fxxx$ & F{a$$xxa$$xxa$ۣ7cŤ?xJKLxx$&P#$/Ifxx  & F[$\$ [$\$^[$\$ & F Ad^A`d^ & FdɦL$$IfTl4\ #t  6P0#4 la$&P#$/If 8rr$&P#$/If}$$IfTl40 #t   6P0#4 la89SbwDrrrr$&P#$/If}$$IfTl40 #t   6P0#4 laŧ[LL=LLL$&P#$/If$&P#$/If$$IfTl4\ ##t { v 6P0#4 laHzLJA8$xxa$$xxa$$$IfTl4\ ##d +{ v 6P0#4 la$&P#$/Ifz¨>?_ժ֪>?Z20c$8^8a$$ & F!a$$ & F!a$$h`ha$xx$a$$ & Fza$Zͭfh}%+2YcjBCU˱'(BMPQbefwxy߲.ho%&-`aζܶùù56;CJ\] 5;CJ\\ 6>*CJ] 5>*CJ\CJ 6>*CJ]>*CJ 5>*CJ\;CJ 5CJ\5\CJIͭBfgh}%wٯ12Y_c8^8 & F! $ ^ & F!$ & F!a$$ & F!a$$8^8a$cdkCDEFGHIJKLMNOPQRSTUVWXYZ[\xx\]^_`$I&P#$/Ifxx$I&P#$/If ˱[LL$I&P#$/If$$IfTl4\ f#t ^ 6PI0#4 la' rr$I&P#$/If}$$IfTl40 #t   6PI0#4 la'(BQfxDrrrr$I&P#$/If}$$IfTl40 #t   6PI0#4 laxy[,L=LLL$I&P#$/If$I&P#$/If$$IfTl4\ ##t { v 6PI0#4 la.`ɳh[TKCC=xx$ & Fya$$xxa$$xa$$$IfTl4\ ##d +{ v 6PI0#4 lah&aGn߹J $a$xx & F# & F# $Dxx^Da$$ & F" pxx^`a$ <=IQ^_op !"345ڼƾ־տ23=b) K껷껷껰껰 5;CJ\CJ 5CJ\ 5>*\>*\ 6>*CJ]>*CJ 5>*CJ\5OJQJ\^J5CJOJQJ\^J"5CJOJPJQJ\^JmH sH 5\56CJ\] 5CJ\CJ:=IQ_o$&P#$/Ifxx$&P#$/If $8[$\$a$[$\$ op[LL$&P#$/If$$IfTl4\ f#t ^% 6P0#4 la0rr$&P#$/If}$$IfTl40 #t   6P0#4 la "4Hrrrr$&P#$/If}$$IfTl40 #t   6P0#4 la45[LL$&P#$/If$$IfTl4\ ##t { v 6P0#4 laȼƾɿʿտtkcZXSQQ$a$$h^ha$$ & F}a$  & F}xx $hxx`ha$}$$IfTl40# v 6P0#4 la 34= i9:;<=>?_ks$&P#$/If$ & F%a$ & F%xxKM89;^_ks!,01BDEVWX t{|`b ٽ;CJ5CJCJH*CJCJ 5CJ\ 5>*\>*\ 6>*CJ]5\>*CJ 5>*CJ\; 5CJ\ 5;CJ\5;CJH*\F[LL$&P#$/If$$IfTl4\ f#t ^ 6P0#4 la0rr$&P#$/If}$$IfTl40 #t   6P0#4 la!1EWDrrrr$&P#$/If}$$IfTl40 #t   6P0#4 laWX[LL$&P#$/If$$IfTl4\ ##t { v 6P0#4 latkcaa\ZS L$a$$ & F~a$  & F~xx $hxx`ha$}$$IfTl40# v 6P0#4 la tu|3$&P#$/Ifxx$&P#$/If$ & F&^`a$$ & F&a$$a$<< L$a$ )L|$$IfTl4\ #t  6P0#4 la$&P#$/If )*Cuv>JMNOn`pn}Zfz]rXc $-:;LM`a¾±έ;>*;CJOJPJQJ^JmH sH 5CJCJ\CJ\5CJCJ 5CJ\CJ 5CJ\ 5>*\>*\ 6>*CJ]5\>*CJ 5>*CJ\B)*Cu0rr$&P#$/If}$$IfTl40 #t   6P0#4 lauvLrrrr$&P#$/If}$$IfTl40 #t   6P0#4 la?N[LL$&P#$/If$$IfTl4\ ##t { v 6P0#4 laNO\`cdnZtkcZXRLPPPP$h^ha$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# v 6P0#4 laz]X@+~[$\$$ & F'a$$a$$Pa$PP$-;L$) &P#$/Ifxx$) &P#$/IfLM`[LL$) &P#$/If$$IfTl4\ #t  6P) 0#4 la4rr$) &P#$/If}$$IfTl40 #t  6P) 0#4 la#$%v '()5ZC&34DEXvw;CJ 6>*CJ]OJPJQJ^JmH sH 5>*CJ\>*CJCJ 5CJ\\ 6>*] 5>*\5\>*L$Hrrrr$) &P#$/If}$$IfTl40 #t  6P) 0#4 la$%[SS$If$$IfTl4\ #t { v 6P) 0#4 lavvmec]]XX$a$<<$ & Fa$  & Fxx $ex`ea$}$$IfTl40#v 6P) 0#4 la As()5Cb & F( & F(^`  & F(^`xx$<<a$<<xx&4D$) &P#$/Ifxx$) &P#$/If $$[$\$DEXv[LL$) &P#$/If$$IfTl4\ f#t ^ 6P) 0#4 lavw4rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laHrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la[SS$If$$IfTl4\ ##t { v 6P) 0#4 lavvqica\\ & F)`$ & Fa$ & F$h`ha$}$$IfTl40# v 6P) 0#4 la (`j$2X  FRZghxy !256HIJAB+-.:]~ܸ5CJCJH*\ 6>*CJ]>*CJ 5>*CJ\;CJ5CJ 5CJ\ 56\]5\ 5CJ\CJ 5>*\>*CJH(`j&$%&'12h^h & F, & F+ & F* 8^` & F* 8x^`x & F)2zbu:jRX4   <`< & F.$ & F.a$$a$ & F-FRZhx$&P#$/Ifxx$&P#$/Ifxy[LL$&P#$/If$$IfTl4\ f#t ^ 6P0#4 la4rr$&P#$/If}$$IfTl40 #t   6P0#4 la!6ILrrrr$&P#$/If}$$IfTl40 #t   6P0#4 laIJ[LL$&P#$/If$$IfTl4\ ##t { v 6P0#4 la-riaXSSQ$a$$xxa$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# v 6P0#4 la -.:~A B N     ?        $h`ha$$ & F/a$ $a$ 5$7$8$9DH$[$\$^$a$~? A B N e     . 0           ( E F _             [ m o p q  ~mzhvݿʿʿٿٿٿʿʿٿʸ氲55CJ\ 6>*CJ] 5>*CJ\;CJ>*CJCJH*>* 5>*\5\CJ 5CJ\CJ\CJ 5CJ\OJPJQJ^JmH sH E       7$$IfTl4\ f#t ^ 6P90#4 la$9&P#$/Ifxx$9&P#$/If ( E F _  r4}$$IfTl40 #t   6P90#4 la$9&P#$/If      Lrrrr$9&P#$/If}$$IfTl40 #t   6P90#4 la  \ p [,SS$If$$IfTl4\ ##t { v 6P90#4 lap q r  ~vvgWUPK$a$$a$$ & F 8^a$ & F 8x^ $hx`ha$}$$IfTl40# v 6P90#4 lamnzhvV] 9 & F0$`xx^``a$ x5$7$8$9DH$ x^`$d^`a$ ^`$d^`a$V] *+;<Oefijux   E Y Z [ ""S#U### %%^%`%%%P&R&&&ȸ>*CJmH sH CJCJ;CJ\ 6>*CJ] 5>*CJ\ 6>*CJ]5\>*CJ 5>*CJ\OJPJQJ^JmH sH 5CJ\ 5CJ\5CJCJ\A`Y +;$) &P#$/Ifxx$) &P#$/If $[$\$ & F0 ;<Oe[LL$) &P#$/If$$IfTl4\ f#t ^ 6P) 0#4 laefrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laDrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 lajy[TLLLL$) &P#$/If$$IfTl4\ ##t { v 6P) 0#4 la T[YWNE=$ & Fa$$xxa$$xxa$$$IfTl4\ ##d +{ v 6P) 0#4 laTu  D E Y Z   0!1!!!E"F"""T#U###?$@$$$ & F1h^h & F1 xx$ & Fa$$%%_%`%%%Q&R&&&&&E'F'~''''''''($) &P#$/Ifxx$) &P#$/If & F1&&&D'F'}''''''''''(((,(-(.(G(a(b(|((((((((((((())&)));)=)>)?)F)P)\)])^))*++++F-G---M.N.P.\.d.q.r.....¿OJPJQJ^JmH sH CJ;CJ;\ 6>*CJ] 5>*CJ\CJ 6>*CJ]>*5\>*CJ 5>*CJ\ 5CJ\>*CJCJF(((-([LL$) &P#$/If$$IfTl4\ #t  6P) 0#4 la-(.(G(a(rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laa(b(|((((Hrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la(((()*)>)[,L=LLL$) &P#$/If$) &P#$/If$$IfTl4\ ##t { v 6P) 0#4 la>)?)])^)))*[YWNE=$ & Fa$$xxa$$xxa$$$IfTl4\ ##d +{ v 6P) 0#4 la*#*$**n++++ ,,1,C,_,,,,,-F-G-----.M. & F3 & F2xx$^a$$ & Fa$M.N.P.\.d.r..$) &P#$/Ifxx$) &P#$/If[$\$xx....[LL$) &P#$/If$$IfTl4\ #t  6P) 0#4 la....rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la.....// /!/2/6/7/H/I/J/U/j/k/////////000-0h1|1}1y4z44444444444555L5M5g5r5u5v55555555556666%6'6(6)6*6T667ſſCJ 5CJ\CJ;CJ\ 6>*CJ] 5>*CJ\CJ\56>*CJ\] 6>*CJ]>*CJ 5>*CJ\5\J../!/7/I/Hrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laI/J/U/k////[,L=LLL$) &P#$/If$) &P#$/If$$IfTl4\ ##t { v 6P) 0#4 la//00-0_00[YWNE=$ & Fa$$xxa$$xxa$$$IfTl4\ ##d +{ v 6P) 0#4 la000h1}11222U333494y4z4{4|4}4~4444444hdh^h & F4dhxx$a$$ & Fa$444444444$$&#$/Ifa$$&#$/Ifxx$&#$/If4445[LL$&#$/If$$IfTl4\ #t  60#4 la555L5(rr$&#$/If}$$IfTl40 #t   60#4 laL5M5g5v555Drrrr$&#$/If}$$IfTl40 #t   60#4 la555566(6[,L=LLL$&#$/If$&#$/If$$IfTl4\ ##t { v 60#4 la(6)6*6T6666[YPG??$ & Fa$$xxa$$xxa$$$IfTl4\ ##d +{ v 60#4 la66777788)8V88888909H9I9Y99999 & Fdd^d & Fd & F^ & Fxx$^a$777888)8888H9I9Y9999_:o:::;;;;<<<<<<<<<====0=\=]=w=============>> >#>5>7>8>9>c>r>t>>?νννʽʽĦ5;\ 6>*CJ] 5>*CJ\CJ 6>*CJ]5>*\>*CJ 5>*CJ\CJOJQJ^J5CJOJQJ\^J 5CJ\CJ5\CJ 5CJ\A99:=:_:`:o::::::;M;o;;;;<<<xx$) &P#$/If & F5  & F5[$\$ [$\$^[$\$ & Fdd^<<<<<<=L$$IfTl4\ #t  6P) 0#4 la$) &P#$/If==0=\=rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la\=]=w====Drrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la====>$>8>[,L=LLL$) &P#$/If$) &P#$/If$$IfTl4\ ##t { v 6P) 0#4 la8>9>s>t>>>?[VTKB:$ & Fa$$xxa$$xxa$$a$$$IfTl4\ ##d +{ v 6P) 0#4 la?9?:??e@@@@@@A(AHAhAAAA0BABBBIBCCh^h$ & F6x^`a$dhxx$a$$ & Fa$?e@ABBBGBIBCC#C+C8C9CHCIC\CwCxCCCCCCCCCCCDD DD)D*DpDqD|DDDDDDDDD"F#F9FHHH%H&H'H(H5H[HgHoH|H}HHHHHHHI I#I.ICJ8 5CJ8\ 5CJz\ OJQJ^JCJ;CJ\ 6>*CJ] 5>*CJ\CJ 6>*CJ]>*CJ 5>*CJ\ 5CJ\5CJ5\EC#C+C9CHCIC\C9$$IfTl4\ f#t ^ 6P) 0#4 la$) &P#$/Ifxx$) &P#$/If\CwCxCCCr}$$IfTl40 #t   6P) 0#4 la$) &P#$/IfCCCCCDDrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laD DD*DqDDD[0L=LLL$) &P#$/If$) &P#$/If$$IfTl4\ ##t { v 6P) 0#4 laDDDDDEaE[NLC:5 & F$xxa$$xxa$ $hxx`ha$$$IfTl4\ ##d +{ v 6P) 0#4 laaEEE"F#F8F9FXFxFFFFG5GsGGHHHHH H H H H H$a$x$ & F7dh[$\$a$^ & F HHHHHHHHHHH&H(H5H[HgHoH}HH$ &P#$/Ifxx$ &P#$/If$xxa$$$$a$HHHH[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 laHHHI4rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laI I#I3IHI[ILrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la.I2I3IDIGIHIZI[I\IIIIIIJKKKKLLMMMMoO{OOPP,PMQUQQQQQRRYSSSTTjTkTTTTTU UU'U(U6U7UJU_U`UaUbU{UUUUUUUUUUUUV;CJ5 5H*\ 5CJH*\ 5CJ\CJCJ 5CJ\ 5>*\>*\5\ 6>*CJ] 5>*CJ\>*CJJ[I\III[LL$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 laIIIIKLLLMMMxxk[YYYYY$ & F h^ha$  & F h^h$h`ha$}$$IfTl40# v 6P 0#4 la MoOpO{OPPPMQNQUQQ#ReRRYSSTkTTTU UUU$$ &P#$/Ifa$xx$ &P#$/If & F8U(U6U7UJU`UaUN?$ &P#$/If$$Ifl4\ f#t ^ 6P 0#4 la$ &P#$/IfaUbU{UU0tt$ &P#$/If{$$Ifl4h0 #t   6P 0#4 laUUUUUUHtttt$ &P#$/If{$$Ifl40 #t   6P 0#4 laUVvVwVV]NNN$ &P#$/If$$Ifl4\ ##t { v 6P 0#4 laVuVVVVVVVVVVXXYY [#\/\\]]%]&](]^^___```````` a aaa-aSaTamaaaaaaaaaaaaebrbubvbwbxbbddeewffg4ggg%i:i jĿĿĿĿĿ 5;\;5CJCJ\5\5CJ 5CJ\ 5>*\>*CJ;CJ\>*CJ 6>*CJ] 5>*CJ\KVVVVVVXYYNZvtri`XVr$ & Fa$  & Fxx$xxa$ $hxx`ha${$$Ifl40# v 6P 0#4 la NZ [[[[#\$\/\\\]]&](]^^^q_r____`H````$xxa$`````` aa$ &P#$/If$$ &P#$/Ifa$xx$ &P#$/If $hxx`ha$aa-aSa[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 laSaTamaa0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laaaaaaa@rrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 laaafbgbvb[LLL$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 lavbwbxbbdeewfgveULLL$xxa$$ & F ^a$ & F xx^$xxa$}$$IfTl40# v 6P 0#4 laggg%i jjjBkLk llYll;mmmmmmm$$ &P#$/Ifa$xx$ &P#$/If$xxa$$ & F9 8<<`a$$xxa$ j*CJ;CJ\ 6>*CJ]5\>*CJ 5>*CJ\CJ 5;\;Pmmnnn&nCnN$$Ifl4\ #t  6P 0#4 la$ &P#$/IfCnDn]nn4tt$ &P#$/If{$$Ifl40 #t   6P 0#4 lannnnnnLtttt$ &P#$/If{$$Ifl40 #t   6P 0#4 lannZoio]NN$ &P#$/If$$Ifl4\ ##t { v 6P 0#4 laiojowoooqrrvtvcSJ$xxa$$ & F ^a$ & F xx^ $hxx`ha${$$Ifl40# v 6P 0#4 larssttkuuugvmvvvwdwwwx xx$$ &P#$/Ifa$xx$ &P#$/If & F:xxh^hex^e $hxx^ha$$xa$ hxx^hxx(x8x9xLx^xL$$IfTl4\ #t  6P 0#4 la$ &P#$/If^x_xxxx0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laxxxxxxLrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 laxxxxxsyyyyyyyyy{{||Zg STWb XZ`c|~$%'3;HIYZm·χ   !Јш݊5CJCJH*CJ 5CJ\ 5>*\>*;CJCJ\>*CJ5\ 6>*CJ] 5>*CJ\Nxxtyy[LL$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 layyyyy{||trtaQF $ xa$$ & F ^a$ & F xx^ $hxx`ha$}$$IfTl40# v 6P 0#4 la|}}F~\g TUVWb< wĄ!م, & F;x$xa$ $ xa$ $ xa$$%'3;IY$ &P#$/Ifxx$ &P#$/If & F; x YZm[LL$ &P#$/If$$IfTl4\ f#t ^ 6P 0#4 la·0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 la·χ Hrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la ![LL$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 laшވ݊trtia\W\\$a$$a$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# v 6P 0#4 la ܎ݎ9D(HUœ2=@ASTUfghsΔϔڔݔXn̛ԛ֛ !"$0?LM56;CJ\] 5;CJ\ 6>*CJ] 5>*CJ\CJ 6>*CJ]5\ 5>*CJ\;CJ>*CJCJ 5CJ\CJ\5F9:D({<q͒EFHU $hxx`ha$$ & F<a$$a$$a$œ;$$Ifl4\ f#t ^ 6P 0#4 la$ &P#$/Ifxx$ &P#$/Ifœt{$$Ifl40 #t   6P 0#4 la$ &P#$/If2AUg@tttt$ &P#$/If{$$Ifl40 #t   6P 0#4 laghsϔޔ],N?NNN$ &P#$/If$ &P#$/If$$Ifl4\ ##t { v 6P 0#4 laO]TKCC:$^a$$ & Fa$$xxa$$xxa$$$Ifl4\ ##d +{ v 6P 0#4 laXYn)]—Iy=#Zz $ & F>xxa$$xxa$ $ & F=xxa$ $8xx^8a$ $ & F=xxa$$xxa$xxzƚ/̛͛ !"$05?$ &P#$/If$$ &P#$/Ifa$xx$ &P#$/Ifxx$0xx^`0a$ & F> $ xx^ $ & F>xxa$ $hxx^ha$?M\]pN$$Ifl4\ f#t ^ 6P 0#4 la$ &P#$/IfM\]p̜͜  )>? E[NOPR^kxyͦΦ (367HKL]^_jŧƧѧԧý 5CJ\CJCJ 5CJ\;CJCJ\ 6>*CJ] 5>*CJ\CJ 6>*CJ]>*CJ5\ 5>*CJ\J̜tt$ &P#$/If{$$Ifl40 #t   6P 0#4 la̜͜ Dtttt$ &P#$/If{$$Ifl40 #t   6P 0#4 la)?],N?NNN$ &P#$/If$ &P#$/If$$Ifl4\ ##t { v 6P 0#4 la <]PNE<$xxa$$xxa$ $hxx`ha$$$Ifl4\ ##d +{ v 6P 0#4 la<E[%t2aآVأb  $8dh^8a$ $ & F?dha$xx$a$$ & Fa$ !0?̥NOPR^ck$ &P#$/If$$ &P#$/Ifa$xx$ &P#$/Ifxx$dha$$hdh^`ha$ $ & F?dha$ $ & F?dha$kyͦL$$IfTl4\ #t  6P 0#4 la$ &P#$/IfͦΦ rr$ &P#$/If}$$IfTl40 #t   6P 0#4 la (7L^Drrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la^_jƧէ[,L=LLL$ &P#$/If$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 la89c[NLJA8$xxa$$xxa$ $hxx`ha$$$IfTl4\ ##d +{ v 6P 0#4 la89c789;GTabqr-./:OPR~,<=>?KXeı﫥CJ( 5CJ(\ 5CJz\\ 6>*CJ] 5>*CJ\CJ 6>*CJ]>*CJ 5>*CJ\56;CJ\] 5;CJ\ 5;\CJ5\ 5CJ\;CJCJ@ݨ7fgĭXVe{۱230`<^ 0<^`0xx$^a$$ & Fa$`%E̵.bֶ)fj5]/0Ⱥں $ & F@<a$<^<<` & FA< 0<^`0ں"57?v$w $ & FB<`a$$<a$0`0$0<^`0a$ $<^a$789;GLTbq$ &#$/If$$ &#$/Ifa$xx$ &#$/Ifxx$xxa$ $h<^ha$ qr[LL$ &#$/If$$IfTl4\ #t  6 0#4 larr$ &#$/If}$$IfTl40 #t   6 0#4 la.Drrrr$ &#$/If}$$IfTl40 #t   6 0#4 la./:P[0L=LLL$ &#$/If$ &#$/If$$IfTl4\ ##t { v 6 0#4 laI[NLC6 $hxx`ha$$xxa$ $hxx`ha$$$IfTl4\ ##d +{ v 6 0#4 laIRt~78=|a,-.$a$ $ & FCxa$ & FCxxx$^a$$ & Fa$./=?KPXfv$ &#$/If$$ &#$/Ifa$xx$ &#$/If$a$$a$efvw(+,=>?2Dyv>Pac45OZ^ʿ5CJ 5CJH*\ 5CJ\CJCJ 5CJ\ 5>*\>*;CJ\ 6>*CJ]5\ 5>*CJ\>*CJKvw[LL$ &#$/If$$IfTl4\ #t  6 0#4 la0rr$ &#$/If}$$IfTl40 #t   6 0#4 la,>Hrrrr$ &#$/If}$$IfTl40 #t   6 0#4 la>?[LL$ &#$/If$$IfTl4\ ##t { v 6 0#4 latrtia[[[[xx$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# v 6 0#4 la Dv@-$ &P#$/Ifxx$ &P#$/If$xxa$  & FDxx` hxx^hxxN$$Ifl4\ #t  6P 0#4 la$ &P#$/If44tt$ &P#$/If{$$Ifl40 #t   6P 0#4 la45O_tHtttt$ &P#$/If{$$Ifl40 #t   6P 0#4 la^_pst   =\HXKWXsal ^zp,PQjɿ乵5CJ 5CJ\5CJOJQJ\ CJOJQJCJ 5CJ\ 5>*\>*;CJCJ\5\>*CJ 6>*CJ] 5>*CJ\G ]NN$ &P#$/If$$Ifl4\ ##t { v 6P 0#4 la  =JHKLXvtvkcaa\\$a$$ & Fa$  & Fxx $hxx`ha${$$Ifl40# v 6P 0#4 la a=^pxx$ &P#$/If  & FExxxx$a$,PL$$IfTl4\ #t  6P 0#4 la$ &P#$/IfPQj0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laDrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 lads[LL$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 lacorst)^e89:<HUbcst'*+<=>Ƕ5CJ 5CJH*\ 5CJ\CJ5CJOJQJ\CJ 5CJ\ 5>*\>*;CJ\>*CJ 6>*CJ] 5>*CJ\5\HsttrtaQHF$xxa$$ & F ^a$ & F xx^ $hxx`ha$}$$IfTl40# v 6P 0#4 la^_e9:<Hxx$ &P#$/If  & FFxxxxHMUcst<$$Ifl4\ f#t ^ 6P 0#4 la$ &P#$/If$$ &P#$/Ifa$t4{$$Ifl40 #t   6P 0#4 la$ &P#$/If+=Htttt$ &P#$/If{$$Ifl40 #t   6P 0#4 la=>]NN$ &P#$/If$$Ifl4\ ##t { v 6P 0#4 la   vtvcSQL$a$$ & F ^a$ & F xx^ $hxx`ha${$$Ifl40# v 6P 0#4 la   2 \     e q {  b n x   @COWdeuv ,/0BCD  +,B*CJOJQJ^Jph!0JB*CJOJQJ^JaJph 5>*\>*;CJ\ 6>*CJ]>*CJ 5>*CJ\5\CJ 5CJ\CJ 5CJ\> \    e q { b n x   ACOWeu$ &P#$/Ifxx$ &P#$/If & FG^$a$uv]NN$ &P#$/If$$Ifl4\ #t  6P 0#4 la0tt$ &P#$/If{$$Ifl40 #t   6P 0#4 la 0CLtttt$ &P#$/If{$$Ifl40 #t   6P 0#4 laCD]NN$ &P#$/If$$Ifl4\ ##t { v 6P 0#4 la  vtvcSQQ$ & F ^a$ & F xx^ $hxx`ha${$$Ifl40# v 6P 0#4 la,57KL>?]^_xy*wy=>-/n~γΐγ!0JB*CJOJQJ^JaJph#5B*CJOJQJ\^JaJph5B*CJ\^JaJphB*CJOJQJ^JphB*CJOJQJ^JaJph5B*CJOJQJ\^Jph#5B*CJOJQJ\^JaJph8n~eR$ a$$a$[$\$ $[$\$a$es6&Pf QRTU\]6 9 E N [ \ l m       !!!!/!2!ʿ}}}}v}v} 6>*CJ]>*CJ 5>*CJ\CJ 5>*CJ\5\ 5CJ\B*CJ^Jph5B*CJ\^Jph0J5B*CJ\^Jph0JB*CJ^Jph0JB*^Jph0JB*CJ^Jph#5B*CJOJQJ\^JaJphB*CJOJQJ^JaJph.TU\] Q7 9 E N \ l $ &P#$/Ifxx$ &P#$/If$ & FH ^`a$^$  4la$ $ a$l m   ]NN$ &P#$/If$$Ifl4\ f#t ^ 6P 0#4 la    4tt$ &P#$/If{$$Ifl40 #t   6P 0#4 la  !!3!F!Ltttt$ &P#$/If{$$Ifl40 #t   6P 0#4 la2!3!E!F!G!!!!!!! " ","$,$%+%**....-/D///S1x1W2a2q233556"7#7"8#8$80888E8F8U8V8i8888888888 999 9!9"9-9B9C9999 6>*CJ] 5>*CJ\ 5CJ\5CJ 5CJ\CJ 5CJ\ 5>*\>*CJ;CJ\>*CJ5\ 6>*CJ] 5>*CJ\FF!G!!!]NN$ &P#$/If$$Ifl4\ ##t { v 6P 0#4 la!!! ""$% %+%vtvcSNN$a$$ & F ^a$ & F xx^ $hxx`ha${$$Ifl40# v 6P 0#4 la+%B'+)***...-//S1W2a2355A66#77"8$808xx$ &P#$/If  & FIxxxx0888F8U8V8i88L$$IfTl4\ #t  6P 0#4 la$ &P#$/If8888rr$ &P#$/If}$$IfTl40 #t   6P 0#4 la88889!9Drrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la!9"9-9C9999[,L=LLL$ &P#$/If$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 la999999999:I;;[<]<;>N>k?p?s??@@@A@C@O@W@d@e@t@u@@@@@@@AA A!A2A5A6AGAHAIATAiAjAAAAAAAAAAB?ByCzCEEFFFF>*CJ 6>*CJ] 5>*CJ\CJ 5>*CJ\CJ5\56CJ\] 5;CJ\;CJ 5CJ\CJ5\ 6>*CJ]>*CJB9999:A:[NI@7$xxa$$xxa$$a$ $hxx`ha$$$IfTl4\ ##d +{ v 6P 0#4 laA:::I;J;;;;<;<]<^======;><>>>>k? $^`a$$^a$$ & FK^`a$$ & FJa$$a$xx$ & Fa$k?l?@@A@C@O@W@e@t@ $ &P#$/Ifxx$ &P#$/Ift@u@@@_RR $ &P#$/If$$Ifl4\ #t  6P 0#4 la@@@@xx $ &P#$/Ify$$Ifl40 #t   6P 0#4 la@@A!A6AHADxxxx $ &P#$/Ify$$Ifl40 #t   6P 0#4 laHAIATAjAAAA_,RERRR $ &P#$/If $ &P#$/If$$Ifl4\ ##t { v 6P 0#4 laAAAB?BqB_RMD;$xxa$$xxa$$a$ $hxx`ha$$$Ifl4\ ##d +{ v 6P 0#4 laqBBByCzCCDRD|DDDDDDEAEEEEE0F8FFFVFjF & FN8^8 & FM & FL ^`xx$ & Fa$jFFFFFFFFFFG GG(G$) &P#$/Ifxx$) &P#$/If$a$[$\$ $hxx`ha$xx & FL  & FN FFFFG GGG(G)GLMLNLaLmLnLLLLLLLLLLL M M MM-M.MsMtMMMMMCJCJ 5CJ\CJ\ 6>*CJ] 5>*CJ\ 5CJ\ 6>*CJ] 5>*CJ\5\>*CJOJPJQJ^JJ(G)GI[VMD<<$ & Fa$$xxa$$xxa$$a$$$IfTl4\ ##d +{ v 6P) 0#4 la>IIIJ?J^J|JJJ K8KwKKKKKKL LL#Lxx$ &P#$/If $hxx`ha$ m & FOx^`xx#L(L0L>LMLNLaL:$$IfTl4\ -#{  6P 0#4 la$ &P#$/If$$ &P#$/Ifa$aLmLnLLLr4}$$IfTl40 -#{  6P 0#4 la$ &P#$/IfLLLLL MHrrrr$ &P#$/If}$$IfTl40 -#{  6P 0#4 la M MM.MtMMM[,L=LLL$ &P#$/If$ &P#$/If$$IfTl4\ /-#{   | 6P 0#4 laMMMMMOPQQQQQ#Q+Q8Q9QHQIQ\QrQsQQQQQQQQQQQRRRRRRRRRRRTTUUUUUUzVVXXXY Z[[[?][]^^^^^`a?b@bHbbbbſCJ\ 5CJ\ 5>*\>*>*CJ 5>*CJ\CJ( 5CJ(\ 5CJ~\CJ 5CJ\CJ5\\ 6>*CJ]JMMMMMNXN[VVMD<$ & Fa$$xxa$$xxa$$a$$$IfTl4\ /-#k 0 | 6P 0#4 laXNyNzNOO/O&PPPPPPPPPPPPPPQQQQQQ$a$$da$xx$^a$$ & Fa$QQQQQQ#Q+Q9QHQ$ &#$/Ifxx$ &#$/If$a$ HQIQ\QrQ[LL$ &#$/If$$IfTl4\ #t  6 0#4 larQsQQQ4rr$ &#$/If}$$IfTl40 #t   6 0#4 laQQQQQRHrrrr$ &#$/If}$$IfTl40 #t   6 0#4 laRRRR[LL$ &#$/If$$IfTl4\ ##t { v 6 0#4 laRRRRRTUUUtot^NII$a$$ & F h^ha$ & F hxx^h$a$ $hxx`ha$}$$IfTl40# 6 0#4 laUzVXXXY[[[?]^^^`?b@bHbbbbbb$ &#$/Ifxx$ &#$/If$ & FPa$ 5$7$8$9DH$$a$$a$bbbbbc!c"c;cncoccccccccccc7dCdFdGdHdTdUd~dddffgi i]jfjgj7kAkkknnnnnnnnnnnnoKoLofoqouovooooooop p#p$p%p1p2p˼CJOJPJQJ^JmH sH OJPJQJ^JmH sH 5CJ\>*;CJCJ\ 6>*CJ]5\>*CJ 5>*CJ\Jbbbbc!cL$$IfTl4\ f#t ^ 6 0#4 la$ &#$/If!c"c;cnc4rr$ &#$/If}$$IfTl40 #t   6 0#4 lancocccccLrrrr$ &#$/If}$$IfTl40 #t   6 0#4 lacc8dGd[LL$ &#$/If$$IfTl4\ ##t { v 6 0#4 laGdHdTd~ddfggVhhtrgbZVTTx$ & Fa$ & F $hx`ha$ $hxx`ha$}$$IfTl40# 6 0#4 la hi ii]jgjjj k7kAkkkl^ll mXmmm+nbnnnnxx$ &P#$/If[$\$ & FQ 8xnnnnnnnL$$IfTl4\ #t  6P 0#4 la$ &P#$/IfnnoKo4rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laKoLofovoooLrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 laoop$p[LL$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 la$p%p1pWpdpcrfsgsqstri\LJH$ & F h^ha$  & F h^h$h`ha$ $hxx`ha$}$$IfTl40# 6P 0#4 la2pWpdpvpcrsrfsgsqssstttttuu%u&u)u,u?uCuuuovrv|vvvExFxPxRySyYyyyyyzzzzzz{ {{{{2{D{E{^{{{{{{{{{{{{{Y|e|h|i|j|\ 6>*CJ]5\5CJCJ\ 5<CJ\ 5CJH*\ aJmH sH CJH*CJ 5CJ\ 5>*CJ\>*CJ>*;CJHqstttqvrv|vExFxPxRySyYyy,zzzzzz{{{$ &P#$/Ifxx$ &P#$/If & FR 5$7$8$9DH$$a${{2{D{]NN$ &P#$/If$$Ifl4\ #t  6P 0#4 laD{E{^{{4tt$ &P#$/If{$$Ifl40 #t   6P 0#4 la{{{{{{Htttt$ &P#$/If{$$Ifl40 #t   6P 0#4 la{{Z|i|]NN$ &P#$/If$$Ifl4\ ##t { v 6P 0#4 lai|j|v|||~vtvkcaaaaa$ & Fa$  & Fxx $hxx`ha${$$Ifl40# 6P 0#4 la j|v|||~~ .c}ۇW‰ȉËċƋҋދ+,EwxɌʌˌ@LOPQnz}jv%{#01\ 6>*CJ]5\ 5>*CJ\5CJCJ\ 5CJ\CJCJ 5CJ\ 5>*\>*;CJ>*CJLZ  cۇ܇݇W‰ȉފ&mËċƋҋދxx$ &P#$/If $hxx`ha$ & FSxxދ+R$$Ifl4\ #t  6P 0#4 la $ &P#$/If+,Ew0xx $ &P#$/Ify$$Ifl40 #t   6P 0#4 lawxʌLxxxx $ &P#$/Ify$$Ifl40 #t   6P 0#4 laʌˌAP_RR $ &P#$/If$$Ifl4\ ##t { v 6P 0#4 laPQn{z}jvveUSSSS$ & F ^a$ & F xx^ $hxx`ha$y$$Ifl40# 6P 0#4 la %{|“BJ͕#1A$ &P#$/Ifxx$ &P#$/If $hxx`ha$$ & FTa$$a$1ABUЖі "#$2;DEQˢآY`,.klͦ٦456Oz{5CJ 5CJH*\ 5CJ\CJCJ 5CJ\ 5>*\>*;CJ\ 6>*CJ]>*CJ5\ 5>*CJ\KABU[ LL$ &P#$/If$$IfTl4\ f#t ^ 6P 0#4 laЖ0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laЖі#Lrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la#$[LL$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 laraQOOOO$ & F ^a$ & F xx^ $hxx`ha$}$$IfTl40# 6P 0#4 la EQȡˢ̢آƤYZ`lO`O & FU 85<^5`<ͦ٦1$$Ifl4\ &#t n 6P 0#4 la $ &P#$/If$$ &P#$/Ifa$xx$ &P#$/If56Ozxy$$Ifl40 #t   6P 0#4 la $ &P#$/Ifz{˧Dxxxx $ &P#$/Ify$$Ifl40 #t   6P 0#4 laʧ˧̧),>@ABM|}˫HVЮѮҮӮծ%CD]ïǯȯٯگۯ78CF[\abd5CJ 6CJ] 56\] 5CJ\CJ\>*CJ 6>*CJ] 5>*CJ\5\ 5>*CJ\ 6>*CJ]K˧̧-A_RRRR $ &P#$/If$$Ifl4\ ##t { v 6P 0#4 laABM*_RMD?7$ & Fa$$a$$xxa$$a$ $hxx`ha$$$Ifl4\ ##d +{ v 6P 0#4 la*K.u9]a}˫իH\Ȭ٬ & FX 85<^5 & FV 85<^5$xxa$xx$ & Fa$&<VWĭѭ0aѮҮӮծxx$ &P#$/If $hxx`ha$xx & FW 85<^5 & FX 85<^5%CL$$IfTl4\ #t  6P 0#4 la$ &P#$/IfCD]rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laȯگHrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 laگۯ8G[[LLLL$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 la[\)J[VMD<<$ & Fa$$xxa$$xxa$$a$$$IfTl4\ ##d +{ v 6P 0#4 laJK(7Unϲ#Eabdo $hxx`ha$ & FY<^` & F p;<^;`xx$^a$dovϳ%&@KNO`cdvwxӴԴߴIO=Ce¹ʹ׹ع+69:KNO`abwxúպý 56]5CJ6] 6CJ] 5CJ\CJ 5CJ\\ 6>*CJ] 5>*CJ\ 6>*CJ]5\ 5>*CJ\;CJCJ>*CJEϳ9$$IfTl4\ #t  6P 0#4 la$ &P#$/Ifxx$ &P#$/Ifϳ%r}$$IfTl40 #t   6P 0#4 la$ &P#$/If%&@OdwHrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 lawxԴ[LL:$$ &P#$/Ifa$$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 la@FOne\TTNI$a$xx$ & Fa$$xxa$$xxa$$$IfTl4F ##d + 6P 0#    4 laO (Hk}Ƿ+/HYl$ & F[  @ `a$$  @ ^a$$ & F@a$ $ & F@ a$ $ & F@`a$ $ & F@ 8a$ & FZ 8и&=¹ʹع $ &P#$/Ifxx$ &P#$/If$a$$ & F\a$$a$ $ & F@ a$$ & F[  `a$_RR $ &P#$/If$$Ifl4\ f#t ^ 6P 0#4 la+:OaDxxxx $ &P#$/Ify$$Ifl40 #t   6P 0#4 laabxĺغ_REEE $ &P#$/If $ &P#$/If$$Ifl4\ ##t { v 6P 0#4 laպ׺غٺ!)67HI\|}Ƚɽؾm|45?Ҿ>*CJCJ 5CJ\ 5>*\>*;CJ5\ 5>*CJ\5CJ(5CJx5CJ 5CJ\CJ\ 6>*CJ]>*CJIغٺںx_VVII@>$xxa$ dhxx`$xxa$$$Ifl4\ ##d +{ v 6P 0#4 la!)7H$ &P#$/Ifxx$ &P#$/IfHI\|[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 la|}Ƚ0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laȽɽHrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 laؾtrtia[[ $ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 lan/[%56`  4l & F]  4l$  4la$67?=$ &P#$/Ifxx$ &P#$/If$ & F^a$$  4la$ +:[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 la+:;TO[^_`m~8El8st˽賽˧jpU\j5U\0J\jU\ jU\ 5CJH*\ 5CJ\CJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ]>*CJ 5>*CJ\5\>:;T4rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laHrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 laP_[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 la_`m~trtiaXSS$a$$xxa$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la 89Em>_As  & F_5^5xxh^h & F`PS_gtu3>BCTWXijk;<[GWUuu 5129dgs{ýںCJH*>*CJCJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ]5\>*CJ 5>*CJ\5CJ 5CJ\j5U\0J\FOPQS_gu$ &P#$/Ifxx$ &P#$/Ife^e  & F_5^5[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 la0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 la3CXjHrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 lajk[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 la<IGJKUutrtia\\W$a$$a$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la u 129:egsxx$ &P#$/If & Fa$xa$$a$  ps{L$$IfTl4\ #t  6P 0#4 la$ &P#$/If4rr$ &P#$/If}$$IfTl40 #t   6P 0#4 la.9=>ORSdef:&6)*5AuOP[t|jkv:B ! &fhik5CJCJH* 5>*CJ\ 5CJ\CJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ]>*CJ 5>*CJ\5\J.>SeHrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 laef[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 la(&)*5trtia_]O$ L]La$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la Cu*OP[tjkv:   $ L]La$$ L]La$^ $ L]La$ $ L]La$ &ry@$ &P#$/Ifxx$ &P#$/If $ & FbL]La$ $ L]La$]NN$ &P#$/If$$Ifl4\ #t  6P 0#4 la78R]absvw 4@_ScVan+6 D6hi1=@A5CJ 5CJ\CJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ] 5>*CJ\5\>*CJN74tt$ &P#$/If{$$Ifl40 #t   6P 0#4 la78RbwLtttt$ &P#$/If{$$Ifl40 #t   6P 0#4 la]K9$$ &P#$/Ifa$$$ &P#$/Ifa$$$Ifl4\ ##t { v 6P 0#4 la@MSVWavtvcSQQ $ & F ^a$ & F xx^ $hxx`ha${$$Ifl40# 6P 0#4 laa+h $ p0]0a$$ p^a$x $ pxa$ $ pa$ $ pa$ p  x^$ a$Ma6}$ &P#$/Ifxx$ &P#$/If$ & Fc @ 0]0^a$[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 la6h0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 lahiLrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la2A[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 laABOlyz } ~   trtia__Z$a$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la ABOklz  ~   , c      = > T U z       !DFcd|)Gnpq{17T&F:f !&46CJH* 5>*CJ\5\ 5CJ\ 5>*CJ\CJ 5CJ\ 5>*\>*CJ;CJ>*CJ\N c  U     d)pq{7&;$^a$$a$$a$ !*FO$ &P#$/Ifxx$ &P#$/If $hxx`ha$ & Fd2KLe<=HK]_`a- 2LMfξξ 6\] 5>*\ 5CJ\\ 6>*CJ] 5>*CJ\ 6>*CJ]5\ 5>*CJ\CJ;CJ>*CJ5CJK2K[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 laKLerr$ &P#$/If}$$IfTl40 #t   6P 0#4 laDrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la=L`[LLLL$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 la`a([RID<6xx$ & Fa$ & F$xxa$$xxa$$$IfTl4\ ##d +{ v 6P 0#4 la-.Pl }~xx & Ffdh & Ff h^h` & Fe29$$IfTl4\ #t  6P 0#4 la$ &P#$/Ifxx$ &P#$/If2LMfr}$$IfTl40 #t   6P 0#4 la$ &P#$/If@rrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la>Ma[LLLL$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 la=>IL^`abo  Y!p!!!("?"A"M"U"b"c"r"s"""""""##)#4#7#8#I#M#N#_#`#a#v#w########.$:$d$%))$)&)')()))6)B)J)W)X)g)h){)5CJH*;CJ 5>*CJ\5CJ5\ 5CJ\CJ;\>*CJ 6>*CJ] 6>*CJ] 5>*CJ\Kabo[NLJA8$xxa$$xxa$ $hxx`ha$$$IfTl4\ ##d +{ v 6P 0#4 la9 Z   Y!q!!!!!!"("?"A"M"U"c"r" $) &P#$/Ifxx$) &P#$/If $ & Fgxxa$$xxa$ $ & Fgxxa$xx$ & Fa$r"s""""_PRLR$If $) &P#$/If$$Ifl4\ f#t ^ 6P) 0#4 la"""# xx $) &P#$/Ify$$Ifl4h0 #t   6P) 0#4 la##)#8#N#`#Hxxxx $) &P#$/Ify$$Ifl40 #t   6P) 0#4 la`#a#w####_RRRR $) &P#$/If$$Ifl4\ ##t { v 6P) 0#4 la###:$d$$$_ZXOFA & F$xxa$$xxa$$a$$$Ifl4\ ##d +{ v 6P) 0#4 la$%%%>&&&&^'''(2((((((()$)&)')()6)$h`ha$ & Fh & Fhxx$ & Fa$6)B)J)X)g)h){))A$$Ifl4\ #t  6P0#4 la $&P#$/Ifxx$&P#$/If{))))))))* * *** *2*3*4*I*J*********** +E,]-../////////////// 0 000K0L0T0e0f0j0k0l0y000l122222222ɼ5CJ(5CJfCJ;6]5CJ 5CJ\CJ\ 6>*CJ] 5>*CJ\ 6>*CJ] 5>*CJ\5\>*CJ>*\H))))xx $&P#$/Ify$$Ifl40 #t   6P0#4 la))) * *3*Hxxxx $&P#$/Ify$$Ifl40 #t   6P0#4 la3*4*J****_RRRR $&P#$/If$$Ifl4\ ##t { v 6P0#4 la*** +=+++_ZQHC;$ & Fa$ & F$xxa$$xxa$$a$$$Ifl4\ ##d +{ v 6P0#4 la++E,,,,,,,,]-q----..).4.z..../?/ & F hh^h`h & Fi & Fi^xx$^a$?/i////////$ &P#$/Ifxx$ &P#$/If & F////[pLL$ &P#$/If$$IfTl4\ #t  6P 0#4 la//// 0r`r$$ &P#$/Ifa$$ &P#$/If}$$IfTl40 #t   6P 0#4 la 000L0T0\0a0f0k0nx___LLLL & Fj$ &P#$/If$ &P#$/If$$IfTl4F #t v 6P 0#    4 lak0l0y0000l11na_]XRIdh`^dh $hxx`ha$$$IfTl4F ##d + 6P 0#    4 la122222222222222222222222222$a$xx & Fk^hdh`h22222222$ &#$/Ifxx$ &#$/If$a$2222223!3"3;3n3o3333333333364B4E4F4G4U4q4{44667777&9H9:#;<<<<_>>S?s???b@c@@@@@~AAACChEiEsE~EFFGGHHH(H)H5CJ 5CJ\CJOJQJ^JCJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ]5\ 5>*CJ\>*CJJ223!3[LL$ &#$/If$$IfTl4\ #t  6 0#4 la!3"3;3n34rr$ &#$/If}$$IfTl40 #t   6 0#4 lan3o33333Hrrrr$ &#$/If}$$IfTl40 #t   6 0#4 la3374F4[I7$$ &#$/Ifa$$$ &#$/Ifa$$$IfTl4\ ##t { v 6 0#4 laF4G4U4{446777&9trtia__V$h^ha$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6 0#4 la &9:<<<_>?@~AAAChEiEsEFGGGHHH$ &P#$/Ifxx$ &P#$/If $hxx`ha$$a$$h^ha$H)H:H;HNHgHL$$IfTl4\ #t  6P 0#4 la$ &P#$/If)H:H;HNHgHhHHHHHHHHHHHIII|IIIIIIIIKKLLLLMMMNNNNOO!P"P/PDPPQRRRRRRR S SS0S1SJS}S~SSSSSSSSSSSETQTTTUTVTdT 5CJ\5CJCJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ]>*CJ5\ 5>*CJ\NgHhHHH0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laHHHHHILrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 laII}II[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 laIIIIKLLLMMria\WUU$a$$a$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la MMNNNO"P#P/PPPQ>QQRDRRRRRRRR S$ &P#$/Ifxx$ &P#$/If & Fl$a$ S SS0S[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 la0S1SJS}S4rr$ &P#$/If}$$IfTl40 #t   6P 0#4 la}S~SSSSSHrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 laSSFTUT[L:$$ &P#$/Ifa$$ &P#$/If$$IfTl4\ ##t { v 6P 0#4 laUTVTdTTTVWWWXTYtrtia_]XX$a$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40## 6P 0#4 la dT~TTTVVWWWWTYaYYtZu[[[^'^L^_`bbbbbbbbb c c%cWcXcrc}ccccccccc d,d/d0d1d?dRd]d|dhfxfkglgugvgg/i:iIiiiijujjjjkrkwklll;\ 6>*CJ]>*CJ 5>*CJ\5\ 5CJ\5CJCJ 5CJ\ 5>*\>*CJ;CJMTYUYaYtZu[v[[~\^^^^^'^^__`[```(aaaaaabPbb & Fm$a$bbbbbbb $ &P#$/Ifxx$ &P#$/Ifh^hbbb c_RR $ &P#$/If$$Ifl4\ #t  6P 0#4 la c c%cWc0xx $ &P#$/Ify$$Ifl40 #t   6P 0#4 laWcXcrccccLxxxx $ &P#$/Ify$$Ifl40 #t   6P 0#4 lacc!d0d_O?$$ &P#$/Ifa$$$ &P#$/Ifa$$$Ifl4\ ##t { v 6P 0#4 la0d1d?d]djdhfkglgvg/i0ixvxmec^\Z$a$$ & Fa$  & Fxx $hxx`ha$y$$Ifl40# 6P 0#4 la 0i:iijijjjjqklllllllllllNmmm:n;n*CJ] 5>*CJ\ 6>*CJ]5\;CJ5CJCJH*CJCJ 5CJ\ 5>*CJ\>*CJJ=n>n?n@nAnBnCnDnEnFnGnHnInJnKnLnMnNnOnPnQnRnSnTnUnVnWnXnYnZnZn[n\n]n^n_n`nanbncndnenrn~nnnn $&P#$/Ifxx$&P#$/Ifnnnn_RR $&P#$/If$$Ifl4\ #t  6P0#4 lannnoxx $&P#$/Ify$$Ifl40 #t   6P0#4 laoo)o8oMo_oDxxxx $&P#$/Ify$$Ifl40 #t   6P0#4 la_o`ovoooo_RRRR $&P#$/If$$Ifl4\ ##t { v 6P0#4 laoop,p`ppp_ZQH@@$ & Fa$$xxa$$xxa$$a$$$Ifl4\ ##d +{ v 6P0#4 lapphqq"r#rqrrrrrrss_ssss-tzttttu$ & Fa$$^a$$8^8a$$ & Fa$$h^ha$$ & Fa$xx$a$u*u5u6uzu{uuvvCwPwcwdwwKxxxxxxKy  & F^$ & Fa$$8^8a$$ & Fa$ & F$^a$$a$$h^ha$$ & Fa$$ & Fa$Kycyyy%zzzzzzzzzzzzzzzz{{{{xx$) &P#$/If$xxa$^ & F{{%{4{5{H{k{R$$Ifl4\ #t  6P) 0#4 la $) &P#$/Ifk{l{{{xx $) &P#$/Ify$$Ifl40 #t   6P) 0#4 la{{{{{|Dxxxx $) &P#$/Ify$$Ifl40 #t   6P) 0#4 la{{{{{{{{|||||^|_|j|m||||||||||$~Z~\~~"#6RSlҀՀրDEPSeghirvwĄ̄لڄ5CJCJ5 5CJ\CJ;CJ\ 6>*CJ] 5>*CJ\5\>*CJ 6>*CJ] 5>*CJ\M|||_|n||_RRRR $) &P#$/If$$Ifl4\ ##t { v 6P) 0#4 la||||||}_]XVMD$xxa$$xxa$$a$$$Ifl4\ ##d +{ v 6P) 0#4 la}c}}}$~%~[~\~~*r $dhxxa$ & Fdh $ & Fdha$$@ ^@ a$$p^pa$$a$xx$a$$ & Fa$" $) &P#$/Ifxx$) &P#$/If "#6R_RR $) &P#$/If$$Ifl4\ #t  6P) 0#4 laRSlxx $) &P#$/Ify$$Ifl40 #t   6P) 0#4 laրDxxxx $) &P#$/Ify$$Ifl40 #t   6P) 0#4 laETh_RRRR $) &P#$/If$$Ifl4\ ##t { v 6P) 0#4 lahivw_][VMD$xxa$$xxa$$a$$$Ifl4\ ##d +{ v 6P) 0#4 la<]^ɃӃ($ & F^`a$$xxa$xx$ & F `a$Ą̄ڄ $% &P#$/Ifxx$% &P#$/If ڄ U`dvyz{̅fĆنچ)*+@A؇2>FSTefyيڊCJCJ` 5CJ\ 5>*CJ\ 6CJ]CJ;CJ\ 6>*CJ] 6>*CJ]>*CJ5\ 5>*CJ\L_|RR $% &P#$/If$$Ifl4\ #t  6P% 0#4 la Uezxxxx $% &P#$/Ify$$Ifl40 #t   6P% 0#4 laz{̅e_]XXVMHH$a$$xxa$$a$$$Ifl4\ ##d +{ v 6P% 0#4 laefghijklmnopqrstuvwxyz{|}~$xxa$ĆنA$$Ifl4\ f#t ^ 6P 0#4 la $ &P#$/Ifxx$ &P#$/Ifنچ*Dxxxx $ &P#$/Ify$$Ifl40 #t   6P 0#4 la*+A_RRRR $ &P#$/If$$Ifl4\ ##t { v 6P 0#4 la؇v_]XOBB dhxx`$xxa$$a$$$Ifl4\ ##d +{ v 6P 0#4 la$xxa$$xxa$ !"#$%&'()*+,-./012>F$) &P#$/Ifxx$) &P#$/IfFTefyL$$IfTl4\ #t  6P) 0#4 la$) &P#$/Ifي4rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laيڊ+Hrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la*+,Ӌ݋# /+=MU'FG`ϖҖӖ[gijky 01CJH* 5CJ\5CJCJ 5CJ\ 5>*\>*CJ;CJ\>*CJ5\ 5>*CJ\ 6>*CJ]L+,[PE $$Ifa$ $$Ifa$$$IfTl4\ ##t { v 6P) 0#4 la݋trtia_]X$a$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P) 0#4 la  +MUzÔMޕߕ$) &P#$/Ifxx$) &P#$/If$ & Fa$$a$'F[LL$) &P#$/If$$IfTl4\ f#t ^ 6P) 0#4 laFG`4rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laӖHrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la\j[PE $$Ifa$ $$Ifa$$$IfTl4\ ##t { v 6P) 0#4 lajkytrtia____$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P) 0#4 la  xx$) &P#$/If$a$ 01DPR$$Ifl4\ f#t ^ 6P) 0#4 la $) &P#$/If1DPQj›śƛכڛۛdpstuǠVbjvQ]ݤޤŦӦ  !23Fhiϧڧާߧ| 5CJ\5CJCJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ]5\>*CJ 5>*CJ\NPQj0xx $) &P#$/Ify$$Ifl40 #t   6P) 0#4 laƛۛHxxxx $) &P#$/Ify$$Ifl40 #t   6P) 0#4 laet_VM $$Ifa$ $$Ifa$$$Ifl4\ ##t { v 6P) 0#4 latuǠxvxmec][[h`h$ & Fa$  & Fxx $hxx`ha$y$$Ifl40# 6P) 0#4 la Ǡ9Vbjv/Q]$ݤޤߤI# & F & F & F & F & F 8¦æĦŦӦ !2 $) &P#$/Ifxx$) &P#$/If $hxx`ha$23Fh_RR $) &P#$/If$$Ifl4\ f#t ^ 6P) 0#4 lahi0xx $) &P#$/Ify$$Ifl40 #t   6P) 0#4 laϧߧHxxxx $) &P#$/Ify$$Ifl40 #t   6P) 0#4 la}_VM $$Ifa$ $$Ifa$$$Ifl4\ ##t { v 6P) 0#4 laxoge[VQQ$a$$a$ 5$7$8$9DH$$ & Fa$  & Fxx $hxx`ha$y$$Ifl40# 6P) 0#4 la ǭ$]o * ʲ߲+,FQUVgjk|}~'1P<L?@ErsϷCJ 5CJ\ 5>*\>*CJ;CJ 6>*CJ]5\>*CJ 5>*CJ\\ CJH*\ aJmH sH 5CJCJ\CJ\5CJF]  Űܱ/$) &P#$/Ifxx$) &P#$/If$ & Fa$$a$$a$ʲ߲[LL$) &P#$/If$$IfTl4\ #t  6P) 0#4 la߲+0rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la+,FVk}Hrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la}~[PE $$Ifa$ $$Ifa$$$IfTl4\ ##t { v 6P) 0#4 la1><?@ABCtrtia____$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P) 0#4 la CDEstuvwxyz{|}~xx$) &P#$/If$a$ϷR$$Ifl4\ #t  6P) 0#4 la $) &P#$/IfϷ23MX\]nqr   0:YIYLX)N*Ͽl[\h !"34G\]vп޿ӿӹ 5CJ>\ 5>*CJ\ 5CJ\5CJCJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ] 5>*CJ\5\>*CJI20xx $) &P#$/Ify$$Ifl40 #t   6P) 0#4 la23M]rHxxxx $) &P#$/Ify$$Ifl40 #t   6P) 0#4 la _VM $$Ifa$ $$Ifa$$$Ifl4\ ##t { v 6P) 0#4 la  :GILX)xvxmecZU$a$$h^ha$$ & Fa$  & Fxx $hxx`ha$y$$Ifl40# 6P) 0#4 la l[\hW$<^<a$$ & F ^a$^$<^<a$ $0^`0a$$<^<a$$<^<a$ "3$) &P#$/Ifxx$) &P#$/If34G\[LL$) &P#$/If$$IfTl4\ #t  6P) 0#4 la\]v4rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laHrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 laq}3J9CXe!J7hp&':EF_[gjklz 5>*CJ\CJ 5CJ\ 5>*\>*CJ;CJ\5\ 6>*CJ] 5>*CJ\>*CJOr[PE $$Ifa$ $$Ifa$$$IfTl4\ ##t { v 6P) 0#4 latriid\VT^$ & Fa$ & F$h`ha$ $hxx`ha$}$$IfTl40# 6P) 0#4 la 39Cue!7hip& $ &P#$/Ifxx$ &P#$/Ifxx&':E]|PP $ &P#$/If$$Ifl4\ #t  6P 0#4 laEF_4vv $ &P#$/If{$$Ifl40 #t   6P 0#4 laLvvvv $ &P#$/If{$$Ifl40 #t   6P 0#4 la\k]M=$$ &P#$/Ifa$$$ &P#$/Ifa$$$Ifl4\ ##t { v 6P 0#4 laklzzxkbZXR^$ & Fa$  & Fxx $hxx`ha$$xxa${$$Ifl40# 6P 0#4 laS`q_`l5&'M "TUoz~),-.<akz} 5CJ 5CJ\ 5>*\>*;CJ\ 6>*CJ]>*CJ 5>*CJ\5\CJCJ 5CJ\N@ST`_`l'O6H$ & Fa$$$a$9$$IfTl4\ #t  6P 0#4 la$ &P#$/Ifxx$ &P#$/If "Tr0}$$IfTl40 #t   6P 0#4 la$ &P#$/IfTUoLrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la-[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 la-.<kxz}trtaQOJ$a$$ & F ^a$ & F xx^ $hxx`ha$}$$IfTl40# 6P 0#4 la7>{dfrz$ &P#$/Ifxx$ &P#$/If$ & Fa$$dha$$a$$a$$a$7>frz0;?@QTUghi"A-=01=(5CD^imn5OJQJ\^J5CJ 5CJ\ 5>*\>*;CJ\ 6>*CJ]>*CJ 5>*CJ\5\CJ 5CJ\CJJ]NN$ &P#$/If$$Ifl4\ #t  6P 0#4 la4tt$ &P#$/If{$$Ifl40 #t   6P 0#4 la0@UhLtttt$ &P#$/If{$$Ifl40 #t   6P 0#4 lahi]K9$$ &P#$/Ifa$$$ &P#$/Ifa$$$Ifl4\ ##t { v 6P 0#4 la"/-01=Hvtvkca__Yxx$ & Fa$  & Fxx $hxx`ha${$$Ifl40# 6P 0#4 la ()5F $ &P#$/Ifxx$ &P#$/If & F_RR $ &P#$/If$$Ifl4\ #t  6P 0#4 laC0xx $ &P#$/Ify$$Ifl40 #t   6P 0#4 laCD^nLxxxx $ &P#$/Ify$$Ifl40 #t   6P 0#4 la +.?IhTdWXZ01KVZ[lop  +5TBRER|WYl  ,- 5CJ\ 5CJ\5CJCJ 5CJ\ 5>*\>*;CJCJ\>*CJ 6>*CJ]5\ 5>*CJ\L _O?$$ &P#$/Ifa$$$ &P#$/Ifa$$$Ifl4\ ##t { v 6P 0#4 la+IVTWXYZxvxmeccc^$a$$ & Fa$  & Fxx $hxx`ha$y$$Ifl40# 6P 0#4 la 7$$IfTl4\ #t  6P 0#4 la$ &P#$/Ifxx$ &P#$/If0r0}$$IfTl40 #t   6P 0#4 la$ &P#$/If01K[pLrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la [I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 la  5BBEFRtrtia_ZU$a$$a$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la Y  ->$) &P#$/Ifxx$) &P#$/If$a$$a$$a$->?R   ! " #               2  /d.    " ưOJPJQJ^JmH sH \aJmH sH OJPJQJ^JmH sH  5CJ\5CJCJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ]>*CJ5\ 5>*CJ\@>?R[LL$) &P#$/If$$IfTl4\ #t  6P) 0#4 la4rr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la " Hrrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la" #   [PE $$Ifa$ $$Ifa$$$IfTl4\ ##t { v 6P) 0#4 la          xvi`XVTO$a$$ & Fa$  & Fxx $hxx`ha$$h`ha$}$$IfTl40# 6P) 0#4 la d     y EW$ & Fa$[$\$$a$9$$IfTl4\ #t  6P 0#4 la$ &P#$/Ifxx$ &P#$/IfJKdr4}$$IfTl40 #t   6P 0#4 la$ &P#$/IfJKd_knop78D_ !!!!##=#`$a$m$7)8)?)_+`++++++L,M,,,,,,,,ൿিj~CJU0JCJj5CJU jCJU 5CJ\5CJCJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ] 5>*CJ\5\>*CJ?Hrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la`o[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 laop7trtia_]XX$a$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la 78D !!!!n"#`$a$m$%%&&'(7)8)?)))*{**+ & F$a$$a$+,,,,,,--$ &P#$/Ifxx$ &P#$/If $hxx`ha$[$\$h^h & F,,,,,----+-K-L-e-------------`.l.o.p.q....00111266 7 7%9(949<9I9J9Y9Z9m99999999: : : ::::D:E:F:p:ݹԳ 6CJ] 6>*CJ]5CJCJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ]5\ 5>*CJ\>*CJOJPJQJ^JmH sH E--+-K-[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 laK-L-e--4rr$ &P#$/If}$$IfTl40 #t   6P 0#4 la------Hrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la--a.p.[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 lap.q...01112_3ria_][V$a$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la _3`3l33444o5p5|5666k66 77 7\777%8p88%9&9(9$ & Fa$$ & Fa$$a$(949<9J9Y9Z9m99$$IfTl4\ #t  6P) 0#4 la$) &P#$/Ifxx$) &P#$/Ifm999999 :r}$$IfTl40 #t   6P) 0#4 la$) &P#$/If : ::E:F:p::[YTTOJ$a$$a$$a$$$IfTl4\ ##d +{ v 6P) 0#4 la:T;v;;<*<====>>>>??5?R?f?w??$ & Fa$$ & Fa$$ & F ^a$$ & Fa$$a$xx$ & F `a$  & F `p:<*<>>%@g@ArCtCCCCCCCCCCCD!D%D7D:D;D*CJ\ 6CJ];CJ\ 6>*CJ] 6>*CJ]>*CJ 5>*CJ\5\CJ 5CJ\D???@$@%@g@{@@@@@@APAAAAAAAAAB$ & Fa$ $ & F^a$$ & F ^a$$8^8a$$ & Fa$B^BsBCrCtCCCCC$) &P#$/Ifxx$) &P#$/If CCCC[LL$) &P#$/If$$IfTl4\ #t  6P) 0#4 laCCCD&D;Drrrr$) &P#$/If}$$IfTl40 #t   6P) 0#4 la;DQXQcQgQhQyQ|Q}QQ˼˼˼˼ǼǶ˼˼˼5CJCJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ]5\>*CJ 5>*CJ\OJPJQJ^JmH sH CJ8OJPJQJ^JmH sH "5CJ|OJPJQJ\^JmH sH >KKKK]NN$ &P#$/If$$Ifl4\ #t  6P 0#4 laKKK"L4tt$ &P#$/If{$$Ifl40 #t   6P 0#4 la"L#L=LMLbLtLHtttt$ &P#$/If{$$Ifl40 #t   6P 0#4 latLuLLL]K9$$ &P#$/Ifa$$$ &P#$/Ifa$$$Ifl4\ ##t { v 6P 0#4 laLL M9MFMKONPOPPPQPRPvtvkcaaaa$ & Fa$  & Fxx $hxx`ha${$$Ifl40# 6P 0#4 la RPPPPPPP$ &#$/Ifxx$ &#$/If[$\$$a$PPPP[LL$ &#$/If$$IfTl4\ f#t ^ 6 0#4 laPP Q=Q4rr$ &#$/If}$$IfTl40 #t   6 0#4 la=Q>QXQhQ}QQHrrrr$ &#$/If}$$IfTl40 #t   6 0#4 laQQQRRRRR%RLRWRvRjTzTpUqUuUUUUUUUUUUUUUVV!VTVUVoVzV~VVVVVVVVW(W+W,W-W*CJ\CJ\5CJ ;>*CJOJPJQJ^JmH sH 5CJCJ 5CJ\ 5>*\>*CJ;CJ\>*CJ 6>*CJ]5\ 5>*CJ\AQQRR[I7$$ &#$/Ifa$$$ &#$/Ifa$$$IfTl4\ ##t { v 6 0#4 laRR%RWRdRjTpUqUrUsUtUtrtia____$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6 0#4 la tUuUUUUUUU$ &#$/Ifxx$ &#$/If[$\$$a$UUUV[LL$ &#$/If$$IfTl4\ #t  6 0#4 laVV!VTV4rr$ &#$/If}$$IfTl40 #t   6 0#4 laTVUVoVVVVHrrrr$ &#$/If}$$IfTl40 #t   6 0#4 laVVW,W[I7$$ &#$/Ifa$$$ &#$/Ifa$$$IfTl4\ ##t { v 6 0#4 la,W-W*CJ]5\>*CJ 5>*CJ\OJPJQJ^JmH sH \jCJU\jACJU\jCJU\ 0JCJ\jCJU\jCJU\ CJH*\CJ\5\aJmH sH 5KgSgagrgsgggL$$IfTl4\ #t  6P 0#4 la$ &P#$/Ifgggg0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laggg h"h4hHrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la"h3h4h5hhhhhhhhhhijkkklUmVmcmcnpnooqqgqiqkqwqqqqqqqqqqrr3r>rBrCrTrWrXrirjrkrrrrrrss&sEs9uIu?vKvvvw̯CJ\5CJOJPJQJ^JmH sH aJmH sH mH sH 5CJCJ 5CJ\ 5>*\>*;CJCJ\>*CJ5\ 5>*CJ\ 6>*CJ]C4h5hhh[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 lahhhhhjkkllVmtrtia_]XX$a$ $ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la VmWmcmcndnpnooopqqq>qhqiqkqwqqqq$ &P#$/Ifxx$ &P#$/If[$\$ & F$a$ 5$7$8$9DH$qqqq]NN$ &P#$/If$$Ifl4\ #t  6P 0#4 laqqqr4tt$ &P#$/If{$$Ifl40 #t   6P 0#4 larr3rCrXrjrHtttt$ &P#$/If{$$Ifl40 #t   6P 0#4 lajrkrrr]K9$$ &P#$/Ifa$$$ &P#$/Ifa$$$Ifl4\ ##t { v 6P 0#4 larrs&s3s9u?vKv4wwwvtvkca\\\$a$$ & Fa$  & Fxx $hxx`ha${$$Ifl40# 6P 0#4 la wwxx+yyyz'zzr{{{}}7~8~:~F~N~$ &P#$/Ifxx$ &P#$/If[$\$$h^ha$$ & Fa$ 5$7$8$9DH$^$a$ww xxxxx+y1yz'z{{}}7~8~:~F~N~[~\~m~n~~~~~~~~   123׃ƄTUbcͅ΅ɼ 6CJ]56CJ\]>*;CJ\ 6>*CJ]>*CJ 5>*CJ\OJPJQJ^JmH sH \aJmH sH 5\ 5>*CJ\CJ 5CJ\CJCN~\~m~n~~~L$$IfTl4\ #t  6P 0#4 la$ &P#$/If~~~~4rr$ &P#$/If}$$IfTl40 #t   6P 0#4 la~~~  2Hrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la23[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 latrtiaXRRxx$xxa$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la Ƅ΅UV^وxx$% &P#$/If $hxx`ha$$`a$$a$$xxa$xx$xxa$TU\Ɉو݈-.AUVoȉ͉̉މjvyz{|&Mɒܒ)+/6Z\CJH*5CJ 5>*\>*\ 6>*CJ]5\ 5>*CJ\;CJ>*CJ:>*CJ 5CJ\ 5CJ\CJH*CJCJH-.AUN$$Ifl4\ #t  6P% 0#4 la$% &P#$/IfUVo4tt$% &P#$/If{$$Ifl40 #t   6P% 0#4 la͉Htttt$% &P#$/If{$$Ifl40 #t   6P% 0#4 lakz]K9$$% &P#$/Ifa$$$% &P#$/Ifa$$$Ifl4\ ##t { v 6P% 0#4 laz{|&tkca_]__$ & Fa$  & Fxx $hxx`ha${$$Ifl40# 6P% 0#4 la &[ɒk*+,-./6HIxx$ &P#$/If[$\$$ & Fa$$a$–Ö֖34NY]^ors   ,6UDTGHN{|~ś՛֛!"<GKL]`arst #B3C6@5CJCJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ]5\>*CJ 5>*CJ\OJPJQJ^JmH sH L–Ö֖L$$IfTl4\ #t  6P 0#4 la$ &P#$/If30rr$ &P#$/If}$$IfTl40 #t   6P 0#4 la34N^sHrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la [I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 la  6CDGHIJKtrtia____$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la KLMN|~$ &#$/Ifxx$ &#$/If[$\$$a$ ś՛[LL$ &#$/If$$IfTl4\ #t  6 0#4 la՛֛!0rr$ &#$/If}$$IfTl40 #t   6 0#4 la!"<LasHrrrr$ &#$/If}$$IfTl40 #t   6 0#4 last[I7$$ &#$/Ifa$$$ &#$/Ifa$$$IfTl4\ ##t { v 6 0#4 la #036@trtaQOJ$a$$ & F h^ha$ & F hxx^h $hxx`ha$}$$IfTl40# 6 0#4 laɤʤ֤?cxx$ &P#$/If[$\$ & F 5$7$8$9DH$$^a$$a$Ǥɤ֤ƦǦئ٦!STny}~'*+,;U_~pstxɫʫ۫ܫRSmx|}ʽ5CJ 5>*\>*;CJ\ 6>*CJ]>*CJ 5>*CJ\OJPJQJ^JmH sH 5CJ\5\ aJmH sH 5>*CJ\CJCJFǦئ٦L$$IfTl4\ #t  6P 0#4 la$ &P#$/If!S0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laSTn~Hrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la+[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 la+,;_lpstuvwtrtia____$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la wxʫ۫$ &P#$/Ifxx$ &P#$/If[$\$$a$۫ܫ[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 laR4rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laRSm}Hrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la&)*+:PZyhxkp°Ӱ԰PQkvz{%()*9U_~jzopz*+6R2S_89CQ̿޹ 5CJ\OJPJQJ^JmH sH 5CJCJ 5CJ\ 5>*\>*CJ;CJ\>*CJ 6>*CJ]5\ 5>*CJ\I*[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 la*+:Zghklmnotrtia____$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la op°Ӱ$ &P#$/Ifxx$ &P#$/If[$\$$a$Ӱ԰[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 laP4rr$ &P#$/If}$$IfTl40 #t   6P 0#4 laPQk{Lrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la)[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 la)*9_ljopztrtia_]]X$a$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la +,6t2b/_89Cn$ & Fa$$a$$a$$a$ac $%>pq8DGHIXq{lmyI`3.ſ̵̮̮̤5\aJmH sH aJmH sH 5CJ\5CJ 5CJ\ 5>*\>*CJ;CJ\ 6>*CJ]>*CJOJPJQJ^JmH sH CJH*CJ5\ 5>*CJ\@$ &P#$/Ifxx$ &P#$/If[$\$ $[LL$ &P#$/If$$IfTl4\ #t  6P 0#4 la$%>p0rr$ &P#$/If}$$IfTl40 #t   6P 0#4 lapqHrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 la9H[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 laHIX{trtia__Z$a$$ & Fa$  & Fxx $hxx`ha$}$$IfTl40# 6P 0#4 la lmyI3./07KLNZxx$ &P#$/If[$\$$ & Fa$$a$$a$ 5$7$8$9DH$.05KLNZbop -01BCD)*jkwxzP̿д5CJ 5CJ\>*CJ;CJ\ 6>*CJ]>*CJ 5>*CJ\OJPJQJ^JmH sH CJOJPJQJ^JmH sH CJ 5CJ\5\EZbpL$$IfTl4\ #t  6P 0#4 la$ &P#$/If4rr$ &P#$/If}$$IfTl40 #t   6P 0#4 la 1CHrrrr$ &P#$/If}$$IfTl40 #t   6P 0#4 laCD[I7$$ &P#$/Ifa$$$ &P#$/Ifa$$$IfTl4\ ##t { v 6P 0#4 latrtaMKI$ & F e^e`a$ & F e^e` $hxx`ha$}$$IfTl40# 6P 0#4 la*Q-klxGyz & F$ & Fa$$ & Fa$$ & Fa$$ & Fa$mPLMNOP\]^klmh]h&`#$$a$[$\$$ & Fa$ & F & F  dh^h & F4LMNPQWXZ[\^_efijkn67fg+-.5\0JmHnHu0J j0JUOJPJQJ^JmH sH CJ 5CJ\(mn67fg+,-.[$\$$a$" 0 0/ =!"#$%* 0&P1h0= 2!"#4$%' 0&P1h2 =!4"#$%# 0&P/ =!"#$%8$$Ifl 98y A"<%(+. 14) 6Pm 0t46,,,,4 la8$$Ifl 98y A"<%(+. 14) 6Pm 0t46,,,,4 la8$$Ifl 98y A"<%(+. 14) 6Pm 0t46,,,,4 la8$$Ifl 98y A"<%(+. 14) 6Pm 0t46,,,,4 la8$$Ifl 98y A"<%(+. 14) 6Pm 0t46,,,,4 la8$$Ifl 98y A"<%(+. 14) 6Pm 0t46,,,,4 la8$$Ifl 98y A"<%(+. 14) 6Pm 0t46,,,,4 la$$Ifl4 8y A"<%(+. 14 6Pm 0t46((((4 la8$$Ifl 98y A"<%(+. 14) 6Pm 0t46,,,,4 la8$$Ifl 98y A"<%(+. 14) 6Pm 0t46,,,,4 la8$$Ifl 98y A"<%(+. 14) 6Pm 0t46,,,,4 la8$$Ifl 98y A"<%(+. 14) 6Pm 0t46,,,,4 la$$Ifl4 8y A"<%(+. 14 6Pm 0t46((((4 la@$$IfTl 2s;6"=&(,03 6P! 06,,,,4 la@$$IfTl 2s;6"=&(,03 6P! 06,,,,4 la@$$IfTl 2s;6"=&(,03 6P! 06,,,,4 la@$$IfTl 2s;6"=&(,03 6P! 06,,,,4 la@$$IfTl 2s;6"=&(,03 6P! 06,,,,4 la@$$IfTl 2s;6"=&(,03 6P! 06,,,,4 la@$$IfTl 2s;6"=&(,03 6P! 06,,,,4 la$$IfTl 2s;6"=&(,03 6P! 06((((4 la@$$IfTl 2s;6"=&(,03 6P! 06,,,,4 la@$$IfTl 2s;6"=&(,03 6P! 06,,,,4 la@$$IfTl 2s;6"=&(,03 6P! 06,,,,4 la@$$IfTl 2s;6"=&(,03 6P! 06,,,,4 la$$IfTl 2s;6"=&(,03 6P! 06((((4 la=$$IfTl n"%v)/N3X2 8 6P 03,,,,4 la=$$IfTl n"%v)/N3X2 8 6P 03,,,,4 la=$$IfTl n"%v)/N3X2 8 6P 03,,,,4 la=$$IfTl n"%v)/N3X2 8 6P 03,,,,4 la=$$IfTl n"%v)/N3X2 8 6P 03,,,,4 la=$$IfTl n"%v)/N3X2 8 6P 03,,,,4 la=$$IfTl n"%v)/N3X2 8 6P 03,,,,4 la$$IfTl n"%v)/N38 6P 03((((4 la=$$IfTl '"9&A)/N3X2 y8 6P 03,,,,4 la=$$IfTl '"9&A)/N3X2 y8 6P 03,,,,4 la=$$IfTl '"9&A)/N3X2 y8 6P 03,,,,4 la=$$IfTl '"9&A)/N3X2 y8 6P 03,,,,4 la$$IfTl '"9&A)/N3y8 6P 03((((4 la=$$IfTl 2?4t"(+0X2  8 6`~00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`~00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`~00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`~00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`~00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`~00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`~00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`~00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`~00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`~00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`~00,,,,4 la$$IfTl 2?4t"@(+0 8X 6`~00((((4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`00,,,,4 la$$IfTl 2?4t"@(+0 8X 6`00((((4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`00,,,,4 la$$IfTl 2?4t"@(+0 8X 6`00((((4 la=$$IfTl 2?4t"(+0X2  8 6`L00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`L00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`L00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`L00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`L00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`L00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`L00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`L00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`L00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`L00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`L00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`L00,,,,4 la$$IfTl 2?4t"@(+0 8X 6`L00((((4 la=$$IfTl 2?4t"(+0X2  8 6`!00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`!00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`!00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`!00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`!00,,,,4 la=$$IfTl 2?4t"(+0X2  8 6`!00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`!00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`!00,,,,4 la=$$IfTl 2?4t"@(+0X2  8X 6`!00,,,,4 la$$IfTl 2?4t"@(+0 8X 6`!00((((4 laDyK www.seeinf.comyK .http://www.seeinf.com/DyK www.hackers.comyK 0http://www.hackers.com/IDyK 5http://www/w3.org/Security/Faq/www-security-faq.htmlyK jhttp://www/w3.org/Security/Faq/www-security-faq.html]DyK :http://www.rsasecurity.com/rsalabs/pkcs/pkcs-7/indes.htmlyK thttp://www.rsasecurity.com/rsalabs/pkcs/pkcs-7/indes.htmlADyK 3http://www.bcs.org/docs/01100/1194/pdg/codeofc.pdfyK fhttp://www.bcs.org/docs/01100/1194/pdg/codeofc.pdf%DyK ,http://www1.bcs.org/docs/01100/1194/Cop.htmyK Xhttp://www1.bcs.org/docs/01100/1194/Cop.htmDyK Lhttp://203.58.197.209/acs/events admin/static/national/pospaper/acs 131.htmyK http://203.58.197.209/acs/events admin/static/national/pospaper/acs 131.htmDyK Jhttp://203.58.197.209/acs/events admin/static/national/pospaper/code2.htmyK http://203.58.197.209/acs/events admin/static/national/pospaper/code2.htm i8@8 NormalCJ_HaJmH sH tH H@H Heading 1$$@&a$5>*CJaJmH sH @@@ Heading 2$$@&a$5\mH sH X@X Heading 3$$5$7$8$9D@&H$a$5CJ\aJmH sH F@F Heading 4$$@&a$5CJaJmH sH X@X Heading 5 $h5$7$8$9D@&H$^h>*CJaJmH sH R@R Heading 6$5$7$8$9D@&H$5CJ\aJmH sH P@P Heading 7$5$7$8$9D@&H$>*CJaJmH sH ^@^ Heading 8&$$<<5$7$8$9D@&H$a$>*CJaJmH sH D @D Heading 9 $$@&a$5CJ\mH sH <A@< Default Paragraph Font:>@: Title$a$5;CJaJmH sH jC@j Body Text Indent($xx5$7$8$9DH$^a$CJaJmH sH PQ@P Body Text 3$5$7$8$9DH$a$CJaJmH sH DP@"D Body Text 2$a$CJ\aJmH sH R^@2R Normal (Web)dd[$\$OJPJQJ^JmH sH @B@B@ Body Text$a$5CJaJmH sH RS@RR Body Text Indent 3dh^ CJmH sH @J@b@ Subtitle$a$5OJQJ\mH sH "W@q" Strong5\.U@. Hyperlink >*B*phJR@J Body Text Indent 2$h`ha$CJJY@J Document Map-D M OJQJ^J6"@6 Caption$a$5\mH sH , @, Footer  9r &)@& Page Number,@, Header  9r 9i)Y.     9i)Y$. $ P y  @YZ[\y#579;=ADFHLMWkmoqswz|~ "&)+-12<ikmoquxz|   +wy{}G/01<EGIKQX]chnox!#%),.045>\^`bdhkmost~.WY[]_abehlmw         & G I K M O Q R U X \ ] c f h k n r v z ~        . = P Q R ] g i k m t |     7 9 ; = ? C F H J N O Y v x z | ~          ! * I K M O Q S U X [ _ ` i   !$&),048<ABCDEGHIJKt  68:<>BEGIMNW{}8:<>@DGIKOPnox $&(*,.036:;DPRTVXZ\_bfgmprtw{  )>@BDFJMOQUV` &(*,.2579=>Hwy{} )+-/1358;?@J[]_acegjmqr|  !"-79;=DLQX]deo!#%)*4MOQSUY\^`deo "$&(+.23<VXZ\^`behlmw  !#%')+-./069;=@DHLPUVWXYZ[\^!$&(,-7NPRTVZ]_aefp!#%')-02489WXbz|~  #%')+-/259:DZ\^`bdfilpqwz|    "$&-5:AFMNX!#%'+.0267>QSUWY]`abfgn !"#&)-.8ikmoqsux{*+3GOtu} ( 8 9 A X ` y z !!*!+!3!G!O!t!u!}!!!!!!!!!!" "("8"9"A"X"`"y"z"""""""""""""""""#%#>#_#{####$$$$$$ $$0$1$2$3$4$5$6$7$8$9$:$;$<$=$>$?$@$A$B$j$k$w$$$$$$$$$%%+%;%P%c%d%%%%%%'(( )^*h*, ,*-4-0.7.q.../Y///////////// 0 0#0V0W0q000001.1/1<1=3@4J44X666+8U9V9`9;;;<<<=4=X=Y=Z=[=\=]=^=_=`=a=b=c=d=e=f=g=h=i=j=k=l=m=n=o=p=q=r=s=t=u=v=w=x=y=z={=|===========>)>*>D>T>i>{>|>>???$?"A%B|B}BBDEEEFFFFGGG8GGHHHIII$IPIII4JJJGKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK L!L-L5LCLSLTLgLLLLLLLM#M6M7MMMMMMOPPPQR^S_SiSVVVWWWY3ZNZ]ZzZZZZZ [=[>[Q[[[b\\ ]]I]]]]w^^_d__5``````aAaBaCaDabanawaaaaaaaa b b%b5bJb]b^bbbbbbdeeffggJhhOiYijkmkkkk"lXlllllmm mm#m3m4mGmtmummmmmmnnnnnnnnnnpqqrrrsHtItStttuuuuu!vJvqvvvvvv www-w=w>wQwewfwwwwwwwwwwx*x^xmxxxxxx%yFyyyzzzzz {V{{3|v|w|||}5}|}}}}}~~~Z~~>?I~!_ՀKˁK݂!m?$%&'3;IYZmŅƅ$:RΆφІ,t5JÈMԉT0o+H\tӌٌA&FiՎݎ~ʏˏޏKLfuא ./0RST~ВӒ8^2h۔ԕ}֖'].Plؘ23;]ʚٚښLMgv؛ 012UVѝCS >Yq۟7cŠ?xJKLɢ 89SbwţHz¤>?_զ֦>?Z20cͩBfgh}%w٫12Y_cdkCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`˭'(BQfxy.`ɯh&aGnߵJ =IQ_op "45ȸƺɻʻջ34=ӿۿ i9:;<=>?_ks!1EWXtu|3 )*Cuv?NO\`cdnZz]X@+~$-;LM`$%v As()5Cb&4DEXvw(`j&$%&'12zbu:jRX4 FRZhxy!6IJ-.:~ABN?(EF_\pqr~     mnzhvV] 9`Y +;<Oefjy TuDEYZ01EFTU? @   !!_!`!!!Q"R"""""E#F#~########$$$-$.$G$a$b$|$$$$$$$%*%>%?%]%^%%%&#&$&&n'''' ((1(C(_((((()F)G)))))*M*N*P*\*d*r*********+!+7+I+J+U+k+++++,,-,_,,,,h-}--...U///090y0z0{0|0}0~00000000000000000111L1M1g1v11111122(2)2*2T22222333344)4V44444505H5I5Y5555556=6_6`6o6666667M7o7777888888889909\9]9w9999999:$:8:9:s:t:::;9;:;;e<<<<<<=(=H=h====0>A>B>I>??#?+?9?H?I?\?w?x???????@ @@*@q@@@@@@@AaAAA"B#B8B9BXBxBBBBC5CsCCDDDDD D D D D DDDDDDDDDDD&D(D5D[DgDoD}DDDDDDDE E#E3EHE[E\EEEEEEGHHHIIIoKpK{KLLLMMNMUMM#NeNNYOOPkPPPQ QQQ(Q6Q7QJQ`QaQbQ{QQQQQQQRvRwRRRRRRRTUUNV WWWW#X$X/XXXYY&Y(YZZZq[r[[[[\H\\\\\\\\\ ]]]-]S]T]m]]]]]]]]f^g^v^w^x^^`aawbccc%e fffBgLg hhYhh;iiiiiiiijjj&jCjDj]jjjjjjjjZkikjkwkkkmnnooppkqqqgrmrrrsdssst ttt(t8t9tLt^t_txtttttttttuuuuuuwxxyyFz\{g{{| }}T~U~V~W~b~~< wĀ!ف,$%'3;IYZm΃σ !фބ݆9:D({<q͎EFHUŏ2AUghsϐސOXYn)]“Iy=#ZzƖ/̗͗ !"$05?M\]p̘͘ )? <E[%t2a؞V؟b !0?̡NOPR^cky͢΢ (7L^_jƣգ89cݤ7fgĩXVe{ۭ230`%E̱.bֲ)fj5]/0ȶڶ"57?v$w 789;GLTbqr./:PIRt~78=|a,-./=?KPXfvw,>?Dv@-45O_t  =JHKLXa=^p,PQjdst^_e9:<HMUcst+=>  \eq{bnx     A C O W e u v         0 C D         n~eRTU\] Q79EN\lm3FG  ! !+!B#+%&&&***-++S-W.a./11A22#33"4$40484F4U4V4i444444445!5"5-5C55555556A666I7J77778;8]8^999999;:<::::k;l;@<A<C<O<W<e<t<u<<<<<<<=!=6=H=I=T=j======>?>q>>>y?z??@R@|@@@@@@AAAAAAA0B8BFBVBjBBBBBBBBBBC CC(C)CEEEF?F^F|FFF G8GwGGGGGGH HH#H(H0H>HMHNHaHmHnHHHHHHH I II.ItIIIIIIIJXJyJzJKK/K&LLLLLLLLLLLLLLMMMMMMMMMMM#M+M9MHMIM\MrMsMMMMMMMNNNNNNNNPQQQzRTTTUWWW?YZZZ\?^@^H^^^^^^^^^_!_"_;_n_o______8`G`H`T`~``bccVdde ee]fgfff g7gAgggh^hh iXiii+jbjjjjjjjjjjjkKkLkfkvkkkkl$l%l1lWldlcnfogoqopppqrrr|rEtFtPtRuSuYuu,vvvvvvwwww2wDwEw^wwwwwwwwZxixjxvxxxz{{{{}}}Z  cۃ܃݃W…ȅކ&mÇćƇ҇އ+,EwxʈˈAPQn{z}jv%{|BJ͑#1ABUВђ#$EQȝ˞̞؞ƠYZ`l͢٢56Oz{ˣ̣-ABM*K.u9]a}˧էH\Ȩ٨&<VWĩѩ0aѪҪӪժ%CD]ȫګ۫8G[\)JK(7UnϮ#Eabdoϯ%&@Odwx԰@FO (Hk}dz+/HYlд&=µʵص+:OabxĶضٶڶx!)7HI\|}ȹɹغnھ۾/[%567?=+:;TP_`m~89Em>_AsOPQS_gu3CXjk<IGJKUu 129:egs{.>Sef(&)*5Cu*OP[tjkv:  &ry@78Rbw@MSVWa+h Ma6}6hi2ABOlyz}~cU   d  )   p q {    7&; !*FO2KLe=L`a(-.Pl }~2LMf>Mabo9ZYq(?AMUcrs)8N`aw: d   !!!>""""^###$2$$$$$$$%$%&%'%(%6%B%J%X%g%h%{%%%%%%% & &3&4&J&&&&&& '=''''E((((((((])q))))**)*4*z****+?+i++++++++++++++ ,,,L,T,\,a,f,k,l,y,,,,l--................................../!/"/;/n/o//////70F0G0U0{002333&56888_:;<~===?hAiAsABCCCDDD)D:D;DNDgDhDDDDDDDEE}EEEEEGHHHIIIJJJK"L#L/LLLM>MMNDNNNNNNNN O OO0O1OJO}O~OOOOOOFPUPVPdPPPRSSSTTUUUaUtVuWvWW~XZZZZZ'ZZ[[\[\\\(]a]]]]^P^^^^^^^^^^ _ _%_W_X_r_____!`0`1`?`]`j`hbkclcvc/e0e:eefiffffqghhhhhhhhhhhNiii:j;jj?j@jAjBjCjDjEjFjGjHjIjJjKjLjMjNjOjPjQjRjSjTjUjVjWjXjYjZj[j\j]j^j_j`jajbjcjdjejrj~jjjjjjjjjkk)k8kMk_k`kvkkkkkl,l`llllhmm"n#nqnrnnnnoo_oooo-pzppppq*q5q6qzq{qqrrCsPscsdssKttttttKucuuu%vvvvvvvvvvvvvvvvwwwww%w4w5wHwkwlwwwwwwwxxx_xnxxxxxxxycyyy$z%z[z\zz*{r{{{{{{{{{{{{{{{{{{{||"|#|6|R|S|l|||||||||E}T}h}i}v}w}}}}<~]~^~~~(Ā̀ڀ Uez{́efghijklmnopqrstuvwxyz{|}~Ăقڂ*+A؃v !"#$%&'()*+,-./012>FTefyنچ+,݇ +MUzÐMޑߑ'FG`Ӓ\jky 01DPQjƗۗetuǜ9Vbjv/Q]$ݠޠߠI#¢âĢŢӢ !23Fhiϣߣ}]  Ŭܭ/ʮ߮+,FVk}~1><?@ABCDEstuvwxyz{|}~ϳ23M]r  :GILX)l[\hW¾þľžƾǾȾɾʾ "34G\]vĿԿr39Cue!7hip&':EF_\klz@ST`_`l'O6H "TUo-.<kxz}7>{dfrz0@Uhi"/-01=H()5FCD^n +IVTWXYZ01K[p  5BBEFRY  ->?R"#        d          y EWJKd`op78D n` a m !!""#$7%8%?%%)&{&&'(((((()))+)K)L)e))))))))a*p*q***,---._/`/l//000o1p1|1222k22 33 3\333%4p44%5&5(545<5J5Y5Z5m555555 6 66E6F6p66T7v778*89999::::;;5;R;f;w;;;;<$<%<g<{<<<<<<=P=========>^>s>?r?t??????????@&@;@<@J@f@g@@@*A+A,A;AGAOA]AlAmAAAAAAA B BB{BBBBBBCCKDpDD EREEEBGCGDGFGGGHGIGJGKGLGMGNGOGPGQGRGSGTGUGVGWGhGjGvG~GGGGGGGG"H#H=HMHbHtHuHHHH I9IFIKKNLOLPLQLRLLLLLLLLLLL M=M>MXMhM}MMMNNN%NWNdNjPpQqQrQsQtQuQQQQQQQQQRR!RTRURoRRRRRS,S-Smhmimkmwmmmmmmmmmnn3nCnXnjnknnnno&o3o9q?rKr4sssstt+uuuv'vvrwwwyy7z8z:zFzNz\zmznzzzzzzzz { {2{3{{{{{{{}~ƀ΁UV^ل-.AUVoͅkz{|&[Ɏk*+,-./6HI’Ò֒34N^s  6CDGHIJKLMN|~ŗ՗֗!"<Last #036@ɠʠ֠?cǢآ٢!STn~+,;_lpstuvwxʧۧܧRSm}*+:Zghklmnop¬ӬԬPQk{)*9_ljopz+,6t2b/_89Cn¼ļмؼ $%>pq½ý9HIX{lmyI3./07KLNZbp 1CD*Q-klxGyzmPLMNOP\]^klmn67fg+,/0000000000000000000`0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000p 0p 000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000o 000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000q 000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000s 0s`00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000`0000000000000000000000000000000000000000000000000 0 0%0%0%0%0%0%0%0%0%0%0% 0% 0% 0% 0% 0% 0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0%0 0 0<100@40@400000+8000`9000;0; 0; 0; 0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0;0000000|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0|=0t 0t 0$?t 0$?(0$?(0$?0}B0}B(0$?(0$?0E(0$?(0$?0F0F(0$?(0$?0G0G0G0G0G0G0G0G0G 0G 0G 0G 0G 0G 0G 0G 0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G0G00u 0u 0M0M(0M0P0P0P0P0P0P0P0P0P0P0P0P0P 0P 0P 0P 0P 0P 0P 0P 0P 0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P0P00v 0v 0b0b00e0e00g0g0g00Oi00j0j0j0j 0j 0j 0j 0j 0j0j0j00m0m0m0m0m0m0m0m0m0m0m0m0m0m0m0m0m0m0m0m0m00w 0w 0n00q0q0q0q0q0q00It00t0t0t0t0t 0t 0t 0t 0t 0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t0t 0t 0t0t(0t(0t0y0y0y0y 0y 0y 0y 0y 0y0yH0y 0w| 0w| 0w| 0w| 0w| 0w|0w|0w|X0w|h0}h0} 0~ 0~ 0~0~0~ 0~ 0~ 0~ 0~ 0~ 0~ 0~ 0~0~0~0~ 0~ 0~ 0~ 0~x0~ 0݂ 0݂ 0݂ 0݂ 0݂ 0݂0݂0݂0݂ 0݂ 0݂ 0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂0݂000000 0 000000000 0 0 0 0 0 0 0 0 0+ 0+ 0+ 0 0 0 0  0 0 0 0 0 0 0 0 0 00000000000000000000000000000000000000000000000000000/0/0/0/0/| 0/| 0/0/0/(0/000 0 0 0000 0 0 0000 0 0 0000 0 0 00000 0 0 000 0 0 00 0 00000000000000000000000000000000000000000000000000000000001010101{ 01{ 0101(010 0 00 0 0 00 0 0 00 0 0 00 0 0 000 000000000000000000000000000000000000z 0z 00000! 0! 0?0! 0! 0֦! 0֦0! 0! 0?! 0?! 0?! 0?0! 0! 0! 0! 000! 0! 0! 0! 0! 000! 0! 0h0! 0! 0! 0! 0! 0! 0! 00! 0! 02! 02000000000000000000000000000000000000000000000000000000000y 0y 00" 0" 0" 0" 00# 0# 0# 0# 0# 0# 0# 0# 0# 0# 0 000000000000000000000000000000000} 0} 0ȸ0ȸ(0ȸ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ% 0ʻ% 0ʻ% 0ʻ% 0ʻ% 0ʻ% 0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0ʻ0~ 0~ 0(0(0000000000000& 0u& 0u& 0u& 0u& 0u0u0u0u0u0u0u0u0u0u0u0u0u0u0u0u0u0u0u0u0u0u0u0 0 0\0\(0\0d0d0d0d0d0d0d(0\00(0\(0\000000' 0' 0' 0' 0' 0' 0' 000000000000000000000000 0 0000000v0v0v0v0v0v0v0v0v000050( 0( 0( 0( 0( 0( 000000000000000000000000 0 000) 0) 0) 000* 0* 0* 00+ 0+ 0+ 0+ 00, 0, 0, 0, 000000- 0- 0- 00. 0. 0. 0. 0. 0. 0. 0. 0. 0. 0 . 0 . 0 . 0 . 0 . 0. 0. 00000000000000000000000000000000000000000 0 0000(000H0.00000X0X0 0BH000/ 0/ 0/ 0000000000000000000000000000 0 0000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0  0  0 0 0 0 (0 (0 0E1 0E0E1 0E0E1 0E0E1 0E0E1 0E0E1 0E0E1 0E0E1 0E0E1 0E0E1 0 E0E1 0 E0E1 0 E0E1 0 E0E1 0 E0E1 0E0E1 0E0E1 0E0E1 0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E 0E 0E0E0E0E0E0E0E2 0E2 0E2 0E2 0E2 0E2 0E2 0E2 0E2 0E2 0 E2 0 E0E0E0E0E0E3 0E3 0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E 0E 0E0E0E0E4 0E4 0E4 0E4 0E4 0E4 0E4 0E4 0E4 0E4 0 E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E 0E 0E0E0E0E0E 0E 0E0E(0  04 04 040404 04 04 040404 04 04 040404 04 04 040404040404045 045 045 045 045 04040404040404040404040404040404040404040404040404040404040404 04 040404046 046 046 046 046 046 046 046 046 046 0 46 0 46 0 46 0 46 0 4040404040404040404040404040404040404040404040404040400@0@0@ 0@ 0@0@0@0@0@0@7 0@7 0@7 0@7 0@7 0@7 0@7 0@7 0@7 0@7 0 @0@0@0@0@0@0@0@0@0@0@0@0@0@0@0@0@0@0@0@0@0@00(D0(D0(D0(D0(D0(D0(D0(D0(D0(D0(D0(D0(D0(D0(D0(D0(D0(D0(D0(D00 0 0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E8 0E8 0E8 0E8 0E8 0E8 0E8 0E8 0E8 0E8 0 E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E00R0R0 0 0R00U0U0U0U0U0U0U0U0U0U0U0U00Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y00\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0 0 0^0^0^0^0^0^0^0^0^0^0^0^0^0^9 0^9 0^9 0^9 0^9 0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^00jk0 0 0k0k0n0k0o0k0p0p0k0q0q0q0q0q: 0q: 0q: 0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q0q00u0 0 0u0u0x0x0x0x0u0\{0\{0u0|0|0|0|0|0u0W~0W~0W~0W~; 0W~; 0W~; 0W~; 0W~; 0W~; 0W~; 0W~; 0W~; 0W~; 0 W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~0W~000 0 0ބ0ބ0ބ000ބ000ބ0:0:0:0:0:0:0:0:0:0:0:< 0:< 0:< 0:0:< 0:0:0:00H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H 0H 0H0H0H0H0H= 0H= 0H= 0H= 0H= 0H= 0H= 0H0H= 0H= 0H= 0 H= 0 H= 0=H0H0H> 0H> 0H> 0H0H> 0ZH> 0ZH> 0ZH> 0ZH> 0H> 0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0000 0 0000? 0? 0? 00? 0? 0? 0? 00? 0? 0? 0 00? 0 ? 0 ? 0 ? 0 ? 0? 0? 0? 0? 0? 0? 00? 00000000000000000000000000000000000 0 000000000000000000000000A 0A 0A 0A 0A 0A 00000000000000@ 0@ 0@ 0@ 000000000000B 0B 0B 0B 0B 0B 000000000000000000000000000000000000000 0 0000C 0C 0C 0C 0C 0C 0C 0C 0C 0C 0 C 0 C 0 C 0 C 0 C 0C 000000000000000000000000000000 0 000000000000000D 0D 0D 0D 0D 0000000000000000000000000 0 0 0J0J0J0J0J0J0J0J0J0J0J0J0000000000E 0E 000000000000000000000000t0 0 0000000000000000000000F 0F 00000000000000000000000000 0 0000 0 0 (0 0(0 (0 (0 0{(0 0n0n0n0nG 0nG 0n0n0n0n0n0n0n0n0n0n0n0n0n0n0n0n0n0n0n0n0n00 0 0 0 (0 (0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 H0 0UH 0UH 0UH 0UH 0UH 0UH 0U0U0U0U0U0U0U0U0U0U0U0U0U0U0U0U0U0U0U0U0U000 0 0000000000000000000I 0I 0I 0I 0I 0000000000000000000000000050505 05 0505050505J 05J 05J 05J 05K 05K 0505050505K 050505050505050505050505050505050505050505050505050505050505050500=0=0= 0= 0=0=0=L 0=L 0=L 0=L 0=M 0=M 0=M 0=M 0=M 0=M 0=M 0=0=0=L 0=L 0=L 0=N 0=N 0=N 0=N 0=N 0=L 0=L 0=0=0=00B00B0B0B0B0B0B0B0B0B0B0B0B0B0B0B0B0B0B0B0B0B0B0B0B0B0B 0B 0B0B0BO 0BO 0BO 0BO 0BO 0BO 0BO 0BO 0BO 0BO 0 BO 0 BO 0 BO 0 BO 0 BO 0B0B00 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H 0 H 0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H0 H00N0 0 0N0N0N0N0N0N0N0T0T(0T(0T0W0W0N0N0Z0Z0Z0ZP 0ZP 0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z00H`0 0 0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`Q 0`Q 0`Q 0`Q 0`Q 0`Q 0`Q 0`Q 0`Q 0`Q 0 `0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`00%l0 0 0dl0dl00go0go00p0p00rr0rr00Ft0Ft0FtR 0FtR 0FtR 0FtR 0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft0Ft00jx0 0 0x0x0x0x0x0x0x0x0x0x0x0x0x0x0x0x0x0x0xS 0xS 0xS 0xS 0xS 0xS 0x0x0x00Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0Ƈ0 0 0{0{0{0{0{0{0{0{0{0{0{T 0{T 0{T 0{T 0{T 0{T 0{T 0{T 0{T 0{T 0 {0{0000000000000000000000 0 0000000000000000000000U 0U 0U 000000000000000000000000000B0B0B 0B 0B0B0BV 0BV 0BV 0BV 0BV 0BV 0BV 0BV 0BV 0B0B0B0B0BX 0BX 0BX 0BX 0BX 0BX 0BX 0BX 0BX 0BX 0 BX 0 B0B0BW 0BW 0BW 0BW 0BW 0BW 0BW 0BW 0B0B0B0B0B0B00ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ0ժ 0ժ 0ժ0ժ0ժ0ժ 0tժ 0tժ 0tժ 0tժ 0tժ 0tժ 0tժ 0tժ0ժY 0ժY 0ժY 0ժY 0ժY 0ժY 0ժ0ժ0ժ00d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d 0d 0d0d0dZ 0d@ 0d@ 0d@ 0d@ 0d@ 0d@ 0d@ 0d@ 0d@ 0dzd@ 0d@ 0d@ 0dzd0d0d@ 0dzd[ 0d[ 0d@ 0dzd[ 0d[ 0d0d\ 0d\ 0d\ 0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d0d000 0 0(0(000(0(00۾(0(00(0(00] 0] 0] 000000000000^ 0^ 0^ 0^ 0^ 000000000000000000000000`0 0 00000000000` 0` 00000_ 0_ 0_ 0_ 0_ 0_ 0_ 0_ 0_ 0_ 0 _ 0 _ 0 _ 0 _ 0 0000000000000000000000000 0 0I0I0I0I0I 0I 0I 0I0 0I 0I00 0I 0I0000a 0a 0a 0a 0a 000000000000000000000000 0 0(0((0(0*0*0*0*0*0*0*0* 0*0P0P0P0PH0*0k0k0k0k0k0k0k 0k00b 0b 0b 0b 0b 0b 0b 0b 0000000000000000000000000 0 0M 0M 0M0WH0M0M0M00000M0x00(0H00000c 0c 0c 0c 0c 0c 0c 0c 0c 000000000000000000000000B0 0 0yh0yh0y0y000(0(0X0X00 (0(080 80 (00 0(0q 0{ (0q (0q (0q 00H0(0(0(0000d 0d 0d 0d 0d 0000000000000000000000000000 0 00(0000e 0e 0e 0e 0e 0e 0e 0000000f 0f 00000000000000000000000000000b0b0b0b 0b 0b0b0b0b0bg 0b0bg 0qbg 0qbg 0qbg 0qbg 0qbg 0qb0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0000 0 00h 0h 0!h 0!h 0!h 0!h 0!h 0!h 0!h 0!h 00h 0$h 0$h 0$h 0$h 0$h 0$h 0$00000(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(% 0(% 0(%0(%0(%0(%i 0(%i 0(%i 0(%i 0(%i 0(%i 0(%i 0(%i 0(%0(%i 0(%i 0(%i 0(%i 0(%i 0(%i 0(%i 0(%i 0 (%i 0 (%0(% 0(% 0(% 0(% 0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%0(%j 0(%j 0(%j 0(%j 0(%0(%00l,0l,0l,0l,0l,0l,k 0l,k 0l,k 0l,k 0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,0l,00G00 0 000000000000000808080808080=0=(0=(0=0iA0iA0iA0iA00C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0 0 0E0E0E0H0H0H0H0H0H0H0H0H0H0H0H0Hl 0Hl 0Hl 0Hl 0Hl 0Hl 0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H0H00VP0 0 0P0P(0P0S0S(0P(0P0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UUm 0UUm 0UUm 0UUm 0UUm 0UUm 0UUm 0UUm 0UUm 0UUm 0 UUm 0 UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU0UU001`0 0 0j`0j`0j`0j`0000e00e00e00e(00e(00e00(0qg(0qg000h0h0h0h0h0hn 0hn 0hn 0hn 0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h0h 0h 0h0h0h(0h0hm0hm 0hm0hm 0hm 0rnhm 0rnhm 0rnhm0hm 0hm0hm0hm 0hm0hm0hm0hm0hm0hm 0hm 0phm 0phm 0phm 0hm0hm0hm0hm0hm 0hm 0rhm 0rhm0hm 0hm0hm 0hm 0hm 0hm 0hm 0hm 0hm0hm 0hm0hm 0hm 0hm 0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm0hm 0hm 0hm0hm0hm0hm0hm0hm8 0hm 0\z 0\z 0\z 0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z 0\z 0\z0\z0\z0\z0\z 0\z 0\z 0\z 0\z 0\z 0\z 0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z0\z000 0 000000(00 (0000 0 0 0 0 0 0 000000000000000000000000k0 0 000000000000000000000000000000000000000000000000000u0 0 00000 0 0 00 0 0 00 0 0 00 0 0 0 0000 0 0 0 0000000000000000000000000000000000000000000000Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0Ţ0 0 0000000000000000 0 0 0  0  0  0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 000 0 0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>0>00 0 0 0G0G80GH0X0)H0XH0XH0XH0XH0XH0XH0X0lH0XH0XH0XH0X 0 0 0000000000000000000000000000000000000000000000000000000000000 0 0H0(0(0(0(0(0(0(0(0(00(0(0(000000000000000000000000000l0 0 00H0000(0(0(0(0(0(0(0(0(00(0(000000000 0 00000000000000000000000.0 0 0x0x0x0x0x0x0x0x000x00 0 0 0 000000000000000000000000 0 0/0/0/0/0/0/0/0/0/0/0/0/0/0/0/ 0/ 0/ 0/0/0/0/0/0/0/0/0/0/0/0/0/0/0/0/0/0/0/0/0/000 0 0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V0V00 0 0 0B0B0B0F0B0B0(0(00(0(000000000000000000000000000000000 0 00(00 0 (0(00 0 0 0 0 0 0 0 0 (0(00 0 (00 0 0 0 0 0  0  0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 00p0 0 00(000000808080800000000a 0a 0a 0a 0a 0a 0a 0a 0a  0a  0a  0a  0a  0a  0a 0a 0a 00(0(0(0(0(0(0(0(0(0(0(0(0(0(0(0(0(0(0(0(0 0 0*0*X0*0-0-X0*X0*0`/0`/X0*X0*00X0*X0*0p10p10p1 0p1 0p1 0p10p10p1 0p1 0p1 0p1 0p1 0p1 0p1 0p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p1 0p1 0p1 0p10p10p10p1 0p1 0p1 0p1 0p10p10p1 09p1 0p1 0p1 0p1 0;p1 0;p1 0p1 0p1 0p1 0p1 0p1 0p10p1 09p1 0p1 0p1 0<p1 0<p1 0<p1 0p1 0p1 0p1 0<p1 0<p1 0<p1 0<p1 0<p1 0<p1 0 <p1 0p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p1 0p1 0p1 0p1 0Cp1 0Cp1 0Cp1 0Cp1 0Cp1 0p1 0p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p10p100H0 0 0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI0FI00N0 0 0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN0dN00-S0 0 0mS0mS0mS0mS0mS(0mS0xY0xYH0xY0[0[H0xYH0xY0\0\0\0\ 0\ 0\ 0\ 0\ 0\ 0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\00d0 0 0d0d 0d0g0g(0d(0d0Wi(0d(0d0dj(0d(0d0k0k0k0k 0k 0k0k0k0k0k0k0k0k0k0k0k0k0k0k0k0k0k0k0k0k0k0k00n0 0 03o03o03o03o03o(03o0s0s0s0s0s0sH0s0v0v0v0v0v0v 0v0v0v0v0v0v0v0v0v0v0v0v0v0v0v0v0v0v0v0v0v0v00{0 0 0{0{0~0~0~0~0~0~0{0000000000000000@0@0@0@0@0@0@0@0@0@0@0@0@0@0@0@0@0@000 0 00(00(0(000(0(00(0(000000000 0 0 0 0 0 00000000000000000000000 0 0 0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C0C000 0 00000000(00(0000H0H000H0H00ʠ0ʠ0ʠ 0ʠ 0ʠ 0ʠ 0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ0ʠ00,0 0 0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l0l00+0 0 0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g0g00*0!0!0l0l000z0z000,0,0,0,0,0,0,0,0,0000(0(00000 0 0 000000000000000000000000I0!0!00000000m0m00000000000 0 0 0000000000000000000000000!0!00X0X0 0 0 0 0 00000 0 0 00X0X0 0 0 00X0X00 0 0 0 000 0 0 0 0 0 00O@0@0@0@0@0@0@0@0 0000000000000000000"$3hBCPeu-ZK ~&.7?.IV jxMe^,2!9FMb2pj|1dպA{)2)HdTl{ڄ1Ϸ-,p:WKQb"hw..p '/7@KU\eo{&29AKValr|$-5?HQWboykq0 K h b  z .iN J>n.w {?9)3.^-W\ : Y!!"{""t##y$$$t%%y&&>'>((()c))h.3 4V44.5:eAAA)B{BCHGOOSPPP6QQVQ_Dee f]ffkqtqqrrvz={e{{{|F}݆YʼnHKTۘ.ٞLVۣ8zc\'xho4W)uNL$Dv2xI-    p ;eT$(-(a((>)*M....I//0445L55(669<=\==8>?C\CCDDaE HHHI[IIMUaUUUVNZ`aSaaavbgmCnnniorx^xxxy|Y· œgz?̜< kͦ ^`ںq.I.v>4 PsH= uCl   F!!+%0888!99A:k?t@@@HAAqBjF(GVGGGwH>I#LaLL MMXNQHQrQQRRUb!cnccGdhnnKoo$pqs{D{{{i|ދ+wʌPAЖ#z˧A*Cگ[Jϳ%wOaغH|Ƚ6:_juse7ahA K`2ar""#`##$6)))3**+?/// 0k0122!3n33F4&9HgHHIIM S0S}SSUTTYbb cWcc0d0i=nZnnno_oopuKy{k{{||}"Rhzeن*Fي+Fj PtǠ2h߲+}C2 3\&EkT-hC0 >"   o7+-K---p._3(9m9 ::?BCC;D*ElEE FFKHTKKK"LtLLRPPP=QQRtUUVTVV,Wx]Kggg4hhVmqqrjrrwN~~~2Uz&3 K՛!sS+w۫R*oӰP)$pHZCm.qstuvwxyz{|}~     !"#$%&()*+,-.012345689:;<=>?ABCDEFGHIJLMNOPQRSTVWXYZ[]^_`abcdfghijklmnpqrstuvwxyz|}~      !"#$%'()*+,-./01345678:;<=>?@BCDEFGHIJLMNOPQRSTUWXYZ[\]^_`bcdefghijkmnopqstuvwxyz{}~      !"#%&'()*+,./012346789:;<=>@ABCDEFGIJKLMNOPRSTUVXYZ[\]^_`acdefghijklmnpqrstuvwxz{|}~-rs_'''L(((``$a.v.|........./ /,/3/x/|/00444444445%5*515555555566 666&626G6V6j6u6w6666668"8+88888999999::::::U;^;<<<<= =4=@=I=M=|====>>CC)I.IqIuIIIIIIIIIJ JJJJJ/K4KJKSKWM`M\QlQTVZV\\\\U]\]]]]]]]^^8^?^@^E^P^X^{^^^^^^^^^^"_(_[_b_h_m_____``M`R`d`j```aa/a5a6a9a~bbggzggjjll[lblllslllllllll5n>n+s6suv!v'v,v6vLvUvtvzvvvvvvvvvsy}yB{I{||J~R~"+.</9Wa"Ç͇rw׊ڊۊ!$%. -3chGQ͗՗{HR7=%Y^ HPѲײ=Gѳ۳t}&+U^$+4:ݿ%+WZadnt&*x8=X]^c{XZ'-^d :@z~ "#*2:]`$(*125jqrxz $dkmvEN#bj6? V` #(|:D jpX^`e;ALWjs $nuz%t| &*DKQXZa  MSpvHIr"'mtU^Ya"/    K!R!!!k"n"/#6#Q&[&)))),-i/q///3'3@5G577g;q;m?q?AACCaChC|EEhMoMMMMMANGNNNNOHOPOOOOOOOP P!P'PUP^PSQ_Q R)RRRVVVV[[K\S\c\h\^^0h6h7hAhhhhhhhhh iiiiaimioisiiiiik k>qHqs ssss*slsusssssssssu'uyy{{||k~s~~~#-2ɀπ܀AJˆƈ ŠɊ͊Ԋ <@ێP[ԓՓדKL͕ϕ/5Ӛݚ!*,6JM%+0;), #,0qzԹ޹08߾5:#fnYcrxzBMBH_hEQou*uxy;FV[]c'+,9eqy $^g+7L X       d m /35= gp""#!#p#v#/$7$M$V$X$`$%&<&G&h&z&(*-*G*P*T*Y*p*w***++++a.i...p////00'0/0U0]00000Q1Y1111111\2d222223 3(3.33333333366778'8(848U;Y;??AAAAkEuE%G*GGGJJ2N;N5S9SUUlXvXg\n\]]^^^^__cc/d9dheweAgMgnhthhh^ieiiiiiii jj:jBjgjmjoj{j|jjjjkkppqqttuuuuuu,v2v3v:vdvhvvvvvx x3}8}1~5~S\ɀ"dlͅօ${ކ&0mw%( 6;3:ouzDMQ^`fjqȡΡ8<ovx9>xԱޱ;Dipy!',1fmow$*emov T]^bhm s{2=pv#/>BKO?B,QX 6=SW>ELU%'-^fOY[d7FMX#+2 '          t}KNU_.!8!."5"""+#0#1#6#######$%''()S)[)**//)626i6m666C7J799s;{;;; ==;@B@@@A!AAACC'E0E IIzKKM M MM>MDMMMMMMMMMDNKNRN[NNNNN,O/OOOVVVVVV\\\\\ \`\d\n\u\\\\\!]']W]\]a]k]p]w]]]]]^^(^/^<^D^L^O^^^^^__%f+fffffhhhhhhhhi&i_igiiiiiii jjj&j(j,jlmmmmmrrrryrPsXsssVt_tttttuuKuRukutuv v-v6vvvxxyydzmzzz1{9{y{{~~LUUZ[azRX[bdp 6?@GɡϡСա HN'0ܭ9?BKMU%:?z v{ %*29jn(Yagn+238DLNVad067> 1>Vcel.5CL  y  D H 8> z%-IWjx!!##E#J#i#q#$$q%{%& &^&f&h&n&&&&&&&&&&&'(4( **D2K222222222223 3-33343<3?3C3D3L3s3z3333334 44J4Q4S4[4b4g44444<<==EEHHMMRR\\]]__````LbXbUd^d h+hphzhhhiijjkkkkl$l&l3l/m2m`mgmnnttttuuxx y%yyyS{\{#,'.݃dkmuŒٌ!9> :@Ƒɑґב37Y]NT4>cmğ>LYe~͡ҡ֡ܡ-3RWƣϣŨΨĭͭ4;ڻ>FgkINafuzhodm*9xks mu+3EM]`qt %&-Z`".NP[^jmn,/\mpq$$&&**;,],,, ----..0"00062;2J5R56 6667*89T9992;~;<<== >>u>z>CeCfCCCCC*D+DSDTDD1J3JLLNNcQeQgTqTZZ[[]]` ```aaaacc^fvfngxgggh=i>iNimkkl lllmm oorrsssGtttMuWuuu,v8v~vvvvuw~www7{I{boǃ "PQˈՈO[ӊڊ!$ݎWb 1hj۔iÕ֖̕&֗8: djrw̲в1ȳгns.3t%-%QV>G:B9B,3ZEdfW}#?oxuz*-./fpP]U^t | c     l**tBS)+u~C""q#|###=$F$$$D'O'))**C+H+3/=/11#1&11133558(8|88&9/999\?r???@@@@DDrNN+O.O0O5OqQzQQQRRTT;UHUUUUUOV\V\WoWW"XYYY%YYYZZ[[\&\c\j\c]l]]]C_I_bbc3cddeeffgghXhiiSj\jkkiosoooppqrBsJsntwt$y-yz z{{}}?~H~~~~W^/3{EW PSaf|ʓϓŔҔ*-=eo9?̟ΟݢX]%(MЫҫuxPXٮQVosز$(,0GK!Եܵ{/3LV599>nsNRƿʿ7;osU`x(-QU8==]`i]7<FP bn  m |       $,-6 R6>9&G&y**44445 577/848::p;r;<<B=G=fCoCCC}HHI IMM NN\\]]1_:_e\fffiikkppTw]wW|b| —ɗݡENdjţʣOZS\ԫ٫EL[`=uJSjnIRdi>?UVP Gno101ij0sGI_d*wsIQUW~!v~24FK,5sx*?B   )+ES[d\eZ_i$o$%%z**2.=.1/:///@7J7=9C9::&<1<T=\=G>Q>@@AABBwDDON[N@OIOOOVsV WtW_$_:fBfi&iiijjYk^k_o`ooo-p3pRp]pzppppppppqqqqrrSrUrs)sjssuuKubuuuvv{wwwwwxzzb|k|||||&CT$)%*ȌԌ.V_ߒfi`iŗ:x=HΫثw|~ (lu{,9U\z7gU^,;V\!6< NVOXx>E!&3k z   Zc<Ii}(; %  !!!""$$%%[)d)))**,,-'-l//113344::;;@@BBCIDEEGGnHsH.I2IlIyIM MMMNN`PhPPPQRR RRRSSiUqUuXXZZV[`[a\j\^^^J_cc.d3de$ehhiii jkkl=lllmmdninooYofo/q7qqqrrquuu3v?vwwxxzz,{1{|$|}}d~q~NUUb'.<GenP^EiƐӐ&1=BmrKQ.<Culn af.9óʳMY ڹݹQXBNʻ`l4==BBINP[^jmn ,/333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333X<<xx>>~~..ww& & ] ]   EEFFGGʄ|hhjjCCII33/0KKMNP[^j/DIRECTOR*C:\My Documents\syllabus\Final_Syll_IT.docDIRECTORQC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of Final_Syll_IT.asdDIRECTORQC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of Final_Syll_IT.asdDIRECTORQC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of Final_Syll_IT.asdDIRECTORQC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of Final_Syll_IT.asdDIRECTORQC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of Final_Syll_IT.asdDIRECTORQC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of Final_Syll_IT.asdDIRECTORQC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of Final_Syll_IT.asdDIRECTORQC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of Final_Syll_IT.asdDIRECTORQC:\WINDOWS\Application Data\Microsoft\Word\AutoRecovery save of Final_Syll_IT.asdh& "!DM,V]НWoH!~4' sq#T>CiR|#Ct: q4(M$886qL`r58|#bYB IE peR 9' xNk li)} *  ,V vH O I n y`4 T!F 7S  l)Njv)O|%c,o; y[-~vhXXvZ.(fpuR-0D\ZDxh"PL\Jb+.5Pc:̚gE2r^_ohG9*KdۚD >@v1< vdR`9:`h!,Gw^z4i 2tw]kƗ.UTob)`-mC6A~L ;a~ޟJJ\[5@4@3<IE۔wE`2,>24-6{\/\+ Rc!7 p pC!O|}H! T![T4!!> / W"(lpc%+F,~%>ݒ}%$rXI%v>+&&g.?o9h?(@}@M Ayh_Aa_i|ANf2%iA ?C@›yCtdCb8]DڊMFhFA'nFؿlaOMF7@H%:F3HF? JW$IJH܃{N[J N@Y}Jv^\YKy8x.K~yiM@^:N%qNNDWN4UOXv+sRx<S A4n8CS @"SR58L'SkZ,Th5QU<+cU)rV׸ #sWbWRb@nXviRh< !YF&FU`Y! [ԗde[j1[  \n;O\r^'&P\`hQ\R-*\e`_^-8s@^Nd.R^_&Y_/=g`;`Nvm?a.zar I^c_c0_6s5"d4܊]5dX4$>dFFeje@Wep ZY3}e|.,2e $f)f paf@qgPܢ#g"Sb'h1nl.h0*Te`hlci-:Bj|YPPZjȫPq k,(V1lhXynа$[nwUnYp?n>]H6o4on``p֚mq/6q~q ˆ rR:%"Br 7'Yt$i Ov1Vvxw""\w%^x6Iy@!ZFO/yˮ(yTgLz,Mz`Yz.:w9gz""oPzPx!I}̛ D`}j 3O}q~蒴\; G|3h,(l:f\j^`o()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h88^8`.h^`.h L ^ `L.h  ^ `.hxx^x`.hHLH^H`L.h^`.h^`.hL^`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`o(. 0 ^ `0o(..0^`0o(... ^`o( .... ^`o( ..... X `X ^X ``o( ...... $`$^$``o(....... 0*0*^0*`o(........808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`o(.^`o()    ^ ` o(@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.0^`0o(()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`o(.^`o()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.h^`.h ^`OJQJo(oh pp^p`OJQJo(h @ @ ^@ `OJQJo(h ^`OJQJo(oh ^`OJQJo(h ^`OJQJo(h ^`OJQJo(oh PP^P`OJQJo(^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.hCC^C`.h^`.hL^`L.h  ^ `.h^`.hSLS^S`L.h##^#`.h^`.hL^`L.0^`0o(()hpp^p`.@ L@ ^@ `L.^`.^`.L^`L.^`.PP^P`. L ^ `L.^`o(^`o()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.0^`0o()^`. L ^ `L.  ^ `.xx^x`.HLH^H`L.^`.^`.L^`L.h^`.h ^`OJQJo(oh pp^p`OJQJo(h @ @ ^@ `OJQJo(h ^`OJQJo(oh ^`OJQJo(h ^`OJQJo(h ^`OJQJo(oh PP^P`OJQJo(CC^C`o(.^`.L^`L.  ^ `.^`.SLS^S`L.##^#`.^`.L^`L.0^`0o(()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`5o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.808^8`0o(.^`o()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.808^8`0o()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.808^8`0o(.0^`0o()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`5o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.CC^C`o(.^`.L^`L.  ^ `.^`.SLS^S`L.##^#`.^`.L^`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`5o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.CC^C`o(.^`.L^`L.  ^ `.^`.SLS^S`L.##^#`.^`.L^`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.CC^C`o(.^`.L^`L.  ^ `.^`.SLS^S`L.##^#`.^`.L^`L.h88^8`.h^`.h L ^ `L.h  ^ `.hxx^x`.hHLH^H`L.h^`.h^`.hL^`L.^`o(.^`o(.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.0^`0o(()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.eke^e`ko(.^`. L ^ `L.  ^ `.xx^x`.HLH^H`L.^`.^`.L^`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`o()$ $ ^$ `o(@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h ^`OJQJo(h ^`OJQJo(oh pp^p`OJQJo(h @ @ ^@ `OJQJo(h ^`OJQJo(oh ^`OJQJo(h ^`OJQJo(h ^`OJQJo(oh PP^P`OJQJo(L^`L.TT^T`.$ L$ ^$ `L.  ^ `.^`.L^`L.dd^d`.44^4`.L^`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h88^8`.h^`.h L ^ `L.h  ^ `.hxx^x`.hHLH^H`L.h^`.h^`.hL^`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.88^8`o(.^`. L ^ `L.  ^ `.xx^x`.HLH^H`L.^`.^`.L^`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.808^8`0o(()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.0^`0o(()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`o(()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`5o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.L^`L.TT^T`.$ L$ ^$ `L.  ^ `.^`.L^`L.dd^d`.44^4`.L^`L.h88^8`.h^`.h L ^ `L.h  ^ `.hxx^x`.hHLH^H`L.h^`.h^`.hL^`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h88^8`.h^`.h L ^ `L.h  ^ `.hxx^x`.hHLH^H`L.h^`.h^`.hL^`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h88^8`.h^`.h L ^ `L.h  ^ `.hxx^x`.hHLH^H`L.h^`.h^`.hL^`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.h88^8`.h^`.h L ^ `L.h  ^ `.hxx^x`.hHLH^H`L.h^`.h^`.hL^`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.808^8`0o(()^`o()$ $ ^$ `o(()@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.CC^C`o(.^`.L^`L.  ^ `.^`.SLS^S`L.##^#`.^`.L^`L.h88^8`)h ^`OJQJo(oh   ^ `OJQJo(h   ^ `OJQJo(h xx^x`OJQJo(oh HH^H`OJQJo(h ^`OJQJo(h ^`OJQJo(oh ^`OJQJo(^`5o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.L^`L.TT^T`.$ L$ ^$ `L.  ^ `.^`.L^`L.dd^d`.44^4`.L^`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.CC^C`o(.^`.L^`L.  ^ `.^`.SLS^S`L.##^#`.^`.L^`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`)h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`OJPJQJ^Jo( ^`OJQJo(o pp^p`OJQJo( @ @ ^@ `OJQJo( ^`OJQJo(o ^`OJQJo( ^`OJQJo( ^`OJQJo(o PP^P`OJQJo(808^8`0o(.0^`0o(. 0 ^ `0o()@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h88^8`)h ^`OJQJo(oh pp^p`OJQJo(h @ @ ^@ `OJQJo(h ^`OJQJo(oh ^`OJQJo(h ^`OJQJo(h ^`OJQJo(oh PP^P`OJQJo(^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h ^`OJQJo(h^`)h @ @ ^@ `OJQJo(h ^`OJQJo(h ^`OJQJo(oh ^`OJQJo(h ^`OJQJo(h PP^P`OJQJo(oh   ^ `OJQJo(^`5o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.hCC^C`.h^`.hL^`L.h  ^ `.h^`.hSLS^S`L.h##^#`.h^`.hL^`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`)h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.CC^C`CJo(.^`.L^`L.  ^ `.^`.SLS^S`L.##^#`.^`.L^`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.CC^C`o(.^`.L^`L.  ^ `.^`.SLS^S`L.##^#`.^`.L^`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.hCC^C`.h^`.hL^`L.h  ^ `.h^`.hSLS^S`L.h##^#`.h^`.hL^`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.0^`0o(()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.808^8`0o(.^`o(.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.CC^C`o(.^`.L^`L.  ^ `.^`.SLS^S`L.##^#`.^`.L^`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.0^`0o(()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.0^`0o(()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.hh^h`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.L^`L.TT^T`.$ L$ ^$ `L.  ^ `.^`.L^`L.dd^d`.44^4`.L^`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`o()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o()0^`0o(()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`o(.pp^p`OJPJQJ^Jo(-@ L@ ^@ `L.^`.^`.L^`L.^`.PP^P`. L ^ `L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.CC^C`o(.^`o()L^`L.  ^ `.^`.SLS^S`L.##^#`.^`.L^`L.808^8`0o(.^`o()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.L^`L.TT^T`.$ L$ ^$ `L.  ^ `.^`.L^`L.dd^d`.44^4`.L^`L.h ^`OJQJo(h pp^p`OJQJo(oh @ @ ^@ `OJQJo(h ^`OJQJo(h ^`OJQJo(oh ^`OJQJo(h ^`OJQJo(h PP^P`OJQJo(oh   ^ `OJQJo(^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.hCC^C`.h^`.hL^`L.h  ^ `.h^`.hSLS^S`L.h##^#`.h^`.hL^`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o()^`o(.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h88^8`.h^`.h L ^ `L.h  ^ `.hxx^x`.hHLH^H`L.h^`.h^`.hL^`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.0^`0o(()0^`0o(()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.tt^t`.DLD^D`L.  ^ `.  ^ `.L^`L.^`.TT^T`.$L$^$`L.L^`L.TT^T`.$ L$ ^$ `L.  ^ `.^`.L^`L.dd^d`.44^4`.L^`L.808^8`0o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h88^8`.h^`.h L ^ `L.h  ^ `.hxx^x`.hHLH^H`L.h^`.h^`.hL^`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.h^`.h ^`OJQJo(oh pp^p`OJQJo(h @ @ ^@ `OJQJo(h ^`OJQJo(oh ^`OJQJo(h ^`OJQJo(h ^`OJQJo(oh PP^P`OJQJo(808^8`0o(.^`o()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.CC^C`o(.^`.L^`L.  ^ `.^`.SLS^S`L.##^#`.^`.L^`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.hCC^C`.h^`.hL^`L.h  ^ `.h^`.hSLS^S`L.h##^#`.h^`.hL^`L.`^``o(.^`o()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h ^`OJQJo(h pp^p`OJQJo(h @ @ ^@ `OJQJo(h ^`OJQJo(oh ^`OJQJo(h ^`OJQJo(h ^`OJQJo(oh PP^P`OJQJo(h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.h88^8`.h^`.h L ^ `L.h  ^ `.hxx^x`.hHLH^H`L.h^`.h^`.hL^`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.0^`0o(.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h ^`OJQJo(h^`)h pp^p`OJQJo(h @ @ ^@ `OJQJo(h ^`OJQJo(oh ^`OJQJo(h ^`OJQJo(h ^`OJQJo(oh PP^P`OJQJo(^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`o()^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.h^`.h^`.hpLp^p`L.h@ @ ^@ `.h^`.hL^`L.h^`.h^`.hPLP^P`L.h^`.^`o()pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`5o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.808^8`0.^`.pp^p`.@ @ ^@ `.^`.^`.^`.^`.PP^P`.^`o(.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.^`.^`.pLp^p`L.@ @ ^@ `.^`.L^`L.^`.^`.PLP^P`L.-(,\YKU(uR-3+`}_c5`p\; G9pc%[5I?/I-8CS<0&K;``pu ;O\G3UJUsw^FO/y<Sv=%c,qg^:N[|2V vT3>C"3Or 9Y3}e*\WoH!=9:!D/\+ C&< !Y@nX|dw2#gp I^c24*"Ft.9?/'nFV,`3m?a0paf^x}WQ;!O}q~ :q k @Y}J@"Si OvIJb'h>Yth!PZjWN]kgE(y<9'5\w):F3H:Bj%(r8d.R^%"BrohmC}H!o6{.qNW?n^96qD N`.(ci5QUyCVe[KE/ rH6oF %>+&&UnRq+ O 4'yiM_@H;s5"d 9' 1[#CdCY_~qb{2ob3T<*q04 <9h?=g`.Kmq[-U`YC!'\^`bdhkmost~.WY[]_abehlmw         & G I K M O Q R U X \ ] c f h k n r v z ~  . = P Q R ] g i k m t |     7 9 ; = ? C F H J N O Y v x z | ~          ! * I K M O Q S U X [ _ ` i   !$&),048<ABKt  68:<>BEGIMNW{}8:<>@DGIKOPnox $&(*,.036:;DPRTVXZ\_bfgmprtw{  )>@BDFJMOQUV` &(*,.2579=>Hwy{} )+-/1358;?@J[]_acegjmqr|  !"-79;=DLQX]deo!#%)*4MOQSUY\^`deo "$&(+.23<VXZ\^`behlmw  !#%')+-./069;=@DHLPUV^!$&(,-7NPRTVZ]_aefp!#%')-02489WXbz|~  #%')+-/259:DZ\^`bdfilpqwz|    "$&-5:AFMNX!#%'+.0267>QSUWY]`abfgn !"#&)-.8ikmoqsux{*+3GOtu} ( 8 9 A X ` y z !!*!+!3!G!O!t!u!}!!!!!!!!!!" "("8"9"A"X"`"y"z""""""""""""""""k$w$$$$$$$$$%%+%;%P%c%d%%%%/////// 0 0#0V0W0q000001.1/1=========>)>*>D>T>i>{>|>>???!L-L5LCLSLTLgLLLLLLLM#M6M7MMMMbanawaaaaaaaa b b%b5bJb]b^bbbbm mm#m3m4mGmtmummmmmmnnnnnn www-w=w>wQwewfwwwwwwwwwx^xmxxx'3;IYZmŅƅ:ʏˏޏKLfu ./ʚٚښLMgv 01ɢ 89Sbw˭'(BQfxy=IQ_op "45_ks!1EWX )*Cuv?NO$-;LM`$%&4DEXvwFRZhxy!6IJ(EF_\pq +;<Oefjy####$$$-$.$G$a$b$|$$$$$$%*%>%?%P*\*d*r*********+!+7+I+J+k+++++0000000111L1M1g1v1111122(2)288888889909\9]9w999999:$:8:9:?#?+?9?H?I?\?w?x???????@ @*@q@@@@[DgDoD}DDDDDDDE E#E3EHE[E\EEEEQ QQ(Q6Q7QJQaQbQ{QQQQQQQRwRRR\\\ ]]]-]S]T]m]]]]]]]]g^v^w^iiijjj&jCjDj]jjjjjjjjZkikjkt tt(t8t9tLt^t_txtttttttttuuu'3;IYZm΃σ !ŏ2AUghϐސ$0?M\]p̘͘ ?R^ky͢΢ (7L^_ƣգ;GTbqr./P?KXfvw,>?45O_t  ,PQjdst<HUcst+=>C O W e u v         0 C D    9EN\lm3FG$40484F4U4V4i444444445!5"5C55555C<O<W<e<t<u<<<<<<<=!=6=H=I=j=====BC CC(C)CHMHNHaHmHnHHHHHHH I I.ItIIIIM#M+M9MHMIM\MrMsMMMMMMMNNNNN^^^^^^_!_"_;_n_o______8`G`H`jjjjjjjjjkKkLkfkvkkkkl$l%lvvwwww2wDwEw^wwwwwwwwZxixjx҇އ+,EwxʈˈAPQ#1ABUВђ#$͢٢56Oz{ˣ̣-AB%CD]ȫګ۫8G[\ϯ%&@Odwx԰µʵص+:OabxĶضٶ!)7HI\|}ȹɹ+:;TP_`S_gu3CXjkgs{.>Sef78Rbw6hi2AB2KLe=L`a2LMf>MabAMUcrs)8N`aw6%B%J%X%g%h%{%%%%%%% & &3&4&J&&&&&+++++++++++ ,,,L,k,l,....../!/"/;/n/o//////70F0G0DDD)D:D;DNDgDhDDDDDDDEE}EEENNNN O OO0O1OJO}O~OOOOOOFPUPVP^^^^^^^ _ _%_W_X_r_____!`0`1`rj~jjjjjjjjjkk)k8kMk_k`kvkkkkkwww%w4w5wHwkwlwwwwwwwxxx_xnxxx{{||"|#|6|R|S|l|||||||||E}T}h}i}Ā̀ڀ Uez{Ăقڂ*+A2>FTefyنچ+,'FG`Ӓ\jk 01DPQjƗۗetu !23Fhiϣߣ}ʮ߮+,FVk}~ϳ23M]r   "34G\]vĿԿr&':EF_\kl "TUo-.frz0@UhiCD^n 01K[p   ->?R"#JKd`op((()))+)K)L)e))))))))a*p*q*(545<5J5Y5Z5m555555 6 6t??????????@&@;@<@;AGAOA]AlAmAAAAAAA B BB{BBBBjGvG~GGGGGGGG"H#H=HMHbHtHuHHHHLLLLLLLLL M=M>MXMhM}MMMNNNQQQQQQQRR!RTRURoRRRRRS,S-S?cKcScacrcscccccccc d"d4d5ddddkmwmmmmmmmmmnn3nCnXnjnknnnn:zFzNz\zmznzzzzzzzz { {2{3{{{{-.AUVoͅkz{’Ò֒34N^s  ~ŗ՗֗!"<LastǢآ٢!STn~+,ʧۧܧRSm}*+¬ӬԬPQk{)*ļмؼ $%>pq½ý9HINZbp 1CD/@fP.@Unknown G:Times New Roman5Symbol3& :Arial?5 :Courier NewK,Bookman Old Style5& :TahomaW& ??Arial Unicode MSTahomaQGeorgiaBook Antiqua;Wingdings"1hPykz&kz&kG Y0d 2QDIRECTORDIRECTOR Oh+'0l   ( 4 @LT\dss DIRECTOR IRENormalR DIRECTOR 107Microsoft Word 9.0@v6@B@8}~@BG ՜.+,D՜.+,0 hp  UIITw   Title 8@ _PID_HLINKSA0^ZJhttp://203.58.197.209/acs/events admin/static/national/pospaper/code2.htmy Lhttp://203.58.197.209/acs/events admin/static/national/pospaper/acs 131.htm.*,http://www1.bcs.org/docs/01100/1194/Cop.htm'; 3http://www.bcs.org/docs/01100/1194/pdg/codeofc.pdfQ_ :http://www.rsasecurity.com/rsalabs/pkcs/pkcs-7/indes.htmlUT5http://www/w3.org/Security/Faq/www-security-faq.htmli8http://www.hackers.com/4=http://www.seeinf.com/  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                           ! " # $ % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 8 9 : < = > ? @ A B D E F G H I J _ Root Entry FBa Data 1TableGWordDocument SummaryInformation(; DocumentSummaryInformation8C CompObjjObjectPoolBB  FMicrosoft Word Document MSWordDocWord.Document.89q