JMIT Academic Calendar Session 2015-16 Second …jmit.ac.in/wp-content/uploads/2016/04/MCA-2nd-sem.pdf · · 2016-04-22What is basic block optimization and how it is done? 4

SETH JAI PARKASH MUKAND LAL INSTITUTE OF ENGINEERING &

TECHNOLOGY, RADAUR

JMIT

Academic Calendar Session 2015-16 Second Semester

Name ………...………………………………………. Roll No …………………………………………………

Department of Computer Science and Application’s (MCA Deptt.)

CONTENTS

Sr. No. Subject Code Contents 1. MCA-II SCHEME OF EXAMINATION FOR MCA-II SEMESTER

2. MCA-14-21 SYSTEM PROGRAMMING

3. MCA-14-22

OBJECT ORIENTED PROGRAMMING USING C++

4. MCA-14-23 PRINCIPLES OF PROGRAMMING LANGUAGES

5. MCA-14-24 DATA STRUCTURES

6. MCA-14-25 WEB TECHNOLOGIES

7. MCA-14-26 S/W LAB–III BASED ON MCA-14-22 & MCA-14-24

8. MCA-14-27 S/W LAB–IV BASED ON MCA-14-25

9. MCA-14-28 Seminar

SCHEME OF EXAMINATIONFOR MASTER OF COMPUTER APPLICATIONS (Three Year Programme) SEMESTER-II

Semester – II

Paper No. Title of the Paper Duration Of Exam

Maximum Marks Total Theory Sessional*

MCA-14-21 SYSTEM PROGRAMMING 3 Hours 80 20 100

MCA-14-22

OBJECT ORIENTED PROGRAMMING USING C++

3 Hours 80 20 100

MCA-14-23 PRINCIPLES OF PROGRAMMING LANGUAGES 3 Hours 80 20 100

MCA-14-24 DATA STRUCTURES 3 Hours 80 20 100

MCA-14-25 WEB TECHNOLOGIES 3 Hours 80 20 100

MCA-14-26 S/W LAB–III BASED ON MCA-14-22 & MCA-14-24

3 Hours 100

MCA-14-27 S/W LAB–IV BASED ON MCA-14-25 3 Hours 100

MCA-14-28 SEMINAR 20

Total 720

MCA-14-21 SYSTEM PROGRAMMING

Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

UNIT – I System Software: Definition, Goals of System Software, Program Development and Production Environments, Software Portability, Programs as components, Quick and Dirty Programming, User- Centric and System-Centric view of System Software. Language Processors: Types of Language Processors, Program Generation, Program Execution, Program Translation and Interpretation, Fundamentals of Language Processing, Symbol Tables.

UNIT – II Assemblers: Elements of Assembly language Programming, Pass Structure of Assemblers, Design of Twopass assembler, Intermediate code forms, Program Listing and Error reporting, Organizational and Design issues in assemblers. Macros and Macro Preprocessors: Macro Definition and Call, Macro expansion, Nested Macro calls, Design of a Macro preprocessor, Processing of Macro definitions, Use of Stack in expansion of macro calls, Design of a macro assembler

UNIT – III

Linkers and Loaders: Linking & Relocation, Design of a Linker, Self-Relocating, Dynamic Linking, Linking for program overlays, Loaders, Absolute and Relocating loaders. Scanning and Parsing: Chomsky hierarchy of formal languages, Ambiguous grammars, Scanning, Parsing: Top-down and Bottom-up Parsing.

UNIT – IV Compilers and Interpreters: Binding and Binding times, Data Structures of compilers, Scoping rules, Memory allocation, Static and dynamic memory allocation and deallocation, Recursion, Compilation of expressions, Postfix notations, Expression trees, Compilation of Control structures, Code Optimization, Local and Global optimization, Overview and benefits of interpretation, Pure and impure interpreters. Text books: 1. Dhamdhere D.M, “System programming”, Tata McGraw-Hill. 2. Beck L. Leland, “System Software”, Pearson Education. Reference Books: 1. Aho, Sethi, & Ullman, “Compilers Principles, Techniques and Tools”, Pearson Education. 2. Donovan J. John, “System Programming”, Tata McGraw Hill.

Lecture Plan

MCA-14-21 Lecture Topics L1 Definition, Goals of System Software L2 Program Development and Production L3 Environments, Software Portability, L4 Programs as components, L5 Quick and Dirty Programming, L6 User-Centric and System- L7 Centric view of System Software. L8 Types of Language Processors, L9 Program Generation, Program Execution, L10 Program Translation and Interpretation, L11 Fundamentals of Language Processing, Symbol Tables. L12 Assemblers: Elements of Assembly language Programming L13 Pass Structure of Assemblers, L14 Design of Two pass assembler Intermediate code forms L15 Program Listing and Error reporting, L16 Organizational and Design issues in assemblers. L17 Macros and Macro Preprocessors: Macro Definition and Call, L18 Macro expansion, Nested Macro calls, L19 Design of a Macro preprocessor, L20 Processing of Macro definitions, L21 Use of Stack in expansion of macro calls, L22 Design of a macro assembler L23 Linkers and Loaders: Linking & Relocation, Design of a Linker, L24 Self-Relocating, Dynamic Linking, L25 Linking for program overlays, L26 Loaders, L27 Absolute and Relocating loaders. L28 Chomsky hierarchy of formal languages, L29 Ambiguous grammars, L30 Scanning, Parsing: Top-down and Bottom-up Parsing. L31 Compilers and Interpreters: Binding and Binding times, L32 Data Structures of compilers, L33 Scoping rules, Memory allocation, Static and dynamic memory allocation and deallocation L34 Recursion, Compilation of expressions, L35 Postfix notations, L36 Expression trees, L37 Compilation of Control structures, L38 Code Optimization, L39 Local and Global optimization, L40 Overview and benefits of interpretation,

