computer science - mewar university

MEWAR UNIVERSITY CHITTORGARH (RAJASTHAN)

Faculty of Engineering and Technology

Course Scheme and Syllabus

of

Master of Technology (Part-time) Computer Science and Engineering

MEWAR UNIVERSITY CHITTORGARH (RAJASTHAN)

Faculty of Engineering and Technology

Three – Year (Part-time) M Tech: Computer Science and Engineering

Eligibility for Admission: A candidate for being eligible for admission to the Master of Technology in Computer Science and Engineering in the faculty of engineering and technology should have passed B.Sc. (Engg.)/ B.Tech/ B.E. / MCA or any other equivalent degree in the relevant discipline / branch from any recognized Indian or foreign University. A candidate should have at least 55% marks or equivalent CGPA in the qualifying examination (50% marks or equivalent CGPA for Scheduled Caste/Scheduled Tribes Candidates) on the basis of which the admission is being sought. Overview of the Programme: The normal duration of programme shall be Six Semesters for part-time students. A part time candidate shall mean a person employed in any government/ semi-government/ private organisation. The duration of the programme is extendable upto five years. However, in exceptional circumstances one-year extension may be granted with approval of the Vice-Chancellor of the University. The complete programme comprises of 13 theory courses (09 Core and 04 elective) and 02 Lab courses followed by the dissertation in two phases. Student has to obtain at least D Grade to pass the examination (both internal and external examination separately) for all the courses specified in the scheme of the programme. The degree will be awarded on the basis of cumulative marks obtained in all the six semesters and the division obtained will be as under:

MEWAR UNIVERSITY CHITTORGARH (RAJASTHAN) Scheme of Three – Year (Part-time) M Tech: Computer Science and Engineering

First Semester

Course Code Course Title

Contact Hours per week

Credit Hours

Internal Assessment/Examination

External Examination /Viva-voce

Total Marks

L P Assignments/Lab Record

Teacher’s Evaluation

CSE-611 Advanced Data Structures and Algorithms 4 - 4 30 10 60 100

CSE-613 Topics in Computer Networks 4 - 4 30 10 60 100

CSE-711/713/715 Elective-I 3 - 3 20 10 45 75

CSE-617 Advanced Data Structures and Algorithms Lab - 2 2 15 10 25 50

Total Semester Credits = 13 Total Semester Marks = 325 Second Semester



Credit Hours



Total Marks



CSE-612 Advanced Software Engineering 4 - 4 30 10 60 100

CSE-614 Advanced Database Systems 4 - 4 30 10 60 100

CSE-712/714/716 Elective-II 3 - 3 20 10 45 75

CSE-618 Advanced Database Systems lab - 2 2 15 10 25 50

Total Semester Credits = 13 Total Semester Marks = 325

Third Semester



Credit Hours



Total Marks



CSE-615 Advanced Computer Architecture 4 - 4 30 10 60 100

CSE-621 Distributed Computing System 4 - 4 30 10 60 100

CSE-721/723/725 Elective-III 3 - 3 20 10 45 75

Total Semester Credits = 11 Total Semester Marks = 275 Fourth Semester



Credit Hours


External

Examination /Viva-voce

Total Marks

L P Assignments Teacher’s Evaluation

CSE-616 Software Architecture 4 - 4 30 10 60 100

CSE-624 Mobile Computing 4 - 4 30 10 60 100 CSE-722/724/726 Elective-IV 3 - 3 20 10 45 75


Fifth Semester



Credit Hours

Internal Assessment/Examination External

Examination /Viva-voce

Total Marks

L P Assignments/ Report

Teacher/ Committee Evaluation

CSE-627 Research Methodology 2 - 2 15 05 30 50

CSE-629 Dissertation (Phase-I) - 4 4 50 50 - 100

Total Semester Credits = 06 Total Semester Marks = 150 Sixth Semester



Credit Hours



Total Marks

L P Report Teacher(s) Evaluation

CSE-630 Dissertation (Phase-II) - 12 12 50 - 250 300


LIST OF ELECTIVES

ELECTIVE – I ELECTIVE – II

1. CSE-711 Security in Computing 1. CSE-712 Mobile adhoc and wireless sensor Networks

2. CSE-713 Natural language Processing 2. CSE-714 Bioinformatics

3. CSE-715 Neural Networks and fuzzy logic 3. CSE-716 Embedded System

ELECTIVE – III ELECTIVE – IV

1. CSE-721 Parallel Computing 1. CSE-722 Software Project Management

2. CSE-723 Advanced Compilers 2. CSE-724 Soft Computing

3. CSE-725 Data Mining and Data Warehousing 3. CSE-726 Image Processing

Internal Assessment/Examination: The internal evaluation for all theory courses (40% of the total marks) will be based on the evaluation of three assignments provided during the semester and assessment of the teacher concerned. Similarly, the internal evaluation for all Lab courses (50% of the total marks) will be based on the evaluation of lab record and assessment of the teacher concerned. External Examination/Viva -voce: For all the theory courses, there will be 08 (Eight) questions to be set by the external paper setter (nominated /approved by the competent authority) out of which the candidate will have to attempt 05 (Five) questions all carrying equal marks. Duration of each external examination will be three hours. Similarly, the external evaluation for all Lab courses (50% of the total marks) will be based on the evaluation/viva-voce conducted by an external examiner (from the relevant field) nominated/approved by the competent authority. Submission and Evaluation of Dissertation: a) A dissertation supervisor (s) having at least post- graduate qualification, from industry/research organization shall be

assigned to the student approved by the competent authority. In no case, the candidate can have more than two dissertation supervisors.

b) Dissertation work (Phase-I) in 5th semester shall comprise of literature survey, problem formulation, finalization of goals to be achieved, outlines of the methodology to be used for achieving the targeted goals and final decision about S/W, H/W tools to be used for dissertation work in 6th semester. The entire work will be documented in the form of report.

c) Internal assessment of dissertation (Phase-I) in 5th semester will be made by the committee evaluating the report (50% weightage), oral presentation and response of the student in the discussion / presentation (50% weightage). The dissertation supervisor (s) shall be the member (s) of the committee.

d) The submission of dissertation (Phase-II) in 6th semester shall be allowed only after ensuring that the research work carried out by the candidate has attained the level of satisfaction of the ‘Dissertation Supervisor (s)’ and proof of communication/acceptance of the research paper (if any, and certified in the report) in the relevant refereed journal/ conference.

