UNIVERSITY OF CALICUT (Abstract)

Scheme and Syllabus of M.Sc.Information Technology programme of affiliated colleges under Credit Semester System (CUCSS-PG-2010) – approved - implemented with effect from 2012 admissions - orders issued.

GENERAL & ACADEMIC BRANCH-IV ‘J’ SECTION

No. GA IV/J1/4639/2010 Dated, Calicut University PO, Read: 1. U.O.No.GAIV/J1/1373/08 dated 23.07.2010. 2. Item No.4 of the minutes of the meeting of the Board of Studies in Computer Science (PG) held on 27.07.2012. 3. Order of the Vice-Chancellor in the file of even number on 07.10.2012.

O R D E R

As per paper read as (1) above, Credit Semester System at Post Graduate level in affiliated colleges (CUCSS-PG-2010) has been implemented from the Academic year 2010 onwards. As per paper read (2) above, the Board of Studies in Computer Science (PG) in its meeting held on 27.10.2012 as recommended to approve the syllabus of M.Sc Information Technology.

As per reference cited 3rd The Vice-Chancellor in view of exigency, exercising the powers of Academic Council has approved the syllabus for implementation subject to ratification by the Academic Council.

Sanction has therefore been accorded to implement the syllabus of M.Sc. Information Technology Programme under CUCSS PG in affiliated colleges with effect from 2012 admission onwards.

Orders are issued accordingly. Sd/- ASSISTANT REGISTRAR (G&A IV) For REGISTRAR To

The Principals of affiliated colleges offering M.Sc.Information Technology.

Copy to: PS to VC/PA to Registrar/CE/Digital / Enquiry/Information centres/DR III Exams/EG I/DR PG/ Tabulation Section/GA I ‘F’ ‘G’ sections / GAII/GAIII /DDLFA/SF/FC

E:\J1\order\4639 09.10.2012.doc

Forwarded/ By Order SECTION OFFICER

1

UNIVERISTY OF CALICUT

Regulations, Scheme of Evaluation Course, Structure Syllabus for M.Sc. Information Technology

Under CUCSS (with effect from 2012 Admission)

REGULATIONS

1. Duration of the course shall be 2 years, divided into 4 semesters. The entire period of the fourth semester is for Project Work.

2. Selection and Eligibility for Admission is same as MSc Computer Science , based on the existing university rules.

3. Evaluation of all semester theory papers will be on the basis of CUCSS norms.

4. Conduct of Practical Examinations: Odd semester Practical Examinations will

be conducted internally by the Department and Even Semester Examinations will be conducted by the Controller of Examination.

5. Project Work & Viva: The Project work should be carried out over the period of 24 weeks in the final semester in an Industry / R & D organization / epartment/Institution. If the project is carried out in an Industry / R & D organization out side the campus, then a co-guide shall be selected from the Department/ Institution concerned. Every student should do the Project individually and no grouping is allowed. All the candidates are required to get the approval of their synopsis and the guide before commencement of the project from the Department / Institution and the matter may be intimated to the university at the beginning of the semester by the Department / Institution. The project will be reviewed periodically every month by the Department / Institutional. The continuous assessment marks (CA) will be based on the periodic progress and progress report. At the end of the semester the candidate shall submit the Project report ( two bound copies and one soft copy ) duly approved by the guide, co-guide for End Semester Assessment. Evaluation for ESA should be conducted by a board of examiners appointed by the University. (Mark Distribution : Content 30% + Methodology 30 % + Presentation 20 %, and Via- voce 20 % ). If project work and the report are found to be not up to the expected standard, the examiners can ask the candidate to modify and resubmit the project report after incorporating the suggestions of the examiners. Such reports shall be resubmitted within the stipulated period suggested by the examiner(s).

2

University Of Calicut M. Sc Information Technology

Course Structure, Scheme & Syllabus : (Credit Semester System 2012 Admission Onwards)

Semester I

Total Credit 24

Subject Code

Subject Title

Instructional Hours/week Marks

Theory Practical Total Internal Final Credit

IT1C01 Mathematical Foundations of Computer Science

4 0 4 25 75 4

IT1C02 Advanced Data Structures and Algorithms

3 1 4 25 75 4

IT1C03 Visual Programming

2 2 4 25 75 4

IT1C04 Logic Design

4 0 4 25 75 4

IT1C05 Computer Organization

3 2 4 25 75 4

IT1P06 Lab 1: 1. Data

Structures using C++. 2. Visual Progrmming

0 4 4 25 75 4

3

Semester II

Total Credit 24

Subject Code

Subject Title

Instructional Hours/week Marks

Theory Practical Total Internal Final Credit

IT2C01 Design and Analysis of Algorithms

4 0 4 25 75 4

IT2C02 Advanced Database Management System

4 0 4 25 75 4

IT2C03 Computer networks 4 0 4 25 75 4

IT2C04 Object oriented Programming with Java

4 0 4 25 75 4

IT2E05/ IT2E06/ IT2E07

Elective 1

4 0 4 25 75 4

IT2P06 Lab II: 1. DBMS 2. Java

Programming

0 4 4 25 75 4

4

Semester III

Total Credit 24

Subject Code

Subject Title

Instructional Hours/week Marks Theory Practical Total Internal Final Credit

IT3C01 Principles of Compiler Design

4 0 4 25 75 4

IT3C02 .Net Technology 4 0 4 25 75 4

IT3C03 Software Engineering

4 0 4 25 75 4

IT3C04 Web Programming using PHP

4 0 4 25 75 4

IT3E05/ IT3E06/ IT3E07

Elective 2

4 0 4 25 75 4

IT3P06 Lab III: 1. ASP.Net 2. PHP

0 4 4 25 75 4

5

Semester IV

Total Credit 8

Subject Code

Subject Title

Duration of the project

Marks Internal Final Credit

IT4C01 Project & Viva 180 days 40 160 8

6