L41 Pure and impure interpreters.

Tutorial sheet 1 1. What is quick and dirty programming? 2. What is language processor? Explain its types in detail .Give example. 3. What is system software? Explain goals for system software. 4. What is program? Diffrentiate Software and Program. 5. Explain: (a) Symbol Table (b) Macro (c) Linker (d) Loader Tutorial sheet 2

1. What is Parsing? Explain top-down parsing and bottom-up parsing. 2. What is a Program? Differentiate program interpretation and program translation. 3. What is regular Grammar? Explain its capabilities. 4. Differentiate static and dynamic memory allocation. 5. Explain:

(a) Ambiguous Grammar (b) Compiler (c) Assembler

Tutorial sheet 3

1. Explain macro processing with language translation. 2. Explain the analysis and synthesis model of compiler. 3. What is compiler? Explain the design issues of the compiler. 4. Differentiate pure and impure interpreters. 5. What are code improving transformations in compilers?

Tutorial sheet 4

1. Explain the schemes of Linkage Editors. 2. Explain:

(a) Binding times (b) Interpreter

3. What is basic block optimization and how it is done? 4. Differentiate syntax trees and parse trees. 5. What are the capabilities of context free grammar? Explain with the help of example.

MCA-14-22 OBJECT ORIENTED PROGRAMMING USING C++ Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

UNIT - I Introduction: Object-Oriented features of C++, Comparison of C with C++, Class and Objects, Inline functions, Static data members and member functions, Read-Only objects, Pointers, Dynamic memory allocation and deallocation, constructors and destructors, Dynamic objects, array of pointers to object, local and global class, nested and empty class, preprocessor directives, Header files and namespaces. Console I/O: Hierarchy of console stream classes, unformatted and formatted I/O operations, Manipulators.

UNIT - II Compile-time Polymorphism: Operator Overloading-overloading unary and binary arithmetic and relational operators, overloading subscript, insertion, extraction, new and delete operators; function overloading Friend Function and Friend Class: Friend function, overloading operators by friend function, friend class Type Conversion: Basic type conversion, conversion between Objects and Basic Types, conversion between objects of different classes.

UNIT - III

Inheritance: Base and Derived Classes, Protected Members, Casting Base-Class Pointers to Derived- Class Pointers, Using Member Functions, Overriding Base–Class Members in a Derived Class, Public, Protected and Private Inheritance, Using Constructors and Destructors in derived Classes, Implicit Derived–Class Object To Base-Class Object Conversion, Composition Vs. Inheritance. Virtual Functions & Derivations: Virtual functions and their needs, Pure virtual function, virtual destructor, virtual derivation, abstract class.

UNIT - IV Generic Programming: Function Templates, Overloading Template Functions, Class Template, Class Templates and Non-Type Parameters. Exception Handling: Try, Throw, Catch, Throwing an Exception, Catching an Exception, Re-throwing an Exception. File Handling: Hierarchy of File Stream classes, Opening and Closing files, File modes, testing for errors, File pointers and their manipulations, ASCII & Binary files, Sequential and Random access files. Text Books: 1. Bjarne Stroustrup, “The C++ Programming Language”, Pearson Education. 2. Balaguruswami, E., “Object Oriented Programming In C++”, Tata McGraw-Hill. Reference Books: 1. Herbert Shildt, “C++: The Complete Reference”, Tata McGraw-Hill. 2. Joyce Farrel., “Object Oriented Programming Using C++”, Cengage Learning. 3. Forouzan, Gilberg, “Computer Science: A Structured Programming Approach Using C++”, Cengage Learning. 4. Robert Lafore, “Object Oriented Programming in C++”, Techmedia SAMS. 5. Bhave M.P., Patekar S.A., “Object Oriented Programming with C++”, Pearson Education.

Lecture Plan MCA-14-22

Lecture Topic 1. Introduction to C++ 2. Object-Oriented features of C++ 3. Comparison of C with C++ 4. Class and Objects 5. Inline functions 6. Static data members and member functions 7. Read-Only objects and Pointers 8. Dynamic memory allocation and deallocation 9. constructors and destructors 10. Dynamic objects 11. Array of pointers to object 12. local and global class 13. Nested and empty class 14. preprocessor directives, namespace 15. Hierarchy of console stream classes 16. Unformatted and formatted I/O operations 17. Manipulators, This pointer 18. Operator Overloading 19. Overloading unary and binary arithmetic and relational operators 20. Overloading subscript, array, insertion, extraction, new and delete operators. 21. Friend function 22. Function overloading 23. Overloading operators through friend function 24. Basic type conversion 25. Conversion between Objects and Basic Types 26. Conversion between objects of different classes 27. Inheritance and different types of inheritance 28. Roles of constructors and destructors in inheritance. 29. Virtual functions and their needs, pure virtual function 30. virtual destructor and virtual derivation 31. Abstract class 32. Template functions and Template class

