U.P.

TECHNICAL UNIVERSITY LUCKNOW

Syllabus

2nd year [III & IV Sem.]
[Effective from the session : 2009-10]

MASTER OF COMPUTER APPLICATION

(1)

U. 8. MCA-351 MCA-352 GP-301 0 0 0 15 0 0 0 5 3 3 0 6 30 30 20 20 50 50 50 50 50 100 100 50 1000 S. 7.TECHNICAL UNIVERSITY. No. LUCKNOW STUDY AND EVALUATION SCHEME MCA (Master of Computer Application) (Effective from the session: 2009-10) MCA S. No. 5. 1.P. 4. COURSE CODE MCA-311 MCA-312 MCA-313 MCA-314 MCA-315 SUBJECT YEAR II. SEMESTER –III PERIODS L T P 3 1 0 3 3 3 3 1 1 1 1 0 0 0 0 EVALUATION SCHEME SESSIONAL EXAM ESE CT TA Total 30 20 50 100 30 30 30 30 20 20 20 20 50 50 50 50 100 100 100 100 Subject Total 150 150 150 150 150 Operating Systems Design & Analysis of Algorithms Data base Management System Internet & Java Programming Computer Based Optimization Techniques DBMS Lab Java Programming Lab General Proficiency Total PARCTICALS 6. 2. 1 2 3 4 5 6 7 8 COURSE CODE MCA-411 MCA-412 Elective-I MCA-413 MCA-414 MCA-451 MCA-452 GP-401 SUBJECT Management Information Systems Object Oriented Systems Fundamentals of E-Commerce Computer Networks Object Oriented Systems Lab Mini Project General Proficiency Total PERIODS L T P 3 1 0 3 3 3 3 0 0 0 15 1 1 1 1 0 0 0 5 0 0 0 0 3 3 0 6 YEAR – II. 3. SEMESTER – IV EVALUATION SCHEME SESSIONAL EXAM Subject ESE Total CT TA Total 30 20 50 100 150 30 30 30 30 30 30 20 20 20 20 20 20 50 50 50 50 50 50 50 100 100 100 100 50 50 150 150 150 150 100 100 50 1000 PRACTICALS Code MCAE11 MCAE12 MCAE13 MCAE14 MCAE15 MCAE16 List of Elective-I Compiler Design Client Server Computing Data Warehousing & Mining Cryptography & Network Security Theory of Automata & Formal Languages Distributed system (2) .

No. 8. 1 2 COURSE CODE MCA-611 MCA-612 SUBJECT Colloquim Project PERIODS L T P 0 0 3 0 0 4 Total (3) .U.TECHNICAL UNIVERSITY. SEMESTER – V PERIODS L T P 3 1 0 3 3 3 3 1 1 1 1 0 0 0 0 EVALUATION SCHEME SESSIONAL EXAM ESE CT TA Total 30 20 50 100 30 30 30 30 20 20 20 20 50 50 50 50 100 100 100 100 Subject Total 150 150 150 150 150 PARCTICALS 6. 7. 2. 4. SEMESTER – VI EVALUATION SCHEME SESSIONAL EXAM Subject ESE Total CT TA Total 200 200 200 300 300 500 800 1000 0 0 0 15 0 0 0 5 3 3 0 6 30 30 20 20 50 50 50 50 50 100 100 50 1000 List MCAE21 MCAE22 MCAE23 MCAE24 MCAE25 MCAE26 List MCAE31 MCAE32 MCAE33 MCAE34 MCAE35 MCAE36 S. MCA-551 MCA-552 GP-501 WEB Technology Lab Dot Net Lab General Proficiency Total Elective-II Computer Graphics & Animation Simulation & Modelling Advance Database Management Systems Artificial Intelligence Information Security & Cyber Laws Information Storage & Management Elective-III ERP Systems Software Project Management Real Time Systems Mobile Computing Neural Networks Pattern Recognition YEAR –III. 1.P. 5. COURSE CODE MCA-511 Elective-II MCA-512 MCA-513 Elective-III Dot Net Framework & C# Software Engineering SUBJECT WEB Technology YEAR III. No. LUCKNOW STUDY AND EVALUATION SCHEME MCA (Master of Computer Application) (Effective from the session: 2010-11) MCA S. 3.

