Sie sind auf Seite 1von 25

09X101 ENGLISH

2013

READING: Reading practice on a variety of topics to develop reading skills such as identifying main ideas, language functions and contextual use of vocabulary. (8) FOCUS ON LANGUAGE: Functional Grammar, Tenses and Modals in Context, Use of Articles and Prepositions, Adjectives, Word Order, Subject and Verb Concord. (8) WRITING: Practice in writing letters, Personal, Social, and Official, Note making, Summarizing, Paragraph writing, Report Writing (Lab Reports) and Transcoding. (8) SPEAKING: Conversation Practice, Mini Presentations and Role Plays. LISTENING ACTIVITIES: Listening for specific purposes, practice tasks in language lab. (12) (6) Total 42 TEXTBOOK: Teaching Material prepared by the Faculty, Department of English. REFERENCES: 1. Murphy Herta A Effective Business Communication, Tata Mc.Graw Hill Publishing Company Limited, New Delhi, 2008. 2. Chellamal, Learning to Communicate, Kamakhya Publications, (Anna University), Coimbatore 2004. 3. Ruhterford and Andera Basic Communication Skills for Technology, Addison Wesly Longman, Singapore, 2001. 4. Mohan, Krishnan and Meenakshi Raman,Effective English Communication, Tata McGraw Hill Publishing Company Limited, New Delhi,2008. 5. Sethi A, Handbook of Standard English and Indian Usage, Prentice Hall of India Private Ltd, New Delhi, 2007.

09X102 ALGEBRA AND CALCULUS

3204

CONVERGENCE OF SERIES AND SEQUENCE: Function: limit, continuity, piecewise continuity, differentiability, integrability, absolutely integrable. Sequence and series: convergence and divergence. (5) LINEAR ALGEBRA: System of independence- Basis and mension. linear equations-Modeling-General vector spaces, SubspacesLinear (7)

MATRICES: Eigen values and eigenvectors properties Quadratic form reduction to canonical form by orthogonal reduction. (10) DIFFERENTIAL CALCULUS: Curvature in Cartesian and polar coordinates Circle of curvature. Statement of Taylors series for a function of two variables Maxima and minima of two variables (problems only). Lagrange method of multipliers (10) INTEGRAL CALCULUS: Evaluation of multiple integrals change of order of integration Definition of Beta and Gamma integrals Relation connecting Beta and Gamma integrals Properties Evaluation of definite integrals in terms of Beta and Gamma functions. (10) TEXT BOOKS: 1. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley and Sons, USA, 2007. 2. David C Lay, Linear Algebra and its Applications, Addison-Wesley, USA, 2004. Total 42

REFERENCES: 1. Riley K F, Hobson M P and Bence S J, Mathematical Methods for Physics and Engineering, Cambridge University Press, United Kingdom, 2005. 2. George B Thomas, J R and Ross L Finney, Calculus and Analytic Geometry, Addison Wesley, USA, 2000. 3. Thomas W Hungerford Margaret L Lial, Mathematics with Applications, Addison Wesley, USA, 2002.

09X103 APPLIED PHYSICS

3003

LASER: Spontaneous and stimulated emission Pumping Characteristics of lasers Ruby laser He-Ne laser, CO2 laser, Nd -YAG laser, semiconductor laser Applications: cutting, welding, holography, LDA and optical recording. (7) FIBRE OPTICS: Basic principles and classification of optical fibres: material, mode and refractive index Step-index and graded index fibres Attenuation Fibre optics light sources and detectors Fibre optic communication system fibre optic sensors: temperature, displacement, voltage. (5)

SUPERCONDUCTIVITY: Qualitative study of the phenomenon Critical temperature and critical field Meissners effect Type I and Type II superconductors Josephsons effects BCS theory Applications: Cryotron, magnetic levitation SQUID. (7) ELECTRICAL PROPERTIES: Free electron theory of Drude Lorentz W eidmann-Franz law Band theory of solids Distinction between conductor, semiconductor and insulators Factors affecting the resistivity of materials: temperature, alloying strain, magnetic field. Matheissens rule, application conductors. (8) MAGNETIC PROPERTIES: Classification of magnetic materials ferromagnetism domain theory Hard and soft magnetic materials Curie law and Curie W eiss law Magnetostriction, ferrites: properties, applications, principle of magnetic memories. (8) SEMICONDUCTOR MATERIALS AND DEVICES: Classification of semiconductors Material preparation Czochralskis method Zone refining method Hall effect in semiconductors Semiconductor devices: LDR, LED, photodiode, Solar cells, strain gauge. (7) TEXT BOOKS: 1. Gaur R K and Gupta S L, Engineering Physics, Dhanpat Rai and Sons, New Delhi, 1995. 2. Srinivasan M R, Physics for Engineers, New Age International Publications, New Delhi, 1996. 3. Jayakumar S, "Materials Science", R.K.Publishers, Coimbatore, 2007. Total 42

REFERENCES: 1. Jayakumar S, Engineering Physics R K Publishers, Coimbatore, 2007. 2. Raghavan V, "Materials Science and Engineering- A First Course", Prentice Hall of India, New Delhi, 2001. 3. Rajendran V and Marikani A, Applied Physics for Engineers, Tata McGraw Hill Company Ltd., New Delhi, 2001.

09X104 BASICS OF DIGITAL ELECTRONICS

3104

NUMBER SYSTEMS AND CODES: Introduction to decimal, binary, octal, hexadecimal number systems Inter conversions of Number Systems Binary Codes: BCD, Excess 3, Gray, ASCII, Error Detecting Codes 2s complement addition, subtraction BCD addition. (9) LOGIC GATES AND FAMILIES: AND, OR, NOT, NAND, NOR, Exclusive - OR and Exclusive - NORImplementations of Logic Functions using gates- NAND -NOR implementations. (5) BOOLEAN ARITHMETIC AND THEOREM: Boolean laws and theorems Boolean expressions MinimizationSum of Products (SOP) -Product of Sums (POS) - Minterm - Maxterm - Canonical forms - Karnaugh map Minimization - Don't care conditions. (9) COMBINATIONAL LOGIC CIRCUITS: Adders Subtractors - Encoders Decoders Multiplexers Demultiplexers Incrementer Decrementer. (4) FLIP FLOPS: RS, JK, Master-Slave, D, and T Flip Flops Excitation tables Design Procedure. (4)

SHIFT REGISTERS AND COUNTERS: Parallel/serial in/out shift registers Counters: Definition Types Asynchronous Counters - Synchronous counters- - Design of counters. (5) MEMORY DEVICES: Introduction, Classification and characteristics of memories, Read only memories and Read and write memories, Programmable Logic arrays. (3) DATA CONVERTERS: ADC and DACs with emphasis on commercially available/used ICs. (3) Total 42 TEXT BOOKS: 1. Morris Mano M, Digital Design, Prentice Hall of India Private Limited,New Delhi, 2007. 2. John M Yarbrough, Digital Logic Applications and Design, Thomson- Vikas publishing house, New Delhi, 2006. REFERENCES: 1. Salivahanan S and Arivazhagan S, Digital Circuits and Design, Vikas Publishing House Pvt. Ltd, New Delhi, 2007. 2. Ronald J Tocci and Widmer N S, Digital Systems: Principles and Applications, PHI/ Pearson Education private Limited, Singapore, 2007. 3. Albert Paul Malvino and Donald P Leach, Digital Principles and Applications, Tata McGraw Hill, New Delhi, 2006.

09X105 C PROGRAMMING

INTRODUCTION TO PROGRAMMING LANGUAGE: Need-Problem Definition and Analysis-Developing Algorithm and Flowchart- C Program Development Environment (3)

3104

C FUNDAMENTALS: The C Character Set Identifiers and keywords Data types Constants Variables - Arrays Declarations Expressions Statements Symbolic Constants. (3) OPERATORS, I/O STATEMENTS: Operators Arithmetic Unary Relational and Logical - Assignment and Conditional - Comma operator Library Functions I/O Statements getchar, putchar, scanf, printf, gets and puts. (4) CONTROL STATEMENTS: If-else - switch-case - while - do-while for - Nested control Structures- break continue - goto statements. (6) ARRAYS: Defining an Array - Processing Array - Arrays and Functions - Multidimensional Arrays String manipulations. (5) FUNCTIONS: Function Declaration - Definition - Calling Passing values to functions Storage Classes. (5)

STRUCTURES AND UNIONS: Defining a Structure Processing a Structure typedef enum - Structures and Pointers Passing Structures to Functions Self Referential Structures - Unions (5) POINTERS: Pointer Declarations Pointers and Functions Pointers and Arrays Dynamic Memory Allocation Operations on Pointers Pointers to Pointers. (8) FILE PROCESSING: Opening and Closing a Data File Creating a Data File Processing data file - Unformatted data files Command line arguments. (3) Total 42 REFERENCES: 1. Byron S Gottfried, Programming with C, Tata McGraw-Hill, New Delhi, 2008. 2. Yashwant Kanektar, Let us C, BPB Publications, New Delhi, 2008. 3. Balagurusamy E, Programming in ANSI C, Tata McGraw-Hill, New Delhi, 2008. 4. Brain W Kernighan and Dennis M Ritchie, C Programming Language, Prentice Hall of India, New Delhi, 2007. 5. Herbert Schildt, C -The Complete Reference, Tata McGraw Hill, New Delhi, 2008.

09X106 PC ARCHITECTURE AND MAINTENANCE LABORATORY

2034

INTRODUCTION TO COMPUTERS: Classification Components of a computer Functions Low/high level languages- MEMORY: Introduction RAM, ROM, Cache Memory Flash Memory. (5) PERIPHERALS AND INTERFACING: Input and Output devices- Keyboard Interface - Mouse Interface - Display adapter interface -Disk driver adapters. (4) BUS ARCHITECTURE: Overview, ISA, EISA, PCI, SCSI, USB. (4)