Evaluation and Grading (as done in B.Sc CCSS): All gradings starting from the evaluation of papers is done on 5 point scale (A, B, C, D, E) and SGPA and CGPA – between 0 to 4 and in two decimal points. CGPA in 7 point scale 3.8 to 4.0 –> A+ , 3.5 to 3.79 –> A, 3.0 to 3.49 –> B+, 2.5 to 2.99 –> B, 2.2 to 2.49 –> C+, 1.5 to 2.19 -> C, below 1.5 ->D Internal – weightage (wt) =1 (25%) and External – wt=3 (75%)

1. Internal evaluation (must be transparent and fair):

Theory: (a) Tests – wt=2 (at least 2 tests with 50% Problems) (b) Tutorial on assignments and Exercises – wt=1 (c) Seminars and Viva Voce – wt=1 1. Attendence – wt=1 Practicals: (a) Tests – wt=2 (b) Lab. skill/quality of their results – wt=1 (c) Viva Voce – wt=1 Project: (a) Monthly progress – wt=2 (b) Regularity and attendence – wt=1 (c) Seminar and Viva Voce – wt=1

2. External evaluation:

Theory: Every semester. Pattern of question Papers: Part A: Short answer type - 12 questions (No choice) – wt=1 (12x1=12) Part B: Short Essay type -Answer any 6 out of 9 -wt =2 (6 x2=12) Part C Essay type /Prorams/psuecode/problems type – 3 out of 6 – wt=4 (3x4=12) Answer to each question may be evaluated based on (a) Idea/knowledge – wt=1 (b) Logic/steps – wt=1 (c ) Analytic skill – wt=1 (d) Correctness – wt=1

1. Directions for question paper setters:

Part A: Set each questions to be answered in 7 minutes duration and should extract the critical knowledge acquired by the candidate in the subject.

Part B: 30 minutes answerable questions each. May be asked as a single question or parts. Derivation type questions can be also asked.

7

IT1C01 – MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

UNIT I Matrices : Definition – Types of Matrices – Basic operations in Matrix – Determinants –Properties of Determinants – Inverse of a Matrix – Finding Eigen values and vectors – Cayley – Hamilton theorem. UNIT II Set Theory: Basic set operations – Relations – Types of Relations – Representation of relations in matrix form – Composition of relations – Functions – Types of functions – Principle of mathematical induction. Boolean Algebra: Definition – Sub Boolean algebra – Boolean functions and Boolean Expression. UNIT III Mathematical Logic : Introduction – Connectives, NAND & NOR connectives –Tautology and Contradiction – Truth tables – Logical Networks – Normal forms – Principal disjunctive normal form – Principal conjunctive normal form – Equivalence formulae – Indirect method of proof. Predicate calculus, free and bound variables, inference theory for predicate calculus. UNIT IV Graph Theory : Graphs, Diagraph – Types of graph – Simple theorems – Definitions of paths, reach ability – Matrix representation – Shortest path problem – Binary trees – Traversal of binary trees – Expression trees – Infix, postfix, prefix expressions. UNIT V Grammars and Language : PSG – Types of grammars – Productions – Regular grammar and languages – Finite State Automata (FSA) – Deterministic and Non deterministic FSA –Conversion of NDFSA to DFSA. Reference Books: 1. M.K. Venkatraman, “Engineering Mathematics”, Vol II, National Publishing Co. 2. Hopcraft & Ullman , “Introduction to Automata Theory, Languages & Computation”, II edition, Pearson Education. 3. Tremblay & Manohar, “Discrete Mathematical structures with applications to computer science”, TMH. 4. J.K. Sharma, “Discrete Mathematics, Macmillan India, Ltd., 2003. 5. P. Radha, T. Santha, “Discrete Mathematics for Computer Science & Applications”, Kalaikathir Publications, , 2003. 6. M. Vijayaraghavan, “Foundations of Mathematics”, Scitech, 2001.

8

IT1C02 - ADVANCED DATA STRUCTURES AND ALGORITHMS

Unit I Introduction: Introduction of Algorithms, Analysing Algorithms. Arrays: Spare Matrices– epresentation of Arrays. Stacks and Queues. Fundamentals – Evaluation of Expression Infix to Postfix Conversion – Multiple Stacks and Queues – Perform Analyse the Algorithms. Unit II Linked List: Singly Linked List – Linked Stacks and Queues – Polynomial Addition –More on Linked Lists – Sparse Matrices – Doubly Linked List and Dynamic – Storage Management – Garbage Collection and Compaction. Trees: Basic Terminology – Binary Trees – Binary Tree Representations – Binary Trees – Traversal – More on Binary Trees – Threaded Binary Trees – Binary Tree Representation of Trees – Council Binary Trees. Graphs: Terminology and repersentations – Traversals, Connected Components and Spanning Trees – Shortest Paths and Transitive Closure – Perform Analyse the Algorithms.

Unit III Internal Sorting: Insertion Sort – Quick Sort – 2 Way Merge Sort – Heap Sort – Shell Sort – Sorting on Several Keys. External Sorting: Storage Devices – Sorting with Disks: K-Way Merging – Sorting with Tapes – Perform Analyse the Algorithms. Unit IV Symbol Tables: Static Tree Tables – Dynamic Tree Tables – Hash Tables: Hashing Functions – Overflow Handling. Files: Files, Queries and Sequential organizations – Index Techniques – File Organizations. Unit V Case Study: Recursion – Towers of Hanoi – Simulation of an Airport – Pattern Matching in strings – Game Trees. Reference Books: 1. Ellis Horowitz, Sartaj Shani, “Data and File Structures” Galgotia Publication. 2. Ellis Horowitz, Sartaj Shani, Sanguthevar Rajasekaran, “Computer Algorithms”, Galgotia Publication. 3. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Pearson Education Asia, Second Edition. 4. Robert Kruse, C.L.Jondo, Bruce Leung, “Data Structures and Program Design in C”, PHI/Pearson Education Asia, Second Edition. 5. Gregory L. Heileman, “Data Structures Algorithms and Object Oriented Programming” Tata McGraw Hill Publication Company Ltd. 6. Tremblay Sorenson, “An introductions to Data Structures with Applications”, 2nd Edition, Tata McGraw Hill Pub Company Ltd. 7. Dr.M.Murugan, “Graph Theory and Algorithms”, Muthali Pub. House, Chennai, 2003.

9

IT1C03 -VISUAL PROGRAMMING