e) The final dissertation external examination in 6th semester shall be taken by a panel of examiners comprising of concerned Supervisor (s), one external examiner (from the relevant field) nominated/approved by the competent authority. Hard copies of dissertation, one for each supervisor (s), examiner and the university/ department, are required to be submitted by the student before the final dissertation external examination. The candidate shall appear before the examining committee for oral examination and presentation on the scheduled date.

M TECH: COMPUTER SCIENCE AND ENGINEERING

CSE-611 ADVANCED DATA STRUCTURES AND ALGORITHMS

Internal Assessment/Evaluation: 40 Marks External Examination: 60 Marks Duration of Examination: 03 Hours

Elementary data structures, Complexity of Algorithms: worst case, average case and amortized complexity, Analyzing Algorithms, Designing Algorithms, Growth of Functions, recurrences, probabilistic analysis and randomized algorithms, heap sort, quick sort, sorting in linear time, median and order statistics, binary search trees, AVL trees, red black trees, splay trees, skip lists, b-trees, binomial heaps, Fibonacci heaps Minimum spanning tree, single source shortest paths, all pair shortest paths, advanced sorting methods and their analysis, String Matching: string-matching algorithm, Rabin-Karp algorithm, String matching with automata, Knuth-Morris-Pratt algorithm, Boyer-Moore algorithm, algebraic simplifications & transformations: NP- hard& NP-complete problems. Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions.

Recommended Books:

V .Aho, J. E. Hopcroft, and J.D.Ullman, Data Structures and Algorithms Addison Wesley, Reading Massachusetts,USA,1983.

T.H.Cormen, C.E.Leiserson, and R.L.Rivest, introduction to algorithms, the MIT press, Cambridge, Massachuetts, USA1990.

E Horowitz and S. Sahni, Fundamentals of Data Structures, Galgotia, 1999 R.B. Patel, Expert Data Structures in C, Khanna Publishers, 2001. R.L. Kruse, Data Structures & Program Design in C, PHI. D.F. Knuth, The art of Computer Programming Vol 1, Narosa Publications, 1985. Byron S. Gottfried, Theory and Problems of Programming with C Language, Schaum Series, TMH, 1998. Cormen, Leiserson and Rivest, Introduction to Algorithms, 2/e, PHI. Horowitz, Ellis and Sahni, Sartaj, Fundamentals of Computer Algorithms, Galgotia Publications. Aho, Hopcroft, and Ullman, the Design and Analysis of Computer Algorithms, Addison Wesley.


CSE-613 TOPICS IN COMPUTER NETWORKS

Internal Assessment/Evaluation: 40 Marks External Examination: 60 Marks Duration of Examination: 03 Hours High-Speed LANs: The Emergence of High-Speed LANs; Bridged and Switched Ethernet; Fast Ethernet; Gigabit Ethernet; Wireless LANs: IEEE 802.11, Bluetooth; Connecting LANs: Devices, Backbone networks, Virtual LANs Packet Switching Networks; Frame Relay Networks; Asynchronous Transfer Mode (ATM); ATM protocol Architecture; ATM logical connections; ATM cells; ATM Service categories; ATM Adaptation Layer Format and Encapsulation in IP; IP Services; Header format and addressing; Fragmentation and reassembly; classless and subnet address extensions; subnetting and supernetting; CIDR; IPv6; Congestion Control and Quality of Service: Data traffic; Network performance; Effects of Congestion; Congestion Control; Congestion control in TCP and Frame Relay; Link-Level Flow and Error Control; TCP flow control; IP Multicasting, Multicast routing protocols, address assignments, session discovery etc, IP sec protected channel service, virtual private network service, MPLS VPN Quality of Service: Flow Characteristics, Flow Classes; Techniques to improve QoS; Traffic Engineering; Integrated Services; Differentiated Services; QoS in Frame Relay and ATM; Protocols for QoS Support: Resource Reservation-RSVP; Multiprotocol Label Switching; Real-Time Transport Protocol; Internet Routing: Interior and Exterior gateway Routing Protocols; Routers and core routers; RIP; OSPF; BGP; IDRP; Multicasting; IGMP; MOSPF; Routing in Ad Hoc Networks; Routing in ATM: Private Network-Network Interface; Private Network Interconnection: Private and Hybrid Networks; Virtual Private Network; Error and Control Messages: ICMP; Error reporting vs. Error Correction; ICMP message format and Delivery; Types of messages; Address Resolution (ARP); BOOTP; DHCP; Remote Logging; File Transfer and Access; Network Management and SNMP; Comparison of SMTP and HTTP; Proxy Server; The Socket Interface; Network security at various layers, security related issues in mobility, secure- HTTP, SSL, Message digest, Key distribution protocols, Digital signatures and digital certificates

Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

N. Olifer and V.Olifer, Computer networks ;Principals Technologies and Protocols for network design, Wiley- Dreamtech low price, New Delhi

W.Stallings, Cryptography and network security; Principles and practice, 2nd Edition, prentice hall, 1998 William Stallings, “High-Speed Networks and Internets, Performance and Quality of Service”, Pearson Education; Douglas E. Comer, “Internetworking with TCP/IP Volume – I, Principles, Protocols, and Architectures”, Fourth Edition,

Pearson Education. B. Muthukumaran, “Introduction to High Performance Networks”, Vijay Nicole Imprints. Wayne Tomasi, “Introduction to Data Communications and Networking”, Pearson Education. James F. Kurose, Keith W. Ross, “Computer Networking, A Top-Down Approach Featuring the Internet”, Pearson

Education Andrew S. Tanenbaum, “Computer Networks”, Pearson Education. Behrouz A. Forouzan, “Data Communications and Networking”, Fourth Edition, McGraw Hill. Current Literature and Technical Journals


CSE- 711 SECURITY IN COMPUTING


