2010 mca syllabus 2008-11 modified

ADIKAVI NANNAYA UNIVERSITYDEPARTMENT OF COMPUTER SCIENCE

Syllabus of the MCA Course - 2008-11

First Year Semester I

Code Name of the Subject Periods Max Marks

Theory Lab.University

ExamSessionals Total

MCA 1.1.1Discrete Mathematical Structures

4 - 100 50 150

MCA 1.1.2 Computer Organization 4 - 100 50 150MCA 1.1.3 Data Structures using “C” 4 - 100 50 150MCA 1.1.4 Probability & Statistics 4 - 100 50 150MCA 1.1.5 Management Accountancy 4 - 100 50 150MCA 1.1.6 IT Work Shop - 3 50 50 100

MCA 1.1.7Data Structures Using C Lab

- 3 50 50 100

MCA 1.1.8 Communication Skills Lab - 3 50 50 100CBCS Communication Skills 4 100 50 150

First Year Semester II




MCA 1.2.1 Operating Systems 4 - 100 50 150MCA 1.2.2 Advanced Data Structures 4 - 100 50 150MCA 1.2.3 Operations Research 4 - 100 50 150

MCA 1.2.4Object Oriented Programming

4 - 100 50 150

MCA 1.2.5Information Systems and Organizational Behavior

4 - 100 50 150

MCA 1.2.6Object Oriented Programming Lab

- 3 50 50 100

MCA 1.2.7Advanced Data Structure Lab

- 3 50 50 100

MCA 1.2.8 Operating Systems Lab - 3 50 50 100

CBCSGeographical Information Systems

4 - 100 50 150


Second Year Semester I




MCA 2.1.1Automata and Compiler Design

4 - 100 50 150

MCA 2.1.2 Software Engineering 4 - 100 50 150

MCA 2.1.3Database Management Systems

4 - 100 50 150

MCA 2.1.4Design and Analysis of Algorithms

4 - 100 50 150

MCA 2.1.5 Unix Programming 4 - 100 50 150MCA 2.1.6 Unix Programming Lab - 3 50 50 100

MCA 2.1.6Database Management Systems Lab

- 3 50 50 100

MCA 2.1.7Technical Paper Writing and Presentation Lab

- 3 50 50 100

CBCS 4 - 100 50 150

Second Year Semester II




MCA 2.2.1 Computer Networks 4 - 100 50 150MCA 2.2.2 Distributed Systems 4 - 100 50 150MCA 2.2.3 OOAD with UML 4 - 100 50 150

MCA 2.2.4Data Warehousing and Datamining

4 - 100 50 150

MCA 2.2.5

Elective-I:1. A.I. & Neural

Networks2. Soft computing

4 - 100 50 150

MCA 2.2.6 Visual Programming Lab - 3 50 50 100MCA 2.2.7 Network Programming Lab - 3 50 50 100MCA 2.2.8 Data Warehousing Lab - 3 50 50 100

CBCS 4 - 100 50 150


Third Year Semester I




MCA 3.1.1 Web Services 4 - 100 50 150

MCA 3.1.2Network Security and Cryptography

4 - 100 50 150

MCA 3.1.3Software Testing Methodologies

4 - 100 50 150

MCA 3.1.4 Elective-II 4 - 100 50 150MCA 3.1.5 Elective-III 4 - 100 50 150MCA 3.1.6 Software Testing Lab - 3 50 50 100MCA 3.1.7 Web Programming Lab. - 3 50 50 100

MCA 3.1.8Soft Skills Lab(Paper Presentation, Abstract Preparation etc)

- 3 50 50 100

CBCS 4 - 100 50 150

Elective –II : 1. Middle Ware Technology2. E-Commerce3. Bio-informatics4. Mobile Computing

Elective – III1. Software Project Management2. GIS3. Network Programming4. Image Processing

Third Year Semester II

Project Work 400 Marks

Adikavi Nannaya University, Rajahmundry


MCA I Year - Semester-I Syllabus

1.1.1. Discrete Mathematical StructuresInstruction: 4 Periods/week Sessional Marks: 50Univ-Exam : 3 Hours Univ-Exam-Marks: 100

Introduction: Logic-Prepositional Equivalences-Truth tables-Totalogies-Predicates and Quantifiers-Sets-Operations on sets-Sequences and Summations-Growth functions-relations and their properties-n-ary relations and their applications-Representation of relations-Closures of relations-Equivalence relations-Partial Orderings.

Counting Techniques: Basics of Counting-Pigeonhole Principle-Combinations and Permutations-Generalized Permutations and Combinations-Recurrence relations-Solving Recurrence Relations-Divide and Conquer relations-Generating Functions-Inclusioin and Exclusion-Applications of Inclusion-Exclusion.

Graph Theory: Introduction to Graphs-Terminology-Relations and Directed Graphs-Representations of Graphs – Ismorphism-Connectivity – Euler and Hamitonian Paths – Shortest Path problems – Plannar Graphs – Graph Coloring – Introduction to trees-Applications of trees – Traversals – Trees and sorting – Spanning Trees – Minimum Spanning Trees.

Boolean Algebra and Models of Computation: Boolean Functions – Representing Boolean Functions – Logic Gates – Minimizations of Cicuits – Languages and Grammars – Finite State Machines with and with no outout-Languge Recognition – Turing Machines.

Text Book:Discrete mathematics and its applications, Keneth. H. Rosen, Tata McGraw-Hill Publishing Company, New Delhi (Chapter: 1, 4.1, 4.2, 4.3, 4.6, 4.7, 5, 6, 7,8,9,10).

Reference Books:1) Discrete Mathematics for computer scientists & Mathematicians, Joe L. Mott,

Abraham Kandel & T.P). Baker, Prentice Hall of India Ltd., New Delhi.2) Discrete mathematics, Rihard Johnsonbaug, Pearson Education, New Delhi.



MCA I Year - Semester-I Syllabus

1.1.2. Computer OrganizationInstruction: 4 Periods/week Sessional Marks: 50Univ-Exam : 3 Hours Univ-Exam-Marks: 100

UNIT-I:

BASIC STRUCTURE OF COMPUTERS: Computer Types, Functional unit, Basic OPERATIONAL concepts, Bus structures, Software, Performance, multiprocessors and multi computers. Data Representation. Fixed Point Representation. Floating – Point Representation. Error Detection codes.

COMPUTER ARITHMETIC: Addition and subtraction, multiplication Algorithms, Division Algorithms, Floating – point Arithmetic operations. Decimal Arithmetic unit Decimal Arithmetic operations

UNIT-II:REGISTER TRANSFER LANGUAGE AND MICROOPERATIONS: Register Transfer language. Register Transfer Bus and memory transfers, Arithmetic Mircrooperatiaons, logic micro operations, shift micro operations, Arithmetic logic shift unit. Instruction codes. Computer Registers Computer instructions – Instructioncycle.Memory – Reference Instructions. Input – Output and Interrupt. STACK organization. Instruction formats. Addressing modes. DATA Transfer and manipulation. Program control. Reduced Instruction set computer.

UNIT-III:MICRO PROGRAMMED CONTROL: Control memory, Address sequencing, icroprogram example, design of control unit Hard wired control. Microprogrammed control

UNIT-IV:PROGRAM AND NETWORK PROPERTIES Conditions of Parallelism. Program Paritioning and Scheduling, Program flow Mechanism, System Interconnect Archcitectures.

SCALABILITY AND PERFORMANCE Poricipels of Scalable Performance, Performance Metrics and Measures, Parallel Processing Applications. Speedup Performance Laws. Scalability Analysis and Approaches.

UNIT-V:THE MEMORY SYSTEM: Basic concepts semiconductor RAM memories. Read-only memories Cache memories performance considerations, Virtual memories secondary storage. Introduction to RAID.

UNIT-VI:INPUT-OUTPUT ORGANIZATION: Peripheral Devices, Input-Output Interface, Asynchronous data transfer Modes of Transfer, Priority Interrupt Direct memory Access, Input –Output Processor (IOP) Serial communication; Introduction to peripheral component, Interconnect (PCI) bus. Introduction to standard serial communication protocols like RS232, USB, IEEE1394.

UNIT-VII:PIPELINE AND VECTOR PROCESSING:Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, RISC Pipeline Vector


Processing, Array Processors.

UNIT-VIII:MULTI PROCESSORS:Characteristics or Multiprocessors, Interconnection Structures, Interprocessor Arbitration. InterProcessor Communication and Synchronization Cache Coherance. Shared Memory Multiprocessors.

MULTIPROCESSINGMultiprocessor System Interconnects. Cache Coherence and Synchronization Mechanisms.Vector Processing Principles. SIMD Computer Implementation Models. Larency Hiding Techniques. Principles of Multi Threading. Data Flow Architecture Evaluation.

TEXT BOOKS:1. Computer Systems Architecture – M.Moris Mano, IIIrd Edition, Pearson/PHI2. Computer Organization – Car Hamacher, Zvonks Vranesic, SafeaZaky, Vth Edition, McGraw Hill.

REFERENCE:1. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI2. Structured Computer Organization – Andrew S. Tanenbaum, 4th Edition PHI/Pearson3. Fundamentals or Computer Organization and Design, - Sivaraama Dandamudi SpringerInt. Edition.4. Computer Organization, Anjaneyulu, Himalaya Pub house.

1. Digital Logic Circuits and Components: (6 Periods)Digital Computers - Logic gates - Boolean Algebra - Map SimplificationsCombinational Circuits: Half-Adder, Full-Adder, decoders, Encoders, MultiplexersSequential Circuits: Flip flops, Registers, Shift Registers, Binary Counters - Memory Unit.

2. Data Representation : (4 Periods)Data Types - Complements - Fixed Point Representation - Floating Point Representation - Other Binary Codes - Error detection Codes

3. Processor Organisation : (8 Periods)General Register Organisation - ALU - Instruction codes - Instruction Formats - Stack Organisation - Addressing modes

4. Control Unit : (8 Periods)Register transfer and micro operations, Timing and Control, Control Memory, micro programming, Hard wired control

5. 8085 Microprocessor : (6 Periods)Internal Architecture, Instruction Set, Assembly Language programming

6. Input/Output Organisation : (8 Periods)I/O interface, Asynchronous data transfer, Modes of transfer, priority Interrupt, Direct memory access.


7. Memory Organisation: Memory Hierarchy, Main memory, Auxiliary memory, Associate Memory, Cache Memory, and Virtual memory.

Text Book:

1). Computer System Architecture , M. Morris Mano, Prentice Hall of India Pvt. Ltd., Eastern Economy Edition, Third Edition, Sept. 2002

2). Micro processor Architecture, Programming & Applications with the 8085, Ramesh S Goankar, Penram International Publishing (India) Pvt. Ltd., Fourth Edition, 2002

Reference Book :

Computer Architecture and Organization, William Stallings, PHI Pvt. Ltd., Eastern Economy Edition, Sixth Edition, 2003

Adikavi Nannaya University, RajahmundryMCA I Year - Semester-I Syllabus

1.1.3. Data Structures Using “C”

Instruction: 4 Periods/week Sessional Marks: 50Univ-Exam : 3 Hours Univ-Exam-Marks: 100


COMPUTER PROGRAMMING AND DATA STRUCTURESUNIT - IIntroduction to Computers – Computer Systems, Computing Environments, Computer Languages, Creating and running programmes, Software Development Method, Algorithms, Pseudo code, flow charts, applying the software development method.UNIT - IIIntroduction to C Language – Background, Simple C Programme, Identifiers, Basic data types, Variables, Constants, Input / Output, Operators. Expressions, Precedence and Associativity, Expression Evaluation, Type conversions, Bit wise operators, Statements, Simple C Programming examples. Selection Statements – if and switch statements, Repetition statements – while, for, do-while statements, Loop examples, other statements related to looping – break, continue, goto, Simple C Programming examples.UNIT - IIIDesigning Structured Programmes, Functions, basics, user defined functions, inter function communication, Standard functions, Scope, Storage classes-auto, register, static, extern, scope rules, type qualifiers, recursion- recursive functions, Preprocessor commands, example C programmesArrays – Concepts, using arrays in C, inter function communication, array applications, two – dimensional arrays, multidimensional arrays, C programme examples.UNIT - IVPointers – Introduction (Basic Concepts), Pointers for inter function communication, pointers to pointers, compatibility, memory allocation functions, array of pointers, programming applications, pointers to void, pointers to functions, command –line arguments.Strings – Concepts, C Strings, String Input / Output functions, arrays of strings, string manipulation functions, string / data conversion, C programme examples.UNIT - VDerived types – Structures – Declaration, definition and initialization of structures, accessing structures, nested structures, arrays of structures, structures and functions, pointers to structures, self referential structures, unions, typedef, bit fields, enumerated types, C programming examples.UNIT - VIInput and Output – Concept of a file, streams, standard input / output functions, formatted input / output functions, text files and binary files, file input / output operations, file status functions (error handling), C


