![U.P. TECHNICAL UNIVERSITY
LUCKNOW
Syllabus
2nd year [III & IV Sem.]
[Effective from the session : 2009-10]
MASTER OF COMPUTER APPLICATION
(1)](https://image.slidesharecdn.com/3rdsemsyllbus-120507194036-phpapp01/85/3rd-sem-syllbus-1-320.jpg)
3rd sem syllbus
- 1. U.P. TECHNICAL UNIVERSITY LUCKNOW Syllabus 2nd year [III & IV Sem.] [Effective from the session : 2009-10] MASTER OF COMPUTER APPLICATION (1)
- 2. U.P.TECHNICAL UNIVERSITY, LUCKNOW STUDY AND EVALUATION SCHEME MCA (Master of Computer Application) (Effective from the session: 2009-10) MCA YEAR II, SEMESTER –III EVALUATION SCHEME S. COURSE SUBJECT PERIODS SESSIONAL EXAM Subject No. CODE ESE L T P CT TA Total Total 1. MCA-311 Operating Systems 3 1 0 30 20 50 100 150 2. MCA-312 Design & Analysis of Algorithms 3 1 0 30 20 50 100 150 3. MCA-313 Data base Management System 3 1 0 30 20 50 100 150 4. MCA-314 Internet & Java Programming 3 1 0 30 20 50 100 150 Computer Based Optimization 3 1 0 30 20 50 100 150 5. MCA-315 Techniques PARCTICALS 6. MCA-351 DBMS Lab 0 0 3 30 20 50 50 100 7. MCA-352 Java Programming Lab 0 0 3 30 20 50 50 100 8. GP-301 General Proficiency 0 0 0 - - 50 - 50 Total 15 5 6 - - - - 1000 YEAR – II, SEMESTER – IV EVALUATION SCHEME S. COURSE PERIODS SESSIONAL EXAM Subject ESE No. CODE SUBJECT L T P CT TA Total Total 1 MCA-411 Management Information Systems 3 1 0 30 20 50 100 150 2 MCA-412 Object Oriented Systems 3 1 0 30 20 50 100 150 3 Elective-I 3 1 0 30 20 50 100 150 4 MCA-413 Fundamentals of E-Commerce 3 1 0 30 20 50 100 150 5 MCA-414 Computer Networks 3 1 0 30 20 50 100 150 PRACTICALS 6 MCA-451 Object Oriented Systems Lab 0 0 3 30 20 50 50 100 7 MCA-452 Mini Project 0 0 3 30 20 50 50 100 8 GP-401 General Proficiency 0 0 0 - - 50 - 50 Total 15 5 6 1000 Code List of Elective-I MCAE11 Compiler Design MCAE12 Client Server Computing MCAE13 Data Warehousing & Mining MCAE14 Cryptography & Network Security MCAE15 Theory of Automata & Formal Languages MCAE16 Distributed system (2)
- 3. U.P.TECHNICAL UNIVERSITY, LUCKNOW STUDY AND EVALUATION SCHEME MCA (Master of Computer Application) (Effective from the session: 2010-11) MCA YEAR III, SEMESTER – V EVALUATION SCHEME S. COURSE SUBJECT PERIODS SESSIONAL EXAM Subject No. CODE ESE L T P CT TA Total Total 1. MCA-511 WEB Technology 3 1 0 30 20 50 100 150 Elective-II 3 1 0 30 20 50 100 150 2. 3. MCA-512 Dot Net Framework & C# 3 1 0 30 20 50 100 150 4. MCA-513 Software Engineering 3 1 0 30 20 50 100 150 Elective-III 3 1 0 30 20 50 100 150 5. PARCTICALS 6. MCA-551 WEB Technology Lab 0 0 3 30 20 50 50 100 7. MCA-552 Dot Net Lab 0 0 3 30 20 50 50 100 8. GP-501 General Proficiency 0 0 0 - - 50 - 50 Total 15 5 6 1000 List Elective-II MCAE21 Computer Graphics & Animation MCAE22 Simulation & Modelling MCAE23 Advance Database Management Systems MCAE24 Artificial Intelligence MCAE25 Information Security & Cyber Laws MCAE26 Information Storage & Management List Elective-III MCAE31 ERP Systems MCAE32 Software Project Management MCAE33 Real Time Systems MCAE34 Mobile Computing MCAE35 Neural Networks MCAE36 Pattern Recognition YEAR –III, SEMESTER – VI EVALUATION SCHEME S. COURSE PERIODS SESSIONAL EXAM Subject ESE No. CODE SUBJECT L T P CT TA Total Total 1 MCA-611 Colloquim 0 0 3 - 200 200 - 200 2 MCA-612 Project 0 0 4 - 300 300 500 800 Total 1000 (3)
- 4. OPERATING SYSTEMS LT P MCA 311 3 1 0 Unit-I Introduction: Definition and types of operating systems, Batch Systems, multi programming, time–sharing parallel, distributed and real-time systems, Operating system structure, Operating system components and services, System calls, system programs, Virtual machines. Unit-II Process Management: Process concept, Process scheduling, Cooperating processes, Threads, Interprocess communication, CPU scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Real-time scheduling and Algorithm evaluation. Unit-III Process Synchronization and Deadlocks: The Critical-Section problem, synchronization hardware, Semaphores, Classical problems of synchronization, Critical regions, Monitors, Deadlocks-System model, Characterization, Deadlock prevention, Avoidance and Detection, Recovery from deadlock, Combined approach to deadlock handling. Unit-IV Storage management: Memory Management-Logical and Physical Address Space, Swapping, Contiguous Allocation, Paging, Segmentation with paging in MULTICS and Intel 386, Virtual Memory, Demand paging and its performance, Page replacement algorithms, Allocation of frames, Thrasing, Page Size and other considerations, Demand segmentation, File systems, secondary Storage Structure, File concept, access methods, directory implementation, Efficiency and performance, recovery, Disk structure, Disk scheduling methods, Disk management, Recovery, Disk structure, disk scheduling methods, Disk management, Swap-Space management, Disk reliability. Unit-V Security & Case Study: Protection and Security-Goals of protection, Domain of protection, Access matrix, Implementation of access Matrix, Revocation of Access Rights, language based protection, The Security problem, Authentication, One Time passwords, Program threats, System threats, Threat Monitoring, Encryption. Windows NT-Design principles, System components, Environmental subsystems, File system, Networking and program interface, Linux system-design principles, Kernel Modules, Process Management, Scheduling, Memory management, File Systems, Input and Output, Interprocess communication, Network structure, security References 1. Abraham Siberschatz and Peter Baer Galvin, “Operating System Concepts”, Fifth Edition, Addision-Wesley 2. Milan Milankovic, “Operating Systems, Concepts and Design”, McGraw-Hill. 3. Harvey M Deital, "Operating Systems", Addison Wesley 4. Richard Peterson, “Linux: The Complete Reference”, Osborne McGraw-Hill. DESIGN AND ANALYSIS OF ALGORITHMS MCA 312 LTP 310 Unit-I Introduction: Algorithms, Analysis of Algorithms, Design of Algorithms, Complexity of Algorithms, Asymptotic Notations, Growth of function, Recurrences and their solution methods. Sorting in polynomial Time: Insertion sort, Merge sort, Heap sort, and Quick sort Sorting in Linear Time: Counting sort, Radix Sort, Bucket Sort, Medians and order statistics Unit-II Advanced Data Structure: Red Black Trees, Augmenting Data Structure, Binomial Heap, B-Tree, Fibonacci Heap, and Data Structure for Disjoint Sets, All kinds of Algorithms on these data structures, Dictionaries and priority Queues, mergeable heaps, concatenable queues Unit-III Advanced Design and Analysis Techniques: Dynamic programming, Greedy Algorithm, Backtracking, Branch-and-Bound, Amortized Analysis Unit-IV Graph Algorithms: Elementary Graph Algorithms, Breadth First Search, Depth First Search, Minimum Spanning Tree, Kruskal’s Algorithms, Prim’s Algorithms, Single Source Shortest Path, All pair Shortest Path, Maximum flow and Traveling Salesman Problem Unit-V Randomized Algorithms, String Matching, NP-Hard and NP-Completeness, Approximation Algorithms, Sorting Network, Matrix Operations, Polynomials and FFT, Number Theoretic Algorithms References 1. Design and Analysis of Computer Algorithms, Aho, Pearson Education Pub. (4)
- 5. 2. Fundamentals of Computer Algorithms by Horowitz and Sahani, Galgotia 3. Introduction to Algorithms by Thomas H Cormen Leiserson et al, PHI 4. Computer Algoritms : Introduction to Design and Analysis by Sara Baase and Allen Van Gelder, Pearson Education 5. Algorithm Design by Jon Kleinberg and Eva Tardos, Pearson Education 6. Fundamental of Algorithms by Brassard Bratley, PHI 7. Algorithms Design by M T Goodrich et al, John Wiley 8. The Design and analysis of Algorithms by A V Aho et al, Pearson Education DATABASE MANAGEMENT SYSTEMS LT P MCA 313 3 1 0 Unit- I Introduction: An overview of database management system, Database System Vs File System, Database system concepts and architecture, data models schema and instances, data independence and data base language and interfaces, Data definitions language, DML, Overall Database Structure. Data Modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER diagrams to tables, extended ER model, relationships of higher degree. Unit- II Relational data Model and Language: Relational data model concepts, integrity constraints: entity integrity, referential integrity, Keys constraints, Domain constraints, relational algebra, relational calculus, tuple and domain calculus. Introduction to SQL: Characteristics of SQL, Advantages of SQL, SQL data types and literals, Types of SQL commands, SQL operators and their procedure, Tables, views and indexes, Queries and sub queries, Aggregate functions, Insert, update and delete operations, Joins, Unions, Intersection, Minus, Cursors in SQL. PL/SQL, Triggers and clusters. Unit- III Data Base Design & Normalization: Functional dependencies, normal forms, first, second, third normal forms, BCNF, inclusion dependencies, loss less join decompositions, normalization using FD, MVD, and JDs, alternative approaches to database design. Unit- IV Transaction Processing Concepts: Transaction system, Testing of serializability, Serializability of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction failures, log based recovery, checkpoints, deadlock handling. Unit- V Concurrency Control Techniques: Concurrency control, locking Techniques for concurrency control, Time stamping protocols for concurrency control, validation based protocol, multiple granularity, Multi-version schemes, Recovery with concurrent transaction. Transaction Processing in Distributed system, data fragmentation. Replication and allocation techniques for distributed system, overview of concurrency control and recovery in distrusted database. References 1 Date C J, “An Introduction To Database System”, Addision Wesley 2 Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill 3 Elmasri, Navathe, “Fundamentals Of Database Systems”, Addision Wesley 4 Paul Beynon Davies, “Database Systems”, Palgrave Macmillan 5 Bipin C. Desai, “An introduction to Database Systems”, Galgotia Publication 6 Majumdar & Bhattacharya, “Database Management System”, TMH 7 Ramakrishnan, Gehrke, “Database Management System”, McGraw Hill 8 Bharti P.K, “An introduction to Database Systems”, JPNP INTERNET & JAVA PROGRAMMING LT P MCA 314 Unit-1 3 1 0 Internet: Internet, Connecting to Internet: Telephone, Cable, Satellite connection, Choosing an ISP, Introduction to Internet services, E-Mail concepts, Sending and Receiving secure E-Mail, Voice and Video Conferencing. Unit- II Core Java: Introduction, Operator, Data type, Variable, Arrays, Control Statements, Methods & Classes, Inheritance, Package and Interface, Exception Handling, Multithread programming, I/O, Java Applet, String handling, Networking, Event handling, Introduction to AWT, AWT controls, Layout managers, Menus, Images, Graphics. Unit-III Java Swing: Creating a Swing Applet and Application, Programming using Panes, Pluggable Look and feel, Labels, Text fields, Buttons, Toggle buttons, Checkboxes, Radio Buttons, View ports, Scroll Panes, Scroll Bars, Lists, Combo box, Progress Bar, Menus and Toolbars, Layered Panes, Tabbed Panes, Split Panes, Layouts, Windows, Dialog Boxes, Inner frame. JDBC: The connectivity Model, JDBC/ODBC Bridge, java.sql package, connectivity to remote database, navigating (5)
- 6. through multiple rows retrieved from a database. Unit-IV Java Beans: Application Builder tools, The bean developer kit(BDK), JAR files, Introspection, Developing a simple bean, using Bound properties, The Java Beans API, Session Beans, Entity Beans, Introduction to Enterprise Java beans (EJB), Introduction to RMI (Remote Method Invocation): A simple client-server application using RMI. Unit-V Java Servlets: Servlet basics, Servlet API basic, Life cycle of a Servlet, Running Servlet, Debugging Servlets, Thread-safe Servlets, HTTP Redirects, Cookies, Introduction to Java Server pages (JSP). References: 1. Margaret Levine Young, “The Complete Reference Internet”, TMH 2. Naughton, Schildt, “The Complete Reference JAVA2”, TMH 3. Balagurusamy E, “Programming in JAVA”, TMH 4. Dustin R. Callway, “Inside Servlets”, Addison Wesley 5. Mark Wutica, “Java Enterprise Edition”, QUE 6. Steven Holzner, “Java2 Black book”, dreamtech COMPUTER BASED OPTIMIZATION TECHNIQUES LT P MCA 315 3 1 0 Unit I Preliminaries: Inventory Models and Replacement problems: Inventory models –various costs-deterministic inventory models, Single period inventory model with shortest cost, stochastic models, Application of inventory models, Economic lot sizes-price breaks, Replacement problems-capital equipment-discounting costs-replacement in anticipation of failure- group replacement-stochastic nature underlying the failure phenomenon. Unit II Linear Programming Problems (LPP): Definition of LPP, Graphical Solutions of Linear Programming Problems, Simplex Method, and Artificial Variable Method, Two Phase Method, Charnes’ Big-M Method, Sensitivity Analysis, Revised Simplex Method, Duality, Dual Simplex Method Unit III Integer Linear Programming Problems: Integer Linear Programming Problems, Mixed Integer Linear Programming Problems, Cutting Plane Method, Branch and Bound Method, 0-1 integer linear programming problem. Transportation Problems: Introduction to Transportation Model, Matrix Form of TP, Applications of TP Models, Basic Feasible Solution of a TP, Degeneracy in TP, Formation of Loops in TP, Solution Techniques of TP, Different Methods for Obtaining Initial Basic Feasible Solutions viz. Matrix Minima Method, Row Minima Method, Column Minima Methods, Vogel’s Approximation Method, Techniques for Obtaining Optimal Basic Feasible Solution. Assignment Problems: Definition, Hungarian Method for AP. Unit IV Introduction to NLP: Definition of NLP, Convex Programming Problems, Quadratic Programming Problems, Wolfe’s Method for Quadratic Programming, Kuhn-Tucker Conditions, Geometrical Interpretation of KT-Conditions, KT-Points etc. Dynamic Programming: Bellman’s Principle of optimality of Dynamic Programming, Multistage decision problem and its solution by Dynamic Programming with finite number of stages, Solution of linear programming problems as a Dynamic Programming problem Unit V Queuing Theory Introduction to Queues, Basic Elements of Queuing Models, Queue Disciplines, Memoryless Distribution, Role of Exponential and Poisson Distributions, Markovian Process, Erlang Distribution, Symbols and Notations, Distribution Of Arrivals, Distribution of Service Times, Definition of Steady and Transient State, Poisson Queues. References: 1. Hadley, G.,”Linear Programming, and Massachusetts”, Addison-Wesley 2. Taha, H.A, ”Operations Research – An Introduction”, Macmillian 3. Hiller, F.S., G.J. Lieberman, ” Introduction to Operations Research”, Holden-Day 4. Harvey M. Wagner, “Principles of Operations Research with Applications to Managerial Decisions”, Prentice Hall of India Pvt. Ltd. 5. Swarup K etal, “Operation Research”, S. Chand DBMS LAB MCA - 351 LT P 0 03 The programme to be implemented using SQL 1. Create Table, SQL for Insertion, Deletion, Update and Retrival using aggregating functions. (6)
- 7. 2. Write Programs in PL/SQL, Understanding the concept of Cursors. 3. Write Program for Join, Union & intersection etc. 4. Creating Views, Writing Assertions, Triggers. 5. Creating Forms, Reports etc. 6. Writing codes for generating read and update operator in a transaction using different situations. 7. Implement of 2PL concerning central algorithm. 8. Developing code for understanding of distributed transaction processing. Students are advised to use Developer 2000 Oracle 8+ version for above experiments. However, depending on the availability of Software’s students may use power builder/SQL Server/DB2 etc. for implementation. L T P Java Programming Lab 0 0 3 MCA-352 1. Write a program in Java for illustrating, overloading, over riding and various forms of inheritance. 2. Write programs to create packages and multiple threads in Java. 3. Write programs in Java for event handling Mouse and Keyboard events. 4. Using Layout Manager create different applications. 5. Write programs in Java to create and manipulate Text Area, Canvas, Scroll Bars, Frames and Menus using swing/AWT. 6. Using Java create Applets. 7. Use Java Language for Client Server Interaction with stream socket connections. 8. Write a program in java to read data from disk file. MANAGEMENT INFORMATION SYSTEMS LT P MCA 411 3 1 0 Unit 1: Foundation of Information Systems: Introduction to information system in business, fundamentals of information systems, Solving business problems with information systems, Types of information systems, Effectiveness and efficiency criteria in information system. Unit 2: An overview of Management Information Systems: Definition of a management information system, MIS versus Data processing, MIS & Decision Support Systems, MIS & Information Resources Management, End user computing, Concept of an MIS, Structure of a Management information system. Unit 3: Concepts of planning & control: Concept of organizational planning, The Planning Process, Computational support for planning, Characteristics of control process, The nature of control in an organization. Unit 4: Business applications of information technology: Internet & electronic commerce, Intranet, Extranet & Enterprise Solutions, Information System for Business Operations, Information System for Managerial Decision Support, Information System for Strategic Advantage. Unit 5: Managing Information Technology: Enterprise & global management, Security & Ethical challenges, Planning & Implementing changes. Advanced Concepts in Information Systems: Enterprise Resource Planning, Supply Chain Management, Customer Relationship Management, and Procurement Management. Text Books 1. O Brian, “Management Information System”, TMH 2. Gordon B. Davis & Margrethe H. Olson, “Management Information System”, TMH. References 1. O Brian, “Introduction to Information System”, MCGRAW HILL. 2. Murdick, “Information System for Modern Management”, PHI. 3. Jawadekar, “ Management Information System”, TMH. 4. Jain Sarika, “Information System”, PPM 5. Davis, “Information System”, Palgrave Macmillan (7)
- 8. MCA-412 : OBJECT ORIENTED SYSTEMS LTP 310 Unit – I Object Modeling: Objects and classes, links and association, generalization and inheritance, aggregation, abstract class, multiple inheritance, meta data, candidate keys, constraints. Unit – II Dynamic Modeling: Events and states, operations, nested state diagrams and concurrency, advanced dynamic modeling concepts, a sample dynamic model. Unit – III Functional Modeling: Data flow diagram, specifying operations, constraints, a sample functional model.OMT (object modeling techniques) methodologies, examples and case studies to demonstrate methodologies, comparisons of methodologies, SA/SD, JSD. Unit – IV Java Programming: Introduction, Operator, Data types, Variables, Methods & Classes, Multithread Programming, I/O, Java Applet. Java Library: String Handling, Input/Output exploring Java.io, Networking, Applets classes, Event Handling, Introduction to AWT, Working with window, Graphics, AWT Controls, Layout Manager and Menus, Images, Additional packages. Unit – V Software Development using Java: Java Beans, Java Swing, Java Servlets, Migrating from C++ to java, Application of java, Dynamic Billboard Applet, Image Menu: An image based menu, Lavatron Applets, Scrabblets, JDBC, Brief functioning of upper layer E-mail and their applications. Text Books: 1. James Rumbaugh etal, “Object Oriented Modeling and Design”, PHI 2. Herbert Schieldt, “The Complete Reference: Java”, TMH. 3. E. Balagurusamy, “Programming in JAVA”, TMH. References: 1. Booch Grady, “Object Oriented Analysis & Design with application 3/e”, Pearson Education, New Delhi. 2. Bjarne Stroustrup, “C++ Programming Language”, Addison Wesley 3. E. Balagurusamy, “Object Oriented Programming with C++”, TMH FOUNDAMENTALS OF E-COMMERCE LT P MCA 413 3 1 0 Unit 1 Introduction: Electronic Commerce - Technology and Prospects, Definition of E- Commerce, Economic potential of electronic commerce, Incentives for engaging in electronic commerce, forces behind E-Commerce, Advantages and Disadvantages, Architectural framework, Impact of E-commerce on business. Network Infrastructure for E- Commerce: Internet and Intranet based E-commerce- Issues, problems and prospects, Network Infrastructure, Network Access Equipments, Broadband telecommunication (ATM, ISDN, FRAME RELAY). Unit II Mobile Commerce: Introduction, Wireless Application Protocol, WAP technology, Mobile Information device, Mobile Computing Applications. Unit III Web Security: Security Issues on web, Importance of Firewall, components of Firewall, Transaction security, Emerging client server, Security Threats, Network Security, Factors to consider in Firewall design, Limitation of Firewalls. Unit IV Encryption: Encryption techniques, Symmetric Encryption- Keys and data encryption standard, Triple encryption, Asymmetric encryption- Secret key encryption, public and private pair key encryption, Digital Signatures, Virtual Private Network. Unit V Electronic Payments: Overview, The SET protocol, Payment Gateway, certificate, digital Tokens, Smart card, credit card, magnetic strip card, E-Checks, Credit/Debit card based EPS, online Banking. EDI Application in business, E- Commerce Law, Forms of Agreement, Govt. policies and Agenda. (8)
- 9. References 1. Ravi Kalakota, Andrew Winston, “Frontiers of Electronic Commerce”, Addison Wesley. 2. Bajaj and Nag, “E-Commerce the cutting edge of Business”, TMH 3. P. Loshin, John Vacca, “Electronic commerce”, Firewall Media, New Delhi MCA-414 : COMPUTER NETWORKS L T P Unit-I 3 1 0 Introductory Concepts: Goals and Applications of Networks, Network structure and architecture, the OSI reference model, services, networks topology, Physical Layer- transmission, switch ing methods, Integrated services digital networks, terminal handling. Unit-II Medium access sub layer: Channel allocations, LAN protocols, ALOHA Protocols- Pure ALOHA, slotted ALOHA, Carrier Sense Multiple Access Protocols, CSMA with Collision Detection, Collision free Protocols, IEEE standards, Ethernet, FDDI, Data Link Layer- basic design issues, error correction & detection algorithms, elementary data link layer protocols, sliding window protocols, error handling, High Level Data Link Control Unit-III Network Layer: Point-to Point networks, concept of virtual circuit and LAN, routing algorithms, congestion control algorithms, internetworking, TCP/IP protocol, IP addresses, IPv6. Unit-IV Transport Layer: Design issues, connection management, Internet Transport Protocol (UDP), Ethernet transport Protocol, Transmission Control Protocol. (TCP) Unit-V Application Layer: Domain Name System, Simple Network Management Protocol, Electronic mail, File Transfer Protocol, Hyper Text Transfer Protocol, Introduction to Cryptography and Network Security (DES, RSA algorithms), Communication Security (IPSec, Firewalls), Authentication protocols such as authentication based on shared key (Diffie Helleman Key exchanger), Introduction to multimedia and compression Techniques. References 1. Computer Networks by A. S Tanenbaum, 4th, Edition”, Pearson education 2. Data and Computer Communication by W. Stallings, Macmillan Press 3. Computer Networks & Internet with Internet Applications by Comer Pearson Education 4. Internetworking with TCP/IP by PHI 5. Data Communication and Networking by Forouzan TMH 6. Computer Networks with Internet Protocols by W Stallings, Pearson Education 7. Local and Metropolitan Area Networks by W Stallings, VIth edition, Pearson Education MCA-451 : OBJECT ORIENTED SYSTEMS LAB L T P 0 0 3 Experiments based on the course Object Oriented Systems to be done on C++/JAVA/UML/VISIO etc. MCA - E11 : COMPILER DESIGN L T P 3 1 0 Unit-1 Compiler Structure: Compilers and Translators, Various Phases of Compiler, Pass Structure of Compiler, Bootstrapping of Compiler Programming Languages: High level languages, The lexical and syntactic structure of a language, Data elements, Data Structure, Operations, Assignments, Program unit, Data Environments, Parameter Transmission. Lexical Analysis: The role of Lexical Analyzer, A simple approach to the design of Lexical Analyzer, Regular Expressions , Transition Diagrams, Finite state Machines, Implementation of Lexical Analyzer, Lexical (9)
- 10. Analyzer Generator: LEX, Capabilities of Lexical Analyzer Unit-II The Syntactic Specification of Programming Languages: CFG, Derivation and Parse tree, Ambiguity, Capabilities of CFG. Basic Parsing Techniques: Top-Down parsers with backtracking, Recursive Descent Parsers, Predictive Parsers, Bottom–up Parsers, Shift-Reduce Parsing, Operator Precedence Parsers, LR parsers (SLR, Canonical LR, LALR) Syntax Analyzer Generator: YACC Unit-III Intermediate Code Generation: Different Intermediate forms: three address code, Quadruples & Triples. Syntax Directed translation mechanism and attributed definition. Translation of Declaration, Assignment, Control flow, Boolean expression, Array References in arithmetic expressions, procedure calls, case statements, postfix translation. Unit-IV Run Time Memory Management: Static and Dynamic storage allocation, stack based memory allocation schemes, Symbol Table management Error Detection and Recovery: Lexical phase errors, Syntactic phase errors, Semantic errors. Unit-V Code Optimization and Code Generation: Local optimization, Loop optimization, Peephole optimization, Basic blocks and flow graphs, DAG, Data flow analyzer, Machine Model, Order of evaluation, Register allocation and code selection References: 1. Alfred V Aho , Jeffrey D. Ullman, “Principles of Compiler Design”, Narosa 2. A.V. Aho, R. Sethi and J.D Ullman, “Compiler: principle, Techniques and Tools”, AW 3. H.C. Holub “Compiler Design in C”, Prentice Hall Inc. 4. Apple, “Modern Computer Implementation in C: Basic Design”, Cambridge press MCA-E12 : CLIENT SERVER COMPUTING L T P 3 1 0 Unit I Client/Server Computing: DBMS concept and architecture, Single system image, Client Server architecture, mainframe-centric client server computing, downsizing and client server computing, preserving mainframe applications investment through porting, client server development tools, advantages of client server computing. Unit II Components of Client/Server application: The client: services, request for services, RPC, windows services, fax, print services, remote boot services, other remote services, Utility Services & Other Services, Dynamic Data Exchange (DDE), Object Linking and Embedding (OLE), Common Object Request Broker Architecture (CORBA). The server: Detailed server functionality, the network operating system, available platforms, the network operating system, available platform, the server operating system. Unit III Client/Server Network: connectivity, communication interface technology, Interposes communication, wide area network technologies, network topologies (Token Ring, Ethernet, FDDI, CDDI) network management, Client-server system development: Software, Client–Server System Hardware: Network Acquisition, PC-level processing unit, Macintosh, notebooks, pen, UNIX workstation, x-terminals, server hardware. Unit IV Data Storage: magnetic disk, magnetic tape, CD-ROM, WORM, Optical disk, mirrored disk, fault tolerance, RAID, RAID-Disk network interface cards. Network protection devices, Power Protection Devices, UPS, Surge protectors. Client Server Systems Development: Services and Support, system administration, Availability, Reliability, Serviceability, Software Distribution, Performance, Network management, Help Disk, Remote Systems Management Security, LAN and Network Management issues. Unit V Client/Server System Development: Training, Training advantages of GUI Application, System Administrator training, Database Administrator training, End-user training. The future of client server Computing Enabling Technologies, The transformational system. References: 1. Patrick Smith & Steave Guengerich, “Client / Server Computing”, PHI 2. Dawna Travis Dewire, “Client/Server Computing”, TMH 3. Majumdar & Bhattacharya, “Database management System”, TMH 4. Korth, Silberchatz, Sudarshan, “Database Concepts”, McGraw Hill 5. Elmasri, Navathe, S.B, “Fundamentals of Data Base System”, Addison Wesley (10)
- 11. MCA-E13 : DATA WAREHOUSING & MINING L T P 3 1 0 Unit – I Dss-Uses, definition, Operational Database. Introduction to DATA Warehousing. Data-Mart, Concept of Data-Warehousing, Multi Dimensional Database Structures. Client/Server Computing Model & Data Warehousing. Parallel Processors & Cluster Systems. Distributed DBMS implementations. Unit – II DATA Warehousing. Data Warehousing Components. Building a Data Warehouse. Warehouse Database. Mapping the Data Warehouse to a Multiprocessor Architecture. DBMS Schemas for Decision Support. Data Extraction, Cleanup & Transformation Tools. Metadata. Unit – III Business Analysis. Reporting & Query Tools & Applications. On line Analytical Processing(OLAP). Patterns & Models. Statistics. Artificial Intelligence. Unit – IV Knowledge Discovery, Data Mining. Introduction to Data-Mining. Techniques of Data-Mining. Decision Trees. Neural Networks. Nearest Neighbor & Clustering. Genetic Algorithms. Rule Introduction. Selecting & Using the Right Technique. Unit – V Multimedia Data-Mining, Multimedia-Databases, Mining Multimedia Data, Data-Mining and the World Wide Web, Web Data- Mining, Mining and Meta-Data. Data Visualization & Overall Perspective. Data Visualization. Applications of Data-Mining. References: 1. Berson, “Data Warehousing, Data-Mining & OLAP”, TMH 2. Mallach, “Decision Support and Data Warehousing System”, TMH 3. Bhavani Thura-is-ingham, “Data-Mining Technologies, Techniques Tools & Trends”, CRC Press 4. Navathe, “Fundamental of Database System”, Pearson Education 5. Margaret H. Dunham, “Data-Mining. Introductory & Advanced Topics”, Pearson Education 6. Pieter Adriaans, Dolf Zantinge, “Data-Mining”, Pearson Education MCA-E14 : CRYPTOGRAPHY AND NETWORK SECURITY L T P 3 1 0 Unit-I Introduction to Cryptography: Introduction To Security: Attacks, Services & Mechanisms, Security, Attacks, Security Services. Conventional Encryption: Classical Techniques, Conventional Encryption Model, And Steganography, Classical Encryption Techniques. Modern Techniques: Simplified DES, Block Cipher Principles, DES Standard, DES Strength, Differential & Linear Cryptanalysis, Block Cipher Design Principles, Block Cipher Modes Of Operation. Unit-II Conventional Encryption Algorithms: Triples DES, Blowfish, International Data Encryption Algorithm, RCS, CAST-128, RC2 Placement & Encryption Function, Key Distribution, Random Number Generation, Placement Of Encryption Function. Unit-III Public Key Encryption: Public-Key Cryptography: Principles Of Public-Key Cryptosystems, RSA Algorithm, Key Management, Fermat’s & Euler’s Theorm, Primality, The Chinese Remainder Theorem. Unit-IV Hash Functions: Message Authentication & Hash Functions: Authentication Requirements, Authentication Functions, Message Authentication Codes, Hash Functions, Birthday Attacks, Security Of Hash Function & MACS, MD5 Message Digest Algorithm, Secure Hash Algorithm (SHA), Digital Signatures: Digital Signatures, Authentication Protocol, Digital Signature Standard (DSS), Proof Of Digital Signature Algorithm. Unit-V Network & System Security: Authentication Applications: Kerberos X.509, Directory Authentication Service, Electronic Mail Security, Pretty Good Privacy (PGP), S / Mime, Security: Architecture, Authentication Header, Encapsulating Security Payloads, Combining Security Associations, Key Management, Web Security: Secure Socket Layer & Transport Layer Security, Secure Electronic Transaction (Set), System Security: Intruders, Viruses, Firewall Design Principles, Trusted Systems. Text Book: 1. William Stallings, “Cryptography and Network Security: Principles and Practice”, Prentice Hall, New Jersey. Reference Books: 1. Johannes A. Buchmann, “Introduction to cryptography”, Springer- Verlag. 2. Atul Kahate, “Cryptography and Network Security”, TMH (11)
- 12. MCA-E15 : THEORY OF AUTOMATA AND FORMAL LANGUAGES L T P 3 1 0 Unit – I Introduction; Alphabets, Strings and Languages; Automata and Grammars, Deterministic finite Automata (DFA)-Formal Definition, Simplified notation: State transition graph, Transition table, Language of DFA, Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finite Automata, Distinguishing one string from other, Myhill-Nerode Theorem Unit – II Regular expression (RE) , Definition, Operators of regular expression and therr precedence, Algebraic laws for Regular expressions, Kleen’s Theorem, Regular expression to FA, DFA to Regular expression, Arden Theorem, Non Regular Languages, Pumping Lemma for regular Languages. Application of Pumping Lemma, Closure properties of Regular Languages, Decision properties of Regular Languages, FA with output: Moore and Mealy machine, Equivalence of Moore and Mealy Machine, Applications and Limitation of FA. Unit – III Context free grammar (CFG) and Context Freee Languages (CFL): Definition, Examples, Derivation , Derivation trees, Ambiguity in Grammer, Inherent ambiguity, Ambiguous to Unambiguous CFG, Useless symbols, Simplification of CFGs, Normal forms for CFGs: CNF and GNF, Closure properties of CFLs, Decision Properties of CFLs: Emptiness, Finiteness and Memership, Pumping lemma for CFLs, Unit – IV Push Down Automata (PDA): Description and definition, Instantaneous Description, Language of PDA, Acceptance by Final state, Acceptance by empty stack, Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, Two stack PDA Unit – V Turing machines (TM): Basic model, definition and representation, Instantaneous Description, Language acceptance by TM, Variants of Turing Machine, TM as Computer of Integer functions, Universal TM, Church’s Thesis, Recursive and recursively enumerable languages, Halting problem, Introduction to Undecidability, Undecidable problems about TMs. Post correspondence problem (PCP), Modified PCP, Introduction to recursive function theory Text Books and References: 1. Hopcroft, Ullman, “Introduction to Automata Theory, Languages and Computation”, Pearson Education 2. K.L.P. Mishra and N.Chandrasekaran, “Theory of Computer Science : Automata, Languages and Computation”, PHI 3. Martin J. C., “Introduction to Languages and Theory of Computations”, TMH 4. Papadimitrou, C. and Lewis, C.L., “Elements of the Theory of Computation”, PHI MCA-E16 : DISTRIBUTED SYSTEM Unit-1 Introduction to Distributed Data system, Distributed Database Architecture, Distributed Data base Design, Transaction processing Concurrency Control techniques, Security. Unit-2 Types of Data Fragmentations, Fragmentation and allocation of fragments, Distribution transparency, access primitives, integrity constraints. (12)
- 13. Unit-3 Grouping and aggregate function, Query processing , Equivalence transformation of queries. Unit-4 Evaluation, parametric queries, Query optimization, Join and general queries. Unit-5 Management of Distributed transaction and concurrency control: Distributed Date base Administration, Catalouge Management Authorisation, Security and protection. Examples of distributed database systems. Cost Analysis References: 1. Ceri & Palgathi, “Distributed Database System”, McGraw Hill. 2. Raghu Rama Krishnan and Johannes Gechrib, “Database Management Systems”, Mc Graw Hill. 3. Date C. J, “An Introduction to Database System, Vol1 & II”, Addition Wesley. 4. Korth, Silbertz, Sudarshan , “Database Concepts”, McGraw Hill. 5. Elmasari , Navathe, “Fundamentals of Data Base Systems”, Addition Wesley. 6. Data C. J , “An Introduction to Database System” , Addition Wesley 7. RamaKrishnan , Gehke, “Database Management System”, McGraw Hill (13)