DETAILED SYLLABUS FOR DISTANCE EDUCATION M. Tech. (IT) (SEMESTER SYSTEM) (Two years Post Graduate Degree Programme) COURSE TITLE : M.TECH. (IT) DURATION : 02 YEARS (Semester System) TOTAL DEGREE MARKS : 1500 FIRST SEMESTER COURSE TITLE Paper Code MARKS THEORY PRACTICAL TOTAL OBJECT ORIENTED ANALYSIS AND DESIGN MT 110/ MT 110P 50 50 100 ADVANCED COMPUTER SYSTEM ARCHITECTURE MT 120 100 00 100 DATA STRUCTURES & ALGORITHM MT 130 MT 130P 50 50 100 SECOND SEMESTER COURSE TITLE Paper Code MARKS THEORY PRACTICAL TOTAL DATABASE MANAGEMENT SYSTEMS MT 210 MT 210P 50 50 100 OPERATING SYSTEMS MT 220 MT 220P 50 50 100 DATA COMMUNICATION & NETWORKING MT 230 MT 230P 50 50 100 THIRD SEMESTER COURSE TITLE Paper Code MARKS THEORY PRACTICAL TOTAL E-BUSINESS MT 310 MT 310P 50 50 100 PROGRAMMING USING C # (Sharp) MT 320 MT 320P 50 50 100 INTERNET & ITS APPLICATIONS (Front Page/HTML/DHTML) MT 330 100 00 100 WEB TECHNOLOGIES (ASP, Core Java, Enterprise Java) MT 340 MT 340P 50 50 100 FOURTH SEMESTER COURSE TITLE Paper Code MARKS THEORY PRACTICAL TOTAL ELECTIVE-I MT 410 -- -- 100 ELECTIVE-II MT 420 -- -- 100 MAJOR PROJECT MT 430P -- -- 300 ELECTIVE PAPER I COURSE TITLE Paper Code MARKS THEORY PRACTICAL TOTAL 1. m-COMMERCE MT(410) E1 MT(410) E1P 50 50 100 2. IT ENABLED SERVICES MT(410) E2 MT (410)E2P 50 50 100 3. FRONT LINE TECHNOLOGIES (COM/DCOM/CORBA/XML) MT(410) E3 MT(410) E3P 50 50 100 ELECTIVE PAPER I I COURSE TITLE Paper Code MARKS THEORY PRACTICAL TOTAL 1. S/W ENGINEERING THROUGH UML MT(420) E4 100 00 100 2. VISUAL PROGRAMMING IN VB MT(420) E5 MT(420)E5P 50 50 100 3 PLANNING & MANAGEMENT OF COMPUTER CENTRES MT(420) E6 100 -- 100 4 DISTRIBUTED COMPUTING MT(420) E7 100 -- 100 Note: Theory Paper : 50% Continuous Internal Assessment and 50 % University examination. Practical Paper: 60 % Continuous Internal Assessment and 40 % University examination. Continuous Internal Assessment : 1) Two or three tests out of which minimum two 60% of Continuous Internal Assessment will be considered for Assessment 2) Seminars/Assignments/Quizzes 30% of Continuous Internal Assessment 3) Attendance, class participation and behavior 10% of Continuous Internal Assessment FIRST SEMESTER MT-110 OBJECT ORIENTED ANALYSIS AND DESIGN Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to Object: Object Orientation, Development, Modeling, Object Modeling technique. Object modeling: Objects and classes, Links and Association, Generalisation and inheritance, Grouping constructs, Aggregation, Generalisation as extension and restriction, Multiple inheritance, Meta data, candidate keys. SECTION B Dynamic modeling: Events and states, Nesting, Concurrency, Functional modeling: Data flow diagrams, Specifying operations. Design Methodology, Analysis: Object modeling, Dynamic modeling, Functional modeling, Adding operations, Iteration. SECTION C System design: Subsystems Concurrency, Allocation to processor and tasks. Management of data stores. Control implementation. Object design: Optimisation, implementation of control. Adjustment of inheritance. Design of association. Documentation. Object -Oriented styles, Implementation: Using a programming language, a database system. Programming styles reusability, extensibility, robustness. References: 1. Rambough, “Object Oriented Modeling and Design”, PHI 2. BOOCH, “Object Oriented Analysis and Design”, Addison Wesley 3. Rebecca Wirfs-Brock, “Design Object Oriented Software”, PHI. MT-110 P OBJECT ORIENTED ANALYSIS AND DESIGN Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT-110 MT-120 ADVANCE COMPUTER SYSTEM ARCHITECTURE Maximum Time : 3 Hrs. University Examination : 40 Marks Total Marks : 100 Continuous Internal Assessment : 60 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Overview: Register and bus organized computers and instruction execution. Output, input memory and control organization. Hard-wired and Micro- programmed control. Processor Organization: General structure of CPU-registers, stacks, ALU and control units, Instruction types, formats, sets and addressing modes. Basic mathematical operations- fixed-point addition, subtraction, multiplication and division. Implementation of fixed-point operations and ALU design. F. P. operations & their implementation. H.W. fast addition, multiplication and division. Principles of array and pipelined processors. SECTION B Design of Controller: Principles of instruction decoding and implementation, Hard-wired and micro instruction based control units. Horizontal & vertical classes of micro instructions, Nano-program control. Identifying micro instructions, minimizing micro instruction size, parallelism in micro instructions, encoding control instructions, timing cycles and clock generations. Organization of Micro-program based control unit. Concepts of RISC & comparison with CISC processors. Memory Organization: Types of memories-serial access, random access and semi-random access, core, semiconductor and bubble memories, memory device characteristics-density, speed, access time, costs, destructive non-destructive read out, static memories, dynamic memories and memory refresh. Word length and size of memory, memory expansion. Fixed & variable length word organization of Memories. Main memory, memory hierarchy, memory references, address mapping, relocation mechanism, concepts of memory compaction, principles of virtual memory, segmentation and paging. Interleaved memories and principles of address interleaving. Associative memories- word organized associative memory, masking. Hardware protection features in multi-programmed systems. SECTION C System Organisation: Communication: Introduction, Bus control, Computer Networks. Input-Output systems: Programmed I/O, DMA, Interrupt control, I/O processors. Operating Systems: Introduction, concurrency control, system management. Parallel Processing: Introduction types of parallel processors, performance considerations, pipelined, vector and multiprocessor systems. References: 1. John.P.Hayes, Computer Architecture & Organization, McGrawHill Publisher 2. M.Morris Mano, Computer System Architecture, Prentice Hall of India. 3. Tauenbaum, Computer Organization & Architecture, Prentice Hall of India 4. Rafiqquzzman-clandra, Modern Computer Architecture. 5. William Stalings, “Computer Organisation & Architecture”, Addison Wesley. 6. Vincent P. Hevling, “Computer System Design & Architecture”, Addison Wesley. 7. Hwang, K & F.A. Briggs, “ Computer Architecture & Parallel Processing”, Mhill 8. Patterson D.A & J.L. Hennessy, “Computer Architecture: A Quantative Approach” Morgan Kanfmann Publishers 1990. MT-130 DATA STRUCTURES AND ALGORITHMS Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to data structures, stacks and queues, recursion, writing recursive programs, quick sort algorithm using stack. List, sequential and linked representation, multi-list structure, trees and their representation, heap tree, heap sort algorithm, height-balanced trees, AVL tree. SECTION B Graphs and their applications, representation of graphs, graph traversal, Dijkstra's algorithm for shortest path, spanning forest. Storage management, general lists, automatic list management, dynamic memory management. SECTION C Sorting and searching, exchange sort (Bubble sort, quick sort), selection and tree sorting (Straight selection sort, binary sort), insertion sort (Simple insertion, Shell sort), merge and radix sort, basic search techniques, tree searching, general search trees, hashing, table searching. Note:- Students is supposed to know the algorithm of all data structures. Reference: 1. R.S. Salaria, “Data Structure & Algorithms”, Khanna Book Publishing Co. (P) Ltd., N. Delhi. 2. Schanm Series Data Structure- TMH 3. A.M. Tanenbaum, Y. Langsam and M.J. Augenstein," Data Structures Using C", PHI, New Delhi. 4. B.W. Kernighan and D.M. Ritchie," The C Programming Language", PHI, New Delhi. 5. E. Horowitz and S. Sahni," Fundamentals of Data Structures", Galgotia Publishers, New Delhi. MT-130 P DATA STRUCTURES AND ALGORITHMS Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT-130 SECOND SEMESTER MT-210 DATABASE MANAGEMENT SYSTEMS Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Overview of DBMS: Basic DBMS terminology, data Independence, architecture for DBMS, E-R model: entities and entity set, attributes, mapping constraints, keys, E-R diagram, reducing E-R diagram to tables. Introduction to Data models: Network model, implementation of networks, Hierarchical Model from network to Hierarchical Model, Relational Model, Comparison of Models, Object Oriented Database, Object Relational Database, Comparison of OOD & ORD. SECTION B Relational Model: Storage organizations for relations, relational algebra, relational calculus, design theory for relational database, functional dependencies, decomposition of relational schemes, normal forms, multivalued dependencies. Database: integrity, security, recovery, concurrency. SECTION C Relational Query Language: SQL and PL/SQL: - Introduction to Oracle 8I,SQL *Plus, DDL, DML And DCL, Tables, Indexes & Views, Clusters, Sequences & Snapshots, P1/SQL, Cursors, Stored Procedures, Triggers References: 1. Jeffrey D. Ullman," Principles of Database Systems," 2nd Edition, Galgotia Pub. Pvt. Ltd. 2. C.J. Date,” An Introduction to Database Systems," Volumes I and II, Addison Wesley. 3. A. Simpson," Understanding DBASE-III+," BPB Publications, Delhi. 4. P. Pratt," Data Base Systems Management and Design," Boyd and Fraser Pub. Comp. 5. D.M. Kroenke," Database Processing: Fundamentals, Design, Implementation," 2nd edition Galgotia Publication Pvt. Ltd. 6. Henry F. Korth," A Silberschhatz: Database Concepts," McGraw - Hill, Inc. 7. Naveen Parkash, “Introduction to Database Management”, TMH. 8. Bobrowski, “Client Server Architecture and Introduction to Oracle 7”. 9. A.K. Majumdar, P. Bhattacharya, “Database Management Systems”, TMH. MT-210 P DATABASE MANAGEMENT SYSTEMS Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT-210 MT-220 OPERATING SYSTEMS Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to Operating System: Understanding Operating System, Relation with H/W architecture of PC, Interrupts, Kernel, Shell, Drivers-DOS, UNIX, Windows, Process of Booting in DOS, UNIX and Windows. Operating System as resource manager. Features and Measures of Operating System: Performance, Batch versus interactive, Single user versus multi-user, multi-programming versus imcorprocessor, multi-tasking, Time-Sharing, Real time. SECTION B Process Management: Concept of process, process state, process state transition, process control block, concurrent process, deadlocks, scheduling levels, scheduling criteria, multi-processing and multi threading. Device Management: Device Characteristics, Device management techniques, Buffering, Spooling, I/O channels and traffic control, Device allocation considerations and virtual devices. Memory Management: Storage organization and strategies, hierarchical memories, storage allocation and management, Memory types, virtual storage concepts, paging segmentation, swapping definitions and algorithms. SECTION C File System: File system architecture and file structure, internal representation, system calls. Other Features: Distributed Operating Systems, Client server model, Remote procedure calls. Protection and Security, Lattice models, Introduction to authentication protocols. Device management: Dedicated shared and virtual devices, sequential access and direct access devices, disk and drum scheduling, scheduling algorithm. Concurrent Process: Process synchronization: Critical section, semaphores, classical process co-ordination problems, design principles goals, mechanisms and policies, layered approach virtual machines, multiprocessors basic concepts of distributed processing, Case study Window NT Reference: 1. Andrew S. Tanenbaum, “Modern Operating Systems”, Addison Wesley. 2. Peterson and Silberschatz, “Operating System”, Addison Wesley 3. Stephen Kochan, “Unix shell Programming” 4. H.M. Dietel, “An Introduction to Operating System”, Addison-Wesley 5. Stephen Prata, “Advanced Unix Programmer's Guide” 6. Hansen Per Birch, “The Architecture of Concurrent Programs”, PHI. MT-220 P OPERATING SYSTEMS Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT-220 MT-230 DATA COMMUNICATION AND NETWORKING Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Computer Networks: Uses of Computer Network, Network Hardware, Network Software, Goals and Applications of Computer networks, Computer Network structure and Architecture. Reference Models: OSI Reference Model, TCP/IP reference Model, Comparison of OSI and TCP Reference Model, Introduction of Novell NetWare, ARPANET. Physical Layer: Transmission Media, Wireless Transmission, Telephone System, Modems, Concentrators, Circuit switching, Packet Switching, Message Switching, Cellular Radio, Communication satellites. SECTION B Local Area Network: IEEE standards 802 for LANs and MANS (802.2, 802.3, 802.4, 802.5 and 802.6). Introduction to High speed LANs – FDDI, Fast Ethernet, HIPPI, Fibre Channel. The Medium Access sublayer: Channel allocation in LANs and MANs, ALOHA, CSMA and Collison Avoidance protocols for channel allocation. The Data link layer: Design Issues, Elementary Data Link Protocols, Sliding window Protocols. Protocol Specification. DLL in ARPANET. SECTION C The Network Layer: Design Issues, Routing Algorithms, Congestion control Algorithms, Internetworking, The Internet Protocol- Introduction to internetworking, the IP Protocol, IP addresses, subnets, Internet control protocol, Interior and exterior gateway routing protocol, internet multicasting mobile IP, CIDR, IPv6. Transport Layer: Transport protocol design issues, The Transport Protocol – Elements of transport protocol, a simple transport protocol, TCP-Service model, TCP protocol, segment header, connection management, transmission policy, congestion control, timer management, UDP. References: 1. B.A. Forouzan, “Data Communications & Networking”, TMH. 2. A.S. Tannenbaum, “Computer Networks", 3rd Edition, Prentice Hall. 3. D.E. Cormer," Computer Networks and Internet”, 2nd Edition, Addison Wesley Publication. 4. D.E. Cormer and D.L. Stevens," Inter-networking with TCP-IP: Design, Implementation and Internals", Vol. II, Prentice Hall. 5. D. Bertsekas and R.Gallagar, “Data Networks”, 2nd Edition, Prentice-Hall. 6. Stevens W.R.," UNIX Network Programming," Prentice Hall. 7. James Martin, “Computer Networks”, Addison Wesley Publications. 8. D. Russell, “Principles of Computer networking”, Cambridge. 9. “Fred Halsall”, “Data Communication & Networking”, Addison Wesley. MT-230 P DATA COMMUNICATION AND NETWORKING Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT-230 THIRD SEMESTER MT-310 E-BUSINESS Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1.Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Electronic Commerce Framework, Electronic Commerce and media Convergence, The Anatomy of E-Commerce Applications. Market Forces Influencing the I-Way, Components of the I-Way, Network Access Equipment, Global Information Distribution Networks, public policy issues Shaping the I-Way, SECTION B Client-Server Network Security, Emerging Client-Server Security Threats, Firewalls and Network Security, Data and Message Security, Challenge Response System, Encrypted Documents and Electronic Mail, U.S. Government Regulations and Encryption, Summary, Architectural Framework for Electronic Commerce, World Wide Web (WWW) as the Architecture, Web Background: Hypertext publishing, Technology Behind the Web, Security and the Web, Summary. SECTION C Consumer-Oriented Applications, Mercantile Process Models, Mercantile Models from the Consumer's perspective, Mercantile models from the Merchant's Perspective, Summary. Types of Electronic Payment Systems, Digital Token-Based Electronic Payment Systems, Smart Cards and Electronic payment Systems, Credit Card-Based Electronic Payment Systems, Risk and Electronic payment Systems, Designing Electronic Payment Systems, Summary. References: 1. Ravi Kalkota ; Frontiers of Electronic Commerce, Addison Wesley. 2. Kamlesh K.Bajaj & Debjani Nag, E-Commerce, The cutting edge of business, Tata-McGraw Hill 3. Pete Losuin and A.Murphy, Electronic Commerce, A Jaico Book 4. Green Stein “Electronic Commerce”, TMH. 5. Kosiur,”Understanding Electronic Commerce”,PHI 6. Kienan,” Managing your E-commerce Business”, PHI MT-310 P E-BUSINESS Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT-310 MT-320 PROGRAMMING USING C # Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to C Sharp, C Sharp Types, Classes, Class properties, Arrays, Constructors, Destructors SECTION B Function overloading and inheritance: - Params Parameter, Inheritance, Equating Objects, Modifier: - Access modifiers, Sealed Classes, constants, fields, Read-only Fields, Virtual Functions: - New and Override, Abstract Classes SECTION C Operator Overloading, collection Objects, Unsafe Code, Exception Handling, Writing, components is C Sharp, Reference:- 1. Presenting C Sharp by Wille of Techmedia Publications 2. C# The Basics by Sandeep Shanbhag Sonal Mukhi by BPB Publications 3. Inside C #, Tom Archer, Microsoft Press, WP Publishers 4. Microsoft C# Language Specifications, Microsoft Press, WP Publishers 5. E.Balaguruswamy,”Programming with C#”,TMH 6. Bakharia,”Microsoft C# Fast easy and Web Development”, PHI 7. Arora,Aisawamy & Pandey,” Microsoft C# Professional Projects”, PHI MT-320 P PROGRAMMING USING C # Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT-320 MT-330 INTERNET AND ITS APPLICATIONS Maximum Time : 3 Hrs. University Examination : 40 Marks Total Marks : 100 Continuous Internal Assessment : 60 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECION A Introduction to HTML, HTML and the World Wide Web, HTML elements, basic structure elements of HTML, the two categories of body elements – block level and text level, creating HTML pages, viewing pages in different browsers, rule for nesting. HTML tags, colours and fonts, formatting the body section, creating links, creating external links, creating internal links. Adding graphics with image elements, image element attributes, using image as links, image maps, image files. Adding sound, sound formats, Video formats, other multimedia formats, adding multimedia to web pages. SECTION B Presenting information in tables, table attributes, layout tools, understanding the use of frames, frame set documents, targeted links, non-frame elements, inline frames. Building interactivity with forms, form elements and attributes, using form control elements, processing forms. HTML extension, Netscape’s non – standard extensions to HTML, Microsoft’s non-standard extensions to HTML, Style sheets, CSSI’s advantages and limitations, HTML and CSSI integration, working of CSSI, CSSI’s properties. SECTION C FrontPage:-Introduction to FrontPage Modules, FrontPage Editor, Microsoft Images Composer (MIC), FrontPage Explorer, Personal Web Server, Using the FrontPage Editor to create pages on the C drive, Creating Hyperlinks, Absolute & Relative URLs, Using Tables, Images – as decoration and as hyperlinks, Creating a feedback form, Importing Pages into FrontPage Explorer, Using the Microsoft Image composer, FrontPage components within a Personal Web Server, Publishing your Web Page- on an Intranet and on an Internet Server References: 1. E. Stephen Mack and Janam Platt, “HTML”, BPB Publications. 2. Minoli “Internet & Intranet Engineering”, TMH 3. Braginsky & Powell, “Running Microsoft Internet Server”, PHI MT-340 WEB TECHNOLOGIES Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECION A Introduction to VB Script, Microsoft Visual InteDev IDE, The Request Object, The Response Object, Interacting with Server Object, Sessions and Cookies, The ServerContext Object, Using components in ASP SECTION B Data Types, Operators and Language constructs, Classes and Objects, Inner Classes and Inheritance, Interface and Package, Exceptions, java.lang, java.util. java.awt, java.io, java.applet, java.swing, java.sql SECTION C Enterprise Java:- Servlets, Java Server Pages, Remove Method Invocation, JavaBeans, Enterprise JavaBeans, Java Security, Native Methods, Java Virtual Machine, Future of Java Reference: 1. (Core Java) Java, How to Program, 3/e, Deitel & Deitel 2. (Enterprise Java) Java, How to Program, 3/e, Deitel & Deitel 3. VBSCRIPT Interactive Course - Waite Group-Simon 4. Ladd & O’Donnel,”Platinum Edition Using HTML 4, XML, and Java 1.2”, PHI MT-340 P WEB TECHNOLOGIES Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT-340 MT(410) -E1 m-COMMERCE Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to WAP:- WAP and Internet, 3rd Generation, Network, WAP towards 3G, Bluetooth, Wireless Protocol WAP Server and Gateways:- Microbrowser, Markup Language, HTML, XML, WML, WAP Application SECTION B Basics of WML Programming:- Introduction to WML Syntax, Working with WML Elements, Formatting Text, Using Links, Using Images, User Input, Basics of ASP, Introduction to ASP, Benefit of using ASP, ASP Syntax and Structures, Loops and Expression, Receive From Inputs, ASP and Database, SQL Queries, WML and ASP SECTION C Querying a Database with ASP Dynamic WML Content:- WML Script, Variables, Operators and Functions, Libraries Reference: - 1. Programming WAP, WAP Servlets with WML, WML Script and 3G by V. K. Jain of Dreamtech Press. 2. WAP Development with WML and WML by Mukhnial, BPB Publications MT(410) -E1 P m-COMMERCE Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT(410) -E1 MT(410) -E2 IT ENABLED SERVICES Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to IT Enabled Services, Medical, Legal, E-Banking, E-Business, Medical Transcription And Editing:- Medical Terminology Dictation Tapes, Transcribe all forms of medical reports, laboratory, Data, diagnostic assessments, and health records. Medical Records Management:- American Association for Medical Transcription, Understanding Medical Records, Model Report Forms SECTION B An Overview Of American Law:- Introduction to American Judicial System, Introduction to American Legal System, Understanding of American Law. Court System And Legal Terminology:- The student will learn the pronunciation, spelling, and definition of legal terms, phrases, abbreviations, symbols and reference source used by attorneys. The basic vocabulary of the language of the law includes attorney-client relations, contracts and agreements, criminal law, family law, and court terminology. SECTION C Legal Transcription And Editing:- The student will learn to process, format and transcribe a variety of law office documents. An intensive review of language skills will cover spelling, grammar, punctuation, sentence structure, proofreading, and editing. Students will develop a working knowledge of a variety of legal forms and documents including letters, memos, briefs, pleadings, agendas, transcripts, reports, and wills, Visual and Audio Aides will be provided for Legal and Medical Terminology, Legal and Medical Transcription and Editing MT(410) -E2 P IT ENABLED SERVICES Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT(410) -E2 MT(410) -E3 FRONT LINE TECHNOLOGIES (COM/DCOM/CORBA/XML) Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECION A COM/DCOM:- introduction to COM programming, COM Architecture, COM Interfaces, Class Factories, Types of COM Servers, ActiveX Controls, Property Pages, Distributed Components SECTION B CORBA:- An Architecture of Interoperability, Internet Inter ORB Protocol, CORBA Object References and Smart Pointers, Event Service, Security Service, CORBA filters and dynamic loaders, CORBA and Java Servlets, CORBA Beans SECTION C XML:- The purpose and Nature of XML, XML’s syntax & structure rules, XML Document Type Declaration, XML’s linking mechanisms, XML’s style language, Converting HTML documents into XML documents Reference: 1. Inside COM, Dale Rogerson, WP Publisher 2. Corba Networking with Java (W/C1) by Doss 3. Inside OLE , Microsoft Press 4. Mastering XML (W/CD) by Burman 5. Marchal,”XML by Examples”, PHI MT(410) -E3P FRONT LINE TECHNOLOGIES (COM/DCOM/CORBA/XML) Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT(410) -E3 MT(420) -E4 S/W ENGINEERING THROUGH UML Maximum Time : 3 Hrs. University Examination : 40 Marks Total Marks : 100 Continuous Internal Assessment : 60 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Software Project Planning: Problems, goals and requirements of software development and the case for engineered software, measures of productivity, software development cost factors and cost estimates. Planning software development-resource estimation and planning. Specifications of Software: Specification drafting phase and the process of refinement, specification formats and specification depths, specification recording methods specially in relation to updating. Software Design Techniques and Tools: Top down, bottom up design, data flow oriented, data structure oriented, object oriented and real time design. SECTION B Software Development Methodology and Tools: CASE concepts, CASE methodology and CASE tools. Other software development tools Software Testing: Types of tests-module testing, integration testing, top down versus bottom up testing, mixed testing, statistical testing, comparisons of test methods, graph model, debugging techniques. Choice of test data, generation. Software Complexity: Complexity measurement – Heuristic measurement of complexity, instruction count, statistical measurement, graph theoretic complexity measurement. Complexity versus number of errors and development time. Memory requirements and processing time. SECTION C Software Reliability: Concepts of software reliability – Probabilistic and deterministic models, failure model. Management of Software Development Project: Monitoring the project, effective communication between the development teams, prototype development and intermediate review. Software Evaluation. UML:- Introduction to UML, Classes, Relationships, Common mechanism, Diagrams and class diagrams. References: 1. Richard Fairley, Software Engineering Concepts, Tata McGraw Hill. 2. Pressman, Software Engineering – A Practitioner's Approach. 3. C.Easteal and G.Davis, Software Engineering Analysis and Design, Tata McGraw Hill. 4. Pankaj Jalote, An Integrated Approach to Software Engineering, Narosa Publication. 5. Ian Sommeriele, “Software Engineering”, Addison Wesley. 6. Carlo Gheji, Mehdi Jazayeri, “ Fundamentals of Software Engineering” PHI 7. Rajib Mall,” Fundamentals of Software Engineering”, PHI 8. Stephan R. Schach,”Object Oriented and Classical Software Engineering”, TMH MT(420) -E5 VISUAL PROGRAMMING IN VB Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Introduction to Visual Basic:- Creating User Interfaces with Windows Common Controls, Creating Menus for your Programs, Advance Design Features, Working with Collections, Creating Classes in a Program, Working with Active Data Objects SECTION B Creating Database Applications:- Accessing Data with Data Control Communicating with Other Programs:- Using ActiveX Server, Creating ActiveX Client Applications SECTION C Extending the Capabilities of Visual Basic:- Declaring and using External Functions, Creating ActiveX Control with Visual Basic Integrating Visual Basic with the Internet:- Writing Internet Application with Visual Basic Reference:- 1. Mastering Visual Basic 6.0 by Petroutsos. 2. Visual Basic 6 Complete by Sybex. 3. Mastering database Programming with Visual Basic 6 by Petroutsos 4. Visual Basic 6 In Record Time by Brown. 5. Expert Guide to Visual Basic 6 by Freeze 6. Silver & Spots,” Special Edition using VisualBasic 6.0”,PHI MT(420) -E5 P VISUAL PROGRAMMING IN VB Maximum Time : 3 Hrs. University Examination : 20 Marks Total Marks : 50 Continuous Internal Assessment : 30 Marks Minimum Pass Marks : 40% The laboratory course will comprise of exercises on what is learnt in the theory classes of the same course i.e. MT(420) -E5 MT(420) -E6 PLANNING & MANAGEMENT OF COMPUTER CENTRES Maximum Time : 3 Hrs. University Examination : 40 Marks Total Marks : 100 Continuous Internal Assessment : 60 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Hardware: Computing concepts, input devices, processing unit, output devices, peripheral devices, Software: Operating System, utility programmes, language processors, application programmes, decision support software, programming languages, programme execution model. Buying a computer: present operation, present cost, present problems, desired goals, considering the alternatives, human factor, strategies and time schedule. Selecting the computer: hardware specification, system software, identifying vendors, request for proposal, choosing a vendor. SECTION B Computer room preparation, room location, site requirement, site layout, Power supply, air conditioning, fire protection system, lightening, false flooring. Buying an application package: make or buy decision, buying plan, software requirement, surveying available packages, screening the package, selecting a package, signing the contract, installing the package. In house development: Problem statement, program specification, program decision, selecting a language, coding, debugging, program testing, documentation. SECTION C Maintaining your computer: Hardware problem, power supply problem, spares and consumables, software problems, human problems, preventing the problem, back up security, maintenance alternatives. Human side of computer: user participation, user education, managing user resistance, computer center staff. Reference:- 1. E.Balaguruswami, “Selecting and managing a small computer” Tata McGraw Hill. 2. Essentials of Management by Harold Koontz Heinz Weihrich of TMH 3. Massie,” Essentials of Management”, PHI MT(420) -E7 DISTRIBUTED COMPUTING Maximum Time : 3 Hrs. University Examination : 40 Marks Total Marks : 100 Continuous Internal Assessment : 60 Marks Minimum Pass Marks : 40% A) Instructions for paper-setters The question paper will consist of four sections A, B, C, D. Sections A, B and C will have two questions from the respective sections of the syllabus and will carry 20% marks each. Section D will have 10-20 short answer type questions which will cover the entire syllabus uniformly and will carry 40% marks in all. B) Instructions for candidates 1. Candidates are required to attempt one question each from sections A, B and C of the question paper and the entire section D. 2. Use of non-programmable scientific calculator is allowed. SECTION A Concurrency Fundamentals: Basic issues and model Asynchrony, delay, failure concurrency, communication topology, load balancing, scaling. Basic Approaches: Agreement and consensus problems, transactions, Algorithms for reduction, scans (also non-parallel issues), Analysis : work/time complexity. SECTION B Shared Memory: Models and Primitives, PRAM, VRAM, semaphores, spin-locks, Barriers, Implementations, NESL, threads, distributed shared memory SECTION C Parallel Architectures: Survey of Architectures KSR, TMC, MasPar, workstation clusters Algorithm Development and Analysis: Parallel algorithms Connected components (dense and sparse case) Sorting Distributed algorithms Clock synchronization. Reference: 1. Kai, Hwang, Computer Architecture and Parallel processing, McGraw Hill Co. 2. Sinha,”Distributed Operating Systems: Concepts and Design”, PHI 3. Rajaraman & Murthy, “ Parallel Computers: Architecture and Programming”,PHI 4. Sashikumar,”Introduction to Parallel Processing”, PHI MT-430 P MAJOR PROJECT Maximum Time : 3 Hrs. University Examination : 120 Marks Total Marks : 300 Continuous Internal Assessment : 180 Marks Minimum Pass Marks : 40% 1. Students are supposed to spend 45-55 hours on the project. The internal teacher must monitor progress of the Project. Students can arrange the project at their own level, however, Institute can also assist in getting the project and can issue necessary letters etc. 2. The external examiner will distribute marks allocated for University examination for viva/project report and for any other activity, which the external examiner thinks to be proper. Maximum Marks for Project Application 60% Max marks for Viva 40% 3. Joint projects will be allowed and joint project reports will also be accepted. The students should highlight their contributions in a joint project report. 4. The students have to submit two copies of Project reports. The examiners will evaluate these reports on the spot at the time of examination and will conduct the viva.