STRUCTURE OF MS- DOS: BIOS DOS Kernel - Command Processor File structure under MS DOS -Features of latest DOS. (7) INSTALLATION AND TROUBLESHOOTING: System Configuration Pre-Installation Planning Installation Practice Virus- Computer faults Types, Nature Diagnostic programs and tools. (8) List of Experiments: 1. 2. 3. 4. 5. 6. 7. 8. Principle and working of IBM PC. Interfaces of PC - Keyboard, Mouse, Hard disk and Floppy disk. Components in IBM PC Motherboard and their purpose. BIOS Routines. Expansion cards and Interfaces. Printer and its types. Assembling the PC. Trouble shooting techniques in PC. Total 28

TEXT BOOKS: 1. Govindarajalu B, IBM PC and Clones, Tata McGraw Hill, New Delhi, 2007. 2. Alexis Leon, Fundamentals of Information Technology, Vikas Publishing House, New Delhi, 2001. 3. Robert S Lai, Writing MS DOS Device Drivers, Addison Wesley, United Kingdom, 1995. REFERENCES: 1. Ray Duncan, Advanced MS DOS, Microsoft Press, USA, 2002. 2. ISTE, MS DOS, 1999.

09X107 DIGITAL ELECTRONICS LABORATORY


Implement the following 1. 2. 3. 4. 5. 6. 7. 8. 9. Boolean Expression Design of Adder and Subtractor using Half Adder and Full Adder Design of Binary Decrementer using Half Subtractor Encoder and Decoder Multiplexer and Demultiplexer Code Converter Synchronous Counter using Flipflops Asynchronous Counter using Flipflops Shift Registers using Flipflops

0032

10. Display of data using Seven Segment Decoder

09X108 C PROGRAMMING LABORATORY


Implement the following concepts: 1. Looping constructs 2. Single dimensional and multidimensional array 3. User defined functions 4. Recursive functions 5. String manipulations using built-in functions 6. Structures 7. Unions 8. Pointer 9. File operations 10. Command line arguments

0032

09X201 FOURIER SERIES AND LAPL ACE TRANSFORMS 3204


FOURIER SERIES: Dirichlets conditions Statement of Fourier Theorem Fourier coefficients Change of scale half range series - Complex form of Fourier series Root Mean square value. (14) COMPLEX VARIABLES: Analytic functions, Cauchy - Riemann equations in Cartesian and Polar coordinates, sufficient conditions. (Statement only) Properties of analytic functions, finding analytic function whose real/imaginary part is given. Complex integration, Cauchy's fundamental theorem and formula, Taylor's series, Laurent's series. Singularities, Residues, Residue Theorem, Cauchy's Lemma and Jordan's lemma (Statements only), Evaluation of real integrals using contour integration along semi-circle and unit circle. (14) LAPLACE TRANSFORMS: Definition Transforms of standard functions Transforms of unit step function Dirac delta function. Transforms of eat f (t), tn f (t), f (t)/tn Transforms of derivatives and integrals Transform of periodic functions Inverse Laplace transforms Convolution Theorem Applications to ordinary linear differential equations with constant coefficients. (14) Total 42 TEXT BOOKS: 1. Erwin Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons, New Delhi, 2007. 2. Dennis G Zill and Michael R Cullen, Advanced Engineering Mathematics, Jones and Barlett, New Delhi, 2005. REFERENCES: 1. Ray Wylie C and Louis C Barrett, Advanced Engineering Mathematics, McGraw Hill Inc, New Delhi, 1995. 2. Michael D Greenberg, Advanced Engineering Mathematics, Pearson Education, New Delhi, 2006. 3. Veerarajan T, Engineering Mathematics, Tata McGraw Hill, New Delhi, 2001.

09X202 COMPUTER ORGANIZ ATION

INTRODUCTION: Data Representation-Register Transfer Language- Register Transfer- Bus and Memory Transfer Arithmetic, Logic and Shift Micro Operations. (7)

3104

BASIC COMPUTER ORGANIZATION and DESIGN: Instruction code Computer registers- computer instructionsTiming and control- Instruction cycle- Memory reference instructions- Input/Output and Interrupt. (8) CENTRAL PROCESSING UNIT: General Register Organization- Stack Organization- Instruction Format- Addressing Modes - Instruction Set - RISC and CISC Machines. (8) ARITHMETIC PROCESSOR: Addition, Subtraction, Multiplication and Division Algorithms (7)

INPUT/OUTPUT ORGANIZATION: Peripheral Devices Input / Output Interface- Asynchronous Data TransferModes of Transfer-DMA - IOP. (7) MEMORY ORGANIZATION: Memory Hierarchy- Main Memory- Auxiliary Memory- Associative Memory- Cache Memory- Virtual Memory. (7) MULTIPROCESSORS: Characteristics Interconnection Structures. TEXT BOOK: 1. Morris Mano M, Computer System Architecture, Prentice Hall of India, New Delhi, 2007. (5) Total 42

REFERENCES: 1. William Stallings, Computer Organization and Architecture- Designing for performance, Pearson Education Asia, New Delhi, 2007. 2. Andrew S Tanenbaum, Structured Computer Organization, Pearson Education Asia, New Delhi, 2006. 3. John P Hayes, Structured Computer Organization, Tata McGraw Hill, New Delhi, 2002.

09X203 DATA STRUCTURES


INTRODUCTION: Primitive Data Types-Abstract Data Types-Operations.

3104
(3)

LINEAR DATA STRUCTURES: Stacks -Array implementation of stacks Applications- Conversion of infix to polish notation Evaluation of expressions. (5) QUEUES: Array implementation Dequeues Priority Queues-Application-Machine Shop simulation. (5)

LINKED LISTS: Linked List implementation of stacks and Queues-circular, doubly linked lists-list with header nodeApplications-polynomial addition. (7) NON LINEAR DATA STRUCTURES: Trees - Definition- Binary Trees-Operations on binary trees-Binary tree traversal-Application of Trees- Expression trees-Huffman's Algorithm. (7) GRAPH: Representation-Breadth first search-Depth first search-Minimum Spanning tree-Application. (5)

SORTING AND SEARCHING: Bubble sort-Selection sort-Quick sort-Insertion sort-Linear search-Binary search-Hash Table methods-Collision Resolution Techniques. (10) Total 42 TEXT BOOKS: 1. Tremblay and Sorenson, "An Introduction to Data Structures with Applications", Tata McGraw Hill, New Delhi, 2007. 2. Yedidyah Langsam, Moshe J Augenstein and Aaron M Tenenbaum, Data Structures using C and C++ , Pearson Education, New Delhi, 2007. 3. Mark Allen Weiss, Data Structures and Problem Solving using C++, Addison Wesley, USA, 2006. REFERENCES: 1. Sartaj Sahni, Data Structures, Algorithms and Applications in C++, McGraw Hill, New Delhi, 2007. 2. ISRD Group, Data Structures using C , Tata McGraw Hill, New Delhi, 2007. 3. John R Hubbard, Schaums outline of Data Structures with C++, McGraw Hill, New Delhi, 2007.

09X204 OBJECT ORIENTED PROGRAMMING w ith C++ 3104


OOP CONCEPTS: Classes-Objects- Abstraction-Encapsulation- Data Hiding- Dynamic binding- Message passingApplications -OOP Languages. (4) INTRODUCTION TO C++: Tokens-Keywords - C++ primitive data types-Expressions-Manipulators. (4)

ACCESS CONTROL AND FUNCTIONS IN CLASSES: Private-Protected- Public for member access - FunctionsConstructors-Destructors-Inline functions-Friend Functions-Static Functions. (4)

INHERITANCE: Inheritance-Base class-Derived class-Types of Inheritance-Virtual Base Class-Visibility modes in Derived class-Member Overriding using Scope Resolution Operators-Constructors in Derived Class. (7) Pointer Handling in C++-This Pointer- Dynamic Memory Management. POLYMORPHISM: Compile time Polymorphism with virtual functions. Polymorphism-Function Overloading, Operator Overloading, (3) Runtime (8)

I/O STREAM: Built in I/O classes-I/O manipulators, File operations-Open-Close-Read-W rite-File Nodes-File Random Access-Command Line Arguments (7) TEMPLATES AND EXCEPTION HANDLING: Template Functions and Classes-Template Classes under Inheritance- Exception Handling. (5) TEXT BOOKS: 1. Herbert Schildt, "C++ the Complete Reference", Tata McGraw Hill Publications, New Delhi, 2007. 2. Stanley B Lippman, "C++ Primer", Pearson Education Asia, New Delhi, 2005. REFERENCES: 1. Balagurusamy E, "Object Oriented Programming with C++", Tata McGraw Hill, New Delhi, 2007. 2. Robert Lafore, Object Oriented Programming in C++, Galgotia Publications, New Delhi, 2007. Total 42

09X206 OBJECT ORIENTED PROGRAMMING LABORATORY


Implement the following concepts: 1. Classes and objects 2. Array of objects 3. Constructors, destructors and inline functions 4. Function overloading 5. Static functions and friend functions 6. Stream and Manipulators 7. Inheritance and its types 8. Operator overloading 9. Virtual functions and virtual classes 10. File operations 11. Templates and exception handling

0032

09X207 DATA STRUCTURES LABORATORY


Implement the following concepts using C/ C++ 1. Matrix operation using arrays 2. Stacks 3. Queues 4. Dequeues 5. Singly Linked list 6. Doubly Linked list 7. Binary Search trees 8. Sorting techniques 9. Searching techniques

0032

09X208 WEB DESIGN LABORATORY

2032
(2)

FOUNDATION: Defining Web Design Web Design Themes Web Design Process Evaluating Web Sites.

