For the course
(M Sc(CS))

I to IV Semesters
(Choice Based Credit System –Y2K14 Scheme)

Revised w.e.f.
Academic Year 2014-15 and onwards

Page 1 of 14

Sc. 9. A student has to select a guide from the department in consultation with the chairperson of the department. Intake: 15 + supernumerary quota as per University regulations. Attendance: As per regulations of the University for P. Duration of the course : 2 years (4 semesters) 3. Eligibility: a) B. Result declaration: As per regulations of the University for P. 4. Any other issue not envisaged above shall be resolved by the Vice-Chancellor in consultation with the appropriate bodies of the University. Practicals 2 in each semester. a) Appearance for the examination: As per regulations of the University for P. c) Dissertation and viva-voce examination: The period of dissertation work is on full semester (4th semester). Payment seat fee is as per university guidelines.10 Mid-semester exam .G. 10. / BCA course).Sc.10 c) Lectures from experts in the field from R&D institutions are highly desirable.G.SCHEME OF STUDY AND SCHEDULE OF EXAMINATION 1. Scheme of examination: There shall be a University examination at the end of each semester. Page 2 of 14 . theory papers 4. Title of the course: Computer Science. Courses. 7. courses. (Computer Science) or BCA with Mathematics as one of the subject and atleast 50% aggregate marks of all optional subjects (throughout 3 years B. Miscellaneous: a) It is recommended that tutorial work be provided for all theory and practical papers.10 Seminars and Assignments . b) Internal assessment: Attendance . Scheme of study : Each semester is of 4 months duration I to III semester: Theory papers 4 . B. PCM with PG Diploma / Certificate in Computer Science of duration one year. IV semester : Project. 11.Sc. Admission: A category wise merit list will be prepared with marks obtained in all optionals in all the three years. Medium of instruction: English. 6. M. 2. Courses.G. 5. Total number of students including payment seats not to exceed – 35.Sc. Courses. b) The minimum requirement for SC / ST candidates are relaxed in accordance with University regulations. which shall be final and binding. 8.G. seminar and viva-voce. b) Provision for repeaters: As per regulations of the University for P.

SCHEME OF STUDY AND EXAMINATION FOR MASTER OF SCIENCE IN COMPUTER SCIENCE (M Sc (CS)) Semester Paper Code MSC101T Subject 70 100 4 Advanced Architecture 4 30 70 100 4 MSC105P File Structures Lab 8 30 70 100 4 Advanced DBMS Lab Soft Core – Quantitative. MSC107T Teaching and Research Aptitude Object Oriented Analysis MSC201T and Design using UML Advanced Java MSC202T Programming MSC203T Artificial Intelligence 8 30 70 100 4 3 30 70 100 2 4 30 70 100 4 4 30 70 100 4 4 30 70 100 4 MSC204T Quantitative Techniques Object Oriented Design using UML Lab Advanced Java Programming Lab Soft Core – Soft Skill and Personality Development Advanced WEB Programming Advanced Algorithms Cryptography and Network Security Open Elective 4 30 70 100 4 8 30 70 100 4 8 30 70 100 4 3 30 70 100 2 4 30 70 100 4 4 30 70 100 4 4 30 70 100 4 4 30 70 100 4 8 30 70 100 4 8 30 70 100 4 MSC401T Web Programming Lab Advanced Algorithms Lab Research Methodology 4 30 70 100 4 MSC402T Elective – 1 4 30 70 100 4 MSC403T Elective – 2 4 30 70 100 4 MSC404T Scilab Lb 4 30 70 100 4 MSC405P Main Project 16 50 150 200 8 MSC206P MSC207T MSC301T MSC302T MSC303T MSC304T MSC306P MSC307P IV Total MSC104T MSC205P III Exam Credits MSC103T MSC106P II Marks File Structures Advanced Database Management Systems Theory of Computation MSC102T I Title of the paper Hours / Week IA 4 30 4 30 70 100 4 4 30 70 100 4 Page 3 of 14 Semester 26 26 24 24 .