Unit I Introduction to visual programming - Concept of event driven programming – Introduction to VB .Net environment, The .NET Framework and the Common Language Runtime. Building VB.NET Applications, The Visual Basic Integrated Development Environment. Forms- properties, events. The Visual Basic Language- Console application and windows application, Data types,Declaring Variables, scope of variables, operators and statements.

Unit II Making Decisions with If…Else Statements, Using Select Case, Making Selections with Switch and Choose, Loop statements – Do Loop,for, while- The With Statement- Handling Dates and Times- Converting between Data Types- Arrays – declaration and manipulation- Strings & string functions - Sub Procedures and Functions.

Unit III Windows Applications-Forms- Adding Controls to Forms, Handling Events, MsgBox , InputBox, Working with Multiple Forms, Setting the Startup Form, SDI &MDI Forms, Handling Mouse & Keyboard Events, Common controls (Text Boxes, Rich Text Boxes, Labels, Buttons, Checkboxes, Radio Buttons, Group Boxes, List Boxes, Checked List Boxes, Combo Boxes, Picture Boxes, Scroll Bars, Tool Tips, Timers) - properties –methods Unit IV Object-Oriented Programming - Creating and using Classes & objects - Handling Exceptions- On Error GoTo- Raising an Exception- Throwing an Exception- Using Structured Exception Handling – Debugging and tracing Unit V Data Access with ADO.NET- Accessing Data with the Server Explorer- Accessing Data with Data Adaptors and Datasets- Creating a New Data Connection- Creating and populating Dataset- Displaying Data in a Data Grid- Selecting a Data Provider- Data Access Using Data Adapter Controls- Binding Data to Controls- Handling Databases in Code – Binding to XML data Text Books:

1. Visual Basic .NET Black Book, by Steven Holzner

Reference Books 1. VB.NET for developers, By Keith Franklin, Rebecca Riordan, SAMS. 2.. Sams Teach Yourself Visual Studio .NET 2005 in 21 Days, By Jason Beres 3. Learning Visual Basic .NET by Jesse Liberty 4. Visual Basic .Net programming in easy steps BY TIM ANDERSON, DreamTech Press

10

IT1C04 LOGIC DESIGN

Unit I Number Systems and codes - 1's and 2's Complement Representation of Signed Numbers - Binary Arithmetic - Logic gates – Universal property of NAND and NOR gates - Boolean Algebra - Simplification using Boolean Algebra - Standard forms of Boolean Expressions – Sum of Products and Product of Sums - Karnaugh Maps. Unit II Analysis and design of Combinational logic circuits - Adders - Decoders and Encoders - Code converters - Multiplexers and Demultiplexers. Sequential Logic circuits: Flipflops - Synchronous and Ripple Counters - Gray code counters – Shift Registers. Unit III Historical Background of microprocessors - Architecture of 8088 and 8086 - Addressing modes - Instruction set - Assembly Language Programming with MASM. Unit IV The Memory and I/O Interfaces of 8086 and 8088 Microprocessors - Memory Devices - I/O interface circuits and LSI peripheral devices - 8255 PPI - 8254 PIT - 8237 DMA controller - 8250 UART – 8279 Keyboard and display controller. Unit V Hardware and Software Interrupts of 8086 and 8088 - 8259 PIC. Introduction to 8051 8-bit Micro controller. Text Books:

1. Digital Fundamentals - T.L.Floyd and R.P.Jain (Modules I and II) 2. The 8088 and 8086 Microprocessors: Programming, Interfacing, Software, Hardware

and Applications, Walter A Triebel and Avtar Singh (Modules III, IV and V) 3. The 8051 Micro Controller and Embedded Systems -Muhammed Ali Mazidi and Janice G Mazidi (Module V) Reference Books 1.Microprocessor and Interfacing: Programming and Hardware. - D.V Hall 2.Microcomputer Systems: The 8086/8088 Family, Architecture, Programming, and Design - Yu-Cheng Liu and Glenn A. Gibson, Prentice Hall, Inc.

11

IT1C05 COMPUTER ORGANIZATION

Unit I Computer abstraction and technology: below your program, under the covers, historical perspective. Measuring performance: relating the metrics, evaluating, comparing and summarizing performance, Case study: SPEC95 benchmark. Instructions: operations and operands of the computer hardware, representing instructions, making decision, supporting procedures, beyond numbers, other styles of addressing, starting a program, Case study: 80x86 instructions.

Unit II Computer arithmetic: signed and unsigned numbers, addition and subtraction, logical operations, constructing an ALU, multiplication and division, floating point, Case study: floating point in 80x86. Unit III The processor: building a data path, simple and multicycle implementations, microprogramming- exceptions, Case study: Pentium Pro implementation Unit IV Memory hierarchy: caches, cache performance, virtual memory, common framework for memory hierarchies, Case study: Pentium Pro memory hierarchy. Unit V Input/output: I/O performance measures, types and characteristics of I/O devices, buses, interfaces in I/O devices, design of an I/O system. Text Book

1.Pattersen D.A. & Hennesy J.L., Computer Organisation & Design: The Hardware/Software Interface, Harcourt Asia.

Reference Books

1.Heuring V.P. & Jordan H.F., Computer System Design & Architecture, Addison Wesley

2.Hamacher, Vranesic & Zaky, Computer Organisation, McGraw Hill

12

IT1PO6 – PRACTICAL- 1

Unit I : Data Structures and Algorithms Implement the following

1. Array Creation and Operations. 2. Stack and Queue Operations. 3. Recursion, Infix to Postfix Conversion. 4. Polynomial Addition using Singly Linked List. 5. Doubly Linked List Operations. 6. Tree Traversals 7. Graph – Shortest Path 8. Searching – Linear, binary, Fibonacci 9. Sorting – Radix, shell, Quick, Heap, Merge

Unit II :Visual Programming

1. To display n prime numbers. 2. To check whether the given string is palindrome or not. 3. To generate strange numbers with in a range. 4. To check whether a number is prime or not and strange or not using radio buttons. 5. To add, remove, and search items in a list box. 6. To sort a set of numbers using list box control with out using sort property. 7. To add, remove and search items in a combo box. 8. To design a user interface with multi line text box and perform copy, cut, paste, undo,