security References 1. "Operating Systems". “Operating Systems. Process Management. Unit-III Process Synchronization and Deadlocks: The Critical-Section problem. 3. system programs. Thrasing. Disk structure. Depth First Search. File concept. String Matching. (4) . Linux system-design principles. All kinds of Algorithms on these data structures. disk scheduling methods. Revocation of Access Rights. recovery. All pair Shortest Path. Unit-II Process Management: Process concept. Deadlock prevention. Unit-V Security & Case Study: Protection and Security-Goals of protection. and Quick sort Sorting in Linear Time: Counting sort. Fibonacci Heap. Threat Monitoring. Windows NT-Design principles. Branch-and-Bound. System threats. Page Size and other considerations. Polynomials and FFT. One Time passwords. Swap-Space management. Pearson Education Pub. language based protection. Deadlocks-System model. Scheduling. Combined approach to deadlock handling. Operating system structure. Demand segmentation. Cooperating processes. NP-Hard and NP-Completeness. Disk management. Interprocess communication. Single Source Shortest Path. Multiple-processor scheduling. Critical regions. Operating system components and services. Maximum flow and Traveling Salesman Problem Unit-V Randomized Algorithms. synchronization hardware. The Security problem. Process scheduling. Asymptotic Notations. Characterization. Networking and program interface. Authentication. System components. Radix Sort. Osborne McGraw-Hill. Access matrix. Disk management. Implementation of access Matrix. Harvey M Deital. Encryption. Sorting Network. Approximation Algorithms. Kernel Modules. Environmental subsystems. Virtual Memory. Recurrences and their solution methods. and Data Structure for Disjoint Sets. Sorting in polynomial Time: Insertion sort. Merge sort. Binomial Heap. Analysis of Algorithms. CPU scheduling criteria. Fifth Edition. Greedy Algorithm. Medians and order statistics Unit-II Advanced Data Structure: Red Black Trees. Concepts and Design”. Disk structure. Segmentation with paging in MULTICS and Intel 386. Contiguous Allocation. File system. Batch Systems. McGraw-Hill. Augmenting Data Structure. File systems. Disk reliability. Design and Analysis of Computer Algorithms. Amortized Analysis Unit-IV Graph Algorithms: Elementary Graph Algorithms. Backtracking. Dictionaries and priority Queues. Threads. Disk scheduling methods. Paging. Swapping. mergeable heaps. Domain of protection. access methods. Minimum Spanning Tree. Virtual machines. Real-time scheduling and Algorithm evaluation. Interprocess communication. “Linux: The Complete Reference”. Addison Wesley 4. Input and Output. Scheduling algorithms. Complexity of Algorithms. Avoidance and Detection. B-Tree. Richard Peterson. Program threats. Matrix Operations. time–sharing parallel. Addision-Wesley 2. DESIGN AND ANALYSIS OF ALGORITHMS MCA 312 LTP 310 Unit-I Introduction: Algorithms. Breadth First Search. Unit-IV Storage management: Memory Management-Logical and Physical Address Space. Recovery from deadlock. concatenable queues Unit-III Advanced Design and Analysis Techniques: Dynamic programming. Aho. Heap sort.OPERATING SYSTEMS MCA 311 LT P 3 1 0 Unit-I Introduction: Definition and types of operating systems. multi programming. directory implementation. “Operating System Concepts”. distributed and real-time systems. Demand paging and its performance. Efficiency and performance. Semaphores. Monitors. Abraham Siberschatz and Peter Baer Galvin. Growth of function. Kruskal’s Algorithms. Network structure. Design of Algorithms. secondary Storage Structure. Milan Milankovic. Page replacement algorithms. Prim’s Algorithms. Memory management. Classical problems of synchronization. Recovery. Bucket Sort. File Systems. System calls. Allocation of frames. Number Theoretic Algorithms References 1.

