Alagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure




Скачать 173.03 Kb.
НазваниеAlagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure
страница1/3
Дата конвертации14.02.2013
Размер173.03 Kb.
ТипДокументы
  1   2   3

ALAGAPPA UNIVERSITY KARAIKUDI

SYLLABUS UNDER CBCS (w.e.f.2011-12)




M.Sc., INFORMATION TECHNOLOGY – PROGRAMME STRUCTURE





Sem

Course

Cr.

Hrs./

Week

Marks

Total

Subject

code

Name

Int.

Ext.

I

1MIT1C1

Core – I – Principles of Information Technology

4

6

25

75

100

1MIT1C2

Core – II – C and Data Structure

4

6

25

75

100

1MIT1C3

Core – III – JAVA Programming

4

6

25

75

100

1MIT1P1

Core – IV – Java Programming Lab

4

6

40

60

100




Elective – I

4

6

25

75

100







Total

20

30

--

--

500


Elective – I


  1. Probability and Statistics – 1MIT1E1

  2. Object Oriented Analysis & Design – 1MIT1E2

  3. Applied Mathematics for Computer Science – 1MIT1E3




Sem

Course

Cr.

Hrs./

Week

Marks

Total

Subject

code

Name

Int.

Ext.

II

1MIT2C1

Core – V – Computer Networks

4

5

25

75

100

1MIT2C2

Core – VI – RDBMS

4

5

25

75

100

1MIT2C3

Core – VII – Distributed Operating system

4

5

25

75

100

1MIT2P1

Core – VIII – RDBMS Lab

4

5

40

60

100




Elective – II

4

5

25

75

100




Elective – III

4

5

25

75

100







Total

24

30

--

--

600



Elective – II


  1. Mobile Computing – 1MIT2E1

  2. Data Mining and Warehousing – 1MIT2E2

  3. Compiler Design – 1MIT2E3



Elective – III


    1. Mini Project using VB – 1MIT2E4

    2. Mini Project using Java – 1MIT2E5

    3. Mini Project using Oracle – 1MIT2E6




Sem

Course

Cr.

Hrs./

Week

Marks

Total

Subject

code

Name

Int.

Ext.

III

1MIT3C1

Core – IX – TCP / IP

4

5

25

75

100

1MIT3C2

Core – X – .Net Technology

4

5

25

75

100

1MIT3C3

Core – XI – Wireless Communication

4

5

25

75

100

1MIT3P1

Core – XII .Net Technology Lab

4

5

40

60

100




Elective – IV

4

5

25

75

100




Elective – V

4

5

25

75

100







Total

24

30

--

--

600



Elective – IV


  1. Multimedia and its Applications – 1MIT3E1

  2. E-Commerce – 1MIT3E2

  3. Embedded System – 1MIT3E3



Elective – V


  1. Security in Computing – 1MIT3E4

  2. Software Engineering – 1MIT3E5

  3. Neural Network – 1MIT3E6




Sem

Course

Cr.

Hrs./

Week

Marks

Total

Subject

code

Name

Int.

Ext.

IV

1MIT4PR

Core – XIII – Project Work

22

30

--

--

200







Total

22

30

--

--

200







Grant Total

90

120

--

--

1900



Project Work


Project Evaluation : 150 Marks

Viva – voce : 50 Marks

I YEAR – I SEMESTER

COURSE CODE: 1MIT1C1


CORE COURSE I – PRINCIPLES OF INFORMATION TECHNOLOGY


Unit I


An overview of the revolution computers and Communications: From the analog to the digital age: The “New Story” of computers and communications – The basic elements of a computer & communication system – Communications: Development in Computer Technology, Developments in Communication Technology – Computer and Communication technology combined: Connectivity and Interactivity – The “All Purpose Machine”: The information Appliance that will change your future – The Ethics of Information Technology.


Unit II


Application Software: Tools for thinking and working – Ethics and intellectual property rights: The four types of Application software – the user interface and other basic features – word processing – Spreadsheets – Database software – Presentation graphics software – communications software – Desktop accessories and personal information managers – integrated software and suites – Groupware internet web browsers – Specialized software.