MARKUP LANGUAGES: HTML Core Elements Links and Addressing Images Layout Design Tables Frames Form Elements. (4)

XHTML Introduction Comparison of HTML & XHTML XML Basics of XML Well Formed XML Valid XML DTD XML Schemas. (4) STYLE-SHEET TECHNOLOGIES: CSS Style sheet Basics Adding Style to a Document Creating Style Rules Fonts Text Formatting Padding, Margins & Borders Colors and Backgrounds Tables Element Positioning DHTML DHTML with CSS. (9) SCRIPTING LANGUAGES: Introduction to Interpreters - JavaScript Basics Data Types Variables Array Controls Structures Operators Exception Handling JavaScript for Window and Frame Link and Anchor objects Form and Related objects Button objects Text Related Form objects Event objects Style Sheet objects. (9) LIST OF PROGRAMS: 1. Create a Home Page using HTML tags 2. Write a HTML program to print the Mark Statement using Tables. 3. Create a Valid XML file to store Employee information based on DTD 4. Create a layout for menus using HTML 5. Create a program using frames and apply XHTML concept 6. Create a program implementing DHTML 7. Write a HTML program to create a user interface using form elements 8. Program to applying style sheets 9. Create user interfaces using HTML and validation done using JavaScript TEXT BOOKS: 1. Bryan Pfaffenberger, Steven M Schafer, Chuck White and Bill Karow, HTML, XHTML, & CSS Bible, Wiley Dreamtech, New York, 2004. 2. Thomas A Powell, Web Design The Complete Reference, Tata McGraw Hill, New Delhi, 2003. REFERENCES: 1. Danny Goodman, Michael Morrison, JavaScript Bible, Wiley Dreamtech, New York, 2005. 2. Thomas A Powell, HTML The Complete Reference, Tata McGraw Hill, New Delhi, 2006. 3. Eric A Meyer, Cascading Style Sheets: The Definitive Guide, OReilly Publications, UK, 2000. Total 28

09X301 DISCRETE M ATHEMATICS

3104

MATHEMATICAL LOGIC: Connectives Negation, Conjunction, Disjunction, statement formulas and truth tables Conditional and biconditional Tautologies Equivalence of formulas Duality laws Tautological implications other connectives Predicates Statement functions, Variables and Quantifiers Predicate formulas. (8) RELATIONS & FUNCTIONS: Definition Binary relation Operations- Representation(Matrix and Graph)Equivalence relation- Classes- Posets-Hasse Diagrams- Definition Injective, Surjective and Bijective Functions Composition of functions Inverse functions Characteristic functions Recursive functions. (7) COMBINATORICS: Counting Methods for arrangement and selections two basic counting principles Arrangements and selections with repetition, Generating functions. (6) RECURRENCE RELATIONS: Recurrence relation models Solution of linear recurrence relations Solution of nonhomogeneous linear Relations. (5) GROUP THEORY: Definition and examples Subgroups, Homomorphism & Isomorphism Cosets and Lagranges theorem Normal Subgroups. Application Group codes (theorems without proof). (7) GRAPH THEORY: Basic concepts of Graph Theory walk, path, circuits, connectedness Euler and Hamilton graphs Graph isomorphism. Matrix representation of graphs (excluding algorithms). Tree - Spanning tree Dijkstras algorithm. (9) Total 42 TEXT BOOK: 1. Tremblay J P and Manohar R, Discrete Mathematical Structures with Applications to Computer Science, McGraw - Hill Book Company, New Delhi, 2002. REFERENCES: 1. Venkataraman M K, Discrete Mathematics, National Publishing Company, 2002. 2. Alan and Levasseur Kenneth, Applied Discrete Structures for Computer Science, Galgotia Publications (P) Ltd., New Delhi, 2002. 3. Bernard Kolman, Robert C Busby and Sharon Ross, Discrete Mathematical Structures, Pearson Education Pvt. Ltd., Singapore, 2007.

4. 5.

Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall of India (P) Ltd., New Delhi, 1999. Hop craft J and Ullman J D, Introduction to Automata Theory, Languages & Computation, Narosa Publishing House, New Delhi, 2001.

09X302 ALGORITHM DESIGN TECHNIQUES

3104

INTRODUCTION: Definition and properties of algorithm Structured Algorithm Analysis of algorithms-Time Complexity-Space Complexity-Asymptotic Notation. (7) DIVIDE AND CONQUER: The General method Binary Search Finding maximum and minimum element Merge sort Quick sort (8) GREEDY METHOD: The General method Optimal storage on tapes knapsack problem Minimum Cost Spanning trees Single source shortest path method. (6) DYNAMIC PROGRAMMING: The General method All pairs shortest path Optimal binary search trees Multistage graphs. (7) BACKTRACKING: The General method Solution space and tree organization Eight queens problem- Sum of subset problem Knapsack problem. (7) BRANCH AND BOUND: The General method 0/1 Knapsack problem Traveling salesman problem Efficiency considerations. (7) Total 42 TEXT BOOKS: 1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Fundamentals of Computer Algorithms, Galgotia Publications, New Delhi, 2007. 2. Aho A V, Hop croft J E, Ullman J D, Design and Analysis of Algorithms, Pearson Education Asia, New Delhi, 2006. REFERENCES: 1. Donald E Knuth, Fundamental Algorithms - The Art of Computer Programming- Volume I, Narosa Publishing House, Bombay, 2005. 2. Mehlborn K, Data Structures and Algorithms, Vol. I and II, Springer Verlag, Cambridge University Press, Cambridge, United Kingdom, 2001.

09X303 MICROPROCESSORS AND INTERF ACING 3003


INTRODUCTION TO 8085 MICROPROCESSOR: Evolution of Microprocessors - Architecture Internal data operations - Pin Diagram - Communication and bus timings Functional Block Diagram Machine Cycle, Opcode Fetch and Memory Read (7) PROGRAMMING OF 8085: Programming Model Instruction Classification Instruction and data formatsAddressing Modes - Instruction Set Assembly Language Programming (10) MEMORY AND I/O INTERFACING CONCEPTS: Memory: Memory Mapping Word size Memory Interfacing. I/O Interfacing concepts- Memory mapped I/O Interfacing output displays Interfacing input devices D/A Converters A/D Converters 8255 Programmable Peripheral Interface (7) INTERRUPTS AND DMA: Types of Interrupts and Exceptions 8259 Interrupt Controller 8253 Interval Timer DMA 8237 DMA Controller 8251A Programmable Communication Interface. (8) ARCHITECTURE OF 8086/8088 MICROPROCESSORS: Introduction Registers Memory Segmentation Generating a memory address Minimum mode and Maximum mode system - Functional Block Diagram (10) Total 42 TEXT BOOKS: 1. Ramesh Gaonkar, Microprocessor Architecture, Programming and Application with 8085, Pearson Education, New Delhi, 2007. 2. Barry B Brey, Intel Microprocessors: 8088/8086, 80186/80188, 80286, 80386, 80486, Pentium, Pentium Pro Processor, Pentium II, Pentium III, Pentium 4, Architecture, Programming and Interfacing, Pearson Education, New Delhi, 2007. REFERENCES: 1. Avtar Singh and Walter A Triebel,8088 and 8086 Microprocessors: Programming, Interfacing, Software Hardware and Applications: Including the 80286, 80386, 80486 and Pentium Processor Families, Prentice Hall of India, New Delhi, 2006. 2. Douglas V Hall,Microprocessors and Interfacing: Programming and Hardware, McGraw Hill, New Delhi, 2005.

09X304 OPERATING SYSTEMS


INTRODUCTION: History of Operating System-Types-Functions-Concepts- Structures.

3104
(6)

MEMORY MANAGEMENT: Storage organization - Single Contiguous Allocation- Partitioned Allocation- SwappingVirtual memory - Paging - Segmentation - Page replacement algorithms - Demand paging (10) PROCESS MANAGEMENT: Introduction to processes - Scheduling criteria - Algorithms - Inter process Communication- Critical section, mutual exclusion -Semaphores-Deadlocks-Detection- Prevention-Avoidance. (9) DEVICE AND FILE MANAGEMENT: Principles of I/O hardware I/O software Disks Disk Scheduling Algorithms- File System-Functions -File organization - File system implementation - Allocation methods- Security Protection mechanism. (9) CASE STUDY: LINUX Architecture - Kernel - Features - System calls - Implementation. (8)

Total 42 TEXT BOOKS: 1. Silberschatz A, Peterson J L and Galvin P, "Operating Systems Concepts", John Wiley Publishers, New York, 2008. 2. Deitel H M, Operating Systems", Pearson Education, New Delhi, 2009. REFERENCES: 1. Andrew S Tanenbaum, Modern Operating Systems", Pearson Education, New Delhi, 2006. 2. Dhamdhare, Operating Systems-a concept based approach, Tata McGraw Hill, New Delhi, 2008. 3. Achyut S Godbole, "Operating Systems", Tata Mc-graw Hill, New Delhi, 2008. 4. Charles Crowley, "Operating Systems - A Design Oriented Approach", Tata McGraw Hill, New Delhi, 2008.

09X305 COMPUTER NETWORKS

3104

INTRODUCTION: Uses of Computer networks Components and Categories Types of Connections Topologies Protocols and Standards ISO / OSI model -TCP/IP model. (7) PHYSICAL LAYER: Guided Transmission media- Wireless Transmission- Inter networking devices SwitchingTelephone network. (7) DATALINK LAYER: Design Issues- Error Detection and Correction Parity LRC CRC Hamming code Flow Control and Error control - Stop and wait Go back-N ARQ Selective repeat ARQ- Sliding window Medium Access Control-Random Access protocols. (8) NETWORK LAYER: Design Issues- IP addressing methods Routing Algorithms Distance Vector Routing Link State Routing - Congestion control -Principles-Congestion control in Virtual circuits. (8) TRANSPORT LAYERS: Duties of transport layer Multiplexing Demultiplexing Sockets User Datagram Protocol (UDP) Transmission Control Protocol (TCP) Congestion Control. (7) HIGHER LAYERS: Domain Name Space (DNS) HTTP - WWW Security Cryptography. TEXT BOOKS: 1. Andrew S Tanenbaum, "Computer Networks", Prentice Hall of India, New Delhi, 2008. 2. Behrouz A Forouzan, Data Communication and Networking, Tata McGraw Hill, New Delhi, 2007. (5) Total 42