Computer security: Goal, Vulnerabilities, threats, attacks, and controls; Cryptography: Terminology and Background, Substitution Ciphers, Transpositions, Cryptanalysis, Data Encryption Standard, DES & AES Algorithms and comparison, Public Key Encryption Program Security: Secure Programs, Non-malicious Program Errors, Viruses and Other Malicious Code, Controls against Program Threats Protection in General-Purpose Operating Systems: Security Methods of Operating Systems, Memory and Address Protection, Control of Access to General Objects, File Protection Mechanisms, User Authentication, Designing Trusted Operating Systems: Security Policies, Models of Security Database and Data Mining Security: Introduction to databases, Security Requirements, Reliability and Integrity, inference, Sensitive data, Monitors, Multilevel Databases -Security Issues, Data Mining - Privacy and Sensitivity, Data Correctness and Integrity Security in Networks: Threats in networks, Network security controls, Firewalls – design and types, Intrusion detection systems, security for email Legal and Ethical Issues in Computer Security: Copyrights, Patents, Trade Secrets, Information and the Law, Computer Crime Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Charles. P. Pfleeger & Shari Lawrence Pfleeger, Security in Computing, fourth edition, Prentice Hall, 2006. William Stallings, Network Security Essentials, Applications and Standards, 3rd edition, Pearson Education, 2007 William Stallings, Cryptography and Network Security Principles and practice. 4/e, Prentice Hall, 2006. Michael. E. Whitman and Herbert J. Mattord, Principles of Information Security, Course Technology, 2002.


CSE- 713 NATURAL LANGUAGE PROCESSING

Internal Assessment/Evaluation: 30 Marks External Examination: 45 Marks

Duration of Examination: 03 Hours

NLP: Introduction, Origins of NLP, Language and Knowledge, The challenges of NLP, Language and Grammar, Processing Indian languages, NLP Applications, Some Successful early NLP systems, Information Retrieval Language Modelling:Introduction,Various Grammar –based language models,Stastical language models, Syntactic Analysis: Introduction, Context free grammar, Constituency, parsing, Probabilistic Parsing, Indian languages, Semantic Analysis :Introduction, Meaning representation, Lexical semantics, Ambiguity, Word sense disambiguation, Natural language Generation: Introduction, Architecture of NLG systems, Generation tasks and representation, Applications of NLG Machine translation: Introduction, Design features of information retrieval systems Information retrieval models, Classical information retrieval models, Non classical models of IR, Alternative models of IR, Evaluation of the IR system Information retrieval: Introduction, Natural language processing in IR, Relation Matching, and Knowledge based approaches, Conceptual Graphs in IR, Cross- lingual Information Retrieval Lexical Resources: Introduction, Word net, Framenet, Stemmers, Part of speech tragger Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Tanveer Siddigui, U.S.Tiwary, Natural language Processing and Information Retrieval, Oxford higher education. Gerald Gazdar and Chris Mellish, Natural Language Processing in Prolog, Addison Wesley. Allen James, Natural Language Understanding, Benjamin Cummins 4.Briscoe, Edward J., Boguraev and Branimir K, Computation Lexicography for Natural Language Processing,

Longman/Wiley. Schwartz, Steven C, Applied Natural Language Processing, Petro celli. Winograd, Terry, Understanding Natural Language, Academic Press.


CSE- 715 NEURAL NETWORKS & FUZZY LOGIC


Fundamentals of ANN, Biological prototype, Neural Network Concepts, Definitions – Activation, Functions, single layer and multilayer networks, Training ANNs, perceptrons, Exclusive OR problem, Linear seperability, storage efficiency, perception learning - perception training algorithms, Hebbian learning rule - Delta rule, Kohonen learning law, problem with the perception training algorithm. Back propagation neural network, Training algorithm, network configurations, Back propagation error surfaces, Back propagation learning laws, Network paralysis - Local minima, and temporal instability Counter propagation Networks, Kohonen layer, Training the Kohonen layer, preprocessing the input vectors, initializing the weight vectors. Statistical properties, Training the Grossberg layer- Feed forward counter propagation Neural Networks, Applications. Statistical methods simulated annealing, Bloltzman Training, Cauchy training - artificial specific heat methods, Application to general non-linear optimization problems, back propagation and cauchy training. Hopfield network Fuzzy logic: background, uncertainty and impression, Statistics and Random Processes, Uncertainty in Information, Fuzzy sets and Membership, Chance versus Ambiguity, Classical Sets – Operations, Properties, mapping to classical sets to functions; Fuzzy Sets – Operations and Properties; Sets as points in Hypercube. Relations and Functions: Cartesian Product, Crisp relations – cardinality operations, properties, composition, Fuzzy Relations – Cardinality operations, properties, Fuzzy Cartesian Product and Composition, Noninteractive Fuzzy Sets, Tolerance and Equivalence Relations, Crisp Equivalence Relation, Crisp Tolerance Relation, Fuzzy Tolerance and Equivalence Relations, Value Assignments, Cosine amplitude, Max-Min method, other similarity methods, Membership Functions – Features, Standard forms and biyearlies, Fuzzyfication, Membership value assignments, Intuitions, Inference, Rank Ordering, Angular Fuzzy sets, Neural Networks, Genetic Algorithm, Inductive Reasoning. Lambda-Cuts for Fuzzy Sets, Lambda-cuts for fuzzy relations, Defuzzification Methods. Arithmetic and Logic: Extension Principle, Crisp functions, Mapping and Relations, Functions of Fuzzy Sets, Fuzzy Transform Practical Considerations, Fuzzy Numbers, Interval Analysis in Arithmetic, Approximate Methods of extension, Vertex Method, DSW Algorithm, Restricted DSW Algorithms, Comparisons, Fuzzy Vectors, Classical predicate logic, Tautologies, Contradictions, Equivalence, Exclusive Oral Exclusive Logical proofs, Deductive Proofs, Deductive Inferences, Fuzzy Logic, Approximate Reasoning, Fuzzy Tautologies, Contradictions, Equivalence and Logical Proofs, other forms of the implication operation, other forms of the composition operation. Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions.

Recommended Books:

Rao, Vallinu B., and Rao, Hayagriva . Neural networks and fuzzy Logic, second edition, BPB Publication Anderson J.A., an Introduction to Neural Networks, PHI. G.J.Klir & B.Yuan, Fuzzy sets & Fuzzy logic, PHI. Freeman A. James, Skapura M. David, Neural networks algorithms, applications and programming

Techniques, Pearson Education Philip D. Wasserman, Neural Computing – Theory and Practice, Van Nostrand and Reinhold Haykin S., Neural Networks-A Comprehensive Foundations, PHI, 1999. Patterson D.W., Artificial Neural Networks: Theory and Applications, Prentice Hall, Singapore, 1995. G.J.Klir & T.A. Folyger, Fuzzy Sets, Uncertainty & Information, PHI, 1988. Kumar Satish, Neural Networks, Tata McGraw Hill, 2004