Unit III


Communications: Starting along the information Highway: The practical uses of communication and connectivity – telephone related communication services – Video/ voice communication. Video conferencing and picture phones – Online information services – The Internet – Shared resources: Workgroup computing – Electronic Data interchange and intranets: Telecommuting and virtual offices – using a microcomputer to communicate: Analog and Digital signal – modems and data communication software – ISBN lines – Cable Modems – Communication channels – Communication Networks – Local Networks – Factors affecting data transmission – Cyberethics – Netiquette – Controversial and censorship and privacy issues.


Unit IV


Storage and Databases: Foundations for interactivity, multimedia and Knowledge storage capacity – compression and decompression – criteria for rating secondary storage devices – Diskettes – Hard Disks – Optical Disks – Magnetic Tapes – Organising data in secondary storage: Databases, Data Storage – Hierarchy and the concept of the key field – File management – Basic concepts – File management systems – Data Management systems – Types of database organization – Features of DBMS – The Ethics of using Database – Concerns about accuracy and privacy.


Unit V


Information System and Software Development: Management Information Systems – The six phases of system analysis design – The five steps in programming – five generations of programming languages – Programming languages – Object oriented and Visual programming– Internet programming – HTML, XML, Java and ActiveX – The information super Highway – Security Issues.


Text Books


  1. Satcey C. Sawyer, Brain K. Williams Sarah E Hutchinson using Information Technology – Brief version A practical introduction to computer and communications– 2nd edition McGraw Hill.

  2. Satcey C. Sawyer, Brain K. Williams Sarah E Hutchinson using Information Technology – Brief version A practical introduction to computer and communications– 3rd edition McGraw Hill.



♣♣♣♣♣♣♣♣♣♣

I YEAR – I SEMESTER

COURSE CODE: 1MIT1C2


CORE COURSE II – C AND DATA STRUCTURE


Unit I

Program development styles and Basics of C. The C declarations – The C character set, Delimiters, The C Keywords, Identifiers, Constants, Variables, Rules for defining variables, C aggregate data types, declaring variables, initializing variables, Type conversion. Operators and expressions. Input and output in C – formatted functions – unformatted functions, commonly used library functions.


Unit II

Decision Statements – The If statement, The if…else statement, Nested if…. Else statement, The break statement, The continue statement, The goto statement, The switch statement, Nested switch() case statement, The switch() case and nested ifs. Loop control statements – The for statement, Nested for statement, The while statement, The do … while statement.


Unit III

Arrays – Array initialization, Definition of Array, Characteristic of Array, One dimensional array, Predefined streams, Two dimensional array, Multidimensional arrays, The sscanf() and sprintf() functions. Working with strings and standard functions. Pointers – Features of Pointers, pointer declaration, Arithmetic operation with pointers, Pointers and Arrays, Pointers and two dimensional arrays, Arrays of Pointers, Pointers to Pointers, Pointers and strings.


Unit IV

Linear Data Structure – Introduction to data structure, List, Implementation of a list, Traversal of a list, Searching and retrieving an element. Predecessor and successor, Insertion, Deletion, sorting, merging lists, Representation of Stack, Stack related terms, Operation on a stack, Implementation of a stack, Queues, various positions of queue, Representation of Queues, Single linked list, linked list with and without header, Insertion, deletion, Double linked list, applications.


Unit V

Non-Linear data structure – Trees, Binary trees, types of binary trees, binary tree representation, Traversing binary trees, Binary search tree, Insertion and deletion operations, Hashing Techniques. Searching and Sorting – Introduction, Searching, linear search, Binary search, sorting, Insertion sort, selection sort, Bubble sort, Quick sort, Tree sort.


Text Books


  1. Ashok N Kamthane, Programming and Data structure, Pearson Edition 2004

  2. Robert L Kruse, Bruce P. Leung C.L.Tondo, Data Structures and Program Design in C, PHI 1999



♣♣♣♣♣♣♣♣♣♣

I YEAR – I SEMESTER

COURSE CODE: 1MIT1C3