programme examples.UNIT – VIISearching and Sorting – Sorting- selection sort, bubble sort, insertion sort, quick sort, merge sort, Searching-linear and binary search methods.UNIT - VIIIData Structures – Introduction to Data Structures, abstract data types, Linear list – singly linked list implementation, insertion, deletion and searching operations on linear list, Stacks-Operations, array and linked representations of stacks, stack application-infix to postfix conversion, postfix expression evaluation, recursion implementation, Queues-operations, array and linked representations.TEXT BOOKS :1. C Programming & Data Structures, B.A.Forouzan and R.F. Gilberg, Third Edition, CengageLearning.2. Problem Solving and Program Design in C, J.R. Hanly and E.B. Koffman, Fifth Edition, Pearsoneducation.



1.1.4. Probability & Statistics


Probability: Definitions of probability, Addition theorem, Condiitonal probability, Multiplication theorem, Bayes theorem of probability and Geometric probability.

Radom variables and their properties: Discrete Random variable, Continuous random variable, Probability Distribution joint probability distributions their properties, Transformation variables, Mathematical expectations, probability generating functions.

Probability Distributions / Discrete distributions : Binomial, Poisson Negative binominal distributions and their properties. (Definition, mean, variance, moment generating function., Additive properties, fitting of the distribution).

Continuous distributions : Uniform, Normal, exponential distributions and their properties.

Multivariate Analysis: Correlation, correlation coefficient, Rank correlation, Regression Analysis, Multiple Regression, Attributes, coefficient of Association, x2 – test for goodness of fit, test for independence.

Estimation: Sample, populations, statistic, parameter, Sampling distribution, standard error, unbiasedness, efficiency, Maximum likelihood estimator, notion & interval estimation.

Testing of Hypothesis: Formulation of Null hypothesis, critic al region, level of significance, power of the test.

Small Sample Tests: Testing equality of means, testing equality of variances, test of correlation coefficient, test for Regression Coefficient.

Text Books:Probability & Statistics for Engineers and Scientists, Walpole, Myers, Myers, Ye. Pearson Education.Probability, Statistcs and Random Processes T. Veerarajan Tata McGraw – Hill.

Reference Book:

Probability & Statistics with Reliability, Queuing and Computer Applications, Kishor S. Trivedi, Prentice Hall of India, 1999.



1.1.5. Management AccountancyInstruction: 4 Periods/week Sessional Marks: 50Univ-Exam : 3 Hours Univ-Exam-Marks: 100

Principles of Accounting: Nature and Scope of Accounting, Double Entry System of Accounting, Introduction to Basic Books of Accounts of sole proprietary concern, closing of books of accounts and preparation of trial balance.

Final Accounts : Trading, Profit and Loss Accounts and Balance Sheet of sole proprietary concern with normal closing entries (with numerical problems).

Ratio Analysis : Meaning, Advantages, Limitations, Types of Ratio and their usefulness (Theory only) Fund flow statement Meaning of the term fund, flow of fund, working capital cycles, preparation and inter-preparation of statement.

Costing : Nature, Importance and Basic Principles:Budget and Budgetary control: Nature and scope, importance method of finalization and master budget, functional budgets.

Marginal Costing: Nature, Scope, Importance, Construction of break event chart, Limitations and uses of break even chart, Practical Applications of Marginal costing.(with numerical problems)

Introduction to computerized accounting system: Coding Logic and codes required, Master files, Transaction files, Introduction to Documents used for Data collection, Processing of different files and outputs obtained.

Text Books:

Introduction to Accountancy, T.S. GrewalManagement Accountancy S.P. Jain

Reference Book:

Introduction to Accounting G.Agarwal.



1.1.7. Data Structures Using “C” Lab


1. Write a Program to find factorial of given number2. Write a Program to find sum of N numbers3. Write a Program to implement various operations on Two Matrices4. Write a Program to find reverse of a given number5. Write a Program to implement various string operations6. Write a Program to swap two numbers using call by value and call by reference7. Write a Program to solve towers of Hanoi problem using recursion8. Write a Program to calculate average marks of 10 students using structures9. Write a Program to implement Stack Operations10. Write a Program to Implement Queue Operations11. Write a Program to evaluation of Post-Fix expression12. Write a Program for conversion of Prefix expression to post fix expression13. Write a Program to implement circular queue14. Write a Program to implement Single Linked List 15. Write a Program to Implement Doubly Linked List16. Write a Program for Implementation of Binary Tree operations17. Write a program for implementation of Binary tree traversal techniques18. Write a Program to Implement BFS and DFS in Graphs19. Write a Program for Bubble Sort, Selection Sort, Insertion Sort, Quick Sort20. Write a Program for Linear Search and Binary Search



1.1.8. Communication Skills Lab


Objectives:The language Lab focuses computer-aided multi-media instruction and languageacquisition to achieve the following targets:

1. Introduction to Phonetics.2. Introduction to Vowels and Consonants and associated Phonetic symbols.3. Introduction to Accent, Intonation and Rhythm.4. Situational Dialogues / Role Play. 5. Public Speaking.6. Debate7. Group discussions 8. Facing Interviews9. Resume preparation10. e-correspondence

Books Suggested for English lab :

1. Developing Communication Skills by Krishna Mohan & Meera Benerji (Macmillan) 2. Speaking English Effectively by Krishna Mohan & NP Singh (Macmillan) 3. Better English Pronunciation by JDO Connor (UBS – Cambridge) 4. Handbook of English Grammar and Usage, Mark Lester and Larry Beason, Tata

McGraw-Hill 5. A text book of English Phonetics for Indian Students by T.Balasubramanian

(Macmillan) 6. English Skills for Technical Students, WBSCTE with British Council, OL


Adikavi Nannaya University, RajahmundryM.C.A. – II Semester Syllabus

1.2.1. Operating Systems

Instruction : 4 periods/week Sessional Marks: 50Univ. Exam: 3 Hours Univ. Exam Marks: 100

Overview: Introduction, Computer System structures, Operating systems structures.

Process Management: Processes, Threads, CPU scheduling, Process synchronization, Deadlocks.

Storage Management: Memory management, Virtual memory, file system, I/O systems, Mass – storage structure.

Protection and Security: Protection and Security.

Text Book:

Applied Operating System Concepts, Avi Silberschatz, Peter Galvin, Grey Gagne.



1.2.2. Advanced Data StructuresInstruction: 4 Periods/week Sessional Marks: 50Univ-Exam: 3 Hrs. Univ-Exam-Marks: 100 Unit I:-C++ Class Overview- Class Definition, Objects, Class Members, Access Control, Class Scope, Constructors and destructors, parameter passing methods, Inline functions, static class members, this pointer, friend functions, dynamic memory allocation and deallocation (new and delete), exception handling.

Unit II:-Function Overloading, Operator Overloading, Generic Programming- Function and class templates, Inheritance basics, base and derived classes, inheritance types, base class access control, runtime polymorphism using virtual functions, abstract classes, streams I/O.

Unit III:-Algorithms, performance analysis-time complexity and space complexity,O-notation, Omega notation and Theta notation, Review of basic data structures - the list ADT, stack ADT, queue ADT, implementation using template classes in C++, sparse matrix representation.

Unit IV:-Dictionaries, linear list representation, skip list representation, operations- insertion, deletion and searching, hash table representation, hash functions, collision resolution-separate chaining, open addressing-linear probing, quadratic probing, double hashing, rehashing,extendible hashing, comparison of hashing and skip lists.

Unit V:-Priority Queues – Definition, ADT, Realizing a Priority Queue using Heaps, Definition, insertion, Deletion, Application-Heap Sort, External Sorting- Model for external sorting, Multiway merge, Polyphase merge.

Unit VI:-Search trees (part I) : Binary search trees, definition, ADT, implementation, operations-searching,insertion and deletion, Balanced search trees- AVL trees, definition, height of an AVL tree, representation, operations-insertion, deletion and searching.

Search trees (part II) : Introduction to Red –Black trees and Splay Trees, B-Trees-B-Tree of order m, height of a B-Tree, insertion, deletion and searching, Comparison of Search Trees.

Unit VII:-Divide and Conquer- General method, applications – Binary search, merge sort, quick sort, Strassen’s matrix multiplication Efficient non recursive tree traversal algorithms, Biconnected components. Disjoint set operations, union and find algorithms.

Unit VIII:-Greedy method and Dynamic programming : General method (Greedy), Minimum cost spanning trees, Job sequencing with deadlines, General method (Dynamic Programming), Optimal binary search trees, 0/1 knapsack problem, Ordering Matrix Multiplications

TEXT BOOKS :1. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education, second edition.2. Data structures, Algorithms and Applications in C++,S.Sahni,University press (India)

http://www.indiastudychannel.com/resources/31846-JNTU-II-Year-B-Tech-IT-I-Sem-syllabus-for.aspx

http://www.indiastudychannel.com/resources/31846-JNTU-II-Year-B-Tech-IT-I-Sem-syllabus-for.aspx


pvt ltd, 2nd edition, Orient Longman pvt.ltd.REFERENCE :1. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and D.Mount, Seventh Edition Wiley student edition, John Wiley and Sons.2. Data Structures and Algorithms in C++, Third Edition, Adam Drozdek, Thomson3. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education.4. C++, The Complete Reference, 4th Edition, Herbert Schildt, TMH.5. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI/Pearson Education.


1.2.3. Operations ResearchInstruction: 4 Periods/week Sessional Marks: 50


Univ-Exam: 3 Hrs. Univ-Exam-Marks: 100

Overview of Operations Research: OR models – OR Techniques.

Linear Programming: Introduction – Graphical Solution; Graphical sensitivity analysis. The standard form of linear programming problems – Basic feasible solutions – unrestricted variables – simplex algorithm – artificial variables – Big M and two phase method – Degeneracy –alternative optima- unbounded solutions – infeasible solutions.

Dual Problems: Relation between primal and dual problems – Dual simplex method.

Transportation model: Starting solutions. North West corner Rule – lowest cost method- Vogels approximation method – Transportation algorithms – Assignment problem – Hungarian Method.

Network Models: Definition – CPM and PERT – Their Algorithms. Integer Programming: Branch and bound Algorithms cutting plan algorithm.

Dynamic Programming: Recursive nature of dynamic programming – Forward and Backward Recursion.

Deterministic Inventory Models: Static EOQ Models– Dynamic EOQ models.

Game theory: Two person Zero Sum, Games – Mixed strategy games and their Algorithms.

Text Books:

1. Operations Research – An Introduction, Handy A Taha-Pearson Education. [Chapter 1,2,3,4,5 and 6.1, 6.2, 6.7, 9,10,11,14].

2. Operations Research Panneer Selvan Prentice Hall of India.



M.C.A. – II Semester Syllabus

1.2.4. Object Oriented ProgrammingInstruction: 4 Periods/week Sessional Marks: 50Univ-Exam: 3 Hrs. Univ-Exam-Marks: 100

UNIT-I:

Introduction: Creation of Java, importance of Java to internet, byte code, Java buzzwords, OOP

Principles, Encapsulation, Inheritance and Polymorphism, data types, variables, declaring variables,

dynamic initialization, scope and life time of variables, arrays, operators, control statements, type

conversion and casting, compiling and running of simple Java program.

UNIT-II:

Classes and Objects: Concepts of classes and objects, class fundamentals Declaring objects, assigning

object reference variables, introducing methods,constructors, usage of static with data and methods,

usage of final with data,

access control, this key word, garbage collection, overloading methods and constructors, parameter

passing – call by value, recursion,nested classes and inner classes, exploring the String class.

UNIT-III:

Inheritance: Basic concepts, member access rules, usage of super key word, forms of inheritance,

method overriding, abstract classes, dynamic method dispatch, using final with inheritance, the Object

class.

UNIT-IV:

Packages and Interfaces: Defining, Creating and Accessing a Package, Understanding CLASSPATH,

importing packages, differences between classes and interfaces, defining an interface, implementing

interface, applying interfaces, variables in interface and extending interfaces.

UNIT-V:

Exception Handling and Multithreading: Concepts of Exception handling, types of exceptions, usage of

try, catch, throw, throws and finally keywords, Built-in exceptions, creating own exception sub classes,

http://www.indiastudychannel.com/resources/31735-Syllabus-JNTU-IV-Year-B-Tech-EEE-II-Semester.aspx




Concepts of Multithreading, differences between process and thread, thread life cycle,creating multiple

threads using Thread class, Runnable interface, Synchronization, thread priorities, inter thread

communication, daemon threads,deadlocks, thread groups.

UNIT-VI:

Event Handling: Events, Event sources, Event classes, Event Listeners, Delegation event model,

handling mouse and keyboard events, Adapter classes.

AWT: Concepts of components, container, panel, window, frame, canvas, Font class, Color class and

Graphics.

UNIT-VII:

AWT Controls: Buttons, Labels, Text fields, Text area, Check boxes, Check box groups, Lists, Choice,

Scrollbars, Menus, Layout Managers – Flow, Border,Grid, Card and Gridbag.

Swing – JApplet, JFrame and JComponent, Icons and Labels, Handling threading issues, text fields,

buttons – The JButton class, Check boxes, Radio buttons, Combo boxes, Tabbed Panes, Scroll Panes,

Trees, and Tables.

Applets – Concepts of Applets, differences between applets and applications

,life cycle of an applet, types of applets, creating applets, passing parameters to applets.

UNIT-VIII:Networking and Java Library: Basics of Networking, Inetaddress, TCP/IP sockets, Datagrams, URL, URL connection, String handling, java.util, java.io and java.net packages.

TEXT BOOKS:

1. The Complete Reference Java J2SE 5th Edition, Herbert Schildt, TMH Publishing Company Ltd, NewDelhi./PHI2. Big Java 2nd Edition, Cay Horstmann, John Wiley and Sons.

REFERENCE BOOKS:

1. Java How to Program, Sixth Edition, H.M.Dietel and P.J.Dietel, PearsonEducation.2. Core Java 2, Vol 1, Fundamentals, Cay.S.Horstmann and Gary Cornell,Seventh Edition, Pearson Education.3. Core Java 2, Vol 2, Advanced Features, Cay.S.Horstmann and Gary Cornell,Seventh Edition, Pearson Education.4. Beginning in Java 2, Iver Horton, Wrox Publications


1.2.5. Management Information Systems & Organizational Behaviour





Instruction: 4 Periods/week Sessional Marks: 50Univ-Exam: 3 Hrs. Univ-Exam-Marks: 100

Organizational Structure and Design – Managerial Communication and its barriers controlling – Delegation of Authority and Inter Departmental Co-ordination.

Organizational Climate and Culture – Management of Organizational Conflicts – Theories of Motivation.

Group Dynamics – Characteristics of a Leader – Leadership Styles – Analysis of Interpersonal Relations.

MIS Perspective – Information needs and its objectives – Management Information and Control Systems.

Information for Decision Making – Conceptual Foundations of Information Systems – Information Resource Management.

Suggested Books for Readings:

1. Elements of organizational behaviour, Robbins, 7th Edition, Pearson Education.2. Information Systems, Alter, Pearson Education3. Organization and Management – R.D. Agarwal4. Organization theory and Behaivour – L.M. Prasad5. Practice and Management – Peter F. Drucker6. Management Information Systems – Kanter Jerma7. Computer and Information Management – S.C. Bhatnagar and K.V. Rama Devi.


1.2.6. Object Oriented Programming Lab


Instruction: 3 Periods/week Sessional Marks: 50Univ-Exam: 3 Hrs. bg Univ-Exam-Marks: 50

List of Experiments:

OBJECT ORIENTED PROGRAMMING LABObjectives:1. To make the student learn a object oriented way of solving problems.2. To teach the student to write programs in Java to solve the problemsRecommended Systems/Software Requirements:(1) Intel based desktop PC with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100MB free disk space(2) JDK Kit. RecommendedWeek1a) Write a Java program that prints all real solutions to the quadratic equation ax2 + bx +c = 0.Read in a, b, c and use the quadratic formula. If the discriminant b2 -4ac is negative, display amessage stating that there are no real solutions.b)The Fibonacci sequence is defined by the following rule:The fist two values in the sequence are 1 and 1. Every subsequent value is the sum of the two valuespreceding it. Write a Java program that uses both recursive and nonrecursive functions to print the nth value in the Fibonacci sequence.Week 2a)Write a Java program that prompts the user for an integer and then prints out all prime numbers up tothat. integer.b)Write a Java program to multiply two given matrices.c)Write a Java Program that reads a line of integers, and then displays each integer, and the sum of all the integers (Use StringTokenizer class of java.util)Week 3a)Write a Java program that checks whether a given string is a palindrome or not.Ex: MADAM is a palindrome.b)Write a Java program for sorting a given list of names in ascending order.c)Write a Java program to make frequency count of words in a given text.Week 4a)Write a Java program that reads a file name from the user, then displays informationabout whether the file exists, whether the file is readable, whether the file is writable, the type of file andthe length of the file in bytes.b)Write a Java program that reads a file and displays the file on the screen, with a linenumber before each line.c) Write a Java program that displays the number of characters, lines and words in a text file.Week 5a)Write a Java program that:i) Implements stack ADT. ii) Converts infix expression into Postfix form iii) Evaluates the postfix expressionWeek 6a)Develop an applet that displays a simple message.b)Develop an applet that receives an integer in one text field, and computes its factorial value and returns itin another text field, when the button named “Compute” is clicked.Week 7a)Write a Java program that works as a simple calculator. Use a grid layout to arrangebuttons for the digits and for the +, -,*, % operations. Add a text field to display theresult.

http://www.indiastudychannel.com/resources/69203-OBJECT-ORIENTED-PROGRAMMING-LAB-Syllabus-Jntu.aspx







Week 8a)Write a Java program for handling mouse events.Week 9a)Write a Java program that creates three threads. First thread displays “Good Morning” every one second,the second thread displays “Hello” every two seconds and the third thread displays “Welcome” everythree seconds.b)Write a Java program that correctly implements producer consumer problem using the concept of interthread communication.Week 10a)Write a program that creates a user interface to perform integer divisions. The userenters two numbers in the textfields, Num1 and Num2. The division of Num1 andNum2 is displayed in the Result field when the Divide button is clicked. If Num1 orNum2 were not an integer, the program would throw a NumberFormatException. IfNum2 were Zero, the program would throw an ArithmeticException Display theexception in a message dialog box.Week 11a)Write a Java program that implements a simple client/server application. The clientsends data to a server. The server receives the data, uses it to produce a result, andthen sends the result back to the client. The client displays the result on the console.For ex: The data sent from the client is the radius of a circle, and the result produced by the server is thearea of the circle. (Use java.net)Week 12a)Write a java program that simulates a traffic light. The program lets the user select one of three lights :red, yellow, or green. When a radio button is selected, the light isturned on, and only one light can be on at a time No light is on when the programstarts.b)Write a Java program that allows the user to draw lines, rectangles and ovals.Week 13a)Write a java program to create an abstract class named Shape that contains an empty method namednumberOfSides ( ).Provide three classes named Trapezoid, Triangle and Hexagon such that each one of theclasses extends the class Shape. Each one of the classes contains only the method numberOfSides ( ) thatshows the number of sides in the given geometrical figures.b) Suppose that a table named Table.txt is stored in a text file. The first line in the file is the header, and theremaining lines correspond to rows in the table. The elements are seperated by commas. Write a javaprogram to display the table using JTablecomponent.TEXT BOOKS :1. Java How to Program, Sixth Edition, H.M.Dietel and P.J.Dietel, PearsonEducation/PHI2. Introduction to Java programming, Sixth edition, Y.Daniel Liang, Pearson Education3. Big Java, 2ndedition, Cay Horstmann, Wiley Student Edition, Wiley India Private Limited.




1.2.7. Advanced Data Structures LabInstruction: 3 Periods/week Sessional Marks: 50Univ-Exam: 3 Hrs. ` Univ-Exam-Marks: 100

1. Write C++ programs to implement the following using an array.

a) Stack ADT b) Queue ADT

2. Write C++ programs to implement the following using a singly linked list.

a) Stack ADT b) Queue ADT

3. Write C++ program to implement the deque (double ended queue) ADT using a doubly linked

list.

4. Write a C++ program to perform the following operations:

a) Insert an element into a binary search tree.

b) Delete an element from a binary search tree.

c) Search for a key element in a binary search tree.

5. Write a C++ program to implement circular queue ADT using an array.

6. Write C++ programs that use non-recursive functions to traverse the given binary tree in

a) Preorder b) inorder and c) postorder.

7. Write a C++ programs for the implementation of bfs and dfs for a given graph.

8. Write C++ programs for implementing the following sorting methods:

a) Quick sort b) Merge sort c) Heap sort

9. Write a C++ program to perform the following operations

a) Insertion into a B-tree b) Deletion from a B-tree

10. Write a C++ program to perform the following operations

a) Insertion into an AVL-tree b) Deletion from an AVL-tree

11. Write a C++ program to implement Kruskal's algorithm to generate a minimum spanning

tree.

12. Write a C++ program to implement Prim's algorithm to generate a minimum spanning tree.



M.C.A. – II Semester Syllabus1.2.8. Operating Systems Lab

Instruction: 3 Periods/week Sessional Marks: 50Univ-Exam: 3 Hrs. ` Univ-Exam-Marks: 50

1. Simulate the Round Robin CPU Scheduling algorithm2. Simulate the SJF CPU Scheduling algorithm3. Simulate the FCFS Scheduling algorithm4. Simulate Sequential file allocation strategy5. Simulate Indexed file allocation strategy6. Simulate Linked file allocation strategy7. Simulate MVT 8. Simulate MFT9. Simulate Single Level Directory file organization technique10. Simulate Two Level file organization technique11. Simulate Hierarchical file organization technique12. Simulate DAG file organization technique13. Simulate bankers algorithm for Deadlock Avoidance14. Simulate bankers algorithm for Deadlock Prevention15. Simulate FIFO page replacement algorithm16. Simulate LRU page replacement algorithm

Adikavi Nannaya University, RajahmundryMCA II Year - Semester-III Syllabus2.1.1. Automata and Compiler Design



Formal Language and Regular Expressions : Languages, Definition Languages regular expressions, Finite Automata – DFA, NFA. Conversion of regular expression to NFA, NFA to DFA. Applications of Finite Automata to lexical analysis, lex tools.

Context Free grammars and parsing : Context free grammars, derivation, parse trees, ambiguity LL(K) grammars and LL(1) parsing

Bottom up parsing handle pruning LR Grammar Parsing, LALR parsing, parsing ambiguous grammars, YACC programming specification.

Semantics : Syntax directed translation, S-attributed and L-attributed grammars, Intermediate code – abstract syntax tree, translation of simple statements and control flow statements.

Context Sensitive features – Chomsky hierarchy of languages and recognizers. Type checking, type conversions, equivalence of type expressions, overloading of functions and operations.

Code optimization : Principal sources of optimization, optimization of basic blocks, peephole optimization, flow graphs, Data flow analysis of flow graphs.

Code generation : Machine dependent code generation, object code forms, generic code generation algorithm, Register allocation and assignment. Using DAG representation of Block.

TEXT BOOKS :1. Introduction to Theory of computation.Sipser,2nd Edition,Thomson.2. Compilers Principles, Techniques and Tools Aho, Ullman, Ravisethi, Pearson Education.

REFERENCES :1. Modern Compiler Construction in C , Andrew W.Appel Cambridge University Press.2. Compiler Construction, LOUDEN, Thomson

The Theory of Automata: Definition and description, Transition systems, properties, Acceptability of string, NDFA, Equivalence in between DFA & NDFA. Grammars, Types of Grammars, Grammars and Automata, Regular expressions, Finite Automata and Regular expressions, Regular sets and Regular Grammars.

Overall view of Compilers: Brief discussion on various phases of Compilers.


Design of lexical analyzer.

Design of Parsers: Shift Reduce parser, Operator Precedence Parser, Predictive Parser, LR parser, SLR parser. LALR parser.

Syntax Directed Translation: Syntax directed translation and implementation, Intermediate code, Postfix notation, parsing tree, Three address Code, Quadruples, Triples.

Intermediate Code Optimization: The principle sources of optimization, Loop Optimization, DAG, Global data flow analysis.

Code Generation: Problems, Machine model, A simple code generator, Register allocation and assignment, Code generation from DAG, Peep hole optimization.

Brief discussion on symbol tables, Run-time storage administration.

chapters: 1,2,3,4,5,6,7,9,10,11,12,15 of the text book.

Text Book

Principles of Compiler Design by Aho, D. Ullman

Reference Books:

Compiler Construction by Kenneth. C. Louden, Vikas Pub. House.

THEORY OF COMPUTATION

1. INTRODUCTION TO FINITE AUTOMATA: (6 Periods)Alphabets and languages- Finite Representation of Languages. Deterministic Finite Automata – Non- deterministic Finite Automata – Equivalence of Deterministic and Non-Finite Automata – Properties of the Languages Accepted by Finite Automata – Finite Automata and Regular Expressions – Proofs those Languages Are and Are Not Regular.