REFERENCES: 1. William Stallings, Data and Computer Communications, Prentice Hall of India, New Delhi, 2007. 2. Uyless D Black, Data Communications and Distributed Networks, Prentice Hall of India, New Delhi, 2004.

09X306 MICROPROCESSORS AND INTERFACING LABORATORY


1. 2. 3. 4. 5. 6. 7. Study of Microprocessor 8085 kit Arithmetic operations Number system conversions Byte-to-Nibble and Nibble-to-Byte conversion Roots of a quadratic equation Sort the array of numbers Searching techniques

0032

8. 9.

LED Display Interface. ADC/DAC Interface

10. Traffic Light Controller Interface

09X307 OPERATING SYSTEMS LABORATORY


Implement the following concepts: 1. Process scheduling algorithms 2. Bankers Algorithm 3. Inter Process Communication 4. Process Synchronization 5. Page Replacement algorithms 6. Disk Scheduling algorithms

0032

09X308 COMPUTER NETWORKS LABORATORY


Implement the following concepts: 1. Error Checking Methods i) Vertical Redundancy Check ii) Longitudinal Redundancy Check iii) Check sum method 2. 3. Error Detection i) Hamming code Encryption techniques i) Substitution Cipher ii) Transposition Cipher 4. Framing i) Framing by character count ii) Framing by bit stuffing 5. 6. IP Addressing Dijkstras Shortest path Algorithm

0032

09X401 COMMUNICATION SKILLS

2103

INTRODUCTION: Communication, Definition, process, elements of communication, types of communication, verbal, non verbal, barriers to communication and correctness Vs communication. (4) ORAL PRESENTATION: Preparing a speech, delivery techniques, using the visual aids, handling a hostile audience, overcoming errors in public speaking and presenting the successful seminar. REGISTER: Definition, language of science and law and literature. SCIENTIFIC AND TECHNICAL STYLE: Clarity, simplicity, exactness, brevity, unity, coherence and objectivity. MECHANICS: Common errors in technical writing, conventions in technical writing, punctuation, capitalization, abbreviation and numbers. FORMAL TECHNICAL REPORT: Gathering data, literature search, questionnaire and interview and creating a formal technical report. DIFFERENT TYPES OF ARTICLES: Technical articles-semi technical articles and popular articles. (3) (2) (3) (3) (4) (2)

BUSINESS CORRESPONDENCE: Business letters, structural elements, styles of presentation, letters of inquiry, claim and adjustment letters, letter of application for a job and calling for tenders and quotations. (3)

10

INTERVIEWS: Types, stages, skills for interviewer and interviewee, interview follow-up letters and letters of acceptance and refusal. MEETINGS: A Psychologist's view of better meetings, features/problems, notice and agenda Preparation and minutes documentation. PRACTICALS: Short speeches-Group Discussions and seminars. TEXT BOOK: Course material prepared by the Faculty, Department of English.

(2) (2) (14) Total 42

REFERENCES: 1. Rutherford Andreas J, Basic Communication Skills for Technology, Addison Wesley Longman, Singapore, 2001. 2. Gerson Sharon J and Stevan M Gerson, Technical Writing: Process and Product, Addison Wesley Longman, Singapore, 2001. 3. Locker Kitty O, The Irwin Business Communication Handbook Mc-Graw Hill, U.S.A., 1993. 4. Kumar K L, Your Interview, S. Chand and Company Ltd., New Delhi, 2000.

09X402 DATABASE MANAGEMENT SYSTEMS

3104

INTRODUCTION: Database Concepts- Comparison of Traditional file and database approach Data IndependenceLayers of database software Data base administrator-functions and responsibilities- Database system lifecycle. (5) DATA MODELS: Introduction to Data model - Scheme and subschema- Introduction to Relational, Hierarchical and Network models. (5) RELATIONAL DATABASE: Relations Entity-Attribute-Relational Database- Relational Algebra-Relational- Calculus (6) ENTITY RELATIONSHIP MODEL: Basic Concepts- Design Issues-Mapping Constraints - Keys-Entity Relationship Diagram-Weak Entity sets.- Extended E-R Features-Design of an E-R database schema.- Reduction of E-R schema to tables. (7) NORMALIZATION: Introduction- Candidate Key-Primary key- Functional Dependency-Multivalued dependencyNormalization-1NF, 2NF, 3NF,BCNF, 4NF. (8) CONCURRENCY MANAGEMENT: Concurrency Related Problems, Locks, Two Phased Locking, Deadlocks and its Prevention, Concurrency Control, SQL commands to control concurrency. (6) SECURITY & INTEGRITY: Backup and Recovery- Security & integrity violation, authorization & views, security systems in SQL, encryption. (5) Total 42 TEXT BOOKS: 1. Ramez Elmasri and Shamkant B Navathe,Fundamentals of Database Systems, Pearson Education Asia, New Delhi, 2007. 2. Abraham Silberschatz, Henry F Korth and Sudarsan S,Database System Concepts, Tata McGraw Hill, New Delhi, 2008. REFERENCES: 1. Alexis Leon and Mathew Leon, Database Management Systems, Vikas Publishing House, New Delhi, 2006. 2. Raghu Ramakrishnan and Johannes Gehrke,Database Management system, Tata McGraw Hill, New Delhi, 2008.

09X403 SYSTEM SOFTWARE


INTRODUCTION: Components of a programming system-An Overview.

3003
(3)

ASSEMBLERS: Overview of Assembly process - Functions-Features- Machine dependent Design options - One pass- Multi pass- Implementation -Examples. (7) MACRO PROCESSORS: Macro Definition- Macro facilities - Design of a Macro processor-Design of a macro assembler - Implementation examples. (9) LOADERS AND LINKERS: Basics of Loading, Linking and Relocation -Linking and Loading Schemes -Program Relocatability - Linking for overlays - Linkage editor Dynamic Linking - Linking loader implementation (9) INTERPRETERS: Interpreters-Pure and Impure Interpreters-Advantages of Interpreters. (5)

11

SOFTWARE TOOLS: Definition-Spectrum of software tools Editor structure-Text editors-Debuggers-Interactive debugging system-Debug Monitors. (9) Total 42 TEXT BOOKS: 1. Leland L Beck, System Software An Introduction to Systems Programming, Addison Wesley, New Delhi, 2006. 2. Dhamdhere D M, Systems Programming and Operating Systems, Tata McGraw-Hill, New Delhi, 2008. REFERENCE: 1. John J Donovan, Systems Programming, Tata McGraw Hill, New Delhi, 2008.

09X404 JAV A PROGRAMMING

3104

JAVA: Introduction - Java and Internet- Byte Code- Features of Java- Java Development Environment-Java Programming - Review of OOP- Methods and Classes- Packages and Interfaces- String Handling. (7) EXCEPTION HANDLING: Fundamentals- Built in Exceptions - User defined Exceptions - File I/O - Buffered I/O Programming Examples-Input/Output-Built-in classes and Interfaces. (6) THREADS: Java Threads Priorities Synchronization Thread class and Runnable interface - Creating thread Multiple threads Inter thread communication Suspending, Resuming and Stopping threads. (5) APPLETS: Basics- Applet Class- Event Class -HTML Applet Tag - Parameter Passing. (6)

JDBC: Introduction Exploring java.sql package Drivers and Types Connection Statement Result Set Prepared Statement Callable Statement Transactions. (5) AWT: Fundamentals -AW T Classes-Swings - Graphics- Text Display- Controls- Labels, Buttons, Check Boxes, Choice Controls Menus Frames. (8) JAVA NETWORKING: Basics Socket overview TCP/IP client sockets TCP/IP server sockets URL datagram sockets Introduction to JDBC. (5)

Total 42 REFERENCES: 1. Patrick Naughton and Herbert Schildt, "Java 2: The Complete Reference", Tata McGraw Hill, New Delhi, 2006. 2. Hubbard R John, Schaums Outline series of Theory and Problems of Programming with Java Tata McGraw Hill, New Delhi, 2004. 3. Deitel H M, and Deitel P J, "Java - How to Program, Prentice Hall of India, New Delhi, 2005. 4. Chitra A, Internet and Java Programming, Indian Society for Technical Education, 2002. 5. Ashton Hobbs, Teach Yourself Database Programming with JDBC in 21 Days, Tech Publications, 2002.

09X405 SOFTW ARE ENGINEERING

3104

THE PRODUCT AND THE PROCESS: Introduction - The evolving role of the softwareSoftware Characteristics Software Applications -Software Myths Process models The Linear Sequential model The Prototyping model RAD modelEvolutionary Software Process models Component Based Model-Formal method model-Fourth Generation Techniques (8) ANALYSIS CONCEPTS AND MODELING: System Engineering Hierarchy Requirements Analysis-Requirement Elicitation for software-Analysis Principles-Specification-Elements of Analysis model-Data Modeling-Functional Modeling-Behavioral modeling-ER-DFD-Data Dictionary (8) DESIGN CONCEPTS: Design Process-Principles and Concepts - Effective modular design-Design Heuristics for Effective Modularity-Design Documentation-Database Design -User interface Design - Human computer interaction. (5) RISK MANAGEMENT: Risk Strategies Identification Projection Refinement RMMM Defining a task set for the software project Software Configuration Management. (8) SOFTWARE TESTING TECHNIQUES AND STRATEGIES : Software Testing Fundamentals Test Case Design White-Box Testing Basis Path Testing Control Structure Testing Black-box Testing Strategic Issues Validation and Verification- Unit Testing Integration Testing Validation TestingSystem testing. (8) SOFTWARE QUALITY ASSURANCE: Quality Concepts SQA Activities-Software Reviews-Formal Technical Reviews- Software Measurement-Metrics for Software quality (5) Total 42 TEXT BOOK: 1. Roger S Pressman, Software Engineering A Practitioners Approach, McGraw Hill International Edition, USA, 2008.