Reference Books: 1. Internal Sorting and Binary Searching. File Access and File Organization. 2001. Entry-Sequenced Files of Data Objects.FIRST SEMESTER MSc MSC101T: FILE STRUCTURES Total Teaching Hours: 52 No of Hours / Week : 04 UNIT – I [ 12 Hours ] Introduction: File Structures. Fundamental File Structure Concepts. Statement of the problem. “Database Management Systems”. Using Classes to Manipulate Buffers. 2nd Edition. McGraw Hill. Key sorting. Indexes that are too large to hold in Memory. Special Characters. Nomenclature. Bill Zoellick. “File Structures-An Object Oriented Approach with C++ “. Internal Structure of Index Set Blocks: A Variable-order B. Buckets. Raghu Ramakrishan and Johannes Gehrke. Fundamental File Operations: Physical Files and Logical Files. A Conceptual Toolkit. Physical devices and Logical Files. Formal Definition of B-Tree Properties. The Heart of the file structure Design. The Unix Directory Structure. The Simple Prefix B+ Tree and its maintenance. UNIT – V [ 10 Hours ] HASHING: Introduction. Retrieval Using Combinations of Secondary Keys. Extension of the Model to include Multi-way Merging. Opening Files. Fixed Field Buffers. 2003. Hashing Functions and Record Distribution. Using Inheritance for Record Buffer Classes. B-Trees. Alternative Approaches. The Content of the Index: Separators Instead of Keys. Encapsulating Record Operations in a Single Class.Tree. Index Set Block Size. UNIT – II [ 10 Hours ] Organization of Files for Performance. Clovis L. B-Trees. B+ Trees and Simple Prefix B+ Trees in Perspective. A Simple Hashing Algorithm. Indexing with Binary Search Trees. Reading and Writing. Prenctice Hall India. Index: Introduction. Reclaiming Space in files. Indexing to provide access by Multiple keys. Managing Fixed Length. UNIT – IV [ 10 Hours ] Indexed Sequential File access and Prefix B+ Trees: Indexed Sequential Access. An Object-Oriented Representation of B-Trees. Kruse. Loading a Simple Prefix B+ Trees. Greg Riccardi. Consequential Processing and The Sorting of Large Files: A Model for Implementing Consequential Processes. Deletion. Bruce P. Maintaining a Sequence Set. Extendible Hashing Performance. Input /Output in UNIX. Addison-Wesley. Buffer Management. An Object-Oriented Class for Record Files. “Data Structures and Program Design in C”. Indexing: Data Compression. A Second Look at Sorting in Memory. More about Record Structures. Multi-Level Indexing. Application of the Model to a General Ledger Program. Managing Files of Records: Field and Record Organization. 3rd Edition. File-related Header Files. Redistribution during insertion. B* Trees. Merging and Redistribution. Implementation. B-Tree Methods. Closing Files. Adding a Simple Index to the Sequence Set. A Simple Index for Entry. Folk. UNIT – III [ 10 Hours ] Multilevel indexing and B-Trees: The invention of B-Tree. Collision resolution by progressive overflow. Object-Oriented support for Indexed.Sequenced File. Example of Creating a B-Tree. 3. Worst-case Search Depth. Seeking.Tondo. Record Access. Leung. Robert L. 2. Michael J. Page 4 of 14 . Deletion. How Extendible Hashing Works. 3rd Edition. UNIX file System Commands. Merging as a Way of Sorting Large Files on Disk.