33. Exception handling features of C++. 34. Hierarchy of File Stream classes 35. Opening and Closing files 36. File modes and testing for errors 37. File pointers and their manipulations 38. ASCII & Binary files 39. Sequential and Random access files.

TUTORIAL SHEET NO. 1

1. Answer the following questions in brief:

(a) Distinguish between inline function and external linkage function.

(b) Differentiate between p a r a m e t e r i z e d and non-parameterized

manipulators. 2. · Explain static data member, read only method, destructor and namespace with

examples.

3. (a) Draw the hierarchy of classes involved in console I/0 and explain the purpose of each class in brief.

(b) Explain the formatted console I/0 with examples. 4. Define a class”ACCOUNT” include following members: Data Members: Name of Depositors, Account No., Type of Account,Balance .Member Function: To assign initial values, Deposit Amount,amount,withdraw after checking balance. To display name and balance write main program to test the program for 10 customers. 5 Write a program in C++ to read a file and to i) Display the contents of file on screen ii) Display the number of characters iii) Number of lines in the file


1. (a) Overload array operator. (b) Explain the need of friend function through an example.

(c). What are real time applications of preprocessor directives in C++? Explain define, undef directives with examples (d) . What are dynamic constructors? Give examples. Also explain the characteristics of destructors? 2. a) How can you convert one type of object into another type of object? Write a Program to convert object of Radian class (angle in radian=angle in radian * PI/180). b) Define a stream, what are the three streams used for inputting, outputting and both for

inputting and outputting? 3. How are the pre-incrementer and post incrementer taken care while declaring the operator overloading? Can operator precedence be changed through operator overloading? 4. a) Explain the mechanism of unary operator overloading? Also explain the overloading of operator ‘+’to add two complex numbers using a Friend function. b) What are the rules to overload operators? Overload insertion, new and subscript operators. 5. a) What is a friend function? Overload ‘*’ operator to multiply two complex numbers through friend function. b) What are the differences to overload operators as member function and as friend function? c) How can you convert basic types into object types? Explain with an example.


1. (a) What is pure virtual function? Explain its purpose.

(b) · Distinguish between normal member function and constructor. 2. (a) What is multilevel inheritance? Give one example and implement it in C++.

(b) Explain the need of virtual destructor by giving an example.

3. (a) What is virtual derivation? Explain with an example.

(b) Write a derived class constructor that takes one argument and passes this

argument along the constructor in base class. 4. a) What are the rules of derivation? Explain the roles of constructors & destructors inheritance by giving suitable example. b) What is virtual derivation? Give example. Explain need of virtual function by giving a suitable example. 5. a) What are the applications of using virtual functions? Also explain what are pure virtual functions?

b) Can operator precedence be changed through operator overloadings?


1. (a) Explain the purpose of try, catch and throw keywords. · (b) Differentiate between ASCII and binary files. 2 (a) Write a template function to find the largest of given N numbers: (b) Design a template class to sort N numbers and demonstrate its use.

3. (a) Write a program in C++ to copy contents of one text file into another.

(b)Wri t e a program in C++ to accept a file at the command line and then print the file size in bytes. 4. Explain ‘catch all’ & ‘rethrowing’ of example. Also explain how can restrict a function to throw Exceptions. 5. a) How can you open & close files? Also discuss file pointers & functions to manipulate these Pointers. How can you read and write objects in a file? Explain by giving an example b) Distinguish between binary and text files. Also write a program in c++ to read a file and to (i) Display the contents of the file on the screen (ii) display the no. of characters and (iii) no. of lines in the file.

MCA-14-23 PRINCIPLES OF PROGRAMMING LANGUAGES

Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours

Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

UNIT – I Preliminaries: History, Impact of Programming Paradigms, Role of Programming Languages, Good Language, Effects of Programming Environment, Translators and virtual architectures, Binding and Binding time, Language Syntax, Analysis of Program, Synthesis of Object program, Formal translation models: BNF Grammars, General parsing, Language translation, Recursive descent parsing.

UNIT – II Formal languages and automata: The Chomsky hierarchy of formal languages, regular grammars, Regular expressions, Finite State Automata, Context-free grammars, Pushdown automata, Ambiguous grammars. Language Semantics: Attribute grammars, Denotational semantics, Program verification and validation, Data objects, variables, constants, data types, declaration, type checking, type casting, type promotion, Enumerators, Composite data types.

UNIT – III Object Orientated concepts: Structured data types, Abstract data types, Information hiding, Subprogram concepts, Good program design, Type definitions, Type equivalence, Inheritance, Derived classes,Abstract classes, Polymorphism, Inheritance and software reuse. Sequence control: Implicit and explicit sequence control, Sequence control within arithmetic expressions, sequence control between statements, sequencing with non-arithmetic expressions, Subprogram Sequence control.

