ANNA UNIVERSITY OF TECHNOLOGY MADURAI REGULATIONS 2010 CURRICULUM AND SYLLABUS

Transcription

1 ANNA UNIVERSITY OF TECHNOLOGY MADURAI REGULATIONS 2010 CURRICULUM AND SYLLABUS Three Year M.C.A (Master of Computer Applications) Degree Course SUBJECTS OF STUDY SEMESTER I Theory Course Code 10377MC101 Regulation Course Title L T P C PROFESSIONAL AND ORGANIZATIONAL COMMUNICATION 10377MC102 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 10377MC103 PROGRAMMING IN C 10377MC104 COMPUTER ORGANIZATION AND ARCHITECTURE 10377MC105 DATA STRUCTURES Practical Course Code Course Title L T P C 10377MC106 C PROGRAMMING LABORATORY MC107 DATA STRUCTURES LABORATORY Total 24

2 10377MC101 PROFESSIONAL AND ORGANIZATIONAL COMMUNICATION UNIT I GENERAL COMMUNICATION Language and communication- stages of communication-channels of communicationbarriers of communication-developing communication skills-listening-types of listeningeffective listening- speaking- speech process- improving fluency and expressionreading-reading process- reading strategies-writing effective writing-developing paragraph. UNIT II VERBAL & NON VERBAL COMMUNICATION Conversational skills-face to face- telephonic-presentation skills-personal appearanceposture- gesture-facial expression- eye contact- space- paralanguage. UNIT III ORGANISATIONAL COMMUNICATION Group discussion- meetings- seminars and conferences- interviews-report writingwriting proposal- placing orders letters of enquiry-resume- Job Application letter- etiquettes-technical articles, circulars, notices& memos-thesis writing Bibliography. UNIT IV FUNCTIONAL COMMUNICATION Vocabulary development-synonyms-antonyms-paragraph writing-reading comprehension-dialogue writing-common errors, punctuation. UNIT V WORK PLACE ETIQUETTES Soft skills- time management- stress management- creative thinking- interpersonal skills- leadership skills- personality development-problem solving skills- negotiation skills- team work. Reference Books: 1. M.Rizvi,Ashraf, Effective Technical Communication, Tata McGraw-Hill, Krishna Mohan and Banerji, Meera, Developing Communication skills, Macmillan India Ltd, Robert M. Sherfield and et al, Developing Soft Skills, 4e, Pearson Education, Meenakshi Raman and Sangeeta Sharma, Technical Communication: English skills for Engineers, Oxford University Press, Phillips Annie, Communication and the Manager s Job, Radcliffe Publishing Ltd, Verma shalini, Soft skills for the BPO Sector, Dorling Kindersley (India) Pvt.Ltd, MCA Degree Program

3 10377MC102 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE UNIT I Mathematical logic: Introduction statements and notation, connectives, Normal forms: Conjunctive Normal Forms - Disjunctive Normal Form - Principal Conjunctive Normal Forms - Principal Disjunctive Normal Form. Unit II Mathematical logic : The theory of inference for the statement calculus, Automatic theorem proving the predicate calculus, free and bound variables inference theory of the predicate calculus. Unit III Set theory introduction- relations and ordering relations properties relation matrix graph of a relation partition equivalence relations compatibility relations composition of binary relations partial ordering functions composition inverse functions Peano axioms and mathematical inductions. Unit IV Lattices and Boolean algebra: Lattices as partially ordered sets, properties of lattices some special lattice Boolean algebra definition and examples Boolean functions Boolean forms and free Boolean algebra value of Boolean expression minimization of Boolean functions. Unit V Graph theory introduction basic concepts of graph theory paths reachability and connectedness matrix representation of graphs trees simple precedence grammars syntax terminology a view of passing use of precedence relation definition of precedence relation parsing algorithm. Reference Books: 1. Trembly and Manohar, Discrete mathematical structures with applications to computer science, Tata McGrawHill, Kenneth H. Rosen, Discrete mathematics and its applications, McGrawHill International Editions 1999.

4 10377MC103 PROGRAMMING IN C UNIT I Introduction - Introduction to Computers, Hardware and Software components - Flowcharts - Structured Programming - Overview of C Constants, Variables and Data Types enum - typedef - Type Casting - Operators and Expressions. UNIT II Basic of C Language - Managing Input/Output Operations Formatted I/O if - Nested if switch goto - while- do - for - break - continue - Storage classes. UNIT III Arrays, Functions, Structures And Unions - Arrays dynamic and multi-dimensional arrays - Character arrays and Strings String handling Functions - User defined Functions Recursion - Structures and Unions Array of Structures Structures and Functions. UNIT IV Pointers And File Management - Pointers Declaration, Accessing a variable, character strings, pointers to functions and structures Types of Pointer - File Management in C Command Line Argument - Dynamic Memory allocation Linked Lists Preprocessors. UNIT V Hardware Interaction - I/O in C Types of I/O - Interaction with H/W in C DOS Approach - ROM BIOS, CPU Registers Interrupts - DOS Function Requests - Interaction with HW using Port I/O - Operation on bits Mouse Programming. Reference Books: 1. Yeshwant Kanitkar, Let Us C, fourth Edition, BPB Publications, E.Balagurusamy, Programming in ANSI C, Tata McGraw Hill, Darnell and Margolis, ANSI C - A Systematic programming Approach, Narosa Publications, B.W. Kerninghan, D.M.Ritchie, The C Programming Language, Second Edition, Prentice Hall of India, l Deitel and Deitel, C - How to Program, Addisson Wesley,