John Wiley and Sons. 2006. UNIT – II [ 10 Hours ] Context Free Grammar: Introduction to CFG. Time and Speed Complexity. Concurrency Control Techniques : Lock based Concurrency control -Optimistic Concurrency Control – Timestamp based Concurrency Control. Rajeev Motwani. Normalization. Godel Numbering. Universal TM. Non Deterministic TM. UNIT – III [ 10 Hours ] Turing Machines. CFG and Known Languages. Np-Complete Problems. Mathematical Inductions and Recursive Definitions. Pearson Education. CFG Corresponding to PDA. Enumerable and Language. Relational Model and Query Processing UNIT – II [ 10 Hours ] TRANSACTION PROCESSING AND CONCURRENCY CONTROL: Definition of Transaction and ACID properties. Recursive Language: Model of Computation and Church Turning Thesis. Reference Books: 1. Database Design: ER Modelling – ER diagrams. 2011. Normal Forms and Simplified Forms. Logic Functions and Relations. Unbounded Minimizations and µ-Recursive Functions. Definitions of Turing Machine. Cook’s Theorem. 2. Variations of TM. Finite Automata: Deterministic and Non Deterministic Finite Automata. Database Security: Security Issues – Control MeasuresPage 5 of 14 . Derivatives of Trees and Ambiguity and Unambiguous CFG and Algebraic Expressions. Tractable and Possibly Intractable Problems.A. Pushdown Automata. “Introduction to Computer Theory”. Recursive and Non Recursive Enumerable. Sudkamp. 2009. Recursive Predicates and Some Bounded Operations. Deadlocks . Thomas A. Regular and Non Regular Languages. Daniel I. Concatenations and *’s Notations and CFL. 3. Computable Functions and µ-Recursive. Unions. DPDA. Numerical Functions. 4. MSC103T: ADVANCED DATABASES Total Teaching Hours : 52 No of Hours / Week : 04 UNIT – I [ 12 Hours ] Database Concepts: Characteristics of Database Approach – Data Models – SchemasThree Schema Architecture and Data Independence. CFL and NFL: Introduction to PDA. Definition. U-Transitions. Introduction to CFL. Pearson Education. Classifications And Complexity: Primitive Recursive Functions. 3rd Edition. Conversion from NFA to DGA.Ullman.MSC102T: THEORY OF COMPUTATION Total Teaching Hours: 52 No of Hours / Week: 04 UNIT – I [ 12 Hours ] Review of Mathematical Terms and Theory: Basic Mathematical Notations and Set Theory. Language Definitions. “An Introduction to the Theory of Computer Science. 2nd Edition. UNIT – V [ 10 Hours ] Tractable And Intractable Problems: Growth Rate and Functions. 2007. UNIT – IV [ 10 Hours ] Computation Functions. Kleene’s Theorem. Measuring. Languages and Computation”. Hopcroft. 3rd Edition. Halting Problem.. TM and Language Acceptors. “Introduction to Automata Theory. John C Martin. 3rd Edition. Intersections and Complements of CFL. PDA Corresponding to CFG. “Introduction to Languages and Automata Theory”. Complexity Classes. Tata McGraw-Hill. Cohen. Reduction of Time. John E. P and Np Completeness. Jeffrey D. Decisions Problems and CFL. Languages and Machines”.

Abraham Silberschatz. “An Introduction to Database Systems”. 2. “Fundamentals of Database Systems”.type and size of operands . Overview of Parallel Processing and Pipelining Processing Necessity of high performance.Architectural development tracks . Data Warehousing Data Mining.Mobile Transaction Models -Concurrency Control -Transaction Commit Protocols.Program flow mechanism . MSC104T: ADVANCED COMPUTER ARCHITECTURE Total Teaching Hours : 52 No of Hours / Week : 04 UNIT – I [ 12 Hours ] Fundamentals of Computer design: Instruction set principles and examples. Multi-vector and SIMD computers. Henry F Korth. Pearson Education. mandatory and role based access control. S. XML and Web Databases .Swamynathan. Navathe. S. “Database System Concepts”.memory addressing. UNIT – IV [ 10 Hours ] Parallel Databases: I/O Parallelism – Inter and Intra Query Parallelism – Inter and Intra operation Parallelism – Design of Parallel Systems . Distributed-Memory Multiprocessors.Object Query Language.Discretionary. Reference Books: 1. 2008. Multi-threaded and Dataflow Tracks.Speedup performance laws Scalability analysis and approaches UNIT – III [ 10 Hours ] Processors and Memory Hierarchy: Advanced processor technology .B.Super scalar and vector processors . Principles of Scalable Performance: Performance metrics and measures .instructions for control flow. 3.Parallel Systems. Eighth Edition. Sixth Edition. Object Database conceptual Design : Difference between ODB and RDB. Fifth Edition.MultipleProcessor Tracks.classifying instruction set . Sudharshan. C.Date. 2006. PARALLEL AND DISTRIBUTED DATABASES: Concept of Object Database: Object Definition Language ODL. Architectural Classification. Text Mining. Distributed Database Concepts . Mobile Databases: Location and Handoff Management .Effect of Mobility on Data Management -Location Dependent Data Distribution .addressing modes for signal processing-operations in the instruction set.System interconnect architecture. R.Memory hierarchy technology . Program and Network properties: Conditions of parallelism . McGraw Hill. Multi-vector and SIMD Tracks.Program partitioning and scheduling . 2011.encoding an instruction set. Bus. Applications of parallel processing UNIT – II [ 10 Hours ] Parallel Computer methods: Multiprocessor and multi computers – Shared-Memory multiprocessors.Distributed Systems .Kannan.Deferred Update and Immediate Update techniques – Shadow Paging – ARIES – Database backup and recovery UNIT – III [ 10 Hours ] OBJECT ORIENTED.J. A.Distributed Data Storage – Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing. Elmasri. Database System Architectures: Centralized and Client-Server Architectures .Virtual memory technology. Evolution of parallel processors. Page 6 of 14 . Constraints of conventional architecture. Parallelism in uniprocessor system. Pearson Education/Addison Wesley. S. Spatial Databases . UNIT – V [ 10 Hours ] EMERGING DATABASE TECHNOLOGIES: Multimedia Databases . Database Recovery Techniques: Recovery Concepts. PRAM and VLSI models .

