National Institute of Technology Calicut

CSU 363 COMPUTATIONAL INTELLIGENCE

Pre-requisite: CSU 203 Data Structures & Algorithms

L	T	P	C
3	0	0	3

 

Module I (12 Hours)

Artificial Intelligence: History and Applications, Production Systems,Structures and Strategies for state space search- Data driven and goal drivensearch, Depth First and Breadth First Search, DFS with Iterative Deepening,Heuristic Search- Best First Search, A* Algorithm, AO* Algorithm, ConstraintSatisfaction, Using heuristics in games- Minimax Search, Alpha BetaProcedure.

 

Module II (11 Hours)

 Knowledge representation - Propositional calculus, Predicate Calculus, Theorem proving by Resolution, Answer Extraction, AI Representational Schemes- Semantic Nets, Conceptual Dependency, Scripts, Frames, Introduction to Agent based problem solving.

Module III (11 Hours)

 Machine Learning- Symbol based and Connectionist, Social and Emergentmodels of learning, The Genetic Algorithm- Genetic Programming, Overview of Expert System Technology- Rule based Expert Systems, Introduction to Natural Language Processing.

Module IV (8 Hours)

 Languages and Programming Techniques for AI- Introduction to PROLOG and LISP, Search strategies and Logic Programming in LISP, Production System examples in PROLOG.

References

1.George.F.Luger, Artificial Intelligence- Structures and Strategies for Complex Problem Solving, 4/e, 2002, Pearson Education.

2. E. Rich, K.Knight, Artificial Intelligence, 2/e, Tata McGraw Hill

3. Winston. P. H, LISP, Addison Wesley

4. Ivan Bratko, Prolog Programming for Artificial Intelligence, 3/e, Addison Wesley, 2000

CSU 371 LOGIC FOR COMPUTER SCIENCE
Pre-requisite: CSU305 Theory of Computation

L	T	P	C
3	0	0	3

Module I (11 hours)

Propositional logic, syntax of propositional logic, main connective, semantics of propositional logic, truth tables and tautologies, tableaus, soundness theorem ,finished sets, completeness theorem,.
Module II (12hours)

Predicate logic, syntax of predicate logic, free and bound variables, semantics of predicate logic,, graphs, tableaus, soundness theorem, finished sets, completeness theorem, equivalence relations, order relations, set theory.

Module III (14 hours)

Linear time Temporal Logic(LTL), syntax of LTL, semantics of LTL, Buchi Automata, Buchi recognizable languages and their properties, Automata theoretic methods, Vardi-Wolper Construction, Satisfiability problem of LTLl, Model checking problem of LTL.

Module IV ( 6hours)

Software Veification: Tools used for software verification.SPIN and SMV. Introduction to both tools. Method of verification by the tools.

References:

8. 
   1. Jerome Keisler H. Joel Robbin, Mathematical Logic and Computability, McGraw-Hill International Editions, 1996.
   
9. 
   2. Papadimitriou, C. H., Computational Complexity, Addison Wesley, 1994
   
10. 
    3. Gallier, J. H., Logic for Computer Science: Foundations of Automatic Theorem Proving,, Harper and Row, 1986.
    

CSU 334 WEB PROGRAMMING
Pre-requisite: CSU 304 Computer Networks

L	T	P	C
3	0	0	3

Module I (10 hours)

Internet and WWW, Creating Web Graphics, HTML, Paintshop, Photoshop, FrontPage, Introduction to XHTML, Cascading Style Sheets.

Module II (12 hours)

Introduction to Scripting, JavaScript: Control Statements, Functions, Arrays, Objects, Dynamic HTML: Object Model and Collections, Filters and Transitions, Data Binding with Tabular Data Control

Module III (10 hours)

Building Interactive Animations, Extensible Markup Language (XML), Web Servers, Database: SQL, MySQL, DBI and ADO.NET,

Module IV (10 hours)

Active server pages, CGI and Perl, PHP, Case Studies.

1. 
   References:
   

1. 
   H. M. Deitel, P. J. Deitel and T. R. Nieto, Internet and World Wide Web: How To Program, Pearson Education, 2000.
   
2. 
   Harvey Deitel, Paul Deitel, Tem Nieto, Complete Internet & World Wide Web Programming Training Course, Student Edition, 2/e, Prentice Hall , 2002