12

REFERENCES: 1. Shari Lawrence Fleeger, Software Engineering: Theory and Practice, Pearson Education Asia, New Delhi, 2007. 2. Ian Sommerville, Software Engineering, Pearson Education Asia, New Delhi, 2008.

09X406 DATABASE MANAGEMENT SYSTEMS LABORATORY


Implementation of the following concepts: 1. DDL,DML,TCL 2. SQL operations and Functions 3. Data Integrity Constraints 4. Group functions 5. Joins and Sub queries 6. View, Index and Sequence 7. Study of PL/SQL 8. Exception handling 9. Cursors 10. Functions and Procedures 11. Triggers.

0032

09X407 SYSTEM SOFTWARE LABORATORY


1. 2. 3. 4. 5. Design of a simple Text Editor Design of a Pass 1 Assembler Design of a Pass 2 Assembler Design of a Macro Processor Develop a password utility program for files

0032

09X408 JAV A PROGRAMMING LABORATORY


Implement the following concepts: 1. 2. 3. 4. 5. 6. 7. 8. 9. Object-oriented concepts Interfaces and packages String-handling functions Multithreading and Exception Handling Applet Programming AW T/Swing and Event handling Network programming Front End development using Swing Database programming using JDBC

0032

09X501 COMPUTER GRAPHICS 3104


INTRODUCTION: The Evolution of computer graphics-Principle of interactive graphics display-Display DevicesGraphic primitives-A simple graphics package. (5) VECTOR GENERATION TECHNIQUES AND TRANSFORMATION: Coordinate systems-Points and lines Incremental methods Line drawing algorithms. Digital Differential Analyzer Circle generators. Transformation Principles of Transformation Concatenation Matrix representation. (8)

13

CLIPPING AND WINDOWING: Line clipping algorithms-Midpoint Subdivision clipping-Polygon clipping-Viewing transformation-Windowing functions-Windowing transformations. (7) INTERACTIVE GRAPHICS: Graphical input devices- 2D and 3D-Input techniques Positioning techniques-Pointing and Selection Inking and Painting- On line character recognition Event Handling Dragging and Fixing Hit Detection. (6) THREE DIMENSIONAL CONCEPTS: Methods of 3D representation 3D Transformations Viewing -3D clipping Hidden surface and hidden line Elimination-shading and Colouring methods-Basic modeling concepts and modeling methods. (8) COMPUTER GRAPHICS APPLICATIONS: Introduction to Graphics kernel Systems (GKS)-Design of animation sequences-animation Functions-Raster animation. (8) Total 42 TEXT BOOKS: 1. William M Newman and Robert F Sproul, Principles of Interactive Computer Graphics, McGraw Hill, New Delhi, 2005. 2. Donald Hearn and Pauline Baker, Computer Graphics, Pearson Education Asia, New Delhi, 2008. REFERENCE: 1. Foley, Vandam, Feiner and Hughes, Computer Graphics- Principles and Practice, Addison Wesley, USA, 2007.

09X502 OPEN SOURCE SYSTEMS

3104

INTRODUCTION: Introduction Needs Advantages Applications Commercial aspects of Open source movement. (8) OPEN SOURCE OPERATING SYSTEMS: LINUX: Introduction- General Overview- Kernel mode and user modeProcess-Architecture of Linux. (8) OPEN SOURCE DATABASE: Characteristics of Database Approach- Case Study: MySQL. (8)

OPEN SOURCE SCRIPTING LANGUAGES: Principles of Programming Language- Case Study: PHP, Python. (12) WEB SERVER: Characteristics of Web Server- Apache Web server. (6)

Total 42 REFERENCES: 1. Remy Card, Eric Dumas and Frank Mevel, The Linux Kernel Book, Wiley Publications, New York, 2003. 2. Peter Wainwright, Professional Apache, Wrox Press, USA, 2007. 3. Stephen J Mellor and Marc Balces, Executable UMS: A foundation for MDA, Addison Wesley, USA, 2003. 4. Steve Suenhring, MySQL Bible, John Wiley, New York, 2002. 5. Rasmus Lerdorf and Levin Tatroe, Programming PHP, O Reilly Publications, USA 2005. 6. Wesley J Chun, Core Python Programming, Prentice Hall of India, New Delhi, 2006.

09X503 NETWORK SECURITY


INTRODUCTION: Need for Security Principles of Security Types of Attacks Defense methods.

3104
(4)

CRYPTOGRAPHY: Basic encryption and decryption Mono alphabetic ciphers- Poly-alphabetic ciphers Substitution, Transposition Data Encryption Standard (DES) Advanced Encryption Standard (AES) (6) PUBLIC KEY CRYPTOSYSTEMS: Principles of Public Key Cryptosystems RSA Algorithm- Key Management Diffie-Hellman Key Exchange Elliptic Curve Cryptography. (8) MESSAGE AUTHENTICATION: Hash functions MD5 Algorithm Secure Hash algorithm HMAC Digital Signatures Authentication Applications Kerberos. (8) COMMUNICATION AND SYSTEM SECURITY: E-Mail Security: PGP IP Security: Overview, Architecture. OPERATING SYSTEM SECURITY: Security Models Common Vulnerabilities. WEB SECURITY: Secure Socket Layer (SSL) Security Firewalls Viruses Worms. (6) (4) (6)

Total 42 TEXT BOOK: 1. William Stallings, Cryptography and Network Security: Principles and Practice, Pearson Education, New Delhi, 2007.

14

REFERENCES: 1. Atul Kahate, Cryptography and Network Security, Tata McGraw Hill Publishing Company, New Delhi, 2006. 2. Roberta Bragg, Mark Rhodes Ousley and Keith Strassberg, Network Security: The Complete Reference, McGraw Hill Publishing Company, Singapore, 2004. 3. Kaufman, Perlman and Speciner, Network Security: Private Communication in a public world, Prentice Hall of India/ Pearson Education, New Delhi, 2007. 4. Charles P Pfleeger, Security in computing, Pearson Education, New Delhi, 2008.

09X504 SOFTW ARE TESTING

3003

SOFTWARE TESTING PRINCIPLES: Need for testing Psychology of testing Testing economies Types of testing SDLC and testing Verification and Validation Weyukers adequacy axioms. (5) TESTING STRATEGIES: White box testing techniques Statement coverage Branch coverage Condition Coverage Decision/condition coverage Multiple condition coverage- Data flow coverage Mutation testing Automated code coverage analysis Black box testing techniques Boundary value analysis Robustness analysis Equivalence partitioning Syntax testing Finite state testing Levels of testing Unit, Integration and System testing. (15) TESTING OBJECT ORIENTED SOFTWARE: Challenges Differences from testing non-OO software Class testing strategies class modality State based testing Message sequence specification. (10) TEST PLAN: Test cases, Preparation of test plan Test script. (3)

TECHNIQUES FOR AUTOMATING TEST EXECUTION: Testing and test automation the V model Tool support for lifecycle testing promise of test automation, common problems of test automation limitations of automating software testing (9) Total 42 TEXT BOOKS: 1. Roger S Pressman, Software Engineering A Practitioners Approach, Tata McGraw Hill, New Delhi, 2008. 2. Boriz Beizer, Software Testing Techniques, Dream Tech press, 2006. REFERENCES: 1. Glenford J Myer,The Art of Software Testing, John Wiley and Sons, USA, 2004. 2. William E Perry, Effective Methods of Software Testing, John Wiley and Sons, New York, 2000. 3. Mark Fewster and Dorothy Graham, Software Test Automation: Effective use of Test Execution Tools, Addison Wesley, New York, 1999.

09X506 COMPUTER GRAPHICS LABORATORY


Implement the following concepts: 1. 2. 3. 4. 5. 6. 7. 8. Line Chart Bresenham Line Algorithm Midpoint Circle Algorithm 2D Transformations Line Clipping algorithm Polygon Clipping algorithm 2D curve using Bezier generation Simple Animation

0032

09X507 SOFTW ARE TESTING LABORATORY


1. 2. 3. 4. 5. Exercise on automating black box testing Experiments with Rational Administrator Exercise on functional testing with Rational Robot Experiments with Rational Purify, Pure Coverage and Quantify Experiments with Rational Test Manager

0032

15

09X601 WEB PROGRAMMING

3104

INTRODUCTION TO WEB SERVICES: Web Services Architecture Overview of W eb Services Service Oriented Roles and Architecture Architectural process Three tier web based architecture (6) XML: Introduction to XML XML fundamentals Well-formed XML documents Components of XML document XML tools XML namespaces-XLST (8) SERVER SIDE PROGRAMMING: Introduction to web servers-Servlet Programming-Handling GET and POST requests-Passing Parameters-Java server pages: introduction: features of JSP Pages, the components of a JSP page, de4veloping and deploying JSP pages- Basic Programming with JSP-Case Study Apache. (10) . WEB APPLICATION DEVELOPMENT: ASP. NET Language Structure - Page Structure - Page event, Properties & Compiler Directives- HTML server controls- Basic Web server Controls-Data List Web Server Controls (10) Request and Response Objects, Cookies, Working with Data - OLEDB connection class, command class, transaction class, data adaptor class, data set class. Advanced Issues - Email, Application Issues, Working with IIS and page Directives, Error handling. (8) Total 42 TEXT BOOKS: 1. Buczek G,ASP.NET Developers Guide, Tata McGraw Hill, New Delhi, 2008. 2. Deitel H M and Deitel P S, Internet & World Wide Web How to Program, Pearson Education, New Delhi, 2008. REFERENCES: 1. Matthew Mac Donald, ASP.NET: The Complete Reference, TataMcGraw Hill, New Delhi, 2005. 2. Powell T A, Complete Reference HTML , Tata McGraw Hill, New Delhi, 2002. 3. Bayross I, Web Enable Commercial Application Development Using HTML, DHTML, Javascript, Pen CGI, BPB Publications, New Delhi, 2000. 4. Jaworski J, Mastering Javascript, BPB Publications, New Delhi, 1999.