CSE- 617 ADVANCED DATA STRUCTURES AND ALGORITHMS LAB


Implement the following programs in C/C++

1. Implement the concept of binary search tree. 2. Implement the concept of AVL tree. 3. Implement the concept of Red Black tree. 4. Implement the concept of B trees. 5. Implement the heap sort. 6. Implement the concept of Fibonacci heaps. 7. Implement the Rabin- Karp algorithm. 8. Implement the Boyer Moore algorithm 9. Implement the minimum cost spanning tree algorithm. 10. Implement the single source shortest path algorithm

13. Implement the algorithm for optimal binary search tree 14. Implement the algorithm for Job sequencing with deadlines.

15. Implement the algorithm for sum of subsets problem. 16. Implement the algorithm for travelling sales person problem. 17. Implement the algorithm for knapsack problem. 18. Implement the algorithm for n-queen problem. 19. Implement the algorithm for graph coloring. 20. Implement the algorithm for all pair shortest path


CSE- 612 ADVANCED SOFTWARE ENGINEERING


Introduction to life Cycle Models, Analysis & Specification, formal Requirements specification, Fundamental issues in design, Goodness of design, Cohesion, Coupling, Function Oriented Design, Structured Analysis, Software Requirements, Requirement Engineering Process, System Models, Architectural Design, Distributed System Architecture, Application Architecture, Object Oriented Design, User interface Design, Rapid Software Development, Software Reuse, Component based Software Engineering, Software Testing, Quality Management, Security Engineering, Service Oriented Software Engineering, Aspect oriented software development, SEI CMM,ISO 9001& Six Sigma, Clean Room Testing Technique. Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

R.S. Pressman, Software Engineering – A Practitioner’s Approach, 5th Ed, TMH, 2000. Ian Sommerville, Software Engineering, 4th Ed., Addison Wesley. Pankaj Jalote, An Integrated Approach to Software Engineering 2nd Ed, Narosa Publishing. K.K.Aggarwal, Yogesh Singh: Software Engineering, New Age International Ltd, 2001 Current literature and Technical Journals


CSE- 614 ADVANCED DATABASE SYSTEMS Internal Assessment/Evaluation: 40 Marks External Examination: 60 Marks Duration of Examination: 03 Hours

Active Databases, Application of Active Databases, Design Principles for Active Rules, Temporal databases, Complex Queries & Reasoning, Object oriented Databases, Distributed Databases, Parallel Database, Multimedia Database, Mobile Database, Query Processing, Advanced Database, Indexing Techniques for advanced Database, Database Security, Enhanced E-R Model, Enhanced data model for active database, Advanced transaction processing, Integrated Access to Multiple Data Source, Mobile Databases, Main memory databases, GIS, Sequence databases. Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Elmasri and Navathe, Fundamentals of Database Systems [5e], Pearson Education. Korth, Silberchatz, Sudarshan, Database System Concepts [5e], McGraw-Hill. Raghu Ramakrishna, Johannes Gehrke, Database Management Systems, McGraw-Hill Peter Rob and Coronel, Database Systems, Design, Implementation and Management, homson Learning C.J.Date, Longman, Introduction to Database Systems, Pearson Education


CSE- 712 MOBILE ADHOC AND WIRELESS SENSOR NETWORKS


Introduction, fundamentals of Wireless Communication Technology, Characteristics of the Wireless Channel, Modulation Techniques, Multiple Access Techniques, Computer Network Architecture: The TCP/IP Reference Model, IEEE 802 Networking Standard IEEE 802.11 Standard: physical layer, Basic MAC layer Mechanisms, CSMA/CA Mechanisms, and other MAC layer functionalities. Adhoc Wireless Networks, MAC Protocols for Adhoc Wireless Networks, Routing Protocols for Adhoc Wireless Networks: Introduction, issues in designing a Routing protocol for Adhoc Wireless Networks, Classifications of Routing Protocols, Table-driven Routing Protocols, On-Demand Routing Protocols, Hybrid routing protocols Multicast routing in Adhoc Wireless Networks, Transport layer and Security Protocols for Adhoc Wireless Networks TRANSPORT LAYER– SECURITY PROTOCOLS 9 Introduction – Issues in Designing a Transport Layer Protocol for Ad hoc Wireless Networks – Design Goals of a Transport Layer Protocol for Ad hoc Wireless Networks –Classification of Transport Layer Solutions – TCP over Ad hoc Wireless Networks – Other Transport Layer Protocols for Ad hoc Wireless Networks – Security in Ad Hoc Wireless Networks – Network Security Requirements – Issues and Challenges in Security Provisioning – Network Security Attacks – Key Management – Secure Routing in Ad hoc Wireless Networks. QoS And Energy Management: Introduction – Issues and Challenges in Providing QoS in Ad hoc Wireless Networks –Classifications of QoS Solutions – MAC Layer Solutions – Network Layer Solutions – QoS Frameworks for Ad hoc Wireless Networks Energy Management in Ad hoc Wireless Networks –Introduction – Need for Energy Management in Ad hoc Wireless Networks – Classification of Energy Management Schemes – Battery Management Schemes – Transmission Power Management Schemes – System Power Management Schemes Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

C. Siva Ram Murthy and B. S. Manoj, “Ad Hoc Wireless Networks Architectures and Protocols”, Prentice Hall, PTR, 2004. C. K. Toh, “Ad Hoc Mobile Wireless Networks Protocols and Systems”, Prentice Hall,

PTR, 2001. Charles E. Perkins, “Ad Hoc Networking”, Addison Wesley, 2000


CSE- 714 BIOINFORMATICS


Introduction, importance and need of Bioinformatics, pattern recognition and Prediction Protein information resources: biological databases, primary sequence database, composite protein sequence databases secondary databases, composite protein pattern databases Bioinformatics tools: Networks - WWW, CERN EMBnet; EMBL Database, SEQNET, GenBank, NLM, etc., Sequence Databases and Sequence Analysis: genomic, cDNA EMBL database GenBank protein sequence, pattern recognition tools Genomics: Introduction, genome scale sequencing, comparative and evolutionary genomics, microarrays, proteomics, pharmacogenomics, Development using computer tools for sequencing projects, PCR and restriction mapping, practical and theoretical problems in sequencing, The challenges of whole genome sequencing, Web-based tools for restriction mapping, new technologies and new bioinformatics tools. Introduction to pair wise alignment technique and multiple sequence alignment Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Teresa K. Attwood, David J. Parry-Smith, Introduction to Bioinformatics, 1999, Longman Higher Education. S. Eddy, A. Krogh, G. Mitchison, Richard Durbin, Biological sequence analysis: probabilistic models of proteins and