Generalization. Sudarshan. JDBC: The connectivity Model. validation based protocol. Methods & Classes. third normal forms. Programming using Panes.IV Transaction Processing Concepts: Transaction system. referential integrity. PHI Algorithms Design by M T Goodrich et al. Transaction Processing in Distributed system. McGraw Hill 3 Elmasri. Galgotia Introduction to Algorithms by Thomas H Cormen Leiserson et al. Package and Interface. Tabbed Panes. Multithread programming. Keys constraints. Recovery from transaction failures. checkpoints. Unit. Database System Vs File System. Data Modeling using the Entity Relationship Model: ER model concepts. SQL data types and literals. Unit. normal forms. Overall Database Structure. inclusion dependencies. “An introduction to Database Systems”. Data type. Data definitions language. References 1 Date C J. 7. Concepts of Super Key. Triggers and clusters. JPNP INTERNET & JAVA PROGRAMMING MCA 314 Unit-1 LT P 3 1 0 Internet: Internet. relational algebra. Joins. Networking. Database system concepts and architecture. Recovery with concurrent transaction. “An Introduction To Database System”. Inheritance. java. recoverability. Checkboxes. JDBC/ODBC Bridge. Choosing an ISP. “Database Concepts”.sql package. second. Java Applet. Menus. candidate key.II Relational data Model and Language: Relational data model concepts. Unions. primary key. “An introduction to Database Systems”. Time stamping protocols for concurrency control. Cable. Gehrke. 5. String handling. John Wiley The Design and analysis of Algorithms by A V Aho et al. Exception Handling. loss less join decompositions.III Data Base Design & Normalization: Functional dependencies. deadlock handling. Graphics. aggregation. DML. mapping constraints. Split Panes. Testing of serializability. 4. update and delete operations. Galgotia Publication 6 Majumdar & Bhattacharya. “Fundamentals Of Database Systems”. Windows. Variable. Toggle buttons. notation for ER diagram. tuple and domain calculus. Labels. conflict & view serializable schedule. Pearson Education Algorithm Design by Jon Kleinberg and Eva Tardos. Fundamentals of Computer Algorithms by Horowitz and Sahani. integrity constraints: entity integrity. Radio Buttons. Inner frame. Lists.I Introduction: An overview of database management system. Palgrave Macmillan 5 Bipin C. 6. Unit. PL/SQL. Progress Bar. Pluggable Look and feel. navigating (5) . Control Statements. Layouts. relational calculus. Desai. Introduction to AWT. PHI Computer Algoritms : Introduction to Design and Analysis by Sara Baase and Allen Van Gelder. Insert.2. TMH 7 Ramakrishnan. overview of concurrency control and recovery in distrusted database. McGraw Hill 8 Bharti P.II Core Java: Introduction. Navathe. Scroll Bars. 3. Multi-version schemes. “Database Systems”. Layered Panes. normalization using FD. connectivity to remote database. E-Mail concepts. Replication and allocation techniques for distributed system. first. Satellite connection. Event handling. and JDs. Buttons. keys. Arrays. Dialog Boxes. Addision Wesley 2 Korth. Types of SQL commands. View ports. Combo box. AWT controls. Intersection. data models schema and instances. MVD. 8. Pearson Education Fundamental of Algorithms by Brassard Bratley. Advantages of SQL. data independence and data base language and interfaces. extended ER model. “Database Management System”. Scroll Panes. log based recovery. data fragmentation. Introduction to Internet services. Serializability of schedules. multiple granularity. Tables. Connecting to Internet: Telephone. Silbertz. Unit. SQL operators and their procedure.V Concurrency Control Techniques: Concurrency control. views and indexes. Minus. Queries and sub queries.K. alternative approaches to database design. Text fields. Voice and Video Conferencing. Operator. Layout managers. I/O. Unit. Pearson Education DATABASE MANAGEMENT SYSTEMS MCA 313 LT P 3 1 0 Unit. relationships of higher degree. Images. Addision Wesley 4 Paul Beynon Davies. Sending and Receiving secure E-Mail. “Database Management System”. Menus and Toolbars. Aggregate functions. BCNF. Introduction to SQL: Characteristics of SQL. reduction of an ER diagrams to tables. Unit-III Java Swing: Creating a Swing Applet and Application. locking Techniques for concurrency control. Cursors in SQL. Domain constraints.