09X602 INTERNET PROTOCOLS

3104

INTERNET RESOURCES: Internet History - Internet Standards Administration Internet tools: Usenet E-mail IRC News FTP and Telnet Gopher OSI Model TCP/IP protocol suite. (8) IP ADDRESSING: Internetworking concepts Application level, network level interconnection Interconnection through IP routes, Internet addresses: Classful Addressing Subnetting Supernetting - Address Resolution Protocol (ARP) Reverse Address Resolution Protocol (RARP) (8) PROTOCOL DESCRIPTION: Internet Protocol (IP): Datagram Fragmentation Options Checksum User Datagram Protocol (UDP): Datagram Checksum Operation Transmission Control Protocol (TCP): Services Numbering Bytes Flow Control Error Control. (10) ROUTING: Connection Oriented versus Connectionless service, direct and indirect delivery, Routing Methods, Routing Table, Routing Protocols: RIP, OSPF. (8)

APPLICATIONS: TELNET and Rlogin File Transfer Protocol (FTP) Trivial File Transfer Protocol (TFTP) Simple Mail Transfer Protocol (SMTP)- Hyper Text Transfer Protocol (HTTP). (8) TEXT BOOK: 1. Behrouz A Forouzan, TCP/IP Protocol Suite, Tata McGraw-Hill, New Delhi, 2008. Total 42

REFERENCES: 1. Douglas E Comer, Internetworking with TCP/IP, Volume 1, Prentice Hall of India, New Delhi, 2006. 2. Richard Stevens W, TCP/IP Illustrated Protocols, Pearson Education, New Delhi, 2005. 3. Atul Kahate and Achyut S Godbole, Web Technologies: TCP/IP to Internet Application Architecture, Tata McGraw Hill, New Delhi, 2005.

09X603 DISTRIBUTED COMPUTING SYSTEMS

3104

INTRODUCTION: Definition- System Models Advantages - Design Issues of Distributed Computing Distributed Computing Environment (5)

16

COMMUNICATION: Message Passing: Features and Issues Synchronization-Buffering Process addressing Failure handling- Group Communication - Remote Procedure Call: Model Implementation Stub generation RPC messages -Marshaling Server management - Call semantics Communication Protocols (10) SYNCHRONISATION: Clock Synchronization -Event ordering -Mutual exclusion algorithms -Election algorithmsDeadlocks in Distributed Systems (6) PROCESS MANAGEMENT: Process Migration: Features, Mechanism - Threads: Models, Issues, Implementation (6) RESOURCE MANAGEMENT: Introduction- Features of Scheduling Algorithms Task Assignment Approach Load Balancing Approach Load Sharing Approach. (5) FILE SYSTEM: Features-File model -File accessing models - File sharing semantics. NAMING: Identifiers, Addresses, Name Resolution Name Space Implementation Name Caches LDAP. TEXT BOOK: 1. Pradeep K Sinha, "Distributed Operating Systems: Concepts and Design", Prentice Hall of India, New Delhi, 2007. (5) (5) Total 42

REFERENCES: 1. Andrew S Tanenbaum and Maarten van Steen, Distributed Systems-Principles and Paradigms, PHI / Pearson Education, New Delhi, 2005. 2. George Coulouris, Jean Dollimore and Tim Kindberg, "Distributed SystemsConcepts and Design", Pearson Education Asia, New Delhi, 2004. 3. Nancy A Lynch, Distributed Algorithms, Morgan Kaufman Publishers, USA, 2003.

09X605 WEB PROGRAMMING LABORATORY


Creating applications using web development tools 1. 2. 3. 4. 5. 6. Study of software development for multi-tier environment XML file to HTML file conversion using XSLT Java Programs using Servlets Java Programs using JSP Web based programs using ASP.NET Web Services implementation

0032

09X001 MULTIMEDI A SYSTEMS

3003

INTRODUCTION: Introduction to Multimedia Systems-Components of Multimedia- Multimedia Tools-challenges of Multimedia- Uses of Multimedia Systems. (4) AUDIO TECHNOLOGIES: Basic Sound Concepts-Music-Speech-Digital Representation of Sound-Sound and Music file format-Computer Sound hardware capabilities. (6) GRAPHICS AND ANIMATION: Color Represetation-2D Graphics-Animation Fundamentals-Object and Call Animation-2D and 3D Modeling and animation (7) VIDEOS: Basic Video Concepts-raster Scanning Principles-Digital video Production Techniques-Streamingmorphing-File Format and Special Effects (9) ARCHITECTURE OF MULTIMEDIA SYSTEMS: QoS Architecture-Standards-Distributed Multimedia SystemFramework of Multimedia-Video and Image Compression Techniques. (8) MULTIMEDIA APPLICATIONS: Video Conferencing-Tele conferencing and Web Development- HTML, XML, SDHL and XDSL Technologies. (8) List of Experiments: 1. Study of Mac OS and its applications 2. 3. 4. 5. 6. Study of Adobe Photoshop Image Creation and editing using Adobe Photoshop Study of Adobe Flash Banner creation using Adobe Photoshop Interactive Animated Application using Macromedia Flash Total 42

17

7. 8. 9.

Recording and Enhancing Techniques using sound forge Video and Audio Synchronisation using IMovie Short Film Using IMovie.

TEXT BOOKS: 1. John F Koegelbuford, "Multimedia Systems", Addison Wesley, New York 2007. 2. Ralf Steinmetz and Klara Nahrstedt, "Multimedia Computing Communication and Application, Pearson Education, USA, 2007. REFERENCES: 1. Gokul S, Multimedia Magic", BPB, New Delhi, 2007. 2. Tay Vaughan, Multimedia Making it Work", Tata McGraw Hill, New Delhi, 2008. 3. Stephen McGloughlin,Multimedia Concepts and Practice. Prentice Hall, New Jersey, 2001. 4. Heather Wiliamson,"XML Complete Reference", Tata McGraw Hill, New Delhi, 2004.

09X002 THEORY OF COMPUTING

3003

INTRODUCTION: Basic Mathematical objects: sets, logic, functions, relations proofs, principle of mathematical induction, recursive definitions. (5) REGULAR LANGUAGES: Introduction Regular Expressions Finite Automata- Unions, Intersections, Complements Non Deterministic Finite Automata NFA with Transitions Kleenes Theorem. (10) NON REGULAR LANGUAGES: Criteria for Regularity Minimal Finite Automata Pumping Lemma Decision Problems (5) CONTEXT FREE GRAMMARS: Definitions Regular Grammars Derivation Trees and Ambiguity Simplified Forms Normal Forms Pumping Lemma for CFG Decision Problems. (6) PUSHDOWN AUTOMATA: Introduction Definition Deterministic PDA PDA corresponding to CFG CFG corresponding to PDA Parsing (8) TURING MACHINES: Definition Computing Partial Function Combining Turing machines Nondeterministic Turing Machine Universal Turing Machine (8) List of Experiments: 1. Regular expression. 2. Finite automata for validating a string. 3. Recursive function in non-deterministic finite automata. 4. Recursive function in non-deterministic finite automata with transitions. 5. Kleens theorem. 6. Pushdown Automata for Palindromes. TEXT BOOK: 1. John C Martin, Introduction to Languages and the Theory of India, 2007. REFERENCES: 1. 2. 3. 4. John E Hop croft, Rajeev Motwani and Jeffrey D Ullman, Introduction to Automata Theory, Languages Computation, Pearson Education Asia, New Delhi, 2004. Mishra K L P and Chandrasekaran N, Theory of Computer Science: Automata, Languages and Computation, Prentice Hall of India, New Delhi, 2007. Harry R Lewis and Christos H Papadimitriou, Elements of the Theory of Computation, PHI/ Pearson Education, New Delhi, 2005. Peter Linz, An introduction to Formal Languages and Automata, Narosa Publishers, New Delhi, 2009. Total 42

Computation, Tata McGraw Hill, New Delhi,

09X003 MULTI-TIER COMPUTING

3003

INTRODUCTION: The Business Opportunity-Driving forces-Major Issues in Information Technology-Right SizingReview of Host and Non-Distributed Computing-Basics of distributed Computing-Decomposition Approaches Layers Vs Tiers. Basics of Client/Server Computing-approaches-Applications Development Cost-Implementation. (6)

18

OPEN SOURCE STANDARDS FOR CLIENT/SERVER COMPUTING: Understanding client/Server ComputingDispelling the Myths-Obstacles-Upfront and Hidden Standards-Setting Organizations-Factors for Success (4) TWO-TIER COMPUTING : Introduction Client tier- Hardware and software Requirements-Operating system Services-Types of Client-Server Tier-Types of Server- Eight Layers of software (4) THREE-TIER COMPUTING : Introduction-Comparison of Two Tier and Three Tier-Client Side, Server Side and Middleware Side-Hardware and Software Requirements-Transaction Servers- TP Light Vs TP Heavy (5) MIDDLEWARE: Hardware and Software Requirements-Netware Connectivity- Types of Middleware MULTI-TIER COMPUTING: Overview-Benefits-Disadvantages-components-Tier Separations and Interaction THIN CLIENT COMPUTING: Introduction-Computing Models-Comparison- Components-Environments (7) (5) (3)

