Professional Documents
Culture Documents
Eligibility: Recognised Bachelors degree of minimum 3 years duration in any discipline with Mathematics at least at 10+2 school level and has also qualified in the Entrance Test to be conducted by the University. OR Recognised Bachelor's Degree of minimum 3 years duration in any discipline with Mathematics as one of the subjects and has also qualified in the Entrance Test to be conducted by the University. Duration of The Programme: The programme is spread over a period of three years consisting of six semesters. The students study courses for five semesters at the University and do a Software Development Project (SDP) in the sixth semester in some reputed industry.
Number of Seats: 120 + 60 ( for Chandigarh Campus*) * These students shall commence their curriculum in Patiala Campus and shall move to Chandigarh Campus when it starts. The geographical location of 'Chandigarh Campus' is at DeraBassi on the fringe of Chandigarh.
Distribution of Seats: General- 86 SC/ST- 30 PH- 04 Total- 120 (+18 FN/NRI seats) MCA Distance Education Mode: Number of Seats: General- 43 SC/ST- 15 PH- 2 Total- 60
Semester I
Sr. No 1 2 3 4 5 Course Title Discrete Mathematical Structures Elements of Electronics Engineering Problem Solving and Programming in C Operating Systems Computer Organization and Architecture -TotalCredits 3.5 4.5 5.0 4.0 3.5 20.5
Semester II
Sr. No 1 2 3 4 5 Course Title Data Structures Fundamental Of Microprocessors and Interfacing Object Oriented Programming using C++ and Java System Analysis and Design Statistics and Combinatorics -TotalCredits 4.5 4.5 5.0 4.5 4.5 23.0
Semester III
Sr. No 1 2 3 4 5 Course Title Software Engineering Data Base Management System Design and Analysis of Algorithms Operations Research Computer Networks -TotalCredits 4.0 5.0 3.5 4.5 4.5 21.5
Semester IV
Sr. No 1 2 3 4 5 6 Course Title Advanced Java and Network Programming Computer Graphics and Multimedia ERP and Tools Elective - I Elective - II Minor Project -Total Credits 4.0 4.5 4.0 3.5 4.0 2.0 22.0
Semester V
Sr. No 1 2 3 4 5 Course Title Information and Network Security Software Project Management .Net Framework and C# Programming Elective - III Elective - IV -TotalCredits 4.0 3.5 4.0 4.0 3.5 19.0
Semester VI
Sr. No 1 Course Title System Development Project Credits 10
Elective I
Sr. No 1 2 3 4 Course Title E-Commerce Software Testing and Quality Management Object Oriented Analysis and Design Theory of Computation Credits 3.5 3.5 3.5 3.5
Elective II
Sr. No 1 Course Title Data Base Administration Credits 4.0
Document created by Sunny Kinger
Sr. No 2 3
Course Title Articial Intelligence and Applications Parallel and Distributed Computing
Elective III
Sr. No 1 2 3 Course Title Visual Programming using VC++ Image Processing and Computer Vision System Programming Credits 4.0 4.0 4.0
Elective IV
Sr. No 1 2 3 4 Course Title Data Mining and Data Warehouse Soft Computing Wireless Networks and Mobile Computing J2EE and Applications Credits 3.5 3.5 3.5 3.5
Operating Systems
Introduction: Evolution of operating system, fundamental of operating system functions, multiprogramming, multiprocessing and time sharing systems. Process Management: Processor scheduling, scheduling model, schedulers, CPU scheduling algorithms, CPU scheduling algorithm, Concurrent process - introduction, concurrency specifications, process graphs, process creation and termination, system models, introduction to conflicts due to concurrency, simple examples to illustrate the problem. Critical section problem, Pipes, FIFO, Message queue, semaphores, shared memory, classical process co-ordination problem, Deadlock - introduction, analysis of conditions, prevention & avoidance, Detection & recovery, deadlocks: practices today. Memory Management: Contiguous memory allocation, address bindings, overlays, fixed partitioning vs. variable partitioning, paged memory, virtual memory: Demand paging and Segmentation. File Management: File concepts, access methods, directory structure, file protection, file system structure, allocation methods, Secondary storage management - disk structure, disk scheduling, disk management, swap-space management, disk reliability. Input/Output: Device controllers and device drivers, disks, other devices. Example Systems: MS Windows, Unix/Linux. Laboratory Work: Implementation of CPU scheduling algorithms, process management, memory management and file management functions of Linux/Unix operating systems. Text Books 1. Galvin and Silverscatz, Operating systems concept, Addison Wesley (1998). 2. Gary Nutts, Operating Systems- A Modern Perspective, Pearson Education (2003) Reference Books 1. Dhamdhere,Operating Systems - A Concept-Based Approach, Tata McGraw Hill (2003)
Data Structures
Introduction: Algorithm complexity and Big O notation, recursion and its importance,Tower of Hanoi problem. Stacks: Concept, operations and representation in C, application to evaluation of postfix expressions, conversion from infix to postfix representation. Queues: Sequential representation, operations, priority queues, and array implementation. Linked Lists: Concept, operations, stacks and queues as lists, array and dynamic representation circular lists, doubly linked lists, Josephus problem. Trees: definition, array and dynamic representations, operations, lists as trees, almost complete binary trees, threaded binary trees, AVL trees. Sorting: Efficiency considerations, O notation, Bubble sort, Quicksort, Selection sort, binary tree sort Heap, heapsort, heap as a priority queue , Insertion sort, Shell sort, Merge sort, Radix sort. Graphs: Directed graphs, undirected graphs, DFS,BFS Searching: Sequential searching, indexed Sequential searching, binary search, interpolation search, binary tree searching, insertion and deletion, Optimum search trees, height balanced trees, single and double rotations, Multiway, search trees, B-trees, B+trees, Hashing methods of resolving clashes, methods of choosing hash functions. Laboratory Work: Implementation of Stacks, Queues, Linked Lists, Trees, Graphs, Sorting and Searching algorithms. Text Books 1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Addison Wesley (2006). 2. Kruse, Data Structures and Program design, Prentice Hall of India (1991). Reference Books 1. 2. 3. Aho Alfred V., Ullman Jeffrey D., and Hopcroft John E., Data Structures and Algorithms, Addison Wesley (2003). Tenenbaum A M., Data Structures Using C, Prentice Hall of India (1991). Seymour lipschutz,Theory and problems of data structures, Tata McGraw Hill (2002).
Document created by Sunny Kinger
Programs based on various addressing modes, Data Transfer techniques. Testing all Arithmetic and Logical Instructions and their affect on various flags. (Using various data Types). 4. Programs on Branch and Loop, String Instructions. 5. Programs of Sorting, Sum Of natural Numbers, Multiplication, Division, Factorial, etc. 6. Programs using built-in Software Routines. 7. Interfacing experiments like programs to introduce delays, to generate square & rectangular waves at different frequencies, 8. Familiarity with Assembler. Text Books Gaonkar R. S., The 8085 Microprocessor Architecture, Programming and Interfacing, Penram International (2002). 2. YU-Cheng Liu and Glenn A. Gibson, Microprocessor Systems: The 8086/8088 Family Architecture, Programming and Design, Prentice Hall of India (2004). Reference Books 1. 2. 3. Hall, D. V., Microprocessor Interfacing, Programming and Hardware, Tata Mc Graw Hill (2006). Barry B. Brey, The Intel Microprocessors 8086 Family, Prentice Hall Of India (1994). John Uffenbeck, The 8086/8088 Family Design, Programming and Interfacing, Prentice Hall of India (1999). 1.
2. 3.
Balaguruswamy, E., Objected Oriented Programming with C++, Tata McGraw Hill (2001). 2. Gary Cornell and Cay S. Horstmann, Core Java Vol I and Vol II, Sun Microsystems Press (1999). Reference Books 1. 2. Deitel and Deitel, C++ How to Program, Pearson Education (2003). Deital and Deital, Java How to Program, Prentice Hall (2007).
1.
Laboratory work: The laboratory work will be based upon the major assignment based upon the various case study like Inventory control, Hospital management, Library management, Railway/ airline reservation, Banking system, Loan management etc.. Text Books Senn, James A., Analysis and Design of Information Systems, Tata McGraw Hill (1989). 2. Rumbaugh James, Jacobson Ivar, and Booch Grady, Unified Modeling Language Reference Manual, Addison-Wesley Object Technology Series (2004). Reference Books 1. 2. Jeffrey A. Hoffer, Joey F. George, and Joseph S. Valacich, Modern Systems Analysis and Design, Pearson Education (2004). Whitten, Bentley and Barlow, System Analysis and Design Methods, Tata McGraw Hill (2004). 1.
1.
Software Engineering
A Generic view of Software Engineering: Process Models, Software Requirements, Fundamentals, Requirements Process, Requirements Elicitation, Requirements Analysis, Requirements Specification, Requirements Validation, Practical Considerations. Software Design: Software Design Fundamentals, Key Issues in Software Design, Software Structure and Architecture, Software Design Quality Analysis and Evaluation, Software Design Notations, Software Design Strategies and Methods. Software Construction and Maintenance: Software Construction Fundamentals, Minimizing Complexity, Anticipating Change, Constructing for Verification, Standards in construction, Managing Construction: Construction Models, Construction Planning, Construction Measurement, Practical Considerations: Construction Design, Construction Testing, Reuse, Construction Quality, Integration Software Maintenance Fundamentals, Key Issues, Maintenance Process, Techniques for Software Maintenance. Software Configuration Management: SCM Process, Organizational Context for SCM, Constraints and Guidance for SCM Process, Planning for SCM, Software Configuration Identification, Identifying Items to be controlled, Software Configuration Control, Software Configuration Status Accounting, Software Configuration Auditing, Software Release Management and Delivery Software Testing: Fundamentals, Levels of Testing, Testing Techniques, Testing Strategies. Software Engineering Tools and Methods: Software Requirements Tools, Software Design Tools, Software Construction Tools, Software Maintenance Tools, Software Configuration Management Tools, Software Engineering Process Tools, CASE Environments, Miscellaneous Tools. Laboratory work: Study of Rational Rose software including UML diagrams like class diagram, State diagram, Activity diagram, Competent diagram, Use case diagram. Text Books A Guide to the Software Engineering Body of Knowledge (SWEBOK), IEEE Computer Society, (http://www.nt.fh-koeln.de/fachgebiete/inf/nissen/softeng/ swebok.pdf) (2004) 2. Pressman Roger S and Roger Pressman, Software Engineering: A Practitioner's Approach, McGraw Hill International Edition (2004). Reference Books 1. 2. 3. Peters James F. and Witold Pedrycz, Software Engineering - An Engineering Approach, John Wiley (2001). Sommerville Ian, Software Engineering, Pearson Education (2006). Jalote Pankaj, An Integrated Approach to Software Engineering, Narosa Publishing House (2005). 1.
concurrency control & recovery in distributed databases, Concepts of Object Relational Data Base Management Systems. Laboratory Work: Laboratory work will be based on Data Definition queries, Data Manipulation and control queries in SQL, Views, Synonyms, Indexing, Sequences, Introduction to PL/SQL, Cursors and Triggers, Procedures/Functions, Package, Exception Handling. Text Books Elmasri R, Navathe S. B., Fundamentals of Database Systems, Pearson Education (2006). 2. Korth H.F., Silbertz, S. Sudarshan A., Database Concepts, McGraw-Hill (2005). 3. Date, C.J., An Introduction to Database Systems, Narosa Publishing House (2006). . Reference Books 1. 2. Hector Garcia-Molina, Ullman, J. D. and Widom, J. D.., Database Systems: The Complete Book, Pearson Publications (2002). Desai, Bipin.C, An Introduction to Database Concepts, Galgotia Publication (2002). 1.
Operations Research
Definition of Optimization: Meaning of Operations Research, Modeling in operation research, principles of modeling, Introduction to linear and non-linear programming problems and formulation. Linear Programming: Characteristics, Assumptions and Applications, Graphical solutions of two variables LP Problem, Linear programming in standard form, Solution of LP by Simplex and revised Simplex methods, Special cases of LP, Duality and dual Simple method, Sensitivity analysis of LP problems. Network Models: Transportation problem, Transshipment problem, Assignment problem, Traveling-salesman problem, Shortest route problem, Minimal spanning tree problem, Maximum flow problem, Project Management(CPM and PERT). Dynamic Programming and their applications. Non-linear Programming: Characteristics, Concepts of convexity, maxima and minima of functions of n variables using Lagrange multipliers and Kuhn-Tukker conditions, One dimensional search methods, Fibonacci and golden section method, Optimization using gradient methods for unconstrained problems. Lab work: Introduction to some optimization software, implementation of graphical, simplex, revised simplex methods, implementation of assignment and transportation problems, programs for queuing models, implementation of CPM and PERT. Text Books Taha H.A., Operations Research: An introduction, Prentice Hall of India (2004) Billy E. Gillett, Introduction to Operations Research: A Computer Oriented Algorithmic Approach, McGraw Hill (1979). Reference Books 1. 2. 3. Ronald R Rardin, Optimization in Operations Research, First Edition, Pearson Education (2002) Pant J. C., Introduction to Optimization, Jain Brothers (1998). Kasana H. S., Introduction to operation Research, Springer-Verlag (2005) 1. 2.
Computer Networks
Introduction to Computer Networks: Advantages of networks, point-to-point and multidrop circuits, data flow and physical circuits, network topologies, topologies and design goals. Hierarchical topology, horizontal topology (Bus), star topology, ring topology, mesh topology. Protocol hierarchy, Design issue for the layers, connection- oriented and connectionless services, service primitives, OSI reference model, TCP/IP reference model, comparison of OSI and TCP/IP reference model. Type of networks, standard organizations, Analog and digital signals, data rate limits, digital and analog transmission, transmission media, Frequency division multiplexing, Wavelength division multiplexing, Time division multiplexing, circuit switching, packet switching, message switching. Network devices. Data Link layer: Services provided to the network layer, framing, error control, Flow control, Error correcting codes, Error detecting codes, Sliding Windows protocols: one bit sliding window protocol, protocol using go back n, protocol using selective repeat, HDLC, PPP, Channel allocation problem, Multiple access protocols, Ethernet. Network Layer: Network layer design issues, routing algorithms: shortest path algorithm, flooding, distance vector routing, link state routing, hierarchical routing, broadcast routing, multicast routing, congestion control algorithms, Internetworking, IP protocol, IP addressing, subneting, superneting, ARP, RARP, BOOTP, DHCP, ICMP, OSPF, BGP, Internet multicasting, Mobile IP, Ipv6. Transport layer: Services provided to the upper layer, Addressing, UDP, TCP, Connection establishment, connection release, Flow control and buffering, multiplexing, TCP congestion control, TCP timer management. Application layer: Domain name system, E-mail, File transfer protocol, HTTP, HTTPS, World wide web. Laboratory work: The lab work will be based on network installation using Windows server and Linux server, implementation of the different application layer protocols on these server, configuration of network devices like switches, routers and implementation of the protocols on these devices. Simulation of different LAN protocols etc. Text Books Forouzan B. A., Data communications and networking, Fourth Edition, Tata McGraw Hill (2006) 2. Tannenbaum A.S., Computer Networks, Fourth Edition, Pearson Education (2004) Reference Books
Document created by Sunny Kinger
1.
1. 2.
Stalling, W., Data and Computer Communication, Seventh Edition, Pearson Education (2003) Antonako J.L., Mansfield K.C., An Introduction to Computer Networks, Pearson Education (2002).
algorithm ,curve generation using midpoint algorithm ,flood fill ,boundary fill, scan line polygon fill algorithms, transformation techniques (2D ,3D):translation, rotation, scaling, reflection, orthographic ,oblique projections ,Line clipping ,polygon clipping, Bezier curves, piecewise Bezier curves with zero order continuity, Bezier surface, sphere and ellipsoid generation using parametric equations,Animation using multimedia softwares(like flash) Text Books Hearn D and Baker P., Computer Graphics, Pearson Education (1997). Rogers D. and Adams J., Mathematical Elements for Computer Graphics, Internatiional Student Edition (2002) Reference Books 1. 2. Plastock R. and . Kalley G, Theory and Problems of Computer Graphics, Tata McGraw-Hill (1986). Foley J., A. van Dam, Feiner, S. and Hughes J., Computer Graphics: Principles and Practice, Pearson Education (2002). 1. 2.
1.
William Stallings, Network Security Essentials, Applications and Standards, Pearson Education (2008) Reference Books 1. 2. Stallings W., Cryptography and Network Security Principles and practice, Pearson Education (2003). Michael. E. Whitman and Herbert J. Mattord Principles of Information Security, Course Technology (2004).
2.
Reference Books 1. Claudia M. Baca, Patti, PMP: Project Management Professional Workbook, Sybex, Workbook (2003).
1.
E-Commerce
Concepts, Dimensions and Performance of E-Commerce: History, Scope, Opportunities, Benefits, Impact of E-Commerce. Classification of E-Commerce, Challenges and solutions for developing countries. E-Strategy: Developing E-commerce Strategy, use of Internet in E-Commerce Market Research, finding the buyers, Role of Communications in the E-Commerce. Organizational Structure of E-Commerce. Legal and Ethical Issues: E-Commerce Legal Framework, Rights and Obligations in the world of E-Commerce: Copyrights, Defamation, Privacy, Contracts, And Taxation on the Internet, Domain Name and Registration, Contract Signing. Customer Effective Web Design: Websites designing and Performance, Internet Advertising, Corporate Website, Essential elements of a well-designed website, creating a website, Business Protection. Sale Price and Online Payment: Real world payment system, credit card transactions: risk management and international issues, Electronic Funds Transfer and Automated Clearing House, Micro Payment, Financial costs and payment modes of E-Commerce, Epayment System.. E-Security: Security Design, Analysis Risk, E-Banks and Security, safety and privacy of Internet Transactions. Online Shopping, Firewalls for security. Introduction to Mobile Commerce: Mobile Commerce: Challenges of E-Commerce, Global Mobile Commerce, Security of Mobile Commerce. Introduction to E-Business: Moving from E-Commerce to E-Business, E-Business Design issues, E-Business Communities, Role of E-commerce in Indian Business context. Text Books 1. Mahmoudi Maymand M., E-Commerce, Deep and Deep Publications (2005). 2. Joseph P.I. , E-Commerce: An Indian Perspective, PHI. (2007). Reference Books 1. Kalakota Ravi, Robinson Martia, E-Business Roadmap For Success, (2001)
Document created by Sunny Kinger
2.
Reynolds Janice, The Complete E-Commerece Book Design Built and Maintain, Janice Publications (2004).
Improvements, Acceptance Decisions, Rework, Completed Checklist, Process Adjustments. Text Books 1. Mahmoudi Maymand M., E-Commerce, Deep and Deep Publications (2005). 2. Joseph P.I. , E-Commerce: An Indian Perspective, PHI. (2007). Reference Books 1. 2. Kalakota Ravi, Robinson Martia, E-Business Roadmap For Success, (2001) Reynolds Janice, The Complete E-Commerece Book Design Built and Maintain, Janice Publications (2004).
Theory Of Computation
Recursive Languages: Recursive Definition, Alphabets, Language, Regular Expression, definitions of Finite State Machine, Transition Graphs, Deterministic & Non-deterministic Finite State Machines, Regular Grammar, Left-Linear and Right Linear, Thomsons Construction to Convert Regular Expression to NDFA & Subset Algorithm to convert NDFA to DFA. Minimization of DFA, Finite State Machine with output (Moore machine and Melay Machine), Conversion of Moore machine to Melay Machine & Vice-Versa. Properties of Regular languages: Conversion of DFA to Regular Expression, Pumping Lemma, Properties and Limitations of Finite state machine, Decision Properties of Regular Languages, Application of Finite Automata. Context Free Grammar and PDA: Context Free Grammar, Writing Context free Grammar for Problems, Derivation tree and Ambiguity, Application of Context free Grammars, Chomsky and Greibach Normal form, Conversion of CFG to CNF and GNF. Properties of context free grammar, CYK Algorithm, Decidable properties of Context free Grammar, Pumping Lemma for Context free grammar, Push down Stack Machine, Design of Deterministic and Non-deterministic Push-down stack, Parser Design. Turing Machine: Turing machine definition and design of Turing Machine, Church-Turing Thesis, Variations of Turing Machines, Combining Turing machine, Universal Turing Machine, Post Machine, Chomsky Hierarchy. Incommutability: Halting Problem, Turing Enumerability, Turing Acceptability and Turing Decidabilities. Unsolvable problems about Turing machines. Computation Complexity: P, NP and NP Complete Problems. Text Books Daniel A. Cohen, Introduction to Computer Theory, John Wiley and Sons (1996) Hopcroft John E., Ullman Jeffrey D. and Motwani R., Introduction to Automata Theory, Languages and Computation, Pearson Education (2006). Reference Books 1. 2. Michael Sipser, Introduction to the Theory of Computation, Thomson (2007) Lewis Harry R., Elements of Theory of Computation, PHI (1997) 1. 2.
down, Create incremental backups, Automate database backups, Monitor the flash recovery area, Database Recovery: Recover from loss of a control file, Recover from loss of a redo log file, Recover from loss of a data file. Laboratory Work: Laboratory work will be based on Oracle Installation, managing oracle Instance/ Database, database Storage structure, Schema Objects, and Oracle Net Services. Also practicals will be undertaken on user administration, security, SQL and utilities, Proactive Database and implementation of database recovery. Text Books John Watson (OCP) and Damir Bersinic, Oracle 10g Database OCP Certification All-in-One Exam Guide, Tata McGraw Hill (2005). 2. Kevin Loney, Oracle Database 10g DBA Handbook, McGraw-Hill (2004). 3. Sam Alapati, OCP Oracle Database 10g: New Features for Administrators Exam Guide, Oracle Press (2004) Reference Books 1. 2. Gavin Powell, Carol McCullough-Dieter, Oracle 10g Database Administrator: Implementation and Administration, Thomson Course Technology (2006). Doug Stun ,Tim Buterbaugh and Bob Bryla, Oracle 10g Administration, BPB Publication (2005). 1.
Umbaugh S. E, Computer Vision and Image Processing: A Practical Approach Using CVIPtools, Prentice Hall (1998) Reference Books 1. 2. Gonzalez R. C., and Woods R. E., Digital Image Processing using MATLAB, Pearson Education (2004) Pratt W.K., Digital Image Processing, John Wiley (1991).
2.
System Programming
Introduction to System Software: Machine Structure, evolution of operating system, machine language. Assembler: Elements of Assembly Language Programming, General design procedure, design of a Two Pass Assemblers, A Single Pass Assemblers Design. Table Processing: Searching & Sorting. Macro and Macro Processors: Macro instructions, Features of a macro Facility: macro Instruction arguments, Conditional macro expansion, Macro calls within macros, Macro instruction defining macros, Advanced Macro Facilities, Implementation of simple macro processor, Two-pass algorithm, Implementation of macro calls within macros, Implementation within an assembler. Loaders: Loader scheme, absolute loaders, Subroutine linkages, Relocating loaders, Direct linking loaders, binders, linking loaders, overlays, Dynamic Binders, Design of an Absolute Loader, Design of a Direct-Linking Loader. Compilers: Phases of Compiler Construction, Symbol Table, Top-down and bottom-up Parsing, Operator-Precedence Parsing, LR Parsers, Code Generation and Code Optimization, Memory management, Design & other issues. Laboratory Work: Lab work will be based on the development of system software like assembler, Lexical Analyzer, Parser, macro processor, binder, linker, loader. Text Books Donavan J., System Programming, Tata McGraw Hill (1993) Dhamdhere D. M., System Programming and Operating System, Tata McGraw Hill (2007). Reference Books 1. 2. Beck L., System Software, Addison Wesley Publication (1996). Aho A. V., Ullman J. D., Sethi R., Compilers Principles, Techniques and Tools, Pearson Education (2005). 1. 2.
Soft Computing
Neural Networks: History, overview of biological Neuro-system, Mathematical Models of Neurons, ANN architecture, Learning rules, Learning Paradigms-Supervised, Unsupervised and reinforcement Learning, ANN training algorithms-perceptions, Training rules, Delta, Back Propagation Algorithm, Multilayer Perceptron Model, Hopfield Networks, Associative Memories, Applications of Artificial Neural Networks to different problems Fuzzy Logic: Overview of Classical Sets introduction to Fuzzy Logic, Classical and Fuzzy Sets:, Membership Function, Fuzzy rule generation. Operations on Fuzzy Sets: Compliment, Intersections, Unions, Combinations of Operations, aggregation Operations. Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals & Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations. Introduction of Neuro-Fuzzy Systems, Architecture of Neuro Fuzzy Networks. Applications of Fuzzy Logic: Medicine, Economics etc. Genetic Algorithm: An Overview of GA, GA operators, GA in problem solving, implementation of GA. Laboratory Work: Design and implementation of neural networks, genetic algorithms in various search problems. Text Books 1. Anderson J. A., An Introduction to Neweal Networks, PHI (2005) 2. Min Fu Li, Neural networks in Computer intelligence, Tata McGraw Hill 2003 Reference Books 1. 2. G.J. Klir and B. Ynan, Fuzzy Sets and Fuzzy Logic, PHI (1997). Raj-asekaran, G.A. vijaylakshmi Pai, Neural Network, Fuzzy Logic and Genetic algorithms- Symthesis and Application, PHI (2001).
1.
Austin and Pawlan, Advanced Programming for JAVA 2 Platform, Pearson Education (2004)