Implement pack(). John L. Pearson Education. search(). 2008. Programmability”. Message Passing program development. Morgan Kaufmann / Elsevier Publishers. Write a C++ program to read and write student objects with Variable-Length records using any suitable record structure and to read from this file a student record using RRN. Write a C++ program to implement simple index on primary key for a file of student objects. 2. Issues and solutions. Architecture of Multithreaded processors. Kai Hwang.Cache and Shared Memory: Bus System-Cache memory organizations-Shared memory organization-Sequential and weak consistency models. 7. Output the names common to both the lists.ILP software approachcompiler techniques. Distributed Memory MIMD Architectures.reducing branch costs –high performance instruction delivery. 4.hardware based speculation. Write a C++ Program to read series of names. Scalability. Reference Books: 1. 5. Write a C++ program to implement index on secondary key. for a file of student objects. Implement add(). Terence Fountain. Mapping programs onto Multicomputers. Patterson. Latency hiding techniques. and search() methods.VLIW approach.W verses S. and search() methods. Principles of multithreading. “Advanced Computer Architectures – A Design Space approach”. Write a C++ program to read two lists of names and then match the names in the two lists using sequential Match based on a single loop. 3. Tata McGraw-Hill. UNIT – IV [ 10 Hours ] Instruction level Parallelism & Data Parallel Architectures: Instruction level parallelism (ILP). “Computer architecture – A quantitative approach”. from standard input and write these names spelled in reverse order to the standard output using I/O redirection and pipes. one per line.static branch protection. Synchronization and Multiprocessing modes – Shared-Variable program structures. modify(). “Advanced Computer Architecture – Parallelism. Write a C++ program to read and write student objects with Variable-Length records using any suitable record structure. 8. the name. modify().H.W solutions . search(). 5th Edition MSC105P: FILE STRUCTURES LAB 1.limitation of ILP . unpack(). Dezso Sima. 6. unpack(). 3. Implement add().SIMD Architectures – Associative and Neural Architectures – Data-Parallel Pipelined and Systolic Architectures – Vector Architectures UNIT – V [ 10 Hours ] Multiprocessors and Thread level parallelism: Multi-threaded Architectures. Hennessey and David A. Write a C++ program to read k Lists of names and merge them using k-way merge algorithm with k = 8.over coming data hazards. delete() using the secondary index. Peter Kacsuk. delete() using the index. 2009 2. Page 7 of 14 . Repeat the exercise using an input file specified by the user instead of the standard input and using an output file specified by the user instead of the standard output.W support for more ILP at compile time. Write a C++ program to read and write student object with fixed length records and the fields delimited by “|”.H. Implement pack(). Shared Memory Architectures.