nucleic acids, 1999, Cambridge University Press. Andreas Baxevanis, B.F.Francis Ouellette, Bioinformatics: a practical guide to the analysis of genes and proteins,

1998, John Wiley & Sons, Inc. James D. Tisdall, Beginning Perl for Bioinformatics. 2001. O'Reilly & Associates. Michael S. Waterman, Mathematical methods for DNA sequences, 1989, CRC Press.


CSE- 716 EMBEDDED SYSTEM

Internal Assessment/Evaluation: 30 Marks External Examination: 45 Marks Duration of Examination: 03 Hours Design Goals of Embedded software, size of embedded programs, features of tiny, small, large footprint, operating systems used in embedded systems, overview of 8 bit microcontrollers,16/32 bit controllers, devices and buses/o devices types and examples, synchronous, ios-synchronous and asynchronous communication from serial devices, ART & HDLC, parallel port devices, sophisticated interfacing features in devices/ports, timing & counting devices, USB,CAN And advanced i/o serial high speed buses, ISA, PCI, PCI-X & advanced programming/o programming, interrupt driven i/o, buffers& queues, NMI, software interrupts, exceptions, DMA Programming concepts & embedded programming, embedded system design & development tools, integrated development environment tools, testing & measurement equipment Real Time operating system issues with respect to embedded system applications; time constraints and performance analysis. Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

W. Wolf, Computers as Components: Principles of Embedded Computer Systems Design, Morgan Kaufmann, 2000. F. Vahid and T. D. Givargis Embedded System Design: A Unified Hardware/Software Introduction, Wiley, 2002. Peter Marwedel, Embedded System Design, Kluwer S. Heath Embedded Systems Design, Butterworth-Heinemann, 2002. J. Catsoulis, Designing Embedded Hardware, ORA, 2002. J. J. Labrosse Embedded Systems Building Blocks, CMP Books, 1999. G. De Micheli, R. Ernst and W. Wolf, Readings in Hardware/Software Code sign, Morgan Kaufmann, 2001.


CSE- 618 ADVANCED DATABASE SYSTEM LAB Internal Assessment/Evaluation: 25 Marks External Examination: 25 Marks Duration of Examination: 03 Hours

The practicals will be based on Advanced Database System (CSE-614) subject


CSE- 615 ADVANCED COMPUTER ARCHITECTURE

Internal Assessment/Evaluation: 40 Marks External Examination: 60 Marks Duration of Examination: 03 Hours Processor architecture, Single threaded execution, traditional microprocessors, DLP, ILP, Memory wall, parallel programming and performance issues pipelining, vector processing, superscalar processors, hardware and compiler support for branch prediction, out- of –order instruction issue, speculative execution and other techniques for high –performance, shared memory multiprocessors, synchronization, instruction and data cache organizations, multilevel caches, parallel memory systems, multiple processor systems, Interconnection networks, cache coherence, I/O systems, current research and future trends. Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Hwang and F.A Briggs: Computer Architecture and parallel processing ;McGraw hill Stone, H.S High Performance computer architecture Addison – Wesley Hennessy, J.L and Patterson, D.A computer architecture –Wesley


CSE- 621 DISTRIBUTED COMPUTING SYSTEMS


Characterization of distributed system: introduction, Examples resource sharing, challenges, system models: introduction, architectural models, fundamentals, coordinated agreement: introduction, distributed mutual exclusion, elections, multicast communications, consensus and related problems Logical time: Introduction, a framework for system of logical clocks scalar time, vector time efficient implementations of vector clocks, jard Jordan’s adaptive technique matrix time, virtual time, physical clock synchronization, NTP Global state and snapshot recording algorithm: introduction, system model & definitions, snapshot algorithms for FIFO channels, variations of the chandy lamport algorithm, snapshot algorithms for non FIFI channels, snapshots in casual delivery system, monitoring global state, necessary &sufficient condition for consistent global snapshots, finding consistent global snapshots in a distributed computation Termination detection: introduction, system model of a distributed computation, termination detection using distributed snapshots, terminationdetection by weight throwing, and a spanning tree based termination detection algorithm, message optimal termination detection, termination detection in general computing model, faulty distributed system Distributed mutual exclusion algorithms: introduction, preliminaries, lamport algorithm, ricart agrawala algorithm, singhal’s dynamic information, structure algorithm air mutual exclusion algorithm, quorum based mutual exclusion, Raymond tree based &token based algorithm Deadlock detection in distributed system: modelsof deadlocks, knapp’s classification of distributed deadlock detection algorithms, Mitchell & merits algorithm for single resource model, handy mishra algorithm for AND&OR model Leader election: anonymous rings, hang Roberts algorithm,herschberg Sinclair algo Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

M.Singhal, A.D.kshemkalyani, Distributed Computing-Principles Algorithms and Systems, Cambridge University Press, 1st Edition, 2008

Andrew S. Tanenbaum and Maarten van Steen. Distributed Systems: Principles and Paradigms, Prentice Hall, 2002.

George Coulouris, Jean Dollimore, and Tim Kindberg. Distributed Systems: Concepts and Design, 4th ed., Addison

Wesley, 2005. Current literature and Technical Journals


CSE- 721 PARALLEL COMPUTING


Parallel Programming Overview: Processes, Tasks and Threads – Parallelism Issues – Interaction / Communication Issues – Semantic Issues in Parallel Programs. Parallel Programming Platforms, Principles of Algorithm Design, Basic communication operations, Analytical modeling of Parallel Programs, Dense Matric Algorithms, Graph algorithm Search, Algorithm for Discrete Optimization Problems An introduction to Parallel Computing Design and Analysis of Algorithm, Machine Architecture: Multiple Instruction Stream, Multiple Data stream Machine, Single Instruction Stream Machine, Multiple Data Stream Machine, and Networks of Machine. Parallelism within Processors, language for Parallel Computers, Performance Criteria in Parallel System Basics of Interconnection Networks – Network Topologies and Properties – Buses, Crossbar and Multistage Switches, Software Multithreading – Synchronization Mechanisms, Message passing programming: Message Passing Paradigm – Message Passing Interface – Parallel Virtual Machine. Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw-Hill, New Delhi, 2003. David E. Culler & Jaswinder Pal Singh, “Parallel Computing Architecture: A Hardware/Software Approach”, Morgan