5 10377MC104 COMPUTER ORGANIZATION AND ARCHITECTURE UNIT-I Basic structure of computers: Functional Units- Basic operational concepts Bus structures Machine Instructions and Programs - Memory locations and Addresses - Memory operations Instructions and instruction sequencing Addressing modes Assembly language. UNIT-II Arithmetic: Number Representation Addition and Subtraction of signed numbers Design of Fast Adders Multiplication of Positive numbers Signed operand multiplication Fast Multiplication Integer Division Floating point numbers and operations. UNIT-III Processing Unit Some fundamental concepts Execution of a complete instruction- Multiple Bus Organization - Hardwired Control Micro-programmed Control: Micro instruction Micro program sequencing Micro instructions with next address field pre-fetching microinstructions Emulations. UNIT-IV Main Memory: Some basic concepts Semiconductor RAM memories Read Only Memories Cache Memories - Performance Considerations Virtual Memories Memory Management Requirements. UNIT-V Input Output Organization: Accessing I/O devices Interrupts Direct Memory Access Buses - Interface Circuits. Pipelining: Basic Concepts - Data Hazards Instruction Hazards. Reference Books: 1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Computer Organization", Fifth Edition, Tata McGraw Hill, William Stallings, Computer Organization and Architecture, Sixth Edition, Pearson Education, David A. Patterson, john L. Hennessy, Computer Organization and Design, Third Edition, Morgan Kauffmann Publishers, 2005.

6 10MC105 UNIT I DATA STRUCTURES L T P C Introduction Need for Data Structures Stack and Queues Operations Dequeue Linked lists Doubly Linked list Circular Linked list and its applications. UNIT II Basic tree concepts Binary trees: Definition - Operations Binary search trees: Definition Built Binary search tree - Insertion and deletion B-tree: Insertion Red- Black tree: Properties Hashing Hash functions Collision Resolution. UNIT III Sorting: General sort concepts - Insertion sort Shell sort Selection sort Heap sort: Heaps Maintaining the Heap Property Building a heap The heap sort algorithm Quick sort Description of quick sort Performance of quick sort A Randomized version of quick sort Analysis of quick sort B Merge sort Bubble sort. UNIT IV Binomial Heaps: Definition Insertion Melding Deletion of Min element Fibonacci Heaps: Definition Operation on Fibonacci Heap Pairing Heaps: Definition Operations on Pairing Heap. UNIT V Elementary Graph Algorithms Representation of graphs Breadth first search Depth first search Topological sort Strongly connected components Minimum Spanning Trees: Growing a minimum spanning tree The algorithm of Kruskal and Prim. Text Books: 1. Richard F. Gilberg, Behrouz A. Forouzan, Data Structures A Pseudocode Approach with C Thomson Asia Ltd, Ellis Horowitz, Sartaj Sahni and Dinesh Mehta, Fundamentals of Data Structures in C++, University Press, 2008.

7 Reference Books 1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, Prentice Hall, Robert Sedgewick, Algorithms in C++, Pearson Education, 2002

8 MC106 C PROGRAMMING LABORATORY 1. Program for Fibonacci Series, Finding the sum of set of numbers, Generation of Prime Numbers. 2. Sine function, Cosine function computation 3. Matrix manipulation- Addition, Subtraction, Multiplication, Inverse 4. Base Conversion 5. Program for string operations like string copy, strcat using pointers 6. Program to read a line of text from the keyboard and calculate the number of characters, words and lines. 7. Program to sort set of names using pointers File 8. Program to read a set of lines from the keyboard and write into the specified File. 9. Program to store & retrieve the structure elements in a specified file 10. Program for creating new files with read/write permission codes, reading a given file and displaying the contents using low level file operation. ROM-BIOS/DOS Services 11. Finding memory size 12. Positioning cursor on the screen 13. Deleting a file & Creating Directories 14. Reading Disk sector 15. Writing directly to VDU memory

9 MC107 DATA STRUCTURES LABORATORY Experiments: 1. Implementation of Stack and its operations. 2. Implementation of Queue and its operations. 3. Implement the single linked list and its operations. 4. Implement the doubly linked list and its operations. 5. Implement the circular linked list and its operations. 6. Create a binary search tree and do the following traversals (i)in order (ii) Pre order (iii) Post order 7. Implement the following operations on a binary search tree (i) Insert a node (ii) Delete a node. 8. Sort the given list of numbers using heap and quick sort. 9. Perform the following operations in a given graph (i) Depth first search (ii) Breadth first search.