Write a C++ program to implement B+ Tree for a given set of integers and its operations insert() and search().Ratio and Proposition – Partnership –Allegation and mixture – Chain rule. Use any collision resolution techniques. The students can do the activity in a group (team) consisting of not more than 2 students. Learner's characteristics.Sources. Locking 7. Reasoning Logical Diagrams: Simple diagrammatic relationship. characteristics and basic requirements. Factors affecting teaching. Area – Volume and surface Areas – Heights and Distances – Data Interpretation: Tabulation – Bar Graphs – Pie Charts – Line Graphs.letter series – codes – Relationships – classification. multidiagrammatic relationship. Write a C++ program to reclaim the free space resulting from the deletion of records using liked list. Paper. Verbal classification.9. Quantitative and qualitative data. Data Interpretation . Research Ethics. Graphical representation and mapping of data. workshop. Preparing Applications for Execution using a front end tool 8. Write a C++ program to store and retrieve student data from file using hashing. objectives. 11. Methods of research. Application Performance Tool The students are supposed to practice and develop a mini application for above mentioned lab. Creating Databases/Table spaces 3. seminar. Recovery 6. Venn diagram. Create Objects 4. Averages – Percentage – Profit and Loss . Teaching aids.Surds and indices Permutation and Combination – Probability – Odd man out series . article. UNIT – III Simple Interest – Compound Interest – Stocks and Shares – True Discount – Banker’s discount. Steps of research. MSC106P: ADVANCED DATA BASE MANAGEMENT SYSTEMS LAB 1. conference and symposium. The examiner may ask to perform any of the above act MCA107T: QUANTITATIVE. acquisition and interpretation of data. Database Customization 2. UNIT – II Time and work – Problems on Ages – Calendar – Clock – Pipes and Cistern – Time and Distance – Problems of Train – Boats and Streams. Moving Data 5. 10. Research Aptitude: Meaning. Page 8 of 14 . Display the tree. 12. characteristics and types. The entire application to be submitted by each team should be done with all the above activities. Write a C++ program to implement B-Tree for a given set of integers and its operations insert() and search(). Thesis writing: its characteristics and format. Verbal analogies: Word analogy-Applied analogy. Evaluating and distinguishing deductive and inductive reasoning. Methods of teaching. Evaluation systems. Display the tree. Analytical Reasoning. UNIT – IV Teaching: Nature. Understanding the structure of arguments.Number series . TEACHING AND REASERCH APTITUDE UNIT – I Numbers Property – Simplification – Divisibility – HCF and LCM – Decimal Fractions – Square roots and Cube Roots – Logarithms – Antilogrithms .