Running Servlet. Kuhn-Tucker Conditions. Life cycle of a Servlet. Mixed Integer Linear Programming Problems. (6) The programme to be implemented using SQL 1. Chand LT P 3 1 0 DBMS LAB MCA . Multistage decision problem and its solution by Dynamic Programming with finite number of stages. Symbols and Notations. Steven Holzner. Convex Programming Problems. Charnes’ Big-M Method. Vogel’s Approximation Method. Single period inventory model with shortest cost.”Linear Programming. Poisson Queues. Holden-Day 4. Margaret Levine Young. ” Introduction to Operations Research”. stochastic models. Unit-IV Java Beans: Application Builder tools. Two Phase Method. Sensitivity Analysis. Row Minima Method. References: 1. Graphical Solutions of Linear Programming Problems. JAR files. References: 1. “Principles of Operations Research with Applications to Managerial Decisions”. Solution Techniques of TP. Queue Disciplines. Harvey M. KT-Points etc. F. Basic Feasible Solution of a TP.351 LT P 0 03 and Retrival using aggregating functions. Revised Simplex Method. QUE 6. Mark Wutica. G. 0-1 integer linear programming problem.through multiple rows retrieved from a database. Duality. The Java Beans API. Hungarian Method for AP. Debugging Servlets. Dustin R. Thread-safe Servlets. Dual Simplex Method Unit III Integer Linear Programming Problems: Integer Linear Programming Problems. Introduction to RMI (Remote Method Invocation): A simple client-server application using RMI.J. Taha. “Java Enterprise Edition”. Hiller. TMH 3. Deletion. Wagner. Transportation Problems: Introduction to Transportation Model. Callway. “The Complete Reference JAVA2”.A. Session Beans. Quadratic Programming Problems. Naughton. Role of Exponential and Poisson Distributions.group replacement-stochastic nature underlying the failure phenomenon. Hadley. “The Complete Reference Internet”. The bean developer kit(BDK). 5. TMH 2. Ltd. Entity Beans. Lieberman. Formation of Loops in TP. and Artificial Variable Method. Solution of linear programming problems as a Dynamic Programming problem Unit V Queuing Theory Introduction to Queues.. TMH 4. Economic lot sizes-price breaks. G. Swarup K etal. Application of inventory models.S. Developing a simple bean. Replacement problems-capital equipment-discounting costs-replacement in anticipation of failure. Addison Wesley 5. Matrix Form of TP. Different Methods for Obtaining Initial Basic Feasible Solutions viz. SQL for Insertion. “Programming in JAVA”. Wolfe’s Method for Quadratic Programming. Balagurusamy E. Introspection. Update . using Bound properties. Column Minima Methods. Geometrical Interpretation of KT-Conditions. Basic Elements of Queuing Models. HTTP Redirects. Definition of Steady and Transient State. Unit-V Java Servlets: Servlet basics. Markovian Process. Matrix Minima Method. Prentice Hall of India Pvt. Introduction to Java Server pages (JSP). Unit IV Introduction to NLP: Definition of NLP. Create Table. Dynamic Programming: Bellman’s Principle of optimality of Dynamic Programming.. Addison-Wesley 2. Distribution of Service Times. Applications of TP Models. “Inside Servlets”. ”Operations Research – An Introduction”. and Massachusetts”. S. Assignment Problems: Definition. H. Macmillian 3. Branch and Bound Method. Schildt. Degeneracy in TP. dreamtech COMPUTER BASED OPTIMIZATION TECHNIQUES MCA 315 Unit I Preliminaries: Inventory Models and Replacement problems: Inventory models –various costs-deterministic inventory models. Cookies. Cutting Plane Method. Distribution Of Arrivals. Servlet API basic. Memoryless Distribution. “Java2 Black book”. Introduction to Enterprise Java beans (EJB). Unit II Linear Programming Problems (LPP): Definition of LPP. Simplex Method. “Operation Research”. Erlang Distribution. Techniques for Obtaining Optimal Basic Feasible Solution.

Write programs in Java for event handling Mouse and Keyboard events. The nature of control in an organization. Using Java create Applets. Triggers. “Introduction to Information System”. Write programs to create packages and multiple threads in Java. Unit 3: Concepts of planning & control: Concept of organizational planning. for implementation. “Management Information System”. Java Programming Lab MCA-352 L T P 0 0 3 1. Union & intersection etc. Planning & Implementing changes. 3. Creating Forms. However. TMH. Students are advised to use Developer 2000 Oracle 8+ version for above experiments. and Procurement Management. End user computing. over riding and various forms of inheritance. O Brian. Writing Assertions. Developing code for understanding of distributed transaction processing. The Planning Process. MANAGEMENT INFORMATION SYSTEMS MCA 411 LT P 3 1 0 Unit 1: Foundation of Information Systems: Introduction to information system in business. “Information System for Modern Management”. 8. 3. 5. Write a program in Java for illustrating. Advanced Concepts in Information Systems: Enterprise Resource Planning. 5. Use Java Language for Client Server Interaction with stream socket connections. MIS versus Data processing. Jawadekar. Canvas. “Management Information System”. Information System for Strategic Advantage. Write Program for Join. 7. Murdick. 4. Implement of 2PL concerning central algorithm. Security & Ethical challenges. overloading. Jain Sarika. Write a program in java to read data from disk file. Computational support for planning. O Brian. MIS & Information Resources Management. 4. Supply Chain Management. 7. TMH. fundamentals of information systems. TMH 2. Using Layout Manager create different applications. Unit 4: Business applications of information technology: Internet & electronic commerce. Davis. PPM 5. Davis & Margrethe H. Types of information systems. Information System for Managerial Decision Support. “Information System”. Gordon B. Creating Views. Palgrave Macmillan (7) . Effectiveness and efficiency criteria in information system. Write Programs in PL/SQL. Frames and Menus using swing/AWT. Reports etc. MCGRAW HILL. Olson. Structure of a Management information system. 8. 6. Text Books 1. depending on the availability of Software’s students may use power builder/SQL Server/DB2 etc. MIS & Decision Support Systems. 2. 4. Extranet & Enterprise Solutions. Customer Relationship Management.2. Unit 5: Managing Information Technology: Enterprise & global management. 2. Write programs in Java to create and manipulate Text Area. Writing codes for generating read and update operator in a transaction using different situations. Scroll Bars. “ Management Information System”. Understanding the concept of Cursors. Information System for Business Operations. Solving business problems with information systems. PHI. Unit 2: An overview of Management Information Systems: Definition of a management information system. Characteristics of control process. “Information System”. Concept of an MIS. References 1. 6. Intranet. 3.