and select all operations. 9. To illustrate open file dialog, font dialog, and save dialog. 10. To view the records in a student table using ADO.NET. 11. To read and display the details (regno, name, grade1, grade2, grade3) of n students using

class and objects. 12. To design a windows application using HScrollBar and VScrollBar that allows the user to

resize the size of an image displayed in a picturebox control. 13. To create a stop watch using Timer control

13

IT2C01– DESIGN AND ANALYSIS OF ALGORITHMS

UNIT I Pre-requisites: Data structure & Discrete structures, models of computation, algorithm analysis, order architecture, time space complexities average and worst case analysis. UNIT II Divide and conquer: Structure of divide-and-conquer algorithms: examples; Binary search, quick sort, Strassen Multiplication; Analysis of divide and conquer run time recurrence relations. Graph searching and Traversal: Overview, Traversal methods (depth first and breadth first search) UNIT III Greedy Method: Overview of the greedy paradigm examples of exact optimization solution (minimum cost spanning tree), Approximate solution (Knapsack problem), Single source shortest paths.Brach and bound: LC searching Bounding, FIFO branch and bound, LC branch and bound application: 0/1 Knapsack problem, Traveling Salesman Problem, searching & sorting algorithms. UNIT IV Dynamic programming: Overview, difference between dynamic programming and divide and conquer, Applications: Shortest path in graph, Matrix multiplication, Traveling salesman Problem, longest Common sequence. Back tracking: Overview, 8-queen problem, and Knapsack problem UNIT V Computational Complexity: Complexity measures, Polynomial Vs non-polynomial time complexity; NP-hard and NP-complete classes, examples. Combinational algorithms, string processing algorithm, Algebric algorithms , set algorithms BOOKS 1. Ullman "Analysis and Design of Algorithm" TMH 2. Goodman “Introduction to the Design & Analysis of Algorithms, TMH-2002. 3. Sara Basse, A. V. Gelder, “ Computer Algorithms,” Addison Wesley 4. T. H. Cormen, Leiserson , Rivest and Stein, “Introduction of Computer algorithm,”

5. E. Horowitz, S. Sahni, and S. Rajsekaran, “Funadmentals of Computer Algorithms,” Galgotia Publication

14

IT2C02- ADVANCED DATABASE MANAGEMENT SYSTEM Unit I Database System Concepts, ER Datamodel, Relational data model and Relational database. Relational Database Query Languages- Basics of QBE and SQL. Integrity and security - domain constraints, referential integrity, assertions, triggers, authorization, views. Unit II Relational database design – Design Principles, Normalization, Normal Forms. Transactions - concepts, states of Transactions, ACID properties. Schedules - serial schedules, concurrent schedules, Serializability, Concurrency control protocols. Unit III Distributed Database systems- characteristics, architecture and challenges. Different approaches in database technologies - Object oriented and Object relational databases. Emerging trends in databases. Unit IV Case Study of MySQL – Creating/Altering/Dropping Database and tables, Data types, Operators and Functions, Data Definition and Manipulation Statements. Unit V Flow control constructs, CodeBlocks, Stored Procedures and Functions, Cursors, Triggers, Transactional and Locking statements, Account Management Statements.

Reference Books

1. Abraham Silbersehatz, Henry F. Korth and S.Sudarshan, Database system concepts,6th Edition, Tata McGraw-Hill 2010. 2. Elmasri and Navathe, Fundementals of Database systems, 5th Edition, Pearson, 2009. 3. Ramakrishnan and Gehrke, Database Management Systems, 3rd Edn, Mc Graw-Hill,2003 4. Vikram Vaswani, MySQL The complete Reference,1st Edition, Tata McGraw-Hill, 2004. 5. Paul DuBois, MySQL Cookbook, 2nd Edition, O'Reilly Media, 2006

15

IT2C03– COMPUTER NETWORKS Unit I Introduction - uses of computer networks – application – network hardware Local Area Networks: (LAN – MAN – WAN) Ethernet, Token Ring Media Access Control, Token Ring Maintenance, FDDI, Resilient Packet Ring, Wireless: Bluetooth, Wi-Fi, WiMAX- network protocols and standards, standards of organizations. Basic concepts : line configuration, topology, transmission mode, classifications. OSI model: functions of the layers Unit II Cell Phone Technologies. Circuit switching, Message switching, Packet Switching - Datagrams, Virtual circuit, source routing, Cell Switching - Cells, Segmentation and Reassembly, Virtual Paths, ATM design goals, Physical Layers for ATM.

Unit III Internetworking - Networking devices - Bridges, Routers, Gateways, Routing- Network as a graph, distance vector (RIP), link state (OSPF), Metrics, Routing for mobile hosts, Global Internet - Subnetting, CIDR, BGP, Routing areas. \

Unit IV Internetworking - IPv4 and IPv6, Multicast addresses, Multicast routing, DVMRP, PIM, MSDP, Multiprotocol label switching- Destination based forwarding, Explicit routing, virtual private networks and tunnels. Unit V End-to-End Protocols: Transport layer – duties, Simple Demultiplexer (UDP), Reliable byte Stream (TCP). end-to-end issues - segment format, connection establishment and termination, Triggering transmission, Adaptive retransmission, record boundaries. TCP extensions, Alternative design choices. Remote Procedure Call Fundamentals, RPC Implementation, Upper OSI layers - session layer, presentation layer, application layer. Text Books

1.Behrouz Forouzan, Introduction to data communication and networking, Tata McGraw- Hill Publishing Company Ltd. 2.L. Peterson & Bruce S. Davie, Computer Networks- A systems approach, 4/e Morgan Kaufmann publishers an imprint of Elsevier

Reference Books

1.Halsall F., Data Communication, Computer Networks and Open Systems, Addison Wesley. 2.Keshav S, An Engineering Approach to Computer Networking, AWL. 3.Andrew S. Tanenbaum, Computer Networks, PHI. 4.Leon-Garcia A. & Widjaja I., Communication Networks, Tata McGraw Hill

16