Kaufman Publishers, 1999. Michael J. Quinn, “Parallel Programming in C with MPI & OpenMP”, Tata McGraw-Hill, New Delhi, 2003. Kai Hwang, “Advanced Computer Architecture” Tata McGraw-Hill, New Delhi, 2003.


CSE- 723 ADVANCED COMPILERS


Introduction to Compiler Structure, Architecture and Compilation, Sources of Improvement Code Generation: Efficient Code generation for expressions, code generator generators, Code Generation for Pipelined machines, Register allocation techniques. Code Optimization: Classical theory of data flow analysis, bi-directional data flows, Unified Algorithm for dataflow Analysis, Theory of Data flow Analysis, Program Representation for Optimization – SSA form. Parallel Compilers: Motivation and overview, Structure of a Parallelizing compiler. Parallelism detection: data dependence, direction vectors, loop carried and loop independent dependences. Compilation for Distributed Machines: Data partitioning, instruction scheduling, register allocation, machine optimization. Dynamic compilation. Just in time (JIT) compilers, Auto scheduling compilers. Garbage collection, DGE architecture compilation Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Muchnik, Advanced Compiler Design and Implementation, Kauffman (1998) Wolf M., Optimizing Super Compiler for Super Computers, Pitman (1989) Aho, Ulman, Sethi, Compiler Principles and Techniques, Addison Wesley


CSE- 725 DATA MINING AND DATA WAREHOUSING


Data warehousing Definition, Usage and Trends. Difference between Operational Database and Data Warehouse, Data Marts, Metadata, Multidimensional Data Mode, Data Cubes, Schemas for Multidimensional Database, Data Warehouse Process & Architecture, OLTP vs. OLAP, ROLAP vs. MOLAP, Types of OLAP, Servers, 3-Tier Data Warehouse Architecture, Distributed and Virtual Data Warehouses, Data Warehouse Manager, .Data Warehouse Implementation, Computation of Data cubes, Modeling OLAP data, OLAP Queries Manager, Data Warehouse Back End Tools, complex aggregation at multiple granularities, tuning and testing of data warehouse. Data Mining Definition & Task, Importance and Motivation, Data Mining functionalities, KDD versus Data Mining, Data Mining Techniques, Tools and Applications. Data Mining Query Languages, Data Specification, Specifying knowledge, Hierarchy Specification, Pattern Presentation & Visualization Specification, Data Mining Languages and Standardization of Data Mining. Data Mining Techniques: Association rules, Clustering Techniques, Web Content Mining, Web structure Mining, Web Usage Mining, Spatial Mining, Temporal Mining, Mining complex data objects Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Sam Anahory & Dennis Murray, Data Warehousing In the Real World, Pearson, 1997 Jiawei Han & Micheline Kamber, Data Mining- Concepts & Techniques, Morgan Kaufmann, 2001 Arun Pujar, Data Mining Techniques, University Press; Hyderbad, 2001, Pieter Adriaans & Dolf Zantinge, Data Mining, Pearson, 1997. Alex Berson, Data Warehousing, Data Miniing and OLTP, Mc Graw Hill, 1997 Mallach, Data warehousing System, Mc Graw Hill, 2000.


CSE- 616 SOFTWARE ARCHITECTURE


Basic structural modeling, Common modeling techniques, basic behavioral modeling, advanced behavioral modeling, architecture modeling, software architecture, and software design, Software process and the role of modeling and analysis, UML diagram and UML analysis modeling, analysis tools analysis patterns Software architecture; architecture style, architecture patterns, analysis of architectures, formal descriptions of software architectures, architectural description language and tools, scalability and interoperability issues Software design; Design practices, design pattern, extreme programming, component technology, object oriented frameworks Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Shaw, M and Garlan, D, Software architecture, Perspectives on emerging discipline, Pentice hall 1996. Booch G, Rum bough, J.Jacobson, The Unified Modeling Language User Guide, Addison –Wesley 1999. Frank Buschmann el al, Pattern oriented software architecture, volume 1: A system of patterns, John wiley and sons

1996. Gamma, E.Helm, R.Johnson, R.Vissides.J, Design patterns, elements of Reusable object-oriented software, Addison-

Wesley 1995.


CSE- 624 MOBILE COMPUTING


Evolution of Mobile Radio Communications, Second Generation (2G) Cellular Networks, Third Generation (3G) Wireless Networks, Wireless Local Loop and LMDS. Wireless Local Area Networks, Bluetooth and Personal Area Networks, Challenges in mobile computing, coping with uncertainties, resources poorness, bandwidth etc, Device –independent view component, location management techniques, mobility pattern, call arrival pattern. Publishing and accessing data in air; Pull and push based data delivery models, data dissemination by broadcast, broadcast disks, directory service in air, energy efficient indexing scheme for push based data delivery. Location updates stragies, locating mobile objects architecture, mobile agents systems Context aware mobile computing, context acquisition, context awareness Cache management – cache consistency strategies, cache invalidation schemes, Hoarding in mobile computing environment power aware and energy efficient schemes for cache invalidations Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Theodore S. Rapp port, Wireless communication: Principles and practices, second edition prentice hall 2002. Ivan Stojmenovic, Handbook of Wireless networks and Mobile computing, John Wiley and sons 2002. Mohd iilyas and imad Mahgoub, Mobile computing Handbook, CRC press/Aurbach Publications, 2005


CSE- 722 Software Project Management


Introduction to project management- Importance, stages of project, project management framework Project planning- Integration management, scope management, stepwise project planning Project scheduling- time management, project network diagrams Project cost management- Importance and principles of cost management, resource planning, cost estimating, cost budgeting, cost control Project Quality management- stages of quality management, quality planning, and assurance quality standards, tools and techniques for quality control Risk management- Risk management, importance, risk identification, risk quantification, risk response development and control Project procurement management- Importance, procurement planning, solicitation, source selection Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Bob Hughes and Mike Cotterell, Software Project Management, Third Edition, Tata McGraw-Hill Pankaj Jalote, Software Project Management in Practice, Pearson Education, 2002 Current literature and Technical Journals


CSE- 724 SOFT COMPUTING