2. CONTEXT FREE LANGUAGES: (9 Periods)Context –Free Grammar – Regular Languages and Context-Free Grammar – Pushdown Automata – Pushdown Automata and Context-Free Grammar – Properties of Context-Free Languages – Closure Properties – Periodicity Properties – Determinism and Parsing – Deterministic Pushdown Automata and Context – Free Languages – Top- down Parsing – Bottom – Up parsing.

3. TURING MACHINES: (5 Periods)The Definition of Turing Machine – Computing with Turing Machines – Combining Turing Machines – some Examples of More Powerful Turing Machines.

4. CHURCH’ THESIS: (6 Periods)Church’s Thesis – The Primitive Recursive functions – Godelization – The μ-Recursive Functions – Turing – Computability of the μ-Recursive functions – Universal Turing Machines.


5. UNCOMPUTABILITY: (6 Periods)The Halting Problem – Turing-Enumerability, Turing – Acceptability, and Turing - Decidability – Unsolved problems about Turing machines and μ-Recursive Functions- Post’s correspondence problem.

6. COMPUTATIONAL COMPLEXITY: (6 Periods)Time-bounded Turing Machines – Rate of Growth of functions – Time-Bounded simulations – The Classes P and NP – NP-Completeness – Some NP-complete Problems – Integer Programming – The Traveling Salesman Problem.

7. THE PREPOSITIONAL CALCULUS (5 Periods)Introduction – Syntax of the Prepositional Calculus – Truth-Assignments – Validity and Satisfiability – Equivalence and Normal Forms – resolution in Prepositional Calculus.

8 THE PREDICATE CALCULUS: (5 Periods)Syntax of the Predicate Calculate Calculus – Structures and Satisfiability – Equivalence – Unsolvability and NP-Completeness- Resolution in the Predicate Calculus.

TEXT BOOK: Harry R Lewis, CHRISTOS H. PAPADIMITRIOU, : ELEMETS OF THE THEORY OF COMPUTATION", Prentice-Hall of India Private Limited, New

REFERENCE: HOPCROFT. J.E and J.D.ULLMAN. Introduction to Automata Theory, Languages, and Computation

Adikavi Nannaya University, RajahmundryMCA II Year - Semester-III Syllabus

2.1.2. Software Engineering


1. Introduction : Software Engineering Challenges, The Software Engineering Approach. Software Process: Software Process, Characteristics of Software Process, Software Development Process Models.


2. Software Requirements Analysis and Specification: Software Requirements, Problem Analysis, Requirement Specification

3. Planning a Software project: Process Planning, Effort Estimation, project Scheduling and Staffing, Quality Plan, Risk Management

4. Function-Oriented Design: Design Principles, Module Level Concetps, Structured Design Methodology

5. Object Oriented Design: OO Analysis and OO Design, OO Concepts, Design Concepts, UML, A Design Methodology, Metrics

6. Detailed Design: Detailed Design and PDL, Verification, Metrics7. Coding: Coding Process, Verification, Metrics8. Testing: Testing Fundamentals, Black-Box Testing, White Box Testing, Testing Process,

Defect Analysis and Prevention

Text Book: An Integrated Approach to Software Engineering, Third Edition by Pankaj Jalota

Adikavi Nannaya University, RajahmundryMCA II Year - Semester-III Syllabus2.1.3. Database Management Systems


1. Database Systems Concepts and Architecture: Introduction, data models, schemas and instance; three-schema architecture and data independence; database language and interface, the


database system environment; centralized and client/server architecture of DBMSs; classification of DBMSs.

2. Data Modeling Using the E-R Model: High-level conceptual data models for database design; Entity types, entity sets, attributes and keys; relationship types, relationship sets, roles and structural constraint; weak entity types, ER diagrams, naming conventions and design issues; Notation for UML class diagrams.

3. Enhanced ER and UML Modeling: Subclasses, super classes and inheritance; specialization and generalization; constraints and characteristics of specialization and generalization, modeling of union types using categories; representing specialization/generalization and inheritance in UML class diagrams; relationship types of degree higher than two; data abstraction, knowledge representation and ontology concepts.

4. The Relational Data Model and Relational Database Constraints: Relational model concepts, relational model constraints and relational database schemas; updating operations and dealing with constraints violations.

5. The Relational Algebra and Relational Calculus: Unary relational operations: SELECT and PROJECT; relational algebra operations from set theory; binary relational calculus; the domain relational calculus.

6. Relational Database Design by ER and EER-to-Relational Mapping: Relational database design using ER-to-Relational mapping; mapping EER model constructs to relations.

7. Functional Dependencies and Normalization for Relational Databases: Informal design guidelines for relational schemas; functional dependencies; normal forms based on primary leys; general definitions of 2nd and 3rd normal forms; Boyce-Codd normal forms.

8. Transaction Processing Concepts: Introduction to transaction processing; transaction and system concepts; desirable properties of transaction; characteristics schedule based on recoverability; characteristics schedule based on serializability.

9. Concurrency Control Techniques: Two phase locking techniques for concurrency control; concurrency control based on timestamp ordering; multi-version concurrency control techniques; validation (optimistic) concurrency control techniques; granularity locking.

10. Database Recovery Techniques: Recovery concepts; recovery techniques based on deferred updates; recovery techniques based on immediate updata; shadow paging; the ARIES recovery algorithm.Text Book:


Fundamentals of Database Systems Ramez Elmasri and Shamkant B. Navathe, 4th Edition, Pearson Education.

Reference:

Database Concepts, Abraham Silberschatz, Henry F. Korth, S. Sudarshan, McGraw-Hill


2.1.4. Design and Analysis of Algorithms



1. Introduction: Notion of Algorithm – Algorithmic Problem solving 2. Analysis of Algorithm Efficiency: Analysis framework – Asymptotic notations – Analysis of Non recursive and recursive algorithms.3. Divide and Conquer: Merge sort – Quick Sort – Binary search – Large integer Multiplication and Strassens Matrix multiplication-closest pair and convex Hull problems 4. Decrease and conquer: DFS and BFS, Topological sorting, Decrease – by – a – Constant – factor Algorithms, variable – size – Decrease Algorithms.5. Transform and conquer: Horner’s Rule and Binary Exponentiation – Problem Reduction6. Space and Time Tradeoffs: Input Enhancement in String Matching.7. Dynamic Programming: Warshalls and Floyd’s Algorithm – Optional Binary Search Trees – knapsack Problem.8. Greedy Technique: Prim’s and kruskal’s Algorthms, Dijkstra’s Algorithm, Huffman Trees.9. Limitations of Algorithm Power: Lower Bound Arguments – Decision Trees – P.N.P. and NP Complete Problems.10. Coping with limitations of Algorithmic Power: Backtracking, Branch and Bound, Approximation Algorthms for NP – hard problems.

Text Book:Introduction to the design and analysis of Algorthms, Anany Levitin: Pearson Education, 2003.Reference Books:

1. Fundamentals of Computer Algorthms, Horowitz and Sahni, Galgothia publications.2. Introduction to Algroithms, Cormen, Leiserson and Rivest: Prentice a Hall of India.

UNIT I :Introduction: Algorithm,Psuedo code for expressing algorithms,Performance Analysis-Space complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little oh notation,Probabilistic analysis, Amortized analysis.

UNIT II :Disjoint Sets- disjoint set operations, union and find algorithms, spanning trees, connected components and biconnected components.

UNIT III :Divide and conquer: General method , applications-Binary search, Quick sort, Merge sort, Strassen’s matrix multiplication.

UNIT IV :Greedy method: General method, applications-Job sequencing with dead lines, 0/1 knapsack problem, Minimum cost spanning trees, Single source shortest path problem.

UNIT V :Dynamic Programming: General method, applications-Matrix chain multiplication, Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem,Travelling sales person problem, Reliability design.

http://www.indiastudychannel.com/resources/31486-JNTU-III-Year-B-Tech-CSE-I-Semester-syllabus.aspx


UNIT VI :Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles.

UNIT VII :Branch and Bound: General method, applications - Travelling sales person problem,0/1 knapsack problem- LC Branch and Bound solution, FIFO Branch and Bound solution.

UNIT VIII :NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP - Hard and NPComplete classes, Cook’s theorem.

TEXT BOOKS :1. Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj Sahni and Rajasekharam,Galgotia publications pvt. Ltd.2. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and R.Tomassia,John wiley and sons.

REFERENCES :1. Introduction to Algorithms, secondedition,T.H.Cormen,C.E.Leiserson, R.L.Rivest,and C.Stein,PHI Pvt. Ltd./ Pearson Education2. Introduction to Design and Analysis of Algorithms A strategic approach, R.C.T.Lee, S.S.Tseng, R.C.Chang and T.Tsai, Mc Graw Hill.3. Data structures and Algorithm Analysis in C++, Allen Weiss, Second edition, Pearson education.


2.1.5. Unix Programming


Unix Utilities-Introduction to Unix file system, vi editor, file handling utilities, securityby file permissions, process utilities, disk utilities, networking commands, cp, mv, ln, rm, unlink, mkdir, rmdir, du, df, mount, umount, find, unmask, ulimit, ps, who, w, finger, arp, ftp, telnet, rlogin, text processing utilities and backup utilities, detailed commands to be covered are cat, tail, head, sort, nl, uniq, grep, egrep, fgrep, cut, paste, join, tee, pg,comm, cmp, diff, tr, awk, tar, cpio.




Problem solving approaches in Unix: Using single commands, using compoundCommands, shell scripts, C programs, building own command library of programs.Working with the Bourne shell: what is a shell, shell responsibilities, pipes and inputRedirection, output redirection, here documents, the shell as a programming language,shell meta characters, shell variables, shell commands, the environment, controlstructures, shell script examples.

Unix Files: Unix file structure, directories, files and devices, System calls, libraryfunctions, low level file access, usage of open, creat, read, write, close, lseek, stat, fstat, octl, umask, dup, dup2. The standard I/O (fopen, fclose, fflush, fseek, fgetc, getc, getchar, fputc, putc,putchar,fgets, gets ), formatted I/O, stream errors, streams and file descriptors, file and directory maintenance (chmod, chown, unlink, link, symlink, mkdir, rmdir, chdir, getcwd),Directory handling system calls (opendir, readdir, closedir,rewinddir, seekdir, telldir)

Unix Process and Signals: What is process, process structure, starting new process, waiting for a process, zombie process, process control, process identifiers, system callinterface for process management-fork, vfork, exit, wait, waitpid, exec, system,Signals- Signal functions, unreliable signals, interrupted system calls, kill and raisefunctions, alarm, pause functions, abort, sleep functions.

Interprocess Communication Overview: Introduction to IPC,IPC between processes on a single computer system, IPC between processes on different systems, file and recordlocking, other unix locking techniques, pipes, FIFOs, streams and messages, namespaces, introduction to three types of IPC(system-V)-message queues, semaphores and sharedmemory.

TEXT BOOKS:

1. Unix Network Programming, W.R.Stevens Pearson/PHI. 2. Unix Concepts and Applications, 3rd Edition, Sumitabha Das, TMH.3. Advanced Unix Programming, 2nd Edition, M.J.Rochkind, Pearson Education.

REFERENCE BOOKS:

1. Unix system programming using C++, T.Chan, PHI. 2. Unix for programmers and users, 3rd Edition, Graham Glass, King Ables, Pearson Education. 3. Unix System-V Network Programming, Stephen A.Rago, Pearson Education. 4. Unix programming environment, Kernighan and Pike, PHI. / Pearson Education


1. Introduction & File System (9)

Overview of UNIX OS - File I/O – File Descriptors – File sharing - Files and directories – File types - File access permissions – File systems – Symbolic links - Standard I/O library – Streams and file objects – Buffering - System data files and information - Password file – Group file – Login accounting – system identification.

2. Processes (9)

Environment of a UNIX process – Process termination – command line arguments - Process control – Process identifiers - Process relationships terminal logins – Signals -threads.

3. Interprocess Communication (9)

Introduction - Message passing (SVR4)- pipes – FIFO – message queues - Synchronization (SVR4) – Mutexes – condition variables – read – write locks – file locking – record locking – semaphores –Shared memory(SVR4).

4. Sockets (9)

Introduction – transport layer – socket introduction - TCP sockets – UDP sockets - raw sockets – Socket options - I/O multiplexing - Name and address conversions.

5. APPLICATIONS (9)

Debugging techniques - TCP echo client server - UDP echo client server - Ping - Trace route - Client server applications like file transfer and chat.

Total No of periods: 45

Text Books

1. W.Richard Stevens, Advanced programming in the UNIX environment, Addison Wesley, 1999.(Unit 1,2 & 3)

2. W. Stevens, Bill Fenner, Andrew Rudoff, "Unix Network Programming", Volume 1,The Sockets Networking API,3rd Edition, Pearson education, Nov 2003.(unit 4 & 5)