CORE COURSE III – JAVA PROGRAMMING


Unit I


Introduction: Introduction to java – Java and Internet – Byte codes – Features of Java – Java development Environment – Java character set – operators – control statements – simple programs.


Unit II


Object Orientation in Java: Classes – Methods – Inheritance – Packages – Interfaces – programming examples.

Exception Handling: Fundamentals – Exception types – Try catch block – throw, throw clause – finally – user defined Exceptions.


Unit III


Threads: Thread model – Thread priorities – Runnable interface – creating a thread, multiple threads – Synchronization – interthread communication – suspending, resuming and stopping threads.


Unit IV


Input/Output: String handling – Exploring java io. Package.

Applets: Applet basics – AWT classes – Window fundamentals – working with frame windows – graphics – AWT controls – Swing – Layout Managers – Menus – Event Handling.


Unit V


Java Networking: Basics – Socket overview – TCP/IP client sockets, TCP/IP server sockets– URL – Datagram sockets.

Concepts of Advanced Java Programming: JAVA SCRIPTS – Servlets – JDBC – EJB – JSP.


Text Book


  1. Patrick aughton, Herbert Schildt, “JAVA2- The complete reference” Tata McGraw Hill Fifth Edition, New Delhi 2002


Reference Books


  1. Deitel H M and Deiltel P J “JAVA – How to Program “ Pearson Education , New Delhi 2003

  2. Hubbard John R, “Schaum’s Outline of Theory and Problems of Programming with Java” Tata Mcgraw Hill, Second Edition, New Delhi 2004

  3. Chitra A “Internet and Java Programming” ISTE 2002.

I YEAR – I SEMESTER

COURSE CODE: 1MIT1P1


CORE COURSE IV – JAVA PROGRAMMING LAB



  1. Demonstrate the Program structure of Java

  2. Demonstrate the String Operations

  3. Demonstrate Package Creation and use in Program

  4. Demonstrate Inner Class

  5. Demonstrate Inheritance

  6. Demonstrate 2D Shapes on Frames

  7. Demonstrate Text and Fonts

  8. Demonstrate Event Handling for various types of Events

  9. Multicasting Techniques

  10. Swing Components

  11. Demonstrate the use of Dialog Box

  12. Create a Dialog Box

  13. Create a Tool Bar, Menu & Popup Menu

  14. Implement File Handlings

  15. Demonstrate Applet Programming

  16. Implement Generic Programming

  17. Demonstrate JDBC on Applet/Application

  18. Demonstrate Multithreading



♣♣♣♣♣♣♣♣♣♣

I YEAR – I SEMESTER

COURSE CODE: 1MIT1E1


ELECTIVE COURSE I (A) – PROBABILITY AND STATISTICS


Unit I


Sample Space: Events – Probability – Probability axioms – Addition and Multiplication Laws of Probabilities – conditional probability – Independent events – Baye’s Theorem


Unit II


Random Variables: Distribution functions – Joint Probability distribution – Marginal and conditional Distribution – Mathematical exception – Moment Generating Functions.


Unit III


Discrete Distribution: Binomial and Poisson – Continuous Distribution: Uniform, Exponential and Normal – Correlation and Regression.


Unit IV


Testing Hypothesis: Test based on normal population – Application of Chi-square, Student’s-T, F-Distributions – Chi-square Test – Goodness of fit – Test based on mean, variance, correlation and regression coefficients.


Unit V


Time Series: Analysis of time series – Measurement of trend and sequential variations – Analysis of Variance – Design of experiments – Randomised block design and latin square design.


Text Books


  1. S.C.Gupta, V.K. Kapoor, Fundamentals of Mathematical Statistics, Sultan & Chand 1983

  2. S.C.Gupta, V.K.Kapoor, Fundamentals of Applied Statistics, Sultan & Chand, 1978.



♣♣♣♣♣♣♣♣♣♣


I YEAR – I SEMESTER

COURSE CODE: 1MIT1E2


ELECTIVE COURSE I (B) – OBJECT ORIENTED ANALYSIS AND DESIGN


Unit I