UNIT – IV Miscellaneous topics: Parameter passing techniques, Static & Dynamic Scoping, Storage of variables, Static storage, Heap Storage management, Distributed Processing, Exceptions and Exception handlers, Coroutines, Scheduled subprograms, Parallel programming, Processor design, Hardware and Software architectures, Network Programming, Evolution of scripting languages, Applets, XML. Text Books: 1. Pratt T.W., Zelkowitz M.V., Gopal T.V., “Programming Languages Design and Implementation”, Pearson Education. 2. Sebesta W. Robert, “Concepts of Programming Languages”, Pearson Education. Reference Books: 1. Appleby Doris & VandeKopple J. Julius, “Programming languages-Paradigm and practice”, Tata McGraw Hill. 2. Sethi Ravi, “Programming languages”, Pearson Education 3. Scott M., “Programming Language Pragmatics”, Elsevier India.

Lecture Plan

MCA-14-23 Lectures Topics

1. History, Impact of Programming Paradigms 2. Role of Programming Languages, Good Language, Effects of Programming

Environment 3. Translators and virtual architectures 4. ---do--- 5. Binding and Binding time 6. Language Syntax, Analysis of Program, Synthesis of Object program 7. Formal translation models: BNF Grammars, General parsing, Language translation 8. Recursive descent parsing. 9. Formal languages and automata: The Chomsky hierarchy of formal languages, regular

grammars 10. Regular expressions, Finite State Automata 11. Context-free grammars, Pushdown automata, Ambiguous grammars 12. Language Semantics: Attribute grammars, Denotational semantics 13. ---do--- 14. Program verification and validation, Data objects, variables, constants

15. Data Types, declaration, type checking, type casting, type promotion 16. Enumerators, Composite data types. 17. Structured data types, Abstract data types 18. Information hiding, Subprogram concepts, Good program design 19. Type definitions, Type equivalence 20. Inheritance, Derived classes 21. Abstract classes 22. Polymorphism, software reuse. 23. Implicit and explicit sequence control, Sequence control within arithmetic

expressions, 24. Sequence control between statements 25. Sequencing with non-arithmetic expressions 26. Subprogram Sequence control. 27. Parameter passing techniques 28. Static & Dynamic Scoping 29. Storage of variables: Static storage, Heap Storage management 30. Distributed Processing 31. Exceptions and Exception handlers 32. ---do--- 33. Coroutines, Scheduled subprograms 34. Parallel programming 35. ---do--- 36. Processor design 37. ---do--- 38. Hardware and Software architectures 39. ---do--- 40. Network Programming 41. ---do--- 42. Evolution of scripting languages 43. Applets 44. XML 45. ---do---

TUTORIAL SHEET – 1 1. Write short note on the following:

a) Virtual Architectures b) Language Translators

2. a) What is binding with its type? b) What is binding time?

3. Explain the analysis and synthesis model of translation. 4. What do you mean by parsing? Explain recursive descent parsing. 5. What is BNF Notation? Why it is needed?

TUTORIAL SHEET – 2 1. Write a Context free Grammar that can recognize the string anbn . Also design the Push

Down Automata(PDA) for the same. 2. Show that the following grammar is ambiguous:

E - E+E | E*E | N N 0 | 1|2|3|4|5|6|7|8|9

3. Explain Context Free Grammar with example.

4. What do you understand by strong and weak typing ? What are their merits and demerits?

5. What are Regular Grammars? How it is recognized?

TUTORIAL SHEET – 3

1. What do you understand by Type-Equivalence ? Differentiate between Name Equivalence and Structural Equivalence. Also discuss their advantages and disadvantages.

2. Differentiate between Implicit and explicit sequence control with the help of example.

3. What is Inheritance ? What types of inheritance are supported by C++ ? Explain how you can pass parameters to the constructor of the base class.

4. Discuss the scope of public, private and protected members of a class using suitable examples.

5. What is Diamond Problem in inheritance? Explain with example.

TUTORIAL SHEET – 4 1. What are structured data types, composite data types and objects? 2. What is call by value and call by reference parameter passing technique?

Explain where one is beneficial. 3. How can we pass parameters to an applet at run time? 4. What are XML data files? 5. Explain:

a) Parallel Programming b) Network Programming

MCA-14-24 DATA STRUCTURES Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no. 1, the examiner is required to set eight more questions selecting two from each unit. Student will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

UNIT – I Introduction to Data Structures: Classification of Data Structures, Complexity of Algorithms, Asymptotic Notations, Abstract Data Types, Arrays, Representation of Arrays in memory, Operations on Array, Strings, Pointers, Sparse Matrices, applications.

UNIT – II Stacks & Queues: Representation of Stacks, Stack Operations, Applications, Queues, Operations on Queues, Circular Queues, Dequeue, Priority Queues, Applications.Linked Lists: Introduction, Types, Operations (Insertion, Deletion, Traversal, searching, Sorting),Applications, Dynamic Memory Management, Implementation of Linked Representations.