Reference Books

1. Meeta Gandhi,Tilak Shetty and Rajiv Shah – The ‘C’ Odyssey Unix –The open Boundless C ,1st Edition ,BPB Publications 1992.



2.1.6. Unix Programming Lab


1.Write a shell script tp generate a multiplication table.

2.Write a shell script that copies multiple files to a directory.

3.Write a shell script that counts the number of lines and words present in a given file.

4.Write a shell script that displays the list of all files in the given directory.


5.Write a shell script (small calculator) that adds, subtracts, multiplies and divides the given two integers. There are two division options: one returns the quotient and the other returns reminder. The script requires 3 arguments: The operation to be used and two integer numbers. The options are add (-a), subtract (-s), multiply (-m), quotient (-c) and reminder (-r).

6.Write a shell script to reverse the rows and columns of a matrix.

7.Write a C program that counts the number of blanks in a text file. Using standard I/O Using system calls.

8.Implement in C the following Unix commands using system calls. a) cat b) ls mv

10.Write a C program that illustrates uses of the mkdir, opendir, readdir, closedir, and rmdir APIs.

11.Write a C program that illustrates how to execute two commands concurrently with a command pipe. 12.Write a C program that illustrates the creation of child process using fork system call.

Suggested textbooks for lab:

1. 1. Advanced Unix Programming, N.B.Venkateswarulu, BS Publications. 2. 2. Unix and Shell programming, B.A.Forouzan and R.F.Gilberg, Thomson.


2.1.7. DataBase Management Systems Lab


Course Description: This course explores database programming using both native and embedded ANSI-standard structured Query Language (SQL). Topics include enterprise database management systems, database middleware, data definition language, data manipulation language, data control language, database queries reporting, query optimization, and database views, Student assignments include database creation, query design and programming and database manipulation via embedded SQL calls from a programming language.

Course Goal: Successful graduates of this course should be able to :


Understand the fundamentals of a relational database Understand the fundamentals of client-server and multi-tiered applications Understand the use of Structured Query Language (SQL) as a data definition language,

data manipulation language, and data control language. Understand and write SQL/PL_SQL queries to create, report, and updata data in a

relational database. Understand the purpose of and be able to create views, scripts, triggers, and transactions Understand and be able to implement the fundamentals of security and permissions tin

SQL Server. Design entity relationship models for a business problem and develop a normalized

database structure. Using Oracle under Windows platform and My SQL under Linux/Unix platform.

Reference Books:

1. Introduction to Relational Databases and SQL Programming, Christopher Allen, Simon Chatwin, Catherine A. Vreary Tata McGraw-Hill.2. Oracle SQL and PL/SQL Hand book, John Adolph Palinski, Pearson Education.3. Oracle 9i PL/SQL Programming, Scott Urman, tata McGraw-Hill 4. My SQL: The Complete Reference, Vikram Vaswani, Tata Mcgraw-Hill5. My SQL Bible, Steve Suehring, Wiley

Adikavi Nannaya University, RajahmundryMCA II Year - Semester-IV Syllabus

2.2.1. Computer Networks


LOCAL AREA NETWORKS:Topology, Transmission Media, Medium Access Control Methods, CSMA/CD Bus, Token Ring, Token Bus, Performance, Wireless LANs, Wireless Media, Protocols, MAC Sub Layer Services, LLC Sub Layer, Network Layer, Bridges, Transparent Bridges, Source Routing Bridges, Internetworking With different Types.

WIDE ARE NETWORKS:Characteristics of Public Data Networks, Circuit And Packet Switching, Data Grams And Virtual Circuits, Packet Switched Data Networks, Physical Layer, Link Layer, Network Layer, ISDN,


User Interfaces, Network Access Points, Channel Types, User Network Interface, User Interface Protocols, Signaling Protocols, Frame Relay Services.

INTERNETWORKING:Internetworking Architecture, Internetworking Issues, Internet IP, Address Structure, Data Grams, Fragmentation And Reassembly, Routing, Internet Control Message Protocol, IPv6, Data Gram Structure, Multicast Support.

TRANSPORT PROTOCOL:User Data Gram Protocol, TCP, Reliable Stream Service, Protocol Operations.

APPLICATION SUPPORT PROTOCOL:Session Layer, Token Concept, Presentation Layer, Data Encryption, Terminology, Basic Techniques, DES, RSA, Message Authentication.

TCP/IP APPLICATION PROTOCOLS:Establishing Transport Connection, TEKENET, FTP, SMTP, SNMP Worldwide Web (From A.S. Tannenbaum ), Directory Services, Domain Name System.

Text Book: Fred Halsall, Data Communications, Computer Networks And Open Systems, Fourth Edition, Addison Wesley [Pearson Education 2000].


2.2.2. Artificial Intelligence


Introduction to AI

Roots and Scope of AI, Definition, Turing Test, Application Areas of AI

AI as Representation and Search

Predicate CalculusStructures and Strategies for State Space SearchHeuristic SearchControl and Implementation of State Space Search


Representation and Inference

Knowledge RepresentationStrong Methods for Problem SolvingReasoning in Uncertain Situations

Machine Learning

Symbol-Based: Framework for Symbol – Based Learning, Version Space Search, ID3 Algorithm, Un-supervised learning, Reinforcement LearningConnectionist: Perceptron Learning, Backpropagation Learning, Competitive Learning, Hebbian Coincidence Learning, Attractor Networks

Advanced Topics of AI Problem Solving

Automated Reasoning: Weak Methods in Theorem Proving, GPS and Difference Table, Resolution for Theorem Proving, Automated reasoning with PROLOGUnderstanding Natural Language: Role of Knowledge, Symbolic Analysis, Syntax, ATN Parsers, Stochastic Tools for Language Analysis, Natural Language Applications

Text Book:

"Artificial Intelligence – Structures and Strategies for Complex Problem Solving", George F. Luger, 4th Edition, Pearson Education , 2003.

Reference Books:

"Artificial Intelligence", Knight, Tata McGraw Hill"Artificial Intelligence ‘a Modern Approach" Russell & Norvig, second edition, Pearson Education, 2003.

UNIT - IIntroduction : AI problems, foundation of AI and history of AI intelligent agents: Agents and Environments,the concept of rationality, the nature of environments, structure of agents, problem solving agents, problemformulation.

UNIT - IISearching : Searching for solutions, uniformed search strategies – Breadth first search, depth first Search. Search with partial information (Heuristic search) Greedy best first search, A* search Game Playing: Adversial search, Games, minimax, algorithm, optimal decisions in multiplayer games, Alpha-Beta pruning, Evaluation functions, cutting of search.

UNIT - IIIKnowledge Representation & Reasons logical Agents, Knowledge – Based Agents, the Wumpus world, logic, propositional logic, Resolution patterns in propos ional logic, Resolution, Forward & Backward. Chaining.

UNIT - IVFirst order logic. Inference in first order logic, propositional Vs. first order inference, unification & lifts forward chaining, Backward chaining, Resolution.


UNIT - VCharacteristics of Neural Networks, Historical Development of Neural Networks Principles, Artificial Neural Networks: Terminology, Models of Neuron, Topology, Basic Learning Laws, Pattern Recognition Problem, Basic Functional Units, Pattern Recognition Tasks by the Functional Units.

UNIT - VIFeedforward Neural Networks:Introduction, Analysis of pattern Association Networks, Analysis of Pattern Classification Networks, Analysis of pattern storage Networks. Analysis of Pattern Mapping Networks.

UNIT - VIIFeedback Neural Networks Introduction, Analysis of Linear Autoassociative FF Networks, Analysis of Pattern Storage Networks.

UNIT - VIIICompetitive Learning Neural Networks & Complex pattern RecognitionIntroduction, Analysis of Pattern Clustering Networks, Analysis of Feature Mapping Networks, Associative Memory.

TEXT BOOKS :1. Artificial Intelligence – A Modern Approach. Second Edition, Stuart Russel, Peter Norvig, PHI/ Pearson Education.2. Artificial Neural Networks B. Yagna Narayana, PHIREFERENCES :1. Artificial Intelligence , 2nd Edition, E.Rich and K.Knight (TMH).2. Artificial Intelligence and Expert Systems – Patterson PHI.3. Expert Systems: Principles and Programming- Fourth Edn, Giarrantana/ Riley, Thomson.4. PROLOG Programming for Artificial Intelligence. Ivan Bratka- Third Edition – Pearson Education.5.Neural Networks Simon Haykin PHI6. Artificial Intelligence, 3rd Edition, Patrick Henry Winston., Pearson Edition.


2.2.3. OOAD with UML


Introduction to UML: Importance of modeling, principles of modeling, object orientedmodeling, conceptual model of the UML, Architecture, Software Development LifeCycle.

Basic Structural Modeling: Classes, Relationships, common Mechanisms, anddiagrams.

Advanced Structural Modeling: Advanced classes, advanced relationships, Interfaces,Types and Roles, Packages.

http://www.indiastudychannel.com/resources/31493-JNTU-III-Year-B-Tech-CSE-II-Semester-syllabus.aspx


Class & Object Diagrams: Terms, concepts, modeling techniques for Class & ObjectDiagrams.

Basic Behavioral Modeling-I: Interactions, Interaction diagrams. Basic Behavioral Modeling-II: Use cases, Use case Diagrams, Activity Diagrams.

Advanced Behavioral Modeling: Events and signals, state machines, processes and Threads, time and space, state chart diagrams.

Architectural Modeling: Component, Deployment, Component diagrams and Deployment diagrams. 1. Grady Booch, James Rumbaugh, Ivar Jacobson : The Unified Modeling Language User Guide, Pearson Education. 2. Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado: UML 2 Toolkit, WILEY-Dreamtech India Pvt. Ltd.

REFERENCE BOOKS:

1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education. 2. Pascal Roques: Modeling Software Systems Using UML2, WILEY-Dreamtech India Pvt. Ltd. 3. Atul Kahate: Object Oriented Analysis & Design, The McGraw-Hill Companies. 4. Mark Priestley: Practical Object-Oriented Design with UML,TATA McGrawHill 5. Appling UML and Patterns: An introduction to Object – Oriented Analysis and Design

and Unified Process, Craig Larman, Pearson Education.


2.2.4. Data Warehousing and Data Mining


Introduction: Fundamentals of data mining, Data Mining Functionalities, Classificationof Data Mining systems, Major issues in Data Mining, Data Warehouse and OLAPTechnology for Data Mining Data Warehouse, Multidimensional Data Model, DataWarehouse Architecture, Data Warehouse Implementation, Further Development of Data Cube Technology, From Data Warehousing to Data Mining

Data Preprocessing: Needs Preprocessing the Data, Data Cleaning, Data Integration and Transformation, Data Reduction, Discretization and Concept Hierarchy Generation, Online Data Storage.


Data Mining Primitives, Languages, and System Architectures: Data MiningPrimitives, Data Mining Query Languages, Designing Graphical User Interfaces Basedon a Data Mining Query Language Architectures of Data Mining Systems

Concepts Description: Characterization and Comparison: Data Generalization andSummarization-Based Characterization, Analytical Characterization: Analysis ofAttribute Relevance, Mining Class Comparisons: Discriminating between DifferentClasses, Mining Descriptive Statistical Measures in Large Databases.

Mining Association Rules in Large Databases: Association Rule Mining, MiningSingle-Dimensional Boolean Association Rules from Transactional Databases, MiningMultilevel Association Rules from Transaction Databases, Mining MultidimensionalAssociation Rules from Relational Databases and Data Warehouses, From AssociationMining to Correlation Analysis, Constraint-Based Association Mining.

Classification and Prediction: Issues Regarding Classification and Prediction,Classification by Decision Tree Induction, Bayesian Classification, Classification byBack propagation, Classification Based on Concepts from Association Rule Mining,Other Classification Methods, Prediction, Classifier Accuracy.

Cluster Analysis Introduction :Types of Data in Cluster Analysis, A Categorization of Major Clustering Methods, Partitioning Methods, Density-Based Methods, Grid-Based Methods, Model-Based Clustering Methods, Outlier Analysis.

TEXT BOOKS: 1. Data Mining – Concepts and Techniques - JIAWEI HAN & MICHELINE KAMBER Harcourt India. 2. Data Mining Techniques – ARUN K PUJARI, University Press 3. Building the DataWarehouse- W. H. Inmon, Wiley Dreamtech India Pvt. Ltd..

REFERENCE BOOKS: 1. Data Warehousing in the Real World – SAM ANAHORY & DENNIS MURRAY. Pearson Edn Asia. 2. Data Warehousing Fundamentals – PAULRAJ PONNAIAH WILEY STUDENT EDITION 3. The Data Warehouse Life cycle Tool kit – RALPH KIMBALL WILEY STUDENT EDITION 4. Data Mining Introductory and advanced topics –MARGARET H DUNHAM, PEARSON EDUCATION