use case guidelines for use case models . Factional View (models): Use case diagram . Activity state.NET/JRF/SET Teaching & Research Aptitude”.Guidelines for Creating Activity Diagrams . inheritance). New Delhi.Flexibility guidelines for class diagram: Cohesion. Control and Object flow.actors. Aggregation. S. events (signal events. 2005. representational.G.S. Unified Process. Important views & diagram to be modelled for system by UML. access specification (visibility of attributes and operations). 2012 4. Metadata.. SECOND SEMESTER M Sc MSC201T: OBJECT ORIENTED ANALYSIS AND DESIGN USING UML Total Teaching Hours : 52 No of Hours / Week : 04 UNIT – I [ 12 Hours ] Introduction: An overview . C. Vashistha. Time events) State Diagram states (composite states. Govind Prasad Singh and Rakesh Kumar. Package & interface notation. The Booch methodology. abstract classes. operations and methods. Abstraction. Refinements. Dr.Activity Diagram . “U. generalize. Messages. Object Oriented system development life cycle. 2. professional/technical and general education. Communication: Nature. Overview of Prominent OO Methodologies: The Rumbaugh OMT. Object.S. responsibilities for classes. 2010.Partition . characteristics. S. Lal. Introduction to UML. Dr. Notes in class diagram. Benefits of OO Methodology. Relationships among classes: Associations. Aggarwal. Extension mechanisms. Forms of coupling (identity.Swim Lane. ternary and reflexive association. class specialization versus aggregation. relations among objects. Derived. association classes. formal and distance education. Use Case Diagram . Jacobson's OOSE methodologies. Transition (Fork. polity and administration.using Noun phrases. include. node. Chand & Company. values and attributes. Objective Arithmetic.Elements of Activity Diagram .Action Decomposition (Rake) . transition and Page 9 of 14 . Behavior.extend. 5. R. 3. n-ary associations. R. Aggarwal. Inheritance Generalizations. Chand & Company. types. stereotypes. Bright Publications. Upkar Prakashan. subclass. New Delhi. Polity And Administration. UNIT – V Higher Education System: Governance. Activity diagram . UNIT – II [ 10 Hours ] Static structural view (Models): Classes. parallel states. Kiran Prakashan. value education: governance. constraint.Action state. Join) . K. “UGC NET/SLET: Teaching & Research Aptitude”.Comparison of approaches . Methods. notations. class Generalization.Object state and properties. concept.C.Using combination of approaches . Structure of the institutions for higher learning and research in India. Behavioral (Dynamic structural view): State diagram . UNIT – III [ 10 Hours ] Class Modeling and Design Approaches: Three approaches for identifying classes . change events. Coupling. Dependency relationships among classes. data. Merge. Adornments on Association: association names. Object diagram notations and modeling.Requirement Capture with Use case .Relationships between use cases . Quantitative Aptitude. barriers and effective classroom communication. institutions and Reference Books: 1. Dependencies.Reading Comprehension: A passage to be set with questions to be answered. History states).State Diagram Notations.Building blocks of Use Case diagram .Object basics . 2012. Text Book of Quickest Mathematics (for all Competitive Examinations). Jain. qualified association..

Exception Handling. “Object-Oriented Analysis and Design: using UML”. Java Networking .up approach for dynamic systems . TCP/IP Sockets. Implementation architecture: component diagram notations and examples. white box frame.Bottom .Networking Classes and Interfaces. Autoboxing. Reuse of frameworks. String handling UNIT – II [ 10 Hours ] JVM: Java Class file. Activations in sequence diagram . 4. Burd Thomson. Applets. Server side programming . Console Class. conditional messaging. Classes. Jackson. class visibility. “Teach Yourself UML in 24 Hours” 7. James Rumbaugh. Reference Books: 1. iterations..Java Servlets. do-activity. Ivar Jacobson. Frame works components and Patterns: Reuse of classes. Java XML library . Reuse of patterns: Architectural pattern and Design pattern. “Object oriented Modeling and Design with UML”. Thread synchronization. Comparable and Comparator. object creation and destruction. branching. Event Listener Interfaces. Garbage collection. time constraints. activations in sequence diagram. Inheritance. iterations. nodes. object synchronization. Approaches for developing dynamic systems: Top . XML Parsing . Bytes Streams. Datagrams UNIT – III [ 10 Hours ] Event Handling: Event Classes.condition. 5. Java Web Services . Floating Point Arithmetic. Serialization. Adaptor Classes. branching. time constraints. Character Streams. “Object Oriented Modeling and Design” 6. Method Invocation and Return. sub systems Hardware architecture: deployment diagram notations.Sequence diagram notations and examples. Java Sandbox security model. Packages and Interfaces. sending signals. Charles Richter. SAX. origin of links. black box framework. SOAP Web Services Page 10 of 14 . state diagram behaviour(activity effect. completion transition. Operators. Type conversion.DOM. Grady Booch. James Rumbaugh. Reuse of components. Generics.Process architecture: what are process and threads and their notations in UML. Micheal Blaha. “Designing Flexible Object Oriented systems with UML” 2. UNIT – IV [ 10 Hours ] Interaction diagrams: Sequence diagram . Java I/O: Closeable. Flushable Interfaces. JSP.Collaboration diagram Collaboration diagram notations and examples. Stax.Flexibility Guidelines for Behavioral Design .JAXP. Concurrency and Multithreaded programming. “The Unified Modeling Language User Guide”. Reuse: Libraries. The Stream classes. entry and exit activity). Pearson Education.guidelines for allocating and designing behaviors that lead to more flexible design. object migration between node . Wiley Publication MSC202T: ADVANCED JAVA PROGRAMMING Total Teaching Hours: 52 No of Hours / Week : 04 UNIT – I [ 12 Hours ] Introduction: Data Types. Annotations. James Rumbaugh. Mike O'Docherty. Linking model. “Object Oriented Analysis & Design”. UNIT – V [ 10 Hours ] Architectural view: Logical architecture: dependency. Class Loader. I/O.RESTful Web Services. invocation schemes for threads (UML notations for different types of invocations). Inner Classes. Joseph Schmuilers. Enumerations. 3. object creation and destruction. conditional messaging.down approach for dynamic systems . origin of links.

Heuristic search techniques. Predicate and arguments. UNIT-III [ 10 Hours ] Planning: block world. Fascade. mean and end analysis. Knight. E. 2. ATN. Expert system: Utilization and functionality. Santhosh. McGraw-Hill. Bill Venners. architecture of expert system. 2000. PHI. James Gosling. Vision. RTN. 2nd edition. Template Method patterns. David Holmes. Reference Books: 1. Factory. AI Applications. statistical and probabilistic reasoning. Hierarchical planning. 2002. Reference Books: 1. A* and AO* Algorithm. "Java The Complete Reference". understanding sentences. Decorator. Ken Arnold. UNIT-II [ 10 Hours ] Knowledge representation using predicate logic: predicate calculus. E." Artificial Intelligence". "The Java TM Programming Language". Herbert Schildt. Proxy. "Inside the Java 2 Virtual Machine". analysis. Nilson. Tata McGraw-Hill. Properties of internal Representation. MSC203T: ARTIFICIAL INTELLIGENCE Total Teaching Hours: 52 No of Hours / Week : 04 UNIT-I [ 12 Hours ] Introduction to Artificial Intelligence: Definition. waltz algorithm. Natural deduction. semantic net. 1992. Failure driver learning. Pearson Education. “Introduction to Artificial Intelligence and Expert Systems”. Page 11 of 14 . AbstractFactory. McDermott. knowledge representation. resolution. Minimize search procedure. 2003. Conceptual dependency. frame notation. Non linear planning with goal stacks. Addison-Wesley. strips. Perception: Action. UNIT – V [ 10 Hours ] Spring and Hibernate framework. Nils J. Texture and images.2003. Script. Command. neural net architecture and applications. ISA hierarchy. Implementation using goal stack. Tata McGraw Hill. Dan W. Knowledge representation using non monotonic logic: TMS (Truth maintenance system). Adaptor. fuzzy logic.UNIT – IV [ 10 Hours ] Java Design patterns: Singleton. 4. Constraint determination. Best first search. Charnaik and D. UNIT-IV [ 10 Hours ] Learning: Learning as induction matching algorithms. MVC . list commitment strategy. Rich and K. Narosa Publishing Co. syntactic. Frames. Spring Flow. semantic. Secondary search. “Spring and Hibernate”. “Principles of Artificial Intelligence”. two case studies on expert systems. Observer. 7th addition. 2006 3. structure knowledge representation. 3. Neural Networks: Introduction to neural networks and perception-qualitative Analysis only. UNIT-V [ 10 Hours ] Natural language processing and understanding and pragmatic. 4. Trihedral and non trihedral figures labeling." Introduction to artificial Intelligence". Hibernate Flow. representing and recognizing scenes. 2. Robot Architecture. AI representation. learning in general problem solving concept learning. Alpha beta cutoffs. waiting for Quiscence. Patterson.

2008. forward and Reverse Engineering. logical view. Traveling salesman problem and assignment problem. Rectangular games without saddle point – mixed strategy for 2 X 2 games. J K Sharma. 3.S. and Generation of documentation of the project. PERT Networks.. Hira. least cost method and Vogel’s approximation method. MSC205P: OBJECT ORIENTED DESIGN USING UML LAB 1. Page 12 of 14 . Raju. Artificial variables. S. Reference Books: 1. component view. CPM & PERT: Network representation.MSC204T: OPTIMIZATION TECHNIQUES Total Teaching Hours: 52 No of Hours / Week : 04 UNIT . Unbalanced Transportation Problem. Student has to take up another case study of his/her own interest and do the same what ever mentioned in first problem. HI-TECH.V. Multiple server models.I [ 12 Hours ] Introduction to Operations Research: Basics definition. Simplex Method. Solution. Hungarian method for optimal solution. “Operations Research Theory & Applications . Some of the ideas regarding case studies are given in reference books. models and limitations of Operations Research. single sever models. Critical Path Computations. UNIT . N. Finding Basic Feasible Solutions – Northwest corner rule. Maximum flow problem. Dynamic Programming approach for Priority Management employment smoothening. Deployment view.V [ 10 Hours ] Queuing System: Elements of Queuing model.III [ 10 Hours ] Network Models: Definition. 2007. can be referred for some idea. Write a Java program that works as a simple calculator. minimax (maximin) method of optimal strategies. Tata McGraw-Hill. Linear Programming Problem – Formulation of LPP. Matching serving model. Optimality test: the stepping stone method and MODI method. objectives. P. big-M method. Add a text field to display the result. Generalized Poission Queuing model. S. Use a grid layout to arrange buttons for the digits and for the +. ”Operations Research”. Chand & co. 2007. % operations. scope. phases. UNIT . Use case view. Gupta and D.. Database design. Minimum Spanning Tree algorithm. -. Queues: Steady-state Measure of performance. P. Pure birth and death models. 4. dominance principle.IV [ 10 Hours ] Dynamic programming: Characteristics of dynamic programming. The student should take up the case study of Unified Library application which is mentioned in the theory. Games Theory. Competitive games.*. UNIT .II [ 10 Hours ] Transportation Problem: Formulation. Shortest Route problem. 3e”. rectangular game. Solving unbalanced problem. value of the game. which were mentioned in theory syllabus. Linear Programming formulation of CPM. “Operations Research”. degeneracy and unbound solutions. saddle point. twophase method. MSC206P: ADVANCED JAVA PROGRAMMING LAB 1. Graphical solution of LPP. K. UNIT . 2002. 2. Sankara Iyer.e. Assignment Model: Formulation. Macmillan India Ltd. and Model it in different views i. specialized poission. “Operations Research”. Solution of games with saddle points. 2.

Write a Java Program to Create Thread using Interface and class. When a radio button is selected. 9. Goal Setting. Preparation Delivery. Write a Java Program to Implement Factory and AbstractFactory design pattern using java. 15. First thread displays “Good Morning” every one second.IV Written communication that includes project proposals. the light is turned on. UNIT . How to build self image?. the second thread displays “Hello” every two seconds and the third thread displays “Welcome” every three seconds. Building Self Confidence.2. Verbal Communication includes Planning. power of irresistible enthusiasm. MCA207T: SOFT SKILLS AND PERSONALITY DEVELOPMENT UNIT – I Introduction to Soft Skills and Hard Skills. The process of attitude formation. The program lets the user select one of three lights: red. Group Discussion. and only one light can be on at a time No light is on when the program starts 4. 7. Break the ice berg –FEAR. The Self Concept: Attitude. UNIT . 10. Etiquettes that include: etiquettes in social as well as office settings. Write a Java Program to execute select query using JDBC 5. telephone etiquettes. Oral Presentation skills. Importance of listening and responding. Believe in your self: Self Image and Self Esteem. Priority Management & Time Management. newsletters. Personal Planning and Success Attitude: Prioritizing. Write a Java program that creates three threads.V Page 13 of 14 . Psychometric Test. Feedback and assessment of activities like: Public speaking. Write a Java Program to Implement DOM parser. 8. Self Development . etiquettes and manners in a group. Career Planning. Write a Java Program to Implement Singleton design pattern using java.Etiquette and Manners. Positive Attitude and Self Confidence.II Meaning and definition of personality. Creating the master plan. Listening and observation skills. or green. Write a Java Program to Implement proxy design pattern using java 14. Write a Java Program to Implement Producer and Consumer problem using Threads. 11. Scriplet and Directive. body language and use of Presentation aids. Active positive visualization and Spot analysis. Write a Java Program to Implement SAX parser. Resume Building. 12. Perfect Interview. study skills that include rapid reading. articles. Self Management Techniques. Improving Personal Memory.III Motivation Skills & Personality Development. public speaking. UNIT . positive attitude. How to build a success attitude. notes taking and creativity. email etiquettes. brochures. 3. Write a JSP Program using Expression. Write a java program that simulates a traffic light.yellow. Write a Java Program to Implement Observer Design pattern method using java. 6. UNIT . Environment we mix with. Self Motivation and Communication: Levels of motivation. Write a Java Program to Implement Adapter design design pattern using java 13. Write a Java Program to Implement Helloworld program using servlets. You are the chief architecture of yourself.

2008 Cengage Learning India. Creative. Listening and Responding – Sandra D. Analytical and Decisive. Sterling Bangalore.Problem Solving and Decision Making Skills.vivagroupindia. Perceptive. RyeJaico publishing house.Collins-Cengage Learning India.001 ways to inspire your organization. Page 14 of 14 . 1. Conceptual. Reference books: 1. your team and your self – David E. 2. Profiles of great and successful personalities. Management of conflict. 5. Leadership as a process: co-ordination while working in a team. Kundu. 3. Leadership styles.JAICOBOOKS. Unleashing Leadership – John Hoover & Angelo Valenti – Jaico publishing House –WWW.COM 4.Kogan page India www.Personality development.. Motivating.l. Wallace : Personality Development 1st Edition. Leader and Team player. Succeed for your self -Richard Denny (3rd edition). negotiation. C. Role of career planning in personality development.