UNIT – III Trees: Definition and Basic Terminologies, Representation of Trees, Binary Trees, Types of Tree, Representation of Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Binary Search Trees and Operations, Minimum Spanning Tree, AVL Trees, Heap, m-way Search Trees, B-Trees, B+ Trees, Applications. Advanced Trees: Introduction to 2-3 Tree, Red-black Tree, Splay Trees.

UNIT – IV Graphs: Definitions and Basic Terminologies, Representation of Graphs, Graph Traversals, Shortest Path Problem, applications. Sorting and Searching: Recursive Binary Search, Types of Sorting, Implementation of Different Sorting Techniques: Selection Sort, Insertion Sort, Merge Sort, Radix Sort. Hashing & Collision handling. Text Books: 1. G.A.V Pai, “Data Structures and Algorithms”, Tata McGraw-Hill, New Delhi. 2. Drozdek, “Data Structure and Algorithms in C++”, Cengage Learning. Reference Books: 1. Trembley, J.P. And Sorenson P.G., “An Introduction to Data Structures With Applications”, Tata McGraw- Hill. 2. Seymour Lipschutz, “Data Structures”, Tata McGraw-Hill, Schaum’s Outlines, New Delhi.

3. Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson Education. 4. Goodrich, “Data Structures & Algorithms in C++”, Wiley India Pvt. Ltd.


Lectures Topics 1. Classification of Data Structures 2. Complexity of Algorithms, 3. Asymptotic Notations, 4. Abstract Data Types, 5. Representation of Arrays in memory 6. Operations on Array 7. Strings 8. Pointers 9. Sparse Matrices 10. Applications list 11. Representation of Stacks 12. Stack Operations and Applications 13. Queues, Operations on Queues 14. Circular Queues, Dequeue 15. Priority Queues 16. Introduction to Linked Lists 17. Operations (Insertion, Deletion, Traversal, Searching, Sorting), 18. Applications 19. Dynamic Memory Management 20. Implementation of Linked Representations 21. Definition and Basic Terminologies of Trees 22. Representation of Trees 23. Binary Trees 24. Types of Tree 25. Representation of Binary Trees 26. Binary Tree Traversals 27. Threaded Binary Trees, Binary Search Trees 28. Minimum Spanning Tree 29. AVL Trees 30. Heap 31. m-way Search Trees, B-Trees, B+ Trees and Applications 32. Introduction to 2 -3 Trees 33. Red-black Tree 34. Splay Trees. 35. Definitions and Basic Terminologies, 36. Representation of Graphs 37. Graph Traversals 38. Shortest Path problem and Applications 39. Sorting and Searching 40. Recursive Binary Search 41. Types of Sorting and implementation 42. Selection Sort and Insertion Sort 43. Merge Sort

44. Radix Sort

45. Hashing & Collision handling.


1. (a) What do you mean by Data structure ? How can you Classify Data structure ? Explain along with various Operation that can be applied on Data structure . (b) What is a sparse matrix ? how sparse matrices are stored in computer memory ? Explain with the help of an example 2. (a) Write algorithm for Insertion sort and .Selection sort respectively. Which sorting Technique is more efficient? (b) Write down a recursive program in C to perform binary search on a given list of number . (c) How strings are stored in computer memory ? Write an algorithm to find a pattern from a given text. 3. i) Consider the pattern P=a3b3. Construct the pattern matching table used in list and Second Pattern matching algorithm. ii) Write second pattern matching algorithm to find all indices of a pattern P in the text T and apply the algorithm to P = abc and T= a3bc2abcabcc. 4. Find the number comparisons to find the Index of P= aaa in T= (aabb)3 using first pattern matching algorithm. 5. What are the real time applications of record and pointers?

TUTORIAL SHEET – 2 1. (a) Define Binary tree and threaded tree . How can you create a threaded tree ? What is the purpose of reating a threaded tree ?

(b) Explain the procedure to create a Binary search Tree . Also explain how to delete an element from a BST.

2.. (a) What is m-way search tree ? Explain the procedure to create m-way search tree. (b) Write and explain the algorithm to traverse a binary tree suing post order traversal .

3. What do you understand by Graph. Multi graph and Directed graph ? Write an algorithm for finding the shortest path in graph and explain the same with the help of an appropriate example . 4. i) Describe the. Structure of stack and explain its use in evaluation of an arithmetic expression:

6 (5 + 9) - 8/2 + 7 and write algorithm for the same. ii) Write Quick sort algorithm & explain it for the following numbers:

45,35,25,65,55,11,77 5. (i) Compare circular header linked list with header linked list with suitable real world example. (ii) Compare the structure queue and structure stack. Which one is best in which Situation? Explain with real time examples.


1. Compare deletion algorithms for in-order, pre – order, post – order traversal of following binary tree .Which one is the best?

A B C D E F G

2. Write an algorithm for the post- order traversal of a binary tree and apply it to the arithmetic tree for the expression 12 / (7-3) +2 * (19+15) + 43 3. How threaded binary tree is linked with balanced binary tree. Explain with real time examples. 4. Construct AVL search tree for the following numbers: 25,35,20,33,45,50,55. 5. i) Write algorithm for pre-order traversal of a binary tree and apply the algorithm to the following tree:

A

/\ B C

/\ /\ D E F G

ii) Define in-way search tree and write an example of the tree:


1. Write an algorithm to delete an edge from a graph G. Explain for deleting the edge from A to B in the following digraph: A B

D C

2. Describe hashing. What are 5 real time applications of hashing? Explain with example 3. Write breadth –first search algorithm and apply the algorithm to search minimum path from the node a to the node j in the following digraph also Give linked representation of the digraph given in part a.

4. Compare merge sort, merging and radix sort algorithms with their complexity for numbers as follows: 45,33,55,65,22,50,11,30,90,88. Also explain how these sortings can be used in real situations with suitable examples 5. i) Differentiate between path matrix and adjacency matrix of a graph C.' ii) Write breadth first search algorithm t o f i nd p a t h from a node A to the.’ node B in a graph G. iii) Write algorithm to find in-degree and out-degree for each node of a Digraph D. Apply the Algorithm to the digraph:

a

b

f e j

d

c

MCA-14-25 WEB TECHNOLOGIES

Maximum marks: 100 (External: 80, Internal: 20) Time: 3 hours Note: Examiner will be required to set NINE questions in all. Question Number 1 will consist of objective type/short-answer type questions covering the entire syllabus. In addition to question no.1, the examiner is required to set eight more questions selecting two from each unit. Students will be required to attempt FIVE questions in all. Question Number 1 will be compulsory. In addition to compulsory question, student will have to attempt four more questions selecting one question from each Unit. All questions will carry equal marks.

UNIT – I Introduction to Web Engineering: Categories and Characteristics of Web Applications, Web Applications Vs Conventional Software, Need for an Engineering Approach. Web Essentials: The Internet, Basic Internet Protocols, WWW, HTTP (Structure of Request and Response Messages), Web Browser and its functions, URL, Web Servers and their features, Defining Virtual Hosts, Secure Servers.

UNIT – II Markup Languages: Introduction to HTML, Characteristics, XHTML Syntax and Semantics, Fundamental HTML Elements, Lists, Tables, Frames, Forms, XHTML Abstract Syntax, Creating HTML Pages. Cascading Style Sheets: Features, Core Syntax, Types, Style Sheets and HTML, Style Rule Cascading and Inheritance, Text Properties, CSS Box Model, Normal Flow Box Layout, Positioning and other useful Style Properties.

UNIT – III Client–Side Programming: Introduction to JavaScript, Perspective, Basic Syntax, Variables and Data types, Statements, Operators, Literals, Functions, Objects, Arrays, Built-in Objects, Debuggers. Server-Side Programming: Servlet Architecture, Generating Dynamic Content, Servlet Life Cycle, Sessions, Cookies, URL Rewriting, Servlet Capabilities, Servlets and Concurrency.

UNIT – IV XML: Relation between XML, HTML, SGML, Goals of XML, Structure and Syntax of XML, Well Formed XML, DTD and its Structure, Namespaces and Data Typing in XML, Transforming XML Documents, XPATH, Template based Transformations, Linking with XML, Displaying XML documents in Browsers. Text Books:

1. Andrew King, “Website Optimization”, Shroff Publishers, India. 2. Achyut Godbole, “Web Technologies”, Tata McGraw Hill, India. Reference Books: 1. Jeffrey C. Jackson, “Web Technologies”, Pearson Education, India. 2. Thomas Powell, “The Complete Reference HTML”, Tata McGraw Hill, India. 3. William Pardi, “XML in Action”, IT Professional, New York, USA.


Lectures Topics L1 Introduction to Web Engineering: Categories and Characteristics of Web Applications L2 Web Applications Vs Conventional Software Need for an Engineering Approach. L3 The Internet, Basic Internet Protocols, WWW, HTTP (Structure of Request and Response

Messages) L4 Web Browser and its functions, URL, L5 Web Servers and their features, L6 Defining Virtual Hosts, L7 Secure Servers. L8 Introduction to HTML, Characteristics, XHTML L9 Characteristics, XHTML Syntax and Semantics, L10 Fundamental HTML Elements, Lists, L11 Tables, L12 Frames L13 Forms, XHTML L14 Abstract Syntax, L15 reating HTML Pages. L16 Cascading Style Sheets: Features, L17 Core Syntax, Types, L18 Style Sheets and HTML, L19 Style Rule L20 Cascading and Inheritance, L21 Text Properties, CSS Box Model L22 Normal Flow Box L23 Layout, Positioning other useful Style Properties. L24 Client–Side Programming: Introduction to JavaScript, Perspective, Basic Syntax, L25 Variables and Data types, Statements, Operators, Literals, L26 Functions, L27 Objects, Arrays, L28 Built-in Objects, L29 Debuggers. L30 servlet Architecture, L31 generating Dynamic Content, L32 servlet Life Cycle, L33 Sessions, Cookies, L34 URL Rewriting, L35 Servlet Capabilities L36 Servlets and Concurrency XML: L37 Relation between XML, HTML, L38 SGML, Goals of XML, Structure and Syntax of XML, L39 Well Formed XML, L40 DTD and its Structure, L41 Namespaces and Data Typing in XML, L42 Transforming XML Documents, XPATH, L43 Template based Transformations, L44 Linking with XML, Displaying XML L45 Documents in Browsers.