Herbert Schieldt. Credit/Debit card based EPS. Balagurusamy. Incentives for engaging in electronic commerce. Brief functioning of upper layer E-mail and their applications. Event Handling. magnetic strip card. public and private pair key encryption. Broadband telecommunication (ATM. candidate keys. Balagurusamy. E. Variables. Payment Gateway. The SET protocol.Commerce: Internet and Intranet based E-commerce. Importance of Firewall. forces behind E-Commerce. James Rumbaugh etal.Issues. TMH FOUNDAMENTALS OF E-COMMERCE MCA 413 LT P 3 1 0 Unit 1 Introduction: Electronic Commerce . Wireless Application Protocol. EDI Application in business. generalization and inheritance. SA/SD. Images. comparisons of methodologies. operations. online Banking. “Programming in JAVA”. Java Servlets. Transaction security. Advantages and Disadvantages. New Delhi. Unit V Electronic Payments: Overview. I/O. “C++ Programming Language”. specifying operations. Operator. Emerging client server. Factors to consider in Firewall design. Economic potential of electronic commerce. Mobile Information device. Architectural framework. Govt. E. TMH.Technology and Prospects. Smart card. constraints. Symmetric Encryption. Application of java. Network Access Equipments. Data types. Mobile Computing Applications. Methods & Classes. “Object Oriented Modeling and Design”. Working with window. TMH. a sample dynamic model. Input/Output exploring Java. Multithread Programming. Networking. Unit IV Encryption: Encryption techniques. Unit – V Software Development using Java: Java Beans. Unit III Web Security: Security Issues on web. 3. Pearson Education. problems and prospects. Scrabblets. Booch Grady. PHI 2. constraints.Secret key encryption. AWT Controls. Applets classes. Java Swing. credit card. (8) . Limitation of Firewalls. JDBC. Additional packages. Layout Manager and Menus. Unit – II Dynamic Modeling: Events and states. Unit – IV Java Programming: Introduction. examples and case studies to demonstrate methodologies. Impact of E-commerce on business. digital Tokens. Unit – III Functional Modeling: Data flow diagram.Commerce. links and association. “Object Oriented Programming with C++”. Java Library: String Handling. Network Infrastructure for E. a sample functional model. Text Books: 1. Digital Signatures. policies and Agenda. certificate. Image Menu: An image based menu. Network Security. components of Firewall. ISDN. References: 1. Asymmetric encryption.io. Migrating from C++ to java. Unit II Mobile Commerce: Introduction. “Object Oriented Analysis & Design with application 3/e”. multiple inheritance. E-Checks. JSD. abstract class. Addison Wesley 3. advanced dynamic modeling concepts. Graphics. aggregation. Dynamic Billboard Applet.Keys and data encryption standard.Commerce Law. Lavatron Applets. Forms of Agreement.OMT (object modeling techniques) methodologies. Triple encryption. Network Infrastructure. nested state diagrams and concurrency. WAP technology. Java Applet.MCA-412 : OBJECT ORIENTED SYSTEMS LTP 310 Unit – I Object Modeling: Objects and classes. Virtual Private Network. 2. Introduction to AWT. Definition of E. E. “The Complete Reference: Java”. Security Threats. Bjarne Stroustrup. FRAME RELAY). meta data.

