2003 Course - K. K. Wagh Education Society
2003 Course - K. K. Wagh Education Society 2003 Course - K. K. Wagh Education Society
Code Optimisation Introduction, Classification of optimisation, Principle sources Of Optimisation, optimisation of basic blocks, Loops in flow graphs, Optimising transformations: compile time evaluation, Common sub-expression elimination, variable propagation, code movement, strength reduction, dead code elimination and loop optimisation, Local optimisation, DAG based local optimisation. Global Optimisation: Control and data flow analysis, Computing Global Data flow information: meet over paths, Data flow equations, Data flow analysis, Iterative data flow analysis: Available expressions, live range identification Text Books 8 Hours 1. A V Aho, R. Sethi, J D Ullman, “Compilers: Principles, Techniques, and Reference Books Tools”, Pearson Education, ISBN 81 – 7758 – 590 – 8 1. K. Cooper, L. Torczon, “Engineering a Compiler”, Morgan Kaufmann Publishers, ISBN 81 – 8147 – 369 – 8 2. K. Louden, “Compiler Construction: Principles and Practice”, Thomson Brookes/Cole (ISE), 2003, ISBN 981 – 243 – 694 – 4 3. J. R. Levine, T. Mason, D. Brown, “Lex & Yacc”, O’Reilly, 2000, ISBN 81–7366 – 062 – X 4.S. Chattopadhyay, “Compiler Design”, Prentice-Hall of India, 2005, ISBN 81– 203–2725-X. 410445 Artificial Intelligence Teaching Scheme Lectures :4 Hrs/Week Examination Scheme Theory :100 Marks Practical. : 2 Hrs/Week Term Work : 25 Marks Oral : 50 Marks Duration : 3 Hrs Objectives • To understand the concepts of Artificial intelligence
• To Learn and Understand the knowledge representation techniques for knowledgebase • To Learn and Understand the fundamentals of Neural Network UNIT I : Introduction Definition, What is A.I ? Foundation of A.I., History, intelligent Agents, Agent Architecture, A.I. Application(E Commerce, & Medicine), A.I. Representation, Properties of internal representation . Futures of A.I ,Production System , Issue in design of search Programs Logic Programming Introduction , Logic, Logic Programming, Forward and Backward resoning , Forward and Backward chaining rules 8 Hrs UNIT II : Heuristic search techniques. Heuristic search, Hill Climbing, Best first search, mean and end analysis, Constraint Satisfaction, A* and AO* Algorithm. Game playing Minmax search procedure, Alpha beta cutoffs, waiting for Quiescence, Secondary search. 7 Hrs. UNIT III : Knowledge Representation Basic of Knowledge representation, Knowledge representation Paradigrams, Propositional Logic, Inference Rules in Propositional Logic, Knowledge representation using Predicate logic : Predicate Calculus, Predicate and arguments, ISA hierarchy, Frame notation , Resolution , Natural Dedication
- Page 1 and 2: Structure of B.E (2003 Course):- De
- Page 3 and 4: UNIT II: Divide And Conquer And Gre
- Page 5 and 6: Background, Critical section proble
- Page 7 and 8: Teaching Scheme Lectures: 3 Hours /
- Page 9 and 10: • To learn issues in modeling lar
- Page 11: Error detection and recovery, Autom
- Page 15 and 16: Utilization and functionality, arch
- Page 17 and 18: UNIT IV : Segmentation : Region Ext
- Page 19 and 20: Introduction, Parallel database arc
- Page 21 and 22: • Learn key concepts of Multimedi
- Page 23 and 24: screening, color cycling, morphing
- Page 25 and 26: PART II: Assignments related to Ope
- Page 27 and 28: The project will be undertaken pref
- Page 29 and 30: Principles, RSA, ECC, DSA, key mana
- Page 31 and 32: UNIT III: Vector and Array Processo
- Page 33 and 34: . http://www.ibm.com/servers/eserve
- Page 35 and 36: Fix Distribution: Overview of Fix D
- Page 37 and 38: Text Books: 1. Andrew S. Tanenbaum
- Page 39 and 40: Text Books 1. Rajkamal, “Embedded
- Page 41 and 42: Conceptual view of ISDN and ISDN st
- Page 43 and 44: Understanding quality attributes, a
- Page 45 and 46: 2. Submit a IDL definition for a fe
- Page 47: Computer Laboratory II Assignment N
Code Optimisation<br />
Introduction, Classification of optimisation, Principle sources Of Optimisation,<br />
optimisation of basic blocks, Loops in flow graphs, Optimising transformations: compile<br />
time evaluation, Common sub-expression elimination, variable propagation, code<br />
movement, strength reduction, dead code elimination and loop optimisation, Local<br />
optimisation, DAG based local optimisation. Global Optimisation: Control and data flow<br />
analysis, Computing Global Data flow information: meet over paths, Data flow equations,<br />
Data flow analysis, Iterative data flow analysis: Available expressions, live range<br />
identification<br />
Text Books<br />
8 Hours<br />
1. A V Aho, R. Sethi, J D Ullman, “Compilers: Principles, Techniques, and<br />
Reference Books<br />
Tools”, Pearson <strong>Education</strong>, ISBN 81 – 7758 – 590 – 8<br />
1. K. Cooper, L. Torczon, “Engineering a Compiler”, Morgan Kaufmann Publishers,<br />
ISBN 81 – 8147 – 369 – 8<br />
2. K. Louden, “Compiler Construction: Principles and Practice”, Thomson<br />
Brookes/Cole (ISE), <strong>2003</strong>, ISBN 981 – 243 – 694 – 4<br />
3. J. R. Levine, T. Mason, D. Brown, “Lex & Yacc”, O’Reilly, 2000, ISBN 81–7366<br />
– 062 – X<br />
4.S. Chattopadhyay, “Compiler Design”, Prentice-Hall of India, 2005, ISBN 81–<br />
203–2725-X.<br />
410445 Artificial Intelligence<br />
Teaching Scheme<br />
Lectures :4 Hrs/Week<br />
Examination Scheme<br />
Theory :100 Marks<br />
Practical. : 2 Hrs/Week Term Work : 25<br />
Marks<br />
Oral : 50 Marks<br />
Duration : 3 Hrs<br />
Objectives<br />
• To understand the concepts of Artificial intelligence
Change language