TUTORIAL SHEET 1 1. What do you mean by Markup language? How they are different from Programming

Language? Explain the HTML page structure with suitable example. 2. What is Web Engneering? Explain its characteristics with example. 3. Differentiate Web Application and Conventional Software. 4. What is Web Server? Explain its features with example.

5.i) Explain all the attributes of List tag? Write a HTML code to create a list with subparts. ii) Explain the difference between HTML and SGML. iii) What is cookie? How can we create cookies?

TUTORIAL SHEET 2

1. Create a web page using form, list and table. 2. What are Client Side Programming and Server Side Programing.Give examples?

3. Explain: (i) Structure of HTML Document (ii)Image preliminaries in HTML 4. i) What is Style Sheet? Create a web page using Style Sheet.

ii) Explain Servlet Life cycle. 5. What is XML? Explain structure of XML?

TUTORIAL SHEET 3

1. Explain the following: (i) Cookies (ii)Session (iii)WWW (iv)HTTP 2. Create a web page using Frames. 3. Explain all style properties of style sheet. 4. What is Web Browser? Explain its functions. 5 i) Explain Server Architecture.

ii) What is HTML Frame? Explain its attributes. iii) What are Cascading style sheets? What is their importance in HTML? Write CSS

code for altering format of a regular text.

TUTORIAL SHEET 4 1. What is Java Script? 2. Explain (i) Debugger (ii) SGML 3. What is DTD? Explain its structure. 4. Explain: (i) Virtual host (ii)Secure Servers 5. What is Internet? Explain all internet protocols.

MCA-14-26 (S/W LAB–III BASED ON MCA-14-22 & MCA-14-24)

List of programs to be implemented in data structure

1. (a) Create a Sort class having following methods using array: 1. BubbleSort() 2. Selection Sort() 3.IinsertionSort() 4. MergeSort() 5.QuickSort()

(b) Develop a Search class to implement following functions : LinearSearch() 2. BinarySearch()

2. (a) Create a Stack class in stack.cpp file to implement following functions: i) push() ii) pop() .

(b) Create Math class in math.cpp file to implement following 1) Use class Stack class to convert infix 2 * 3 + 5 * 2 + 2 – 12 / 6 form to postfix form using a function convert() 2) Evaluate the postfix expression using an input string as data member. (c) Create a Queue class in queue.cpp to implement queue operations using arrays

3. a) Create a class Singly linked list in singly.cpp file to perform following functions: Constructor Functions to insert nodes( at front, after i th node and at end) Functions to delete nodes( at front, after i th node and at end) To display list Create a new list by Concatenating (adding the second list at the end of the first)

two lists Create new singly list by Merging ( elements are added in new list in alternate

order) two lists Create new singly list as Union (No duplicate element)of two lists Create new singly list as intersection (Common elements) of two lists.

b) Create a class Doubly linked list in file doubly.cpp to perform following functions: Constructor Initialization Functions to insert nodes( at front, after i th node and at end) Functions to delete nodes( at front, after i th node and at end) To display list

4. Create a studentList class to maintain student information and perform search, insert and delete operation for a particular registration number .

5. Define a class BinaryTree to perform the following functions: a) Insertion of element b) Search an element c) Delete an element d) print the nodes in preorder e) print the nodes in inorder f) Print the nodes in post-order g) Count the no. of leaf node and non leaf node.

6. Define a class Heap to implement the operations insert and delete in Heap Tree. 7. Develop a menu driven program (main.cpp having main() function) which includes the functions defined in Graph.cpp which are as follows:

1) To create a new graph using adjacency matrix or using adjacency linked list 2) Traverse a graph using DFS and BFS 3) Insert and delete a node in the graph 4) Insert and delete an edge in the graph 5) Assignment Problem using Graph: We have to assign N workers to N machines. Each worker

causes different costs for the machines. Goal is to minimize the total cost to the condition that each machine goes to exactly 1 person and each person works at exactly 1 machine.

8. Write a WeightedGraph class for finding the shortest Path From a given source to any Vertex in a digraph using Dijkastra’s algorithms by using. 9. Implement double hashing technique to map given key to the address space. Also write code for collision resolution (linear probing) using Hash.cpp class 10. (a) An educational institution wishes to maintain a database of its employees. The database is divided into a number of classes whose hierarchical relationships are shown below. The figure also shows the minimum information required for each class. Specify all the classes and define functions to create the database and retrieve individual information as and when required.

(b) The database created above does not include educational information of the staff . It has been decided to add this information for teachers and officers ( and not for typists ) which will help the management in decision making with regard to training, promotion, etc. Add another data class called education that holds two pieces of educational information namely, highest qualification in general education and highest professional qualification. This class should be inherited by the class teacher and officer. Modify the program to incorporate these additions. 11. Write a Program that uses a class Circle with a given radius so that the program would calculate and display the diameter, the circumference, and the area. Another class called

Sphere is derived from the Circle class. This class can supply its own radius; display the same pieces of information as the Circle. Additionally, the Sphere class should calculate and display the volume. This exercise uses different header and source files. It uses the following five files: circle.h, circle.cpp, sphere.h, sphere.cpp and exo.cpp. 12. Write program to access the derived class objects through an array of pointers such that

