1. Kernel configuration, compilation and installation : Download / access the latest kernel source code from kernel.org,compile the kernel and install it in the local system.Try to view the source code of the kernel
2. Virtualisation environment (e.g., xen, kqemu or lguest) to test an applications, new kernels and isolate applications. It could also be used to expose students to other alternate OSs like *BSD
3. Compiling from source : learn about the various build systems used like the auto* family, cmake, ant etc. instead of just running the commands. This could involve the full process like fetching from a cvs and also include autoconf, automake etc.,
4. Introduction to packet management system : Given a set of RPM or DEB, how to build and maintain, serve packages over http or ftp. and also how do you configure client systems to access the package repository.
5. Installing various software packages Either the package is yet to be installed or an older version is existing. The student can practice installing the latest version. Of course, this might need internet access.
Install samba and share files to windows
Install Common Unix Printing System(CUPS)
6. Write userspace drivers using fuse -- easier to debug and less dangerous to the system (Writing full-fledged drivers is difficult at student level)
7. GUI programming : a sample programme – using Gambas since the students have VB knowledge. However, one should try using GTK or QT
8. Version Control System setup and usage using RCS, CVS, SVN
9. Text processing with Perl: simple programs, connecting with database e.g., MYSQL
10. Running PHP : simple applications like login forms after setting up a LAMP stack
11. Running Python : some simple exercise – e.g. Connecting with MySql database
12. Set up the complete network interface usinf ifconfig command liek setting gateway, DNS, IP tables, etc.,
Resources :
An environment like FOSS Lab Server (developed by NRCFOSS containing the various
packages)
OR
Equivalent system with Linux distro supplemented with relevant packages
Note:
Once the list of experiments are finalised, NRCFOSS can generate full lab manuals
complete with exercises, necessary downloads, etc. These could be made available on
NRCFOSS web portal.
TOTAL: 45 PERIODS
LIST OF EQUIPMENTS:
Hardware:
Minimum Requirements:
- 700 Mhz X86 Processor
- 384 MB of system memory (RAM)
- 40 GB of disk space
- Graphics card capable of 1024*768 resolution
- Sound Card
- Network or Internet Connection
Software:
Latest distribution of Linux
Saturday, December 11, 2010
CS2405 COMPUTER GRAPHICS LABORATORY ANNA UNIVERSITY SYLLABUS
CS2405 COMPUTER GRAPHICS LABORATORY
1. Implementation of Bresenhams Algorithm – Line, Circle, Ellipse.
2. Implementation of Line, Circle and ellipse Attributes
3. Two Dimensional transformations - Translation, Rotation, Scaling, Reflection, Shear.
4. Composite 2D Transformations
5. Cohen Sutherland 2D line clipping and Windowing
6. Sutherland – Hodgeman Polygon clipping Algorithm
7. Three dimensional transformations - Translation, Rotation, Scaling
8. Composite 3D transformations
9. Drawing three dimensional objects and Scenes
10. Generating Fractal images
1. Implementation of Bresenhams Algorithm – Line, Circle, Ellipse.
2. Implementation of Line, Circle and ellipse Attributes
3. Two Dimensional transformations - Translation, Rotation, Scaling, Reflection, Shear.
4. Composite 2D Transformations
5. Cohen Sutherland 2D line clipping and Windowing
6. Sutherland – Hodgeman Polygon clipping Algorithm
7. Three dimensional transformations - Translation, Rotation, Scaling
8. Composite 3D transformations
9. Drawing three dimensional objects and Scenes
10. Generating Fractal images
CS2403 DIGITAL SIGNAL PROCESSING ANNA UNIVERSITY SYLLABUS
CS2403 DIGITAL SIGNAL PROCESSING
UNIT I SIGNALS AND SYSTEMS
Basic elements of DSP – concepts of frequency in Analog and Digital Signals – sampling theorem – Discrete – time signals, systems – Analysis of discrete time LTI systems – Z transform – Convolution (linear and circular) – Correlation.
UNIT II FREQUENCY TRANSFORMATIONS
Introduction to DFT – Properties of DFT – Filtering methods based on DFT – FFT Algorithms Decimation – in – time Algorithms, Decimation – in – frequency Algorithms – Use of FFT in Linear Filtering – DCT.
UNIT III IIR FILTER DESIGN
Structures of IIR – Analog filter design – Discrete time IIR filter from analog filter – IIR filter design by Impulse Invariance, Bilinear transformation, Approximation of derivatives – (HPF, BPF, BRF) filter design using frequency translation
UNIT IV FIR FILTER DESIGN
Structures of FIR – Linear phase FIR filter – Filter design using windowing techniques, Frequency sampling techniques – Finite word length effects in digital Filters
UNIT V APPLICATIONS
Multirate signal processing – Speech compression – Adaptive filter – Musical sound processing – Image enhancement.
TEXT BOOKS:
1. John G. Proakis & Dimitris G.Manolakis, “Digital Signal Processing – Principles, Algorithms & Applications”, Fourth edition, Pearson education / Prentice Hall, 2007.
2. Emmanuel C..Ifeachor, & Barrie.W.Jervis, “Digital Signal Processing”, Second edition, Pearson Education / Prentice Hall, 2002.
REFERENCES:
1. Alan V.Oppenheim, Ronald W. Schafer & Hohn. R.Back, “Discrete Time Signal Processing”, Pearson Education, 2nd edition, 2005.
2. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill, 2001
UNIT I SIGNALS AND SYSTEMS
Basic elements of DSP – concepts of frequency in Analog and Digital Signals – sampling theorem – Discrete – time signals, systems – Analysis of discrete time LTI systems – Z transform – Convolution (linear and circular) – Correlation.
UNIT II FREQUENCY TRANSFORMATIONS
Introduction to DFT – Properties of DFT – Filtering methods based on DFT – FFT Algorithms Decimation – in – time Algorithms, Decimation – in – frequency Algorithms – Use of FFT in Linear Filtering – DCT.
UNIT III IIR FILTER DESIGN
Structures of IIR – Analog filter design – Discrete time IIR filter from analog filter – IIR filter design by Impulse Invariance, Bilinear transformation, Approximation of derivatives – (HPF, BPF, BRF) filter design using frequency translation
UNIT IV FIR FILTER DESIGN
Structures of FIR – Linear phase FIR filter – Filter design using windowing techniques, Frequency sampling techniques – Finite word length effects in digital Filters
UNIT V APPLICATIONS
Multirate signal processing – Speech compression – Adaptive filter – Musical sound processing – Image enhancement.
TEXT BOOKS:
1. John G. Proakis & Dimitris G.Manolakis, “Digital Signal Processing – Principles, Algorithms & Applications”, Fourth edition, Pearson education / Prentice Hall, 2007.
2. Emmanuel C..Ifeachor, & Barrie.W.Jervis, “Digital Signal Processing”, Second edition, Pearson Education / Prentice Hall, 2002.
REFERENCES:
1. Alan V.Oppenheim, Ronald W. Schafer & Hohn. R.Back, “Discrete Time Signal Processing”, Pearson Education, 2nd edition, 2005.
2. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill, 2001
CS2402 MOBILE AND PERVASIVE COMPUTING ANNA UNIVERSITY SYLLABUS
CS2402 MOBILE AND PERVASIVE COMPUTING
UNIT I MOBILE NETWORKS
Cellular Wireless Networks – GSM – Architecture – Protocols – Connection Establishment – Frequency Allocation – Routing – Mobility Management – Security –GPRS.
UNIT II WIRELESS NETWORKS
Wireless LANs and PANs – IEEE 802.11 Standard – Architecture – Services –Network – HiperLAN – Blue Tooth- Wi-Fi – WiMAX
UNIT III ROUTING
Mobile IP – DHCP – AdHoc– Proactive and Reactive Routing Protocols – Multicast Routing.
UNIT IV TRANSPORT AND APPLICATION LAYERS
Mobile TCP– WAP – Architecture – WWW Programming Model– WDP – WTLS – WTP – WSP – WAE – WTA Architecture – WML – WMLScripts.
UNIT V PERVASIVE COMPUTING
Pervasive computing infrastructure-applications- Device Technology - Hardware, Human-machine Interfaces, Biometrics, and Operating systems– Device Connectivity – Protocols, Security, and Device Management- Pervasive Web Application architecture-Access from PCs and PDAs - Access via WAP
TEXT BOOKS:
1. Jochen Schiller, “Mobile Communications”, PHI, Second Edition, 2003.
2. Jochen Burkhardt, Pervasive Computing: Technology and Architecture of Mobile
Internet Applications, Addison-Wesley Professional; 3rd edition, 2007
REFERENCES:
1. Frank Adelstein, Sandeep KS Gupta, Golden Richard, Fundamentals of Mobile and Pervasive Computing, McGraw-Hill 2005
2. Debashis Saha, Networking Infrastructure for Pervasive Computing: Enabling Technologies, Kluwer Academic Publisher, Springer; First edition, 2002
3. Introduction to Wireless and Mobile Systems by Agrawal and Zeng, Brooks/ Cole (Thomson Learning), First edition, 2002
4. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, Principles of Mobile Computing, Springer, New York, 2003
UNIT I MOBILE NETWORKS
Cellular Wireless Networks – GSM – Architecture – Protocols – Connection Establishment – Frequency Allocation – Routing – Mobility Management – Security –GPRS.
UNIT II WIRELESS NETWORKS
Wireless LANs and PANs – IEEE 802.11 Standard – Architecture – Services –Network – HiperLAN – Blue Tooth- Wi-Fi – WiMAX
UNIT III ROUTING
Mobile IP – DHCP – AdHoc– Proactive and Reactive Routing Protocols – Multicast Routing.
UNIT IV TRANSPORT AND APPLICATION LAYERS
Mobile TCP– WAP – Architecture – WWW Programming Model– WDP – WTLS – WTP – WSP – WAE – WTA Architecture – WML – WMLScripts.
UNIT V PERVASIVE COMPUTING
Pervasive computing infrastructure-applications- Device Technology - Hardware, Human-machine Interfaces, Biometrics, and Operating systems– Device Connectivity – Protocols, Security, and Device Management- Pervasive Web Application architecture-Access from PCs and PDAs - Access via WAP
TEXT BOOKS:
1. Jochen Schiller, “Mobile Communications”, PHI, Second Edition, 2003.
2. Jochen Burkhardt, Pervasive Computing: Technology and Architecture of Mobile
Internet Applications, Addison-Wesley Professional; 3rd edition, 2007
REFERENCES:
1. Frank Adelstein, Sandeep KS Gupta, Golden Richard, Fundamentals of Mobile and Pervasive Computing, McGraw-Hill 2005
2. Debashis Saha, Networking Infrastructure for Pervasive Computing: Enabling Technologies, Kluwer Academic Publisher, Springer; First edition, 2002
3. Introduction to Wireless and Mobile Systems by Agrawal and Zeng, Brooks/ Cole (Thomson Learning), First edition, 2002
4. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, Principles of Mobile Computing, Springer, New York, 2003
CS2401 COMPUTER GRAPHICS ANNA UNIVERSITY SYLLABUS
CS2401 COMPUTER GRAPHICS
UNIT I 2D PRIMITIVES
output primitives – Line, Circle and Ellipse drawing algorithms - Attributes of output primitives – Two dimensional Geometric transformation - Two dimensional viewing – Line, Polygon, Curve and Text clipping algorithms
UNIT II 3D CONCEPTS
Parallel and Perspective projections - Three dimensional object representation – Polygons, Curved lines, Splines, Quadric Surfaces,- Visualization of data sets - 3D transformations – Viewing -Visible surface identification.
UNIT III GRAPHICS PROGRAMMING
Color Models – RGB, YIQ, CMY, HSV – Animations – General Computer Animation, Raster, Keyframe - Graphics programming using OPENGL – Basic graphics primitives –Drawing three dimensional objects - Drawing three dimensional scenes
UNIT IV RENDERING
Introduction to Shading models – Flat and Smooth shading – Adding texture to faces – Adding shadows of objects – Building a camera in a program – Creating shaded objects – Rendering texture – Drawing Shadows.
UNIT V FRACTALS
Fractals and Self similarity – Peano curves – Creating image by iterated functions – Mandelbrot sets – Julia Sets – Random Fractals – Overview of Ray Tracing – Intersecting rays with other primitives – Adding Surface texture – Reflections and Transparency – Boolean operations on Objects
TEXT BOOKS:
1. Donald Hearn, Pauline Baker, Computer Graphics – C Version, second edition, Pearson Education,2004.
2. F.S. Hill, Computer Graphics using OPENGL, Second edition, Pearson Education, 2003.
REFERENCES:
1. James D. Foley, Andries Van Dam, Steven K. Feiner, John F. Hughes, Computer
Graphics- Principles and practice, Second Edition in C, Pearson Education, 2007.
UNIT I 2D PRIMITIVES
output primitives – Line, Circle and Ellipse drawing algorithms - Attributes of output primitives – Two dimensional Geometric transformation - Two dimensional viewing – Line, Polygon, Curve and Text clipping algorithms
UNIT II 3D CONCEPTS
Parallel and Perspective projections - Three dimensional object representation – Polygons, Curved lines, Splines, Quadric Surfaces,- Visualization of data sets - 3D transformations – Viewing -Visible surface identification.
UNIT III GRAPHICS PROGRAMMING
Color Models – RGB, YIQ, CMY, HSV – Animations – General Computer Animation, Raster, Keyframe - Graphics programming using OPENGL – Basic graphics primitives –Drawing three dimensional objects - Drawing three dimensional scenes
UNIT IV RENDERING
Introduction to Shading models – Flat and Smooth shading – Adding texture to faces – Adding shadows of objects – Building a camera in a program – Creating shaded objects – Rendering texture – Drawing Shadows.
UNIT V FRACTALS
Fractals and Self similarity – Peano curves – Creating image by iterated functions – Mandelbrot sets – Julia Sets – Random Fractals – Overview of Ray Tracing – Intersecting rays with other primitives – Adding Surface texture – Reflections and Transparency – Boolean operations on Objects
TEXT BOOKS:
1. Donald Hearn, Pauline Baker, Computer Graphics – C Version, second edition, Pearson Education,2004.
2. F.S. Hill, Computer Graphics using OPENGL, Second edition, Pearson Education, 2003.
REFERENCES:
1. James D. Foley, Andries Van Dam, Steven K. Feiner, John F. Hughes, Computer
Graphics- Principles and practice, Second Edition in C, Pearson Education, 2007.
MG2452 ENGINEERING ECONOMICS AND FINANCIAL ACCOUNTING ANNA UNIVERSITY SYLLABUS
MG2452 ENGINEERING ECONOMICS AND FINANCIAL ACCOUNTING
UNIT I INTRODUCTION
Managerial Economics - Relationship with other disciplines - Firms: Types, objectives and goals - Managerial decisions - Decision analysis.
UNIT II DEMAND & SUPPLY ANALYSIS
Demand - Types of demand - Determinants of demand - Demand function - Demand elasticity - Demand forecasting - Supply - Determinants of supply - Supply function - Supply elasticity.
UNIT III PRODUCTION AND COST ANALYSIS
Production function - Returns to scale - Production optimization - Least cost input - Isoquants - Managerial uses of production function. Cost Concepts - Cost function – Types of Cost - Determinants of cost - Short run and Long run cost curves - Cost Output Decision - Estimation of Cost.
UNIT IV PRICING
Determinants of Price - Pricing under different objectives and different market structures - Price discrimination - Pricing methods in practice – role of Government in pricing control.
UNIT V FINANCIAL ACCOUNTING (ELEMENTARY TREATMENT)
Balance sheet and related concepts - Profit & Loss Statement and related concepts - Financial Ratio Analysis - Cash flow analysis - Funds flow analysis - Comparative financial statements - Analysis & Interpretation of financial statements. Investments - Risks and return evaluation of investment decision - Average rate of return
- Payback Period - Net Present Value - Internal rate of return.
TEXT BOOKS:
1. McGuigan, Moyer and Harris, 'Managerial Economics; Applications, Strategy and Tactics', Thomson South Western, 10th Edition, 2005.
2. Prasanna Chandra. 'Fundamentals of Financial Management', Tata Mcgraw Hill Publishing Ltd., 4th edition, 2005.
REFERENCES:
1. Samuelson. Paul A and Nordhaus W.D., 'Economics', Tata Mcgraw Hill Publishing Company Limited, New Delhi, 2004.
2. Paresh Shah, 'Basic Financial Accounting for Management', Oxford University Press, New Delhi, 2007.
3. Salvatore Dominick, 'Managerial Economics in a global economy'. Thomson South Western, 4th Edition, 2001
UNIT I INTRODUCTION
Managerial Economics - Relationship with other disciplines - Firms: Types, objectives and goals - Managerial decisions - Decision analysis.
UNIT II DEMAND & SUPPLY ANALYSIS
Demand - Types of demand - Determinants of demand - Demand function - Demand elasticity - Demand forecasting - Supply - Determinants of supply - Supply function - Supply elasticity.
UNIT III PRODUCTION AND COST ANALYSIS
Production function - Returns to scale - Production optimization - Least cost input - Isoquants - Managerial uses of production function. Cost Concepts - Cost function – Types of Cost - Determinants of cost - Short run and Long run cost curves - Cost Output Decision - Estimation of Cost.
UNIT IV PRICING
Determinants of Price - Pricing under different objectives and different market structures - Price discrimination - Pricing methods in practice – role of Government in pricing control.
UNIT V FINANCIAL ACCOUNTING (ELEMENTARY TREATMENT)
Balance sheet and related concepts - Profit & Loss Statement and related concepts - Financial Ratio Analysis - Cash flow analysis - Funds flow analysis - Comparative financial statements - Analysis & Interpretation of financial statements. Investments - Risks and return evaluation of investment decision - Average rate of return
- Payback Period - Net Present Value - Internal rate of return.
TEXT BOOKS:
1. McGuigan, Moyer and Harris, 'Managerial Economics; Applications, Strategy and Tactics', Thomson South Western, 10th Edition, 2005.
2. Prasanna Chandra. 'Fundamentals of Financial Management', Tata Mcgraw Hill Publishing Ltd., 4th edition, 2005.
REFERENCES:
1. Samuelson. Paul A and Nordhaus W.D., 'Economics', Tata Mcgraw Hill Publishing Company Limited, New Delhi, 2004.
2. Paresh Shah, 'Basic Financial Accounting for Management', Oxford University Press, New Delhi, 2007.
3. Salvatore Dominick, 'Managerial Economics in a global economy'. Thomson South Western, 4th Edition, 2001
CS2358 INTERNET PROGRAMMING LAB ANNA UNIVERSITY SYLLABUS
CS2358 INTERNET PROGRAMMING LAB
LIST OF EXPERIMENTS
1.Create a web page with the following using HTML
i) To embed an image map in a web page
ii) To fix the hot spots
iii) Show all the related information when the hot spots are clicked.
2. Create a web page with all types of Cascading style sheets.
3. Client Side Scripts for Validating Web Form Controls using DHTML
4. Write programs in Java to create applets incorporating the following features:
5. Create a color palette with matrix of buttons Set background and foreground of the control text area by selecting a color from color palette. In order to select Foreground or background use check box control as radio buttons To set background images
6. Write programs in Java using Servlets:
To invoke servlets from HTML forms
To invoke servlets from Applets
7. Write programs in Java to create three-tier applications using JSP and Databases
9. Programs using AJAX
10. Consider a case where we have two web Services- an airline service and a travel agent and the travel agent is searching for an airline. Implement this scenario using Web Services and Data base.
TEXT BOOK:
1. Robert W.Sebesta, “Programming the world wide web”, Pearson Education, 2006.
REFERENCES:
1. Deitel, “Internet and world wide web, How to Program”, PHI, 3rd Edition, 2005
LIST OF EXPERIMENTS
1.Create a web page with the following using HTML
i) To embed an image map in a web page
ii) To fix the hot spots
iii) Show all the related information when the hot spots are clicked.
2. Create a web page with all types of Cascading style sheets.
3. Client Side Scripts for Validating Web Form Controls using DHTML
4. Write programs in Java to create applets incorporating the following features:
5. Create a color palette with matrix of buttons Set background and foreground of the control text area by selecting a color from color palette. In order to select Foreground or background use check box control as radio buttons To set background images
6. Write programs in Java using Servlets:
To invoke servlets from HTML forms
To invoke servlets from Applets
7. Write programs in Java to create three-tier applications using JSP and Databases
- for conducting on-line examination.
- for displaying student mark list. Assume that student information is available in database which has been stored in a database server.
9. Programs using AJAX
10. Consider a case where we have two web Services- an airline service and a travel agent and the travel agent is searching for an airline. Implement this scenario using Web Services and Data base.
TEXT BOOK:
1. Robert W.Sebesta, “Programming the world wide web”, Pearson Education, 2006.
REFERENCES:
1. Deitel, “Internet and world wide web, How to Program”, PHI, 3rd Edition, 2005
GE2321 COMMUNICATION SKILLS LABORATORY ANNA UNIVERSITY SYLLABUS
GE2321 COMMUNICATION SKILLS LABORATORY
(Fifth / Sixth Semester)
Globalisation has brought in numerous opportunities for the teeming millions, with more focus on the students’ overall capability apart from academic competence. Many students, particularly those from non-English medium schools, find that they are not preferred due to their inadequacy of communication skills and soft skills, despite possessing sound knowledge in their subject area along with technical capability. Keeping in view their pre-employment needs and career requirements, this course on Communication Skills Laboratory will prepare students to adapt themselves with ease to the industry environment, thus rendering them as prospective assets to industries. The course will equip the students with the necessary communication skills that would go a long way in helping them in their profession.
A. English Language Lab (18 Periods)
1. Listening Comprehension: (6)
Listening and typing – Listening and sequencing of sentences – Filling in the blanks -
Listening and answering questions.
2. Reading Comprehension: (6)
Filling in the blanks - Close exercises – Vocabulary building - Reading and answering
questions.
3. Speaking: (6)
Phonetics: Intonation – Ear training - Correct Pronunciation – Sound recognition
exercises – Common Errors in English.
Conversations: Face to Face Conversation – Telephone conversation – Role play
activities (Students take on roles and engage in conversation)
B. Discussion of audio-visual materials (6 periods)
(Samples are available to learn and practice)
1. Resume / Report Preparation / Letter Writing (1)
Structuring the resume / report - Letter writing / Email Communication - Samples.
2. Presentation skills: (1)
Elements of effective presentation – Structure of presentation - Presentation tools –
Voice Modulation – Audience analysis - Body language – Video samples
3. Soft Skills: (2)
Time management – Articulateness – Assertiveness – Psychometrics –
Innovation and Creativity - Stress Management & Poise - Video Samples
4. Group Discussion: (1)
Why is GD part of selection process ? - Structure of GD – Moderator – led and other
GDs - Strategies in GD – Team work - Body Language - Mock GD -Video samples
5. Interview Skills: (1)
Kinds of interviews – Required Key Skills – Corporate culture – Mock interviews-
Video samples.
I. PC based session (Weightage 40%) 24 periods
II. Practice Session (Weightage – 60%) 24 periods
20
1. Resume / Report Preparation / Letter writing: Students prepare their (2)
own resume and report.
2. Presentation Skills: Students make presentations on given topics. (8)
3. Group Discussion: Students participate in group discussions. (6)
4. Interview Skills: Students participate in Mock Interviews (8)
REFERENCES:
1. Anderson, P.V, Technical Communication, Thomson Wadsworth, Sixth Edition,
New Delhi, 2007.
2. Prakash, P, Verbal and Non-Verbal Reasoning, Macmillan India Ltd., Second
3. Edition, New Delhi, 2004.
4. John Seely, The Oxford Guide to Writing and Speaking, Oxford University
Press, New Delhi, 2004.
5. Evans, D, Decision maker, Cambridge University Press, 1997.
6. Thorpe, E, and Thorpe, S, Objective English, Pearson Education, Second
Edition, New Delhi, 2007.
7. Turton, N.D and Heaton, J.B, Dictionary of Common Errors, Addision Wesley
Longman Ltd., Indian reprint 1998.
Lab Requirements:
1. Teacher console and systems for students.
2. English Language Lab Software
3. Career Lab Software
(Fifth / Sixth Semester)
Globalisation has brought in numerous opportunities for the teeming millions, with more focus on the students’ overall capability apart from academic competence. Many students, particularly those from non-English medium schools, find that they are not preferred due to their inadequacy of communication skills and soft skills, despite possessing sound knowledge in their subject area along with technical capability. Keeping in view their pre-employment needs and career requirements, this course on Communication Skills Laboratory will prepare students to adapt themselves with ease to the industry environment, thus rendering them as prospective assets to industries. The course will equip the students with the necessary communication skills that would go a long way in helping them in their profession.
A. English Language Lab (18 Periods)
1. Listening Comprehension: (6)
Listening and typing – Listening and sequencing of sentences – Filling in the blanks -
Listening and answering questions.
2. Reading Comprehension: (6)
Filling in the blanks - Close exercises – Vocabulary building - Reading and answering
questions.
3. Speaking: (6)
Phonetics: Intonation – Ear training - Correct Pronunciation – Sound recognition
exercises – Common Errors in English.
Conversations: Face to Face Conversation – Telephone conversation – Role play
activities (Students take on roles and engage in conversation)
B. Discussion of audio-visual materials (6 periods)
(Samples are available to learn and practice)
1. Resume / Report Preparation / Letter Writing (1)
Structuring the resume / report - Letter writing / Email Communication - Samples.
2. Presentation skills: (1)
Elements of effective presentation – Structure of presentation - Presentation tools –
Voice Modulation – Audience analysis - Body language – Video samples
3. Soft Skills: (2)
Time management – Articulateness – Assertiveness – Psychometrics –
Innovation and Creativity - Stress Management & Poise - Video Samples
4. Group Discussion: (1)
Why is GD part of selection process ? - Structure of GD – Moderator – led and other
GDs - Strategies in GD – Team work - Body Language - Mock GD -Video samples
5. Interview Skills: (1)
Kinds of interviews – Required Key Skills – Corporate culture – Mock interviews-
Video samples.
I. PC based session (Weightage 40%) 24 periods
II. Practice Session (Weightage – 60%) 24 periods
20
1. Resume / Report Preparation / Letter writing: Students prepare their (2)
own resume and report.
2. Presentation Skills: Students make presentations on given topics. (8)
3. Group Discussion: Students participate in group discussions. (6)
4. Interview Skills: Students participate in Mock Interviews (8)
REFERENCES:
1. Anderson, P.V, Technical Communication, Thomson Wadsworth, Sixth Edition,
New Delhi, 2007.
2. Prakash, P, Verbal and Non-Verbal Reasoning, Macmillan India Ltd., Second
3. Edition, New Delhi, 2004.
4. John Seely, The Oxford Guide to Writing and Speaking, Oxford University
Press, New Delhi, 2004.
5. Evans, D, Decision maker, Cambridge University Press, 1997.
6. Thorpe, E, and Thorpe, S, Objective English, Pearson Education, Second
Edition, New Delhi, 2007.
7. Turton, N.D and Heaton, J.B, Dictionary of Common Errors, Addision Wesley
Longman Ltd., Indian reprint 1998.
Lab Requirements:
1. Teacher console and systems for students.
2. English Language Lab Software
3. Career Lab Software
CS2357 OOAD LAB ANNA UNIVERSITY SYLLABUS
CS2357 OOAD LAB
OBJECTIVE:
To develop a mini-project following the 12 exercises listed below.
1. To develop a problem statement.
2. Develop an IEEE standard SRS document. Also develop risk management and project plan (Gantt chart).
3. Identify Use Cases and develop the Use Case model.
4. Identify the business activities and develop an UML Activity diagram.
5. Identity the conceptual classes and develop a domain model with UML Class diagram.
6. Using the identified scenarios find the interaction between objects and represent them using UML Interaction diagrams.
7. Draw the State Chart diagram.
8. Identify the User Interface, Domain objects, and Technical services. Draw the partial layered, logical architecture diagram with UML package diagram notation.
9. Implement the Technical services layer.
10. Implement the Domain objects layer.
11. Implement the User Interface layer.
12. Draw Component and Deployment diagrams.
Suggested domains for Mini-project.
1. Passport automation system.
2. Book bank
3. Exam Registration
4. Stock maintenance system.
5. Online course reservation system
6. E-ticketing
7. Software personnel management system
8. Credit card processing
9. e-book management system
10. Recruitment system
11. Foreign trading system
12. Conference Management System
13. BPO Management System
OBJECTIVE:
To develop a mini-project following the 12 exercises listed below.
1. To develop a problem statement.
2. Develop an IEEE standard SRS document. Also develop risk management and project plan (Gantt chart).
3. Identify Use Cases and develop the Use Case model.
4. Identify the business activities and develop an UML Activity diagram.
5. Identity the conceptual classes and develop a domain model with UML Class diagram.
6. Using the identified scenarios find the interaction between objects and represent them using UML Interaction diagrams.
7. Draw the State Chart diagram.
8. Identify the User Interface, Domain objects, and Technical services. Draw the partial layered, logical architecture diagram with UML package diagram notation.
9. Implement the Technical services layer.
10. Implement the Domain objects layer.
11. Implement the User Interface layer.
12. Draw Component and Deployment diagrams.
Suggested domains for Mini-project.
1. Passport automation system.
2. Book bank
3. Exam Registration
4. Stock maintenance system.
5. Online course reservation system
6. E-ticketing
7. Software personnel management system
8. Credit card processing
9. e-book management system
10. Recruitment system
11. Foreign trading system
12. Conference Management System
13. BPO Management System
CS2354 ADVANCED COMPUTER ARCHITECTURE ANNA UNIVERSITY SYLLABUS
CS2354 ADVANCED COMPUTER ARCHITECTURE
UNIT I INSTRUCTION LEVEL PARALLELISM
ILP – Concepts and challenges – Hardware and software approaches – Dynamic scheduling – Speculation - Compiler techniques for exposing ILP – Branch prediction.
UNIT II MULTIPLE ISSUE PROCESSORS
VLIW & EPIC – Advanced compiler support – Hardware support for exposing parallelism – Hardware versus software speculation mechanisms – IA 64 and Itanium processors – Limits on ILP.
UNIT III MULTIPROCESSORS AND THREAD LEVEL PARALLELISM
Symmetric and distributed shared memory architectures – Performance issues – Synchronization – Models of memory consistency – Introduction to Multithreading.
UNIT IV MEMORY AND I/O
Cache performance – Reducing cache miss penalty and miss rate – Reducing hit time – Main memory and performance – Memory technology. Types of storage devices – Buses – RAID – Reliability, availability and dependability – I/O performance measures – Designing an I/O system.
UNIT V MULTI-CORE ARCHITECTURES
Software and hardware multithreading – SMT and CMP architectures – Design issues – Case studies – Intel Multi-core architecture – SUN CMP architecture - heterogenous multi-core processors – case study: IBM Cell Processor.
TEXT BOOKS:
1. John L. Hennessey and David A. Patterson, “ Computer architecture – A quantitative approach”, Morgan Kaufmann / Elsevier Publishers, 4th. edition, 2007.
REFERENCES:
1. David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture: A hardware/software approach” , Morgan Kaufmann /Elsevier Publishers, 1999.
2. Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw Hill, New
Delhi, 2003.
UNIT I INSTRUCTION LEVEL PARALLELISM
ILP – Concepts and challenges – Hardware and software approaches – Dynamic scheduling – Speculation - Compiler techniques for exposing ILP – Branch prediction.
UNIT II MULTIPLE ISSUE PROCESSORS
VLIW & EPIC – Advanced compiler support – Hardware support for exposing parallelism – Hardware versus software speculation mechanisms – IA 64 and Itanium processors – Limits on ILP.
UNIT III MULTIPROCESSORS AND THREAD LEVEL PARALLELISM
Symmetric and distributed shared memory architectures – Performance issues – Synchronization – Models of memory consistency – Introduction to Multithreading.
UNIT IV MEMORY AND I/O
Cache performance – Reducing cache miss penalty and miss rate – Reducing hit time – Main memory and performance – Memory technology. Types of storage devices – Buses – RAID – Reliability, availability and dependability – I/O performance measures – Designing an I/O system.
UNIT V MULTI-CORE ARCHITECTURES
Software and hardware multithreading – SMT and CMP architectures – Design issues – Case studies – Intel Multi-core architecture – SUN CMP architecture - heterogenous multi-core processors – case study: IBM Cell Processor.
TEXT BOOKS:
1. John L. Hennessey and David A. Patterson, “ Computer architecture – A quantitative approach”, Morgan Kaufmann / Elsevier Publishers, 4th. edition, 2007.
REFERENCES:
1. David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture: A hardware/software approach” , Morgan Kaufmann /Elsevier Publishers, 1999.
2. Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw Hill, New
Delhi, 2003.
CS2353 OBJECT ORIENTED ANALYSIS AND DESIGN ANNA UNIVERSITY SYLLABUS
CS2353 OBJECT ORIENTED ANALYSIS AND DESIGN
UNIT I
Introduction to OOAD – What is OOAD? – What is UML? What are the United process(UP) phases - Case study – the NextGen POS system, Inception -Use case Modeling - Relating Use cases – include, extend and generalization.
UNIT II
Elaboration - Domain Models - Finding conceptual classes and description classes – Associations – Attributes – Domain model refinement – Finding conceptual class hierarchies- Aggregation and Composition- UML activity diagrams and modeling
UNIT III
system sequence diagrams - Relationship between sequence diagrams and use cases Logical architecture and UML package diagram – Logical architecture refinement - UML class diagrams - UML interaction diagrams
UNIT IV
GRASP: Designing objects with responsibilities – Creator – Information expert – Low Coupling –Controller – High Cohesion – Designing for visibility - Applying GoF design patterns – adapter, singleton, factory and observer patterns.
UNIT V
UML state diagrams and modeling - Operation contracts- Mapping design to code -UML deployment and component diagrams
TEXT BOOK :
1.Craig Larman,"Applying UML and Patterns: An Introduction to object-oriented Analysis and Design and iterative development”, Third Edition, Pearson Education, 2005
REFERENCES:
1. Mike O’Docherty, “Object-Oriented Analysis & Design: Understanding System Development with UML 2.0”, John Wiley & Sons, 2005.
2. James W- Cooper, Addison-Wesley, “Java Design Patterns – A Tutorial”, 2000.
3. Micheal Blaha, James Rambaugh, “Object-Oriented Modeling and Design with UML”,
Second Edition, Prentice Hall of India Private Limited, 2007
4. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides,“Design patterns:
Elements of Reusable object-oriented software”, Addison-Wesley, 1995.
UNIT I
Introduction to OOAD – What is OOAD? – What is UML? What are the United process(UP) phases - Case study – the NextGen POS system, Inception -Use case Modeling - Relating Use cases – include, extend and generalization.
UNIT II
Elaboration - Domain Models - Finding conceptual classes and description classes – Associations – Attributes – Domain model refinement – Finding conceptual class hierarchies- Aggregation and Composition- UML activity diagrams and modeling
UNIT III
system sequence diagrams - Relationship between sequence diagrams and use cases Logical architecture and UML package diagram – Logical architecture refinement - UML class diagrams - UML interaction diagrams
UNIT IV
GRASP: Designing objects with responsibilities – Creator – Information expert – Low Coupling –Controller – High Cohesion – Designing for visibility - Applying GoF design patterns – adapter, singleton, factory and observer patterns.
UNIT V
UML state diagrams and modeling - Operation contracts- Mapping design to code -UML deployment and component diagrams
TEXT BOOK :
1.Craig Larman,"Applying UML and Patterns: An Introduction to object-oriented Analysis and Design and iterative development”, Third Edition, Pearson Education, 2005
REFERENCES:
1. Mike O’Docherty, “Object-Oriented Analysis & Design: Understanding System Development with UML 2.0”, John Wiley & Sons, 2005.
2. James W- Cooper, Addison-Wesley, “Java Design Patterns – A Tutorial”, 2000.
3. Micheal Blaha, James Rambaugh, “Object-Oriented Modeling and Design with UML”,
Second Edition, Prentice Hall of India Private Limited, 2007
4. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides,“Design patterns:
Elements of Reusable object-oriented software”, Addison-Wesley, 1995.
CS2352 PRINCIPLES OF COMPILER DESIGN ANNA UNIVERSITY SYLLABUS
CS2352 PRINCIPLES OF COMPILER DESIGN
UNIT I LEXICAL ANALYSIS
Introduction to Compiling- Compilers-Analysis of the source program-The phases- Cousins-The grouping of phases-Compiler construction tools. The role of the lexical analyzer- Input buffering-Specification of tokens-Recognition of tokens-A language for specifying lexical analyzer.
UNIT II SYNTAX ANALYSIS and RUN-TIME ENVIRONMENTS
Syntax Analysis- The role of the parser-Context-free grammars-Writing a grammar-Topdown parsing-Bottom-up Parsing-LR parsers-Constructing an SLR(1) parsing table. Type Checking- Type Systems-Specification of a simple type checker. Run-Time Environments-Source language issues-Storage organization-Storage-allocation strategies.
UNIT III INTERMEDIATE CODE GENERATION
Intermediate languages-Declarations-Assignment statements - Boolean expressions- Case statements- Backpatching-Procedure calls
UNIT IV CODE GENERATION
Issues in the design of a code generator- The target machine-Run-time storage management-Basic blocks and flow graphs- Next-use information-A simple codegenerator-Register allocation and assignment-The dag representation of basic blocks - Generating code from dags.
UNIT V CODE OPTIMIZATION
Introduction-The principle sources of optimization-Peephole optimization- Optimization of basic blocks-Loops in flow graphs- Introduction to global data-flow analysis-Code improving transformations.
TEXT BOOK:
1. Alfred V. Aho, Ravi Sethi Jeffrey D. Ullman, “Compilers- Principles, Techniques, and Tools”, Pearson Education Asia, 2007.
REFERENCES:
1. David Galles, “Modern Compiler Design”, Pearson Education Asia, 2007
2. Steven S. Muchnick, “Advanced Compiler Design & Implementation”,Morgan Kaufmann Pulishers, 2000.
3. C. N. Fisher and R. J. LeBlanc “Crafting a Compiler with C”, Pearson Education, 2000.
UNIT I LEXICAL ANALYSIS
Introduction to Compiling- Compilers-Analysis of the source program-The phases- Cousins-The grouping of phases-Compiler construction tools. The role of the lexical analyzer- Input buffering-Specification of tokens-Recognition of tokens-A language for specifying lexical analyzer.
UNIT II SYNTAX ANALYSIS and RUN-TIME ENVIRONMENTS
Syntax Analysis- The role of the parser-Context-free grammars-Writing a grammar-Topdown parsing-Bottom-up Parsing-LR parsers-Constructing an SLR(1) parsing table. Type Checking- Type Systems-Specification of a simple type checker. Run-Time Environments-Source language issues-Storage organization-Storage-allocation strategies.
UNIT III INTERMEDIATE CODE GENERATION
Intermediate languages-Declarations-Assignment statements - Boolean expressions- Case statements- Backpatching-Procedure calls
UNIT IV CODE GENERATION
Issues in the design of a code generator- The target machine-Run-time storage management-Basic blocks and flow graphs- Next-use information-A simple codegenerator-Register allocation and assignment-The dag representation of basic blocks - Generating code from dags.
UNIT V CODE OPTIMIZATION
Introduction-The principle sources of optimization-Peephole optimization- Optimization of basic blocks-Loops in flow graphs- Introduction to global data-flow analysis-Code improving transformations.
TEXT BOOK:
1. Alfred V. Aho, Ravi Sethi Jeffrey D. Ullman, “Compilers- Principles, Techniques, and Tools”, Pearson Education Asia, 2007.
REFERENCES:
1. David Galles, “Modern Compiler Design”, Pearson Education Asia, 2007
2. Steven S. Muchnick, “Advanced Compiler Design & Implementation”,Morgan Kaufmann Pulishers, 2000.
3. C. N. Fisher and R. J. LeBlanc “Crafting a Compiler with C”, Pearson Education, 2000.
CS2351 ARTIFICIAL INTELLIGENCE ANNA UNIVERSITY SYLLABUS
CS2351 ARTIFICIAL INTELLIGENCE L T P C
UNIT I PROBLEM SOLVING
Introduction – Agents – Problem formulation – uninformed search strategies – heuristics – informed search strategies – constraint satisfaction
UNIT II LOGICAL REASONING
Logical agents – propositional logic – inferences – first-order logic – inferences in firstorder logic – forward chaining – backward chaining – unification – resolution
UNIT III PLANNING
Planning with state-space search – partial-order planning – planning graphs – planning and acting in the real world
UNIT IV UNCERTAIN KNOWLEDGE AND REASONING
Uncertainty – review of probability - probabilistic Reasoning – Bayesian networks – inferences in Bayesian networks – Temporal models – Hidden Markov models
UNIT V LEARNING
Learning from observation - Inductive learning – Decision trees – Explanation basedlearning – Statistical Learning methods - Reinforcement Learning
TEXT BOOK:
1. S. Russel and P. Norvig, “Artificial Intelligence – A Modern Approach”, Second Edition, Pearson Education, 2003.
REFERENCES:
1. David Poole, Alan Mackworth, Randy Goebel, ”Computational Intelligence : a logical approach”, Oxford University Press, 2004.
2. G. Luger, “Artificial Intelligence: Structures and Strategies for complex problem solving”, Fourth Edition, Pearson Education, 2002.
3. J. Nilsson, “Artificial Intelligence: A new Synthesis”, Elsevier Publishers, 1998.
UNIT I PROBLEM SOLVING
Introduction – Agents – Problem formulation – uninformed search strategies – heuristics – informed search strategies – constraint satisfaction
UNIT II LOGICAL REASONING
Logical agents – propositional logic – inferences – first-order logic – inferences in firstorder logic – forward chaining – backward chaining – unification – resolution
UNIT III PLANNING
Planning with state-space search – partial-order planning – planning graphs – planning and acting in the real world
UNIT IV UNCERTAIN KNOWLEDGE AND REASONING
Uncertainty – review of probability - probabilistic Reasoning – Bayesian networks – inferences in Bayesian networks – Temporal models – Hidden Markov models
UNIT V LEARNING
Learning from observation - Inductive learning – Decision trees – Explanation basedlearning – Statistical Learning methods - Reinforcement Learning
TEXT BOOK:
1. S. Russel and P. Norvig, “Artificial Intelligence – A Modern Approach”, Second Edition, Pearson Education, 2003.
REFERENCES:
1. David Poole, Alan Mackworth, Randy Goebel, ”Computational Intelligence : a logical approach”, Oxford University Press, 2004.
2. G. Luger, “Artificial Intelligence: Structures and Strategies for complex problem solving”, Fourth Edition, Pearson Education, 2002.
3. J. Nilsson, “Artificial Intelligence: A new Synthesis”, Elsevier Publishers, 1998.
CS2309 JAVA LAB ANNA UNIVERSITY SYLLABUS
1. Develop Rational number class in Java. Use JavaDoc comments for documentation. Your implementation should use efficient representation for a rational number, i.e. (500 / 1000) should be represented as (½).
2. Develop Date class in Java similar to the one available in java.util package. Use JavaDoc comments.
3. Implement Lisp-like list in Java. Write basic operations such as 'car', 'cdr', and 'cons'. If L is a list [3, 0, 2, 5], L.car() returns 3, while L.cdr() returns [0,2,5].
4. Design a Java interface for ADT Stack. Develop two different classes that implement this interface, one using array and the other using linked-list. Provide necessary exception handling in both the implementations.
5. Design a Vehicle class hierarchy in Java. Write a test program to demonstrate polymorphism.
6. Design classes for Currency, Rupee, and Dollar. Write a program that randomly generates Rupee and Dollar objects and write them into a file using object serialization. Write another program to read that file, convert to Rupee if it reads a Dollar, while leave the value as it is if it reads a Rupee.
7. Design a scientific calculator using event-driven programming paradigm of Java.
8. Write a multi-threaded Java program to print all numbers below 100,000 that are both prime and fibonacci number (some examples are 2, 3, 5, 13, etc.). Design a thread that generates prime numbers below 100,000 and writes them into a pipe.
Design another thread that generates fibonacci numbers and writes them to another pipe. The main thread should read both the pipes to identify numbers common to both.
9. Develop a simple OPAC system for library using even-driven and concurrent programming paradigms of Java. Use JDBC to connect to a back-end database.
10. Develop multi-threaded echo server and a corresponding GUI client in Java.
11. [Mini-Project] Develop a programmer's editor in Java that supports syntaxhighlighting,
compilation support, debugging support, etc.
2. Develop Date class in Java similar to the one available in java.util package. Use JavaDoc comments.
3. Implement Lisp-like list in Java. Write basic operations such as 'car', 'cdr', and 'cons'. If L is a list [3, 0, 2, 5], L.car() returns 3, while L.cdr() returns [0,2,5].
4. Design a Java interface for ADT Stack. Develop two different classes that implement this interface, one using array and the other using linked-list. Provide necessary exception handling in both the implementations.
5. Design a Vehicle class hierarchy in Java. Write a test program to demonstrate polymorphism.
6. Design classes for Currency, Rupee, and Dollar. Write a program that randomly generates Rupee and Dollar objects and write them into a file using object serialization. Write another program to read that file, convert to Rupee if it reads a Dollar, while leave the value as it is if it reads a Rupee.
7. Design a scientific calculator using event-driven programming paradigm of Java.
8. Write a multi-threaded Java program to print all numbers below 100,000 that are both prime and fibonacci number (some examples are 2, 3, 5, 13, etc.). Design a thread that generates prime numbers below 100,000 and writes them into a pipe.
Design another thread that generates fibonacci numbers and writes them to another pipe. The main thread should read both the pipes to identify numbers common to both.
9. Develop a simple OPAC system for library using even-driven and concurrent programming paradigms of Java. Use JDBC to connect to a back-end database.
10. Develop multi-threaded echo server and a corresponding GUI client in Java.
11. [Mini-Project] Develop a programmer's editor in Java that supports syntaxhighlighting,
compilation support, debugging support, etc.
CS2308 SYSTEM SOFTWARE LAB ANNA UNIVERSITY SYLLABUS
(Using C)
1. Implement a symbol table with functions to create, insert, modify, search, and display.
2. Implement pass one of a two pass assembler.
3. Implement pass two of a two pass assembler.
4. Implement a single pass assembler.
5. Implement a two pass macro processor
6. Implement a single pass macro processor.
7. Implement an absolute loader.
8. Implement a relocating loader.
9. Implement pass one of a direct-linking loader.
10. Implement pass two of a direct-linking loader.
11. Implement a simple text editor with features like insertion / deletion of a character, word, and sentence.
12. Implement a symbol table with suitable hashing
1. Implement a symbol table with functions to create, insert, modify, search, and display.
2. Implement pass one of a two pass assembler.
3. Implement pass two of a two pass assembler.
4. Implement a single pass assembler.
5. Implement a two pass macro processor
6. Implement a single pass macro processor.
7. Implement an absolute loader.
8. Implement a relocating loader.
9. Implement pass one of a direct-linking loader.
10. Implement pass two of a direct-linking loader.
11. Implement a simple text editor with features like insertion / deletion of a character, word, and sentence.
12. Implement a symbol table with suitable hashing
CS2307 NETWORK LAB ANNA UNIVERSITY SYLLABUS
CS2307 NETWORK LAB
1. Programs using TCP Sockets (like date and time server & client, echo server & client, etc..)
2. Programs using UDP Sockets (like simple DNS)
3. Programs using Raw sockets (like packet capturing and filtering)
4. Programs using RPC
5. Simulation of sliding window protocols Experiments using simulators (like OPNET)
6. Performance comparison of MAC protocols
7. Implementing Routing Protocols
8. Performance comparison of Routing protocols
9. Study of UDP performance
10. Study of TCP performance.
1. Programs using TCP Sockets (like date and time server & client, echo server & client, etc..)
2. Programs using UDP Sockets (like simple DNS)
3. Programs using Raw sockets (like packet capturing and filtering)
4. Programs using RPC
5. Simulation of sliding window protocols Experiments using simulators (like OPNET)
6. Performance comparison of MAC protocols
7. Implementing Routing Protocols
8. Performance comparison of Routing protocols
9. Study of UDP performance
10. Study of TCP performance.
CS2304 SYSTEM SOFTWARE ANNA UNIVERSITY SYLLABUS
CS2304 SYSTEM SOFTWARE
UNIT I INTRODUCTION
System software and machine architecture – The Simplified Instructional Computer (SIC) - Machine architecture - Data and instruction formats - addressing modes - instruction sets - I/O and programming.
UNIT II ASSEMBLERS
Basic assembler functions - A simple SIC assembler – Assembler algorithm and data structures - Machine dependent assembler features - Instruction formats and addressing modes – Program relocation - Machine independent assembler features - Literals –Symbol-defining statements – Expressions - One pass assemblers and Multi pass assemblers - Implementation example - MASM assembler.
UNIT III LOADERS AND LINKERS
Basic loader functions - Design of an Absolute Loader – A Simple Bootstrap Loader - Machine dependent loader features - Relocation – Program Linking – Algorithm and Data Structures for Linking Loader - Machine-independent loader features - Automatic Library Search – Loader Options - Loader design options - Linkage Editors – Dynamic Linking – Bootstrap Loaders - Implementation example - MSDOS linker.
UNIT IV MACRO PROCESSORS
Basic macro processor functions - Macro Definition and Expansion – Macro Processor Algorithm and data structures - Machine-independent macro processor features - Concatenation of Macro Parameters – Generation of Unique Labels – Conditional Macro Expansion – Keyword Macro Parameters-Macro within Macro-Implementation example -MASM Macro Processor – ANSI C Macro language.
UNIT V SYSTEM SOFTWARE TOOLS
Text editors - Overview of the Editing Process - User Interface – Editor Structure. - Interactive debugging systems - Debugging functions and capabilities – Relationship with other parts of the system – User-Interface Criteria.
TEXT BOOK:
1. Leland L. Beck, “System Software – An Introduction to Systems Programming”, 3rd Edition, Pearson Education Asia, 2006.
REFERENCES:
1. D. M. Dhamdhere, “Systems Programming and Operating Systems”, Second Revised Edition, Tata McGraw-Hill, 2000.
2. John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 2000.
3. John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann
UNIT I INTRODUCTION
System software and machine architecture – The Simplified Instructional Computer (SIC) - Machine architecture - Data and instruction formats - addressing modes - instruction sets - I/O and programming.
UNIT II ASSEMBLERS
Basic assembler functions - A simple SIC assembler – Assembler algorithm and data structures - Machine dependent assembler features - Instruction formats and addressing modes – Program relocation - Machine independent assembler features - Literals –Symbol-defining statements – Expressions - One pass assemblers and Multi pass assemblers - Implementation example - MASM assembler.
UNIT III LOADERS AND LINKERS
Basic loader functions - Design of an Absolute Loader – A Simple Bootstrap Loader - Machine dependent loader features - Relocation – Program Linking – Algorithm and Data Structures for Linking Loader - Machine-independent loader features - Automatic Library Search – Loader Options - Loader design options - Linkage Editors – Dynamic Linking – Bootstrap Loaders - Implementation example - MSDOS linker.
UNIT IV MACRO PROCESSORS
Basic macro processor functions - Macro Definition and Expansion – Macro Processor Algorithm and data structures - Machine-independent macro processor features - Concatenation of Macro Parameters – Generation of Unique Labels – Conditional Macro Expansion – Keyword Macro Parameters-Macro within Macro-Implementation example -MASM Macro Processor – ANSI C Macro language.
UNIT V SYSTEM SOFTWARE TOOLS
Text editors - Overview of the Editing Process - User Interface – Editor Structure. - Interactive debugging systems - Debugging functions and capabilities – Relationship with other parts of the system – User-Interface Criteria.
TEXT BOOK:
1. Leland L. Beck, “System Software – An Introduction to Systems Programming”, 3rd Edition, Pearson Education Asia, 2006.
REFERENCES:
1. D. M. Dhamdhere, “Systems Programming and Operating Systems”, Second Revised Edition, Tata McGraw-Hill, 2000.
2. John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 2000.
3. John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann
CS2305 PROGRAMMING PARADIGMS Anna University Syllabus
.CS2305 PROGRAMMING PARADIGMS
UNIT I OBJECT-ORIENTED PROGRAMMING – FUNDAMENTALS
Review of OOP - Objects and classes in Java – defining classes – methods - access specifiers – static members – constructors – finalize method – Arrays – Strings - Packages – JavaDoc comments
UNIT II OBJECT-ORIENTED PROGRAMMING – INHERITANCE
Inheritance – class hierarchy – polymorphism – dynamic binding – final keyword – abstract classes – the Object class – Reflection – interfaces – object cloning – inner classes – proxies
UNIT III EVENT-DRIVEN PROGRAMMING
Graphics programming – Frame – Components – working with 2D shapes – Using color, fonts, and images - Basics of event handling – event handlers – adapter classes – actions – mouse events – AWT event hierarchy – introduction to Swing – Model-View- Controller design pattern – buttons – layout management – Swing Components
UNIT IV GENERIC PROGRAMMING
Motivation for generic programming – generic classes – generic methods – generic code and virtual machine – inheritance and generics – reflection and generics – exceptions – exception hierarchy – throwing and catching exceptions – Stack Trace Elements - assertions - logging
UNIT V CONCURRENT PROGRAMMING
Multi-threaded programming – interrupting threads – thread states – thread properties – thread synchronization – thread-safe Collections – Executors – synchronizers – threads and event-driven programming
TEXT BOOK:
1. Cay S. Horstmann and Gary Cornell, “Core Java: Volume I – Fundamentals”, Eighth Edition, Sun Microsystems Press, 2008.
REFERENCES:
1. D. M. Dhamdhere, “Systems Programming and Operating Systems”, Second Revised Edition, Tata McGraw-Hill, 2000.
2. John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 2000.
3. John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann Publishers, 2000.
UNIT I OBJECT-ORIENTED PROGRAMMING – FUNDAMENTALS
Review of OOP - Objects and classes in Java – defining classes – methods - access specifiers – static members – constructors – finalize method – Arrays – Strings - Packages – JavaDoc comments
UNIT II OBJECT-ORIENTED PROGRAMMING – INHERITANCE
Inheritance – class hierarchy – polymorphism – dynamic binding – final keyword – abstract classes – the Object class – Reflection – interfaces – object cloning – inner classes – proxies
UNIT III EVENT-DRIVEN PROGRAMMING
Graphics programming – Frame – Components – working with 2D shapes – Using color, fonts, and images - Basics of event handling – event handlers – adapter classes – actions – mouse events – AWT event hierarchy – introduction to Swing – Model-View- Controller design pattern – buttons – layout management – Swing Components
UNIT IV GENERIC PROGRAMMING
Motivation for generic programming – generic classes – generic methods – generic code and virtual machine – inheritance and generics – reflection and generics – exceptions – exception hierarchy – throwing and catching exceptions – Stack Trace Elements - assertions - logging
UNIT V CONCURRENT PROGRAMMING
Multi-threaded programming – interrupting threads – thread states – thread properties – thread synchronization – thread-safe Collections – Executors – synchronizers – threads and event-driven programming
TEXT BOOK:
1. Cay S. Horstmann and Gary Cornell, “Core Java: Volume I – Fundamentals”, Eighth Edition, Sun Microsystems Press, 2008.
REFERENCES:
1. D. M. Dhamdhere, “Systems Programming and Operating Systems”, Second Revised Edition, Tata McGraw-Hill, 2000.
2. John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 2000.
3. John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufmann Publishers, 2000.
CS2303 THEORY OF COMPUTATION Anna University Syllabus
CS2303 THEORY OF COMPUTATION
UNIT I AUTOMATA
Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite Automata (FA) – Deterministic Finite Automata (DFA) – Non-deterministic Finite Automata (NFA) – Finite Automata with Epsilon transitions.
UNIT II REGULAR EXPRESSIONS AND LANGUAGES
Regular Expression – FA and Regular Expressions – Proving languages not to be regular – Closure properties of regular languages – Equivalence and minimization of Automata.
UNIT III CONTEXT-FREE GRAMMARS AND LANGUAGES
Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages – Definition of the Pushdown automata – Languages of a Pushdown Automata – Equivalence of Pushdown automata and CFG– Deterministic Pushdown Automata.
UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES
Normal forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing Machines – Programming Techniques for TM.
UNIT V UNDECIDABALITY
A language that is not Recursively Enumerable (RE) – An undecidable problem that is RE – Undecidable problems about Turing Machine – Post’s Correspondence Problem – The classes P and NP.
TEXT BOOK:
1. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory, Languages and Computations”, second Edition, Pearson Education, 2007.
REFERENCES:
1. H.R. Lewis and C.H. Papadimitriou, “Elements of the theory of Computation”, Second Edition, Pearson Education, 2003.
2. Thomas A. Sudkamp,” An Introduction to the Theory of Computer Science, Languages and Machines”, Third Edition, Pearson Education, 2007.
3. Raymond Greenlaw an H.James Hoover, “ Fundamentals of Theory of Computation, Principles and Practice”, Morgan Kaufmann Publishers, 1998.
4. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole,1997.
5. J. Martin, “Introduction to Languages and the Theory of computation” Third Edition, Tata Mc Graw Hill, 2007
UNIT I AUTOMATA
Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite Automata (FA) – Deterministic Finite Automata (DFA) – Non-deterministic Finite Automata (NFA) – Finite Automata with Epsilon transitions.
UNIT II REGULAR EXPRESSIONS AND LANGUAGES
Regular Expression – FA and Regular Expressions – Proving languages not to be regular – Closure properties of regular languages – Equivalence and minimization of Automata.
UNIT III CONTEXT-FREE GRAMMARS AND LANGUAGES
Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages – Definition of the Pushdown automata – Languages of a Pushdown Automata – Equivalence of Pushdown automata and CFG– Deterministic Pushdown Automata.
UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES
Normal forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing Machines – Programming Techniques for TM.
UNIT V UNDECIDABALITY
A language that is not Recursively Enumerable (RE) – An undecidable problem that is RE – Undecidable problems about Turing Machine – Post’s Correspondence Problem – The classes P and NP.
TEXT BOOK:
1. J.E. Hopcroft, R. Motwani and J.D. Ullman, “Introduction to Automata Theory, Languages and Computations”, second Edition, Pearson Education, 2007.
REFERENCES:
1. H.R. Lewis and C.H. Papadimitriou, “Elements of the theory of Computation”, Second Edition, Pearson Education, 2003.
2. Thomas A. Sudkamp,” An Introduction to the Theory of Computer Science, Languages and Machines”, Third Edition, Pearson Education, 2007.
3. Raymond Greenlaw an H.James Hoover, “ Fundamentals of Theory of Computation, Principles and Practice”, Morgan Kaufmann Publishers, 1998.
4. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole,1997.
5. J. Martin, “Introduction to Languages and the Theory of computation” Third Edition, Tata Mc Graw Hill, 2007
CS2302 COMPUTER NETWORKS Anna University Syllabus
CS2302 COMPUTER NETWORKS
UNIT I
Network architecture – layers – Physical links – Channel access on links – Hybrid multiple access techniques - Issues in the data link layer - Framing – Error correction and detection – Link-level Flow Control
UNIT II
Medium access – CSMA – Ethernet – Token ring – FDDI - Wireless LAN – Bridges andSwitches
UNIT III
Circuit switching vs. packet switching / Packet switched networks – IP – ARP – RARP – DHCP – ICMP – Queueing discipline – Routing algorithms – RIP – OSPF – Subnetting – CIDR – Interdomain routing – BGP – Ipv6 – Multicasting – Congestion avoidance in network layer
UNIT IV
UDP – TCP – Adaptive Flow Control – Adaptive Retransmission - Congestion control – Congestion avoidance – QoS
UNIT V
Email (SMTP, MIME, IMAP, POP3) – HTTP – DNS- SNMP – Telnet – FTP – Security – PGP - SSH
TEXT BOOK:
1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Fourth Edition, Morgan Kauffmann Publishers Inc., 2009, Elsevier.
REFERENCES:
1. James F. Kuross, Keith W. Ross, “Computer Networking, A Top-Down Approach Featuring the Internet”, Third Edition, Addison Wesley, 2004.
2. Nader F. Mir, “Computer and Communication Networks”, Pearson Education, 2007
3. Comer, “Computer Networks and Internets with Internet Applications”, Fourth Edition, Pearson Education, 2005.
4. Andrew S. Tanenbaum, “Computer Networks”, Sixth Edition, 2003, PHI Learning.
5. William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson Education, 2000
UNIT I
Network architecture – layers – Physical links – Channel access on links – Hybrid multiple access techniques - Issues in the data link layer - Framing – Error correction and detection – Link-level Flow Control
UNIT II
Medium access – CSMA – Ethernet – Token ring – FDDI - Wireless LAN – Bridges andSwitches
UNIT III
Circuit switching vs. packet switching / Packet switched networks – IP – ARP – RARP – DHCP – ICMP – Queueing discipline – Routing algorithms – RIP – OSPF – Subnetting – CIDR – Interdomain routing – BGP – Ipv6 – Multicasting – Congestion avoidance in network layer
UNIT IV
UDP – TCP – Adaptive Flow Control – Adaptive Retransmission - Congestion control – Congestion avoidance – QoS
UNIT V
Email (SMTP, MIME, IMAP, POP3) – HTTP – DNS- SNMP – Telnet – FTP – Security – PGP - SSH
TEXT BOOK:
1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Fourth Edition, Morgan Kauffmann Publishers Inc., 2009, Elsevier.
REFERENCES:
1. James F. Kuross, Keith W. Ross, “Computer Networking, A Top-Down Approach Featuring the Internet”, Third Edition, Addison Wesley, 2004.
2. Nader F. Mir, “Computer and Communication Networks”, Pearson Education, 2007
3. Comer, “Computer Networks and Internets with Internet Applications”, Fourth Edition, Pearson Education, 2005.
4. Andrew S. Tanenbaum, “Computer Networks”, Sixth Edition, 2003, PHI Learning.
5. William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson Education, 2000
MA2265 DISCRETE MATHEMATICS Anna University Syllabus
MA2265 DISCRETE MATHEMATICS
UNIT I LOGIC AND PROOFS
Propositional Logic – Propositional equivalences-Predicates and quantifiers-Nested Quantifiers-Rules of inference-introduction to Proofs-Proof Methods and strategy
UNIT II COMBINATORICS
Mathematical inductions-Strong induction and well ordering-.The basics of counting-The pigeonhole principle –Permutations and combinations-Recurrence relations-Solving Linear recurrence relations-generating functions-inclusion and exclusion and
applications.
UNIT III GRAPHS
Graphs and graph models-Graph terminology and special types of graphs-Representing graphs and graph isomorphism -connectivity-Euler and Hamilton paths
UNIT IV ALGEBRAIC STRUCTURES
Algebraic systems-Semi groups and monoids-Groups-Subgroups and homomorphisms- Cosets and Lagrange’s theorem- Ring & Fields (Definitions and examples)
UNIT V LATTICES AND BOOLEAN ALGEBRA
Partial ordering-Posets-Lattices as Posets- Properties of lattices-Lattices as Algebraic systems –Sub lattices –direct product and Homomorphism-Some Special lattices- Boolean Algebra
TEXT BOOKS:
1. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Special Indian
edition, Tata McGraw-Hill Pub. Co. Ltd., New Delhi, (2007). (For the units 1 to 3,
Sections 1.1 to 1.7 , 4.1 & 4.2, 5.1 to 5.3, 6.1, 6.2, 6.4 to 6.6, 8.1 to 8.5)
2. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to
Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 30th Re-print
(2007).(For units 4 & 5 , Sections 2-3.8 & 2-3.9,3-1,3-2 & 3-5, 4-1 & 4-2)
UNIT I LOGIC AND PROOFS
Propositional Logic – Propositional equivalences-Predicates and quantifiers-Nested Quantifiers-Rules of inference-introduction to Proofs-Proof Methods and strategy
UNIT II COMBINATORICS
Mathematical inductions-Strong induction and well ordering-.The basics of counting-The pigeonhole principle –Permutations and combinations-Recurrence relations-Solving Linear recurrence relations-generating functions-inclusion and exclusion and
applications.
UNIT III GRAPHS
Graphs and graph models-Graph terminology and special types of graphs-Representing graphs and graph isomorphism -connectivity-Euler and Hamilton paths
UNIT IV ALGEBRAIC STRUCTURES
Algebraic systems-Semi groups and monoids-Groups-Subgroups and homomorphisms- Cosets and Lagrange’s theorem- Ring & Fields (Definitions and examples)
UNIT V LATTICES AND BOOLEAN ALGEBRA
Partial ordering-Posets-Lattices as Posets- Properties of lattices-Lattices as Algebraic systems –Sub lattices –direct product and Homomorphism-Some Special lattices- Boolean Algebra
TEXT BOOKS:
1. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, Special Indian
edition, Tata McGraw-Hill Pub. Co. Ltd., New Delhi, (2007). (For the units 1 to 3,
Sections 1.1 to 1.7 , 4.1 & 4.2, 5.1 to 5.3, 6.1, 6.2, 6.4 to 6.6, 8.1 to 8.5)
2. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to
Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 30th Re-print
(2007).(For units 4 & 5 , Sections 2-3.8 & 2-3.9,3-1,3-2 & 3-5, 4-1 & 4-2)
CS2301 Software Engineering Anna University Syllabus
UNIT I SOFTWARE PRODUCT AND PROCESS
Introduction – S/W Engineering Paradigm – Verification – Validation – Life Cycle Models
– System Engineering – Computer Based System – Business Process Engineering
Overview – Product Engineering Overview.
UNIT II SOFTWARE REQUIREMENTS
Functional and Non-Functional – Software Document – Requirement Engineering
Process – Feasibility Studies – Software Prototyping – Prototyping in the Software
Process – Data – Functional and Behavioral Models – Structured Analysis and Data
Dictionary.
UNIT III ANALYSIS, DESIGN CONCEPTS AND PRINCIPLES
Systems Engineering - Analysis Concepts - Design Process And Concepts – Modular
Design – Design Heuristic – Architectural Design – Data Design – User Interface
Design – Real Time Software Design – System Design – Real Time Executives – Data
Acquisition System – Monitoring And Control System.
UNIT IV TESTING
Taxonomy Of Software Testing – Types Of S/W Test – Black Box Testing – Testing
Boundary Conditions – Structural Testing – Test Coverage Criteria Based On Data Flow
Mechanisms – Regression Testing – Unit Testing – Integration Testing – Validation
Testing – System Testing And Debugging – Software Implementation Techniques
UNIT V SOFTWARE PROJECT MANAGEMENT
Measures And Measurements – ZIPF’s Law – Software Cost Estimation – Function
Point Models – COCOMO Model – Delphi Method – Scheduling – Earned Value
Analysis – Error Tracking – Software Configuration Management – Program Evolution
Dynamics – Software Maintenance – Project Planning – Project Scheduling– Risk
Management – CASE Tools
TEXT BOOKS:
1. Ian Sommerville, “Software engineering”, Seventh Edition, Pearson Education Asia,
2007.
2. Roger S. Pressman, “Software Engineering – A practitioner’s Approach”, Sixth
Edition, McGraw-Hill International Edition, 2005.
REFERENCES:
1. Watts S.Humphrey,”A Discipline for Software Engineering”, Pearson Education,
2007.
2. James F.Peters and Witold Pedrycz,”Software Engineering, An Engineering
Approach”, Wiley-India, 2007.
3. Stephen R.Schach, “ Software Engineering”, Tata McGraw-Hill Publishing Company
Limited, 2007.
4. S.A.Kelkar,”Software Engineering”, Prentice Hall of India Pvt, 2007.
Introduction – S/W Engineering Paradigm – Verification – Validation – Life Cycle Models
– System Engineering – Computer Based System – Business Process Engineering
Overview – Product Engineering Overview.
UNIT II SOFTWARE REQUIREMENTS
Functional and Non-Functional – Software Document – Requirement Engineering
Process – Feasibility Studies – Software Prototyping – Prototyping in the Software
Process – Data – Functional and Behavioral Models – Structured Analysis and Data
Dictionary.
UNIT III ANALYSIS, DESIGN CONCEPTS AND PRINCIPLES
Systems Engineering - Analysis Concepts - Design Process And Concepts – Modular
Design – Design Heuristic – Architectural Design – Data Design – User Interface
Design – Real Time Software Design – System Design – Real Time Executives – Data
Acquisition System – Monitoring And Control System.
UNIT IV TESTING
Taxonomy Of Software Testing – Types Of S/W Test – Black Box Testing – Testing
Boundary Conditions – Structural Testing – Test Coverage Criteria Based On Data Flow
Mechanisms – Regression Testing – Unit Testing – Integration Testing – Validation
Testing – System Testing And Debugging – Software Implementation Techniques
UNIT V SOFTWARE PROJECT MANAGEMENT
Measures And Measurements – ZIPF’s Law – Software Cost Estimation – Function
Point Models – COCOMO Model – Delphi Method – Scheduling – Earned Value
Analysis – Error Tracking – Software Configuration Management – Program Evolution
Dynamics – Software Maintenance – Project Planning – Project Scheduling– Risk
Management – CASE Tools
TEXT BOOKS:
1. Ian Sommerville, “Software engineering”, Seventh Edition, Pearson Education Asia,
2007.
2. Roger S. Pressman, “Software Engineering – A practitioner’s Approach”, Sixth
Edition, McGraw-Hill International Edition, 2005.
REFERENCES:
1. Watts S.Humphrey,”A Discipline for Software Engineering”, Pearson Education,
2007.
2. James F.Peters and Witold Pedrycz,”Software Engineering, An Engineering
Approach”, Wiley-India, 2007.
3. Stephen R.Schach, “ Software Engineering”, Tata McGraw-Hill Publishing Company
Limited, 2007.
4. S.A.Kelkar,”Software Engineering”, Prentice Hall of India Pvt, 2007.
Thursday, December 2, 2010
MA9217 Applied Mathematics for Electronics Engineers Anna university syllabus
MA9217 APPLIED MATHEMATICS FOR ELECTRONICS ENGINEERS
UNIT I FUZZY LOGIC
Classical logic – Multivalued logics – Fuzzy propositions – Fuzzy quantifiers.
UNIT II MATRIX THEORY
Some important matrix factorizations – The Cholesky decomposition – QR factorization – Least squares method – Singular value decomposition - Toeplitz matrices and some applications.
UNIT III ONE DIMENSIONAL RANDOM VARIABLES
Random variables - Probability function – moments – moment generating functions and their properties – Binomial, Poisson, Geometric, Uniform, Exponential, Gamma and Normal distributions – Function of a Random Variable.
UNIT IV DYNAMIC PROGRAMMING
Dynamic programming – Principle of optimality – Forward and backward recursion – Applications of dynamic programming – Problem of dimensionality.
UNIT V QUEUEING MODELS
Poisson Process – Markovian queues – Single and Multi-server Models –Little’s formula - Machine Interference Model – Steady State analysis – Self Service queue.
REFERENCES:
1. George J. Klir and Yuan, B., Fuzzy sets and fuzzy logic, Theory and applications, Prentice Hall of India Pvt. Ltd., 1997.
2. Moon, T.K., Sterling, W.C., Mathematical methods and algorithms for signal processing, Pearson Education, 2000.
3. Richard Johnson, Miller & Freund’s Probability and Statistics for Engineers, 7th Edition, Prentice – Hall of India, Private Ltd., New Delhi (2007).
4. Taha, H.A., Operations Research, An introduction, 7th edition, Pearson education editions, Asia, New Delhi, 2002.
5. Donald Gross and Carl M. Harris, Fundamentals of Queueing theory, 2nd edition, John Wiley and Sons, New York (1985).
UNIT I FUZZY LOGIC
Classical logic – Multivalued logics – Fuzzy propositions – Fuzzy quantifiers.
UNIT II MATRIX THEORY
Some important matrix factorizations – The Cholesky decomposition – QR factorization – Least squares method – Singular value decomposition - Toeplitz matrices and some applications.
UNIT III ONE DIMENSIONAL RANDOM VARIABLES
Random variables - Probability function – moments – moment generating functions and their properties – Binomial, Poisson, Geometric, Uniform, Exponential, Gamma and Normal distributions – Function of a Random Variable.
UNIT IV DYNAMIC PROGRAMMING
Dynamic programming – Principle of optimality – Forward and backward recursion – Applications of dynamic programming – Problem of dimensionality.
UNIT V QUEUEING MODELS
Poisson Process – Markovian queues – Single and Multi-server Models –Little’s formula - Machine Interference Model – Steady State analysis – Self Service queue.
REFERENCES:
1. George J. Klir and Yuan, B., Fuzzy sets and fuzzy logic, Theory and applications, Prentice Hall of India Pvt. Ltd., 1997.
2. Moon, T.K., Sterling, W.C., Mathematical methods and algorithms for signal processing, Pearson Education, 2000.
3. Richard Johnson, Miller & Freund’s Probability and Statistics for Engineers, 7th Edition, Prentice – Hall of India, Private Ltd., New Delhi (2007).
4. Taha, H.A., Operations Research, An introduction, 7th edition, Pearson education editions, Asia, New Delhi, 2002.
5. Donald Gross and Carl M. Harris, Fundamentals of Queueing theory, 2nd edition, John Wiley and Sons, New York (1985).
Subscribe to:
Posts (Atom)