Introduction to Object Oriented Development – Modeling as a design technique: Modeling – Object Modeling Techniques – Object Modeling: Objects and Classes – Links and associations – Advanced Link and Association concepts – Generalisation and Inheritance – Grouping Constructs – a simple object model – Advanced object modeling: Aggregation – Abstract Classes – Generalisation as extension and restriction – Multiple Inheritance –Metadata – Candidate Keys and Constraints.


Unit II

Dynamic Modeling

Events and States – Operations – Nested state diagram – Concurrence – Advanced dynamic modeling concepts – A simple dynamic model – Relation of object and dynamic models – functional modeling – Functional models – Data flow diagrams – Specifying operation – constraints – A simple functional model – relation of functional to object and dynamic models.


Unit III

Analysis

Overview of Analysis – Problem statement – Automated Teller Machine example – Object Modeling – Dynamic Modeling – Functional Modeling – Adding Operations – Iterating the Analysis.


Unit IV

System Design

Overview of System Design – Breaking system into subsystems – Identifying Concurrency – Allocation subsystems to processes and tasks – Management of Data stores – Handling boundary condition – Setting trade-off priorities – Common Architectural frameworks –Architecture of ATM system.


Unit V

Object Design

Overview of Object Design – Combining the three models – Designing algorithms – Design optimization – Implementation of control – Adjustment of Inheritance – Design of Associations – Object Representation – Physical Packaging – Document Design Decisions.


Text Book

James Rumbaugh, Michael Blaha, William Premerlani, Fredrick Eddy, William Loreson, Object Oriented Modelling and Design, PHI 1998


Reference Book

Grady Booch, Object Analysis and Design with Applications, Addison Wesley Publishing Company 2000

♣♣♣♣♣♣♣♣♣♣

I YEAR – I SEMESTER

COURSE CODE: 1MIT1E3


ELECTIVE COURSE I (C) – APPLIED MATHEMATICS FOR COMPUTER SCIENCE


Unit I


Logic: IF Statements – Connectives – Atomic and Compound Statements – WFF – Truth Table of a Formula – Tautology – Tautological Implications and Equivalence of Formulae.


Unit II


Normal Forms – Principal Normal Forms – Theory of Inference – Open Statements – Quantifiers – Valid Formulae and Equivalence – Theory of Inference for Predicate Calculus.


Unit III


Graph Theory: Basic Concepts – Matrix representation of Graphs: Trees: Definition – Spanning Trees – Rooted Trees – Binary Trees


Unit IV


Linear Programming Problem: Mathematical Formulation – Graphical Solution – Slack and Artificial Variables – Simplex method – Two phase method.


Unit V


Transportation Problem – Transportation Table – Solution of Transportation Problem – Testing for Optimality – Assignment Problem – The Assignment Method – Special Cases in Assignment Problems.


Text Books


  1. Discrete Mathematics – Dr. M.K.Venkataraman, Dr N.Sridharan, N.Chandrasekaran – The National Publishing Company (Unit I, II and III)

  2. Operation Research – Kantiswarap, P.K.Gupta, Man Mohan – Sultan Chand & Sons (2005)


Reference Book


  1. Discrete Mathematical Structures with Applications to Computer science – J.P.Trembley, R.Manohar Tata McGraw Hill.



♣♣♣♣♣♣♣♣♣♣

I YEAR – II SEMESTER

COURSE CODE: 1MIT2C1


CORE COURSE V – COMPUTER NETWORKS


Unit I


Introduction: The use of a Computer Networks – Network structures – Network Architectures– The OSI reference model – Services


Unit II


The Physical layer: The Theoretical basis for data communication – Transmission media – Analog Transmission – Digital Transmission – Transmission and Switching – Integrated Service Digital Network (ISDN) – Terminal Handling.


Unit III


The Medium Access Sub Layer: Local and Metropolitan Area Network – The ALOHA protocols. The Data Link Layer: Data Link Layer Design Issues – Error Detection and correction – Elementary data link protocols.


Unit IV