FRONT-END TOOLS: Overview-Essential Features of Front End Tools-Case Studies: Financial system-courseware System (8) List of Experiments: 1. Study of Middleware Standards. 2. 3. 4. 5. 6. 7. Inter-Process Communication Socket Programming Security Services Directory Services Event Handling Persistence Total 42

TEXT BOOKS: 1. Robert Orfali, Dan Harkey and Jeri Edwards, Essential Client/Server Survival Guide, Galgotia Publications, New Delhi, 2003. 2. Dawan Travis Dewire, Client/Server Computing, Tata McGraw-Hill Publishing Company, New Delhi, 2003. 3. Patrick Smith and Steve Guengerich, Client/Server Computing Prentice Hall of India, New Delhi,2002. REFERNCES: 1. Joel P Kanter, Understanding Thin Client/Server Computing Prentice Hall of India, New Delhi, 2003. 2. Jeri Edwards, Three Tier Client Server at Work, Wiley Computer Publishing, USA, 2003. 3. Ashhofaiol and Tomy Martin, Building N-tier Applications with COM and VB 6.0, Wiley computer Publishing, Singapore, 1999. 4. Travis Deroire D, Second Generation Client/Server Computing, Tata McGraw-Hill Publishing Company, New Delhi, 1997. 5. Karen Watterson, Client/Server Technology for Managers, Addison W esley, USA, 1999. 6. Larry J Vaughn, Client/Server system Design and Implementation, Tata McGraw-Hill Publishing Company, USA, 1997.

09X004 SERVICE ORIENTED ARCHITECTURE

3003

INTRODUCTION: The service-oriented enterprise Service oriented development Service abstraction Serviceoriented architecture SOA and web services Rapid integration Multi-channel access Occasionally connected computing Business Process Management Extended Web Services Specifications. (12) SERVICE ORIENTED ARCHITECTURE CONCEPTS: Service governance, processes, guidelines, principles, methods and tools Key Service characteristics Technical benefits of a service-oriented architecture Serviceoriented architecture Benefits. (12) SOA AND WEB SERVICES: The web services platform Service contracts Service-level data model Service discovery-registration and lookup Service-level security Service level interaction patterns Atomic services and composite services Generating proxies and skeletons and service contracts Service-level communication and alternative transports. (8) SOA AND BUSINESS PROCESS MANAGEMENT: Basic Business process management concepts Examples Combining BPM, SOA, and web services Orchestration and Choreography specification Introduction to metadata management (10) Total 42 List of Experiments: 1. Implement the following projects using CORDYS Platform

19

2. 3. 4. 5. 6.

Software Quality Assurance system for any software system Electricity Bill Calculation Industry Administration Management system College Admission System Library Management System

TEXT BOOKS: 1. Eric Newcomer and Greg Lomow, Understanding SOA with Web Services, Pearson Education India, New Delhi, 2005. 2. Barry Douglas K ,Web Services and Service oriented Architectures- The Savvy Managers Guide, Morgan Kaufmann Publishers, USA, 2003. REFERENCES: 1. Chatterjee, Sandeep and James Webber, Developing Enterprise Web Services: An Architects Guide, Prentice Hall of India, New Delhi, 2004. 2. Bernstein Philip A and Eric Newcomer, Principles of Transaction Processing, Morgan Kaufmann Publishers, USA, 1997.

09X005 AGENT BASED INTELLIGENT SYSTEMS

3003

INTRODUCTION: Definitions-History of Artificial Intelligence-Intelligent Agents-Nature of Environment-Structure of Agents: Simple Reflex-Goal Based Agents-Utility Based Agents-Learning Agents (8) PROBLEM SOLVING: Problem solving Agents-Search Strategies- Uninformed Search: Breadth First Search-Depth First Search- Heuristic Search: A* Search-Hill Climbing Search-Simulated Search Problems. (9) KNOWLEDGE REPRESENTATION: Propositional Logic-First Order Logic-Syntax and Semantics of First Order Logic-Using first Order Logic-Unification and Lifting-forward Chaining-Backward chaining-Resolution (9) PLANNING AND LEARNING AGENTS: Planning Problem-Planning with State Space Search-Partial Order Planning-forms of Learning-Decision Trees (8) AGENTS AND UNCERTAINITY: Acting under Uncertainty-Axioms of Probability-Bayes rule and its Use- Uncertainty Problems (8) List of Experiments: 1. Breadth first search and depth first search. 2. 3. 4. 5. 6. Hill climbing search A* search Problems on resolution and unification Developing a simple learning agent Developing a simple planning agent Total 42

REFERENCES: 1. Elaine Rich and Kevin Knight, Artificial Intelligence, Tata McGraw Hill, New Delhi, 2008. 2. Stuart Russell and Peter Norvig, Artificial Intelligence-A Modern Approach, Pearson Education, New Delhi, 2005. 3. Nils J Nilson,Principles of Artificial Intelligence, Narosa Publishing House, New Delhi, 2002. 4. Dan W Patterson, Introduction to Artificial Intelligence and Expert Systems, Prentice Hall of India, New Delhi, 2007.

09X006 USER INTERFACE DESIGN

3003

INTRODUCTION: Importance-Human-Computer interface-Characteristics of graphics interface-Direct manipulation graphical system - Web user interface: popularity-characteristic principles. (7) USER INTERFACE DESIGN PROCESS: Obstacles-Usability-Human characteristics in design - Human interaction speed-business functions-Requirement analysis-Direct-Indirect methods-Basic business functions (8) MENUS: Structures of menus - Functions of menus-Contents of menu-Formatting -Phrasing the menu - Selecting menu choice-Navigating menus-Graphical menus. (8)

20

WINDOWS: Characteristics Components - Presentation styles - Types- Managements-Organizations-OperationsWeb systems-Device-based controls: Characteristics-Screen -based controls: Operate control - Text boxes-Selection control-Combination control-Custom control-Presentation control. (10) LAYOUT: Organizing and Laying out Screens Guidelines Window Guidelines W eb Page guidelines Screen Examples (9) Total 42 List of Experiments: 1. Design a User Interface for Airline Reservation System 2. 3. 4. 5. Design a User Interface for Banking Application Design a User Interface for Gaming Application Design a User Interface for Online Exam System Design a User Interface for Personal Management System

TEXT BOOK: 1. Wilbent O Galitz, Essential Guide to User Interface Design, Wiley Dream Tech Publications, USA, 2006. REFERENCES: 1. Ben Shneiderman and Catherine Plaisant, Designing the User Interface, Addison Wesley, USA, 2006. 2. Alan Cooper, Essentials of User Interface Design, Wiley Dream Tech Publications, New York, 2008.

09X007 DATA MINING

3003

DATA WAREHOUSING: Data warehouse and OLAP technology Multidimensional data model Data warehouse architecture Data Extraction, Transformation & Loading Data marts and metadata (8) DATA MINING PRIMITIVES: Data mining Tasks Data mining Vs KDD, Data mining primitives, Data mining Query Language (6) MINING ASSOCIATION RULES: Association rule mining Apriori algorithm generating rules Frequent pattern Growth algorithm (7) CLASSIFICATION AND PREDICTION: Issues regarding Classification and Prediction - Classification by decision tree Induction ID3 Bayesian classification prediction. (9) CLUSTER ANALYSIS: Types of data Clustering Methods partitioning Methods Model based clustering methods outlier analysis (7) Case studies in Data Mining. (5) Total 42 List of Experiments: 1. Constructing Data warehouse 2. 3. 4. 5. 6. Cleaning Data warehouse Building an OLAP Cube Mining frequent item sets using association rule mining Decision Tree Induction Cluster Analysis

TEXT BOOK: 1. Jiawei Han and Micheline Kamber,Data Mining: Concepts and Techniques, Harcourt India Pvt Ltd., New York, 2001.

REFERENCES: 1. Margaret H Dunham and Sridhar S, Data Mining-Introductory and Advanced Topics, Pearson Education, New Delhi, 2007. 2. Arun K Pujari,Data Mining Techniques, Universities press India Pvt Ltd, New Delhi, 2006. 3. Paulraj ponnaih, Data Warehousing Fundamentals, John wiley & Sons Inc., USA, 2006.

09X008 NEURAL NETWORKS

3003

21

INTRODUCTION: Fundamentals Biological Neural Network- Artificial Neuron- Activation Function- Learning Rules. (5) FEED FORWARD NETWORKS AND SUPERVISED LEARNING: Perception Networks- Adaline Madaline- Back Propagation Networks- Learning factors- Linear Separability. (7) SINGLE LAYER FEEDBACK NETWORKS: Hopfield Network Discrete Hopfield Networks. (5)

ASSOCIATE MEMORY: Recurrent auto association memory- Bi-directional Associative memory- temporal associative memory- Boltzmann machine. (7) UNSUPERVISED LEARNING NETWORKS: Hamming networks- Self Organizing feature maps- Adaptive Resonance Theory network Instar Outstar model Counter propagation network Radial basis function networks. (12) APPLICATIONS OF NEURAL NETWORKS: Pattern Recognition Image compression Communication Control Systems. (6) List of Experiments: 1. Study on basics of MATLAB 2. Study on Neural Network Toolbox in MATLAB 3. Adaline Network 4. Hopfield Network 5. Back Propagation Network 6. Adaptive Resonance Theory (ART) Network 7. Radial Basis Function Networks TEXT BOOKS: 1. Laurene V Fausett, Fundamentals of Neural Networks: Architectures, Algorithms and Applications, Pearson Education India, New Delhi, 2004. 2. Simon Haykins, Neural Networks: A comprehensive Foundation Pearson Education India/ Prentice Hall of India, New Delhi, 2003. REFERENCES: 1. Sivanandam S N, Sumathi S and Deepa S N, Neural Networks using MATLAB 6, Tata McGraw Hill,New Delhi, 2005. 2. Dan W Patterson, Artificial Neural Network Theory and Applications, Prentice Hall of India, New Delhi, 1996. Total 42