MCA II Year - Semester-IV Syllabus2.2.5. Distributed Systems(Elective I)


Introduction to Distributed Systems:Distributed systems : Goals Hardware Concepts Software - design

Communication distributed systems:Layered Protocol: ATM Networks client server model - remote procedure call - group communication.

Synchronization:Clock synchronization - mutual exclusion - election atomic transactions - dead locks.

Process and Processors:Threads - System models processor allocation - scheduling fault tolerance - real time distributed systems.

Distributed file systems:File system design and implementation - trends in distributed file systems.

Shared Memory:Introduction - bus based multi processors ring based multiprocessors switched multiprocessors - NUMA comparison of shared memory systems -

consistency models - page based distributed shared memory - shared variable distributed shared memory - object based distributed shared memory.

Text Book: 1. Andrew S.Tanenbaum: Distributed Operating System, Prentice Hall International Inc. 1995.


2. 2.5. Elective I - A.I. & Neural NetworksInstruction: 3 Periods/week Sessional Marks: 50Univ-Exam : 3 Hours Univ-Exam-Marks: 100


1.Problems and Search: What is Artificial Intelligence. AI Problems, The Underlying Assumption, What is an AI Technique, The Level of the Model, Criteria for Success, Some General References, One Final Word.

2. Problems, Problem Spaces, and Search: Defining the Problem as a State Space Search, Production systems, Problem Characteristics, Production System Characteristics, Issues in the design of Search Programs, Additional Problems.

3. Heuristic Search Techniques: Knowledge Representation Issues, Representations and Mappings, Approaches to knowledge Representation, Issues in Knowledge Representation, The Frame Problem.

4. Knowledge Representation: Knowledge Representation Issues, Representations and Mappings, Approaches to knowledge Representation, Issues in Knowledge Representation, The Frame Problem.

5. Introduction to Neural Networks: Neural Processing, Neural Networks Overview, The Rise of Neurocomputing, MATLAB Overview.

6. Introduction to Artificial Neural Networks: Introduction, Artificial Neural Networks, Historical Development of Neural Networks, Biological Neural Networks, Comparison Between the Brain and the Computer, Comparison Between the Artificial and Biological Neural Network, Basic Building Blocks of Artificial Neural Networks – Network Architecture, Setting the Weights, Activation Function , Artificial Neural Network Terminologies – Weights, Activation Functions, Sigmoidal Functions, Calculation of Net Input Using Matrix Multiplication Method, Bias, Threshold.

7. Fundamental Models of Artificial Neural Networks: Introduction, McCulloch-Pitts Neuron Model – McCulloch-Pitts Neuron Model, Learning Rules – Hebbian Learning Rule, Perception Learning Rule, Perception Learning Rule, Delta Learning Rule,Competitive Learning Rule,Out star Learning Rule, Boltzmann Learning, Memory Based Learning. Hebb Net—Architecture, Algorithm,Linear Separability.

8. Perception Networks :Introduction, single Layer Perception—Architecture, algorithm, Application Procedure, Perception Algorithm for several Output Classes., Brief Introduction to Multilayer Perception Networks.

9. Adaline and Madaline Networks : Introduction, Adaline—Architecture, Algorithm,Application Algorithm. Madaline-Architecture, MRI Algorithm, MRII Algorithm..


10. Feedback Networks : Introduction, discrete Hopfield Net—Architecture, Training Algorithm, Application Algorithm, analysis., Continuous Hopfield Net, Relation Between BAM and Hopfield Nets.

11. Feed Forward Networks: Introduction, Back Propagation Network(BPN), Generalized Delta Learning rule, architecture, Training Algorithm, Selection of Parameters,Learning in Back Propagation, Application Algorithm, Local Minima and Global Minima, merits and demerits of Back Propogation network, applications.,Radial Basics Function Network- Architecture,training algorithm for an RBFN with Fixed Centers.

Text Book: Introduction to NEUTRAL NETWORKS using MATLAb 6.0 — S N SIVANANDAM, S SUMATHI, S N DEEPA.

Reference Books:1. Introduction to Artificial Intelligence, Rajendra Akerkar, PHI, 20052. Artificial Intelligence – A Modern Approach, Stuart Russell, Peter Norvig, Second

Edition, PHI, 20083. Artificial Neural Networks – An Introduction, Kevin L. Priddy, Paul E. Keller, PHI, 2007

II SYLLABUS1. Introduction to AI : AI problems, Underlying assumptions, What is an AI technique? Criteria for success, Problem spaces, Search, State space representation of several problems.

2. Heuristic Search Techniques : Generate and test, Hill climbing, Breadth first search Problem reduction, Constraint satisfaction, Means-ends analysis, Dependency directed backtracking.

3. Knowledge Representation Issues and Representation using Predicate Logic: Declarative Vs Procedural knowledge, representation and mappings, knowledge representation issues, predicate logic vocabulary, Representing simple facts in logic, Computable functions and predicates, Conversion of WFFs to clause form, Resolution, Matching-Unification algorithm.

4. Representing Knowledge using Rules : Logic programming Forward Vs Backward reasoning, Matching-RETE matching algorithm, approximate matching,. Symbolic reasoning under uncertainty-Introduction to non-monotonic reasoning. Logic for non-monotonic reasoning. Statistical reasoning-Certainty factors, Bayesian networks, Dempster-shafer theory, Fuzzy logic.

5. Knowledge Representation using Slot and Filler Structures : Frame problem semantic nets, Frames-property inheritance, multiple Inheritance tangled hierarchies, CD representation and Scripts.


6. PROLOG : Facts, Rules, Control Predicates, Recursion in PROLOG,

Text Books & References

1. Artificial Intelligence - Elaine Rich & - Kevin Knight (TMH)2. Introduction to Turbo PROLOG Carl Towsrehd (BPB)3. Artificial Intelligence & Expert Systems Dan W.Patterson (PHI)


2. 2.5. Elective I – Soft ComputingInstruction: 3 Periods/week Sessional Marks: 50Univ-Exam : 3 Hours Univ-Exam-Marks: 100

FUZZY SET THEORY Introduction to Neuro – Fuzzy and Soft Computing – Fuzzy Sets – Basic Definition and Terminology – Set-theoretic Operations – Member Function Formulation and Parameterization – Fuzzy Rules and Fuzzy Reasoning – Extension Principle and Fuzzy Relations – Fuzzy If-Then Rules – Fuzzy Reasoning – Fuzzy Inference Systems – Mamdani Fuzzy Models – Sugeno Fuzzy Models – Tsukamoto Fuzzy Models – Input Space Partitioning and Fuzzy Modeling. OPTIMIZATION Derivative-based Optimization – Descent Methods – The Method of Steepest Descent – Classical Newton’s Method – Step Size Determination – Derivative-free Optimization – Genetic Algorithms – Simulated Annealing – Random Search – Downhill Simplex Search. NEURAL NETWORKS Supervised Learning Neural Networks – Perceptrons - Adaline – Backpropagation Mutilayer Perceptrons – Radial Basis Function Networks – Unsupervised Learning Neural Networks – Competitive Learning Networks – Kohonen Self-Organizing Networks – Learning Vector Quantization – Hebbian Learning. NEURO FUZZY MODELINGAdaptive Neuro-Fuzzy Inference Systems – Architecture – Hybrid Learning Algorithm – Learning Methods that Cross-fertilize ANFIS and RBFN – Coactive Neuro Fuzzy Modeling – Framework Neuron Functions for Adaptive Networks – Neuro Fuzzy Spectrum. APPLICATIONS OF COMPUTATIONAL INTELLIGENCEPrinted Character Recognition – Inverse Kinematics Problems – Automobile Fuel Efficiency Prediction – Soft Computing for Color Recipe Prediction.

TEXT BOOK1. J.S.R.Jang, C.T.Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI, 2004, Pearson Education 2004.REFERENCES1. Timothy J.Ross, “Fuzzy Logic with Engineering Applications”, McGraw-Hill, 1997.


2. Davis E.Goldberg, “Genetic Algorithms: Search, Optimization and Machine Learning”, Addison Wesley, N.Y., 1989.3. S. Rajasekaran and G.A.V.Pai, “Neural Networks, Fuzzy Logic and Genetic Algorithms”, PHI, 2003.4. R.Eberhart, P.Simpson and R.Dobbins, “Computational Intelligence - PC Tools”, AP Professional, Boston, 1996.

ADVANCED COMPUTING CONCEPTS(ELECTIVE - II)

UNIT IGrid Computing : Data & Computational Grids, Grid Architectures and its relations to various Distributed Technologies

UNIT IIAutonomic Computing, Examples of the Grid Computing Efforts (IBM).

UNIT IIICluster setup & its Advantages, Performance Models & Simulations; Networking Protocols & I/O, Messaging systems.

UNIT IVProcess scheduling, Load sharing and Balancing; Distributed shared memory, parallel I/O .

UNIT - VExample cluster System - Beowlf; Cluster Operating systems: COMPaS and NanOS

UNIT - VIPervasive Computing concepts & Scenarios; Hardware & Software; Human - machine interface.

UNIT - VIIDevice connectivity; Java for Pervasive devices; Application examples

UNIT - VIIIClassical Vs Quantum logic gates ;One ,two & three QUbit Quantum gates; Fredkin & Toffoli gates ; Quantum circuits; Quantum algorithms.

TEXT BOOK :1. J. Joseph & C. Fellenstein:’ Grid Computing ‘, Pearson Education.2. J.Burkhardt et .al :’Pervasive computing’ Pearson Education3. Marivesar:’Approaching quantum computing ‘, Pearson Education.

REFERENCES :1. Raj Kumar Buyya:’High performance cluster computing’, Pearson Education.2. Neilsen & Chung L:’Quantum computing and Quantum Information’, Cambridge University Press.3. A networking approach to Grid Computing , Minoli, Wiley.


http://www.indiastudychannel.com/resources/31886-JNTU-IV-Year-B-Tech-IT-I-Sem-syllabus-for-ADVANCED-COMPUTING-CONCEPTS.aspx#%23







2.2.6. Visual Programming Lab


Experiments using java AWT/swing (JFC).

Reading Data From Key Board.Handling Buttons, Labels, Text Fields, Text Areas, Scroll Bar.Handling Check Boxes, Radio, List Box, Sliders.

Handling MenuHandling Swing Components Like Progress BarsHandling Databases Using JDBC Native Driver

Experiments Using VC++

Reading Data From Key Board.Handling Buttons, Ladles, Text Fields.Handling Check Boxes, Radio, List Box, Sliders.Handling Menu. Tool Bars.File Handling.Internet Programming.Creative Active X Controls.

Books:

VC ++, Steven Holzner, BPB Publisher.


MCA II Year - Semester-IV Syllabus2.2.7. Data Ware Housing Lab


The objective of the lab exercises is to use data mining techniques to identify customer segments and understand their buying behavior and to use standard databases available to understand DM processes using WEKA (or any other DM tool)

1. Gain insight for running pre- defined decision trees and explore results using MS OLAP


Analytics.2. Using IBM OLAP Miner – Understand the use of data mining for evaluating the content

of multidimensional cubes.3. Using Teradata Warehouse Miner – Create mining models that are executed in SQL.

( BI Portal Lab: The objective of the lab exercises is to integrate pre-built reports into a portal application ) 4 . Publish cognos cubes to a business intelligence portal.

Metadata & ETL Lab: The objective of the lab exercises is to implement metadata import agents to pull metadata from leading business intelligence tools and populate a metadata repository. To understand ETL processes

5. Import metadata from specific business intelligence tools and populate a meta data repository. 6. Publish metadata stored in the repository. 7. Load data from heterogenous sources including text files into a pre-defined warehouse schema.

Case study

8. Design a data mart from scratch to store the credit history of customers of a bank. Use this credit profiling to process future loan applications.

9. Design and build a Data Warehouse using bottom up approach titled ‘Citizen Information System’. This should be able to serve the analytical needs of the various government departments and also provide a global integrated view.

Adikavi Nannaya University, RajahmundryMCA II Year - Semester-V Syllabus

3.1.1..Web ServicesIntroduction –Background, Services, Web Services, Web Services Applicaion

Opportunities, Emergence of Web Services –Background, Server-side Architecture Progresion –

Mainframe Architecture, Client/Server Architecture, Distributed Architecture, Internet and Worldwide Web, Client-side Architecture Prograssion –Dumb terminals, Thick Clients, Thin Clients, Browser-based Clients, Mobile Clients, Service-orientd Architecture and Web Services –Web Services, Stage set

Web Services Application Scenario –Background, Web Services Hype and the Industry, Web Services and the Industry Acceptance –Supply Chain Managament and Logistics, Customer Relations Management, Financial Services and Banking, Education, Manufacturing.