The Network Layer: Network layer design issues – Routing algorithms – Congestion control algorithm. The Transport Layer: Transport layer design issues – Connection management. The Session Layer: The Session Layer design issues – Remote Procedure Call.


Unit V


The Presentation Layer: Presentation Layer design issues – Abstract Syntax Notation – Data Compression Techniques – Cryptography. The Application layer: Application Layer design issues – File transfer, access and management – Electronic Mail – Virtual Terminals – Other Applications.


Text Book


Andrew S Tanenbaum – Computer Networks PHI


Reference Books


  1. P.Green – Computer Network Architecture and Protocols, Plenum 1982

  2. Harry Katzan – An introduction to distributed Data processing, A Petrocelli Book Network.


♣♣♣♣♣♣♣♣♣♣


I YEAR – II SEMESTER

COURSE CODE: 1MIT2C2


CORE COURSE VI – RDBMS


Unit I

Introduction – Organization of Databases – Components of DBMS – Data Models – Entity Relationship Model – Basic file systems: Introduction – Secondary storage devices – Files and Buffer Management – File organization – Sequential File organization – Indexed file – Indexed Sequential file organization – Creation and manipulation of indexed sequential file organization – Hashing – key to address transfer – Overflow management in hashed files.


Unit II

B-Tree based Indexed file organization – Secondary indexes: Organization and usage – File organization based on dynamic hashing with deferred splitting – Linear Splitting.


Unit III

Relational Data Model – Relational Algebra – ISBL – Relational Calculus – The Domain Calculus System – SQL – Relational Database design: Integrity constraints – Functional dependency – Logical Implication of Dependency – Normal forms – Decomposition of Relational Schemes – Design Procedures.


Unit IV

Security: Introduction – Access Control – Crypto system – Statistical database Security – Concurrency control and databases Recovery: Transaction – Database system Architecture –Serialization – Locking – Non-Locking Schedules – Database Recovery.


Unit V

Oracle Fundamentals: Elements of SQL language: Database objects, Data Access SQL commands, DML commands – oracle queries – Basic query, using Expressions, working with Null values, joining multiple tables in a query – selecting values using sub queries, unions – Multiple part queries – create table statement – Privileges required – describing table definitions – modifying tables – renaming a table – copying another table – dropping a table –other database objects – reason for other database objects – Indexed-Embedded SQL: languages supported by oracle precompiler, Embedded SQL commands


Reference Books


  1. Arun K Manjumdar and Pritimoy Bhattacharya – Database Management System – Tata Mc Graw Hill Publishing Co. Ltd. 1996

  2. Rajshekhar Suderraman, Oracle 9i Programming A primer, Pearson Education 2004

  3. Lannes Morris, Murphy, Oracle 9i: SQL – with an introduction to PL/SQL Course Technology, 2002.


♣♣♣♣♣♣♣♣♣♣


I YEAR – II SEMESTER

COURSE CODE: 1MIT2C3


CORE COURSE VII – DISTRIBUTED OPERATING SYSTEM


Unit I

Introduction: Operating System – Batch System – Time Sharing – Personal Computer System– Parallel Systems – Real Time Systems – Distributed Systems – Computer System Operation – I/O Structure – Storage Structure – Storage Hierarchy – Hardware Protection – General System Architecture – System Components Operating System Services – System calls – System programs – System structure – Virtual machines.


Unit II

Process Management: Process Concept – Process scheduling – operations on processes – cooperating processes – Interprocess communication – Threads overview – benefits – user and kernel threads – Multithreading models – CPU scheduling concepts – Scheduling criteria– Scheduling Algorithms.

Unit III

Multiple processor scheduling – Real time scheduling – Thread scheduling – Process synchronization – Critical section program – Two task solutions – synchronization hardware – Semaphores – classical synchronization – Monitors – Deadlocks – System model – Deadlock characterization – methods for handling deadlocks – Deadlock prevention – Deadlock avoidance – Deadlock detection – Recovery from deadlock.


Unit IV

Storage Management: Memory Management – Swapping – Contiguous memory allocation – paging – Segmentation with paging – Virtual Memory – Demand paging – Page replacement– Allocation of frames – Thrashing.