Basic concepts of neuro-computing: Artificial Neural Network (ANN) and their biological roots and motivations, 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, Applications of Artificial Neural Networks, Competitive learning networks, Kohonen self organizing networks, Hebbian learning; Hopfield Networks, Associative Memories, The boltzman machine; Applications. Introduction to Fuzzy Logic, Genetic algorithms(GA), Evolution strategies(Ess), Evolutionary programming(EP), Genetic Programming(GP), Selecting, crossover, mutation, schema analysis, analysis of selection algorithms; convergence; Markov & other stochastic models. Introduction to Genetic Algorithms Random Optimization, Simulated Annealing, Tabu Search, Ant Colony Optimization, Particle Swarm Optimization, Memetic Algorithms. Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

S. N. Sivanandam & S. N. Deepa, Principles of Soft Computing, Wiley - India, 2007. Haykin, Neural networks: a comprehensive foundation, Pearson. Mitchell M., an Introduction to Genetic Algorithms, Prentice-Hall, 1998. current literature and technical journals


CSE- 726 IMAGE PROCESSING


Introduction to Image Processing, dimensional systems & mathematical preliminaries: Fourier Transform and Z-Transform, Causality and stability, Toeplit and Circulate Matrics, orthogonal and unitary Matrices and Kroenker product, Markov Processes KI Transform Mean square Estimates and Orthogonal Principles. Image sampling and quantization: Image sampling quantization, Band Limited Image Sampling Versus Replication, Reconstruction of Image from samples Sampling Theorem, Sampling Theorem for Random Fields, Sampling Optimal Sampling, Nonrectangular Grid Sampling, Sampling Aperture, Display Aperture/ Interpolation Functions, Lang range Interpolation, Moire Effect. Image Quantization Uniform Optimal Quantizer, Properties of Mean Square Quantizer, Commander Design Visual Quantization, introduction to image transforms, Point Operation, Histogram Modeling, Spatial Operations, Transform Operations, Multispectral Image Enhancement. Image Observation Models, Inverse and Wiener filtering; FIR Wiener Filters, Filtering using Image Transform Causal Models and recursive filtering Maximum entropy restoration. Spatial feature extraction, Edge detection and boundary extraction Boundary, region and moment representations structures, Texture, Image Segmentation, Reconstruction from Projections, Pixel Coding, Productive Techniques, Transform Coding Theory, Coding of Image, Coding of two-tone image. Note: The examiner is required to set EIGHT questions in all carrying equal marks covering the entire syllabus. The candidate is required to attempt FIVE questions. Recommended Books:

Rafael C Gonzalez, Richard E Woods 2nd Edition, Digital Image Processing - Pearson Education 2003. William K Pratt, Digital Image Processing John Willey (2001) Image Processing Analysis and Machine Vision – Millman Sonka, Vaclav hlavac, Roger Boyle, Broos/colic, Thompson

Learniy (1999). A.K. Jain, PHI, New Delhi (1995)-Fundamentals of Digital Image Processing. Chanda Dutta Magundar – Digital Image Processing and Applications, Prentice Hall of India, 2000.


CSE – 627 RESEARCH METHODOLOGY

Internal Assessment/Evaluation: 50 Marks Introduction to Educational Research: Concept; types – basic; applied and action; Need for educational research; Reviewing Literature; Need; Sources – Primary and Secondary; Purposes of Review; Scope of Review; steps in conducting review. Identifying and defining research problem: Locating; analyzing stating and evaluating problem. Generating different types of hypotheses and evaluating them. Methods of Research: Descriptive research design - survey; case study; content analysis; Ex-post Facto Research; Co relational and Experimental Research; Design and development of measuring instruments; Tests; questionnaires; checklists; observation schedules; evaluating research instruments; selecting a standardized test. Data Collection: Procedure of data collection; Aspects of data collection; coding data for analysis; Statistical Methods of Analysis. Descriptive statistics: Meaning; Graphical representations; mean; Range and standard deviation; characteristics and uses of normal curve; Inferential statistics: t-test; Chi-square tests; correlation (rank difference and product moment); ANOVA (one way); Selecting appropriate methods. Procedure for writing a research proposal: Purpose; types and components of research proposal; Procedure for writing a research report; Audiences and types of research reports; Format of research report and journal articles. Strategies for evaluating; Research disseminating and utilizing research – An Overview Practice Tasks: Define a research problem in engineering education/industry after studying problem situation and literature Given the purpose, objectives of research, write hypotheses Select research designs for the given research objectives Identify the measuring instruments for the given research objectives/hypotheses Identify the appropriate statistical methods of analysis for the given research proposal. Critically analyse the given research reports on various aspects such as hypothesis, design, measuring tools, statistical

analysis, interpretation etc. to identify the gaps or weaknesses in the study. Recommended Books:

Borg; W and Gall; M. Educational Research: An Introduction; New York; Longman.2003 Cohen; L. Educational Research in Classrooms and Schools! A Manual of Materials and Methods NY: Harper and Row

Publishers.2000 CPSC: Developing Skills in Technician Education Research Modules 1 to 11 Singapore; Colombo Plan Staff College for

Technician Education Garrett; HE and Woodworth; RS. Statistics in Psychology and Education; Educational


CSE – 629 DISSERTATION (PHASE-I)

Internal Assessment/Evaluation: 100 Marks

The primary objective of this course is to enhance the student ability to analyze and carry out independent investigations etc. Each student will carry out independent work which should involve creativity; innovation and ingenuity. A dissertation supervisor (s) having at least post- graduate qualification; from industry/research organization shall be assigned to the student approved by the competent authority. In no case; the candidate can have more than two dissertation supervisors. Industry oriented projects may be encouraged for the purpose. The whole Dissertation work will be carried out and reported in two phases in 5th semester and 6th semester. Dissertation work (Phase-I) in 5th semester shall comprise of literature survey; problem formulation; finalization of goals to be achieved; outlines of the methodology to be used for achieving the targeted goals and final decision about S/W; H/W tools to be used for dissertation work in 6th semester. The entire work will be documented in the form of report. Internal assessment of dissertation (Phase-I) in 5th semester will be made by the committee evaluating the report (50% weightage); oral presentation and response of the student in the discussion / presentation (50% weightage). The dissertation supervisor (s) shall be the member (s) of the committee.


CSE – 630 DISSERTATION (PHASE-II)

Internal Assessment/Evaluation: 50 Marks External Examination: 250 Marks