Extensible Markup Language –Background, History of Markup Languages, What is XML? –Syntax of XML, XML Elements and Attributes, Data Representation and XML, Validation of XML Data, Advanced XML –Namespaces, XML Schema, Document Constraining –Document Constraining through DTD, Document Constraining through XML Schema

Simple Objec Access Protocol –Background, What is SOAP? –Message Envelope, Encoding Rules, RPC Convention, Binding with Underlying Protocol, SOAP Interaction –Message Exchange Model, SOAP Modelling –Basic Model, Message Structure Details, SOAP Response and Assosciated Problems, SOAP Encoding –Encoding Details, SOAP Binding

Web Services Description Language – Backgroung, What is WSDL?, Web Service Invocation and WSDL –Service Creation, Service Description, Service Registration, Service Discovery, Service Invaocation, Web Services Description Details –Elements and the Sequence of Their Appearance, Description of Elements, Service Description through WSDL -Service Description, Description of WSDL.

Registries: Universal Description, Discovery and Integration : Background, What is UDDI –Business Information and Taxonomy, Specifications and Services, Public and Private Registries, UDDI Nomenclature –Node API Sets, UDDI Node, UDDI Registers, Data Structure, Information Model, Core UDDI –Business Entity, Business Service, Business Template, tModel, Service Publication –Service Creation and Modification, Service Deletion, Service Discovery –Information Browsing, Information Drilldown.

Remote Procedure Call and Messaging : Background, Synchronous Web Services – Remote Procedure Call Basics, SOAP-based Remote Procedure Call ,.Asynchrous Web Services—Message Basics, XML/SOAP Messaging., Remote Procedure Call or messaging?Web Services :Industry Adoption : Background, Adoption of webservices by financial Services and Banking Industry—Areas of Adoption, speed of Adoption., Factors Affecting the Adoption of webservices Texhnology—favourable Factors, Dissuading Factors.Prescribed Book:Web services An Introduction—B V Kumar, S V Subrahmanya.

Adikavi Nannaya University, RajahmundryMCA III Year - Semester-V Syllabus

3.1.2. Network Security and Cryptography


INTRODUCTION: Terminology-notation-primer on networking-types of attacks- Layer and cryptography-Authorization-Key Escrow-Viruses, worms and Trojan Horses-Multi Level mode of security-legal issues.


CRYPTOGRAPHY: Introduction-Secret Key cryptography-Public Key Cryptography-Hash algorithm-DES-IDEA-AES-Modes of Operations-Hashes and Message Digests-MD2-MID4-MID5 and SHA-I-RSA-Deffie-Hellamn-Digital Signature Standard (DSS)-Elliptic Curve Cryptography.

AUTHENTICATION: Password based authentication-address based authentication-Cryptographic authentication Protocols-Passwords as cryptographic keys-trusted Intermediaries-certificate revocation-Multiple trusted Intermediaries-Session Key Establishment-Delegation.

STANDARDS: Kerberos V4-Kerberos V5-Public Key Infrastructure-Real Time communication Security-IP sec: AH and ESP-IP sec: IKE – SSL/TLS.

ELECTRONIC MAIL: E-Mail Security-PEM & S/MIME and PGP.

Text Book:

1. Network Security Private Communication in a public world, Charlie Kaufman, Radia Perlman&Mike Speciner, Pearson Education/Prentice Hall of India Private Ltd., New Delhi. (Chapter: 1 to 6,9,13 to 22).

Reference Books:

2. Network Security Essentials Applications and Standards, William Stallings, Person Education, New Delhi.

3. Cryptography and Network Security, Atul Kahate, Tata McGraw-Hill Pub Company Ltd., New Delhi.


3.1.3. Elective – II - Middle Ware Technologies


Introduction to client server computing: Evolution of corporate computing models from centralized to distributed computing, client server models. Benefits of client server computing, pitfalls of client server programming.


CORBA with Java: Review of Java concept like RMI, RMI API, JDBC.Client/Server CORBA-style, The object web: CORBA with Java.

Introducing C# and the .NET Platform; Understanding .NET Assemblies; Object –Oriented Programming with C#; Callback Interfaces, Delegates, and Events.

Building c# applications: Type Reflection, Late Binding, and Attribute-Based Programming; Object Serialization and the .NET Remoting Layer; Data Access with ADO.NET; XML Web Services.

Core CORBA / Java: Two types of Client/ Server invocations-static, dynamic. The static CORBA, first CORBA program, ORBlets with Applets, Dynamic CORBA-The portable count, the dynamic count multi count.

Java Bean Component Model: Events, properties, persistency, Intrespection of beans, CORBA Beans, EJBs and CORBA: Object transaction monitors CORBA OTM’s, EJB and CORBA, OTM’s, EJB container frame work, Session and Entity Beans,

Text Books: 1 Client/Server programming with Java and CORBA Robert Orfali and Dan Harkey, John

Wiley & Sons ,SPD 2nd Edition 2 Java programming with CORBA 3rd Edition, G.Brose, A Vogel and K.Duddy,

Wiley-dreamtech, India John wiley and sons 3 C# and the .NET Platform Andrew Troelsen, Apress Wiley-dreamtech, India Pvt Ltd Reference: Books: 1.Distributed Computing, Principles and applications, M.L.Liu, Pearson Education2. Client/Server Survival Guide 3rd edition Robert Orfali Dan Harkey and Jeri Edwards,

3. Client/Server Computing D T Dewire, TMH.

4. IBM Webspere Starter Kit Ron Ben Natan Ori Sasson, TMh, New Delhi

5. Programming C#, Jesse Liberty, SPD-O’Reilly.

6. C# Preciesely Peter Sestoft and Henrik I. Hansen, Prentice Hall of India

7. Intoduction to C# Using .NET Pearson Education

8. C# How to program, Pearson Education

9. C# and the .NET Platform Andrew Troelsen, Apress Wiley-dreamtech, India

Pvt Ltd

http://www.indiastudychannel.com/resources/31872-JNTU-III-Year-B-Tech-IT-II-Sem-syllabus-for-MIDDLEWARE-TECHNOLOGIES.aspx#%23


Adikavi Nannaya University, RajahmundryMCA III Year - Semester-V Syllabus3.1.4. Software Testing Methodologies


Introduction:-Purpose of testing, dichotomies, model for testing, consequences of bugs,

taxonomy of bugs

Flow graphs and Path testing:-Basics concepts of path testing, predicates, path predicates and achievable paths, path sensitizing, path instrumentation, application of path testing.

Transaction Flow Testing:-transaction flows, transaction flow testing techniques. Dataflow testing:- Basics of dataflow testing, strategies in dataflow testing, application of dataflow testing.

Domain Testing:-domains and paths, Nice & ugly domains, domain testing, domains and interfaces testing, domain and interface testing, domains and testability.

Paths, Path products and Regular expressions:-path products & path expression, reduction procedure, applications, regular expressions & flow anomaly detection.

Logic Based Testing:-overview, decision tables, path expressions, kv charts, specifications.


State, State Graphs and Transition testing:-state graphs, good & bad state graphs, state testing, Testability tips.

TEXT BOOKS:

1. Software Testing techniques - Boris Beizer, Dreamtech, second edition. 2. Software Testing Tools – Dr.K.V.K.K.Prasad, Dreamtech.

REFERENCE BOOKS:

1. The craft of software testing - Brian Marick, Pearson Education. 2. Software Testing Techniques – SPD(Oreille) 3. Software Testing in the Real World – Edward Kit, Pearson. 4. Effective methods of Software Testing, Perry, John Wiley.5. Art of Software Testing – Meyers, John Wiley.


MCA III Year - Semester-V Syllabus3.1.4. Elective – II – E-Commerce


Electronic Commerce-Frame work, anatomy of E-Commerce applications, E-Commerce Consumer applications, E-Commerce organization applications.

Consumer Oriented Electronic commerce - Mercantile Process models

Electronic payment systems - Digital Token-Based, Smart Cards, Credit Cards, Risks in Electronic Payment systems.

Inter Organizational Commerce - EDI, EDI Implementation, Value added networks.

Intra Organizational Commerce - work Flow, Automation Customization and internal Commerce, Supply chain Management.

Corporate Digital Library - Document Library, digital Document types, corporate Data Warehouses. Advertising and Marketing -Information based marketing, Advertising on Internet,


on-line marketing process, market research.

Consumer Search and Resource Discovery - Information search and Retrieval, Commerce Catalogues, Information Filtering.

TEXT BOOKS:

1. Frontiers of electronic commerce – Kalakata, Whinston, Pearson.

REFERENCE BOOKS:

1. E-Commerce fundamentals and applications Hendry Chan, Raymond Lee, Tharam Dillon, Ellizabeth Chang, John Wiley.2. E-Commerce, S.Jaiswal – Galgotia. 3. E-Commerce, Efrain Turbon, Jae Lee, David King, H.Michael Chang. 4. Electronic Commerce – Gary P.Schneider – Thomson.

Adikavi Nannaya University, RajahmundryMCA III Year - Semester-V Syllabus3.1.4. Elective – II – Bio-Informatics


Web-based Sequence Analysis: BLAST I Basic Local Alignment Search Tool(BLAST), The Purpose of BLAST, Terminology, BLAST Analsis, BLAST 2, Automated Alignments with Perl

Web-based Sequence Analysis :BLAST II Basic Local Alignment Sertch Tool (BLAST), Scoring Matrices, PAM or Per cent Accepted Mutation Matrices, BLOSUM, The Relationship between BLOSUM and PAM,Substitution Matrices, Working of the BLAST Algorithm, A Practical BLASIN Exercise,Explanation of the BLAST Output, Advanced BLASTN, Biological analysis of BLASTN :Cystic Fibrosis, Automating BLAST Analysis with Perl

Web-based Sequence analysis :BLAST III


Standalone BLAST, Configuring blastall, Downloading Databases from NCBI, forming NCBI’s Databases, Running blastall, Downloading Pre-formatted Databases,fastacmd, bl2seq,Performing Local BLAST searches with Perl, Sequence Annotation.

Web-based sequence Analysis : gene Prediction

Introduction, Termonolgy and Concepts, Gene Prediction Programs, Genscan, Running GenScan Analysis, Analyzing Genscan Output, GenScan Analysis with LWP:User Agent.

Web-based sequence Analysis :HMMER

Introduction, PSI-BLAST and Protein Analysis, When is PSI-BLAST betterthan BLASTP? The Design of PSI-BLAST, Advantages of PSI-BLAST, Limitations of PSI-BLAST, Example of a PSI-BLAST Search.

PSI-BLASTIntroduction, PSI-BLAST and Protein Analysis, when is PSI-BLAST better than BLASTP?, The Design of PSI-BLAST, Advantages of PSI-BLAST, Limitations of PSI-BLAST, EXAMPLE OF A PSI-BLAST search.Prescribed Book: Bioinformatics Principles and Applications – Harshawardhan P.Bal


3.1.4. Elective – II – Mobile ComputingInstruction: 3 Periods/week Sessional Marks: 50Univ-Exam : 3 Hours Univ-Exam-Marks: 100

Mobile Adaptive Computing – Mobile computing, Adaptability – Key to Mobile Computing – Transparency, Constraints of mobile computing environments, Application – aware adaptation, Mechanisms for Adaptation – Adapting functionality, Adapting dataHow to Develop or Incorporate Adaptations in Applications – Where can adaptations be performed, Support for Building Adaptive Mobile Applications – Odyssey, Rover.

Mobility Management – Mobility Management, Location Management Principles and Techniques – Registration are-based location management, Location Management Case Studies – PCS location management scheme, Mobile IP

Data Dissemination and Management – Challenges, Data Dissemination – Bandwidth allocation for publishing, Broadcast disk scheduling, Mobile Data Caching – Caching in traditional distributed systems, Cache consistency maintenance, Performance and architectural issues, Mobile Cache Maintenance Schemes – A taxonomy of cache maintenance schemes, Cache maintenance for push-based information dissemination, Broadcasting invalidation reports, Disconnected operation, Asynchronous Statefull (AS) scheme, To cache or not to cache, Mobile Web Caching - Handling Disconnections, Achieving Energy and Bandwidth Efficiency


Context Aware Computing – Ubiquitous or Pervasive Computing, What is Context, Various Definitions and Types of Contexts – Enumeration –based, roll –based,Context Aware Computing and Applications – Core Capabilities for Context Awareness, Types of Context Aware Applications, Developing Context Aware Applications, Middleware Support – Contextual services, Actuator service, An Example – Context Tool Kit, Providing Location Context

Introduction to Mobile Middleware – What is mobile middleware, Adaptation, Agents, Service Discovery