the base class member functions are preceded by the keyword virtual. Base class EMPLOYEE consist of DOB Derived class A consist of Experience Derived class B consist of Performance

13. Define a class Cube having functions to calculate the total area and the volume based on the side measurement. If the program supplies a side equal or lower than 0, reset the side to 1. Create an empty constructor and an empty destructor. 14. Operator overloading:

a. Write a C++ program to perform operations on complex number using binary operator overloading with help of friend function.

b. Overload ++ (unary) and + & - (binary) operators to perform addition & subtraction of vectors (vectors are just like arrays).

15. Write a function template to perform selection sorting in an array .

16. Make a pong game in c++ which will have a paddle and ball.

Paddle class having Data members: pcx, pcy

Member functions:

moveRight(), oveLeft()

Ball class having: Data members: Location, ballXSpeed, ballYSpeed, bLeftUp, bLeftDown, bRightUp, bRightDown

Member functions: moveBall (), bounce ()

Which both inherits from entity that holds the coordinates and the bounding box(can be circle or polygon) of the entity, also implement a function which easily telling if the entities are colliding for any two entities. Now make the Ball move and when it will collide with an entity it will reverse the right speed coordinate(x or y). If the ball moves in upward direction then the value of co-ordinates will increase and similarly in opposite direction co-ordinates will decrease.

17. Write a program to maintain telephone directory system using files. 18. Write a program that uses the “STOCK.DAT” file containing item name, code and cost.

Perform the following operations on the file using random access.

(a) Adds a new item to the file.

(b) Modifies the details of an item.

(c) Displays the contents of the file.

MCA-14-27 (S/W LAB–IV BASED ON MCA-14-25) List of programs to be implemented in Web Technologies 1. Develop HTML pages using

(a) Frames and List (Ordered, Unordered, and Definition). (b) Core HTML attribute (id Attribute, class Attribute, style Attribute, and title Attribute) and Event (onclick,onblur,onchange)

2. Create a design for the 4 websites according to prescribed design .The template of the each site is shown below .Home.html is the home page giving information about the website and contained links such as about us, Contact us etc.

Website 1: Home Page (using frames, inline style sheet, anchor) image/ logo

PAGE HEADING

Home About Us Contact

Hierarchical

view

Of global

navigational

topics user id

Password

remember me Forgot your password?

login Sign up

36

Website 2: (using tables, embedeed stylesheets, image designed in photoshop,)

PRODUCT PURCHASE SITE

Home About us Contact Us

DETAILS OF PRODUCTS Recently

launched

product image

Image of selected

product

WebSite 3:

COLLEGE WEBSITE

Home About Us Contact Us

Welcome message List Of Departments(Using List

Tags)

Image Of Names of faculty members of selected department with

Selected their Qualification

Department

List of current events of the department

Footer

Image 1 of events

Image 2 of

Image 3 of

Image 4 of

events events events

HOME ABOUT US CONTACT

37

WebSite 4:

Online resume mart

Home Contact us About us Employer’s Employee

zone zone

Interested Details of selected interested area

areas list (

using div tag) user id

password

remember me

Forgot your

password?

login Sign up

3. Create a Registration Form for the new users of the site. This page contains the important

information about the user like User Name, Password, First Name, Last Name, Gender, Age etc. This Form will be opened after clicking on the Link “Sign Up/New User” on the home page, add following features:

a) Use JavaScript to insure that none of the field remain empty and enter in to the database. b) Use JavaScript to show alert message, if try to submit empty field. c) Use CascadeStyleSheet to give same Look and Feel all the pages.

4. Create online store application. This online store application contains the information about the latest brands and other goods, also having the information about the buyer and also seller having following functionality:

a) The links about the goods will be at the left side. b) Separate registration pages for the buyer and the seller with all validations, handle

database with Microsoft Access. c) The reviews page will open to submit the reviews about the website as a popup window

using JavaScript. d) Implement the concept of Shopping Cart.

5. Implement a functionality of multimedia (Audio/Video) on a Page having features to

download and upload (Audio/Video), using Microsoft Access as the database.

6. Create Attendance management portal of MCA Department, having the following functionality along with the other functionality as in above programs Session management: a) There is an admin on the site that can view all the users logged in on the site.

When a user remains idle up to 5 minutes after login, it will show him as an Offline user. b). Assign the rights of opening web page according to role as follows Student:

38

Student can view only his/her attendance. Lecturers: Lecturer can only view attendance of his/her own subject. HOD: HOD can view attendance of all the students.

7. Create the job website having information about the latest jobs in the market. This website will maintain

the information of the Job seekers and job providers: a) Job seeker and job provider can register by submitting the required details. b) Prepare 3 different copies of CSS to give different look and feel to the job seeker, job

provider and Administrator. c) Use JavaScript to validate mobile number, having 10 digits and also not having characters.

8. Write a program to convert XML to HTML5 and HTML5 to XML 9. Display XML using CSS and XSL.

TIME – TABLE

DAY I II III IV V VI VII

MONDAY

TUESDAY

WEDNESDAY

THURSDAY

FRIDAY

SATURDAY