IT2C04 OBJECT ORIENTED PROGRAMMING WITH JAVA Unit I Introduction to Object Oriented Programming, Comparison with other programming paradigms, Java Basics: Java Programming environment, Structure of a java program, Life cycle of a java program, fundamental programming structures in Java: comments - data types – variables – operators – strings - Input and Output - control flow - Arrays. Unit II Data abstraction and Encapsulation - Objects and Classes: Predefined Classes - Defining Classes - Static Fields and Methods - Method Parameters - Object Construction - Packages. Inheritance: Classes - Super classes – Subclasses - Object: The Cosmic Superclass - Generic Array Lists -Object Wrappers and Auto-boxing – Reflection - Enumeration Classes. Interfaces and Inner Classes, Polymorphism: Overloading – Overriding.

Unit III Introduction to GUI: AWT Architecture - Light-Weight vs Heavy-Weight, AWT Event Hierarchy & Event Handling - Using Top-Levels – components and containers - Introduction to Layouts. Deploying Applets and Applications: Applet Basics - The Applet HTML Tags and Attributes – Multimedia - The Applet Context - JAR Files - Application Packaging.

Unit IV Exceptions and Debugging: Dealing with Errors - Catching Exceptions - Using Exceptions.Multi threaded Programming. Streams and Files: The Complete Stream - ZIP File Streams – Use of Streams – Object Streams - File Management. Unit V User Interface Components with Swing: Introduction to Layout Management - Text Input -Choice Components – Menus - Sophisticated Layout Management - Dialog Boxes. Java library. Database Programming: The Design of JDBC - The Structured Query Language – JDBC Installation - Basic JDBC Programming Concepts - Query Execution Reference Books: 1. Horstmann & Coronell, “Core Java “, Volume 1 and 2, 8th Ed., Pearson, 2008. 2. Herbert Schildt, “Java2 The Complete Reference”, Seventh Edition, Tata McGraw-Hill, 2007. 3. Bruce Eckel, “Thinking in Java”, Prentice Hall, Fourth Edition, 2006. 4. Kathy Sierra and Bert Bates, “Head first java”, Second Edition, Oreilly Media, 2005. 5. Y.Daniel Liang, “Introduction to Java Programming”, Eighth Edition, Pearson, 2011. 6. James. P. Cohoon, Jack. W. Davison, “Programming in java 5.0”, Tata McGraw Hill, 2006. 7. Thomas Wu, “An introduction to Object Oriented Programming with Java”, Tata McGraw Hill, 2006. 8. Bernard Van Haecke,”JDBC: Java Database Connectivity”, IDG Books India, 2000.

17

IT2E05- ARTIFICIAL INTELLIGENCE

Unit I Introduction: Definition and basic concepts, Aims ,Approaches, Problems in AI, AI applications perception and action, Representing and implementing action functions ,Production systems, Network problem solving Methods: Forward versus Backward reasoning ,Search in state spaces, State space graphs Uniformed search, Breadth First Search, Depth First Search, Heuristic search using evaluation functions, General graphs searching Algorithm, Algorithm A*, Admissibility of A*,The consistency condition, Iterative deepening A*,Algorithm AO*,Heuristic functions and search deficiency. Alternative search formulations and applications, Assignment problems, Constraint satisfaction, Heuristic repair, Two age games, the mini max search, Alpha Beta procedure, Game of chance. Unit II Knowledge representation, The propositional Calculus, Using constrains on feature values, language ,Rules of inference, Definition of Proof, semantics, Soundness and completeness, The Problem, Meta-theorems, Associative and Distributive laws, Resolution in propositional calculus, Soundness of Resolution, Converting arbitrary wffs to conjunction of clauses, Resolutions refutations, clauses. Unit III The Predicate calculus, Motivation, The language and its syntax, Semantics, Quantifications, Semantics of quantifiers, Resolution in predicate Calculus, Unification, Converting arbitrary wffs to clause form - using resolution to prove theorems, Answer extraction. Knowledge representation by networks - Taxonomy knowledge - Semantic networks, Frames, Scripts. Unit IV Neural Networks: Introduction, Motivation, Notation, The Back propagation method, Generalization and accuracy, reasoning with uncertain information, Review of Probability theory, Probabilistic inference, Bayes networks, Genetic programming, Program representation in GP, The GP process. Communication and integration, Interacting agents, A model logic of knowledge, Communication among agents, Speech acts, Understanding language strings, Efficient communication, Natural language processing Knowledge based Systems, Reasoning with Horn clauses, Rule based Expert systems.

Unit V Programming in LISP: Basic LISP primitives, Definitions, Predicates, Conditionals, And Binding, Recursion and Iteration ,Association lists, Properties and Data abstraction, Lambda expressions, Macros, I/O in LISP, Examples involving arrays and search

18

Text Books Nilsson N J, Artificial Intelligence – A new Synthesis Harcourt Asia Pvt. Ltd Reference Books

1. Stuvert Russel, Peter Norvig, Artificial Intelligence – A Modern Approach, Prentice hall India

2. Luger G F, Stubblefield W A, Artificial Intelligence, Addison Wesley 3. Elain Rich, Kevin night, Artificial Intelligence, Tata McGraw Hill

4. Tanimotto S L, The Elements of Artificial Intelligence, Computer Science Press

5. Winston P H, LISP, Addison Wesley

19

IT2E06- Data Mining and Warehousing

Unit I Introduction: what is Data Mining, which data, what kinds of patterns can be mined-Data Warehouse and OLAP technology for Data Mining,Data Warehouse Architecture. Data preprocessing: data cleaning, data integration and transformation, data reduction, discretization and concept - hierarchy generation. Unit II Data Mining Primitives, Languages and System Architectures. - Concept Descriptions: Characteristic and Discriminant rules. Data Generalization. - Mining Association Rules in Large Databases - Transactional databases.

Unit III

Concept Descriptions: Characteristic and Discriminant rules, Data Generalization, Example of decision tables and Rough Sets. Classification and prediction, Decision Tree Induction (ID3, C4.5), Bayesian Classification. Cluster Analysis. A Categorization of major Clustering methods Unit IV Introduction to Data warehousing: Need for warehousing, Data warehouse Architecture and design, Hardware and operational design, Tuning and testing. Trends , Developments and Applications. Text Books