09X009 UNIX INTERNALS

3003

SYSTEM OVERVIEW: Operating System services - Architecture of UNIX Operating System - Introduction to system concepts- Kernel data structures(6) INTERNAL REPRESENTATION OF FILES: Inode- Structure of a regular file- Directories- Conversion of a path names to an inode Superblock inode assignment to a file Allocation of disk blocks Other file types. (10) SYSTEM CALLS FOR THE FILE SYSTEM: Open- Read- Write- File and Record locking- Lseek- Close- File creation- Creation of special files- Changing directory and root- Changing Owner and mode- Pipes- Mounting and unmounting file system- Link- Unlink- File system maintenance. (10) PROCESSES: Process states and transitions- Context of a process- Saving the context of the process- manipulation of the process address space- Signals- Invoking other programs- Changing the size of a process- System boot and init process- Process Creation- Process termination- Process Scheduling. (8) MEMORY MANAGEMENT: Swapping- Application of swap space- File swap- Demand Paging- Data structures for demand paging- Swap process in and out-Page stealing (8) Total 42 List of Experiments: 1. Study on basic commands used in UNIX Operating System 2. 3. 4. 5. 6. Converting path names to Inode. Allocating disk blocks to a file. System calls for opening, reading and writing to a file. Process Scheduling. Demand Paging.

22

TEXT BOOK: 1. Maurice J Bach, The Design of the UNIX Operating Systems- Prentice Hall of India/ Pearson Education, New Delhi, 2006. REFERENCES: 1. Uresh Vahalia, UNIX Internals: The New Frontiers- Prentice Hall of India/ Pearson Education, New Delhi, 2007. 2. Richard Stevens, UNIX Network Programming- Volume I- Prentice Hall of India/ Pearson Education, New Delhi, 2007.

LANGUAGE ELECTIVES 09X031 PROFESSIONAL ENGLISH 3003


LISTENING : Listening Comprehension, Listening for specific Information and Information transfer. SPEAKING : Group Discussions and Presentation techniques. READING: Comprehending reading material for professional purposes and Reading for global & local comprehension critical reading skills. WRITING: Technical Composition, Definitions, Physical, Functional and Process Descriptions, Instructions, Structure, Function and Types of Reports, Memos and Emails. (4) (10) (8) (10)

SOFT SKILLS TRAINING : Interpersonal Communication, Group Communication, Interview Techniques, Etiquette, Body language and Telephone Conversation. (10) TEXT BOOK: Course material prepared by the Faculty, Department of English. Total 42

REFERENCES: 1. Bert Decker, Art of Communicating, Decker Communications Inc., USA, 2004. 2. Meenakshi Raman and Sangeeta Sharma, Technical Communication: Principles and Practice, Oxford University Press, UK, 2004. 3. Rutherford Andrea J Basic Communication Skills for Technology, Addison Wesly Longman, Singapore, 2001. 4. Sharon Gerson J and Steve Gerson M Technical Writing: Process and Product, Addison Wesley Longman, Singapore, 2001. 5. John Seely, Writing Reports, Oxford University Press, New York, 2002.

09X032 INITIATIVE TO GERMAN LANGUAGE

3003

Introductions, Alphabets, Greetings, Vocabulary, Grammar, Pronouns, Verbs and their conjugations, Articles, Question words, Statements and questions, Negation, Countries, Nationalities and Languages. Simple dialogues, Exercises. (10) Possessive pronouns, Family, Professions, the verb sein, Number system, Nouns singular and plural. Imperative statements. A small text and dialogues related to family. Exercises. (7) More irregular verbs, Accusative and dativ declensions of pronouns and articles. Modal verbs and their related grammatical structure. Dialogues and usages of modal verbs. Exercises. (8)

Time and time related particles. Daily routines, related verbs and question words. Related vocabulary and grammar. Sample dialogues and exercises. (8) Separable and inseparable verbs Exercises. Listening Activities. TEXT BOOK: 1. To be modeled by the Faculty. and their related usage pattern. Invitations and telephone conversations. (6) (3) Total 42

REFERENCES: 1. Tangram Aktuell 1 (Deutsch als Fremdsprache) - Rosa-Maria Dallapiazza, Eduard von Jan, Til Schnherr Max Hueber Verlag ,2004. 2. Grundkurs Deutsch - Roland Schpers, Renate Luscher , Manfred Glck,1980. 3. Lernziel Deutsch - Wolfgang Hieber - Max Hueber Verlag,1983.

23

09X033

BASIC FRENCH 3003

INTRODUCTION

(2)

DOSSIER O rencontres, presentations, nationalities, saluer, vous excuser, vous presemter,demander et donner votre identite, computer et peeler des mots, les verbes etre, avoir et s appeler, au present (singulier), des noms et des adjectives au singulier, Cest + nom ou pronom - // est + adjective - La negation ne pas and Des phrases interrogatives. (10) DOSSIER 1 I arrivee en France, une inscription (a un club de cyclotourisnce), ce qu on dit en classe ( consignes), Vous informer sur l identite dune personne, distinguer les formes, familieres et les formes de politesse, des articles et des adjectives possesifs, au singulier, des mots interrogatifs: quell (adjective), qui (pronoun) ou, comment (adverbs) and des noms de professions. (10) DOSSIER 2 la famille, quelques personagers celebres, presener votre famille et des amis, dire ou sont les gens et dou ils viennent, les verbes en-er, etre, avoir, faire et venire au present, le plural des noms, des adjectives, des articles et des adjectives possessifs, la negation ne pas de + nom, l interrogation avel est, ce que and a, an et de + nouns de villes et de pays. (10) DOSSIER 3 maisons et appartements, demenagements, locations, petites annonces, monuments parisiens,,situer des meubles et des objects ( la localisation), indiquer la possession, donner des orders et des interdictions, exprimer l accord et le refus, les verbes en, er, faire, prendre et nettre, au present et a I imperative, le pronom on, les pronoms toniques aprs preposition, les adjectives demonstratifs, les adjectives ordinaux, la response si and il ya un / des. (10) Total 42 TEXT BOOK: 1. LE NOUVEAU SANS FRONTIERS. REFERENCES : 1. Capelle, Guy and Gidon, Noelle. Le Nouvel Escapes. Paris: Hachette Livre,1998.

09X034

BASIC CONVERSATIONAL SKILLS IN J AP ANESE LANGUAGE 3003

Orientation Session, Geographic & Socio, economic perspective to Japan, Japanese people and culture and Basic greetings and responses (2) Basic script, Method of writing hiragana and katakana, and Combination sounds and simple words. Topic marker wa, Desu / dewa arimasen cupolas, Interrogative particle ka, Grammar particles mo, no, Introducing some one: Kochira wa ~ and Self introductions: Hajimemashite Demonstratives Kore, Sore, Are, Demonstrative Kono, Sono, Ano , Possessive noun particle no and Japanese apartments: Greeting your neighbour (2) (2) (2)

Place marakers Koko, Soko, Asoko, Direction markers Kochira, Sochira, Achira and Japanese department stores: Asking for and buying something (2) Asking for and telling the time, Paticle ni (at) for time, kara (from) ~ made (until), Particle to (and), Time periods: Days of the week, months, time of day, Verbs (Present / future and past tense) and Telephone enquiry: Asking for a phone no. And business hours. (2) Destination particle e, Particles de (mode of transportation) and to (with) and Japanese train station: Asking for Fare and track no. / types of trains. (2) Direct object particle o, Particle de (place of action) , Verbs (~masen ka, ~mashou) and Ohanami Cherry blossom viewing. (2) Particle de (by means of) , Particle ni (to), ,Aaemasu (give) and Moraimasu (receive) and Visiting a Japanese House. (2) Adjectives (i and na type), Adjectives (Positive and negative useage), which?) and Leaving a room, thanking some one for hospitality. Particle ga (however, but), Dore (2)

24

Likes and dislikes, Potential verbs (wakarimasu and dekimasu), Kara ( ~ because), Adverbs and Asking some one out over the phone. (2) Verbs denoting presence: Imasu and arimasu, Particle ni (in), Dare (who?) , Adverbs (Chikaku ni ~), Particle dare mo (negative ~ no one) , Dare ka (anyone), dare ga (who) , Nani ka (anything) , nani ga (what) - ~ya (and) ~ nado (etc.) and Asking for directions (2) Counters and Counting suffixes. (2)

Introduction to Adjectives (na and ii type), Different usages of adjectives, Comparison, Likes and dislikes and Going to a trip. (2) Need and desire (ga hoshii), Wanting to (Tabeti desu), Going for a certain purpose (mi ni ikimasu) and Choosing from a menu. (2) Verb groups, I, II and III and Exercises to group verbs. (2)

Please do (te kudasai), Present continuous tenses (te imasu), Shall I? ( ~ mashou ka) and Describing a natural phenomenon (It is raining) (2) To grant permission (~te mo ii desu), Asking for permission ( ~ te mo ii desu ka) and Should not do ( ~ te wa ikemasen) (2) Describing a continuing state and Describing a habitual action Roleplays in Japanese A demonstration on usage of chopsticks and Japanese tea party (2) (2) (2) Total 42

TEXT BOOK: 1. Minna no nohongo Romaji ban (first 10 lessons of this book).

REFERENCE: 1. Minna no Nihongo I Honsatsu Roma ji ban (Main Textbook Romanized Version). International publisher 3A Corporation, Tokyo, Indian distributor Goyal Publishers & Distributors, New Delhi.

25

Das könnte Ihnen auch gefallen