Program unit. References 1. connection management. Computer Networks with Internet Protocols by W Stallings. FDDI. 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. Transmission Control Protocol. Regular Expressions .References 1. S Tanenbaum. TMH 3. Authentication protocols such as authentication based on shared key (Diffie Helleman Key exchanger). Data Communication and Networking by Forouzan TMH 6. Assignments. Introduction to multimedia and compression Techniques. Finite state Machines. Introduction to Cryptography and Network Security (DES. Physical Layer. Local and Metropolitan Area Networks by W Stallings. Firewalls). Network structure and architecture. 2.basic design issues. Simple Network Management Protocol. Internetworking with TCP/IP by PHI 5. Addison Wesley. RSA algorithms). Firewall Media. routing algorithms. Implementation of Lexical Analyzer. Data and Computer Communication by W. Communication Security (IPSec.E11 : COMPILER DESIGN L 3 T 1 P 0 Unit-1 Compiler Structure: Compilers and Translators. the OSI reference model. Parameter Transmission. sliding window protocols. 4th. The lexical and syntactic structure of a language. Loshin. Pearson education 2. P. Pass Structure of Compiler.transmission. Lexical (9) . elementary data link layer protocols. Electronic mail. Pearson Education 7. Bootstrapping of Compiler Programming Languages: High level languages. Stallings. slotted ALOHA. Ethernet transport Protocol. services. “E-Commerce the cutting edge of Business”. IPv6. “Electronic commerce”. John Vacca. Carrier Sense Multiple Access Protocols. terminal handling. (TCP) Unit-V Application Layer: Domain Name System. VIth edition. Unit-IV Transport Layer: Design issues. Ravi Kalakota. New Delhi MCA-414 : COMPUTER NETWORKS L T P 3 1 0 Unit-I Introductory Concepts: Goals and Applications of Networks. Data Structure. concept of virtual circuit and LAN. A simple approach to the design of Lexical Analyzer. IP addresses. ALOHA Protocols. File Transfer Protocol. TCP/IP protocol. CSMA with Collision Detection. Unit-II Medium access sub layer: Channel allocations. congestion control algorithms. Ethernet. Transition Diagrams. LAN protocols. IEEE standards. internetworking. Hyper Text Transfer Protocol. “Frontiers of Electronic Commerce”. switch ing methods. Internet Transport Protocol (UDP). Data Link Layer. MCA . Computer Networks & Internet with Internet Applications by Comer Pearson Education 4. Computer Networks by A. Andrew Winston. Collision free Protocols. Lexical Analysis: The role of Lexical Analyzer. error correction & detection algorithms. Edition”. Data elements. High Level Data Link Control Unit-III Network Layer: Point-to Point networks. Macmillan Press 3. Operations. networks topology. Data Environments. Various Phases of Compiler. Bajaj and Nag. Integrated services digital networks. error handling.Pure ALOHA.

Common Object Request Broker Architecture (CORBA). Surge protectors. procedure calls. DAG. PC-level processing unit. Array References in arithmetic expressions. Translation of Declaration. Unit II Components of Client/Server application: The client: services. Reliability. Serviceability. stack based memory allocation schemes. Training advantages of GUI Application. Basic blocks and flow graphs. Network protection devices. Power Protection Devices. magnetic tape. mainframe-centric client server computing. print services. McGraw Hill 5. “Principles of Compiler Design”. “Client / Server Computing”. pen. UNIX workstation. Client–Server System Hardware: Network Acquisition. Boolean expression. RAID-Disk network interface cards. Software Distribution. system administration. Peephole optimization. Sudarshan. “Fundamentals of Data Base System”. Basic Parsing Techniques: Top-Down parsers with backtracking. wide area network technologies. Narosa 2. CD-ROM. preserving mainframe applications investment through porting. Availability. Order of evaluation. Operator Precedence Parsers. available platform. References: 1. PHI 2. Data flow analyzer. remote boot services. Prentice Hall Inc. UPS. RAID. CDDI) network management. communication interface technology. mirrored disk. Ullman. Majumdar & Bhattacharya. Shift-Reduce Parsing. TMH 3. Register allocation and code selection References: 1. “Database management System”. Silberchatz.V. Unit V Client/Server System Development: Training. “Client/Server Computing”. The transformational system. Unit IV Data Storage: magnetic disk. server hardware. Single system image. Symbol Table management Error Detection and Recovery: Lexical phase errors. Client Server architecture. windows services. Unit-IV Run Time Memory Management: Static and Dynamic storage allocation. Client Server Systems Development: Services and Support. Ambiguity. The server: Detailed server functionality. FDDI. Addison Wesley (10) . TMH 4. postfix translation. case statements. RPC. Macintosh. notebooks. Predictive Parsers. Holub “Compiler Design in C”. Unit-V Code Optimization and Code Generation: Local optimization. Bottom–up Parsers.D Ullman. the network operating system. downsizing and client server computing. x-terminals. R. client server development tools. Quadruples & Triples. Syntax Directed translation mechanism and attributed definition. fax. Network management. Performance. Dynamic Data Exchange (DDE). other remote services. Ethernet. Capabilities of Lexical Analyzer Unit-II The Syntactic Specification of Programming Languages: CFG. Control flow. Utility Services & Other Services. fault tolerance. Aho. Apple. Dawna Travis Dewire. “Compiler: principle. Capabilities of CFG. 4.B. “Database Concepts”. Derivation and Parse tree. Optical disk. the network operating system. Techniques and Tools”. Korth. Cambridge press MCA-E12 : CLIENT SERVER COMPUTING L T 3 1 P 0 Unit I Client/Server Computing: DBMS concept and architecture. AW 3. available platforms. Alfred V Aho . End-user training. System Administrator training. advantages of client server computing. A. “Modern Computer Implementation in C: Basic Design”. Unit III Client/Server Network: connectivity. Elmasri. Database Administrator training. Jeffrey D. WORM.Analyzer Generator: LEX. Assignment. Navathe. LALR) Syntax Analyzer Generator: YACC Unit-III Intermediate Code Generation: Different Intermediate forms: three address code. Machine Model. Help Disk. Interposes communication. Object Linking and Embedding (OLE). Remote Systems Management Security. S. Canonical LR. Syntactic phase errors. The future of client server Computing Enabling Technologies.C. LR parsers (SLR. LAN and Network Management issues. Client-server system development: Software. request for services. Semantic errors. the server operating system. Sethi and J. Patrick Smith & Steave Guengerich. network topologies (Token Ring. Loop optimization. H. Recursive Descent Parsers.

Unit-III Public Key Encryption: Public-Key Cryptography: Principles Of Public-Key Cryptosystems. “Cryptography and Network Security”. Building a Data Warehouse. Digital Signature Standard (DSS). Navathe. The Chinese Remainder Theorem.509. Authentication Header. Unit – II DATA Warehousing. Multi Dimensional Database Structures. Springer. TMH 3. Authentication Functions. Services & Mechanisms. Data Mining. Authentication Protocol. Message Authentication Codes. Key Management. Cleanup & Transformation Tools. DES Standard. CAST-128. Unit – IV Knowledge Discovery. Distributed DBMS implementations.MCA-E13 : DATA WAREHOUSING & MINING L 3 T 1 P 0 Unit – I Dss-Uses. MD5 Message Digest Algorithm. Pearson Education 5. Electronic Mail Security. Data Extraction. Data-Mart. Reference Books: 1. Mining Multimedia Data. Unit-IV Hash Functions: Message Authentication & Hash Functions: Authentication Requirements. William Stallings. Differential & Linear Cryptanalysis. Introduction to DATA Warehousing. Placement Of Encryption Function. Classical Encryption Techniques. Selecting & Using the Right Technique. Artificial Intelligence. Hash Functions. Buchmann. S / Mime. Security Of Hash Function & MACS. Statistics. Encapsulating Security Payloads. On line Analytical Processing(OLAP). Introduction to Data-Mining. Atul Kahate. Secure Electronic Transaction (Set). Dunham. Trusted Systems. Viruses.Verlag. Genetic Algorithms. Johannes A. Fermat’s & Euler’s Theorm. Rule Introduction. Data-Mining and the World Wide Web. Key Management. Multimedia-Databases. Pretty Good Privacy (PGP). And Steganography. Proof Of Digital Signature Algorithm. Block Cipher Principles. “Data-Mining Technologies. International Data Encryption Algorithm. Unit-II Conventional Encryption Algorithms: Triples DES. Digital Signatures: Digital Signatures. New Jersey. Reporting & Query Tools & Applications. “Data-Mining. Unit-V Network & System Security: Authentication Applications: Kerberos X. Neural Networks. Dolf Zantinge. Patterns & Models. Pearson Education 6. Key Distribution. Data Warehousing Components. Security Services. Random Number Generation. Security. Concept of Data-Warehousing. Blowfish. References: 1. Primality. Techniques Tools & Trends”. Introductory & Advanced Topics”. Warehouse Database. System Security: Intruders. Decision Trees. Web DataMining. Unit – V Multimedia Data-Mining. “Fundamental of Database System”. Birthday Attacks. Mining and Meta-Data. “Introduction to cryptography”. Security: Architecture. “Cryptography and Network Security: Principles and Practice”. Bhavani Thura-is-ingham. DBMS Schemas for Decision Support. Secure Hash Algorithm (SHA). Firewall Design Principles. “Decision Support and Data Warehousing System”. Directory Authentication Service. Unit – III Business Analysis. Parallel Processors & Cluster Systems. Modern Techniques: Simplified DES. Nearest Neighbor & Clustering. Applications of Data-Mining. Techniques of Data-Mining. Block Cipher Modes Of Operation. TMH 2. Client/Server Computing Model & Data Warehousing. RSA Algorithm. Mallach. Data Visualization & Overall Perspective. Attacks. Operational Database. Mapping the Data Warehouse to a Multiprocessor Architecture. Metadata. CRC Press 4. Prentice Hall. “Data Warehousing. “Data-Mining”. Text Book: 1. RC2 Placement & Encryption Function. Conventional Encryption Model. TMH (11) . DES Strength. Web Security: Secure Socket Layer & Transport Layer Security. Combining Security Associations. 2. RCS. Berson. Pieter Adriaans. Data Visualization. Margaret H. Data-Mining & OLAP”. definition. Conventional Encryption: Classical Techniques. Block Cipher Design Principles. Pearson Education MCA-E14 : CRYPTOGRAPHY AND NETWORK SECURITY L 3 T 1 P 0 Unit-I Introduction to Cryptography: Introduction To Security: Attacks.

Chandrasekaran. NFA with epsilon transition. Derivation trees. Papadimitrou. Application of Pumping Lemma. Unit – III Context free grammar (CFG) and Context Freee Languages (CFL): Definition. (12) .L. Instantaneous Description. C. Strings and Languages. definition and representation. Introduction to recursive function theory Text Books and References: 1. Two stack PDA Unit – V Turing machines (TM): Basic model. Equivalence of Moore and Mealy Machine. Unit – IV Push Down Automata (PDA): Description and definition. Introduction to Undecidability. “Theory of Computer Science : Automata. K. Decision Properties of CFLs: Emptiness. Ambiguous to Unambiguous CFG. Martin J. Universal TM. Deterministic PDA. Pearson Education 2. Undecidable problems about TMs. Modified PCP. Acceptance by empty stack. Normal forms for CFGs: CNF and GNF. Hopcroft.P. C. “Introduction to Automata Theory. Halting problem. access primitives. Automata and Grammars. Non Regular Languages. “Introduction to Languages and Theory of Computations”. Arden Theorem. TMH 4. Examples. Church’s Thesis. Useless symbols.L. Simplified notation: State transition graph. Languages and Computation”. Language of PDA. Post correspondence problem (PCP).. TM as Computer of Integer functions. Finiteness and Memership. Unit-2 Types of Data Fragmentations. Language of DFA. Kleen’s Theorem. Security. Variants of Turing Machine. Distinguishing one string from other. Instantaneous Description. Alphabets. Equivalence of NFA and DFA. Closure properties of Regular Languages. PHI MCA-E16 : DISTRIBUTED SYSTEM Unit-1 Introduction to Distributed Data system. Minimization of Finite Automata. Applications and Limitation of FA. Nondeterministic finite Automata (NFA). Acceptance by Final state. Transaction processing Concurrency Control techniques. Algebraic laws for Regular expressions.. “Elements of the Theory of Computation”. Myhill-Nerode Theorem Unit – II Regular expression (RE) . Pumping lemma for CFLs. DFA to Regular expression. CFG to PDA and PDA to CFG. Operators of regular expression and therr precedence. Transition table. integrity constraints. FA with output: Moore and Mealy machine. Closure properties of CFLs. Language of NFA. Distributed Data base Design. Distributed Database Architecture. Definition. and Lewis. Ullman. Language acceptance by TM. Mishra and N. Recursive and recursively enumerable languages. Regular expression to FA. Simplification of CFGs. Derivation . Ambiguity in Grammer. Distribution transparency. Decision properties of Regular Languages. Fragmentation and allocation of fragments. Deterministic finite Automata (DFA)-Formal Definition. Inherent ambiguity. Languages and Computation”. C.MCA-E15 : THEORY OF AUTOMATA AND FORMAL LANGUAGES L 3 T 1 P 0 Unit – I Introduction. Equivalence of PDA and CFG. Pumping Lemma for regular Languages. PHI 3.

Examples of distributed database systems. 6. McGraw Hill. “An Introduction to Database System. RamaKrishnan . Unit-5 Management of Distributed transaction and concurrency control: Distributed Date base Administration. “Database Management System”.Unit-3 Grouping and aggregate function. Catalouge Management Authorisation. 2. Ceri & Palgathi. J. Query processing . “Database Concepts”. Silbertz. Equivalence transformation of queries. Unit-4 Evaluation. McGraw Hill (13) . Vol1 & II”. McGraw Hill. Date C. Addition Wesley. Mc Graw Hill. Query optimization. Addition Wesley. “Distributed Database System”. “Fundamentals of Data Base Systems”. Cost Analysis References: 1. J . “An Introduction to Database System” . Raghu Rama Krishnan and Johannes Gechrib. Security and protection. Join and general queries. 5. Gehke. Data C. Sudarshan . Navathe. Korth. 4. Elmasari . “Database Management Systems”. Addition Wesley 7. 3. parametric queries.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.