1. J. Han and M. Kamber, Data mining: Concepts and Techniques, Elsevier Science, 2007.

Reference Books

1. K.P.Soman, Shyam Diwakar, and V. Ajay, Insight into Data Mining: Theory and Practice, Prentice Hall of India, 2006.

2. S. Sumathi, S. N. Sivanandam, Introduction to data mining and its applications,(Illustrated Edn), Springer Publishers, 2006

3. P.M.Tan, N.Stenbach and V.Kumar, Introduction to Data Mining, Pearson Education, London, 2007

4. K.Mehmed, Data Mining: Concepts,Models, Methods, and Algorithms, John Wiley and Sons, 2003.

5. Paulraj Ponniah, Data Warehousing Fundamentals: A Comprehensive Guide for IT Professional, Wiley Student Edition, 2007

6. S. Anahary and D. Murray, Data Warehousing in the Real World,:A Practical Guide for Building Decision Support Systems, Pearson Education, 2000.

7. M.H. Dunham, Data mining: Introductory and Advanced Topics, Pearson Education, 2004.

20

IT2E07– Theory of computation Unit 1 Mathematical Preliminaries: Sets, Relations and Functions, Graphs and Trees, Strings and their properties, Principle of induction. The Theory of Automata: Definition of an automation, Description of a finite automation, Transition systems, Properties of transition functions, Acceptability of a string by a finite automation, Nondeterministic finite state machines, The Equivalence of DFA and NDF, Mealy and Moore Models, Minimization of finite automata. Unit II Formal Languages: Basic definitions and examples, Chomsky classification of Languages, Languages and their relation, Recursive and recursively enumerable sets, Operations on languages, Languages and automata.

Unit III Regular Sets and Regular Grammars: Regular expressions, Finite automata and regular expressions, Pumping lemma for regular sets, Application of pumping lemma, Closure properties of regular sets, Regular sets and regular grammars. Unit 1V Context -Free Languages: Context – free languages and derivation trees, Ambiguity in context – free grammars, Simplification of context –free grammars, Normal forms for context-free grammars, Pumping lemma for context – free languages, Decision Algorithms for context – free languages. Pushdown Automata: Basic definitions, Acceptance by pda, Pushdown automata and context – free languages, Parsing and pushdown automata. Unit V Turing Machines and Linear Bounded Automata: Turing machine model, Representation of Turing machines, Languages acceptability by Turing machines, Design of Turing machines, Description of Turing machines, Techniques for TM construction, Variants of Turing machines, The Model of Linear Bounded Automaton, Turing machines and Type 0 Grammars, Linear bounded automata and languages. Decidability and Recursively Enumerable Languages: The definition of an algorithm, Decidability, Decidable languages, Undecidable languages, Halting problem of Turing machine, The post correspondence problem. Reference Books

1. KLP Mishra & N Chandrasekaran, “Theory of Computer Science”,3rd Edition, Prentice Hall,2007

2. H.R.Lewis and C.H.Papadimitriou, “Elements of the Theory of Computation”, Prentice Hall of India, 1996.

3. Linz: P. An Introduction to Formal Languages and Automata, Narosa, 1998 4. Hoporoft J.E.and Ullman J.D., Introduction to Automata Theory Languages and 5. Computation, Narosa, 1981

21

IT2P06 – PRACTICAL -2

Unit I Advanced DBMS

1. DCL, DDL, DML, DQL statements in MySQL 2. Stored Procedures in MySQL 3. Cursors and Triggers 4. Transactional and Locking statements 5. Account Management statements

Unit II Java Programming Develop programs to implement the following.

1. Classes, objects and methods. 2. Inheritance of different types. 3. Use of keywords super, abstract and final. 4. Method overloading and Method overriding 5. Packages and interfaces. 6. Exception handling 7. Use of static members in a class. 8. File operations. 9. Multithreaded Programming 10. Applets 11. String handling 12. AWT to work with text and graphics 13. Applications of Swing.

22

IT3C01 Principles of Compiler Design

Unit I Introduction: Analysis of the source program, phases of a compiler, compiler construction tools. Lexical analysis: Role of the lexical analyzer, specification of tokens, Recognition of tokens, Lexical analyzer generators. Unit II Syntax analysis: Top-down parsing-Recursive descent and Predictive Parsers. Bottom-up Parsing- LR (0), SLR, and LR (1) Parsers. Unit III Syntax-directed translation: Syntax-directed definitions, S-Attributed definitions, L-attributed definitions, Bottom-up and top-down translation - Type checking: Type systems, specification of a type checker and symbol tables. Unit IV Intermediate code generation: Intermediate languages, Declarations, Assignment statements, Boolean expressions, Procedure calls. Unit V Run-time environments: Source language issues, storage organization, storage allocation strategies, Introduction to code optimization: Sources of optimization Reference Books

1. AHO, A. V, SETHI, R. and ULLMAN, J. D. Compilers: Principles, Techniques and Tools, Addison Wesley,

2. Steven S Muchnick, Advanced Compiler Design Implementation. 3. STEVEN MUCHNICK. Advanced Compiler Design Implementation, Morgan Kauffmann Publishers, 1997

23

IT3C02-.NET TECHNOLOGY Unit I Overview of ASP.NET framework, Understanding ASP.NET Controls, Applications, Web servers, installation of IIS, Web forms, web form controls - server controls, client controls, web, forms & HTML, Adding controls to a web form,Buttons, Text Box, Labels, Checkbox, Radio Buttons, List Box, etc, Running a web Application, creating a multiform web project Unit II Form Validation: Client side validation, server Side validation, Validation Controls: Required Field Comparison Range. Calendar, control, Ad rotator Control, Internet Explorer Control, State management- View state, Session state, Application state Unit III Architecture of ADO.NET, Connected and Disconnected Database, Create Connection using ADO.NET Object Model, Connection Class, Command Class, Unit IV DataAdapter Class, Dataset Class. Display data on, data bound Controls and Data Grid, Database Accessing on web applications: Data Binding concept with, web, creating data grid, Binding standard web server controls, Display data on web form using Data bound controls Unit V Writing datasets to XML, Reading datasets with XML, Web services: Introduction, Remote method call using XML, SOAP, web service description language, building & consuming a web, service, Web Application deployment Core Reference