Unit V

File and I/O Management: File concepts – Access Methods – Directory structure – Allocation methods – Free space management – Directory implementation – Efficiency and performance– Disk Structure – Disk Scheduling – Disk Management – Swap – Space Management – Disk Reliability – Stable Storage implementation – Tertiary Storage Structure.


Text Book

A Silberschatz Peter Galvin and Greg Gagne, “Applied Operating System Concepts”, John Wiley & Sons, 2000


Reference Books

  1. James L. Peterson and Abraham Silberschatz, Operating System Concepts Addison Wesley

  2. Andrew S. Tanenbaum, Operating System Design and Implementation, PHI

  3. Harvey M. Deitel, An introduction to Operating System, Addison Wesley.



♣♣♣♣♣♣♣♣♣♣

I YEAR – II SEMESTER

COURSE CODE: 1MIT2P1


CORE COURSE VIII – RDBMS LAB



  1. SQL: Table Creation and Manipulation

  2. Procedures, Functions and Package

  3. Triggers

  4. Form Design

  5. Students Information: Creation and Retrieval

  6. Student Information: Retrieval using Cursor

  7. Inventory Control System: Updation using Triggers

  8. Reservation System: Usage of functions and Procedures

  9. Train Information System: Usage of Menus

  10. Creation Reports for the above Problems.



♣♣♣♣♣♣♣♣♣♣

I YEAR – II SEMESTER

COURSE CODE: 1MIT2E1


ELECTIVE COURSE II (A) – MOBILE COMPUTING


Unit I

Introduction: Laptop computing – Wireless Technologies – Mobility and Portability – Overview of IP and Routing – Mobile networking – Example Architectures – The role of IETF in mobile networking.


Unit II

Cellular Communication Concepts: Wireless transmission – Multiplexing –Modulation – Spread Spectrum – Cellular system – GSM architecture – Protocols – Handover procedure – Security.


Unit III

Advertisement AND Registration: Agent solicitation and Discovery Mechanism – Router Discovery Protocol – Agent advertisement – Agent operation – Agent discovery – Registration overview – Authentication overview – Registration request, reply and extensions– Mobile node registration procedures – Foreign agent registration actions – Home agent Processing


Unit IV

Data Grams and Route Optimizations: Tunneling overview and terminology– Encapsulation – Routing failures – Tunnel management – Decapsulation – Unicast broadcast and multicast data gram routing – Mobile routers – Route optimization – Message format – Extensions – Mobile key requests.


Unit V

IP Versions and DHCP: Mobility support in IP version 6 – Smooth hand off – Renumbering– DHCP – WAP protocol.

Security and Motivation Detection: Ingress filtering – Reverse tunneling – Broadcast preference extensions – Movement detection – Localizing registrations.


Text Books


  1. Charles E.Perkins, “Mobile IP: Design Principles and Practices”, Addison Wesley, USA 1999

  2. David J Goodman “Wireless Personal Communication systems” Addison Wesley Wireless communication series USA 1999


Reference Books


  1. William Lee, “Mobile Telecommunications” McGraw Hill Singapore 2001

  2. Jochen Schiller – “Mobile Communication” Pearson Education New Delhi 2003

  3. Raj Pandya, “Mobile and Personal Communication Systems and Services” IEEE Press, USA 2004.


♣♣♣♣♣♣♣♣♣♣

I YEAR – II SEMESTER

COURSE CODE: 1MIT2E2


ELECTIVE COURSE II (B) – DATA MINING AND WAREHOUSING


Unit I

Data mining – Introduction – Information and production factor – Data mining vs query tools– Data mining in marketing – Self learning computer systems – concept learning – Data mining and Data warehouse.


Unit II

Knowledge discovery process: Data selection – Cleaning – Enrichment – Coding – Preliminary analysis of the data set using traditional query tools – Visualization techniques – OLAP tools – Decision trees – Association rules – Neural networks – Genetic Algorithms KDD (Knowledge discover in Database) environment.


Unit III


Data warehouse Architecture: System Process – Process architecture – Design – Database scheme – Partitioning strategy – Aggregations – Data mart – Meta data – Systems and data Warehouse process managers.