The complete dissertation work shall comprise of literature survey; problem formulation; methodology used; S/W; H/W tools used; Results and discussion followed by the conclusions & further scope of work in that area. The submission of dissertation in 6th semester shall be allowed only after ensuring that the research work carried out by the candidate has attained the level of satisfaction of the ‘Dissertation Supervisor (s)’ and proof of communication/acceptance of the research paper (if any; and certified in the report) in the relevant refereed journal/ conference.

The final dissertation external examination in 6th semester shall be taken by a panel of examiners comprising of concerned Supervisor (s); one external examiner (from the relevant field) nominated/approved by the competent authority. Hard copies of dissertation; one for each supervisor (s); examiner and the university/ department; are required to be submitted by the student before the final dissertation external examination. The candidate shall appear before the examining committee for oral examination and presentation on the scheduled date.

List of books (Part-time /full time ) M Tech: Computer Science and Engineering

1. ADVANCED DATA STRUCTURES AND ALGORITHMS

V .Aho, J. E. Hopcroft, and J.D.Ullman, Data Structures and Algorithms Addison Wesley, Reading Massachusetts,USA,1983.

T.H.Cormen, C.E.Leiserson, and R.L.Rivest, introduction to algorithms, the MIT press, Cambridge, Massachuetts, USA1990.

2. TOPICS IN COMPUTER NETWORKS N. Olifer and V.Olifer, Computer networks ;Principals Technologies and Protocols for network design, Wiley- Dreamtech

low price, New Delhi W.Stallings, Cryptography and network security; Principles and practice, 2nd Edition,

3. SECURITY IN COMPUTING Charles. P. Pfleeger & Shari Lawrence Pfleeger, Security in Computing, fourth edition, Prentice Hall, 2006. William Stallings, Network Security Essentials, Applications and Standards, 3rd edition, Pearson Education, 2007

4. NATURAL LANGUAGE PROCESSING

Tanveer Siddigui, U.S.Tiwary, Natural language Processing and Information Retrieval, Oxford higher education. Gerald Gazdar and Chris Mellish, Natural Language Processing in Prolog, Addison Wesley

5. NEURAL NETWORKS & FUZZY LOGIC Rao, Vallinu B., and Rao, Hayagriva . Neural networks and fuzzy Logic, second edition, BPB Publication Anderson J.A., an Introduction to Neural Networks, PHI.

6. ADVANCED SOFTWARE ENGINEERING R.S. Pressman, Software Engineering – A Practitioner’s Approach, 5th Ed, TMH, 2000. Ian Sommerville, Software Engineering, 4th Ed., Addison Wesley.

7. ADVANCED DATABASE SYSTEMS Elmasri and Navathe, Fundamentals of Database Systems [5e], Pearson Education. Korth, Silberchatz, Sudarshan, Database System Concepts [5e], McGraw-Hill.

8. MOBILE ADHOC AND WIRELESS SENSOR NETWORKS C. Siva Ram Murthy and B. S. Manoj, “Ad Hoc Wireless Networks Architectures and Protocols”, Prentice Hall, PTR, 2004. C. K. Toh, “Ad Hoc Mobile Wireless Networks Protocols and Systems”, Prentice Hall,

PTR, 2001. 9. BIOINFORMATICS

Teresa K. Attwood, David J. Parry-Smith, Introduction to Bioinformatics, 1999, Longman Higher Education. S. Eddy, A. Krogh, G. Mitchison, Richard Durbin, Biological sequence analysis: probabilistic models of proteins

and nucleic acids, 1999, Cambridge University Press.

10 EMBEDDED SYSTEM W. Wolf, Computers as Components: Principles of Embedded Computer Systems Design, Morgan Kaufmann, 2000.

F. Vahid and T. D. Givargis Embedded System Design: A Unified Hardware/Software Introduction, Wiley, 2002. 11. ADVANCED COMPUTER ARCHITECTURE

Hwang and F.A Briggs: Computer Architecture and parallel processing ;McGraw hill Stone, H.S High Performance computer architecture Addison – Wesley

12. DISTRIBUTED COMPUTING SYSTEMS M.Singhal, A.D.kshemkalyani, Distributed Computing-Principles Algorithms and Systems, Cambridge University Press,

1st Edition, 2008 Andrew S. Tanenbaum and Maarten van Steen. Distributed Systems: Principles and Paradigms, Prentice Hall,

2002. 13. PARALLEL COMPUTING

Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw-Hill, New Delhi, 2003. David E. Culler & Jaswinder Pal Singh, “Parallel Computing Architecture: A Hardware/Software Approach”, Morgan

Kaufman Publishers, 1999. 14 ADVANCED COMPILERS

Muchnik, Advanced Compiler Design and Implementation, Kauffman (1998) Wolf M., Optimizing Super Compiler for Super Computers, Pitman (1989)

15 DATA MINING AND DATA WAREHOUSING Sam Anahory & Dennis Murray, Data Warehousing In the Real World, Pearson, 1997

Jiawei Han & Micheline Kamber, Data Mining- Concepts & Techniques, Morgan Kaufmann, 200

16 SOFTWARE ARCHITECTURE

Shaw, M and Garlan, D, Software architecture, Perspectives on emerging discipline, Pentice hall 1996. Booch G, Rum bough, J.Jacobson, The Unified Modeling Language User Guide, Addison –Wesley 1999

17 MOBILE COMPUTING

Theodore S. Rapp port, Wireless communication: Principles and practices, second edition prentice hall 2002. Ivan Stojmenovic, Handbook of Wireless networks and Mobile computing, John Wiley and sons 2002

18 Software Project Management Bob Hughes and Mike Cotterell, Software Project Management, Third Edition, Tata McGraw-Hill Pankaj Jalote, Software Project Management in Practice, Pearson Education, 2002

19 SOFT COMPUTING S. N. Sivanandam & S. N. Deepa, Principles of Soft Computing, Wiley - India, 2007. Haykin, Neural networks: a comprehensive foundation, Pearson.

20 IMAGE PROCESSING Rafael C Gonzalez, Richard E Woods 2nd Edition, Digital Image Processing - Pearson Education 2003. William K Pratt, Digital Image Processing John Willey (2001

21 RESEARCH METHODOLOGY Borg; W and Gall; M. Educational Research: An Introduction; New York; Longman.2003 Cohen; L. Educational Research in Classrooms and Schools! A Manual of Materials and Methods NY: Harper and Row

Publishers.2000

computer science - mewar university

Documents