1. ASP.NET Unleashed, C# programming – Wrox publication,

24

IT3C03 SOFTWARE ENGINEERING Unit I The Product-software process models- Project management concepts- Software Project and Project Metrics-software measurement-metrics for software quality-Integrating metrics within the software engineering process. Unit II Software Project Planning –software scope resources ,software project estimation-decomposition techniques-empirical estimation models-the make/buy decision- Risk Analysis and Management, risk identification, risk projection, risk refinement- Project scheduling and Tracking, relationship between people and effort, defining a task set for the software project, scheduling - Software Quality Assurance, software reviews and technical reviews , statistical SQA, software reliability ,quality standards. Unit III Software Configuration Management- System Engineering, requirement engineering, system modeling – Analysis Concepts and Principles, software prototyping and specification- Analysis modeling, data modeling, functional modeling and information flow, behavioral modeling, Mechanics for structure analysis, data dictionary. Unit IV Design concepts and Principles, Design processes, principles and concepts, effective modular design, Design heuristics for effective modularity, design model and documentation - Architectural Design -User Interface Design. Unit V Component Level Design- Software Testing Techniques- Software Testing Strategies, test case design, white box testing ,basis path testing, control structure and black box testing- Technical Metrics for Software. Reference Books 1. R.S.Pressman, Software Engineering A Practitioner’s Approach – MGH – 2001. 2. Ian Sommerville, Software Engineering, 5th Edn. Addison Wesley, 2002 3. Theory and problems of Software Engineering, Schaum’s outline series

25

HardIT3C04 WEB PROGRAMMING USING PHP

Unit I HTML: Introduction to HTML, Basic formatting tags: heading, paragraph, underline break, bold, italic, underline, superecript, subscript, font and image. Different attributes like align, color, bgcolor, font face, border, size. Navigation Links using anchor tag: internal, external ,mail and image links.Lists: ordered, unordered and definition, Table tag, HTML Form controls: form, text ,password, textarea, button, checkbox, radio button, select box, hidden controls, Frameset and frames Unit II Javascript: Introduction, Client side programming, script tag, comments, variables, Document Methods: write and writeln methods, alert, Operators: Arithmetic, Assignment, Relational, Logical, Javascript Functions, Conditional Statements, Loops, break and continue. Events Familiarization: onLoad, onClick, onBlur,onSubmit,onChange Unit III PHP: Introduction to PHP, Server side scripting, Role of Web Server software, including files, comments, variables and scope, echo and print, Operators: Logical, Comparison and Conditional operators, Branching statements, Loops, break and continue, PHP functions,

Unit IV Working with PHP: Passing information between pages, HTTP GET and POST method, String functions: strlen, strops, strstr, strcmp, substr, str_replace, string case, Array constructs: array(),list() and foreach(), PHP advanced functions: Header , Session Cookie Object Oriented Programming using PHP: class, object, constructor, destructor and inheritance Unit V PHP & MySQL: Features of MySQL, data types, Introduction to SQL commands-SELECT, DELETE, UPDATE, INSERT, PHP functions for MySQL operations: mysql_connect, mysql_select_db, mysql_query, mysql_fetch_row,mysql_fetch_array,mysql_fetch_object, mysql_result, Insertion and Deletion of data using PHP, Displaying data from MYSQL in webpage Core Reference 1. Jon Duckett, Web Programming with HTML,XHTML, CSS, Wrox Beginning 2. Jim Converse & Joyce Park, PHP & MySQL Bible, Wiley

Reference Books 1. HTML 4.0 IN SIMPLE STEPS Author : Kogent Solutions Publishers : Wiley 2. HTML 4 FOR DUMMIES Author : ED TITTEL & MARY BURMEISTER Publishers: Wiley 3. Beginning PHP D W Mercer,A Kent,S D Nowicki Publisher:Wrox 4. PHP & MYSQL FOR DUMMIES, 3RD ED Author : JANET VALADE Publishers: Wiley

26

IT3E05 WEB TECHNOLOGY Unit I Introduction to Web programming – Introduction to SGML features – HTML, XHTML, DHTML, XML – HTML Vs XML – Creating XML documents – Parsing an XML document – Writing well formed documents – Organizing elements with namespaces – Defining elements in a DTD – Declaring elements and attributes in a DTD. Unit II CGI/Perl: Creating link to a CGI Script – Using a link to send data to a CGI Script – parsing data sent to a Perl CGI script – Using CGI script to process form data – Using scalar variables in Perl – Using variables in Perl – Using arithmetic operators in Perl – Associating a form with a script. Unit III Java Server Pages – JSP scripting elements – Linking to external files – JSP declarations – JSP Expressions – JSP Scriplets – Processing client requests- Accessing a database from JSP. Unit IV PHP: Defining PHP variables – variable types – operators – control flow constructs in PHP – Establishing connection with MySQL database – managing system data – parsing data between Pages Unit V Python: Data types, control structures, advanced data structures, I/O, classes, modules, packages, exception handling, standard library, internet programming with python. Reference Books 1. Robert W. Sebesta, Programming with World Wide Web, 4th edition, Pearson Education, 2009. 2. Xue Bal et. al, The Web Warrior Guide to Web programming, Thomson Learning. 3. Chris Bates, Web Programming: Building Internet Applications, 3rd ed, Wiley Academic Catalog. 4. H.M. Deitel, P.J. Deitel and A.B. Goldberg, Internet and World Wide Web: How to Program, 3rd edition, Pearson Education. 5. Steven Holzner, PHP The complete Reference,1st Edition,McGraw-Hill, 2007. 6. Philip Hanna, JSP The complete Reference, 2nd Edition, McGraw-Hill, 2002. 7. Paul Barry, Head First Python, 1st Edition, O’Reilly Media, 2010 8. Scott Guelicb, Shishir Gundavaram and Gunther Birznieks, CGI Programming with Perl, 2nd Edition,O’Reilly Media, 2000.

27

