mcaschsyll2013

VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELGAUM Master of Computer Applications (MCA) Scheme and Syllabus (With effect from 2013-2014) 1 SCHEME OF TEACHING AND EXAMINATION MASTER OF COMPUTER APPLICATIONS I SEMESTER S. No. Subject Code Title Teaching Hrs / Week Theory PracticalDuration Examination Marks IA 1 2 3 4 5 6 7 8 13MCA11 13MCA12 13MCA13 13MCA14 13MCA15 13MCA16 13MCA17 13MCA18 Problem Solving using C Discrete Mathematics Structure Fundamentals of Computer Organization Introduction to Unix Introduction to Web Technologies C Programming Laboratory Unix Programming Laboratory Web Programming Laboratory Total 04 04 04 04 04 20 03 03 03 09 03 03 03 03 03 03 03 03 50 50 50 50 50 50 50 50 400 Exam 100 100 100 100 100 50 50 50 650 Total 150 150 150 150 150 100 100 100 1050 SCHEME OF TEACHING AND EXAMINATION MASTER OF COMPUTER APPLICATIONS II SEMESTER S. Subject No Code . 1 2 3 4 5 6 7 8 13MCA21 13MCA22 13MCA23 13MCA24 13MCA25 13MCA26 13MCA27 13MCA28 Total Title Teaching Hrs / Week Practica Duration Theory l 03 03 03 09 03 03 03 03 03 03 03 03 Exami nationMar ks IA Exam Total 50 50 50 50 50 50 50 50 400 100 100 100 100 100 50 50 50 650 150 150 150 150 150 100 100 100 1050 Data Structures Using C 04 Object Oriented Programming 04 using C++ Operating Systems 04 System Programming 04 Database Management Systems 04 Data Structures Using C Lab Database Laboratory OOP Using C++ Laboratory 20 2 SCHEME OF TEACHING AND EXAMINATION MASTER OF COMPUTER APPLICATIONS III SEMESTER S. Subject No Code . 1 2 3 4 5 6 7 8 13MCA31 13MCA32 13MCA33 13MCA34 13MCA35 13MCA36 13MCA37 13MCA38 TOTAL Title Teaching Hrs / Week Theory Practical 04 04 04 04 04 20 03 03 03 09 Examinati on Mar ks IA Exam 50 50 50 50 50 50 50 50 40 0 100 100 100 100 100 50 50 50 650 Duration 03 03 03 03 03 03 03 03 Total 150 150 150 150 150 100 100 100 1050 Computer Networks Programming using Java Software Engineering Computer Graphics Elective-I Java Programming Lab Computer Graphics Lab Computer Networks Lab Elective-1 13MCA351 13MCA352 13MCA353 13MCA354 13MCA355 13MCA356 UNIX system Programming Advanced Topics in DBMS Basics of MIS & E-Commerce Operations Research Principles of User Interface Design Probability Statistics & Numerical Methods 3 Subject No Code . 1 2 3 4 5 6 7 8 Title Teaching Hrs / Week Practical Theory 04 04 04 04 04 20 03 03 03 09 Examinati on Mar IA Exaks Total m 50 100 150 50 100 150 50 100 150 50 100 150 50 100 150 50 50 100 50 50 100 50 50 100 400 650 1050 Duration 03 03 03 03 03 03 03 03 13MCA41 Analysis & Design of 13MCA42 Algorithm Advanced Java Programming 13MCA43 Advanced Web Programming 13MCA44 Elective-2 13MCA45 Elective-3 13MCA46 Algorithms Lab 13MCA47 Advanced Java Lab 13MCA48 Mini Project-I TOTAL Elective-2 13MCA441 Advanced Computer Networks 13MCA442 Data Warehousing & Data Mining 13MCA443 Mobile Computing and Wireless Communications 13MCA444 Software Testing and Practices 13MCA445 Theory of Computation (FAFL) 13MCA446 Digital Image Processing Elective 3 13MCA451 Cryptography & Network Security 13MCA452 Network Management 13MCA453 NOSQL 13MCA454 13MCA455 13MCA456 Software Architectures Enterprise Resource Planning (ERP) Mobile Applications 4 .SCHEME OF TEACHING AND EXAMINATION MASTER OF COMPUTER APPLICATIONS IV SEMESTER S. No.0 and Rich Internet Applications 13MCA553 Information Retrieval & Search Engines 13MCA554 Soft Computing 13MCA555 Storage Area Network 13MCA556 Software Project Management 5 . Subject Code 1 2 4 5 6 7 8 13MCA51 13MCA52 13MCA53 13MCA54 13MCA55 13MCA56 13MCA57 13MCA58 Title Teaching Hrs / Week Theory Practical 04 04 04 04 04 20 03 03 03 09 Examinatio n Marks IA Exam 50 100 50 50 50 50 50 50 50 400 100 100 100 100 50 50 50 650 Duration 03 03 03 03 03 03 03 03 Object-Oriented Modeling and Design Patterns System Simulation and Modeling Programming using C#.SCHEME OF TEACHING AND EXAMINATION MASTER OF COMPUTER APPLICATIONS V SEMESTER S.& .Net Laboratory Mini Project -II Tota l Total 150 150 150 150 150 100 100 100 1050 13MCA541 13MCA542 13MCA543 13MCA544 13MCA545 13MCA546 Elective-4 IV Sensor Networks Mobile and Adhoc Parallel Computing Multimedia systems Pattern Recognition Services Oriented Architecture Compiler Design Elective-5 13MCA551 Cloud Computing 13MCA552 Web2.NET Elective-4 Elective-5 Software Design Laboratory . SCHEME OF TEACHING AND EXAMINATION MASTER OF COMPUTER APPLICATIONS VI SEMESTER S. 6 . two electives from IV Semester. Subject No. (One elective from III Semester. Students have to register for one Elective subject from each of the Five Elective Groups. Code Title Teaching Hrs/Week Theory Practical Examination Duration IA 1 13MCA61 Project Work 03 03 50 Marks Dissertation 125 Viva 75 Total 250 GENERAL NOTE: 1. two electives from V Semester) 2. Change of program during lab examinations is not permitted because problems are given from the predefined list only. Sonal Jain. Pointer as function arguments. Brian W Kernighan. input and output operations. Harshal Arolkar. malloc. Programming Examples Unit 6 10 Hours Files – defining. Dennis M Rtchie. macro substitution. Call by reference. Simplifying C. Balaguruswamy 3. Tata McGraw-Hill edition 2. Operators. Programming Examples Unit 4 10 Hours Functions. Pointers. gets. PHI. printf. C structure.SEMESTER I Problem Solving Using C Sub. Programming Examples Text Books 1. & Dawn Griffiths. The C Programming Language. 4. Programming with C. Order of evaluation. random access. Type conversion. Passing arrays to functions. Programming Examples Unit 5 5 Hours Structures and Unions – defining. Variables. goto. Yashwant Kanetkar. Constants. puts. Programming with C. Dynamic Memory Allocation –definition. for. do-while. operations on individual members. Vishal M Lichade. Let us C. Declarations. Dreamtech press. realloc. array of structures. Data types. structures within structures. 7 . Storage classes. declaring. getchar. . accessing. Wiley Publications 3. free. Code Hrs/Week Total Hours : 13MCA11 : 4 : 52 IA Marks Exam Hours Exam Marks : : : 50 03 100 Unit 1 9 Hours Algorithms. BPB Publications 2. initialization. pointers and structures. Programming Examples Unit 2 10 Hours Input and output statements – scanf. O’Riley. C Programming. compiler control directives. Precedence. Associativity. Byron Gottfried. Functions returning pointers. Multi dimensional Arrays. Call by value. dynamic arrays. David Griffiths. 2nd Edition Reference Books 1. else-if. switch. Categories of functions. Preprocessor – definition. Strings. Programming Examples Unit 3 8 Hours Arrays – Single dimension. structures and functions. closing. Pointer arithmetic. Dr. Head First C. recursion. break and continue. Pointers to functions. calloc. Two dimensional. Command line arguments. bit fields. Pointer Expression. passing strings to functions. file inclusion. opening. Flow Charts. comparing. putchar. Control Structures – while. error handling. Control Statements – if. 2004 (Chapter1: 1.4. Marks : 50 Exam H o u r s : 03 Exam Marks : 100 Fundamentals of Logic 14 Hours Basic Connectives and Truth Tables. Chapter 5:5.6.1-5. Set Theory 7 Hours Sets and Subsets.1. 7. Logical Implications: Rules of Inference. Directed Graphs and Weighted Graphs. Functions-Plain and One-to-One. Set Operations and the Laws of Set Theory. Kenneth H Rosen. Posets and Hasse Diagrams. The rules of sum and product. 2004 5.5. Equivalence relation and Partitions.A. Representation and Isomorphism. Special functions. 2005.4. B. lattices. McGraw-Hill. The use of Quantifiers. D. Jayant Ganguly: A Treatise on Discrete Mathematical Structures" Pearson.2. Chapter 4: 4. Principles of Inclusion and Exclusion. Y N Singh “Discrete Mathematical Structures" Wiley India. Permutations and Combinations with repetition Properties of Integers and Recurrence 7 Hours Mathematical Induction. Chapter 2: 2.6) Reference books 1.K Sen: Discrete Mathematical Structures: Theory & Applications. Computer recognitionZero One Matrices and Directed graphs.1-3. 2nd Edition. Properties of Relations.Ramana. “Discrete Mathematics & its Applications" 7th edition. Recursive definitions.1-12. Thomas Koshy: Discrete Mathematics with Applications. The first order Linear recurrence relation. T h e G r e a t e s t C o m m o n D i v i s o r Euclidian Algorithms. Chapter 7:7. Connectivity and Adjacency. Onto Functions. Stirling Numbers and the Second Kind. 2010 2.V. Elsevier.1-4.4) 2. Planarity and Chromatic Number. 1st edition. Relations and Functions 14 Hours Cartesian products and Relations.4. Ralph P Grimaldi.(Chapter 10:10. Logic Equivalence :The laws of Logic.7. 2010 4. Cengage Learning. 2010 3. Reprint 2008 8 . The Pigeon-hole principle.12. Chapter 10:10.S. Chapter 12: 12. Proofs of Theorems. Function composition and inverse functions. An Applied Introduction” 5th Edition.Discrete Mathematical Structures Subject Code : 13MCA12 Hours/Week : 04 Total Hours : 52 I.1-.1-10. Malik & M. “Discrete & Combinatorial Mathematics. Quantifier Definitions. Rooted Trees. Euler and Hamilton. Properties and Examples.1-1. Counting and Venn Diagrams.6. Chapter 3: 3.4. Trees and Sorting Text Books 1.4. Graph Theory and Trees 10 Hours Terminology. Definitions. Pearson Education. Eric Gosset “Discrete Mathematics with Proof” Wiley India. Buses.A. Canonical and Standard Forms. “Digital Electronics – Principles and Applications”. Carl Hamacher. Processor Example. 3 Edition. Size. Semiconductor RAM Memories. “Digital Logic and Computer Design”. Bus structure. Interrupts. 2010 9 edition. D M A . Multiprocessing and Multicomputers. Binary Numbers. Functional Units. Integrated Circuits. Basic Structure of Computers 6 hours Computer Types. 2012. Two – and Three – Variable Maps. Decoders. Pearson. Number Base Conversion. Multiplexers. Registers. Adders. Don’t Care Conditions.Hill. John P. Hayes. Examples from Assembly Language Programming. Introduction to Assemblers and Compilers. Subtractors. Software. Tata McGraw . Triggering of Flip. 2. BOOTH algorithm for signed numbers with example. Octal and Hexadecimal Numbers. Ripple counter and Synchronous Counter . Performance. NAND and NOR Implementation.Flops. Text Books: 1. Combinational Logic and Arithmetic Circuits 14 Hours Axiomatic Definition of Boolean Algebra. rd . Product of Sums Simplification. M. Basic Theorems and Properties of Boolean Algebra.Fundamentals Of Computer Organization Subject Code: 13MCA13 Hours/Week : 04 Total Hours : 52 I. Machine Instruction and Programs 7 Hours Memory Locations and Addresses. Boolean Functions. Speed.Hill. Addressing Modes. Tata McGraw . 2012. Magnitude Comparator. The map Method. Memory Operations. Input/Output Organization 7 Hours Accessing I/O Devices. Soumitrs Kumar Mandal. Cache Memories. Instructions and Instruction Sequencing. Sequential Logic 6 Hours Introduction. Morris Mano. Case study of IA32 Intel processor The Memory System 6 Hours Some Basic Concepts. Four – Variables Map. Zvonko Vranesic Safwat Zaky. Shift Registers. Other Two. Binary Parallel Adder. Basic Operational Concepts. 5th Tata McGraw-Hill. Secondary Storage. 2. Virtual Memories. Decimal Adder.Level Implementations. 2011 Reference Books: 1.”Computer Organization”. subtraction using r’s and r-1 complements. Read – Only Memories. Digital Logic Gates. different types of Flip – Flops. Memory Management Requirements. Introduction. Binary Code. Binary Storage and Registers. Other Logic Operations. Marks : 50 Exam H o u r s : 03 Exam Marks : 100 Binary Systems 6 Hours Digital Computers and Digital Systems. “Computer Architecture and Organization”. Binary Logic. and Cost. Introduction to UNIX Sub Code :13MCA14 Hrs/Week :04 Total Hours :52 IA Marks : 50 Exam Hours : 03 Exam Marks : 100 Introduction of UNIX 9 Hours Introduction. Arrays. PWD. until. nice. Substitution. Eric Foster -Johnson. cd. tar. administrator’s privileges. 10 . the –f option. On-line Command Editing Advanced System Administration 2 Hours Case Study: emacs editor and any one distribution of Linux Text Book: 1. Variables. Customizing the Environment : System Variables. Exec Statement The Process 8 Hours Process basics. set. sleep and wait. Command Line Arguments. pwd. Security and File Permission. changing ownership and group. startup & shutdown. absolute pathnames. Sumitabha Das. egrep. History. profile. Interface with the Shell. Substitution. managing disk space. cpio. cal. what’s in a filename? The parent-child relationship. $. Introduction to the Shell 7 Hours Introduction to Shell Scripting. trap. tr commands. paste. eval. The –f option. Tata McGraw Hill. who. calendar. redirection. the Command. the –f option. John C Welch. Filters using Regular Expression : grep & sed grep. sty. passwd. PS. uniq. Exit Status of a Command. find Simple Filters 9 Hours Pr. uname. fgrep. tput. Functions. “Beginning Shell Scripting”. Shell Scripts. get line. script. Prosperities of Regular Expressions Context addressing. expr. Merging Streams. bc. for. head. umask. the Home directory. More file attributes: hard link. @. chmod. File Attributes. Line Addressing. the –d option. running jobs in background. Basic commands ls. Shell Functions. internal and external commands. sort. writing selected lines to a file. tail. Yashwant Kanetkar. changing permission. Sample Validation and Data Entry Scripts. exit. the Logical and Relational Operators. Command History. Micah Anderson. The sh command. time commands. security level. “Introduction to UNIX” by M G Venkatesh Murthy. using absolute pathnames for a command. export. mkdir. Wrox publication. sed instruction. BEGIN and END positional Parameters. printf. cd. The UNIX file system. Control Flow. Context addressing. at and batch. 2. The here document. Essential System Administration root. Built-in variables. Aliases. printf. Advanced Shell Programming. echo. tty. writing selected lines to a file. while. Number Processing. “Unix Shell Programming”. The Logical Operators && and ||. Inserting and Changing Text. Experience the Unix environment. Your UNIX-The Ultimate Guide. cat. Architecture. File Permissions. rmdir. Relative pathnames. and case conditions. UNIX File System: The file. read. Properties of Regular Expressions Awk-Advanced Filters 9 Hours Simple awk Filtering. if. Basic File Attributes 8 Hours Is – l. expr. 3. sty. Regular Expression. cut. spell and ispell. Splitting a Line into Fields. cron. user masks. date. Conditional Parameter Substitution. symbolic link. Reference Book: 1. users and groups. Web Search Engines. The Basics of JavaScript: 6 Hours Overview of JavaScript. Using Perl for CGI Programming: The Common Gateway Interface. Peak into the History of the Web. operations. displaying raw XML documents.A.Introduction to Web Technologies Subject Code: 13MCA15 Hours/Week: 4 Total Hours: 52 I. MIME. Hypertext Links. Higher Level Protocols. XML processors. The <span> and <div> tags. Standard structure. TCP/IP. Property value forms. Do cu m en t s t r u ct u r e. Query string format. Images. the Web Programmers Toolbox. Selector forms. Locating the Mouse Cursor. File input and output. Dynamic Content. The box model. Security. Lists. Basic text markup. Introduction to XHTML 10 Hours Basic syntax. WWW. Conflict resolution. Examples. Internet Applications. CGI linkage. Pattern matching. Control statements. Scalars and their operations. Levels of style sheets. Background images. Examples. Web services. Changing Colors and Fonts. Networks. Functions. Web Foundations 6 Hours Evolution of the Web. Object creation and modification. D o c u m e n t t yp e d e fi n i t i o n s. Dragging and Dropping Elements. List properties. Errors in scripts. Slow Movement of Elements. Positioning Elements. Color. JavaScript and HTML Documents 6 Hours The JavaScript Execution Environment. References. and expressions.pm module. Forms. Reacting to a Mouse Click. Marks : 50 Exam Marks : 100 Exam Hours : 3 Fundamentals 4 Hours Internet. Fundamentals of arrays. Events and Event Handling. Control statements. Functions. Moving Elements. Tables. The Document Object Model. The DOM2 Event Model. Alignment of text. Font properties. The Basics of Perl 8 Hours Origins and uses of Perl. A survey example. Important Components of the Web. Screen output and keyboard input. CGI. URLs. 11 . Displaying XML documents with CSS. Dynamic Documents with JavaScript: 6 Hours Introduction. Hashes. HTTP. Primitives. Element Visibility. Pattern matching using regular expressions. XSLT style sheets. S yn t ax . Style specification formats. Handling Events from Text Box and password Elements. Object orientation and JavaScript. Arrays. Elements Access in Java Script. Nam es p ac es . Constructors. Assignment statements and simple input and output. Dom Tree Traversal and Modification. The navigator Object. X M L schemas. Web Browsers and Web Servers. Syntactic characteristics. Introduction to XML 6 Hours Introduction. Frames. Handling Events from Body Elements. Application Servers. Cookies. Stacking Elements. Cascading Style Sheets: Introduction. Jeffrey C. 9. M. 2009.A Computer Science Perspective. 2012. 3 & 4 Reference Books: 1. 4th Edition. 7. Chapters 1. Pearson education. 4. Pearson Education. 2. 2. Robert W. 8. 11 & 13 2. Eleventh Impression. Sebesta: Programming the World Wide Web. Chapter 1. Chris Bates: Web Programming Building Internet Applications. Jackson: Web Technologies. 6. Internet Technology and Web Design. Wiley India. 2012. 5. 12 . Tata McGraw Hill. Srinivasan: Web Technology Theory and Practice. 2. Pearson Education. 2011. 3. 3rd Edition. 3.Text Books: 1. Instructional Software Research and Development (ISRD) Group. 2012. 13 .e. Generate all Amstrong numbers upto n. b. b. Write a C program to multiply two matrices that satisfy the constraint of matrix multiplication 7. because 1. Defn: Given a RxC Matrix.The first perfect number is 6. 3. Write a menu driven C program to a. since 3**3 + 7**3 + 1**3 = 371. i. 4.371 is an Armstrong number. that is. 8.C Programming Laboratory Sub. a. 1. TA=5% of his basic pay and deductions IT = 2. and in each column. 2. Example . Example . 2. Convert a decimal number to a hexadecimal number. where the numbers in each row. Decode the string using reverse procedure and display. R rows and C columns we define a Saddle-Point as Saddle_Pt (A) for a row I and column j is that A(i. Accept a string from the user b. Write a C program to find the saddle point of a matrix. and 3 are its proper positive divisors. Code Hrs/Week Total Hours 1. b. Write a C program to implement a magic square of size n. Write a Menu Driven C Program to a. Insert an element into an array b. Delete an element from the array (first occurrence) 5. A. all add up to the same number. Convert each character in a string to its ASCI value. HRA = 10% of basic pay. a. Defn: A magic square is an arrangement of numbers (usually integers) in a square grid. and the numbers that run diagonally in both directions. the sum of its positive divisors excluding the number itself. 2. Solve quadratic equations for the given values of a.j) that is the minimum of Row i and the maximum of Col j. Decode the string Apply the following procedure to encode it. and 1 + 2 + 3 = 6.b. Add an integer value to it and display the encoded string 3. Encode the string. : 13MCA16 : 4 : 42 IA Marks Exam Hours Exam Marks : : : 50 03 100 Convert degrees into Fahrenheit and vice versa Calculate the salary of an employee given his basic pay.5% of his basic pay Check whether the given number is perfect number Defn: A perfect number is a positive integer that is equal to the sum of its proper positive divisors. Defn: An Armstrong number of three digits is an integer such that the sum of the cubes of its digits is equal to the number itself. 6. a.c. c. Display the name of the student with the worst mark f. Create functions for each of the options 10. Write a Menu Driven C Program to a. Display the name of the student with the best mark e. Sum of all integers ranging from n to m c. a. If it exists display the location of the word 14. Factorial of a number b. Display the average marks scored by the students 13. Display all student details d. Define a structure called student having the properties of student_id. Sum of all even integers ranging from n to m Display an error message if n > m. Write a C Program to remove all white spaces and newline characters from a file. Create a structure Complex Number having real and imaginary part as properties. Write a Menu driven C program to a. Add new student detail b. Fibonacci series 11. Note: In the examination each student should do one question out of the above 14 questions 14 . b. Delete a student detail c. 12. student name and branch of the student with a sub structure of marks of 3 subjects.9. Find whether a given word exists in the file. Write a Menu Driven C Program to implement the following using recursion a. Sum of all odd integers ranging from n to m d. Write a C program to copy one file content to another file without using inbuilt functions. Accept two numbers n and m b. Write functions to add and subtract the two complex numbers. can be used to specify in which the search is to begin. The second argument. if no arguments are specified. checks if the permissions for these files are identical and if the permissions are identical. finds the maximum length of any file in that hierarchy and writes this maximum value to the standard output. Write a shell script which accepts valid log-in names as arguments and prints their corresponding home directories. character Save the file and continue working save the file a exit the editor quit the editor quit without saving the file rename a file insert lines. then the command mpc a/b/c/d should create directories a. No time limit need be implemented for the lock duration. it must lock the keyword until a matching password is entered again by the user. b. It should prompt the user for a password. b. but not limited to: 1 2. it must prompt again for the matching password as confirmation and if match occurs. 8. control-D. Note that the script must be written to disregard BREAK. delete lines. 5. Explore vi editor with vim tutor. 6.UNIX Programming Laboratory Sub Code : 13MCA17 Hours/Week : 3 Total Hours : 42 A. which is optional. insert character. If this second argument is not present. 2a. a/b/c/d. 4. Write a shell script that displays all the links to a file specified as the first argument to the script. Write shell script to implement terminal locking (similar to the lock command). 4a. Write a shell script that accepts a path name and creates all the components in that path name as directories. 3a. set line numbers search for a pattern move forward and backward replace I.A. a/b/c. Write a shell script that accept one or more filenames as argument and convert all of them to uppercase. 10. print a suitable error message. delete character. 7. Perform the following operations using vi editor. 9. b. b. provided they exist in current directory. B. a/b. output common permissions and otherwise output each file name followed by its permissions. 3. For example. Write a shell script that accepts two file names as arguments. Create a script file called file-properties that reads a file name entered and outputs it properties. After accepting the password entered by the user. if the script is named mpc. Explore the unix environment. the search is to begin in current working directory. Marks : 50 Exam Hours : 3 Exam Marks : 50 1a. the starting directory as well as all its subdirectories at 15 . In either case. Write a shell script that takes a valid directory name as an argument and recursively descend all the sub-directories. The script should check the validity of the argument and in the case of error. The script need not include any error checking. Write an awk script that accepts date argument in the form of dd-mm-yy and displays it in the form if month. count and report occurrence of each word that is present in the first argument file on other argument files. b. Note: In the examination each student picks one question from a lot of all the 11 16 . b. The script automatically terminate if specified user does not log in during a specified period of time. Write a shell script that gets executed displays the message either “Good Morning” or “Good Afternoon” or “Good Evening” depending upon time at which the user logs in. Write a shell script to display the calendar for current month with current date replaced by * or ** depending on whether the date has one digit or two digits. Electrical 34 Mechanical 67 Electrical 80 Computer Science 43 Mechanical 65 Civil 98 Computer Science 64 b. b Write a shell script that accept a list of filenames as its argument. a “\” is to be appended as the indication of folding and the processing is to be continued with the residue. 11a.all levels must be searched. b Write a shell script that reports the logging in of a specified user within one minute after he/she log in. Write a shell script that determine the period for which a specified user is working on system and display appropriate message. If basic salary is < 10000 then HRA=15% of basic & DA=45% of basic If basic salary is >=10000 then HRA=20% of basic & DA=50% of basic. Write an awk script to compute gross salary of an employee accordingly to rule given below. Write a shell script that folds long lines into 40 columns. The order of the original lines must remain unchanged. Write a shell script that accepts as filename as argument and display its creation time if file exist and if it does not send output error message. 6a. Write an awk script to find out total number of books sold in each discipline as well as total book sold using associate array down table as given below. 9a. 10a. Write a shell script to find a file/s that matches a pattern given as command line argument in the home directory. starting and ending line number as an argument and display all the lines between the given line number. Write a shell script that accept the file name. display the contents of the file and copy the file into the directory ~/mydir b. Write an awk script to delete duplicated line from a text file. b. Thus any line that exceeds 40 characters must be broken after 40th. day and year. Write a shell script to list all the files in a directory whose filename is at least 10 characters. (use expr command to check the lenght) 7a. 5a. The input is to be supplied through a text file created by the user. display a suitable message. 8a. Question A & B Not to be included for examination 17 .questions. b) Modify the above document so that when an image is moved from the top stacking position. Text Formatting tags. a) Develop and demonstrate. it returns to its original position rather than to the bottom. Brach. 18 . Name of the College. Messages in the alert windows must be produced when errors are detected. Develop using JavaScript script. b) Create an XSLT style sheet for one student element of the above document and use it to create a display of that element. Year of Joining. Develop and demonstrate using JavaScript. a XHTML document that displays random numbers (integers). Links c. Marks : 50 Exam Hours : 3 Exam Marks : 50 1. using JavaScript script. a XHTML document that collects the USN ( the valid format is: A digit from 1 to 4 followed by two upper-case characters followed by two digits followed by two upper-case characters followed by three digits. b) Modify the above program to get the current semester also (restricted to be a number from 1 to 6. using JavaScript script. stacked on top of each other. Create a CSS style sheet and use it to display the document. it should rise to the top to become completely visible. Make up sample data for 3 students.A. a XHTML document that contains three images. an XHTML document that use of onload and onfocus events 8. Develop and demonstrate the usage of inline and external style sheet using CSS 3. Images d. Develop and demonstrate a XHTML file that includes JavaScript script for the following problems: a) Input: A number n obtained using prompt Output: The first n Fibonacci numbers b) Input: A number n obtained using prompt Output: A table of numbers from 1 to n and their squares using alert 4. Tables 2. a) Develop and demonstrate. 7. a) Design an XML document to store information about a student in an engineering college affiliated to VTU. The information must include USN. with only enough of each showing so that the mouse cursor can be placed over some part of them. and e-mail id.Web Programming Laboratory Subject Code Hours/Week : 3 Total Hours : 42 : 13MCA18 I. When the cursor is placed over the exposed part of any paragraph. no embedded spaces allowed) of the user. Create an XHTML page to demonstrate the usage of a. Name. b. Event handler must be included for the form element that collects this information to validate the input. 5. Write a Perl program which demonstrates the usage of scalar variables and arrays 10. 11. Write a CGI-Perl program to use a cookie to remember the day of the last login from a user and display it when run Note: In the examination each student picks one question from the lot of all 14 questions. Server Software. with proper headings. Write a Perl program to keep track of the number of visitors visiting the web page and to display this count of visitors. 19 . Server protocol.9.CGI Revision etc. Write a Perl program to display various Server information like Server Name. 14. Write a Perl program to display a digital clock which displays the current time of the server 12. 13. Write a Perl program to accept the User Name and display a greeting message randomly chosen from a list of 4 greeting messages. ADT for Varying length character Strings. Recursion etc. Sequences as Value Definitions. Implementing OneDimensional Arrays. Augenstein 20 . Sequential searching. Binary search. Priority Queues. Recursion 4 Hours Recursive definition and processes. Arrays : Array as an ADT. Non integer and non-homogenous lists.Deleting form a binary search tree. Implementing the push operations . Primitive operations. Priority queue. Examples for infix . Linked lists. Heap Sort. Interpolation search. Choosing a hash Function. Data Types.Converting an expression from infix to postfix. Insert operation. Tree searching: Inserting into a Binary Search Tree . Binary Trees 5 Hours Tree traversals. Hashing : Resolving hash clashes by open addressing. Using One-dimensional Arrays. and prefix expressions. Shell Sort. Towers of Hanoi problem. Queues and Lists 12 Hours The queue and its sequential representation. Testing for exceptional conditions . Inserting and removing nodes from a list. Searching an ordered table. Linked list as a data Structure. postfix. Properties of recursive definition or algorithm. Binary search. Handling of Character Strings and Character Strings The Stack 8 Hours Definition and examples . Program to convert an expression from infix to postfix. Text Books: 1. getnode and Freenode operations. AVL Tree and Operations.Implementing the pop operation. Fibonacci sequence. Sorting 8 Hours Bubble sort. Binary search. Double-ended Queues.Pointers and review of Pointers. Tree Sorting: Binary Tree Sort. allocating and freeing dynamic variables. Quick sort. Example. Linked lists using dynamic variables. Threaded binary trees and operations. Indexed sequential search. Header nodes. The stack as an ADT. Address Calculation Sort. Arrays as Parameters. Data Structures. Merge and Radix Sort. Applications of Stacks: Expression Evaluations. Queues.Program to evaluate a postfix expression . Basic definition and Examples . Linked implementations of stacks. Other list structures: Circular lists. Selection sort. Binary Search Tree and Operations. doubly linked lists. Insertion Sorts: Simple Insertion. Limitations of array implementation. Stack as a circular lists. Multiplication of natural numbers. Data Structures Using C and C++ by Yedidyah Langsam and Moshe J. Array implementation of a priority queue. Factorial function. the queue as ADT.SEMESTER II Data Structures Using C Sub Code : 13MCA21 Hrs/Week : 4 Total Hours : 52 IA Marks : 50 Exam Hours : 3 Exam Marks : 100 Introduction to Data Structures 10 Hours Information and its meaning: Abstract Data Types. Example of list operations. Application of Linked Lists: Stacks. Linked implementation of queues. Representing stacks . Red-Black Tree. Array implementation of lists. Searching 5 Hours Basic Search Techniques: Algorithmic Notations. Pearson Education Asia.and Aaron M Tenanbanum. 2002. 21 . 2nd Edition. C L Tondo. Data Structures and Algorithm Analysis in C. Mark Allen Weiss. Cengage Learning 3. 1997. Richard F Giberg and Behrouz A Forouzan: Data Structures – A Pseudo code Approach with C.Reference Books: 1. Robert Kruse. 2nd Edition. Bruce Leung and Shashi Mogalla: Data Structures and Program Design in C. Pearson Education 22 . 2nd Edition. Pearson Education Aisa. 2nd Edition. 2. Wiley India Publications 3. vectors. const & volatile qualifiers. input >>. STL: An overview. Inheritance & protected members.Object Oriented Programming Using C++ Sub Code : 13MCA22 Hours/Week : 4 Total Hours : 52 IA Marks : 50 Exam Hours: 3 Exam Marks: 100 Introduction 6 Hours Object Ori en t ed p a r a d i g m . --. Inheritance Virtual functions & Polymorphism 12 Hours Base Class. Class Objects. Addison Wesley. arrays and strings. expressions. reference variables. [ ] etc. Class Specification. Person Education. static data members. Polymorphism etc. Herbert Schildt: C++ The Complete Reference. output operator <<. returning objects.. f u n c t i o n templates. 2005. C++ Overview. inheriting multiple base classes. 23 . STL 8 Hours Exception handling fundamentals. friend functions & classes. 4th Edition. Object oriented programming with C++. 2007. Tata McGraw Hill. recursive functions. different data types. S t r u c t u r e d v s . overloading the input operator >>. Stephen Prata : C++ Primer Plus. scope resolution operator. file input & output. Classes & Objects 14 Hours Introduction. operators. Text Books: 1. Modular Programming with Functions Function C o m p o n e n t s . TMH. Granting access. Balaguruswamy. defining member functions. Encapsulation & data abstraction. 6th Edition. maps. using Virtual functions. constructors. Al Stevens: C++ Programming. a r g u m e n t p a s s i n g . Exception Handling. abstract classes. Operator overloading using friend functions such as ++. destructors. data hiding. Dynamic objects – Pointers to objects. Classes. Virtual attribute is inherited. Class members. functions. 4th Edition. overloading the output operator <<. 4. passing objects as arguments. Josee Lajore: C++Primer. Constructors. Virtual functions are hierarchical. containers. lists.Lippmann. parameterized constructors. Elements of Object Oriented Programming: Object. Exception handling options. protected base class inheritance. Destructors & Inheritance. pure virtual functions. manipulators. Object O r i e n t e d P a r a d i g m . 7 Hours function functions. Virtual base classes. Early & late binding. Passing parameters to base Class Constructors. 7th Edition. Virtual function -Calling a Virtual function through a base class reference. E. I/O Streams 5 Hours IO Stream basics. additional I/O operators. Class templates. access members. Inheritance. 2. i n l i n e o v e r l o a d i n g . Stanley B. arrays of objects. Reference Book: 1. Handheld Systems. Message Passing. Input and output. File – System Structure. System Threats. Allocation Methods. Disk Scheduling. Real . Security Issues. File systems. Segmentation with Paging. Memory management. Mutual Execution and Synchronization 6 Hours Principles o f C o n c u r r e n c y . Process management. Multiprocessor Systems. Access Methods.A. Inter-process communications. System Programs. Deadlock Avoidance. Processes and Threads. An Integrated Deadlock Strategy. M u t u a l E x c l u s i o n : Hardware S u p p o r t . Deadlock Detection. Contiguous Memory Allocation.Time Systems. Thrashing File – System Interface and Implementation 7 Hours File Concept. Segmentation. Virtual Machines. Readers/Writes Problem Deadlock and Starvation 4 Hours Principles of Deadlock. Operating System Structures: System Structures 5 Hours System Components. Program Threats. The Security Problem. Dining Philosophers Problem Memory Management 8 Hours Swapping. Process Description. Marks : 50 Exam Hours : 3 Exam Marks : 100 Introduction: Computer and Operating Systems 6 Hours Basic Elements. I/O Communication Techniques. Cache Memory. CPU Scheduler and Scheduling. Micro kernels. System Structure. Feature Migration. Demand Paging. Processor Registers.Operating Systems Subject Code: 13MCA23 Hours/Week : 4 Total Hours : 52 I. Operating – System Services. Execution of the Operating System. Secondary Storage. Computing Environments. Kernel modules. File – System Mounting. Process Control. Case study of Linux Operating system: 6 Hours Linux System . Free – Space Management. Mainframe Systems. S e m a p h o r e s . System Design and Implementation. Process Management 6 Hours Process. 24 . Distributed Systems. Paging. Deadlock Prevention. Design Principles. Directory Structure. Page Replacement. Introduction to Operating System. Allocation of Frames. The Memory Hierarchy. Protection. Clustered Systems. System Calls. Desktop Systems. File Sharing. Disk Management. Computer Security 4 Hours Disk Structure. File – System Implementation. Symmetric Multiprocessing(SMP). Process Creation. scheduling. User Authentication. Linux history . Process States. Instruction Execution. System Generation. Directory Implementation. Interrupts. M o n i t o r s . 25 . William Stallings. 2004 2. “Operating Systems – Internals and Design Principles” Pearson. 2012 26 . Gagne. Elmasri. 2012 Reference Books 1. “Operating Systems” Jaico Publishing House. Dhananjay M. 6th edition. Chakraborty . “Operating System Concepts” John Wiley. 2. 3rd Edition. 2012 3. Tata McGraw – Hill. Silberschatz. Dhamdhere. “Operating Systems – A Concept – Based Approach”. Levine. Sixth Edition. Carrick. 2011. “Operating Systems – A spiral Approach”. Galvin. Tata McGraw – Hill.Text Books 1. MASM Macro Processor.Dhamdhere: System Programming and Operating Systems.L. Implementation Examples . Expression.MS-DOS Linker. Machine Independent code Optimization.5.SIC Machine Architecture. Macro Processor Algorithm and Data Structures. 5.2. Compiler-Compilers.Dependent Loader Features – Relocation.Recursive Macro Expansion. Compilers 12 Hours Basic Compilers Functions. Conditional Macro Expansion. P-code Compilers. 3 (except 3.1. Bootstrap Loaders.A Simple SIC Assembler. Machine Dependent Assembler Features . Program Blocks. Dynamic Linkage. D.1 to 1.Beck: System Software. Machine dependent code Optimization.4) Reference Books: 1.Linkage Editor.Debugging Functions and Capabilities. A Simple Bootstrap Loader.3).4. Control Sections and Programming Linking. 1999 Edition.Overview of Editing Process. ANSI C Macro Processor. Implementation Examples .5.2 and 3. 5.3 (except 5.3).One-Pass Assembler. Machine-Independent Loader Features .Macro Definitions and Expansion.Design of an Absolute Loader. Syntactic Analysis. Editors And Debugging Systems 6 Hours Text Editors . Compiler Design Options.4). Implementation Examples .Purpose Macro Processors.Instruction Formats & Addressing Modes. Leland. User-Interface Criteria Macro Processor 8 Hours Basic Macro Processor Functions . Relationship With Other Parts Of The System. 5. SIC/XE Machine Architecture. Machine Independent Assembler Features – Literals. SymbolDefinition Statements. Loader Design Options .Grammars. 2 (except 2.) 5.A. Code Generation. Loaders and Linkers 8 Hours Basic Loader Functions . Macro Processing Within Language Translators.3.Automatic Library Search.MASM Assembler. 3rd Edition.5. User Interface.M.Hill.3.2 and 2. Simplified Instructional Computer (SIC) . Editor Structure.Structured variables. Machine Independent Compiler Features. Keyword Macro Parameters. Assemblers 12 Hours Basic Assembler Function .Division into passes. Macro Processor Design Options . 5. Marks : 50 Exam Hours : 03 Exam Marks : 100 Machine Architecture 6 Hours Introduction. Machine Dependent Compiler Features. Multi-Pass Assembler. SIC Programming Examples. Addison-Wesley. Loader Options.3. Program Linking. 27 .3. Assembler Algorithm and Data Structures. Text Books: 1. (Chapters 1. System Software and Machine Architecture. 1997. 4 (except 4. Assembler Design Operations . Generation of Unique Labels. Machine-Independent Macro Processor Features – Concatenation of Macro Parameters. Machine. Algorithm and Data Structures for a Linking Loader. Program Relocation. General. Lexical Analysis. Interpreters.3.5.Intermediate Form of the Program.System Software Subject Code: 13MCA24 Hours/Week : 04 Total Hours : 52 I. 2nd Tata McGraw . Interactive Debugging Systems . 28 .. 19) 29 . Schemas and Instances. Dynamic SQL. When not to use a DBMS. Three-Schema Architecture and Data Independence. Naming Conventions and Design Issues. Examples of Queries in Relational Algebra. Boyce-Codd Normal Form Unit-6: PL/SQL 6 Hours Introduction. 9.8.5. Relational Model Constraints and Relational Database Schemas. 9. A brief history of Database Applications.1. triggers. Specifying Constraints in SQL. Centralized and Client-Server Architectures for DBMSs. Roles and Structural Constraints. Attributes and Keys. Relationship Types of Degree Higher than Two. (Chapters 1. Creating and planning PL/SQL.4.1 to 6. Embedded SQL. Text Books: 1. Relational Database Design Using ER. procedures. Advantages of using DBMS approach. Characteristics of Database approach. Pearson Education. Refining the ER Design for COMPANY Database.1. 18. 18 except 18. 6. Relationship Sets. Iterative processing and loops.Marks : 50 Exam Hours : 03 Exam Marks : 100 7 Hours Unit-1: Introduction An example. Unary Relational Operations: SELECT and PROJECT. Transactions and Dealing with Constraint Violations. Schema Change Statements in SQL.5. Exception handlers.to-Relational Mapping Unit-3: Relational Model and Relational Algebra 12 Hours Relational Model Concepts. Unit-5: Database Design 8 Hours Informal Design Guidelines for Relation Schemas. 17. General Definitions of Second and Third Normal Forms. Unit-4: SQL 12 Hours SQL Data Definition and Data Types. Functions. 9. Additional Relational Operations.2 except SQLJ. Database Languages and Interfaces.6. Entity Types. Elmasri and Navathe: Fundamentals of Database Systems. Normal Forms Based on Primary Keys. More Complex SQL Queries. Insert. Language fundamentals. Functional Dependencies. 8. Specifying Constraints as Assertions and Triggers. 7. 10. Actors on the screen. Relationship Types. Database Stored Procedures and SQL / PSM. 5th Edition. The Database System Environment. 3 except 3. Weak Entity Types. Workers behind the scene. Update Operations. ER Diagrams. Additional Features of SQL. Basic Queries in SQL. Classification of Database Management Systems Unit-2: Entity-Relationship Model 7 Hours Using High-Level Conceptual Data Models for Database Design. Views (Virtual Tables) in SQL. 2007. Database Programming: Issues and Techniques. Relational Algebra Operations from Set Theory. An Example Database Application. Data Models. Binary Relational Operations: JOIN and DIVISION.A. conditional and sequential control. Entity Sets.Database Management Systems Subject code : 13MCA25 Hours/Week : 04 Total Hours : 52 I.7. Delete and Update Statements in SQL. 2. 3rd Edition. 2003 2. Mc-GrawHill.Reference Books: 1. McGraw-Hill. Korth and Sudharshan: Data base System Concepts. Implementation and Management by Coronel. 2006. 3. Morris. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems. 5th Edition. Database Principles Fundamentals of Design. Silberschatz. RobCengage Learning 2012 30 . Solve Towers of Hanoi Problem c. 5. Implement quick sort. 3. Simulate the working of circular queue providing the following operations–Insert. Evaluate a given postfix expression and its values for the variables. 11. 7. 8.Data Structures Using C Laboratory Sub. Display Insert is mandatory. Simulate the working of a linked list providing the following operations a. Delete from the beginning b. Binary Search 13 Write a Program to a) Create AVL Tree b) Insert element to AVL tree c) Find the height of the AVL tree 31 . 12. Convert a prefix notation to postfix notation. Calculate the sum for a given number ‘n’ from 1 to n. Insert before a given element d. Delete and Display. Simulate the working of a double linked list to implement stack and queue. Delete a given element d. Insert at the position e. Display 6. Insert at the beginning b. Delete from the end c. 9. preorder and postorder. Create a binary tree and implement the tree traversal techniques of inorder. Implement Heap sort. 2. 10. Demonstrate recursion a. Insert at the end c. 4. Simulate the working of a dequeue. Calculate GCD and LCM of 3 integer numbers b. Code: 13MCA26 Hours/Week : 3 Total Hours : 42 IA Marks : 50 Exam Hours : 03 Exam Marks : 100 Write a C program to 1. Delete every alternate element e. Linear Search b. Implement the search techniques of a. Simulate the working of a circular linked list providing the following operations a. Each song is performed by one or more musicians. UGC/AICTE/. an ending date. B-flat. Projects have a project number. A musician may produce several albums. c) List the different instruments played by the musicians and the average number of musicians who play the instrument. Suitable tuples have to be entered so that queries are executed correctly The results of the queries may be displayed directly lA Marks: 50 Exam Hours: 3 Exam Marks: 50 Exercise: 1 Notown Records has decided to store information about musicians who perform on its albums. a copyright date and a format (e. an address. an age. Each professor can supervise many students.). Each song recorded at Notown has a title and an author. 4. and a budget. a starting date. 32 . guitar.. and a given instrument may be played by several musicians.). Draw ER diagram based on given scenario with various Constraints. a name (e. a name. Each project is worked on by one or more professors (known as the project's co-investigators). 5. Queries a) List musician name.. b) List the details of songs which are performed by more than 3 musicians... and a research specialty. a name. Professors can manage/work on multiple projects. but no song may appear on more than one album. Each project is managed exactly by one professor (known as the project's principal investigator).g. d) Retrieve album title produced by the producer who plays guitar as well as flute and has produced no of songs greater than the average songs produced by all producers.. Exercise: 2 Professors have a PROFID. E-flat). Each album has a number of songs on it. MCA/ MPhil/BE/ME . 3. Each musician may play several instruments. title of the song which he has played.g. a name. e) List the details of musicians who can play all the instruments present. a rank. C. and a phone number.Database Laboratory Sub code : 13MCA27 Hours/week : 3 Total hours : 42 Instructions for the Exercises: 1.g. flute) and a musical key (e. No musician has more than one phone. a title. Each instrument used in songs recorded at Notown has a unique identification number.. 2. and a degree program (e. A student who is working on a project can be supervised by only one professor. CD or MC). an age. Each project is worked on by one or more graduate students (known as the project's research assistants). the album in which song has occulted. synthesizer. and a musician may perform a number of songs. Graduate students have an USN.g. Graduate students can work on multiple projects. Perform the given queries using any RDBMS Environment. Each musician that records at Notown has an SSN. Create Relational Database Schema based on the above scenario using Mapping Rules.g. Each album has exactly one musician who acts as its producer. Each album recorded on the Notown label has a unique identification number. a sponsor name (e. and the trade name identifies a drug uniquely from among the products of that company. Other details like name. Each patient is checked up by some doctor. and phone number. c) List the professors and sum of the budget of their projects started after 2005 but ended in 2010. b) Retrieve the names of all graduate students along with their professors under whom they work and project sponsor. A customer can open different kinds of accounts with the branches. Make suitable assumptions and use them in showing maximum and minimum cardinality ratios. addresses. an end date. A customer can take more than one type of loan and a loan can be given to more than one customer. Doctors prescribe drugs for patients. A drug could be sold at several pharmacies. A pharmaceutical company can contract with several pharmacies. For each doctor. e) Retrieve the names of customers who have accounts in all the branches located in a specific city. and ages must be recorded. and years of experience must be recorded. you have to store a start date. specialty. name. it has an address and one phone number.Queries a) Retrieve the names of all professors who do not have an ongoing project of more than 1 lakh. and their names. address. A doctor could prescribe one or more drugs for several patients. and the price could vary from one pharmacy to another. Queries: a) List the details of customers who have joint account and also have at least one loan. and a pharmacy can contract with several pharmaceutical companies. Exercise: 3 A bank has many branches and a large number of customers. d) List the name of branch along with its bank name and total amount of loan given by it.' Exercise: 4 Patients are identified by an SSN. 33 . Age is used as a factor to check whether customer is a major. There are different types of loans. Each pharmaceutical company is identified by name. Each drug is sold by a given pharmaceutical company. Each prescription has a date and a quantity associated with it. each identified by a loan number. Every doctor has at least one patient. Customers are identified by their SSN. Pharmaceutical companies have long-term contracts with pharmacies. and a patient could obtain prescriptions from several doctors. address and phone for each bank are also stored. Each branch is identified by its bank. the name. For each drug. the trade name and formula must be recorded. Bank is identified by its code. supervisor and the text of the contract. Loans have a duration and interest rate. b) List the details of the branch which has given maximum loan. Branch has name. Each pharmacy sells several drugs and has a price for each. For each contract. Each pharmacy has a name. c) List the details of saving accounts opened in the SBI branches located at Bangalore. address and phone number. Doctors are identified by an SSN. An account can belong to more than one customer. address and phone. d) List the names of professors who has a total worth of project greater than the average budget of projects sanctioned e) List the professors who work on all the projects. b) List the details of actors who acted in movies having same titles but released before 2000 and after 2010. e) Retrieve the names of directors directed all the movies produced by any one production company. Each director directs one or more movies. Note: In the examination each student picks one question from a lot of 5 exercises. Exercise. Queries: a) List the details of horror movies released in 2012 and directed by more than 2 directors. c) List the details of production companies producing maximum movies.Queries: a) List the details of patients who are 20 years old and have been checked by eye-specialist. c) List the details of pharmaceutical companies who supply drug to more than 10 pharmacies in the same city where company is located. Directors are identified by id.). Production companies are identified by name and each has an address. d) List the details of drug supplied by only one pharmaceutical company. d) List the details of movies where director and actor have same date of birth. Each movie has a plot outline. Each actor acts in one or more movies. Other details like name and date of birth of directors are also stored. Actors are identified by id. Each movie has length in minutes and classified under one genres (like action. Each movie has one or more actors and one or more directors and is produced by a production company. Each actor has a role in movie. 34 . horror etc. 5 Data requirements of movie industry are captured. e) List the details of drug supplied by all pharmaceutical companies. b) List the details of doctors who have given the prescription to more than 20 patients in year 2013. Other details like name and date of birth of actors are also stored. Each movie is identified by title and year of release. A production company produces one or more movies. Name. Implement the following operations by overloading the operators ‘+’ and ‘--‘: (i) s1 = s1 + element. Demonstrate all the functions after creating a LIST object. 5. Define a STUDENT class with USN. (i) OCTAL h = x. 6. ‘--‘operator pops the element. If (m1==m2) then m3 = m1+m2 and m4 = m1-m2 else display error. Write a C++ program to create a class called OCTAL which has the characteristics of an octal number. Handle the STACK empty and full conditions. Using appropriate functions. Display the results by overloading the operator <<. 9. where h is an OCTAL object and k is an integer Display the OCTAL result by overloading the operator <<. Implement the following operations by overloading the operator ++ which checks the compatibility of two matrices to be added and subtracted. Demonstrate the operations by displaying the 35 . Using the member functions. (ii) int y = h + k. Print the USN. where s1 is an object of the class STACK and element is an integer to be pushed on the top of the stack (ii) s1 = --s1 . 8. Write a C++ program to create a class template called QUEUE with member functions to add an element and to delete an element from the queue. 7.A Marks : 50 Exam Hours : 3 Exam Marks : 50 1. Declare an array of 10 STUDENT objects. s2) – where ‘a’ is an integer (real part) and s2 is a complex number (ii) ADD (s1. find the average of the two better marks for each student. 2.OOP Using C++ Laboratory Subject Code: 13MCA28 Hours/Week : 3 Total Hours : 42 I. by overloading the << operator. Create a class called MATRIX using two-dimensional array of integers. Also display the values of h and y. Perform the addition and subtraction by overloading the + and – operators respectively. Write a C++ program to create a class called STACK using an array of integers. Implement the following operations by writing an appropriate constructor and an overloaded operator +. Write a C++ program for scalar multiplication of two vectors using operator overloading. Name and the average marks of all the students. Write a C++ program to create a class called LIST (linked list) with member functions to insert an element at the front and delete an element from the front of the list. where s1 is an object of the class STACK. 4. Also display the contents of the stack after each operation. implement a queue of integers and double. Write a C++ program to create a template function for Bubble Sort and demonstrate sorting of integers and doubles. where x is an integer. Write a C++ program to create a class called COMPLEX and implement the following overloading functions ADD that return a complex number: (i) ADD (a. s2) – where s1 and s2 are complex numbers 3. and Marks in 3 tests of a subject. Define a base class STACK1 which performs only push. 12. Override the above operations through a derived class STACK2 which takes care of STACK FULL & STACK EMPTY situations. Use this class in a main function to show the above operations. read and write the data and to calculate the net salary. Enter the data for at least 5 students. Using inheritance. The main() function should create array of base class pointers/references to invoke overridden functions and hence to implement run-time polymorphism. display operations. to find intersection of 2 objects of SET using operator overloading (S4= S1*S2). EmpID and BasicSal and a pure virtual function Cal_Sal(). pop. Name and Age. Define a class SET with Data members: array of int. to find union of 2 objects of SET using operator overloading (S3=S1+S2).Create two derived classes MANAGER (with data members: DA and HRA) and SALESMAN (with data members: DA. Display the results after every operation by overloading the operator <<. and Member functions: to read element of a SET object. HRA and TA). Fees and Stipend. 14. S2. (i) STRING s1 = “VTU” (ii) STRING s2 = “BELGAUM” (iii) STRING s3 = s1 + s2 (Use copy constructor) 13. 10. to print elements of a SET object. S3 and S4 are objects of SET. S1. Write a C++ program to create a class called STUDENT with data members USN. 36 . Note: In the examination each student has to pick one question from a lot of all the 14 questions. Write a C++ program to create a class called STRING and implement the following operations. Show how the objects of these classes use the above functions in a main function. Write appropriate constructors and member functions to initialize the data. int variable to indicate number of elements in a SET object. Find the semesterwise average age for all UG and PG students separately. 11.contents of the queue after every operation. create the classes UGSTUDENT and PGSTUDENT having fields as Semester. Create an abstract base class EMPLOYEE with data members: Name. communication media. 4. David J Wetheral.2. 2. Quality of Service. Medium Access Sub Layer 4 Hours Multiple access protocols and Examples : Ethernet. Guided and Wireless transmission.3G and 4G). Total Hours : 52 Hrs. Analog and Digital Data Transmission . 3.7. Internetworking and The Network Layer in the Internet The Transport Layer 12 Hours The Transport Service. The Internet Transport Protocol: UDP. IA.Network Protocol Stack ( TCP/IP and ISO-OSI).2G. 2004 Chapter 3 Reference Books 1. Elements of Transport Protocols. by NATALA OLIFER and VICTOR OLIFER .SEMESTER III Computer Networks Subject Code: 13MCA31 Hours/Week : 4 Hrs. Congestion Control.3. 3. Pearson 2012 Chapter 1. Broadband Wireless and bluetooth.Classification of Computer Networks .8 Chapter 5. 4. 4.Network Standardization and Examples of Networks. 4. 3.5. 5th Edition. Above 7th edition . Chapter 6 ( excluding 6.3. Email. Network Layer 14 Hours Network Layer Design issues.Marks : 50 Exam Duration : 3 Hrs Examination Marks : 100 Introduction to Computer Networks 3 Hours Networking Devices .Streaming audio and Video and Content Delivery 4 Hours Text Books 1. 2010 2. http://www.html relevant RFC document could be used to get more detailed information about any of the concepts prescribed in the syllabus like RFC 2460 can be referred to get a detailed information about IPV6 37 .7) 2 “Data and Computer Communications” by William Stallings . Data Link layer 5 Hours Error Detection and Correction Codes. Data Link Layer Switching. Digital modulation techniques (FDMA.5. 4. Congestion Control Algorithms. “Computer Networks” by Andrew S Tanenbaum.CDMA) and mobile telephone systems (1G.2. 3.Transmission Impairments and Channel Capacity.Technologies and Protocols for Network Design.1. 2. Wireless LAN.3.ietf. Performance Issues.Data Link Protocols and Sliding window protocols. 2. Physical Layer 10 Hours Data Transmission Concepts.2.TDMA.4.org/rfc. Routing algorithms.WWW. 2.4. 4.6. The application Layer DNS.The Internet Transport Protocols – TCP. “Computer Networks” Principles. 38 . A Closer Look at Variables. Using Abstract Classes. The Key Attributes of Object-Oriented Programming. if-else-if Ladder. StringBuffer and String Builder. Obtaining the characters within a string. Using Parameters. do-while Loop. Operator Precedence. Returning Objects. Marks: 50 Exam Hours : 3 Exam Marks : 100 Java Programming Fundamentals 2 Hours The Java Language. Reference Variables and Assignment. Assigning Array References. Member Access and Inheritance. More Data Types and Operators 2 Hours Arrays. A First Simple Program. Overridden Methods support polymorphism. The For-Each Style for Loop. When are Constructors Executed. Introducing Data Types and Operators 1 Hour Java’s Primitive Types. The Java Development Kit. Identifies in Java. Objects and Methods 3 Hours Class Fundamentals. using indexOf() and lastIndexOf(). Creating a Multilevel Hierarchy. Program Control Statements 1 Hour Input characters from the Keyword. The Java Class Libraries. Changing the case of characters within a string. Varargs: Variable-Length Arguments. Overloading Constructors. How Arguments are passed. Strings. Using super to Call Superclass constructors. Handling Syntax Errors. Using super to Access Superclass Members. Literals. Inheritance 6 Hours Inheritance Basics. Switch Statement. Multidimensional Arrays. String Handling 2 Hours String Fundamentals. Recursion. Constructors and Inheritance. The Object Class. The this Keyword. Using Cast.A. The new operator Revisited. While Loop. The Scope and Lifetime of Variables. Garbage Collection and Finalizers. Methods. if statement. Returning Value. Nested ifs. A Closer Look at Methods and Classes 3 Hours Controlling Access to Class Members. Using final. Why Overridden Methods. The Bitwise operators. Use continue. Three String-Related Language Features. Expressions. Nested Loops Introducing Classes. Introducing Nested and Inner Classes. Alternative Array Declaration Syntax. Returning from a Method. for Loop. Method Overloading. Use break. Superclass References and Subclass Objects. String comparison. Nested switch statements. Method Overriding. Pass Objects to Methods. Using the Length Member. Understanding Static. The Java Keywords. Shorthand Assignments.Programming using JAVA Subject Code : 13MCA32 Hours/Week : 4 Total Hours : 52 I. The String Constructors. Parameterized Constructors. Type conversion in Assignments. Enhanced for Loop. operators. Constructors. How Objects are Created. The Length() Method. A first simple swing Example. Static Import Exception Handling 4 Hours The Exception Hierarchy. The Collection Interfaces.net 3 Hours Networking fundamentals. Interfaces can be extended. A Closer look at Throwable. Generic Constructors. Trees. instance variables and enumerations. Swing Fundamentals 4 Hours The origin and Design philosophy of swing. Constructors. Thread Priorities. Annotations (metadata) Generics 2 Hours Generics Fundamentals Bounded Types. 39 J . Nested Interfaces. Components and containers. The Arrays Class. wait() and notify All(). Thread Communication using notify(). Exploring Collection Framework 3 Hours Collections Overview. suspending. using finally. Creating Thread. Exception Handling Fundamentals. The Socket Class. Final Thoughts on Interfaces. Using Interface References. Implementing Multiple Interfaces. Auto boxing and Annotations 4 Hours Enumerations. Synchronization. The Values () and Valueof () Methods. Auto boxing. New Exception features added by JDK 7. Exploring Swing Controls-JLabel and ImageIcon. The Consequences of an Uncaught Exception. Generic Methods. Packages and Member Access. using the status window. Requesting Repainting.Interfaces 3 Hours Interface Fundamentals. Multithreaded Programming 4 Hours Multithreading fundamentals. Text Books: 1. Determining When a Thread Ends. A key Aspect of an Applet Architecture. The URLConnection Class. Constants in Interfaces. Applets 2 Hours Applet basics. The HttpURL Connection Class. Applet Initialization and Termination. using Multiple catch clauses. Catching subclass Exceptions. The Synchronized Statement. methods. Networking with Java. Implementing an Interface. Throwing an Exception. Passing parameters to Applets. Java Enumeration are class types. The collection Classes. Creating an Interface. A complete Applet Skeleton. The Thread Class and Runnable Interface. Enumerations. Java’s Built-in Exceptions. using Synchronization Methods. The Swing Buttons. Creating Exception Subclasses. Packages 3 Hours Package Fundamentals. The Networking classes and Interfaces. Event Handling. The URL class. try blocks can be nested. Exceptions Enable you to handle errors gracefully. Some Generic Restrictions. Layout managers. Resuming and stopping Threads. Importing Packages. The InetAddress class. Creating Multiple Threads. using throws. 17.6. Black Book.11.2.23.13. 5.ava Fundamentals. 2. Programming with Java by T V Suresh Kumar. second edition. Sanguine Technical Publishers. B Eshwara Reddy and P Raghavan. 4 Java 6 Programming.24.14.15.3. Wiley 40 . 2011. 2012.26) Reference Books: 1.5. Dale Skrien.18. Programming in JAVA2 by Dr K Somasundaram .4.10.12.9. Cay Hortsmann.Jaico publications 3. Java Programming by Hari Mohan Pandey. (Chapters: 1. Tata McGraw Hill Edition 2013. Java 2 Essentials.22. Pearson Education. A comprehensive Introduction by Herbert Schildt. 2012.7.8.25. KoGenT . dreamtech Press. White-box testing. Marks : 50 Exam Hours : 3 Exam Marks : 100 1. Black-box testing. detailed design. Software architecture: the role of software architecture. Client-server computing. 6. Component-based software engineering 04 hours Components and component model. architectural views. 4. Process activities. Planning a software Project 04 hours Process planning. Model-driven engineering. component and connector view. Interaction models. Wiley – India. W i l e y I n d i a P v t L t d ( 2 0 1 0 ) (Chapters-:4. matrix (Complexity matrix for function oriented design). 5. Requirement elicitation and analysis.A. 6. Project scheduling and staffing. Roger S Pressman: Software Engineering-A Practitioners approach. The software requirements document. The rational Unified process. IEEE/ ACM code of software engineering ethics. Extreme Programming. case studies 2. Risk Management.Software Engineering Subject Code: 13MCA33 Hours/Week: 4 Total Hours : 52 I. CBSE process. 17. Agile methods. Software as a service.2. Requirements Engineering 06 hours Functional and non-functional requirements. Testing process 04hours Text Books: 1. 18) 2. software engineering diversity.Design: Design concepts. incremental development. Software Process & Agile Software Development 10 hours Software Process models: waterfall. reuses oriented. 3rd Edition. System Modeling. 3. 2010. Overview 03 hours Introduction: Professional Software Development Attributes of good software. 6. Ian Sommerville : Software Engineering. Requirements engineering processes. Plan-driven and agile Development. Quality plan. Requirements specification. 2. 6. 8. Architectural patterns for distributed systems. Requirements validation.1. Coping with change. Component composition 6. Architectural Design & Design and implementation 16 hours Context models. Project monitoring plan. Software configuration management plan. Documenting architectural design. Hans Van Vliet: Software Engineering Principles and Practices. Requirements management 4. Pankaj Jalote: S o f t w a r e e n g i n e e r i n g . verification. 7. Software Testing Testing fundamentals. 3. McGraw-Hill. 9th edition. (Chapters-: 1. 2. Person Education Ltd.5. Behavioral models. Distributed Software engineering 05 hours Distributed system issues.6) Reference Books: 1. 2011. Effort estimation. Function oriented design. Structural models. 2010 41 . Architectural styles for C&C view. 5. Agile project management. Scaling agile methods. 6th edition. 3 Software Engineering architectural driven software developments by R Schmidt 42 Computer Graphics Subject Code : 13MCA34 Total Hours : 52 Hours/Week : 4 I.A. Marks: 50 Exam Hours: 3 Exam Marks: 100 12 Hours Graphics Output Primitives and Attributes Introduction to open GL, Coordinate reference frames, Specifying two dimensional world coordinate reference frame in Open GL, Open GL point functions, Open GL line functions, Line drawing algorithms, Circle generation algorithms, Ellipse generation algorithms, Fill area primitives, Polygon fill areas, OpenGL polygon fill area functions, General scan line polygon fill algorithm, Fill methods for areas with irregular boundaries, Open GL fill area attribute functions Two – Dimensional and Three - Dimensional Geometric Transformations 12 Hours Basic two dimensional geometric transformations, Matrix representations and homogeneous coordinates, Inverse transformations, Two dimensional composite transformations, Other two dimensional transformations, Three dimensional Translation, Rotation, Scaling, Other three dimensional transformations, Affine transformations, Open GL geometric transformation functions 10 Hours Two Dimensional Viewing The two dimensional viewing, Clipping window, Normalization and viewport transformations, Clipping algorithms, Two dimensional point clipping, Two dimensional line clipping algorithms, Polygon fill area clipping, Curve clipping, Text clipping 10 Hours Three Dimensional Viewing The three dimensional viewing concepts, Three dimensional viewing pipeline, Three dimensional viewing coordinate parameters, Transformation from world to viewing coordinates, Projection transformations, Orthogonal projections, Oblique parallel projections, Perspective projections, The viewport transformation and three dimensional screen coordinates 08 Hours Curves and Computer Animation Bezier spline curves, Raster methods for computer animation, Design of animation sequences, Traditional animation techniques, General computer animation functions Text book: Donald Hearn, M.Pauline Baker, Computer Graphics with Open GL, Pearson (Indian Edition), Third Edition. Chapters and topics [2.9, 3.1-3.5, 3.9, 3.10, 3.14-3.16, 4.10, 4.13, 4.14, 5.1-5.5, 5.10-5.15, 5.17, 6.1-6.3, 6.5-6.10, 7.1-7.9, 8.10, 13.1-13.4] Reference Books: 1. Edward Angel, ‘Interactive Computer Graphics’ – A top down approach using Open GL, Pearson, Fifth Edition 2. Peter Shirley, Steve Marschner, 'Computer Graphics, Cengage Learning (Indian edition), 2009. 43 UNIX System Programming Subject Code : 13MCA351 Hours/Week : 4 Total Hours : 52 I.A. Marks : 50 Exam Hours : 03 Exam Marks : 100 Introduction 6 Hours UNIX and ANSI Standards: The ANSI C Standard, The ANSI/ISO C++ Standards, Difference between ANSI C and C++, The POSIX Standards, The POSIX.1 FIPS Standard, The X/Open Standards. UNIX and POSIX APIs: The POSIX APIs, The UNIX and POSIX Development Environment, API Common Characteristics. UNIX Files 6 Hours File Types, The UNIX and POSIX File System, The UNIX and POSIX File Attributes, Inodes in UNIX System V, Application Program Interface to Files, UNIX Kernel Support for Files, Relationship of C Stream Pointers and File Descriptors, Directory Files, Hard and Symbolic Links. UNIX File APIs 7 Hours General File APIs, File and Record Locking, Directory File APIs, Device File APIs, FIFO File APIs, Symbolic Link File APIs, General File Class, regfile Class for Regular Files, dirfile Class for Directory Files, FIFO File Class, Device File Class, Symbolic Link File Class, File Listing Program. UNIX Processes 7 Hours The Environment of a UNIX Process: Introduction, main function, Process Termination, Command-Line Arguments, Environment List, Memory Layout of a C Program, Shared Libraries, Memory Allocation, Environment Variables, setjmp and longjmp Functions, getrlimit, setrlimit Functions, UNIX Kernel Support for Processes. Process Control 7 Hours Introduction, Process Identifiers, fork, vfork, exit, wait, waitpid, waited, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs and Group IDs, Interpreter Files, system Function, Process Accounting, User Identification, Process Times. Process Relationships: Introduction, Terminal Logins, Network Logins, Process Groups, Sessions, Controlling Terminal, tcgetpgrp, tcsetpgrp, and tcgetsid Functions, Job Control, Shell Execution of Programs, Orphaned Process Groups. Signals and Daemon Processes 7 Hours Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction, The SIGCHLD Signal and the waitpid Function, The sigsetjmp and siglongjmp Functions, Kill, Alarm, Interval Timers, POSIX.lb Timers. Daemon Processes: Introduction, Daemon Characteristics, Coding Rules, Error Logging, Single- instance daemons; Daemon conventions; Client-Server Model. Interprocess Communication 6 Hours Introduction; Pipes, popen, pclose Functions; Coprocesses; FIFOs; XSI IPC; Message Queues; Semaphores Network IPC: Sockets 6 Hours Introduction; Socket Descriptors; Addressing; Connection establishment; Data transfer; Socket options; Out-of-band data; Nonblocking and asynchronous I/O. 44 5. 8. Pearson Education / Prentice-Hall of India. 9. 8. Rago: Advanced Programming in the UNIX Environment. (Chapters 1.Richard Stevens. 9) 2. 13. (Chapters 7. 2nd Edition. 7. 6. 1999. W.Text Books: 1. 16) 45 . Prentice-Hall of India / Pearson Education. Terrence Chan: Unix System Programming Using C++. 15. Stephen A. 2005. Multiversion Concurrency Control Techniques.Advanced Topics In DBMS Sub Code : 13MCA352 Hrs/Week : 04 Total Hours : 52 IA Marks : 50 Exam Hours : 03 Exam Marks : 100 Over view of Storage and Indexing. Duplicates. Tree Structured Indexing 7 Hours Intuition for tree indexes. Tools to assist in index selection. Extendible hashing. Shadow Paging. General selection conditions. B+trees.. Disks and Files 7 Hours Data on external storage. 46 . Index data structures. comparisons 4 Hours Overview of Query Evaluation. Algorithm for relational operations. Nested sub-queries. Characterizing Schedules based on Serializability. Relational algebra equivalences. Recovery in Multidatabase Systems. Choices in tuning queries and views. The ARIES Recovery Algorithms. Indexes that enable index-only plans. Transaction and System Concepts. Recovery Concepts. other approaches to query optimization. Concurrency Control based on Timestamp Ordering. The Join operation. Recovery Techniques based on Immediate Update. The Projection operation. Page formats and record formats. Recovery Techniques based on Deferred Update. Alternative plans. A motivating example. External Sorting 5 Hours The system catalog. Estimating the cost of a plan. Linear hashing. Clustering and indexing. Introduction to query optimization. Indexed sequential access method. Impact of concurrency. what a typical optimizer does. Insert. Database Backup and Recovery from Catastrophic Failures. File organizations and indexing. Overview of database tuning. Transaction Management 6 Hours Introduction to Transaction Processing. Files of records. Physical Database Design and Tuning 6 Hours Introduction. Buffer manager.examples. The Set operations. Enumeration of alternative plans. Validation Concurrency Control Techniques. Choices in tuning the conceptual schema. External merge sort Evaluating Relational Operators 4 Hours The Selection operation. Aggregate operations. Guidelines for index selection . B+tress in practice Hash-Based Indexing Static hashing. Characterizing Schedules based on Recoverability. Delete. RAID. Introduction to operator evaluation. Granularity of Data Items and Multiple Granularity Locking. DBMS benchmarking. The impact of buffering. Search. Indexes and performance tuning Memory hierarchy. Comparison of file organizations. Two-Phase Locking Techniques for Concurrency Control. When does a DBMS sort data? A simple two-way merge sort. Desirable Properties of Transactions. A Typical Relational Query Optimizer 7 Hours Translating SQL queries in to Relational Algebra. Disk space management. 3 Edition.3. Text Books: rd 1.12.More Recent Applications 6 Hours Mobile databases. 47 .9. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems. Conolly and Begg: Database Systems.2002. Elmasri and Navathe:Fundamentals of Database Systems. (Chapters 8.5th Edition. McGraw-Hill.15. Pearson Education.11. 14. Multimedia databases.1 to 13. Geographical Information Systems.10.4th Edition. Pearson Education.20) 2. Genome data management. (Chapter 30) Reference Books: 1. 2007.2003.13. Marketplaces. MIS and the user. Functional business system.Basics of MIS and E-Commerce Subject Code: 13MCA353 Hours/Week: 4 Total Hours: 52 I. E-Commerce Marketing Techniques. Search product catalogue. and Communities. methods of data and information collection. . XML. value of information. General model of a human as information processor. MIS in Web environment. Organization as system. Supply chain management (real world cases for the above) Client Server Architecture and E-business Technology 8 Hours Client server architecture. Introduction to E-business. Management as a control system. classification of information. Building product catalogue. Text Books: 1. Security and Encryption. Behavioral concepts in decision making. Personal Web Server (PWS). ECommerce Infrastructure: The Internet and World Wide Web. Definition. Electronic Business systems 5 Hours Enterprise business system – Introduction. online accounting system. E-Commerce techniques and Issues 9 Hours Introduction to Active Server Pages (ASP). DSS components. Building an E-Commerce Web Site. real world case. Web design. Shopping Carts. Electronic.Introduction. E-commerce Business Models and Concepts. Ethical. Customer relationship management. 9 Hours E-Commerce Introduction Course overview. Web Spider and search agent. E-Commerce Payment Systems. Business-to-Business ( B2B). MIS: organization effectiveness Decision Making and DSS 4 Hours Decision making concepts. JavaScript Internet Information Server (IIS). 3rd Edition. Digital Government. Marks : 50 Exam Hours : 3 Exam Marks : 100 Information and Knowledge 4 Hours Information concepts. HRM. implementation strategies. E-Commerce Applications: Business-to-Consumer (B2C). Introduction of MIS 4 Hour MIS: Concept. Decision structure. Management reporting alternatives. information: A quality product. Intranet/Extranet. Impact of MIS. Waman S Jhawadekar: Management Information System. Introduction to e-commerce. Role of the MIS. decision making process.A. Impact of Web on Strategic management. cross-functional enterprise applications. decision-making by analytical modeling. sales force automation. internet and World Wide Web. Tata McGraw Hill 48 . model of Ebusiness. Consumer-to-Consumer (C2C). Management effectiveness and MIS. marketing systems. MIS support to the management. CIM. Web enabled business management. organizational decision-making. ERP. Social and Political Issues in ECommerce Internet Communication 9 Hours Transaction Systems. Knowledge. Web Security. R.2. Tharam Dillon. 3. 2010 . Wiley India. 2001 Reference Books: 1. 4th Edition. 2001 4. 2003 4. Ralph M Stair and George W Reynolds: Principles of Information Systems. E-Business and E-Commerce: How to Programe. Thomson. Nieto. Raymond Lee. . and Potter. Elizabeth Chang: E-Commerce Fundamentals and Applications. P.The Foundation of E-Business. Managing Information Systems in Business. 7th Edition. Pearson Education. 3. Tata McGraw Hill. M. 7th Edition. second edition. James A O’Brien and George M Marakas: Management Information System. 2006. Henry Chan. Deitel. Government and Society. Introduction to E-Commerce. H. J. Wile India Edition 2. 49 . Rainer. Rahul De. Steven Alter: Information Systems . Prentice hall. Turban. Deitel and T. 3. 3. special cases in the simplex method. 7.1-14. primal dual relationship. testing the model. extensions Text Books: 1.4. deriving solutions from the model. 14. examples. 13. 2003. 2. games with mixed strategies. 6.Operations Research Subject Code: 13MCA354 Hours/Week : 4 Total Hours : 52 I. additional example Solving LPP . assumptions of Linear Programming (LP).An Introduction. Winston: Operations Research Applications and Algorithms. algebra of the simplex method. implementation . Graphical solution. the LP Model. post optimality analysis. solving by linear programming. Tata McGraw Hill.1-3. 2. Frederick S.A. (Chapters 1. Pearson Education 2007 Chapter 6.6(except 6.1-8.Lieberman: Introduction to Operations Research. the dual simplex method Transportation and Assignment Problems 8 Hours The transportation problem. 7 th Edition.1-4.1-6. Thomson Course Technology. 6 Hours Game Theory 6 Hours The formulation of two persons. Formulating a mathematical model.3 and 6. zero sum games. the simplex method in tabular form.6.6.7. adopting to other model forms (Two Phase method. Theory and Problems of Operations Research. Marks : 50 Exam Hours : 3 Exam Marks : 100 Introduction and Overview of the OR Modeling Approach 3 Hours The origin of OR. Introduction to Linear Programming 6 Hours Formulation of linear programming problem (LPP). Critical path (CPM) computations and PERT networks. a special algorithm for the assignment problem PERT and CPM Network representation. Special cases of Graphical method. the impact of OR.7. 4th Edition.6. defining the problem and gathering data. the role of duality in sensitive analysis.a prototype example. 8thEdition. Duality Theory and Sensitivity Analysis 9 Hours The essence of duality theory. 4. economic interpretation of duality. solving simple games. adapting to other primal forms. a stream line simplex method for the transportation problem. 2006. Big-M method). preparing to apply the model. the assignment problem. 8. setting up the simplex method.1-2. Hamdy A Taha: Operations Research .6) 2.Hillier & Gerald J.2-3.1. graphical solution procedure. Wayne L. the nature of OR.4. tie breaking in the simplex method.4) Reference Books: 1.1-1.4.the Simplex Method 14 Hours The essence of the simplex method. Richard Bronson and 50 . Schaum’s Outline. Tata McGraw Hill. 2nd Edition. 51 . 1997.Govindasami Naadimuthu. Accessing the Documentation. Information Search and Visualization 6 Hours Introduction. Tele-operation. Examples of Direct Manipulation. Usability Goals and Measures. Combination of Multiple Menus. Usability Testing and Laboratories. Interaction Devices: Introduction. Pointing Devices. Universal Usability. Multimedia document searches. 3D Interfaces. Survey Instruments. Audio Menus and Menus for Small Displays Command and Natural Languages 6 Hours Introduction. Evaluation during Active Use. Legal Issues. Window Design. Data tyoe by task taxonomy.Principles of User Interface Design Subject Code: 13MCA355 Hours/Week: 4 Total Hours: 52 I. Goals for our profession. Keyboards and Keypads. principles. Single Menus. Shaping the content of the Manuals. Form Filling and Dialog Boxes: Introduction. Online versus paper documentation. Expectations and Attitudes. Advanced filtering and Search Interfaces. Marks : 50 Exam Hours : 3 Exam Marks : 100 Introduction 8 Hours Usability of Interactive Systems: Introduction. Development Processes 6 Hours Managing Design Processes: Introduction. Error Messages. principles. Search in Textual Documents and Database Querying. Guidelines. Models of Response-Time Impacts. The Four Pillars of Design. Controlled Psychologically Oriented Experiments Interaction Styles 8 Hours Direct Manipulation and Virtual Environments: Introduction. Discussion of direct manipulation. Participatory Design. Naming and Abbreviations. Frustrating Experiences Balancing Function and Fashion: Introduction. Data Entry With Menus. Color User Documentation and Online Help : 6 Hours Introduction. Form Filling. Content Organization. Usability Motivation. Speech and Auditory interfaces. Scenario Development. Non-anthropomorphic Design. Online Tutorials and animated demonstrations.A. Task-Related Menu Organization. Information Visualization : Introduction. Challenges for information visualization. The Development Process. Theories. Expert Reviews. Displays-Small and Large Design Issues 6 Hours Quality of Service: Introduction. Fast Movement Through Menus. Variability in Response time. Display design. Command-organization functionality strategies and structure. web page design. Dialog Boxes and Alternatives. Reading from paper versus Displays. Virtual and Augmented Reality Menu Selection. and theories: Introduction. Online Communities for User Assistance. Organizational Design to support Usability. Guideline. Natural Language in computing. 52 . Acceptance tests. Social Impact statement for Early Design Review. User Productivity. Evaluating Interface Design 6 Hours Introduction. Development methodologies: Ethnographic Observation. 2011 53 . 2008.An Introduction to GUI Design. Janet Finalay. III Edition. Gregory D AbiwdmRussel Bealel: Human-Computer Interaction. Cohen. Plaisant. 1994 3. Prentice Hall. Eberts: User Interface Design. Principles and Techniques. Wilber O Galitz: The Essential Guide to User Interface Design. Alan Dix. Wiley-Dreamtech India Pvt Ltd. 5th Edition.Education. 2010 Reference Books 1.TextBooks 1.Education. Jacobs: Designing the User Interface. Ben Shneiderman. 2. Pearson . Pearson . moment generating function . bisection. 2012. 3. Conditional Probability. S.S. Algebra of Events. Numerical Methods for Science and Engineering Computation . Marks : 50 Exam Hours : 3 Exam Marks : 100 Introduction 4Hours Motivation. expected values of x. Independence of Events.R. Correlation Analysis. exponential distribution Regression and Analysis of Variance 6 Hours Introduction. Simpsons 1/3 rd rule Simpsons 3/8 th rule 6 hours Text Books 1. Statistics & Numerical Techniques Subject Code: 13MCA356 Hours/Week: 4 Total Hours : 52 I. Section Edition. Kishore S Trivedi “Probability & Statistics with Reliability. Myers. Simple Non-Linear Regression. The Probability distribution functions. Rank of a matrix. Discrete Distributions. Combinatorial Problems.K. M. Gauss seidel iterative method Numerical integration Trapezoidal rule. ELSEVIER Publications. “Probability.R. Numerical methods for solving algebraic transcendental equations Introduction. Geometric distribution. A. 2012. Keyire Ye 4. Newton’Raphson 6 Hours Matrices 12 Hours Elementary row operation. Probability Axioms. 3.A. Sample Space. Queuing and Computer Science Applications “. Probability mass functions. Random variables types . Probability Models. Wiley Publications.Probability. Confidence Intervals in Linear Regression. moments .functions of random variables. Statistics and Queuing Theory with Computer Science Applications “. The Coefficients of Determination.Unnikrishnan Pillai. McGrawHill. Random Variables and Stochastic Processes”. Jain. 2. continuous distribution . Least-squares Curve Fitting. consistency of system of linear equations Solutions of system linear equations – Gauss elimination. “ Probability.K Iyengar by New Age International Publications 4. binomial distribution. Poisson distribution. Numerical Methods Using Matlab 3rd Edition – Lindfield by Elsevier Publications Reference Books 1.Spiegel. Sastry by PHI Publications 54 . Second Edition. McGrawHill 4th Edition. Schaum’s Outline Series 2.S. Bayes Rules Random Variables 18 Hours Introduction. cumulative distribution function. Probabality and Statistics for Engineers and Scientists 8th Edition by Ronald E Walpole Sharon L. Numerical methods for Science and Engineering Computation 6th Edition – R. Arnold O Allen.normal distribution. Events. Murray R.Papoulis and S. Trend Detection and Slop estimation. Jain. “Probability and Statistics”. Write a JAVA program using Synchronized Threads. A Class that implements the Stack Interface and creates a fixed length Stack. and Circle. Add a method is Workday( ) to the DayofWeek class that returns true if the value on which it is called is MONDAY through FRIDAY. Write a program in Java for String handling which performs the following: i) Checks the capacity of StringBuffer objects.SUNDAY. amount ( iii. throws. A Class that uses both the above Stacks through Interface reference and does the Stack operations that demonstrates the runtime binding. 9. b. ii. 7. iii. For example. A Class called Account that creates account with 500Rs minimum balance. Create some classes in the package representing some common shapes like Square. Write a JAVA program which has i. iv. ii) Reverses the contents of a string given on console and converts the resultant string in upper case. Write a JAVA Program to demonstrate Constructor Overloading and Method Overloading. I. Marks : 50 Exam Hours : 3 Exam Marks : 50 2. a. 6. both account deposit money and one account tries to withdraw more money which generates a LessBalanceException take appropriate action for the same. Import and compile these classes in other program. Write a JAVA program to implement a Queue using user defined Exception Handling (also make use of throw.). 8. which demonstrates Producer Consumer concept. A Class that implements the Stack Interface and creates a Dynamic length Stack. a. Write a JAVA program to print a chessboard pattern. Complete the following: 1. 10. A Class called LessBalanceException which returns the statement that says withdraw Rs) is not valid. Triangle. a withdraw() method to withdraw amount and also throws LessBalanceException if an account holder tries to withdraw money which makes the balance become less than 500Rs. Simple Program on Java for the implementation of Multiple inheritance using interfaces to calculate the area of a rectangle and triangle. Create an enumeration Day of Week with seven values SUNDAY through SATURDAY. 5. the call DayOfWeek.isWorkDay ( ) returns false. a deposit() method to deposit amount.Java Programming Laboratory Subject Code: 13MCA36 Hours/Week: 3 Total Hours: 42 1. 2. 55 . Write a JAVA Program to demonstrate Inheritance. A Class which creates 2 accounts. Write a JAVA Program a. iii) Reads a string from console and appends it to the resultant string of ii. 3. Write a JAVA program which has i.Write a JAVA Program to implement Inner class and demonstrate its Access protection. b. Create a package named shape. 4.A. 3. A Interface class for Stack Operations ii. Write a JAVA applet program. 14. Note: In the examination each student should do one question out of the above 14 questions 56 . 12. Write a JAVA program which uses Datagram Socket for Client Server Communication. which handles keyboard event. Write JAVA programs which demonstrates utilities of LinkedList Class. 13.11. Write a JAVA Program which uses FileInputStream / FileOutPutStream Classes. thickness. X-axis. Write a program to create (without using built in function) a triangle by implementing scaling algorithm by zooming/un-zooming along 1. X and Y plane 7. Write a program to create a wireframe model of globe using equation of ellipse 5. X-axis.Y-axis 10. ‘Redbook’. Develop different chart options with the given inputs by applying DDA algorithm 2. 8. X-axis. Write a program to create (without using built in function) a square by implementing shear algorithm along 1. 2. Write a program to create (without using built in function) a Cube by implementing reflection algorithm 1. Marks : 50 Exam Hours: 3 Exam Marks: 50 PART -A 1. Develop a screen saver with curves with given attributes 6. Write a program to create (without using built in function) a cube by implementing translation algorithm by translating along 1. given an angle 2. Develop a screen saver with text with given attributes 7.Y-axis 11.Computer Graphics Laboratory Subject Code: 13MCA37 Hours/Week: 3 Total Hours: 42 I. 2. In the examination each student picks one question from the lot of all 12 q u e s t i o n s from Part – A and demonstrate any program from Part-B Online reference: OpenGL Programming Guide. Develop a screen saver with 2D objects 8.Y-axis and 3. Write a program to implement Bresenham’s line drawing algorithm with all values of slopes 3. Develop different circular patterns using midpoint circle generation algorithm 4. Version 1.A.B. Write a program to create (without using built in function) and rotate (1. styles. Write a program to clip lines using Liang-Barsky algorithm PART –B 1. Write a program to create and fill the two dimensional object by using boundary fill algorithm 6. 2. speed etc while doing Part . background.1 (Online) 57 . Develop a screen saver with bouncing of 3D objects 9.Y-axis and 3. Animate a bicycle / car with given attributes Note: Students Should Complete All Programs from Part-A and Any Two Programs from Part – B Using Open GL. Around x and y axis) a triangle by implementing rotation algorithm. Animate cube and globe with given attributes 5. X-axis. Write a program to implement Midpoint circle generation algorithm 4. X and Y plane 9. Develop creative natural scenery. Consider all types attributes like color. Write a program to create a chess board using DDA line algorithm 2. 2. 10. Write a program to animate a flag using Bezier Curve algorithm 12. font. Develop different line styles using Bresenham’s algorithm 3. To verify this. TCP headers would effectively increase the count of received bytes at node # 1. Node n1 is another traffic source. The client sends a request to download a file of size 10 MB from the server. The simulation lasts for 25 seconds. Other nodes simply drop it. Let node #0 be the server and node #1 be the client. The duration of the simulation time is 10 seconds. How the hop count should get affected in this case? Verify from the plot. n3. plot the "Bytes Received " curve for node #1. Write a TCL script to simulate the network described below Consider a small network with five nodes n0. Then look at the bottom of the trace file and verify whether there is any transmission beyond the time calculated. 1. determine the time that would roughly be required for the transfer. Therefore. Node # 0 in the LAN act as a UDP traffic source. n2. Connect node # 0 and # 7 with a 1 Mb wired link.Setting up a local area network with ns2 In this exercise you will be simulating a CSMA/CD based LAN with ns2. Add node # 7 into the network so that it act as the gateway. not connected to the Internet. n4. forming a star topology. Assume CBR traffic to be flowing between the nodes. and sends UDP packets to node n2 through n4. What should be the number of hops a packet from node # 0 to node # 6 travel? Verify this from the "Hop Count" plot. You can verify your code by clicking on the "View Solution" button at the bottom of the page. Marks : 50 Exam Duration :3 Hrs Examination Marks : 50 58 . The y-axis is in Kbits. n1. which transmits packets to node n3 (a TCP sink) through the node n4. I.Computer Networks Laboratory Subject Code: 13MCA38 Hours/Week : 3 Hrs. 2. To verify that the client has downloaded the entire file. Move the UDP source to node # 7. TCP packet size is 1500 B. 3. Additional Task: Suppose the above LAN is to be connected to the Internet. Write a Tcl script (in the text area below) to simulate this scenario.e. click on the "Run" button to execute it. Note: This simulation require transfer of a fixed size file. and only the destination node accepts the packet. time required for the transfer would be constant for a given bandwidth of a link. Consider the LAN with seven nodes to be an isolated one i. Total Hours : 42 Hrs. A. Assume typical values for other parameters. Write a script to simulate this scenario. Once you have written your simulation script. Write a TCL script to simulate a file transfer with ns2 Consider a client and a server. The node n4 is at the center. Convert it to MB and verify whether it approximates the specified file size. and node # 6 is the destination node. The server is running a FTP application (over TCP). Node n0 is a TCP source. In Ethernet a packet is broadcasted in the shared medium. Is the plot of bytes received a linear curve or non-linear? Why? Presence of link errors cause one or more packets to be retransmitted. Implement a link error model to reflect this. Try different values of the simulation time to ensure that the file has been entirely transferred. Consider node # 1 running a FTP server. it act as a bottleneck. It may be noted here that the file download time will be more than the we had in exercise # 2 of experiment # 1. Any traffic to or from the LAN passes through it. However. When the bandwidth of the link 2-3 is much lower than the sum of bandwidths of the other links in the network. Verify this from the "Packet Retransmissions" plot. 59 . Simulating link errors Consider the following network diagram Here node # 2 act as a router.4. and node # 5 is downloading a file of size 4 MB. 5. Measuring Network Performances Bottleneck in the network Consider a dumbbell topology with eight nodes as shown as in the following figure. the link between node # 2 and # 3 is fault. Consider nodes# 2 and 3 to be two routers connecting two different networks. It drops packets with a fixed probability of 0.2. • Compute the throughput for node # 3 in each case • Plot the throughput vs. suggest what should be the recommended bandwidth of the link 2-3. Now. 4 Mb). Measuring Network Performances 6.25Mb. All the links in the network have same bandwidths (say. bandwidth data in the "Custom Plot" section below Based on the above plots. Set the TCP packet size to 1460 B.5 Mb to 2. Revisit your previous answer (i. optimum bandwidth of link 2-3) based on these graphs.Assume node # 0 running a FTP application (over TCP) and sending data to node # 6.5 Mb in steps of 0. plot the end-to-end delay between nodes 0 and 6 for the above chosen values of link 2-3 bandwidth. delay and queue types. Assume all the links except 2-3 has a bandwidth of 1 Mb. (All are duplex links). Tasks: • The link 2-3 has a propagation delay of 10 ms. The UDP and CBR packet sizes are 1500 B. Node # 1 is a UDP source (CBR traffic) with a null agent attached to node # 7.e. These two traffic flows through the common link 2-3. propagation delay of 10ms and queue type as DropTail. Bandwidth sharing between TCP and UDP Consider the dumbbell topology from our previous exercise: Node # 0 is a TCP source. 60 . and the corresponding sink is at node # 6. The aim of this exercise is to examine how TCP and UDP share the bandwidth between themselves when the rate of CBR traffic is changed. Vary it's bandwidth from 0. Node # 1 is sending CBR data node # 7. Part 1: • Set the initial rate of CBR traffic to 0. At time t = 3 seconds the FTP application runs over it.5 Mb. then the data transmit with a new path via node 1 and node 2 i. The simulation lasts for 60 secs. Write a TCL script to simulate the following scenario with ns2 simulator. Vegas)? 7.500) with a speed of 5.11 MAC protocol. increment the rate up to 4 Mb.0 sec. Repeat the above steps and observe the graphs in this case. How does the graphs change after each run? In particular. (as shown in the figure below) moving within a flat topology of 700m x 700m. Run the simulation.3 (300. In the above said case both the route has equal cost. Simulate a wired network and demonstrate Distance Vector Routing algorithm . node 3 (300. the link bandwidth. 2 Mb. NowAnalyze the trace file and determine when the use of second route commence.4(500.500).500).e the new route 0-1-2-5. From the graphs plotted observe how UDP occupies a larger portion of the bandwidth. How does the behaviour change for other variations of TCP (Newreno.100). in steps of 0.0m/sec and after some time the path break.e the route is 0-3-4-5. and Plot the number of packets received by each node over the entire time duration of the simulation 8. 61 . After time t=4.2 (500. The initial positions of nodes are 0 (150.300) .5 Mb.100) and 5(650. Use DSR as the routing protocol and the IEEE 802.1 (300.300) respectively. what's the nature of the graphs when the rate of CBR traffic is 50% of the bandwidth? Part 2: Behaviour of UDP • Reduce the bandwidth of the link 2-3 to say. Run the simulation and plot the graphs again.A TCP connection is initiated between node 0 (source) and node 5 (destination) through node 3 and node 4 i. Consider six nodes. and plot the "Bytes Received" by node #s 4 and 5 (sinks for TCP and UDP traffic) • Now.100) moves towards node 1 (300. If NS3 is used c++ with python has to be introduced during first two or three weeks of the labs. Only above 9 experiments should be included for the laboratory exam. Simulate a network which will create congestion in the network. If NS2 is used tcl scripting should be introduced .With the trace file created identfy the points at which congestion occurs by writing sed / awk scripts. Also write a mechanism to correct/control the congestion.9. Note: In the examination each student should do one question out of the above 9 questions 62 . Note : Network Free and open source software simulators like NS2 / NS3 could be used. 2.H.4. S S Tseng.1. 3.4. 4. 10. Galgotia Publication 2001. Analysis Framework. Hashing. Wiley India 4. Coremen T. 11. Decision Trees. 3. R C Chang. 6.4. Rajasekharan S. Y T Tsai : Introduction to Design and Analysis of Algorithms: A Strategic Approach. Mathematical analysis of Recursive and Non-recursive algorithms. Important Problem Types. Binary tree Traversals and related properties. PHI 1998. Input Enhancement in String Matching.1-11.: Computer Algorithms. 3.1-1.3.1-10. 8. Sequential Search and String Matching.1. Algorithms for Generating Combinatorial Objects Space and Time Tradeoffs Sorting by Counting. 2. 6. Stressen’s Matrix Multiplication Decrease-and-Conquer 5 Hours Insertion Sort. 6 Hours Dynamic Programming 5 Hours Computing a binomial coefficient. Binary Search. 3. Brute Force 12 Hours Notion of Algorithm. Dijkstra’s Algorithm. Divide-and-Conquer 8 Hours Mergesort.F undam e nt als of the Analysis of Algorithm Efficiency. Depth First and Breadth First Search.4.2. R C T Lee. Kruskal’s Algorithm.1-7. 6. Topological sorting..4. Examples. 8.1-2. Fundamentals of Algorithmic Problem Solving.. NP and NP-Complete Problems 4 Hours 12 Hours Text Books: 1. Warshall’s and Floyd’s Algorithms. Tata McGraw Hill 63 . 7. Asymptotic Notations and Basic efficiency classes. Multiplication of large integers. and Rivest R.1-5. The Knapsack Problem and Memory Functions Greedy Technique Prim’s Algorithm. 8.1-9.3.5. Anany Levitin: Introduction to the Design and Analysis of Algorithms. Leiserson C. P.2. Quicksort.4. Horowitz E. Fundamental data Structures..5. Michael T Goodrich and Roberto Tamassia : Algorithm Design.. Sahani S.E.L.: Introduction to Algorithms.1-4. Knapsack Limitations of Algorithm Power Lower-Bound Arguments. 2nd Edition.1. 6. Pearson Education. Selection Sort and Bubble Sort. 9.3.3) Reference Books: 1.SEMESTER IV ANALYSIS AND DESIGN OF ALGORITHMS Sub Code : 13MCA41 Hrs/Week : 04 Total Hours: 52 IA Marks : 50 Exam Hours: 03 Exam Marks: 100 Introduction.(Chapters 1. 5.6. Bean Methods. immediate solutions. adding controls. Interceptors. Working with Java Beans. writing scriptlets. Instance pooling n caching. language attribute. platform integration. Batch updates. Container services. Including files and applets in jsp Pages. The Java Persistence Model. Introduction to EJB: 9 Hours The Problem domain. new bean. Han dlin g Client Request: HTTP Request Headers. Basic JDBC data types. The core java API package. Persistence . Invoking java code from JSP. coding the EJB. out of Container Testing. using java beans components in JSP documents Java Beans & Annotations: 6 Hours Creating Packages. Generating server Response: HTTP Response Headers. Lang Sub package. isElignore attribute. Components Types. Customizers.errorPage and is errorPage attributes. naming conventions. Introspection. Advantages of JSP. Essential JDBC program. Advanced JDBC data types. creating Template Text. Server Side Component Types. JDBC in Action Result sets. Bean info class. Servlet packaging. Bean Jar file. Session Beans. info attribute . JSP: 12Hours Overview of JSP Technology. Bean properties. Benefits of JSP. Invoking java code with JSP scripting elements. Session Tracking. Generating server Response: HTTP Status codes. using jsp expressions. convention for the Examples. Life Cycle Callbacks. Interactive SQL tool. 64 . Single Thread model interface. Design Pattern events. New java. session attribute. the bean Implementation class. Developing your first EJB. Interoperability. Lifecycle. using declarations. preparation. CodeSmart not hard. using prepared Statement Object. Timers. declaration example. creating bound properties. Handling Client R e q u e s t : Form Dat a. buffer and auto flush attributes. Built-in Annotations. Concurrency. Integration Testing. Interfaces. is Thread safe Attribute. Breakup responsibilities. manifest file. JDBC: 8 Hours Talking to Database. the Enterprise java bean specification. Bean an Icon. Need of JSP. Mapping. Simple properties. creating java bean. Basic syntax.Advanced JAVA Programming Subject Code: 13MCA42 Hours/Week : 4 Total Hours : 52 I. Transactions.A. extends attribute. Limiting java code in J S P . Naming and object stores. the contract. Message Driven Beans. Entity Beans. Controlling the Structure of generated servlets: the JSP page directive. security. Handling Cookies. JAR files and Annotations. Definitions.Java Beans API. Dependency Injection. For example Using Scriptlets to make parts of jsp conditional. HTMLbuilding utilities. Marks : 50 Exam Hours: 3 Exam Marks: 100 Servlets: 8 Hours Servlet Structure. import attribute. Immediate Solutions. comparing servlets and jsp. the Stateful Session Bean.21.18.7. EJB 3 Developer Guide. Message.4. 3.2.1. Bill Burke. 2. Java 6 Programming Black Book.4. Comprehensive coverage of the Java Language.11.6.10. (Chapter 1. Enterprise JavaBeans 3. Michael Sikora.20. 2012 (Chapter 17.9. Java The Complete Reference. Herbert Schildt. Text Books: 1. Andrew LeeRubinger.30). 65 .27.28.O’reilly. Shroff Publishers & Distributors PVT LTD. Persistence Entity manager Mapping Persistence objects.5.3. 2.19. Larry Brown.8.5. Entity Relationships. Volume 1: Core Technologies. EJB and PERSISTENCE.29. Second Edition.10.14).13. the Singleton Session Bean. A practical guide for developers and architects to the Enterprise Java Beans Standard. July 2008. (Chapter 3.22. Core Servlets and Java Server Pages.8.Driven Beans.9. Eight Edition. Developing Enterprise Java Components.Server Side Component Models: 9 Hours The Stateless Session Bean. Marty Hall.12.6. Tata McGraw-Hill Edition – 2011. Reference Books: 1.11). Dreamtech Press.7. Layouts. References. Document requests. Convergence. cookies. 9. Using Databases. Introduction to PHP 8 Hours Origins and uses of PHP. REST services. Classes. Control statements. p m – A n E x a m p l e . Cookies 3.Advanced Web Programming Subject Code : 13MCA43 Hours/Week : 4 Total Hours : 52 I. Methods. 66 . Simple input and output. Overview of PHP.A. Processing forms. Rich User experience.0.0. JSON 0053yntax. Pattern matching. CGI Scripting 6 Hours What is CGI? Developing CGI Applications. Primitives. RPC Style SOAP. Object literals. Array literals. Hashes. operations and expressions. Scalars and their operations. Mixing literals. Tracking users with Hidden Data.0. Control statements. 4. Software As a Service (SaaS). 2. Arrays. Data and Web 2. sessions. Introduction to Ruby 8 Hours Origins and uses of Ruby. WSDL. A d d i n g Robustness. 6 Hours 6. Pattern matching. Iterative development. Control statements. Hashes. U s i n g C G I . Assignment statements and simple input and output. Web Services 4 Hours Web Services: SOAP. Functions. Form handling. JSON Encoding and Decoding. JSON versus XML. Functions.pm. Creating H T M L P a g e s D y n a m i c a l l y . Document style SOAP. Scalar types and their operations. Multiple Delivery Channels. Using Relational Databases. Introduction to Rails 4 Hours Overview of Rails. Building Web applications with PHP Tracking users. Building Web Applications with Perl 5 Hours Uploading files. 8. File input and output. Handling XML. Arrays.pm methods. What is JSON?. Output. 7. Code blocks and iterators. Rails applications with Databases. Fundamentals of arrays. Introduction web 2. Processing CGI. Programming in Perl 7 Hours Origins and uses of Perl. Marks : 50 Exam H o u r s : 3 Exam Marks : 100 1.0?. Carp. Folksonomies and Web 2. Social Networking. Examples. JSON format. using libwww. CGI. Files 5. Introduction to CGI. General syntactic characteristics. 4 Hours What is Web 2. Pattern matching. 2. M. Wiley India. 15) 3. 2008. 2006 (Chapter 10. Pearson Education / PHI. Joel Murach’s PHP and MySQL. First Edition. Robert W. 2003. Sebesta: Programming the World Wide Web. (Chapters 8.11.J.13. Xue Bai et al: The Web Warrior Guide to Web Programming. 3rd Edn. Pearson Education. 3rdEdition. 14. Francis Shanahan: Mashups.13) 2.Text Books: 1. 3. Thomson. Wiley India 2007(Chapters 1. Deitel. B. Goldberg: Internet & World Wide Web How to H program. Chris Bates: Web Programming Building Internet Applications. A. 67 .11. 6) Reference Books: 1. 2004. P. 4th Edition. Mauch’s Publications. Deitel. Window Dynamics Packet-Loss Process. Dynamic Source Routing . Measurement Tasks.Improving TCP Performance over Wireless Links : Splitting TCP Connections . Header Format. Confidence Level of Simulation Results. Common Simulation Mistakes. Encapsulation in IP.Snooping TCP at Base Stations . Performance Study of TCP/IP. Steady-State Simulation. Simulation Execution.Impact of Mobility on TCP Performance. TCP Performance Issues over Wireless Links.Notifying the Causes of Packet Loss . Adding Selective Acknowledgments to TCP and Comparison of Enhancement Schemes . TCP Applications and Services. Gallery of TCP Models. Presentation of Results and Examples of TCP/IP Simulation 5 TCP Modeling 5 Hours Motivation for Mathematical Modeling of TCP. Ttcp & Netperf. Popular Measurement Tools and Their Applications. Connection Establishment and Termination. Fragmentation and Reassembly . Acknowledgment Mechanism. Trends in Wireless LAN Systems . TCP/IP over Heterogeneous Wireless Systems 7. Control System Model and Network System Model 6.Types of Simulations. Impact of Mobility on TCP Performance. Steps of a Systematic Simulation Study . Mobile IP. Tcpstat. Inappropriate Reduction of Congestion Window .Encapsulation in IP. Tcpdump. Header Format and IP Version 6 3 Performance Measurement of TCP/IP Networks 3 Hours Reasons for Network Measurement.TCP Performance in Ad Hoc Networks.UDP Services. Distributed Benchmark System 4 TCP/IP Network Simulation 4 Hours The Role of Simulation. Terminating Simulation.Advanced Computer Networks Subject Code: 13MCA441 Hours / Week: 4 Total Hours: 52 Internal Marks : 50 Exam Hours: 3 External Marks: 100 1 Introduction 2 Hours History of TCP/IP. TCP/IP Performance over Mobile Networks 3 Hours Cellular and Ad Hoc Networks :TCP Performance in Cellular Networks. TCP/IP Performance over Wireless Networks 3 Hours Wireless Networks: Generic Characteristics. Continuous versus Discrete Event. Confidence Level Formula. Header Format . Approaches to Improve TCP Performance . Control and Sliding Window. Meaning of TCP Performance? 2 TCP/IP Fundamentals 4 Hours TCP. Simulation Validation and Verification. Essentials of TCP Modeling.Wireless System Evolution and TCP/IP :Trends in Cellular Communication Systems. Network Simulators: Model Construction and Parameter Setting Data Collection. Periodic Model. Retransmission Mechanism. Classification of Measurement Tools. Stochastic Model with General Loss Process. Synthetic versus TraceDriven Simulation. Wireless Local Area Networks and Cellular Communications Networks. 68 . Detailed Packet Loss Model.IP Services. Simulation with Self-Similar Traffic.UDP . Congestion Control . Terminating versus Steady State.Throughput Loss in WLANs and Throughput Loss in Cellular Communication Systems . TCP Services . Push-Out. Performance of TCP/IP over Optical Networks. IP over DWDM .Optical Burst Switching . Sources of Overhead for TCP/IP. Scatter/Gather I/O. Congestion Resolution in Optical Packet Switches . Media-Access Asymmetry. AQM &Differentiated Service 13 TCP Implementation 5 Hours TCP Implementation Overview. .Interrupts. Checksums and Connection Management. Accessing User Memory. Advanced Enhancements and New Versions of TCP: Quick-Start TCP. Optical Packet Network End-to-End Performance.Security.LEO Handoff Spectral Congestion . Bandwidth Asymmetry .Variable Delays . TCP NewReno. RED Variants with Per-Flow Accounting.Explicit Congestion Notification . Traffic Oscillation.Satellite Internet Architectures . High Speed TCP . Time Response. High Performance TCP: High-BandwidthDelay Products Round-Trip Estimation. Security Issues Conclusions for TCP Enhancements. Delayed ACKs after Slow Start . Experimental Evaluation of Performance Improvement Techniques Experiments with Bandwidth Asymmetry. Loss Rate. Improving TCP Performance over Asymmetric Networks: Uplink Bandwidth Management Handling Infrequent ACK . Explicit Transport Error Notification TCP Westwood and XCP . TCP/IP Header Compression. Buffering and Data Movement. TCP/IP Performance over Satellite Networks 8 Hours A Brief History of Data Satellites. Experiments with MediaAccess Asymmetry.Multiprotocol Lambda Switching . CPU Utilization. Forward Acknowledgments. New TCP Standards and Flavors 3 Hours Duplicate Acknowledgments and Fast Retransmit. Fast Recovery and TCP Reno. 11. Delay and Jitter. Classifying the RED Variants: RED Variants with Aggregate Control. Mapping of TCP in Optical Packets. Space Communications Protocol Specifications-Transport Protocol 10 TCP/IP Performance over Asymmetric Networks 3 Hours Types of Network Asymmetry: Bandwidth Asymmetry. Performance Evaluation and Comparison of AQM Schemes: Throughput and Fairness. Drop-From-Front. Path MTU Discovery .Large Initial Window.Types of Satellites . Retransmissions.TCP for Transactions. TCP Enhancements for Satellite Networks :Path MTU Discovery . Remote Direct Memory Access and TCP Offload. Multiple Connections. Motivations for Using Satellites. and Bandwidth .Optical Packet Switching :Optical Packet Format. The Role of Application Processing. Copy Avoidance: Page Remapping. Window Scaling . TCP Data Exchange.Multiprotocol Label Switching .Overview of Other Features and Options and Performance Comparison of TCP Flavors 12 Active Queue Management in TCP/IP Networks 6 Hours Passive Queue Management: Tail-Drop.. Active Queue Management: Random Early Detection.Reducing End-System Overhead :Overhead. TCP Vegas . 69 . TCP with Selective Acknowledgments. Pacing TCP Segments . Byte Counting.TCP Peach. Per-Packet Overhead . TCP/IP Performance over Optical Networks 3 Hours Evolution of Optical Networks. Congestion. MediaAccess Asymmetry.Approaches to Improve TCP Performance 8.New Transport Protocols for Satellite Links: Satellite Transport Protocol. Link Impairment . Optical Packet Design in the TCP/IP Environment 9. Asymmetry Impact of Asymmetry on TCP Performance: Bandwidth Asymmetry. Performance of AQM Schemes.Satellite Characteristics Affecting TCP :Long Feedback Loop. Problems with Passive Queue Management.Bandwidth-Delay Product. 70 . Mahbub Hassan and Raj Jain. Addison-Wesley 71 .2.9. Volume II and Volume III).3.13 ( excluding those topics which are not in the syllabus ) Reference Books: TCP/IP Illustrated (Volume I. W.5.6.11. Richard Stevens. Issues.7.12. 2009 PHI Learning Chapters 1.8.10. and Solutions.Text Book : High Performance TCP/IP: Networking Concepts. IST Edition.4. 72 . Marks : 50 Exam H o u r s : 03 Exam Marks : 100 Data Warehousing and OLAP 8 Hours Data Warehouse basic concepts. Improving accuracy of clarification methods. Types of Data and Computing Distance. G e n e r a l a p p r o a c h t o s o l v e c l a s s i f i c a t i o n problem. 2nd Edition. 2nd Edition. 3. Alternative methods for generating Frequent Item sets. a n d O LA P Computing Mc GrawHill Publisher. K. Quality and Validity of Cluster Analysis Outlier Analysis Outlier detection methods. Evaluation criteria for classification methods. Gupta: Introduction to Data Mining with Case Studies. Clustering based Text Books: 1. Multiclass Problem. Jiawei Han and Micheline Kamber: Data Mining . Motivating Challenges. 2006. What is Data Mining. Data Mining Applications. Partitional Methods. FP Growth Algorithm. Smith: Data W a r e h o u s i n g . 2005. 2. Michael Steinbach. Approaches. Statistical Classification based approached 4 Hours applications. Alex B e r s o n a n d S t e p h e n J . Data Mining Tasks. Morgan Kaufmann Publisher.Concepts and Techniques. Density Based Methods. G. 2. Data Preprocessing 6 Hours Association Analysis: Basic Concepts and Algorithms 8 Hours Frequent Item set Generation. D e c i s i o n Trees. 1997. Nearest Neighbor Classifiers. Pang-Ning Tan. Da t a M i n i n g . Compact Representation of Frequent Item sets. R u l e B a s e d Classifiers. 2009. 3rd Edition. Data Warehouse Modeling. Arun K Pujari: Data Mining Techniques University Press. Data Cube and OLAP Data Mining 6 Hours Introduction. Reference Books: 1.A. AddisonWesley. PHI. Bayesian Classifiers. which kinds of applications are targeted by Data Mining Data Mining Types of Data. Evaluation of Association Patterns Classification 12 Hours Basics. Vipin Kumar: Introduction to Data Mining. Estimating Predictive accuracy of classification methods. Types of Cluster Analysis Methods. Clustering Techniques 8 Hours Overview. Hierarchical Methods. 2009. Which technologies are used. New Delhi.Data Warehousing and Data Mining Subject Code : 13MCA442 Hours/Week : 04 Total Hours : 52 I. Features of cluster analysis. Rule Generation. Network Aspects in GSM. Tunneling. Introduction to WiMAX. SM MT. the client. 7 Hours Third Data. Entities. Design Constraints in applications for handheld devices. Wireless Languages: Markup Languages. Security Considerations in MIDP. 3G and WiMAX Spread Spectrum technology. Processing a Wireless request. Development Tools. Mobile Internet Applications 6 Hours Thin client: Architecture. The Client: User Interface. CDMA versus GSM. GUI in MIDP. Computing.Mobile Computing and Wireless Communications Subject Code: 13MCA443 Hours/Week: 04 Total Hours: 52 Mobile Computing Architecture: Types of Networks. 3-tier Wireless Networks – 1: GSM and SMS 7 Hours Global Systems for Mobile Communication ( GSM and Short Service Messages ( SMS): GSM Architecture. Building. Design phase. Mobile IP: Introduction. Deployment phase. Middleware. SMS as Information bearer. Data Storage. MIDP. Call routing in GSM. Proprietary OS Client Development: The development process. MIDlet life-cycle. Mobile Operating Systems: WinCE. Applications for GPRS. GSM Frequency allocation. Mobile IP with IPv6 Mobile OS and Computing Environment 7 Hours Smart Client Architecture. SMS Architecture. Need analysis phase. Registration. GPRS Network Operations. Messaging. SM MO. Simian OS. Wireless Generation Networks. Introduction to SMS. CLDC. GSM Addresses and Identities. messaging Servers. Device Emulators. Implementation and Testing phase. Data Synchronization. HDML. PDA. cHTML. Messaging. MIDlet model. Performance. Communication in MIDP. MIDlet event handling. PLMN Interface. Mobile handset overview. Architecture for Mobile Design Considerations for Mobile Computing. Low level GUI Components. Cellular IP. discovery. Applications on 3G. VoiceXML. XHTML. 73 . GPRS Network Architecture. Wireless Applications Protocol (WAP) Overview. Mobile Client 6 Hours Moving beyond desktop. applications Wireless Networks – 2: GPRS 6 Hours GPRS and Packet Data Network. E n t e r p r i s e D a t a S o u r c e . Data Services in GPRS. IA Marks : 50 Exam Hours : 03 Exam Marks : 100 6 Hours Architecture. Mobility Management. J2ME 7 Hours Introduction. Multimedia APIs. Programming for CLDC. Mobile phones and their features. Palm OS. HTML. Provisioning. Linux. Billing and Charging in GPRS Wireless Networks – 3: CDMA. CDC. WML. The S e r v e r : Data S yn c h r o n i z a t i o n . Creating new application. IS-95. Dr. Iti Saha Misra: Wireless Communications and Networks. Applications and Service Creation. 74 . Oxford University Press. 2. Hasan A h m e d : Mobile C o m p u t i n g . 2010. Tata McGraw Hill. Ashok Talukder. Technology. 2003. 3G and Beyond. Raj kamal: Mobile Computing. Tata McGraw Hill. 2. M s R o o p a Y a v a g a l . 2007. 2009.Text Books: 1. Wiley. Reference Books: 1. 2d Edition. M r . Martyn Mallik: Mobile and Wireless Design Essentials. Identifying test cases. Integration Testing 6 Hours Traditional view of testing levels. Guidelines and observations. Static Testing. The SATM (Simple Automation Teller Machine) problem. Code : 13MCA444 Hrs/Week : 4 Total Hours: 52 IA Marks: 50 Exam Hours: 03 Exam Marks : 100 Basics of Software Testing 7 hours Humans. Equivalence classes. Levels of Testing. Variations on mutation Analysis. Correctness Vs Reliability. Guidelines and observations. 75 . Decision table based testing 7 Hours Boundary value analysis. Organizing documents. The triangle problem. Test cases. Decision tables. Analysis and test plan. Slice based testing. Robustness testing. Improving the process. Equivalence class testing. Test design specifications documents. Test cases for triangle problem. Execution History. Test strategy document. Adequacy Criteria. Guidelines and observations. Path Testing. Generic vs specific Scaffolding. Capture and Replay. Risk Planning. Monitoring the Process. Partition. Software Quality. Basic Principles. Examples. Equivalence test cases for triangle problem. Self checks as oracles. Testing and Debugging. Definition Use testing. Error and fault taxonomies. the SATM systems. Level of testing. Behavior and Correctness. The quality team. Test Generation Strategies. Scaffolding. Requirements. the NextDate function. NextDate function and commission problem. special value testing. Test case selection and Adequacy 6 hours Sensitivity. Random testing. Testing and Verification. Alternative life cycle models. Worst-case testing. Comparing Criteria A perspective on Testing. The commission problem. guidelines and observations. Fault-based Adequacy Criteria. Defect Management. Restriction. Test Generation from Predicates. Visibility and Feedback. Software and Hardware Testing. Test coverage metrics. Insights from a Venn diagram. The currency converter.Software Testing and Practices Sub. Test Specification and cases. Test Metrics. Boundary value testing. Redundancy. Basis path testing. Test Oracles. Data flow testing 7 Hours DD Paths. Test and analysis reports. Fault Based Testing 6 Hours Assumptions in fault-based testing. Errors and Testing. Examples 7 Hours Basic definitions. Planning and Monitoring the Process. separating integration and system testing. Documenting Analysis and Test 6 Hours Quality and Process. Mutation Analysis. Examples: Generalized pseudocode. Saturn windshield wiper. From Test case specification to Test Cases. Test and Analysis strategies and plans. Reference Books 1. Techniques and Tools – McGrawHill. Rahul Shende. 2011 2. Adithya P. Pearson Education India. 2013 5.Process.Mathur “ Foundations of Software Testing – Fundamental Algorithms and Techniques”. India. Wiley India 2012 2. “Software Automation testing tools for Beginners”. 2011.Text Books 1. 2nd Edition. Ron Patton: Software Testing. Shroff publishers and distributors. Aueredach publications. Pearson Education. Wiley India. 2008 4. Michael Young. Kshirasagara Naik. Priyadarshi Tripathy: Software Testing and Quality Assurance. Brain Marick: The Craft of Software Testing. . “Software Testing A Craftmans Approach”. M. 3rd edition. Pearson Education India. 2009 3. Paul C Jourgensen. Software testing and Analysis. Principles and Techniques.G. 2012 3. MauroPezze.Limaye: Software Testing-Principels. 2012 76 . Why Study Science computing and Key Ideas. Constructing PDAs. Limitations of Finite Automata. Pushdown Automata and Nature of Context Free Languages 7 Hours Machines for Context Free Languages. Automata Definition. The idea of formal languages. Constructing Regular Grammars. Grammars for Regular Languages. Ambiguity and Eliminating ambiguity. Mantras for constructing Automata. The idea of Chomsky normal form. Answering Questions about CFLs. A Step-by-Step model for constructing Automata. The ideas of parsing and Derivation. Simple Linear and other grammars. Finite State Transducers. Why are some languages not regular. Constructing Context free grammars (LGs and Non LGs). Constructing more complex Turing machines. Handling Reject States. converting automata to regular grammars. Using Pumping Lemma an Adversarial Game. States as Memory. Why Finite number of states. computable functions. Eliminating NonDeterministic: converting NFA to DFA. Programming. Languages of Automata. Closure properties. Jumping States without Input. Automata. Regular Expression. Intractability and Intelligence. The CFL-CFG-PDA Triad.Theory of Computation (Finite Automata and Formal Languages) Subject Code: 13MCA445 IA Marks : 50 Hours/Week: 04 Exam Hours : 03 Total Hours : 52 Exam Marks: 100 Introduction and Finite Automata: 10 Hours What is (not) a computer. Adding Memory: Why Stack Behavior. Regular Expressions in Practice Regular Grammars and Languages 7 Hours The idea of Grammar. Handling End Condition. Undecideability. Constructing Regular Expressions. Context Free Grammars 7 Hours The idea and nature of context free grammar. Introduction to Parsing. Closure Properties. converting regular grammars to automata. The ideas of Griebach Normal form. constructing regular grammars: mantras. Constructing simple Turing machines. What is the Science of Computing. Union of CFLs. Constructing Simple Automata. Computability. The ideas of computation. Converting to Chomsky normal form. Why are some languages not context-free. Constructing Non-Deterministic Automata. Equivalence of Regular Expressions. Converting PDAs to CFGs. Answering questions about regular languages. Computing Machines and Languages. Algorithms and Science. Mantras for Constructing Turing Machines.The idea of computing Machine. The pumping lemma for context free languages. Turing Machines 8 Hours The ideas of Universal Computing Machine. The Pigeonhole Principle and Pumping Lemma. Constructing CFGs to PDAs. The idea of computing. Constructing more complex Automata. Converting Regular Expressions to Automata. A method for minimizing Automata. Automata with Combinatorial States NFA and Regular Expression 7 Hours The idea of Non-Determinism. Nondeterminism in PDAs. The Church-Turing Thesis. Data Structures. Variations of Turing Machines. Birth of Science computing. Method for Constructing Regular Expressions. The Universal Turing Machine 77 . 78 . Addison Wesley Publishing company. 2010 2. The ideas of context. Recursive Languages. M. Kavi Mahesh: Theory of Computation: A problem solving approach. Recursively Enumerable Languages. Padma Reddy. The ideas of Acceptance and Membership. Languages and Computing Machines. and Computation. The idea of Enumeration. Languages.The Chmosky Hierarchy 6 Hours Languages. Text Books: 1. Linear and Deterministic Context-Free Langauges. Wiley India. Pearson Education. Aho & Ulman:Theory of computation. Grammars and Machines. Other Grammars and Automata. The idea of Diagnoalization. Pearson Education India. Introduction to Automata Theory. Context Sensitive Languages and Grammars. Finite Automata and Formal Languages: A simple Approach. 2012 Reference Books: 1. Counting Alphabets. 2010 3. A. 79 . Reference Books: 1. Homo-morphic Filtering. Digital Image Processing PIKS Scientific Inside. region –based segmentation. basic morphological algorithms. thresh holding. Smoothing FrequencyDomain Filters. Case study on Object Identification. Detection of discontinues. UNIT 5: Representation and Descriptors 8 Hours Representation. Pearson Education. UNIT 4: Morphological Image Processing and Image Segmentation 10 Hours Dilation and erosion. Rafael C Gonzalez and Richard E Woods. Enhancement Using Arithmetic/Logic Operations. Prentice Hall of India. Relational Descriptors. UNIT 2: Image Enhancement in the Frequency Domain 8 hours Introduction to the Fourier Transform and the Frequency Domain. William K Pratt. edge linking and boundary detection. Histogram Processing. Biometrics and Content Based Image retrieval. Fundamental of Digital Image Processing. Reed Elsevier India Pvt Ltd. Use of Principal Components for Description. 80 . Digital Image Processing With Matlab & LabView. 4th Edition.Digital Image processing Subject Code : 13MCA446 Hrs/Week : 04 Total Hrs. UNIT 2: Image Enhancement in the Spatial Domain 8 hours Some Basic Gray Level Transformations. Sharpening Spatial Filters. Basics of Spatial Filtering. Components of an Image Processing System. Smoothing Spatial Filters. Fundamental Steps in Digital Image Processing. Linear and Nonlinear Operations. 2004. opening and closing. Hit-or-Miss transformations. Examples of Fields that Use Digital Image Processing. Image Sampling and Quantization. 2002. Combining Spatial Enhancement Methods. Wiley 2. Digital Image Processing. Boundary Descriptors. UNIT 6: Use of Image Processing in Pattern Recognition 8 Hours Introduction to the tools of Matlab and Open CV. Text Books: 1. Vipul Singh. Some Basic Relationships Between Pixels. 2. 2013. Anil K Jain. Regional Descriptors. Sharpening Frequency Domain Filters. : 52 IA Marks : 50 Exam Hours: 03 Exam Marks: 100 UNIT 1: Introduction 10 Hours What Is Digital Image Processing? The Origins of Digital Image Processing. S/MIME 5 Hours 5 Hours IP Security 5 Hours IP Security Overview. Intrusion Detection.A. Transposition Techniques. Data Structure.Cryptography & Network Security Subject Code: 13MCA451 Hours/Week: 04 Total Hours: 52 I. Block Ciphers. 81 . Secure Socket layer (SSL) and Transport layer Security (TLS). Message Authentication Code. Security Mechanism. Key Management. Digital Signature Standard Authentication Applications Kerberos. Secure Electronic Transaction (SET) System Security 4 Hours Intruders. Model for Network Security. Substitution Techniques. Digital Signatures. Evaluation Criteria for AES. Encryption Round. Types of Firewall and Firewall Configuration. Key management. IP Security Architecture. Authentication Header. Hash Functions. Marks : 50 Exam Hours: 03 Exam Marks : 100 Introduction 3 Hours OSI Security Architecture. Block Cipher Design Principles and Modes of operation. RSA algorithm. Diffie Hellman Key exchange Message Authentication and Hash Function 6 Hours Authentication Requirement. X. Authentication Functions. Encapsulating Security Payload. Security Services. Classical Encryption Technique 5 Hours Symmetric Cipher Model. Web Security 5 Hours Web security Considerations. Data Encryption Standard and Advanced Encryption Standard 8 Hours Block Cipher Principles. AES Cipher-Encryption and Decryption. Security Attacks. Firewall Design Principles. Public Key Cryptography and Key Management 6 Hours Principles of Public Key Cryptosystem. The Data Encryption Standard.509 Authentication Service Electronic Mail Security Pretty Good Privacy (PGP). Combining Security Associations.Characteristics. 13. 20. 5.Behrouz A.2.2. 3.1.3.9.1. 18. 13.Atul Kahate.6.5.2.1. 10.3.1-2.1. 4.1. 15. (Chapters: 1. 11. Forouzan and Debdeep Mukhopadhyay: “Cryptography and Network nd Security”. 17. 6.1-16.111. 14.5.2.1-17.4. 16. 15. 2009. 2 Edition. 9.10.3.3. nd 2.2.1.1. 18. 4 Edition.1.2.1.2.2. th 82 . Exclude the topic not mentioned in the syllabus) Reference Book: 1. Pearson Education. “Cryptography and Network Security – Principles and Practices”.3. “Cryptography and Network Security” 2 Edition TMH. 2010. 2.Text Books: William Stallings. Tata McGraw-Hill. A c t i v e N e t w o r k Monitoring. Network Management Issues. Management functions. Simple Network Management Protocol Optical Networks: Control and Management 05 Hours Network Management functions. WBEM: Windows Management Instrumentation. CORBA. MPLS Applications. Desktop management interface. IP-Based Service Implementation and Network Management Simple Network Management Protocol. Organizational aspects of Management. Performance and Fault Management.Based Management Web Interface to SNMP Management.Based Management. Command line interface. Ip. Architectural Considerations. 05 Hours of MPLS MPLS Management Interfaces 05 Hours The basics of Management Interfaces. Time aspects of Management IP Network Management 07 Hours Choosing to manage the network. Choosing a configuration method. Bulk File Transfer. Network Management 06 Hours Mechanisms. Management information Base. SLA and Network Monitoring 05 Hours Passive and A c t i v e N e t w o r k M o n i t o r i n g . Embedded Web. Management Information Base Modules for MPLS. OSS Architecture 08 Hours Implementation-OSS. Key A s p e c t s Network Management. WebBased Enterprise Management. Configuration Web-Based Management 06 Hours NMS with Web Interface and Web. Java 83 . Layers within the Optical Layer. Extensible markup Language.Network Management Subject code: 13MCA452 Hours/ Week: 04 Total Hours : 52 IA Marks: 50 Exam Hours : 3 Exam Marks: 100 Requirements for the Management of Networked Systems 05 Hours Management Scenarios. MPLS Network Management: AN Introduction A b r i e f Introduction t o M P L S . Defining Network Management. Simple Network Management Protocol. P a s s i v e N e t w o r k M o n i t o r i n g . Optical Layer Services and Interfacing. Multivendor Interoperability. XML.Based Service Provisioning Issues. Network Management Architecture Background. Common Object Request Broker Architecture. Network Management.Principles and Practice. Chapter 1-8 2.Chapter 14 Reference Books: 1. Mani Subramaniam. 84 . Network Management. Elsevier publications. Network Management. Pearson Education 2. PHI.Know it all by Adrian Farrel. Morris. David Zeltserman. Practical Guide to SNMPv3 and Network Management.management Extensions. Pearson Education. Text Books: 1. Management of a Storage Area Network: Future Directions. 9. “Professional NOSQL” by Shashank Tiwari. Querying. Creating Blog Application with PHP. using MySQL as a NOSQL Developing Web Application with NOSQL and NOSQL Administration 16 Hours Php and MongoDB. 2011. Apress 2010 (Chapter 6. Indexing and ordering datasets (MongoDB/CouchDB/Cassandra) Advanced NOSQL NOSQL in CLOUD.12. Modifying and Managing NOSQL Data stores. Interfacing and Interacting with NOSQL NOSQL Basics 12 Hours NOSQL Storage Architecture. Marks : 50 Exam Hours : 3 Exam Marks : 100 Introduction to NOSQL 6 Hours Definition of NOSQL. History of NOSQL and Different NOSQL products. CRUD operations with MongoDB.A.13. Exploring MondoDB Java/Ruby/Python. Python and MongoDB. The NoSQL Database for Cloud and Desktop Computing.2. The Definitive guide to MongoDB.9) 85 .8.7.10.5. 8.4.6. Migrating from RDBMS to NOSQL. WROX Press (Chapter 1. BigData with Hive 8 Hours Working with NOSQL 10 Hours Surveying Database Internals.15) 2.3.NOSQL Subject Code:: 13MCA453 03 Hours/Week Total Hours : 52 I.11. Parallel Processing with Map Reduce. Web Frameworks and NOSQL. NOSQL Database Administration Text Books 1.7. Implementation & Testing Architecture and implementation. Availability. Security. What makes a “good” architecture? Why is software important? Context of Software Architecture 04 Hours Technical Context. Modifiability. Architectural Structures and views. Typing the methods together Designing an Architecture Design strategy. Notations. Simulations and prototypes. Guiding quality design decisions. View and Behavior. Blackboard. How is Architecture influenced? What Do Architecture influence? Understanding Quality Attributes 12 Hours Architecture & Requirements. Model-view-control. the attribute driven design methods. Distributed systems.control. Marks : 50 Exam Hours : 3 Exam Marks : 100 Introduction 06 Hours What software architecture is and what it is not. ASRs by understanding the business. From Mud to structure. ASRs by interviewing stake holders. Usability Quality Attribute modeling and Analysis 06 Hours Modeling Architecture to enable quality attribute analysis. capturing ASRs in a utility tree. Quality attribute check lists. Business context. Specifying and achieving Quality attribute requirements. Professional context. Documentation and quality attributes Architecture. Architecture and testing 03 Hours Architectural Patterns 06 Hours Introduction to patterns. Performance. Brocker. Analysis at different stages of the life cycle Architecture and requirements 06 Hours Gathering ASRs from requirements documents. Pipes and filters. quality attribute considerations. Functionality. Architectural patterns. Presentationabstraction.Software Architectures Subject Code : Hours/Week: Total Hours : 13MCA454 4 52 IA. the steps of ADD 03 Hours Documenting Software Architecture 06 Hours Uses and Audiences for architecture documentation. Interactive systems. Layers. Stake holders. Project life-cycle context. Through experiments and Back-of-the envelope analysis. Testability. Experiments. Microkernel 86 . Interoperability. Adaptable systems. 87 . Dashofy: Software Architecture: Foundations.11.6. 2013 (Listed Topics only from Chapters 1.17. Frank Buschmann. Peter Sommerlad. John Wiley and Sons. Pearson Education.India 2012 2. A System of Patterns. Len Bass.9.18. Wiley.5. 3d Edition. Richard N. Volume 1. Mary S h a w a n d D a v i d G a r l a n : Software A r c h i t e c t u r e -Perspectives o n a n E m e r g i n g Discipline.3. Regine Meunier.10.2.Text Books: 1.4. Theory. Rick Kazman: Software Architecture in Practice. Prentice Hall of India.14. and Practice. 2012 (chapter 2) Reference Books: 1. Paul Clements.Oriented Software Architecture. Nenad Medvidovic and Eric M. 88 .19) 2.16. Michael Stal: Pattern. Hans Rohnert. Taylor. 2007.8.7. 2. Materials Management. SAP AG. Quality Management. Sales and Distribution. Organizing Implementation . EIA. Project Management and Monitoring. Prentice Hall. Reference Books 1. Human Resource. “ERP Demystified”. Unit II ERP Implementation 12 Hours Implementation Life Cycle. Monk. On–line Analytical Processing. Jose Antonio Fernandz. “Concepts in Enterprise Resource Planning”. Wangner. Supply Chain Management. Data Mining.Contracts . Future Directions in ERP. System Software Associates. Vinod Kumar Garg and N. 2001.Baan Company . 2. Finance.Enterprise Resource Planning Subject Code : 13MCA455 Hours/Week : 4 Total Hours : 52 I. PeopleSoft . Marks : 50 Exam Hours : 3 Exam Marks : 100 Unit I Introduction To ERP 9 Hours Overview. Business Process Reengineering. Unit V ERP – Present And Future 11 Hours Turbo Charge the ERP System . 1999. Alexis Leon. Tata McGraw Hill 89 . “ The SAP R /3 Hand book”. Benefits of ERP.Venkata Krishnan.A. ERP and Related Technologies. ERP and Internet. TextBooks 1. Brady. Joseph A.QAD . JD Edwards World Solutions Company. Thomson Learning.Vendors. ERP and E–Commerce . Ellen F. Oracle Corporation . Data Warehousing. Unit IV ERP Market 10 Hours ERP Market Place. 1998. “Enterprise Resource Planning concepts and Planning”. Implementation Methodology .Hidden Costs. Plant Maintenance. Tata McGraw Hill. Unit III Business Modules 10 Hours Business Modules in an ERP Package. Bret J.Consultants and Users .K . Manufacturing. Google Play. Rooting (Android). winRT). Power Management. Windows). Security. App-structure. Writing power-smart applications. Power Management. CSS. 2011 90 . ARM and intel architectures. 2012 3 HTML5. Touch interfaces. Getting the Model right. Native vs. Eclipse. Accelerometer.A. CSS3 and Jquery with Adobe Dreamweaver CS 5. Runtime Environments (Objective-C. Geolocation. desktop devices. Peachpit Press. Storing and Retrieving Data Developing an Application 8 Hours Building a simple “Hello World” App (Android. Mobile-specific enhancements (Browser-detection. Aug 2012 2 Reto Meier: Professional Android 4 Application Development. John Wiley & Sons. Windows Store). Packaging and Deployment System-level Apps 6 Hours Native programming (Android). iOS. built-in Controls. basic graphics. Defenestration (Windows) Text Books: 1 Jeff McWherter.Mobile Device Security 8 Hrs Wake locks and assertions. Windows). Marks : 50 Exam Hours: 03 Exam Marks: 100 Foundation 6 Hours Mobile devices vs.Augmented Reality. Trade paperback. Windows).5 Learn by Video. Touch interfaces. web applications Frameworks and Tools 10 Hours Development Environments (XCode. Synchronization and Replication of Mobile Data. JQuery). Network. Camera. Wrox Publications. File access. Jailbreaking (iOS). Screen resolution. Mobile Agents and Peer-to-Peer Architecture Performance Management 6 Hours Memory Management. Device protections. Scott Gowell: Professional Mobile Application Development. Application deployment (App Store. Advanced Topics:Power Management. VS2012. Dalvik. Mobile OS (Darwin.). Development Tools (HTML5. JavaScript. Mobile browser “interpretations” (Chrome/Safari/Gecko/IE). Richard. Building useful apps. GPS . Screen orientation). Low-level OS support. David Powers.Mobile Applications Subject Code: 13MCA456 Hours/Week : 04 Total Hours : 52 I. Mobile malware. iOS. Mobile OS Architectures 8 Hours Mobile OS Architectures (Android. Database. Linux. Low-level APIs (Windows). etc. file access. PhoneGAP. Low-level programming (iOS). 4. 2004 2. Design and Development. Wallace B McClure.NET/C#. Prentice Hall. Wiley-India. Croft IV. Jonathan Dick.References: 1. Nathan Blevins. Robbie Schell: Mobile Applications: Architecture. Valentino Lee. John J. 3. Wiley-India 91 . 2007. Rajkamal: Mobile Computing. Oxford University Press. Heather Schnerider. Chris Hardy : Professional Android Programming with Mono for Android and . Reto Meier : Professional Android 4 Application Development. 8}. 1. Repeat the experiment for different values of n. Find the Binomial Co-efficient using Dynamic Programming. I.6}and{1. Implement Horspool algorithm for String Matching. Implement 0/1 Knapsack problem using dynamic programming. Obtain the Topological ordering of vertices in a given igraph.A Marks : 50 Exam Marks : 50 Exam Hours : 3 13.A suitable message is to be displayed if the given problem instance doesn't have a solution. 4. Find a subset of a given set S = {sl. 92 . the number of elements in the list to be sorted and plot a graph of the time taken versus n. the number of elements in the list to be sorted and plot a graph of the time taken versus n. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm.. Sort a given set of elements using Quick sort method and determine the time required sort the elements. 2. Sort a given set of elements using the Heapsort method and determine the time required to sort the elements. 6. 8} and d = 9 there are two solutions{1. 5. find shortest paths to other vertices using Dijkstra's algorithm.s2.Algorithms Laboratory Subject Code : 13MCA46 Hours/Week : 3 Total Hours : 42 Implement the following using C/C++ Language. For example. 3.. a. the number of elements in the list to be searched and plot a graph of the time taken versus n. 8... 10. Print all the nodes reachable from a given starting node in a digraph using BFS method. Sort a given set of elements using Merge sort method and determine the time required to sort the elements. 7. 11. 12. Repeat the experiment for different values of n. Repeat the experiment for different values of n. 2. the number of elements in the list to be sorted and plot a graph of the time taken versus n. From a given vertex in a weighted connected graph.2. Repeat the experiment for different values of n. 6.. Check whether a given graph is connected or not using DFS method. 9.sn} of n positive integers whose sum is equal to a given positive integer d. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm. b.. if S= {1. Implement Recursive Binary search and Linear search and determine the time required to search an element. 5. 15. Compute the transitive closure of a given directed graph using Warshall's algorithm.Shortest-Paths Problem. Note: In the examination questions must be given based on above lots. Implement N Queen's problem using Back Tracking. a. 93 .14. b. Implement Floyd’s algorithm for the All-Pairs. Write a JAVA Servlet Program to implement and demonstrate get() and Post methods(Using HTTP Servlet Class).A. Write a JSP program to demonstrate the import attribute. An EJB application that demonstrates persistence (with appropriate business logic). Write a JSP program to implement all the attributes of page directive tag. 11. Write a JAVA JSP Program which uses jsp:include and jsp:forward action to display a Webpage. Marks : 50 Exam Marks: 50 Exam Hours : 3 1. b. An EJB application that demonstrates Session Bean (with appropriate business logic). 9. a. An EJB application that demonstrates MDB (with appropriate business logic). 3. 5. Write a JAVA Program to insert data into Student DATA BASE and retrieve info based on particular queries(For example update. 7. 4.Advanced Java Programming Laboratory Subject Code : 13MCA47 Hours/Week : 3 Total Hours : 42 I. 8. Write a JAVA Servlet Program to Auto Web Page Refresh (Consider a webpage which is displaying Date and time or stock market status. search etc…). 10. 2. 12. 6. delete. Note: In the examination each student should do one question out of the above 13 questions 94 . populate Bean and display the same information through another JSP. you would need to refresh your web page regularly. Write a JAVA JSP Program which uses <jsp:plugin> tag to run a applet. Write a JAVA JSP Program to get student information through a HTML and create a JAVA Bean class. 13. Write a JAVA Servlet Program to implement a dynamic HTML using Servlet (user name and Password should be accepted using HTML and displayed using a Servlet). Write a JAVA JSP Program to implement verification of a particular user login and display a Welcome page. Write a JAVA Servlet Program using cookies to remember user preferences. For all such type of pages. Java Servlet makes this job easy by providing refresh automatically after a given interval). one exercise from part A is to be asked for 20 marks. address line1. Create XHTML form with Name. Instructions: 1. Note: 1. 3. The mini project under part B has to be evaluated for 30 marks. Retrieve and display using SEARCH function. 2. accession number. Mini project student group size is limited to two students only. IA Marks : 50 Exam Hours : 03 Exam Marks : 50 3. 2. Write a PHP program to read student data from an XML file and store into the MySQL database. In the examination. However during the exam ination. 2. 4. 4. 3. address line2 and email text fields. title. Requirement Analysis c. 95 . Testing 4. The team must sub mit a brief project report (25-30 pages) that must include the following a. store the values in MySQL table. edition and publisher from a web page and store the information in a database and to search for a book with the title specified by the user and to display the search results with proper headings. PART B Develop a web application project using the languages and concepts learnt in the theory and exercises listed in part A with a good look and feel effects. Build a Rails application to accept book information viz. On submitting. each student must demonstrate the project individually. Project report duly signed by the Guide and HOD need to be submitted during examination. Implementation f. The report must be evaluated for 10 Marks. You can use any web technologies and frameworks and databases. PART A Write a perl program to insert name and age information entered by the user into a table created using MySQL and to display the current contents of this table. Analysis and Design e. Retrieve and display the data based on name. Introduction b. authors.Mini Project-I Guidelines Subject Code : 13MCA48 Hours/week : 3 Total Hours : 42 1. Software Requirement Specification d. A team of two or three students must develop the mini project. In the examination each student picks one question from part A. Demonstration and Viva for 20 Marks. Allocation of sub-systems.SEMESTER V Object-Oriented Modeling and Design Patterns Subject Code: 13MCA51 Hours/Week: 4 Total Hours: 52 I. Use case relationships. Class Design: Overview of class design. State diagram behavior. Application Analysis: Application interaction model. Designing algorithms. A sample class model. Sequence models. OO modeling history. . Making a reuse plan. Interaction Modeling and Advanced Interaction Modeling 4 Hrs Interaction Modeling: Use case models. preparing a problem statement. Navigation of class models. Architecture of the ATM system as the example. Reification of behavior.A. Activity m o d e l s . Realizing use cases. Breaking a system in to sub-systems. 4. 7. Multiple inheritance. Adjustment of inheritance. Abstract classes. elaborating a concept. Relation of class and state models. abstraction. Bridging the gap. Procedural sequence models. Practical tips. Application state model. Metadata. Common architectural styles. Evidence for usefulness of OO development. Process Overview. System Conception: Devising a system concept. Domain interaction model. Transitions and Conditions. System Conception 3 Hrs Process Overview: Development stages. Recursing downwards. Iterating the analysis. Modeling as Design Technique: Modeling. Development life cycle. Generalization and inheritance. Special constructs for activity models. Management of data storage. Handling boundary conditions. A sample state model. Link and associations concepts. Domain state model. Signal generalization. Domain Analysis and Application Analysis 8 Hrs Overview of analysis. Refactoring. Organizing a class design. Handling global resources. State diagrams. Marks : 50 Exam Hours: 3 Exam Marks: 100 1. Practical tips 3. Aggregation. State Modeling and Advanced State Modeling 6 Hrs State Modeling: Events. Advanced object and class concepts. Domain class model. Setting the trade-off priorities. 2. Practical tips. Nested states. Derived data. Modeling Concepts 3 Hrs What is Object Orientation? What is OO development? OO themes. Constraints. Relationships between 96 . Introduction. 5. Estimating performance. Concurrency. N-array associations. Association ends. adding operations. System Design and Class Design 7Hrs Overview of system design. Packages. Design optimization. Application class model. Class Modeling and Advanced Class Modeling: 7 Hrs Object and class concepts. Reification. 6. Practical tips. Advanced State Modeling: Nested state diagrams. The three models. ATM example. Identifying concurrency. Patterns 4 Hrs What is a pattern and what makes a pattern? Pattern categories. States. 8. Choosing a software control strategy. Pattern description. 9. 1995. 5. 3rd Edition. Johnson. (Chapters 1. 2nd Edition. (Chapters 1 to 15) 2. Steve McRobb and Ray Farmer: Object-Oriented Systems Analysis and Design Using UML. 2nd Edition. Mark Priestley: Practical Object-Oriented Design with UML. Pearson.patterns. Savage: Object-Oriented Design with UML and JAVA. A System of Patterns. Lorensen. Frank Buschmann. 2005. 6. Communication Patterns: Forwarder-Receiver. Regine Meunier. Vlissides: Design Patterns-Elements of Reusable Object. Pearson. PublisherSubscriber.. Blaha. View Handler.. Rumbaugh. Organization of work. 2007. Michael Stal: Pattern-Oriented Software Architecture. 4. Barclay. 2002. 2003. 3) Reference Books: 1. Object Oriented Modeling and Design. Rumbaugh. Simon Bennett. Addison-Wesley. K.Oriented Software. Volume 1. Model View Controller. Elsevier. 2005. Management Patterns: Command processor. 7. Whole Part. R. Helm. Master Slave. Premerhani. G. Michael Blaha. 2008. 2006. 2. Peter Sommerlad. Grady Booch et al: Object-Oriented Analysis and Design with Applications. John Wiley and Sons. PHI Latest Edition 97 . 2nd Edition. R. Hans Rohnert. Gamma. E. J. J. J. Pearson Education / PHI. Tata McGraw-Hill. Client-Dispatcher-Server. Eddy.: The Unified Modeling Language User Guide. Design Patterns 10 Hrs Introduction. Text Books: 1. James Rumbaugh: Object-Oriented Modeling and Design with UML. and Jacobson. structural decomposition. 2nd Edition. 3. I. Booch. Tata McGrawHill. Inventory System General Principles. Areas of application. Simulation in Java. verification and validation. Multivariate and Time-Series input models. Random-Variate Generation 8 Hours Properties of random numbers. Simulation Software 6 Hours Concepts in Discrete-Event Simulation: The Event-Scheduling / Time-Advance Algorithm. Techniques for generating random numbers. Input Modeling 6 Hours Data Collection. Selecting input models without data. Stochastic nature of output data. Discrete-Event System Simulation. Calibration. Advantages and disadvantages of Simulation. Poisson process. Calibration and validation of models. Continuous distributions. Fitting a non-stationary Poisson process. Statistical Models in Simulation 6 Hours Review of terminology and concepts. Probability Distribution. Model of a system. Goodness of Fit Tests. Manual simulation Using Event Scheduling. Verification of simulation models. Types of Models. Steps in a Simulation Study. Optimization: Model building. Acceptance-Rejection technique. Discrete and continuous systems. World Views. Components of a system. Empirical distributions. Useful statistical models.System Simulation and Modeling Subject Code: 13MCA52 Hours/Week: 04 Total Hours: 52 IA Marks : 50 Exam Hours : 03 Exam Marks : 100 Introduction 6 Hours When simulation is the appropriate tool and when it is not appropriate. Absolute measures of performance and their estimation. Chi-Square test. Identifying the distribution with data. Generation of pseudo-random numbers. Queuing Models 8 Hours Characteristics of queuing systems. Estimation of Absolute Performance & Computer System Simulation 6 Hours Types of simulations with respect to output analysis. Random-Number Generation. Verification and Validation 6 Hours Verification. 98 . Probability distribution function. Random Variables. Discrete distributions. Tests for Random Numbers. Output analysis for steady-state simulations. Queuing notation Simulation Examples: Queuing. List processing. K-S Test. Random-Variate Generation: Inverse transform technique. a nd Validation. Systems and system environment. Output analysis for terminating simulations. Special properties. Parameter estimation. uniformity and independence. Text Books: 1. Tata McGraw-Hill. Theory of modeling and simulation. Park: Discrete – Event Simulation: A First Course. Pearson / Prentice-Hall. Zeiglar. Pearson. 5th Edition. Elsevier 99 . Jerry Banks. Stephen K. 3. Lawrence M.4th Edition. (Listed topics only from Chapters1 to 12) Reference Books: 1. David M. Averill M. 2006. 2010. Nelson. Simulation 5ed Ross Elsevier 4. Law: Simulation Modeling and Analysis. Carson II. 2007. Leemis. Barry L. Nicol: Discrete-Event System Simulation. John S. 2. Type Conversions.NET Framework 4. Variables and Constants: Value Types. Creating an Object. Namespaces.NET. Interfaces: Syntax of Interfaces.NET and ASP . ASP . Static Classes and Static Class Members. Muticasting with Delegates. Runtime Polymorphism/ Overriding. Polymorphism: Compile time Polymorphism/ Overloading. Inheritance: Inheritance a n d C o n s t r u c t o r s . Structs: Syntax of a struct and Access Modifiers for structs. V a r i a b l e s an d C o n s t a n t s .NET Framework 4. Object. Events: Event Sources. Creating a Simple C# Console Application. Objects and Structures 06 Hours Namespaces. C# Pre-processor Directives.NET Framework 4. Windows Communication Foundation. Windows workflow Foundation. Multiple Event Handlers.NET AJAX. Properties: Read-only Property. Static Property.0. Events and Delegates. S e a l e d C l a s s e s a n d S e a l e d M e t h o d s . Metadata and Assemblies. Reference Types. Introducing C# 06 Hours Need of C#. E x t e n s i o n methods. Iteration Statements and Jump Statements. Architecture of . Classes and Objects: Creating a Class. Returning a Value from a Method and Describing Access Modifiers. ADO .NET Framework Class Library. Indexers. Encapsulation using Properties.NET Subject: 13MCA53 Hours/ Week: 04 Total Hours : 52 IA Marks: 50 Exam Hours: 03 Exam Marks: 100 Getting started with . Using this Keyword.Programming Using C#.Oriented Programming 05 Hours Encapsulation: Encapsulation using accessors and mutators. Event Handlers.0: CLR. B o x i n g a n d U n d o i n g . CTS. Components of . Data Types. Using the ?? (Null Coalescing) Operator. Exception Handling: The try/catch/finally statement. Defining Partial Classes and Method. Delegates and Events and Exception Handling 05 Hours Delegates: Creating and using Delegates. 100 . Checked and Unchecked Statements. The System namespace. Identifiers and Keywords. Control Flow statements: Selection Statements. Windows Presentation Foundation. Using the :: (Scope Resolution) Operator and Using the is and as Operators. . Classes. Expression a n d Op erato rs : Operator Precedence. Windows Forms. Abstraction: Abstract classes.NET Framework. Implementation of Interfaces and Inheritance. Using the Nested Classes. Abstract methods. Creating an Array of Objects. Accessibility of accessors and Anonymous types.0 04 Hours Benefits of . Widows Card Space and LINQ. Paul Deitel and Harvey Deitel: C# 2010 for Programmers. Wiely.NET Ajax application. Delegates and Event. 4th Edition. Validation Controls.aspx: Displaying Recommendations based on Session Values. GroupBoxes and Panels. Web Basics. TabControl Control and Multiple Document Interface (MDI) Windows. Wiely-Appress. Pearson Education. LinkLabel Control. Multitier Application Architecture. Windows Forms. Ajax Web Applications. Andrew Trolsen: Pro C# 5. Using DataReader to Work with Databases. Hebert Shildt: Programming in C# 4. Another Way to Create Event Handlers. MonthhCalendor Control.NET 08 Hours Introduction. Mouse-Event Handling. Creating Data View. 6th Edition.aspx’s Code-Behind File.14 and 19). TextBoxes and Buttons.10.NET Guestbook.NET Ajax Control Toolkit. Date TimePicker Control. Event Handling: A Simple Event. Examining WEebTime. Case study: Database-Driven ASP. CheckBoxes and RadioButtons. Kogent Learning Solutions Inc.12.Dream Tech Press.0 and the . Building a Web Form that Displays Data from a Database.0 Unleashed. Data Access with ADO.NET 4. ADO>NET. OLEDB Database.NET 4.Graphical User Interface with Windows Forms 10 Hours Introduction. Optaions. Tata McGraw Hill. 3. (Chapters: 14. ADO. Locating Event Information. the ASP. Creating a Connection to a Database: SQL Server Database. ecommenations. ComboBox Control. Session Tracking: Cookies. Adding Multiple Tables to a DataSet.aspx :Selecting a Programming Language. Updating with DataAdapters.0. Menus.NET 08 Hours Understanding ADO. Control Properties and Layout. ListBox Control.NET AJAX: Traditional Web Applications. Session Tracking with http Session State. Modifying the Code-Behind File for the Guestbook Application. Labels.11.Driven GUI. TreeView Control. 2. (Chapters: 1.. Your First Web Application: Building WebTime Application. Keyboard-Event Handling.NET. Visual Studio Generated GUI Code. CheckedListBox Control. Paging with DatyaAdapters. Working with DataAdapters: Creating DataSet from DataAdapter. ToolTips. ODBC Data Source. 101 .NET: Describing the Architecture of ADO. Standard Web Controls: Designing a Form. . 2.0 Programming (6-in-1). Web App Development with ASP.15. Creating Connection Strings: Syntax for Connection Strings.19 an 27.13. Pearson Education.3) References Books: 1.SAMS Series. Bart De Smet: C# 4.Handling Mechanism.NET Entity Framework.5 Framework. Black Book. Testing an ASP. Creating a Command Object. ASP. ListView Control. Case study: Password-Protected Books Database Application Text Books: 1. Basic Wireless Sensor Technology: Sensor Node Technology.. Marks : 50 Exam Hours: 3 Exam Marks: 100 Unit I 12 Hours Mobile Ad-Hoc Networking with a View of 4G Wireless: Imperatives and Challenges.. Inc. WN Trends. Offthe-Shelf Enables of Ad Hoc Networks. Self. Algorithmic Challenges in Ad Hoc Networks. Sensor Taxonomy. Scatternet Formation in Bluetooth Networks. Daniel Minoli. Another Taxonomy of WSN Technology.11 in Ad Hoc Networks: Protocols. Unit V Text 10 Hours Wireless Transmission Technology and Systems: Radio Technology Primer. Unit III 10 Hours Energy-Efficient Communication in Ad Hoc Wireless Networks. Antenna Beam forming and Power Control for Ad Hoc Networks.Mobile and Adhoc Sensor Networks Subject Code: 13MCA541 Hours/Week : 4 Total Hours : 52 I. IEEE 802. A John Wiley & Sons. Medium Access Control Protocols for Wireless Sensor Networks: Fundamentals of MAC Protocols. Inc. IEEE 802. Sensor-MAC Case Study. Routing Approaches in Mobile Ad Hoc Networks.A. Ivan Stojmenvic.Organized and Cooperative Ad Hoc Networking. IEEE Press.4 LR-WPANs Standard Case Study. MAC Protocols for WSNs. Silvia Giordano. Available Wireless Technologies. References 1. and Ad Hoc Networks. WN Operating Environment. Wireless Networking. Simulation and Modeling of Wireless. Publication 2007 102 . “Adhoc and Sensor Networks” by Stefano Basagni. Modeling Cross-Layering Interaction Using Inverse Optimization. Unit II 10 Hours Topology Control in Wireless Ad Hoc Networks. Wireless Sensor Networks. Performance and Open Issues. Broadcasting and Activity Scheduling in Ad Hoc Networks. Text Book: 1. Mobile. Examples of Category 1 WSN Applications. Kazem Sohraby. Unit IV 10 Hours Introduction and Overview of Wireless Sensor Networks: Applications of Wireless Sensor Networks. Location Discovery. Taieb Znati. Publication 2004.15. Ad Hoc Networks Security. Mobile Ad Hoc Networks (MANETs): Routing Technology for Dynamic. A John Wiley & Sons. Parallel Computing Subject Code : 13MCA542 Hours / Week : 4 Total Hours : 52 IA |Marks:50 Exam Hours: 3 Exam Marks: 50 1. Introduction to Parallel Computing 2 Hours Need of Performance, Building Parallel Systems, Why to Write Parallel Programs? How to Write Parallel Programs? Approach : Concurrent, Parallel, Distributed 2 Parallel Hardware and Parallel Software 4 Hours Background, Modifications to the von Neumann Model, Parallel Hardware, Parallel Software, Input and Output, Performance, Parallel Program Design and Writing and Running Parallel Programs 3 Distributed Memory Programming with MPI 10 Hours Getting Started, The Trapezoidal Rule in MPI, Dealing with I/O, Collective Communication, MPI Derived Data types, A Parallel Sorting Algorithm 4 Shared Memory Programming with Pthreads 12 Hours Processes, Threads and Pthreads, Hello, World program ,Matrix-Vector Multiplication, Critical Sections Busy-Waiting, Mutexes, Producer-Consumer Synchronization and Semaphores, Barriers and Condition Variables, Read-Write Locks, Caches, CacheCoherence, and False Sharing and Thread-Safety 5 Shared Memory Programming with OpenMP 18 Hours Introduction to OpenMP, The Trapezoidal Rulem Scope of Variables, The Reduction Clause, The Parallel For Directive, More About Loops in OpenMP: Sorting, Scheduling Loops, Producers and Consumers, Caches, Cache-Coherence, and False Sharing and Thread-Safety 6 Parallel Program Development and Parallel Algorithms Two N-Body Solvers, Tree Search and Case Studies 6 Hours Text Books: 1. An introduction to parallel programming by peter s. Pacheco. 2011.I Edition ,morgan kaufmann publishers Reference Books : 1. Using OpenMP: Portable Shared Memory Parallel Programming ,Gabriele Jost and Ruud van der Pas The MIT Press (October 12, 2007) 2. Using MPI - 2nd Edition: Portable Parallel Programming with the Message Passing Interface,William Gropp and Ewing Lusk, 1999, 2nd edition, MIT Press 3. Pthreads Programming: A Posix Standard for Better Multiprocessing,Dick Buttlar, Jacqueline Farrell & Bradford Nichols .1996, I Edition , Oreilly 103 104 Multimedia Systems Subject Code: 13MCA543 Hours/Week : 4 Total Hours : 52 I.A. Marks : 50 Exam Hours : 3 Exam Marks : 100 Introduction, Media and Data Streams, Audio Technology 7 Hours Multimedia Elements; Multimedia Applications; Multimedia Systems Architecture; Evolving Technologies for Multimedia Systems; Defining Objects for Multimedia Systems; Multimedia Data Interface Standards; The need for Data Compression; Multimedia Databases. Media: Perception Media, Representation Media, Presentation Media, Storage Media, Transmission Media, Information Exchange Media, Presentation Spaces & Values, and Presentation Dimensions; Key Properties of a Multimedia System: Discrete & Continuous Media, Independence Media, Computer Controlled Systems, Integration; Characterizing Data Streams: Asynchronous Transmission Mode, Synchronous Transmission Mode, Isochronous Transmission Mode; Characterizing Continuous Media Data Streams. Sound: Frequency, Amplitude, Sound Perception and Psychoacoustics; Audio Representation on Computers; Three Dimensional Sound Projection; Music and MIDI Standards; Speech Signals; Speech Output; Speech Input; Speech Transmission. Graphics and Images, Video Technology, Computer-Based Animation 7 Hours Capturing Graphics and Images Computer Assisted Graphics and Image Processing; Reconstructing Images; Graphics and Image Output Options. Basics; Television Systems; Digitalization of Video Signals; Digital Television; Basic Concepts; Specification of Animations; Methods of Controlling Animation; Display of Animation; Transmission of Animation; Virtual Reality Modeling Language. Data Compression 12 Hours Storage Space; Coding Requirements; Source, Entropy, and Hybrid Coding; Basic Compression Techniques; JPEG: Image Preparation, Lossy Sequential DCT-based Mode, Expanded Lossy DCT-based Mode, Lossless Mode, Hierarchical Mode. H.261 (Px64) and H.263: Image Preparation, Coding Algorithms, Data Stream, H.263+ and H.263L; MPEG: Video Encoding, Audio Coding, Data Stream, MPEG-2, MPEG-4, MPEG-7; Fractal Compression. Optical Storage Media 6 Hours History of Optical Storage; Basic Technology; Video Discs and Other WORMs; Compact Disc Digital Audio; Compact Disc Read Only Memory; CD-ROM Extended Architecture; Further CD-ROM-Based Developments; Compact Disc Recordable; Compact Disc Magneto-Optical; Compact Disc Read/Write; Digital Versatile Disc. Content Analysis Simple Vs. Complex Features; Analysis of Sequences; Audio Analysis; Applications. 6 Hours Analysis of Image Individual Images; Data and File Format Standards 7 Hours Rich-Text Format; TIFF File Format; Resource Interchange File Format (RIFF); MIDI 105 7.File Format. JPEG DIB File Format for Still and Motion Images. Organizing Multimedia Databases. 2003. Ralf Steinmetz. Pearson Education. 3. 2003.R Rao. Kiran Thakrar: Multimedia Systems Design. Zoran S. 2. MPEG Standards. Text Books: 1. 106 . Nalin K Sharad: Multimedia information Networking. Prabhat K. 5. 2 Edition. Bojkovic and Dragorad A. K. 6. 3. Pearson Education. PHI. Types of Multimedia Systems. PHI. TWAIN Multimedia Application Design 7 Hours Multimedia Application Classes. Klara Narstedt: Multimedia Fundamentals: Vol 1-Media Coding nd and Content Processing. and Networks. (Chapters 2. 2002. Standards. 8. Application Workflow Design Issues. 9) 2. (Chapters 1. Components of Multimedia Systems. 4. 7) Reference Books: 1. Milovanovic: Multimedia Communication Systems: Techniques. 2002. Distributed Application Design Issues. AVI Indeo File Format. Andleigh. Virtual Reality Design. and Hart P E.. 107 .. TEXT BOOKS: 1. estimating the composition of populations. O. adaptive decision boundaries. estimation of error rates. unequal costs of error. Robert Schalkoff REFERENCE BOOKS 1. Earl Gose. : 52 IA Marks : 50 Exam Hours : 03 Exam Marks : 100 UNIT – 1 8 Hours INTRODUCTION: Machine perception. and Stork D G. PHI 3. Baye’s Theorem. UNIT – 6 8 Hours ARTIFICIAL NEURAL NETWORKS: Introduction. structural and Neural Approaches). Pattern Recognition and Image Analysis. 4th Edition. Characteristic curves. minimum squared error discriminate functions. criterion functions and clustering. random variables. estimation of parameters from samples. nearest neighbor classification techniques. Pattern recognition (Statistical. pattern recognition systems. “Pattern Recognition. Wiley Publishers 2.. component analysis. nets without hidden layers. UNIT – 3 10 Hours STATISTICAL DECISION MAKING: Introduction. probability of events. UNIT – 5 8 Hours UNSUPERVISED LEARNING AND CLUSTERINGS: Unsupervised Bayesian learning. Online clustering. Hopfield nets. Kernel and window estimators. Elsevier Academic Press. data decryption and clustering. nets with hidden layers. an application. Pattern Classification Duda R. Applications of pattern recognition. adaptive discriminate Functions. minimum risk estimators. of Lecture Hrs. conditionally independent features. UNIT – 2 9 Hours PROBABILITY: Introduction. Richard J and Steve J. multiple features. choosing a decision making technique. the leavingone. design cycle.PATTERN RECOGNITION Subject Code : 13MCA544 Hrs/Week : 04 Total no. Hierarchical clustering. moments of random variables. decision boundaries. learning and adaptation. Sergios Thedoridis & Konstantinos Koutrumbas. the back Propagation algorithms. histograms.out technique. UNIT – 4 9 Hours NONPARAMETRIC DECISION MAKING: Introduction. Joint distributions and densities. 108 . Business Process Design 7 Hours WS-BPEL Language basics. Services (as Web Services). Coordination. Architectural Considerations.Orientation and the enterprise.Concepts. WS-Addressing language basics.7. Text Books 1. Common tangible benefits of SOA. Frank cohen: FastSOA. Business Activities. Service oriented business process redesign. Shankar Khambhapaty. Messaging (with SOAP) Web Services and Contemporary SOA 12 Hours Message Exchange patterns. Eric Newcomer. Thomas Erl: Service Oriented Architecture. Service Layers 6 Hours Service Orientation and contemporary SOA. Wiley-India.6) Reference Books 1.5. WS-Coordination overview. Ws-Reliable messaging language basics. Orchestration Service Layer. Agnostic Services. Service Oriented Architecture for Enterprise and Cloud Applications. Meta data Exchange. Software Platforms for Enterprise Applications. Atomic Transactions. Pearson Education. Code: 13MCA545 Hrs/Week: 4 Total Hours: 52 IA Marks:50 Exam Hours:03 Exam Marks: 100 Introduction to SOA.17) 2. Reliable Messaging. Elsevier. 2013 (listed topics only from Chapters 3. Evolution of SOA 6 hours Fundamentals of SOA. Technology and Design. A SOA timeline (from XML to Web Services to SOA). 2009. Common Principles of Service Orientation. The roots of SOA (comparing SOA to Past Architectures) Web Services and Primitives of SOA 6 hours The Web Services framework.Service Oriented Architectures (SOA) Sub. Service Activity. Anatomy of service-oriented Architecture. Application service layer. Service Description (with WSDL). The continuing evolution of SOA (standards organizations and Contributing vendors).16. Service Orientation and object orientation. Native Web Service support for service orientation principles. SOA with Web Services. Solution Architecture for Enterprise Applications based on SOA. Greg Lomow: Understanding Pearson Education. Addressing. Choreography. Policies. 2012 (listed topics only from Chapter 5.8.4. Enterprise Applications 8 Hours Learning Objectives.6. How Service Orientation principles inter relate. Solution Architecture for Enterprise Applications. 2nd Edition. Principles of Service – Orientation 7 Hours Services. Correlation. Security. Business Service Layer. Common characteristics of contemporary SOA. 2010 2.9. 109 . Orchestration. Notification and eventing. Service Layer Abstraction. Service Layer Configuration scenarios. The science of building a compiler.1 to 7. Back patching. Translation of expressions. Three-address code. A Simple Code Generator. Syntax Analysis . Richard J. Introduction to LR Parsing: Simple LR.1 to 5. 6. Addresses in the target code. Lam. The Target language. Input Buffering. Syntax-directed translation schemes Intermediate Code Generation 8 Hours Variants of syntax trees. 110 . Lexical analysis 8 Hours Language processors. Run-Time Environments 6 Hours Storage Organization. Parser Generators. 5.1 to 8. Fischer. Applications of Compiler technology.: Crafting a Compiler with C. 4. Type checking. 2. Specifications of Tokens. 2007. Stack allocation of space. Pearson Education. Addison-Wesley. Basic blocks and Flow graphs. The structure of a Compilers. 1991. Top-down Parsing 6 Hours Syntax Analysis – 2 Bottom-up Parsing. Evaluation order for SDDs.5. (Chapters 1. Press.1 Introduction. Using ambiguous grammars. Charles N. 6 Hours 6 Hours Syntax-Directed Translation 6 Hours Syntax-Directed definitions. Jr. Syntax Analysis – 3 More powerful LR parsers. 3. Text Books: 1. Context-free Grammars. Recognition of Tokens. 1997. Introduction to garbage collection Code Generation 6 Hours Issues in the design of Code Generator. Techniques and Tools. Jeffrey D Ullman: CompilersPrinciples. The evolution of programming languages. 7. Andrew W Apple: Modern Compiler Implementation in C. 8. Alfred V Aho. Types and declarations. Access to non-local data on the stack.6) Reference Books: 1.4. Applications of Syntaxdirected translation.1 to 3. Cambridge Univ. 2nd Edition. Ravi Sethi. Heap management.4. Switch statements. leBlanc. 3. Monica S. Lexical analysis: The Role of Lexical Analyzer. Intermediate code for procedures. Kenneth C Louden: Compiler Construction Principles & Practice. Programming language basics. 1997.Compiler Design Subject Code: 13MCA546 Hours/ Week: 4 Total Hours: 52 IA Marks: 50 Exam Hours: 3 Exam Marks: 100 Introduction. Thomson Education. Optimization of basic blocks. Writing a Grammar. Control flow. Network Threats and Data Integrity. Data and Software Protection Techniques. Hadoop Library from Apache. Peer-to-Peer Network Families. Middleware Support for Virtualization. Programming and Runtime Support. 111 . Energy-Efficiency in Distributed Computing. Traditional Features Common to Grids and Clouds. Architectural Design Challenges. Resource Provisioning and Platform Deployment. Fundamental Cluster Design issues.and Software-as-aService (Paas. Trends towards Distributed Operating Systems. Design Objective of Computer Clusters. Microsoft Windows Azure. Google App Engine (GAE). Virtualization Support and Disaster Recovery. Public Clouds and Service Offerings. and Hybrid Clouds. Virtual machines and Virtualization of clusters and Data centers: Implementation levels of virtualization: levels of virtualization Implementation. scalable computing Trends and New Paradigms. Amazon Web Service (AWS). Architectural Design of Compute and Storage Clouds: A Generic Cloud architecture Design. Virtualization support at the OS level. Distributed Intrusion/Anomaly Detection. Fault-Tolerance and System Availability. MapReduce. Parallel and Distributed Programming Paradigms: Parallel Computing and Programming Paradigms.A. Layered Cloud Architectural development. Platform. G ri d Computing Infrastructures. Infrastructure-as. Cloud Platform Architecture over Virtualized Data Centers 5 Hours Cloud computing and Service Models: Public. Data Features and Databases. Computer Clusters for scalable parallel computing 6 Hours Clustering for massive parallelism: Cluster Development Trends. Security. SaaS). Internet of Things and Cyber-Physical Systems. Twister and Iterative MapReduce. and Energy-Efficiency: Performance Metrics and Scalability Analysis. Software Environments for Distributed Systems and Clouds: Service-Oriented Architecture (SOA).CLOUD COMPUTING Subject Code: 13MCA551 Hours/Week: 4 Total Hours: 52 I.Service (IaaS). AWS.a. Virtual Machine Creation and Management. Marks: 50 Exam Hours: 3 Exam Marks: 100 Distributed System Models and Enabling Technologies 8 Hours Scalable Computing Service over the Internet: The Age of Internet Computing. Cloud Ecosystem and Enabling Technologies. Cloud Computing over the Internet. Cloud Security and Trust management: Cloud Security Defense Strategies. Cloud Programming and Software Environments 8 Hours Features of Cloud and Grid Platforms: Cloud Capabilities and Platform Features. and Azure: Smart Cloud. Performance. Public Cloud Platforms 7 Hours GAE. Parallel and Distributed Programming Models. Inter-cloud Resource Management: Extended Cloud Computing Services. Private. VMM Design requirements and providers. System Models for D i st ri b ut e d and C l oud Co mputi n g: Clusters of C oo pe ra t i ve C o m p u t e r s . Kumar Sourabh.4. Google File System (GFS). Chubby. Amazon Elastic Block Store EBS and SimpleDB. News and Alert Services. MK Publishers. Online social and Professional Networking: Online Social Network Characteristics. 2012. Hurwitz. 2nd Edition. Cloud Computing for Dummies: J. Google’s Distributed Lock service. and Hadoop. Cloud Computing: Web-Based Applications that change the Way you work and collaborate Online. Ubiquitous Clouds and the Internet of Things 8 Hours Performance of Distributed Systems and the Cloud Data-intensive Scalable Computing (DISC). 2012. Programming on Amazon AWS and Microsoft Azure: Programming on Amazon EC2. MapReduce. and OpenStack. Sector/Sphere. 112 .Programming Support of App Engine 10 Hours Programming the Google App Engine. EC2. Facebook: The World’s Largest Content-Sharing Network. Volte.6.9 Reference Books: 1. Graph-Theoretic A n a l y s i s o f S o c i a l networks. Anthony T. Robert Elsenpeter: Cloud Computing. Kai Hwang. ISBN 978-0-470-484-8 4. Quality of Service in Cloud computing. From Parallel Processing to the Internet of Things. Azure. Volte. Cloud Computing. Chapters – 1. and Geoffrey Fox: Distributed and Cloud Computing. Open Nebula. Michael Miller. Emerging Cloud Software Environments: Open Source Eucalyptus and Nimbus. 3. Google’s NOSQL system. Wiley India. A Practical Approach. Twitter for Micro blogging.2. 2010. Benchmarking MPI. Toby J. Dr. Microsoft Azure programming support. Amazon Simple Storage Service S3. C o m m u n i t i e s a n d A p p l i c a t i o n s o f S o c i a l Networks. Bigtable. 2. Jack Dungaree.5. McGraw Fill. Manjrasoft Aneka Cloud and Appliances. Pearson Publication.3. Text Book: 1. Examples of usage of AJAX. Getting the data in to array format. AJAX principles. Creating the JavaScript. Handling whitespace in Firefox. Dynamic web applications through Hidden frames for both GET and POST methods. Wrapping applications in to a single PHP page. Technologies behind AJAX. Understanding Flex and Flash Authoring. Sending data to the server using GET and POST. Downloading images with Ajax. Creating google. Further examples of Rich Internet Applications with Ajax Ajax Patterns 4 Hours Predictive fetch pattern. IFrames. Adding Server-side programming. Multi stage download. Accessing any XML element. HTML header request and Ajax. Submission throttling pattern. DOM. Downloading from other domains with Ajax. Periodic refresh.WEB 2. The Differences between Traditional and Flex Web Applications. Flex – 1: Understanding Flex Environment and Layouts 6 Hours Introduction: Understanding Flex Application Technologies.Building Applications with the Flex Framework: Using Flex 113 . Data download. Handling timeouts in Ajax. Using Flex Elements. Examples.php. Defeating caching. Asynchronous communication and AJAX application model. Fall back patterns Working with PHP and DOM in Ajax 6 Hours Working with PHP server variables. Analysis of example ajax. Validating input from the user. connecting to Google Suggest. Working with Data Services (Loading Data at Runtime). Using inner functions. Handling cross-browser whitespace. Getting the document element. Replacing elements using the DOM. Using an array of XMLHttpRequest objects. Example programs. Using two XMLHttpRequest objects. Appending new elements to a web page using the DOM and Ajax. Connecting to the server. Creating and opening the XMLHttpRequest object. Downloading JavaScript. Accessing XML data directly.html. Understanding How Flex Applications Work. Handling multiple XMLHttpRequest objects in the same page. Ajax with XMLHTTP object 6 Hours Creating Ajax Applications: An example. Validating XML. Validating integers and text.0 AND RICH INTERNET APPLICATIONS SubCode: 13MCA552 Hrs/Week: 4 Total Hours:52 IAMarks:50 Exam Hours:3 Exam Marks:100 Building Rich Internet Applications with AJAX 6 Hours Building Rich Internet Applications with AJAX: Limitations of Classic Web application model. Building XML and working with XML in JavaScript. Displaying the fetched data. Understanding the Component Life Cycles. Making Fluid Interfaces. Handling State Events. Skinning components. Setting Properties. Navigators. (Chapters 1 to 3) 2. Creating Custom Transitions.Appearance: Using Styles. Enabling Data Binding for Custom Classes. Handling Events. Data Binding Examples. Building data binding proxies. 2011.Tool Sets. O’Reilly. Differentiating Between Flash Player and the Flex Framework. Setting Styles. Socialization and cocreation of content. collaborative tagging and folksonomies. Understanding State Life Cycles. Flex – 4: Working with Data Models and Data Binding 4 Hours Working with Data: Using Data Models. Text Components. Microformats. Ontologies. Data Ownership. (Listed topics from Chapters 3. Validating and Formatting Data: Validating user input. Framework Fundamentals: Understanding How Flex Applications Are Structured. (Listed topics from Chapters 1 to 8. Loading and Initializing Flex Applications.0 3 Hours Overview of semantic web. Value Selectors. Interfaces. Caching the Framework. Impacts of the Next Generation of the web 3 Hours Business models for Internet and web. Languages of the Semantic Web. Understanding Application Domains. Deploying Applications. Building Applications. 2011. Pop-Up Controls. Loading One Flex Application into Another Flex Application.0 Elsevier. Making MXML Interactive Working with UI Components: Understanding UI Components. Text Books: 1. Buttons. List-Based Controls. Steven Holzner: Ajax: A Beginner’s Guide. Using XML Flex – 3: Working with States 6 Hours Managing State: Creating States. 4. Formatting Data. Gottfried Vossen and Stephan Hagemann: Unleashing Web 2. MXML and ActionScript Correlations. Applying States. Tata McGraw Hill. Inc 2011 (Listed topics from Chapters 5 and 6) 114 . Understanding ActionScript Syntax. 12) Reference Books: 1. Chafic Kazon and Joey Lott: Programming Flex 3. publications. Wiley India. 11. Variables and Properties. 12 to 15) 2. Using Transitions. Creating Projects. Defining States. Control Bars Customizing Application. Setting Event Handlers. Runtime CSS ActionScript: Using ActionScript. Inheritance. Creating Custom Effects. Using Effects and Transitions: Using Effects. Using Action Scripts to Define States.Nicholas C Zakas et al: Professional AJAX. Data Binding. Customizing the preloader. Themes. When To Use States. Flex – 2: Working with MXML and ActionScript 8 Hours MXML: Understanding MXML Syntax and Structure. The Semantic web and Web 2. Putting It All Together. Adding and Removing Components. Error Handling. 7. Localization. Managing Object Creation Policies. Managing Layout: Flex Layout Overview. SAAS. 8. Wiley India.0. 2007. O’Reilly Publications. 4. 7.0 From Concepts to Creativity. 2006. Elsevier. McGraw Hill. Justin Gehtland et al: A Web 2. 2007. 2007. 2008.3. 5. Eric Van derVlist et al: Professional Web 2. 6. Colin Moock: Essential Actionscript 3. Gottfried Vossen.0 primer Pragmatic Ajax. Steven Holzner : Ajax Bible Wiley India .0 Programming. Thomas A. SPD Publications. Powel: Ajax The Complete reference. 115 . Stephan Hagemann: Unleashing Web 2. 2007. Complex Queries and Combining Evidence. The Vector Space Model. Web Search. Training. User Interaction.. Text Acquisition. Information Extraction. UNIT 7 RETRIEVAL MODELS 12 Hours Overview of Retrieval Models . Document Feeds. Auxiliary Structures. Link Analysis. Ranking and Evaluation UNIT 3 CRAWLS AND FEEDS 6 Hours Deciding what to search. Search Engines. Detecting Duplicates. Internationalization 8 Hours UNIT 5 RANKING WITH INDEXES 6 Hours Abstract Model of Ranking. Machine Learning and Information Retrieval . Efficiency Metrics. Delta Encoding. and Statistics Text Books and References 1. Logging . Document Parsing. Compression. Inverted indexes. I.Marks :50 Exam Hours : 3 Exam Marks: 100 4 Hours UNIT 2 ARCHITECTURE OF A SEARCH ENGINE 5 Hours Architecture. Basic Building Blocks. Information Retrieval as Classification. Query Processing. Storing the Documents. Document Structure and Markup. Search Engines: Information Retrieval in Practice: Trevor Strohman. Text Transformation Index Creation. Boolean Retrieval .Information Retrieval and Search Engines Subject Code: 13MCA553 Hours/Week: 4 Total Hours: 52 UNIT 1 INTRODUCTION Information Retrieval. Probabilistic Models. Testing. UNIT 4 PROCESSING TEXT Text Statistics. Showing the Results Cross-Language Search. Bruce Croft Donald Metzler. Entropy and Ambiguity. Bit-aligned codes. Crawling the Web. Conversion Problem. BM25 Ranking Algorithm. UNIT 6 QUERIES AND INTERFACES 5 Hours Information Needs and Queries . Kindle Edition 116 . Effectiveness Metrics. Recall and Precision Averaging and Interpolation .A.Query Transformation and Refinement . Directory Crawling. Index Construction. removes noise. Search Engineers. UNIT 8 EVALUATING SEARCH ENGINES 6 Hours The Evaluation Corpus . Extension principle. Mathematics of fuzzy set theory. Implication rules – mamdani implications.Soft Computing Subject Code: 13MCA554 Hours/Week: 04 Total Hours: 52 I. Selection Methods . Genetic Algorithm in Problem Solving 5 Hours Evolving Computer Programs. Intelligent Behaviour as Adaptive Model Free estimation. Evolving Neural Networks. Fuzzy mapping 6 Hours One to one mapping. Neural Networks and Fuzzy System 6 Hours Neural and Fuzzy Machine Intelligence. Membership functions 8 Hours Universe of discourse. Fuzzy sets. Marks : 50 Exam Hours: 03 Exam Marks: 100 Genetic Algorithm: An Overview 5 Hours History of Evolutionary Computing. Biological Terminology. Adapting the Encoding. Fuzzy membership mapping methods. The Appeal of Evolution. Biological Activations and Signals. Comparison of fuzzy and crisp set theory. Neuronal Dynamical System. Application to real world problems. Neuron Fields. Neural Network Theory 4 Hours Neuron as Functions. Pulse –Coded Signal Functions Text Books: 117 . Exact Mathematical Models of Genetic Algorithm. Encoding a Problem for a Genetic Algorithm. Genetic Operators. Implementing a Genetic Algorithm 5 Hours When should a Genetic Algorithm be used . Fuzziness as Multivalence. Applications and Examples of Genetic Algorithm. Elements of Genetic Algorithm. Signal Monotonicity. Mapping inside fuzzy domain.A. Royal Roads. Theoretical Foundations of Genetic Algorithm 5 Hours Schemas and the Two-Armed Bandit Problem. Introduction to fuzzy set theory 8 hours Probabilistic reasoning. Data Analysis and Prediction. Common Signal Functions. Max-min principle. Parameters for Genetic Algorithm. The Dynamical System Approach to Machine Intelligence: The Brain as a Dynamical System. Genetic Algorithms and Traditional Search Methods. Operations on fuzzy sets. M. 5 Exclude the topic not mentioned in the syllabus) 2. Z. Timothy J. SpringerVerlag. McGraw Hill Inc.1994.T.1.K. India Edition. AddisonWesley.N Sivanandam. 2. 2009. Melanie Mitchell: An Introduction to Genetic Algorithms. Wiley 118 .N Deepa. Thompson Learning.1989. D. Neural Network Design. S. Hagan. Optimization and Machine Learning. Genetic Algorithms + Data Structures = Evolution Programs.M Gupta(Eds).E. 2. Academic Press.1996. 4. Genetic Algorithms in Search. Sinha & M. S. H. 2004. Beale. Goldberg. 4.B. Principles of Soft Computing. Bart Kosko: Neural Networks and Fuzzy Systems – A Dynamical Systems Approach to Machine Intelligence. Demuth and M. 5. Prentice-Hall of India. 2nd Edition. Ross : Fuzzy logic to engineering applications . PHI Learning. India Edition. 3. 2000. Soft Computing & Intelligent System: Theory & Applications. N. Michalewicz . India Edition 3. (Chapters: 1 and 2) Reference Book: 1. (Chapters: 1. Intelligent Storage Array Direct-Attached Storage. Backup and restore Operations. Information Lifecycle Components of Storage System Environment. RAID Array Components. Restore and Restart Considerations. Local Replication Technologies. The SAN and Its Evolution. Business Impact Analysis. Local Replication. NAS File I / O. Data Protection. Backup in NAS Environments. Components of NAS. Disk Drive Performance. Types of Storage Virtualization. SNIA Storage Virtualization Taxonomy. Marks : 50 Exam Hours: 03 Exam Marks: 100 Introduction to Information Storage and Management. Backup and Recovery 6 Hours Information Availability. FC Topologies. BC Technology Solutions. Failure Analysis. Remote Replication 7 Hours Source and Target. Forms of Virtualization. CAS Examples. Business Continuity. Storage Virtualizations Configurations. Components of SAN. Recovery Considerations. Fibre Channel Architecture. Modes of Remote Replication. Features and Benefits of CAS. Backup Granularity. BC Terminology. Backup Technologies. RAID Impact on Disk Performance. Factors Affecting NAS Performance and Availability. and Storage Area Networks 7 Hours Types of DAS. Disk Drive Interfaces. Network Infrastructure. IP SAN 6 Hours General – Purpose Service vs. Application Requirements and Disk Performance. Storage Virtualization 6 Hours Fixed Content and Archives.A. Remote Replication Technologies. NAS. Fundamental Laws Governing Disk Performance. FCIP. RAID Levels. Backup Purpose. Backup Considerations. iSCSI. Storage System Environment 7 Hours Information Storage. Content-Addressed Storage. NAS File-Sharing Protocols. Backup Topologies.Storage Area Networks Subject Code: 10MCA555 Hours/Week : 04 Total Hours : 52 I. Backup Process. Hot Spares Components of an Intelligent Storage System. Fibre Channel Login Types. Zoning. Backup Methods. Securing the Storage Infrastructure. Data Center Infrastructure. Data Consistency. Introduction to Parallel SCSI. Logical Components of the Host. RAID Comparison. Overview of Fibre Channel. Benefits of NAS. BC Planning Lifecycle. Managing the Storage Infrastructure 7 Hours 119 . SCSI. CAS Architecture. Types of Archive. Disk Drive Components. Management Interface. Storage Virtualization Challenges. Evolution of Storage Technology and Architecture. NAS Implementations. FC Connectivity. NAS Devices. Creating Multiple Replicas. Uses of Local Replicas. DAS Benefits and Limitations. Fibre Channel Ports. Object Storage and Retrieval in CAS. Intelligent Storage system 6 Hours Implementation of RAID. NAS I/O Operations. Key Challenges in Managing Information. 2003. 2009. 2. Tata McGraw Hill. Rainer Erkens and Wolfgang Muller: Storage Networks Explained. Managing & Protecting Digital Information in Classic. The Complete Reference. Wiley India. WileyIndia. Risk Triad.Storage Security Framework. Storage Management Activities. EMC Education Services. Alok Shrivastava (Editors): Information Storage and Management: Storing. 3. G. Rebert Spalding: Storage Networks. 2002. Ulf Troppens. Visualized and Cloud Environments. 2nd edition. Somasundaram. Security Implementations in Storage Networking Monitoring the Storage Infrastructure. Developing an Ideal Solution. Text Books: 1. Richard Barker and Paul Massiglia: Storage Area Networks Essentials A Complete Guide to Understanding and Implementing SANs. 120 . Storage Security Domains. ISBN 978-1-1180-9483-9 Reference Books: 1. Storage Infrastructure Management Challenges. Wiley India. 2003. Pearson Education. 121 .A. UNIT II PROJECT EVALUATION 8 Hours Strategic Assessment – Technical Assessment – Cost Benefit Analysis –Cash Flow Forecasting – Cost Benefit Evaluation Techniques – Risk Evaluation. Wiley Edition Second Edition edited by Richard H Thayer Foreword by Edward Yourdon 2. 3. “Software Project Management”. Jack T. Gopalaswamy. Third Edition. Mikecotterell. UNIT III ACTIVITY PLANNING 16 Hours Objectives – Project Schedule – Sequencing and Scheduling Activities –Network Planning Models – Forward Pass – Backward Pass – Activity Float – Shortening Project Duration – Activity on Arrow Networks – Risk Management – Nature Of Risk – Types Of Risk – Managing Risk – Hazard Identification – Hazard Analysis – Risk Planning And Control. 2009. Marchewka. 1999. 2002. Wiley India. 4. Royce. Pearson Education. 5. Software Engineering Project management. TEXT BOOK: 1. REFERENCES: 1. Bob Hughes. 2001. Ramesh. UNIT IV MONITORING AND CONTROL 12 Hours Creating Framework – Collecting The Data – Visualizing Progress – Cost Monitoring – Earned Value – Prioritizing Monitoring – Getting Project Back To Target – Change Control – Managing Contracts – Introduction – Types Of Contract – Stages In Contract Placement – Typical Terms Of A Contract – Contract Management – Acceptance. "Managing Global Projects". Marks : 50 Exam Hours : 3 Exam Marks: 100 UNIT I INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT 6 Hours Project Definition – Contract Management – Activities Covered By Software Project Management – Overview of Project Planning – Stepwise Project Planning. Jalote. Tata McGraw Hill. “Software Project Management”. “Information Technology Project Management”. 3rd edition.Software Project Management Subject Code: 13MCA556 Hours/Week: 4 Total Hours: 52 I. UNIT V MANAGING PEOPLE AND ORGANIZING TEAMS 10 Hours Introduction – Understanding Behavior – Organizational Behavior: A Background – Selecting The Right Person For The Job – Instruction In The Best Methods – Motivation – The Oldman – Hackman Job Characteristics Model – Working In Groups – Becoming A Team –Decision Making – Leadership – organizational Structures – Stress –Health And Safety – Case Studies. Tata McGraw Hill. 2004. “Software Project Management in Practice”. A Marks : 50 Exam Hours: 03 Exam Marks: 50 The student has to draw the necessary UML diagrams using any suitable UML Drawing Tool and implement in Java OR C++ OR C# a program to demonstrate the Design Pattern specified by the Examiner. Sequence/Collaboration Diagram Should be drawn with suitable scenario. 122 . component diagram & deployment diagram. Class Diagram.Software Design Laboratory Subject Code: 13MCA56 Hours/Week : 3 Total Hours : 42 I. The Design Pattern is allotted based on lots from the following list: 1) Expert 2) Controller 3) Publisher-Subscriber 4) Command 5) Forward-Receive 6) Client-Dispatcher 7) Proxy 8) Façade 9) Polymorphism 10) Whole-Part 11) Master-Slave Note: Any Supporting Tool may be used. activity diagram. For Analysis and Design models. diagrams such as Use-case. Weight: int. CourseName: string) tbl_Student (USN: string. 5. PART – B 1. Address: string. New Book Entry 3. Demonstrate arrays of interface types (for runtime polymorphism) with a C# program. BookTitle: string. Consider the Database STUDENT consisting of following tables: tbl_Course (CourseID: int. Entering new course details. 6. 2. ContactNo: int. Author: string. Marks : 50 Exam Hours: 3 Exam Marks: 50 PART A 1. 3. Write a program to demonstrate abstract class and abstract methods in C#. Using Try. 3. StudName: string. Consider the Database STUDENT consisting of following tables: tbl_Course (CourseID: int. DonorName: stirng. 2. BookID: int. weight (above 45KG) and Gender(user’s choice). Write a Program in C# to demonstrate boxing and Unboxing. 5. 2. New Course Entry. Write a program to demonstrate Operator overloading. Find the sum of all the elements present in a jagged array of 3 inner arrays. Catch and Finally blocks write a program in C# to demonstrate error handling. Display the details of donors (in a Grid) having particular blood group. BloodID: int) Develop suitable windows application using C#. Write a Program in C# to demonstrate Command line arguments processing. StudName: string.NET having following options: 1.NET having following options: 1. CourseID: int) tbl_BookIssue(USN: string. DOB: date. CourseID: int. Demonstrate Use of Virtual and override key words in C# with a simple program. 8. Display the details the students who have taken admission in a particular year. 2. Display the details of donors (in a Grid) based on age (above 18). Display the details of donors (in a Grid) based on gender. BloodGroup: string) tbl_Donor (DonorID: int. 7. Write a program to demonstrate delegates.NET having following options: 1. 10. Gender: string. 4. 9. Address: string. IssueDate: Date) Develop suitable windows application using C#. Display the details of students (in a Grid) who belong to a particular course. CourseID: int) tbl_Student (USN: string.. 2.A. 3. Consider the Database BLOODBANK consisting of following tables: tbl_BloodGroup ( BloodID: int. Write a program to illustrate the use of different properties in C#.NET Laboratory Subject Code : 13MCA57 Hours/Week : 3 Total Hours : 42 I. Entering new student details. Entering Blood group details. 4. New Student Entry 123 . 4. 3. Entering new donor details. YrOfAdmsn: int) Develop suitable windows application using C#. CourseName: string) tbl_Book (BookID :int. 4. Issue of books to a student. 5. Generate report (display in a grid) showing all the books belonging to particular course. 6. Generate report (display in a grid) showing all the books issued on a particular date. 7. Generate report (display in a grid) showing all the books issued to a particular student. 4. Develop a Web Application using C#.NET and ASP.NET for an educational institution. The master page should consist of Institution Name, Logo and Address. Also, it should provide hyperlinks to Departments, Facilities Available and Feedback. Each department page and facilities page should be designed as static pages. The hyperlinks should navigate to these static pages in the form of Content Pages associated with Master Page designed. The Feedback page should have fields to enter Name, Email and Message with Submit and Cancel Buttons. Database should be created to store these three data. 5. Develop a Web Application using C#.NET and ASP.NET for a Bank. The BANK Database should consist of following tables: tbl_Bank (BankID: int, BankName: string) tbl_Branch (BranchID: int, BankID: int, BranchName: string) tbl_Account (AccountNo: int, BankID: int, BranchID: int, CustomerName: string, Address: string, ContactNo: int, Balance: real) (Note: AccountNo and BankID together is a composite primary key). The master page of this web application should contain hyperlinks to New Bank Entry, New Branch Entry (of selected Bank), New Customer Entry (based on branch and bank) and Report Generation. The hyperlinks should navigate to respective content pages. These content pages provide the fields for respective data entry. The reports should be generated (display in grid) as below: 1. Display all records of particular bank. 2. Display all records of a branch of particular bank. 3. The balance should be displayed for the entered account number (Bank and Branch are input through ComboBox controls and Account number is input through TextBox). Note: 1. Students are required to execute one question from Part A and one from Part B. 2. Part A has to be evaluated for 20 marks and Part B has to be evaluated for 30 marks 124 Mini Project-II Guidelines Subject Code: 13MCA58 1. A team of only two students must develop the mini project. However during the exami nati on, each student must demonstrate the project individually 2. The team may implement project of their choice using any one of the technologies lear nt in VSemester like OOMD, C# With.NET, using SSM concepts or any other technolog y along with designing of database (mandatory). 3. The team must submit a brief project report (25-30 pages) that must include the following a. b. c. d. e. f. g. h. j. Introduction Literature survey Hardware & Software Requirements System Design Architecture Implementation (screenshots to be included) Testing Conclusion Future enhancements. Bibliography Appendix: User Manual with the help of screen shots and text description 4. The report must be evaluated for 10 Marks. Demonstration for 30 Marks and Viva for 10 Marks 125 VI semester Project Work (13MCA61) General Rules 1. Students are required to take up individual project in companies/Respective Colleges other than the mini project standards already taken up during previous semesters. 2. Project should be real time work, for total of 5 months duration 3. Project work may be application oriented or research oriented as per student and guide‘s interest. Therefore the project reports will vary depending on whether it is application oriented project or research based project. 4. Regular project work weekly dairy should be maintained by the students, signed by the external guide and internal guide in order to verify the regularity of the student. (Enclosing the Format) 5. Seminars / presentation should be given at Synopsis, SRS, Design and Project Completion levels. 6. Project verification at the place of project work must mandatory by the internal guide, for completion of the work. 7. If project report is not as per the format and not a real time project, external guides will have every right to reject the project 8. Examination Marks IA – 50 Marks Dissertation – 125 Viva Total – 75 – 250 Marks 9. Students are encouraged and appreciated to show their project code demo along with their power point slide show during their viva-voce exams as an added advantage. Guidelines for the Preparation of Project Reports 1. Printing Area: The margins should be: Left: 1.25”, Right: 1.00”, Top and Bottom1.00”. The text should be justified to occupy the full line width, so that the right margin is not ragged, with words hyphenated as appropriate. Please fill pages so that the length of the text runs to the right margin. 2. The report must be printed on one side only. Please use a high-resolution printer, preferably a laser printer with at least 300 dpi. Project reports must be printed neatly on 126 nouns.e. “Self-determinations of Man”. Table 1 Font sizes of headings. The final sentence of a table caption should end without a period Heading Example Font Size and Style Title Chapter 1 16 Point Bold Introduction First Level 1. Here are some examples of headings: “Criteria to Disprove Context-Freeness of Collage Languages”. and Numbering: For the main text. be aligned to the left. with the exception of the title.3. Headings. prepositions. “A User-Friendly and Extendable Data Distribution System”.1. 5.one side of the paper on a A4 size bond paper. It should be set in 12-point font size. “On Correcting the Intrusion of Tracing Non-deterministic Programs by Software”. The reports submitted to the department/guide(s) must be hard bounded with dry tone Xerox. Abstract: The abstract should summarize the contents of the report and should contain at least 150 and at most 350 words. Bold type and underlining should be avoided.5 line spacing. Typeface.1. and conjunctions should be set with an initial capital) and should. please use 12-point type and 1. The font sizes are given in Table 1. and all other words except articles. There should be two blank (10-point) lines before and after the title ABSTRACT. verbs. Font Sizes. 4. Headings should be in the form where each word is capitalized (i. 3. We recommend using Times New Roman fonts. Mandatory 12 Point Bold Heading or Regulatory Signs Third Level Stop and Give 12 Point Bold Heading away signs Fourth Level Creation of 12 Point Bold Heading database Italicized 127 . Layout. Table captions should always be positioned Above the tables. Italic type may be used to emphasize words in running text. “Multi-flip Networks: Parallelizing GenSAT”.. The chapter headings should be in capitals and must be separated from the other text by 24point line space. Preamble 14 Point Bold Heading Second Level 2. Formulas Displayed equations or formulas are centered and set on a separate line (with an extra line or halfline space above and below). Here. The last sentence of a figure caption should generally end without a period.g.1.. Example of an Algorithm is Algorithm-1: Database Creation (Mean and Standard Deviation based approach) 128 . the distance between figure and caption about 6 point spacing. e. in contrast to the caption belonging to a table. Please center the captions between the margins and set them in 9-point type (Fig. Program Code Program listings or program commands or algorithms in the text are normally set in typewriter font.Figures and Photographs Check that in line drawings. The lettering in figures should have a height of 2 mm (10-point type). lines are not interrupted and have constant width. CMTT10 or Courier. 1 shows an example). and are the feature vectors of query examples dimension of feature . with numbers enclosed in parentheses and set on the right margin. The distance between text and figure should be about 12 point spacing. Displayed expressions should be numbered for reference. Figures should be scaled up or down accordingly. Figures should be numbered and should have a caption which should always be positioned under the figures. A correlation matrix is computed using equation (5). which should always appear above the table. For example. and and is the 7. Grids and details within the figures must be clearly readable and may not be written one on top of the other. Fig 1. The numbers should be consecutive within each section or within the contribution. 6. 1.2.1. An example is given at the end of this information sheet. [2]. Please do not insert a page break before the list of references if the page is not completely filled. Header sample: (Project title is left aligned and page number is right aligned) <<Project Title>> Sample Footer: <College Name> Department of MCA 2013-2014 <<Page Number>> 9. [3] etc. in front of the appendix.3. must be incorporated. Every copy of the report must contain (See formats towards the end of this document) • Outer title page (parrot green) with a plastic cover • Inner title page (White) • Certificate in the format enclosed. with a line of about 5 cm in Word set immediately below/above the text. Step3: calculate a feature vector as mentioned in section 4. For End. based on number of components present in the sign. the approval of the concerned guide is mandatory and suggested corrections. The total number of reports to be prepared are three • One copy to the concerned guide • One copy for University • One copy to candidate • Two CD’s having soft copy of Project report (for department purpose) 12. Step4: Store the feature vector computed in step 3 in the corresponding database. Before taking the final printout. 10. if any exists. 8. 11. Footnotes/ Header Footnotes/Header should appear at the bottom of the normal text area. 13. Methodology: For each input image do Step1: Preprocess the image as explained in section 4. Page Numbering Reports must be printed with page numbers on the top right corner. For citations in the text please use square brackets and consecutive numbers: [1]. Algorithm End.Input: Static images of potential traffic sign Output: Database created. The list should be set in small print and placed at the end of the dissertation. if any.3.3. only certificate will be signed by following: o Principal 129 .1 Step2: Calculate the number of components in a sign as explained in section 4. The list of references is headed “References” and is assigned a number with square brackets in the decimal system of headings. Care should be taken to avoid spelling and typing errors.o HOD o Internal guide and External guide (if project is carried out in company) o Guide and/or Co-guide (if project is carried out in college) 14. 130 . The organization of the report should be as follows o Inner title page o Certificate o Project Completion certificate from Company / College o Declaration (by student) o Acknowledgement o Abstract o Table of Contents o List of table and figures o Main body of project Proper attention is to be paid to the technical contents as well as to the organization of the report and clarity of the expression. Sample content (more suitable for Application oriented projects) is attached and number of pages may be 40-70 which can be modified as per guide’s instructions depending on the project under development. as a specific format cannot be defined for various domains of research problems. The student should note that report (write-up) forms the important component in the overall evaluation of the project. The respective guides can decide how the content of the project report must be organized if the project is research oriented. 8.2 CONTEXT DIAGRAM (1-2 pages) DETAILED DESIGN (various design diagrams according to project) 00 5.1 PROJECT DESCRIPTION (2-4 pages) 1.4 HARDWARE AND SOFTWARE REQUIREMENTS (1 page) 00 SOFTWARE REQUIREMENTS SPECIFICATION 3.3 COLLABARATION DIAGRAMS (3-5 pages) 5. 9. 6.2 COMPANY PROFILE (1-2-3 pages) LITERATURE SURVEY 2.1 USE CASE DIAGRAM (4-6 pages) 5. 4.)(6.1 EXISTING AND PROPOSED SYSTEM(2-3 pages) 2.1 USERS (2-3 pages) 3.5 DATABASE DESIGN (ER and/or Conceptual schema)(3-4 pages) IMPLEMENTATION (no full code. 5. 7.2 FUNCTIONAL REQUIREMENTS (2-3 pages) 3. code snippet may be included) 00 6.1 SYSTEM PERSPECTIVE (1-2 pages) 4.2 SEQUENCE DIAGRAMS (4-6 pages) 5.1 SCREEN SHOTS (15-20 pages) SOFTWARE TESTING (Test cases etc.8 pages) CONCLUSION (1 page) FUTURE ENHANCEMENTS (1 page) BIBLIOGRAPHY USER MANUAL (1 page) (2-10 pages) 0 0 0 0 0 0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 Appendix A Appendix B 131 .3 NON-FUNCTIONAL REQUIREMENTS (2-3 pages) SYSTEM DESIGN (High level or Architectural design) 4.4 ACTIVITY DIAGRAM (4-6 pages) 5.CONTENTS (For Application oriented Projects) 1.3 TOOLS AND TECHNOLOGIES USED (2-4 pages) 2.2 FEASIBILITY STUDY (2-3 pages) 2. INTRODUCTION 1. 3. 2. Pincode.(COVER PAGE) PROJECT TITLE A Dissertation submitted in partial fulfillment of the requirements for the award of degree of MASTER OF COMPUTER APPLICATIONS of Visvesvaraya Technological University By STUDENT NAME (USN Number) Under the Guidance of GUIDE NAME logo Department of Master of Computer Applications. June 2013 (Inner Title Page) PROJECT TITLE A Dissertation submitted in partial fulfillment of the requirements for the award of degree of MASTER OF COMPUTER APPLICATIONS of Visvesvaraya Technological University By STUDENT NAME (USN Number) Under the Guidance of Internal Guide: Guide: Guide Name Affiliation Address Address Email : logo External Name Affilation/ Address Email : Department of Master of Computer Applications. Address. Institute Name. Pincode. June 2013 (Certificate) INSTITUTE NAME LOGO 132 . Institute Name. Place. Place. Address. <Designation of Guide> and submitted in partial fulfillment of the requirements for the award of the Degree of Master of Computer Applications by the Visvesvaraya Technological University during the academic year 2014./Director Declaration Principal I. Institute Name Address CERTIFICATE This is to Certify that Student Name has completed his/her final semester project work entitled “******” as a partial fulfillment for the award of Master of Computer Applications degree. <Name of student>. bearing USN <USN of student> hereby declare that the project entitled <Project Title> has been carried out by me under the supervision of External Guide /(or Guide) <Name of the Guide>. Signature of Internal Guide Guide Name Affiliation Address Signature of External Guide Guide Name Affiliation Address Head of the Dept. This report has not been submitted to any other Organization/University for any award of degree or certificate.Department of Master of Computer Applications. <College Name>. student of 6th MCA. <Designation of Guide> and Internal Guide (or Co-guide) <Name of the Guide>. Name: Signature: 133 . during the academic year 2013 under my (our joint) supervision. Final Testing and Results with technical conclusions – 25 Marks Total Marks: Signature of the External Examiner with Name and Date 134 . to be explained by the external examiner – 50 Marks 3. Project Standard with respect to the post graduation / research / application oriented. Relevance of the project with respect to real scenario: (External Examiner will have to write maximum of 5 lines for this) – 50 Marks 2.External Examiner Project Dissertation Evaluation Form Project Title: Student Name With USN: 1. Documents Similar To mcaschsyll2013Skip carouselcarousel previouscarousel nextJ2EE Lab Manual RvceMultimedia DatabaseCS 1305 - Network Lab ManualSQL Workbench Manual57260495-JavaLabProgWithExplanationClass Group2_mcqz 02570000120154003 p 03ns_docSn Labwork WholeADA+Lab+All+ProgramsCIS-311relational-object-oriented-and-multi-dimensional-databasesArtificial Intelligence Units 3 and 4McGraw-Hill-mis-2010.pdfMSC NEW Final Printing01.09.15Chapter 2 EditedFinal LecInformation technologyThe New Data PumpRelational Databases FinalAssignment 1ComputerAlfresco Community Edition 3 3 Windows Simple InstallDBMS-MCQs-Gr8AmbitionZBCA Syllabusrbafz-DB2 for i SQL Reference 7.1.pdfDD_1_3_PracticeQuiz Entrepreneurship MC0077 Advanced Database Systems Set û 1Best Books About Class (Computer Programming)Java: Programming: Your Step by Step Guide to Easily Learn Java in 7 Daysby iCodeAcademyJava : Learn The Way How Your Brain Works.by Harry. H. Chaudhary.Core Java Professional : Advanced Features (Core Series) Updated To Java 8.by Harry. H. Chaudhary.Core Java Professional : for the Really Impatient.by Harry. H. Chaudhary.Java : Complete First Time Beginner's Reference for the Really Impatient.by Harry. H. Chaudhary.Java : The Complete Core Reference for the Really Impatient.by Harry. H. Chaudhary.Footer MenuBack To TopAboutAbout ScribdPressOur blogJoin our team!Contact UsJoin todayInvite FriendsGiftsLegalTermsPrivacyCopyrightSupportHelp / FAQAccessibilityPurchase helpAdChoicesPublishersSocial MediaCopyright © 2018 Scribd Inc. .Browse Books.Site Directory.Site Language: English中文EspañolالعربيةPortuguês日本語DeutschFrançaisTurkceРусский языкTiếng việtJęzyk polskiBahasa indonesiaSign up to vote on this titleUsefulNot usefulMaster Your Semester with Scribd & The New York TimesSpecial offer for students: Only $4.99/month.Master Your Semester with a Special Offer from Scribd & The New York TimesRead Free for 30 DaysCancel anytime.Read Free for 30 DaysYou're Reading a Free PreviewDownloadClose DialogAre you sure?This action might not be possible to undo. Are you sure you want to continue?CANCELOK