Middleware for Application Development : Adaptation and Agents – Adaptation- The spectrum of Adaptation, Resource Monitoring, Characterizing Adaptation Strategies, An Application – Aware Adaptation Architecture : Odyssey , A simple Odyssey Application, More Adaptation Middleware, Mobile Agents – Why Mobile Agents And Why Not, Agent Architectures, Migration Strategies, Communication Strategies,

Service Discovery Middleware : Finding Needed Services – Common Ground, Services – Universally Unique Identifiers, Standardization, Textual Descriptions, Using Interfaces for Standardization, More on Discovery and Advertisement Protocols – Unicast Discovery, Multicast Discovery And Advertisement, Service Catalogues, Garbage Collections – Leasing, Advertised Expirations, Eventing, Security – Jini, Service Location Protocol, Ninja, Interoperability – Interoperability Success StoriesText Book: Fundamentals of Mobile and Pervasive Computing by Frank Adelstein, Sandeep K.S.Gupta, Golden G.Richard II and Loren Schwiebert


3.1.5. Elective – III – Software Project Management


1. Managing software projects: processes and project management, project manage and the CMM – senior management involvement in projects- training for project managers – the project management process2. Project planning: process database its contents – the process capability baseline – process assets and the body of knowledge system3. Process planning: the standard process, process tailoring , requirement change management, change management process4. Effort estimation and scheduling: estimation and scheduling concepts, effort estimation, scheduling5. Quality planning: quality concepts, quantitative quality management, planning, defect prevention palnning6. Risk management: concepts of risk and risk management, risk assessment and risk control7. Measurement and tracking planning: concepts in measurement – measurements – project tracking


8. Project management plan : team management, customer communication and issue resolution, structure of the project management plan9. Configuration Management : concepts in configuration management, the configuration management process, configuration management plan10. Project execution : reviews, data collection, monitoring and control, project tracking, milestone analysis, activity level analysis, defect analysis and prevention, process monitoring and audit, project closure analysis

Text book:[1] Pankaj Jalote “ Software Project Management in Practice”, Addison Wesley/Pearson Education, New Delhi

Reference Books: [1] Andrew Stellman & Jennifer Greene, “ Applied software project management”, O ‘ Reilly Publishers, First Edition November 2005.[2] Scott Berkun, “ The Art of Project Management” , O’Reilly Publishers, First Edition November 2005.


3.1.5. Elective – III – Embedded Systems


UNIT - I

Embedded Computing: Introduction, Complex Systems and Microprocessor, The Embedded System Design Process, Formalisms for System Design, Design Examples. (Chapter I from Text Book 1, Wolf)

UNIT - II

The 8051 Architecture : Introduction, 8051 Micro controller Hardware, Input/Output Ports and Circuits, External Memory, Counter and Timers, Serial data Input/Output, Interrupts. (Chapter 3 from Text Book 2, Ayala)

UNIT - III


Basic Assembly Language Programming Concepts : The Assembly Language Programming Process, Programming Tools and Techniques, Programming the 8051. Data Transfer and Logical Instructions.(Chapters 4,5 and 6 from Text Book 2, Ayala)

UNIT - IV

Arithmetic Operations, Decimal Arithmetic. Jump and Call Instructions, Further Details on Interrupts. (Chapter 7and 8 from Text Book 2, Ayala)

UNIT -V

Applications: Interfacing with Keyboards, Displays, D/A and A/D Conversions, Multiple Interrupts, Serial Data Communication. (Chapter 10 and 11 from Text Book 2, Ayala)

UNIT - VI

Introduction to Real – Time Operating Systems: Tasks and Task States, Tasks and Data, Semaphores, and Shared Data; Message Queues, Mailboxes and Pipes, Timer Functions, Events, Memory Management, Interrupt Routines in an RTOS Environment (Chapter 6 and 7 from Text Book 3, Simon)

UNIT - VII

Basic Design Using a Real-Time Operating System: Principles, Semaphores and Queues, Hard Real-Time Scheduling Considerations, Saving Memory and Power, An example RTOS like uC-OS (Open Source); Embedded Software Development Tools: Host and Target machines, Linker/Locators for Embedded Software, Getting Embedded Software into the Target System; Debugging Techniques: Testing on Host Machine, Using Laboratory Tools, An Example System. (Chapter 8,9,10 and 11 from Text Book 3, Simon)

UNIT - VIII

Introduction to advanced architectures: ARM and SHARC, Processor and memory organization and Instruction level parallelism; Networked embedded systems: Bus protocols, I2C bus and CAN bus; Internet-Enabled Systems, Design Example-Elevator Controller. (Chapter 8 from Text Book 1, Wolf)

TEXT BOOKS:

Computers and Components, Wayne Wolf, Elseveir.The 8051 Microcontroller, Third Edition, Kenneth J.Ayala, Thomson.An Embedded Software Primer, David E. Simon, Pearson Education.

REFERENCE BOOKS:

1. Embedding system building blocks, Labrosse, via CMP publishers.Embedded Systems, Raj Kamal, TMH.Micro Controllers, Ajay V Deshmukhi, TMH.


Embedded System Design, Frank Vahid, Tony Givargis, John Wiley.Microcontrollers, Raj kamal, Pearson Education.

Adikavi Nannaya University, RajahmundryMCA III Year - Semester-V Syllabus3.1.5. Elective – III – Network Protocols


IP ADDRESSING: Decimal Notation-Classes- special addresses - A simple Internet-Unicast and Broadcast addresses - Applying for I P addresses-Private networks.SUBNETTING AND SUPERNETTING: Subnetting- Masking-Examples of Subnetting — Variable length Subnetting- Supemetting.

INTERNET PROTOCOL: Data gram-Fragmentation-Options- Checksum- IP design. ARP and RARP: ARP- ARP design — RARP

INTERNET CONTROL MESSAGE PROTOCOL: Types of Messages- Message formats- Error reporting-Query- Checksum- ICMP design.

INTERNET GROUP MANAGEMENT PROTOCOLS: Multicasting- IGMP-Encapsulation Multicast Backbone- IGMP design.

USER DATAGRAM PROTOCOL: Process to process communication-User datagram - Checksum- UDP operation- uses of UDP — UDP design.


TRANSMISSION CONTROL PROTOCOL: Process to Process communication -TCP Services - Segment -Options- Checksum-Flow control- Error Control- TCP Timers-Connection-State Transition Diagram-Congestion Control-TCP operation- TCP Design.

APPLICATION LAYER AND CLIENT-SERVER MODEL: Client-server Model-Concurrency Processes

BOOTP and DHCP: BOOTP-DHCP

DOMAIN NAME SYSTEM: Name Space-Domain name Space-Distribution of Name space-DNS in the Internet-Resolution- DNS Messages- Types of Records-Compression-DDNSEncapsulation.

TELNET AND RLOGIN: Concept-Network Virtual Terminal- NVT character set -Embedding Options-Option Negotiation-Sub option Negotiation-Controlling Server-Out of Band signaling - Escape character-Mode of Operation-Examples- User Interface- Rlogin-Security Issue.

FILE TRANSFER PROTOCOL: Connections- Communication-Command Processing-File Transfer-User Interface-Anonymous FTP.TRIVIAL FILE TRANSFER PROTOCOL: Messages- Connection- Data Transfer-UDP ports- TFTP Example-TFTP options -Security-Applications.

HYPERTEXT TRANSFER PROTOCOL: HTTP overview-Proxy-Gateway-Tunnel-Cache Messages-General Header Fields-Cache Control-Connection-Request Methods-Request Header Fields-Response Messages-Response Header Fields-Entity Header Fields-Client/Server Authentication.

SOCKET INTERFACE: Definitions-Sockets-Byte ordering- Address Transformation-Byte manipulation Function-Information about Remote Host- Socket System Calls- Connectionless Iterative server- UDP Client/Server Programs-Connection oriented Concurrent Server - TCP Client-Server Programs.

Text Book: TCP/IP Protocol Suite. Behrouz A. Forouzan (TMH edition) Reference Book: Internetworking with TCP/IP. D. E. Comer (PHI publications).


Adikavi Nannaya University, RajahmundryMCA III Year - Semester-V Syllabus3.1.5. Elective – III – Image Processing


Fundamentals of Image Processing: Image Acquisition, Image Model, Sampling,

Quantization, Relationship between pixels, distance measures, connectivity, Image - Geometry,

Photographic film. Histogram: Definition, decision o. f contrast basing on histogram ram,

operations basing on histograms like image stretching, image sliding, Image

classification,Definition and Algorithm of Histogram equalization.

Image Transforms: A detail discussion on Fourier Transform, DFT, FFT, properties. A brief

discussion on WALSH Transform, WFT, HADAMARD Transform, DCT.

Image Enhancement: (by SPATIAL Domain Methods)

a. Arithmetic and logical operations, pixel or point operations, size operation:;,

b. Smoothing filters-Mean, Median, Mode filters — Comparative study,

c. Edge enhancement filters — Directorial filters, Sobel, Laplacian, Robert, KIRSCH,

Homogeneity & DIFF Filters, perwitt filter, Contrast Based edge enhancement techniques.

Comparative study.

d. Low Pass filters, High Pass filters, sharpening filters-Comparative Study.

e. Comparative study of all filters.

f. Color image processing.

Image enhancement: (By frequency Domain Methods). Design of Low pass, High pass,

EDGE Enhancement, smoothening filters in Frequency Domain. Butter worth filter,

Homomorphic filters in Frequency Domain. Advantages of filters- in frequency domain,

comparative study of filters in frequency domain and spatial domain.

Image compression: Definition, A brief discussion on — Run length encoding, contour

coding, Huffman code, compression due to change in domain, compression due to quantization,


Compression at the time of image transmission.. Brief discussion on Image Compression

standards.

Image Segmentation: Definition, characteristics o f segmentation. Detection of

Discontinuities, Thresholding Pixel based segmentation method. Region based segmentation

methods — segmentation by pixel aggregation, 'segmentation by sub region aggregation,,

histogram based segmentation, spilt and merge technique. Use of motion in segmentation (spatial

domain technique only).

Morphology: Morphology Dilation, Erosion, Opening, closing, Hit-and-Miss transform,

Boundary extraction, Region filling, connected components, thinning, Thickening, skeletons ,

Pruning Extensions to Gray — Scale Images Application of Morphology in I.P

Text Book:

[1] Digital Image Processing , Rafael C. Gonzalez and Richard E. Woods, Addison Wesley,

New Delhi 9

Reference books:

[1] Fundamentals of Electronic Image Processing ,Arthur .R. Weeks, Jr. Prentice Hall of India

Pvt. Ltd., New Delhi

[2] Image pi;•ocessing, Analysis, and Machine vision, Milan Sonka, Vaclav Hlavac, Roger

Boyle, Vikas Publishing House, New Delhi.


3.1.7. Web Programming Lab


1. Design of the Web pages using various features of HTML and DHTML


2. Client server programming using servlets, ASP and JSP on the server side and java script on the client side

3. Web enabling of databases

4. Multimedia effects on web pages design using Flash.

Reference Books:

1. Internet and Web Technologies by Raj Kamal, Tata McGraw-Hill Publishing Company, New Delhi2. Programming the World Wide Web by Robert W. Sebesta, Pearson Education, New Delhi


1.1.8. Soft Skills Lab( Paper Presentation, Abstract Preparation etc)


Objectives:1. To encourage the all round development of students by focusing on soft skills.2. To make student aware about the importance, the role and the content of softskills through instruction, knowledge acquisition, and practice.

1 Self Development and Assessment1.1 Self-Assessment1.2 Self-Awareness,1.3 Perception and Attitudes1.4 Values and Belief System1.5 Personal Goal Setting1.6 Career Planning,


1.7 Self-Esteem,1.8 Building of Self-Confidence

2 Components of communication,Principles of communication barriers, listening skills Verbal Communication2.1 Includes Planning2.2 Preparation2.3 Delivery, Feedback and Assessment of activities like

a. Public speakingb. Group Discussionc. Oral Presentation skills, Perfect Interviewd. Listening and observation skills, Body language

2.4 Use of Presentation graphics,2.5 Use of Presentation aids,

References for students for self-improvement by self-studyTopic 1 : Any good book like1. You Can Win – Shiv Khera – Macmillan Books – 2003 Revised Edition2. 7 Habits of Highly effective people – Stephen Covey3. Business Communication? Asha Kaul4. Business Communication - M. Balasubramanyam5. Jenny Rogers “ Effective Interviews”, Video Arts MARSHAL

Adikavi Nannaya University, RajahmundryMCA II Year - Semester-VI Syllabus

Third Year Semester VI

Project Work 400 Marks

Internal Valuation : 150 Ist Review : 50 2nd Review : 50 Project Report : 50

External Valuation : 250

Documentation : 100


Coding/Implementation: 50 Presentation : 50 Viva Voce : 50