IT3E06 – SIMULATION AND MODELING Unit I Introduction - systems and models - computer simulation and its applications -continuous system simulation - modeling continuous systems - simulation of continuous systems - discrete system simulation - methodology – event scheduling and process interaction approaches - random number generation. Unit II testing of randomness - generation of stochastic variates - random samples from continuous distributions – uniform distribution - exponential distribution m-Erlang distribution - gamma distribution - normal distribution – beta distribution - random samples from discrete distributions - Bernoulli - discrete uniform -binomial - geometric and poisson . Unit III Evaluation of simulation experiments - verification and validation of simulation experiments – statistical reliability in evaluating simulation experiments -confidence intervals for terminating simulation runs - simulation languages -programming considerations - general features of GPSS - SIM SCRIPT and SIMULA. Unit IV Simulation of queueing systems - parameters of queue - formulation of queueing problems - generation of arrival pattern - generation of service patterns -Simulation of single server queues - simulation of multi-server queues -simulation of random queues. Unit V Simulation of stochastic network - simulation of PERT network - definition of network diagrams – forward pass computation - simulation of forward pass -backward pass computations - simulation of backward pass - determination of float and slack times determination of critical path - simulation of complete network - merits of simulation of stochastic networks. Reference Books 1. C. Deo N., System Simulation And Digital Computer, Prentice Hall of India. 2. Gordan G., System Simulation, Prentice Hall of India. 3. Law A.M. & Ketton W.D., Simulation Modelling and Analysis, McGraw Hill.

28

IT3E07-Software Testing Unit I Phases of Software project – Quality Assurance, Quality control – Testing, Verification and Validation – Process Model to represent Different Phases - Life Cycle models. White-Box Testing: Static Testing – Structural Testing Challenges in White-Box Testing. Unit II Black-Box Testing: What is Black-Box Testing? - Why Black-Box Testing? – When to do Black-Box Testing? – How to do Black-Box Testing? – Challenges in White Box Testing – Integration Testing: Integration Testing as Type of Testing – Integration Testing as a Phase f Testing – Scenario Testing – Defect Bash. Unit III System and Acceptance Testing: system Testing Overview – Why System testing is done?–Functional versus Non-functional Testing - Functional testing - Non-functional Testing – Acceptance Testing – Summary of Testing Phases. Unit IV Performance Testing: Factors governing Performance Testing – Methodology of Performance Testing – tools for Performance Testing – Process for Performance Testing – Challenges. Regression Testing: What is Regression Testing? – Types of Regression Testing – When to do Regression Testing – How to do Regression Testing – Best Practices in Regression Testing. Unit V Test Planning, Management, Execution and Reporting: Test Planning – Test Management– Test Process – Test Reporting –Best Practices. Test Metrics and Measurements: Project Metrics –Progress Metrics – Productivity Metrics – Release Metrics. Reference Books 1. Srinivasan Desikan & Gopalswamy, “Software Testing Principles and Practices” Ramesh, 2006, Pearson Education. Reference Books 1.William E.Perry, “Effective methods of software testing” Wiley India. 2 Renu Rajani, Pradeep Oak,”SoftwareTesting” 2007, TMH

29

IT3P06– PRACTICAL-3

Unit I .NET TECHNOLOGY

1) Write Asp.net program to declare one text box one label control. When we change the value in the textbox the subroutine writes the new text to the Label control:

2) Write a program to place basic ,password and multiline with 5 rows Text box control ? 3) Declare one ListBox control in an .aspx file. Then create an event handler for the Click

event which displays some text and the selected item, in a Label control? 4) Declare three RadioButton controls, one Button control, and one Label control in an .aspx

file. When the submit button is triggered the server sends the message specifying the name of the radiobutton selected to the Label control .

5) Declare two TextBox controls, one ListBox control, one Button control, and one CompareValidator control in an .aspx file. The check_operator() function sets the operator of the CompareValidator control equal to the selected operator in the ListBox control, then it validates the CompareValidator control. If validation fails, the text "Validation Failed!" will be displayed

6) Declare one TextBox control, one Button control, one Label control, and one RangeValidator control in an .aspx file. The submit() function checks if the page is valid. If it is valid, it returns "The page is valid!" in the Label control. If it is not valid, it returns "The page is not valid!" in the Label control. If validation fails, the text "The value must be from 1 to 100!" will be displayed in the RangeValidator control.

7) Declare an AdRotator control. Then we create an event handler for the AdCreated event, in the .aspx file, to override the value of the NavigateUrl element in the XML file.

8) Declare a Calendar control where the days are displayed with full names in blue, the weekends are displayed in red on a yellow background, and the current date is displayed with a green background.

9) Create a table customers with customername,companyname, address,city.Write a program to connect to the database and retrieve the values of the customer table?

10) Program to Declare a Table control, with three TableRow controls, and two TableCell controls in an .aspx file?

11) Write an XML file representing the name of the countries and then bind a data set to a Radiobutton list control?

12) Write a ASP.net program to place tabstrip control?

30

UNIT II PHP Html

1. create an HTML page which contains 6 heading and all formating tags 2. create an HTML page with 3 type(orderd, unorderd and definition ) list element tag 3. Create an HTML page which display all alignment option of an image 4. Create an HTML page with external and internal link ? 5. Create an HTML page with a table which contain column span row span and background

color 6. Create a college website using frames and links

JavaScript

1. Write a javascript progrm to find the area and circuference of a circle 2. Write a javascript program to show the Alert Box? 3. write a javascript program to store different colours in an array and change the

background colour of the page using this array elements 4. Write a javascript program to create clock with a timing event? 5. write a javascript program for form validation 6. write a javascript program to find the currecy exchange rate using combobox 7. Write a javascript program to create a colour pallate and change the background color

(using mouseover event)

PHP

1. Write a php script to generate a pay slip (using switch and if condition) by accepting name designation

2. Write a php script to generate a biodata by accepting necessary information 3. Write a php script to print first N prime numbers 4. Write a php script to create login form using session and database 5. Write a php script to generate mark sheet by accepting register number 6. write a php script to accept stock details store the details in a database and display

inventory details 7. Write a php script to add new elements to the end of the array?