Unit IV


Hardware and operational design of data warehouses – Hardware architecture – Physical layout – security – Backup and recovery – Service level agreement – operating the data warehouse.


Unit V

Planning, Tuning and Testing: Capacity planning – Tuning the data warehouse – Testing the data warehouses – Data warehouse features.


Text Books


  1. Pieter Adriaans, Dolf Zantinge, Data Mining, Addison Wesley 1996

  2. Sam Anahory, Dennis Muray, Data Warehousing in the real world, Addison Wesley 1996

  3. Sean Kelly, Data WareHousing in Action, John Wiley 1997.



♣♣♣♣♣♣♣♣♣♣


I YEAR – II SEMESTER

COURSE CODE: 1MIT2E3


ELECTIVE COURSE II (C) – COMPLIER DESIGN


Unit I

Introduction

Compilers: Analysis of source program; Phases of Computer – Tools of Computer – Grouping of phases, Simple one-pass compiler – grouping of phases. Simple one-pass compiler – Overview – Syntax definition – Syntax – directed translation – Parsing – Translator for simple expressions – Lexical analysis – Removal of white space and comments– constants – Recognizing identifiers and keywords – A lexical analyzer – Role of lexical analyzer – Input buffering – Specification of tokens – Recognition of tokens.


Unit II

Symbol Tables

Incorporating a symbol table – Symbol tables – Entries – list data structures for symbol table– Hash tables – Scope information – Parsing – Principles top down parsing – Predictive parsing– left recursion – role of parser – Context free grammar – Writing a grammar – Top down parsing – simple bottom up parsing – Shift reduce parsing operator – Precedence parsing– SLR parsing – LALR parsing – Canonical parsing.


Unit III

Syntax – directed translation. A translator for simple expressions – Abstract and concrete syntax – Adapting translation scheme – Optimising translator – Syntax directed definitions – Construction of syntax trees – Bottom up evaluation of S-attributed definitions, L-attributed, Top-Down translation,Type-Checking type systems, specifications of simple type checker.


Unit IV

Runtime Organization

Source language issues: Storage organization – Storage allocation strategies – Parameter Passing – Intermediate code generation – Intermediate languages – Declarations – Assignments – Boolean expressions – Case statements.


Unit V

Code Generation

Issues in design of code generator: target machine – Run time storage management – Basic blocks and flow graphs – A simple code generator – Code optimization – Introduction – Principles sources of optimizations of basic blocks – Loops in flow graphs.


Text Book

A.S.Aho, R.Sethi, and J.D.Ullman, “Compilers Princuiples, Techniques and Tools” Addison Wesley Publishing Company 1986


Reference Book

Allen I. Holub, “Compiler Design in C” PHI 1993
  1   2   3

Добавить в свой блог или на сайт

Похожие:

Alagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure iconAlagappa university, karaikudi revised syllabus under cbcs pattern (W. E. F. 2011-12) B. Sc., Physics – programme structure

Alagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure iconAlagappa university karaikudi syllabus under cbcs (w e. f. 2011-12)

Alagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure iconHemchandracharya north gujarat university patan- 384 265 Proposed details of cbcs programme pattern

Alagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure iconSyllabus for Information Technology new rc syllabus Second year it

Alagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure iconStructure of B. E. (Information Technology) 2008 Course

Alagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure iconB. tech (Information Technology) Course Structure – vr10

Alagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure iconSyllabus under cbcs (w e. f. Academic year 2011-12)

Alagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure iconSyllabus under cbcs (w e. f. Academic year 2011-12)

Alagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure iconSyllabus under cbcs (w e. f. Academic year 2011-12)

Alagappa university karaikudi syllabus under cbcs (w e. f. 2011-12) M. Sc., Information technology – programme structure iconAppendix 1 study programme “information technology”


Разместите кнопку на своём сайте:
lib.convdocs.org


База данных защищена авторским правом ©lib.convdocs.org 2012
обратиться к администрации
lib.convdocs.org
Главная страница