M 0705 Computer Science and Engineering
M 0705 Computer Science and Engineering
M 0705 Computer Science and Engineering
of
M. TECH.
in
OFFERING DEPARTMENT
1
CERTIFICATE
This is to certify that
1. The scheme and syllabi are prepared in accordance with the regulation and guidelines issued
by the KTU from time to time and also as per the decisions made in the CGPC meetings.
2. The suggestions/modifications suggested while presenting the scheme and syllabi before
CGPC on 25.6.2015 have been incorporated.
3. There is no discrepancy among the soft copy in MS word format, PDF and hard copy of the
syllabi submitted to the CGPC.
4. The document has been verified by all the constituent colleges.
Date: Chairman
Place:
2
VISION and MISSION of the Programme
VISION
MISSION
3
PROGRAM EDUCATIONAL OBJECTIVES (PEOs)
1. To enable graduates to be proficient in identifying and solving computing
problems by applying their knowledge in mathematics and computer science using
modern computing tools.
2. To enable graduates to develop a research attitude in the field of computer
science and to utilize it in their higher education endeavours and lifelong teaching-
learning process.
3. To enable students to acquire verbal skill to communicate effectively with team
members, constituents, and the public which enable them to collaborate as team
members and team leaders.
4. To enable graduates to maintain professional work ethics and obligation with
the prevalent cyber laws.
5. To inculcate awareness of professional and social responsibility so that they
can contribute to society through active engagement with professional societies,
schools, civic organizations or other community activities.
4
PROGRAM OUTCOMES (POs)
A. Graduates get an ability to analyze and apply fundamental principles of
computing and mathematics as appropriate to the discipline of computer science and
engineering.
B. Graduates will demonstrate the proficiency in understanding of various
computer programming languages and knowledge of various technologies in
computer system
C. Graduates will demonstrate an ability to apply mathematical foundations,
algorithmic principles and computer science theory, in the modeling and design of
computer based system.
D. Graduates will demonstrate an ability to use techniques, skills to analyze and
investigate complex problems through research and effectively utilize appropriate
modern engineering tools to solve it.
E. Graduates will possess sustainable, inclusive technology for societal and
environmental contexts.
F. Graduates will be able to communicate effectively and develop confidence in
self and life-long learning.
G. Graduates will possess leadership, project management and financial skills
with professional ethics.
5
Scheme of M.Tech Programme in Computer Science
and Engineering
Semester 1
Elective – 1
6
Semester 2
Exam. Course Subject Hours/Week Marks Total Sem end exam Credits
Slot Code Marks duration
(Hours)
L T P/D Internal Sem-end
A 07CS 6102 Advanced 4 0 0 40 60 100 3 4
Compiler
Design
B 07CS 6104 Advanced 3 0 0 40 60 100 3 3
Parallel
Computing
C 07CS 6106 Machine 3 0 0 40 60 100 3 3
Learning and
Language
Processing
D Elective - 2 3 0 0 40 60 100 3 3
E Elective - 3 3 0 0 40 60 100 3 3
07CS 6124 Seminar-1 0 0 2 100 0 100 - 2
07CS 6126 Mini Project 0 0 4 100 0 100 - 2
07CS 6128 Advanced 0 0 2 100 0 100 - 1
Research lab
TOTAL 16 0 8 500 300 800 21
Elective – 2
07CS 6108 Data Compression
07CS 6110 Advanced Topics in Information Security
07CS 6112 Software Quality Assurance and Reliability
07CS 6114 Cloud Computing
Elective – 3
07CS 6116 High Performance and Secure Networks
07CS 6118 Bio Informatics
07CS 6120 Soft Computing
07CS 6122 Lambda Calculus
7
Semester 3
Elective – 4
07CS 7101 Wireless Communication Techniques
07CS 7103 Advanced Machine Learning
07CS 7105 Computer Vision
07CS 7107 Optimization Techniques
Elective – 5
07CS 7109 Ad-hoc Wireless Networks
07CS 7111 Advanced Cryptography
07CS 7113 Combinatorial Algorithms
07CS 7115 Big-data Analytics
8
Semester 4
Note: The student has to undertake the departmental work assigned by HOD
9
SEMESTER -1
10
Course Plan
11
07CS 6101 ADVANCED SOFTWARE ENGINEERING
Course Objectives
To understand various phases and life-cycle models
Learn the importance of Analysis and Design
To understand and apply software metrics in analysis and estimation
Syllabus
Basic Concepts, Software life-cycle models, Metrics for Project size Estimation. Project Estimation
Techniques, Staffing Level Estimation, Software Requirements Specification, function oriented design using
SA/SD, Software quality and maintenance, Models for automated Analysis of programs, Computer-Aided
Software Engineering (CASE).
Course Outcomes
Students will be familiar with software industry processes.
They learn importance and various techniques for estimation.
Students get to know the different metrics and its use in estimation.
Students get a practical experience using and familiarizing software engineering tools.
References:
1. Rajib Mall, Fundamentals of Software Engineering, Prentice Hall India.
2. Pankaj Jalote, An integrated approach to Software Engineering, Springer/Narosa.
3. Roger S. Pressman, Software Engineering: A practitioner's approach, McGraw Hill.
4. Ian Sommerville, Software Engineering, Addison-Wesley.
5. KK Aggarwal and Yogesh Singh, Software Engineering, New Age
12
Course Plan
13
07CS 6103 ALGORITHMS AND COMPLEXITY
Course Objective:
To provide an introduction to the different complex algorithms in computer programming such as graph
algorithms randomized algorithms etc. and the complexity classes such as NP-Hard and NP-Complete
problems.
Syllabus:
RAM model – Asymptotic notation, standard notations and common functions, Recurrences, Proof of master
theorem. Amortized analysis, Dynamic tables, Advanced Data Structures: B-Trees, Binomial Heaps,
Fibonacci Heaps, Disjoint Sets, Union by Rank and Path Compression. Graph Algorithms and complexity,
Single source shortest paths, All-Pairs Shortest Paths, Johnson's algorithm for sparse graphs. Maximum
flow, Maximum bipartite matching, Greedy algorithms and Matroid theory. Randomized Algorithms - Finger
printing, Pattern matching, Interactive proof systems. Complexity classes - NP-Hard and NP-complete
Problems - Cook's theorem NP completeness reductions. Polynomial Time and Fully Polynomial time
Approximation Schemes. Introduction to probabilistic complexity classes.
Course Outcomes:
This course empowers students with problem analysis skills, students also gain expertise for the design and
development of algorithm for computing problems, and enables the students to model a complex problem
using mathematical techniques.
References
14
Course Plan
15
Internal continuous assessment: 40 marks
Internal continuous assessment is in the form of periodical tests and assignments. There are two tests
for the course (2 x 15 = 30 marks) and assignments (10 marks). The assignments can be in the form of
seminar, Tutorial or in a suitable format as decided by the teacher. The assessment details are to be
announced to students at the beginning of the semester by the teacher.
16
07CS 6105 TOPICS IN DATABASE SYSTEMS AND DESIGN
Course Objectives:
To provide the learner
The concept of database system and design.
The concepts of emerging technologies in the field of database management systems
Syllabus
Data Modelling using ER, Relational Model, Relational Algebra, Database Design using normalization ,
SQL, Object Oriented Database, Data mining and data warehousing, Structure of Oracle, Programming in
Oracle using PL/SQL.
Course Outcomes:
The learners will be able to:
Design database system using ER modelling
Understand the relational model by relational algebra
Able to apply principle of database design for creating good databases
Understand the significance of data mining for doing research in that area
Extract information from relational database using SQL
Able to develop simple programs in PL/SQL
References:
1. Ramez Elmasri, Shamkanth B Navathe: Database Systems- Models, Languages, Design and
Application Programming 6th Edition Pearson India
2. Thomas M Connolly, Carolyn E Begg: Database Systems – A practical approach to Design,
Implementation and Management 4th Edition – Pearson India
3. Abraham Silberschatz, Henry F Korth: Database System Concepts 6th Edition Mc. Graw Hill
Education
4. C J Date, A Kannan, S. Swamynathan: An introduction to database systems 8th Edition Pearson
India
5. Alexis Leon and Mathews Leon : Database Management Systems – Vikas Publishing House, New
Delhi
6. J. Han and M. Kamber, Data mining: Concepts and Techniques, Elsevier Science, 2007
7. Coronel, Moris, Rob : Database Systems Design, Implementation and Management Course
Technology, Cengage Learning
17
Course Plan
COURSE NO: 07CS 6105 COURSE TITLE: TOPICS IN DATABASE SYSTEMS AND DESIGN
(L-T-P : 3-0-0) CREDITS: 3
18
07CS 6107 ARTIFICIAL INTELLIGENCE
Syllabus
AI concepts, search techniques, basic search BFS, DFS, heuristic search techniques, simulated
anealing,. Hill Climbing, Agent based techniques, knowledge representation, propositional, predicate
calculus, semantic representation, Concepts of Robotics.
Course Outcomes:
Students successfully completing this course will be able to:
Comprehend advanced AI related literature more clarity.
Apply suitable AI techniques to solve real life problems.
Justify selection of techniques with proper theoretical arguments.
References:
1. George.F.Luger, Artificial Intelligence- Structures and Strategies for Complex Problem Solving, 4/e,
2002, Pearson Education.
2. Stuart Jonathan Russell, Peter Norvig, Artificial intelligence, A modern approach,3rd edition,
pearson,2010
3. E. Rich, k.knight, Artificial Intelligence, 2/e, Tata McGraw Hill.
19
Course Plan
20
07CS 6109 ADVANCED NETWORKING TECHNOLOGIES
Course Objectives:
To introduce the concepts in network performance, Switching, Router Architecture, to familiarize with IP
Next generation, IPv6 concepts. To understand the concepts of content transport and instant messaging.
Syllabus
Packet switching techniques, factors limiting the performance of switches and its mitigation measures.
Functions of a Router and router architecture and introduction to IP address lookup algorithms. Next
Generation Ipv6 addressing support for QoS and security. TCP Congestion Control mechanisms proactive
and reactive measures to alleviate the problem. Random Early Detection (RED) its variants and feedback
mechanisms. Content transport over Internet; the concept of peer-to-peer network and instant content
delivery.
Course Outcomes:
The students attains the knowledge of internal working of large packet switched networks, familiarizes with
the usage and study of modern tools to analyze the network performance, students also gain expertise for the
design and development of solutions, and enhances engineering knowledge.
References
1. Deepankar Medhi , Karthikeyan Ramasamy, Network Routing Algorithms, Protocols, and
Architectures, Elsevier Inc, 2007
2. Larry L. Peterson and Bruce S. Davie, Computer Networks: A Systems Approach, Fourth Ed.,
Morgan Kaufmann, 2007
3. Doug Lowe, Networking All-in-One For Dummies, 5th Edition , Wiely Publications, 2014
4. Silvano gai, Internetworking IPV6 with CISCO Routers, McGraw– Hill computer communication
series.
5. Markus Hoffmann and Leland R. Beaumont, Content Networking: Architecture, Protocols, and
Practice, Morgan Kauffman, 2005.
21
Course Plan
22
07CS 6111 DISTRIBUTED AND MOBILE OEPRATING SYSTEMS
Course Objectives:
The course familiarize the students with design and development of distributed systems and and also gain
expertise in the development of light weight operating systems
Syllabus
Introduction to distributed operating system, synchronization, processes and threads- scheduling of
processes, distributed file systems, distributed shared memory, Mobile operating systems- Overview of
Android kernel.
Course Outcome
The students attain the knowledge of the distributed operating system, to apply that knowledge in the
development of operating systems for multiprocessor environment. Students also get knowledge in the
working of light weight kernels like android.
References:
1. Andrew S.Tanenbaum Distributed Systems, Third Edition, Pearson Education
2. Marko Gargenda Learning Android, Orielly Publications.
3. Karim Yaghmour Embedded Android, Orielly Publications.
4. Abraham Silberschatz, Peterson B. Galvin, G. Gagne, Operating System Concepts, Sixth Edition,
Addison Wesley Publishing Co., 2003.
5. Randy Chow and Theodore Johnson, Distributed Operating Systems and Algorithms, Adison-Wesley
23
Course Plan
COURSE NO: 07CS 6111 COURSE TITLE: DISTRIBUTED AND MOBILE OPERATING
SYSTEMS
(L-T-P : 3-0-0) CREDITS:3
MODULES Contact Sem.Exam
hours Marks;%
MODULE : 1 Distributed OS (6 hours)
Distributed Operating Systems ‐ Introduction – Goals-Hardware and Software 1
Concepts
Design Issues , Communication 1 15
Client Server Model 2
Remote Procedure Call-Group Communication 2
.
MODULE : 2 Synchronization (7 hours)
Synchronization- Clock Synchronization 2
Exclusion-Election Algorithms 2 15
Atomic Transactions 2
Distributed Deadlock Detection and Prevention.
1
FIRST INTERNAL TEST
MODULE : 3 Process and Threads (7 hours)
Processes and Processors in Distributed Systems-Threads 1
System Models 1
Processor Allocation- Scheduling in Distributed Systems 1 15
Fault Tolerance 1
Real Time Distributed Systems 1
Distributed File Systems Design-Implementation. 2
MODULE : 4 Shared Memory Concepts (6 hours)
Distributed Shared Memory-Introduction-Consistency models 2
Page Based Distributed Shared Memory-Shared Variable Distributed Shared 2 15
Memory
Object Based Distributed Shared Memory 2
SECOND INTERNAL TEST
MODULE : 5 Mobile OS (8 hours)
Mobile OS- Introduction of Android 2
Main Building Block 3 20
Services 3
24
07CS 6113 DIGITAL IMAGE PROCESSING
Course Objectives:
To introduce the students the concepts of digital image processing fundamentals, image enhancement
techniques, segmentation, feature analysis and their applications.
Syllabus:
Steps in Image Processing Systems, Pixel Relationships Colour Fundamentals and Models. Image
Operations , Spatial Domain Gray Level Transformations, Histogram Processing. Spatial Filtering,
Smoothing and Sharpening, Frequency Domain, Filtering in Frequency Domain. Smoothing and Sharpening
filters. Edge Operators, Thresholding , Region Based Segmentation. Feature Analysis and Extraction,
Image Compression: Fundamentals Compression Standards. Image Classification, Image Recognition –
Image Understanding , Video Motion Analysis, Steganography.
Course Outcomes:
This course imparts an investigative mentality for solving complex problems. Familiarizes with the usage
and study of modern tools for image processing, and students also gain expertise to suggest solutions for
image processing problems.
References:
1. Rafael C.Gonzalez and Richard E.Woods, “Digital Image Processing” Second
Edition, Pearson Education, 2003.
2. Milan Sonka, Vaclav Hlavac and Roger Boyle, “Image Processing, Analysis and
Machine Vision”, Second Edition, Thomson Learning, 2001
3. Anil K.Jain, “Fundamentals of Digital Image Processing”, Person Education, 2003.
25
Course Plan
26
07GN 6001 : RESEARCH METHODOLOGY
Course Objectives
The main objective of the course is to provide a familiarization with research methodology and to induct the
student into the overall research process and methodologies. This course addresses:
As a tutorial type course, this course is expected to be more learner centric and active involvement from the
learners are expected which encourages self study and group discussions. The faculty mainly performs a
facilitator’s role.
Syllabus
Overview of research methodology - Research process, scientific method, research design process.
Research Problem and Design - Formulation of research task, literature review, web as a source, problem
solving approaches, experimental research, and ex post facto research.
Thesis writing, reporting and presentation -Interpretation and report writing, principles of thesis writing-
format of reporting, oral presentation.
Research proposals, publications and ethics - Research proposals, research paper writing, considerations in
publishing, citation, plagiarism and intellectual property rights.
Research methods – Modelling and Simulation, mathematical modeling, graphs, heuristic optimization,
simulation modelling, measurement design, validity, reliability, scaling, sample design, data collection
methods and data analysis
Course Outcomes:
References:
1. C. R. Kothari, Research Methodology, Methods and Techniques, New Age International Publishers
2. K. N. Krishnaswamy, Appa Iyer Sivakumar, M. Mathirajan, Management Research Methodology,
Integration of principles, Methods and Techniques, Pearson Education
3. R. Panneerselvam, Research Methodology, PHI Learning
4. Deepak Chawla, Meena Sondhi, Research Methodology–concepts & cases, Vikas Publg House
5. J.W Bames, Statistical Analysis for Engineers and Scientists, McGraw Hill, N.York
6. Schank Fr., Theories of Engineering Experiments, Tata Mc Graw Hill Publication.
7. Willktnsion K. L, Bhandarkar P. L, Formulation of Hypothesis, Himalaya Publication.
8. Fred M Kerlinger , Research Methodology
27
9. Ranjit Kumar, Research Methodology – A step by step guide for beginners, Pearson Education
10. John W Best, James V Kahan – Research in Education , PHI Learning
11. Donald R. Cooper, Pamela S. Schindler, Business Research Methods, 8/e, Tata McGraw-Hill Co Ltd
12. Sinha, S.C. and Dhiman, A.K., 2002. Research Methodology, Ess Ess Publications. 2 volumes
13. Trochim, W.M.K., 2005. Research Methods: the concise knowledge base, Atomic Dog Publishing.
270p.
14. Coley, S.M. and Scheinberg, C. A., 1990, "Proposal Writing", Sage Publications.
15. Day, R.A., 1992. How to Write and Publish a Scientific Paper, Cambridge University Press.
16. Fink, A., 2009. Conducting Research Literature Reviews: From the Internet to Paper. Sage
Publications
17. Donald H.McBurney, Research Methods, 5th Edition, Thomson Learning, ISBN:81-315-0047-
0,2006
18. Garg, B.L., Karadia, R., Agarwal, F. and Agarwal, U.K., 2002. An introduction to Research
Methodology, RBSA Publishers..
19. Wadehra, B.L. 2000. Law relating to patents, trademarks, copyright designs and geographical
indications. Universal Law Publishing
20. Carlos, C.M., 2000. Intellectual property rights, the WTO and developing countries: the TRIPS
agreement and policy options. Zed Books, New York.
21. Additional suitable web resources
22. Guidelines related to conference and journal publications
28
Course Plan
29
07CS 6115 ADVANCED PROGRAMMING LAB
Course Objectives:
To equip students to implement advanced data structure constructs like Binomial heap, Fibonacci heap and
Disjoint Sets etc.
To introduce students the concept of discrete event simulator and other scripting languages like Python,
AWK etc.
List of experiments:
1. Implementation of Binomial and Fibonacci heap.
2. Implementation of Disjoint Sets
3. Simulation of Amortized analysis using Dynamic tables
4. Performance evaluation of different queues and effect of queues and buffers in wired network
environment
5. Compare the behavior of different variants of TCP (Tahoe, Reno, Vegas….) in wired network .
Comparison can be done on the congestion window behavior by plotting graph.
6. Simulate a wireless network consisting of TCP and UDP Traffic and then calculate their respective
throughput.
Course outcomes: To enable students for problem analysis skills, create interest in investigations of
complex problems and to understand and apply Modern simulation tools.
Note: Students may use the following programming languages or tools for doing the experiments:
C, C++, java
Python/awk
Network Simulating tools
Academic Assessment/Evaluation
1. Practical records/outputs 40%
2. Regular class viva-voce 20%
3. Final test 40%
30
07CS 6117 INTRODUCTION TO SEMINAR
Course Objectives:
To assess the debating capability of the student to present a technical topic. In addition, to impart training to
students to face audience and present their ideas and thus creating in them self-esteem and courage that are
essential for engineers.
Academic Assessment/Evaluation
Individual students are required to choose a topic of their interest and give a seminar on that topic for about
30 minutes. A committee consisting of at least three faculty members shall assess the presentation of the
seminar. A detailed write up on the topic of seminar is to be prepared in the format prescribed by the
department.
Course outcomes: Students shall be able to apply their theoretical knowledge to develop a solution for real
time problem.
31
SEMESTER -2
32
Course Plan
33
MODULE : 4 Code Generation (8 hours) 15
Code Generation - Issues in the design of a code generator – Instruction selection 2
– Register allocation – Evaluation order - Target language – A simple target
machine model – Program and instruction costs - Addresses in the target code –
static allocation – stack allocation – run-time addresses for names
Basic Blocks and Flow Graphs – Basic blocks – Next-use information – Flow 2
graphs – Representation of flow graphs – Loops -Optimization of basic blocks –
The DAG representation of basic blocks – Finding local common sub expressions
– Dead code elimination – Use of algebraic identities – Representation of array
references – Pointer assignments and procedure calls – Resembling basic blocks
from DAGs
Simple code generator – Register and address descriptors – The code generation 2
algorithm - Peephole optimization – Eliminating redundant loads and stores –
Eliminating unreachable code – Flow-of-control optimizations – Algebraic
simplification and reduction I strength – Use of machine identities
Register allocation and assignment – Global register allocation – Usage counts – 2
Register Assignment for outer loops – Register allocation for graph colouring -
Instruction selection by tree rewriting – Tree-translation schemes – Code
generation by tiling an input tree – Pattern matching by parsing – Routines for
semantic checking – General tree matching - Optimal code generation for
expressions – Ershove numbers – Generating code from Labelled Expression trees
SECOND INTERNAL TEST
MODULE : 5 Code Optimization (11 hours) 20
Code optimization - Principal sources of optimization – causes of redundancy – 2
Semantics-preserving transformations – Global common sub expressions – Copy
propagation – Dead code elimination – Code motion
Induction variables and reduction in strength – Introduction to data flow analysis 2
–The data-flow abstraction – The data-flow analysis schema – Data-flow schemas
on Basic blocks – Reaching definitions
Live variable analysis – Available expressions 1
Partial redundancy elimination – The sources of redundancy – The lazy-code- 2
motion problem – Anticipation of expressions
The lazy-code-motion algorithm - Loops in Flowgraphs – Dominators – Depth- 2
first ordering – Edges in Depth-first spanning tree – Back edges and reducibility –
Depth of a flow graph – Natural loops – Convergence of Iterative data-flow
algorithms
Region based analysis – Regions – Region hierarchies for reducible flow graphs – 2
Algorithm for region based analysis – Handling non-reducible flow graphs
34
07CS 6104 ADVANCED PARALLEL COMPUTING
Course Objectives
Equip students to select both suitable parallel programming paradigm and parallel programming environment
for solving heavy computational tasks.
Syllabus
Theoretical aspects of parallel programming paradigms, physical organisation of parallel computing
platforms, parallel algorithm models. detailed study of selected and popular parallel programming like MPI,
Detailed study of CUDA, Selected popular parallel programming problems in different domains, parallel
algorithm implementation and case studies.
Course Outcomes
Students who successfully complete this course will be able to:
Select the suitable parallel programming paradigm and justify using proper theoretical background.
Apply suitable parallel programming environment for large scale tasks.
Design and develop solutions for complex large scale tasks using parallel programming concepts
References:
1. An Introduction to Parallel Computing : Design and Analysis of Algorithms (English) 2nd Edition,:
Vipin Kumar , Ananth Grama , Anshul Gupta , George Karypis,Pearson India ,2007.
2. Programming Massively Parallel Processors: A Hands-on Approach (Applications of GPU
Computing Series) -2nd Edition, David Kirk and Wen-mei Hwu, Morgan Kaufmann (Elsevier),
2013.
3. Hennesy J.L. & Pattersen D.A., Computer Architecture: A Quantitative approach,Fifth Edition,
Harcourt Asia P Ltd. (Morgan Kaufman),2011.
4. Programming on parallel machines by Norm matloff available at
http://heather.cs.ucdavis.edu/~matloff/158/PLN/ParProcBook.pdf (open book under creative
common license).
5. Parallel Programming in C with MPI and OpenMP by M J Quinn, Mc-Grawhill Education, 2008.
6. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, F Thomas
Leighton,2002
35
Course Plan
36
07CS 6106 MACHINE LEARNING AND LANGUAGE PROCESSING
Course Objectives:
To impart basic knowledge of natural language processing with more clarity by including adequate machine
learning concepts
Syllabus:
Selected supervised learning techniques and unsupervised learning techniques, sequence classifier technique
like Hidden Markov Models, Discussion of popular problems of NLP like Pos tagging, Word sense
disambiguation, information extraction and Machine translation.
Course Outcomes :
Students successfully complete this course will be able to:
Comprehend Natural language processing concepts with more clarity.
Apply Suitable machine learning algorithms to solve NLP problems.
Justify selection of learning algorithms with proper theoretical arguments.
References:
1. Introduction to Machine Learning, third edition, Ethem Alpaydin, PHI learning pvt Ltd, 2015
2. Speech and Language Processing: An Introduction to Natural Language Processing,
Computational Linguistics and Speech Recognition, second edition, Daniel jurafsky and
James H martin, Pearson – 2014.
3. Foundations of Statistical Natural Language Processing, Christopher Manning and Hinrich
Schiitze, MIT press, 1999
4. Pattern Recognition and Machine Learning (Information Science and Statistics),
Christopher bishop, springer, 2011.
5. Machine Learning: An Algorithmic Perspective, Stephen Marsland, CRC Press, 2009.
6. Data Mining: Concepts and Techniques, Third edition, Jiawei Han , Micheline Kamber and
Jian Pei , Morgan Kaufmann publishers,2012.
7. Probabilistic Graphical Models: Principles and Techniques, Daphne Koller and Nir
Friedman, MIT Press, 2009.
8. Machine Learning: A Probabilistic Perspective, Kevin P. Murphy, MIT Press, 2012.
9. Building Machine Learning Systems with Python, Willi Richert et.al, Packt Publishing
Limited, 2013.
37
Course Plan
COURSE NO: 07CS 6106 COURSE TITLE: MACHINE LEARNING AND LANGUAGE PROCESSING
(L-T-P : 3-0-0) CREDITS:3
38
07CS 6108 DATA COMPRESSION
Course Objectives:
To familiarize the students with different compression techniques. The different types of compression are
text, image, video formats. Finally the different compression algorithm performance is analyzed.
Syllabus:
Introduction about Compression Techniques, Mathematical modeling of compression techniques – lossless
and lossy compression. Different types and methods of Compression Techniques, Dictionary methods,
Image compression, JPEG, Wavelet methods, Progressive Image compression, Video Compression
Course Outcomes:
Students shall be able to apply the knowledge of compression algorithm for different application areas and
identify the features.
References:
1. David Solomon, Data compression: the complete reference, 2nd edition, Springer verlag, New York.
2. Stephen Welstead, Fractal and wavelet Image Compression techniques, PHI, NewDelhi-1, 1999.
3. Khalid Sayood, Introduction to data compression, Morgan Kaufmann Publishers, 2003 reprint.
4. The Data compression Book, Mark Nelson and Jean-Loup Gailly, Mark Nelson and Jean-Loup
‘Gailly,BPB publications (2nd Edition),1995
39
Course Plan
Syllabus
Introduction to computer security, Security Trends, User Authentication, Access Control Principles,
Role based, Multicast, Discretionary Access Control, Database Security, Cloud Security, IT Security
Management and Risk Assessment, SISA, HIPAA, Physical Security, Infrastructure Security, Human
Resources Security, Legal and Ethical Issues, Security Auditing Architecture, OCTAVE, COBIT, ISO
17799/ISO 27001 Standards.
Course Outcomes:
After completing this course the students will
Be familiarised with the advanced topics in information systems security.
Be able to explain and compare the various access control policies and models.
Be able to analyze the significance of security auditing and risk assessment.
References:
1. W. Stallings, Computer Security: Principles and Practice, 2 nd Edition, Prentice Hall, 2011
2. Computer Forensics: Investigating Network Intrusions and Cyber Crime, by EC-Council Press 2009
3. Ronald L. Krutz, Russell Dean Vines, Cloud Security, Wiley [ISBN: 0470589876], 2010.
4. M. E. Whitman and H. J. Mattord, Principles of Information Security, 4th Edition, Course
Technology
5. M. Bishop, Computer Security: Art and Science, Addison Wesley
6. G. McGraw, Software Security: Building Security In, Addison Wesley, 2006
7. Information Security based on ISO 27001/ISO 27002: A Management Guide
41
Course Plan
COURSE NO: 07CS 6110 COURSE TITLE: ADVANCED TOPICS IN INFORMATION SECURITY
(L-T-P : 3-0-0) CREDITS: 3
42
07CS 6112 SOFTWARE QUALITY ASSURANCE AND RELIABILITY
Objective:
To understand various methods of estimating quality.
Learn various testing methods
To understand and apply software metrics in analysis and estimation
Syllabus:
Software quality – challenges, SQA components in project life cycle, Basics of software testing – Test
generation from requirements, Testing strategies, Test plan management – Execution and reporting –
Software test automation, Hierarchical models of software quality, Project progress control, Software
Reliability - Software Reliability and System Reliability, Software Metrics for Reliability.
Course Outcomes:
Students will be able to analyze the quality of given software.
To assess Quality standards.
Estimation and use of reliability using metrics
References
1. Daniel Galin, Software quality assurance – from theory to implementation, Pearson education, 2009.
2. Yogesh Singh, Software Testing, Cambridge University Press, 2012.
3. Aditya Mathur, Foundations of software testing, Pearson Education, 2008
4. Ron Patton, Software testing , second edition, Pearson education, 2007
5. Srinivasan Desikan and Gopalaswamy Ramesh, Software testing – principles and practices , Pearson
education, 2006
6. Alan C Gillies, Software Quality Theory and Management, Cengage Learning, Second edition, 2003
7. Robert Furtell, Donald Shafer, and Linda Shafer, Quality Software Project Management, Pearson
Education Asia, 2002.
8. Thomas Stahl, Markus Voelter, Model-Driven Software Development: Technology, Engineering,
Management, Wiley, 2006.
9. Anne Kleppe, Jos Warmer and Wim Bast. MDA Explained. The Model Driven Architecture, Practice
and Promise, Pearson Education, Boston, USA, 2003
10. Handbook of Software Reliability Engineering, Michael Lyu (ed.), 1996, IEEE Computer Society
Press, ISBN: 0-07-039400-8
43
Course Plan
COURSE NO: 07CS 6112 COURSE TITLE: SOFTWARE QUALITY ASSURANCE AND RELIABILITY
(L-T-P : 3-0-0) CREDITS:3
MODULES Contact Sem.Exam
hours Marks;%
MODULE : 1 Introduction to Software Quality (7 hours) 15
Introduction to software quality - challenges – objectives – quality factors, 2
Components of SQA – contract review – development and quality plans 2
SQA components in project life cycle – SQA defect removal policies – Reviews 3
44
07CS 6114 CLOUD COMPUTING
Course Objectives:
To familiarize the students with the advanced concepts in cloud computing.
To understand the various issues in cloud computing.
Syllabus:
Basics of cloud computing, System Models for Distributed and Cloud Computing, Cloud Services, Virtualization
technique and tools, Cloud architecture, design and development, Parallel and distributed program paradigms
– Map reduce, twister, Hadoop, Develop Cloud ap[plication, Cloud security, security as a Service, Data
security Application security, VM security.
Course Outcomes:
Students shall be able to apply the knowledge of cloud computing for solving problems in various computing
domains.
References:
1. Kai Hwang, Geoffrey C Fox, Jack G Dongarra, Distributed and Cloud Computing, From Parallel
Processing to the Internet of Things, Morgan Kaufmann Publishers, 2012.
2. John W.Rittinghouse and James F.Ransome, Cloud Computing: Implementation, Management, and
Security, CRC Press, 2010.
3. Toby Velte, Anthony Velte, Robert Elsenpeter, Cloud Computing, A Practical Approach, TMH, 2009.
4. George Reese, Cloud Application Architectures: Building Applications and Infrastructure in the
Cloud(Theory in Practice), O’Reilly Publications, 2009.
5. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You Work and
Collaborate Online, Pearson Education, 2009.
6. Kumar Reddy, Victor Moreno, Network virtualization, CISCO Press, 2008.
7. James E. Smith, Ravi Nair, Virtual Machines: Versatile Platforms for Systems and Processes
MorganKaufmann, ELSEVIER Publication, 2006.
8. Alex Amies, Harm Sluiman, QiangGuo Tong, and GuoNing Liu, Developing and Hosting
Applications on the cloud, IBM Press, 2012.
9. Haley Beard, Cloud Computing Best Practices for Managing and Measuring Processes for On-
demand Computing, applications and Data Centers in the Cloud with SLAs, Emereo Pty Limited,
July 2008
10. Richard N. Katz, The Tower and The Cloud, Higher Education in the Age of Cloud Computing,
2008.
11. Distributed and Cloud Computing, 1st edition, Morgan Kaufmann, 2011
45
Course Plan
46
Internal continuous assessment: 40 marks
Internal continuous assessment is in the form of periodical tests and assignments. There are two tests
for the course (2 x 15 = 30 marks) and assignments (10 marks). The assignments can be in the form of
seminar, Tutorial or in a suitable format as decided by the teacher. The assessment details are to be
announced to students at the beginning of the semester by the teacher.
47
07CS 6116 HIGH PERFORMANCE AND SECURE NETWORKS
Course Objective:
To familiarize the students with the concepts of high speed LANs , high performance optical network and
Passive Optical Networks. To impart awareness about protocols for network security.
Syllabus:
Frame Relay Networks – Asynchronous transfer mode, High Speed LAN’s , Wired and Wireless Access
Technologies , Passive Optical Network architectures and Standards. MPLS and GMPLS, Secure
communication using VPN. Network Security Protocols for Electronic Mail Security, IP Security and web
security.
Course Outcomes:
Students compare the various methods of providing network services over high speed networks with
reference to MPLS, VPN. This course also imparts an investigative mentality for design and development of
computer networks with high performance measures.
References
1. Deepankar Medhi , Karthikeyan Ramasamy, Network Routing Algorithms, Protocols, and
Architectures, Elsevier Inc, 2007
2. Youlu Zheng & Shakil Akhther, Networks for Computer Scientists and Engineers Oxford University
Press, 2012.
3. Jean Walrand and Pravin Varaiya, High Performance Communication Networks, 2nd Ed., Morgan
Kauffman, 1999.
4. William Stallings, HIGH SPEED NETWORKS AND INTERNET, Pearson Education, Second
Edition, 2002.
5. Irvan Pepelnjk, Jim Guichard and Jeff Apcar, MPLS and VPN architecture,Cisco Press, Volume 1
and 2, 2003.
6. Cryptography and Network Security – Principles and Practices : William Stallings, Pearson
Education
7. Leonid G. Kazovsky, Ning Cheng, Wei-Tao Shaw, David Gutierrez, Shing-Wa Wong, Broadband
Optical Access Networks, John Wiley and Sons, New Jersey, 2011.
8. Uyless D. Black, Optical Networks: Third Generation Transport Systems, Prentice Hall ,2007.
48
Course Plan
COURSE NO: 07CS 6116 COURSE TITLE: HIGH PERFORMANCE AND SECURE NETWORKS
(L-T-P : 3-0-0) CREDITS:3
MODULES Contact Sem.Exam
hours Marks;%
MODULE : 1 High Speed Networks (6 hours) 15
Frame Relay Networks 2
Asynchronous transfer mode: ATM Protocol Architecture, ATM logical Connection, 2
ATM Cell – ATM Service Categories – AAL.
High Speed LAN’s: Fast Ethernet, Gigabit Ethernet, IEEE 802.11 WLAN. 2
49
07CS 6118 BIOINFORMATICS
Objective:
To give the students an introduction to bio-informatics and various concepts related to bio- informatics such
as search engines, data visualization, pattern matching etc.. To build efficient solutions to problems like
sequence alignment and to introduce the process of drug discovery.
Syllabus:
Introduction to Molecular biology, Gene structure and information content, Molecular biology tools,
Algorithms for sequence alignment, Sequence databases and tools. Molecular Phylogenetics, Phylogenetic
trees, Algorithms for Phylogenetic tree construction, Introduction to Perl programming for Bioinformatics.
Introduction to Protein structure, Algorithms for Protein structure prediction, Gene expression analysis,
Micro Arrays, Pathway analysis. Pattern Matching algorithms, Bio-data analysis, Data Mining in
Bioinformatics, Algorithms and data structures for efficient analysis of biological data, Drug Discovery.
Course Outcomes:
This course empowers students with problem analysis skills, imbibes an interest in investigation of
bioinformatics problems, and students also gain expertise in programming to solve bioinformatics problems.
References
1. Bryan Bergeron, Bio Informatics Computing, Second Edition, Pearson Education, 2003.
2. D. E. Krane and M. L. Raymer, Fundamental Concepts of Bioinformatics, Pearson Education, 2003.
3. T. K. Attwood and D. J. Parry-Smith, Introduction to Bioinformatics, Pearson Education, 2003.
4. J. H. Zar, Biostatistical Analysis, 4/e, Pearson Education, 1999.
50
Course Plan
51
07CS 6120 : SOFT COMPUTING
Course Objectives:
To impart concepts of soft computing techniques such as neural Networks, fuzzy systems, genetic
algorithms, Ant colony optimization, particle swarm optimization etc.
Syllabus:
Neural networks, different types of neural networks, concepts fuzzy logic, fuzzy expert systems,
Evolutionary computing techniques like genetic algorithms, Ant colony optimization and Particle swarm
optimization.
Course Outcomes:
Students successfully complete this course will be able to:
Comprehend soft computing related literature more clarity.
Apply suitable soft computing techniques to solve optimization problems.
Justify selection of techniques with proper theoretical arguments.
References
1. Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, Neuro-Fuzzy and Soft Computing, Prentice-
Hall of India, 2003.
2. James A. Freeman and David M. Skapura, Neural Networks Algorithms, Applications, and
Programming Techniques, Pearson Edn., 2003.
3. Marco Dorigo, Thomas Stützle, Ant Colony Optimization,2004. George J. Klir and Bo Yuan, Fuzzy
Sets and Fuzzy Logic-Theory and Applications, Prentice Hall, 1995.
4. Amit Konar, Artificial Intelligence and Soft Computing, First Edition,CRC Press, 2000.
5. Simon Haykin, Neural Networks: A Comprehensive Foundation, Second Edition Prentice Hall, 1999.
6. Mitchell Melanie, An Introduction to Genetic Algorithm, Prentice Hall, 1998.
7. David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison
Wesley, 1997.
8. James F. Kennedy, Russell C. Eberhart, Swarm intelligence, Morgan kaufman, 2001
9. Kenneth A. Dejong, Evolutionary computation a unified approach, MIT press, 2006
10. Russell C. Eberhart, Yuhui Shi, Computational Intelligence: Concepts to Implementations, Morgan
kaufman, 2007.
52
Course Plan
53
07CS 6122 LAMBDA CALCULUS
Course Objectives:
To familiarize lambda calculus model of computer for enhancing perception of theory of programming
languages
Syllabus:
Formal Semantics, Untyped Lambda Calculus, Simply Typed Lambda Calculus, Extensions to Simply Types
Lambda Calculus: Basic Types, Derived Forms, Bindings, Pairs, Tuples, Records, Sums, Variants, General
Recursion, Sub-typing, Recursive Types, Polymorphism.
Course Outcomes:
Students successfully complete this course will be able to :
References
1. Benjamin C Pierce. Types and Programming Languages. MIT Press, 2002.
2. Luca Cardelli. Type Systems. In Allen B Tucker (Ed.), Handbook of Computer Science and
Engineering. CRC Press, 1996.
3. Michael L Scott. Programming Languages Pragmatics Elsevier, 2004.
54
Course Plan
55
07CS 6124 SEMINAR-1
Course Objectives:
To assess the debating capability of the student to present a technical topic. In addition, to impart training to
students to face audience and present their ideas and thus creating in them self-esteem and courage that are
essential for engineers.
Students have to register for the seminar and select a topic in consultation with any faculty member
offering courses for the programme. A detailed write up on the topic of the seminar is to be prepared in the
prescribed format given by the Department. The seminar shall be of 30 minutes duration and a committee
with the Head of Department as chairman and two faculty members from the department as members shall
evaluate the seminar based on the coverage of the topic, presentation and ability to answer questions put
forward by the committee.
Course Outcomes:
This course empowers students with problem analysis skills, improve effective communication skills, and
also inculcate lifelong learning skills.
56
07CS 6126 MINI PROJECT
Course Objectives:
To improve the professional competency and research aptitude by touching the areas which otherwise not
covered by theory or laboratory classes. The project work aims to develop the work practice in students to
apply theoretical concepts and practical tools/techniques to solve real life problems related to industry and
current research.
Assesment Guidelines:
The project work can be a design project/experimental project and/or computer simulation project on
any of the topics in computer science related topics. The project work is allotted individually on different
topics. The students shall be encouraged to do their project work in the parent institute itself. If found
essential, they may be permitted to continue their project outside the parent institute, subject to the
conditions in M. Tech regulations. Department will constitute an Evaluation Committee to review the project
work. The Evaluation committee consists of at least three faculty members of which internal guide and two
experts in the specified area.
The student is required to undertake the master research project phase 1 during the third semester
and the same is continued in the 4thsemester (Phase 2). Phase 1 consist of preliminary thesis work, two
reviews of the work and the submission of preliminary report. First review would highlight the topic,
objectives, methodology and expected results. Second review evaluates the progress of the work, preliminary
report and scope of the work which is to be completed in the 4th semester.
Course Outcomes:
Students shall be able to apply their theoretical knowledge to develop a solution for real time problem.
This course empowers students with problem analysis skills, improve effective communication skills, and
also inculcate lifelong learning skills.
Mini project will have internal marks 50 and semester end examination marks 50. Internal marks will be
awarded by respective guides as per the stipulations given below.
Semester End examination will be conducted by a committee consisting of three faculty members. The
students are required to bring the report completed in all respects duly authenticated by the respective guide
and head of the department before the committee. Students individually will present their work before the
committee. The committee will evaluate the students individually and marks shall be awarded as follows.
Report : 25 marks
Concept/Knowledge in the topic : 15 marks
Presentation : 10 marks
Total marks : 50 marks
57
07CS 6128 ADVANCED RESEARCH LAB
Objective:
To introduce students the concepts of parallel programming using CUDA and MPI
To experience implementation of machine learning techniques.
List of experiments:
Program which invoke CUDA kernel
1. Parallel program to add two integer vectors in O(1) time complexity.
2. Parallel program to multiply two matrices.
MPI Programs
1. Find the largest element in a matrix.
2. Find the transpose of a matrix.
Course outcome: Students will be able to apply advanced tools to implement research papers in machine
learning.
Academic Assessment/Evaluation
5. Practical records/outputs 40%
6. Regular class viva-voce 20%
7. Final test 40%
58
SEMESTER -3
Syllabus:
Fundamental concepts of wireless networks and wireless communication; wireless channel propagation and
models; shadowing and capacity of wireless channels; multiple antennas and space time communications;
broadband satellite mobile systems.
Course Outcomes:
Students who successfully complete this course will have an ability to demonstrate the fundamental concepts
of wireless communications. Students will also have the ability to design and develop real time wireless
networks.
References:
1. C. Siva Ram Murthy, B. S. Manoj , “Ad Hoc Wireless Networks: Architectures and Protocols”,
Pearson Education 2004.
2. Andrea Goldsmith, “Wireless Communications”, Cambridge University Press, 2007.
3. Gary Mullett, “Wireless Telecommunications Systems and Networks”, Thomson Learning 2006
4. Jeffrey H Reed, “Software Radio: A Modern Approach to Radio Engineering”, Prentice Hall, May
2002.
5. Theodore S Rappaport, “Wireless Communications”, Pearson Education, Asia , New Delhi, Second
Edition, 2002
6. David Tse and Pramod Viswanath, “Fundamentals of Wireless Communication”, Prentice Hall, 2003.
7. C Oestges and B Clerckx, “MIMO Wireless Communications”, 1st Edition 2007
59
Course Plan
60
Internal continuous assessment: 40 marks
Internal continuous assessment is in the form of periodical tests and assignments. There are two tests
for the course (2 x 15 = 30 marks) and assignments (10 marks). The assignments can be in the form of
seminar, Tutorial or in a suitable format as decided by the teacher. The assessment details are to be
announced to students at the beginning of the semester by the teacher.
61
07CS 7103 ADVANCED MACHINE LEARNING
Course Objectives
To enable students to comprehend and practice advanced machine learning literature.
Syllabus
EM algorithm, different models, directed and undirected probabilistic graphical models, Detailed study of
popular and emerging machine learning applications like deep learning concepts.
Course Outcomes
Students who successfully complete this course will be able to:
Comprehend advance machine learning concepts with more clarity.
Apply Suitable machine learning algorithms to solve real life problems.
Justify selection of learning algorithms with proper theoretical arguments.
References:
1. Machine Learning: A Probabilistic Perspective, Kevin P. Murphy, MIT Press, 2012.
2. Pattern Recognition and Machine Learning (Information Science and Statistics),
Christopher bishop, springer, 2011.
3. Introduction to Machine Learning, Third edition, Ethem Alpaydin, PHI learning pvt Ltd, 2015
4. Probabilistic Graphical Models: Principles and Techniques, Daphne Koller and Nir
Friedman, MIT Press, 2009.
5. Building Machine Learning Systems with Python, Willi Richert et.al, Packt Publishing
Limited, 2013.
6. Machine Learning With R, Brett Lantz, Packt Publishing Limited, 2014.
7. Machine Learning for Hackers, Drew Conway and John Myles White, OREILLY, 2012
62
Course Plan
63
07CS 7105 COMPUTER VISION
Course Objectives:
To introduce the student to computer vision algorithms, methods and concepts that will enable the student to
implement computer vision systems with emphasis on applications and problem solving.
Syllabus:
Introduction to Computer Vision; Image Formation and Filtering; Edge Detection; Image Analysis;
Computational Photography; View; Estimation and Stereo; High Level Computer Vision; Statistical Pattern
Recognition.
Course Outcomes:
Students will be able to demonstrate theoretical and experience knowledge on core vision task of scence
understanding and recognition. Also will be able to evaluate different vision tasks and apply computer vision
algorithms to real world problem solving.
References:
1. Computer Vision Algorithms and Applications, Richard Szeliski,Springer 2011
2. Computer Vision A Modern Approach, David A Forsyth and Jean Ponce, Prentice Hall 2011
3. Introductory Techniques for 3D Computer Vision, E.Trucco and Allessandro Verri,Prentice Hall
1998
4. Multiple View Geometry in Computer Vision, Second Edition, Richard Hartley and Andrew
Zisserman, Cambridge University Press,2004
5. Representations and Techniques for 3D Object Recognition and Scene Interpretation, Synthesis
Lecture on Artificial Intelligence and Machine Learning, D. Hoiem and S Savarese, Morgan
Claypool Publishers 2011
6. Learning OpenCV, Gary Radski and Adrian Kaehler, O’Reilly Media 2008
64
Course Plan
65
07CS 7107 OPTIMIZATION TECHNIQUES
Course Objectives:
To introduce to methods of unconstrained optimization
To provides the student with a collection of optimization modelling and solution tools that can be
useful in a variety of industries and functions
Syllabus:
Mathematical Background: Sequences and Subsequences; Vectors and vector spaces‐ Matrices‐ Linear
transformation; Quadratic forms; linear equations‐ Solution of a set of linear equations‐Basic solution and
degeneracy; Linear Programming: Introduction ‐Optimization model, formulation and applications‐Classical
optimization techniques; Nonlinear programming: Minimization and maximization of convex functions‐
Local & Global optimum‐ Convergence‐Speed of convergence. Unconstrained Optimization.
Course Outcomes:
Translate a verbal or graphical description of a decision problem into a valid optimization model, by
identifying variables, constraints, and an objective function.
Interpret the meaning and assess the validity of a particular optimization model.
Find solutions to optimization problems using the most appropriate algorithm.
Perform sensitivity analysis by tracing the effects of varying a parameter on the optimal decision
variables and the objective function.
References
1. David G Luenberger, Linear and Non Linear Programming, 2nd Ed, Addison‐Wesley.
2. S.S.Rao, Engineering Optimization; Theory and Practice; Revised 3rd Edition, New Age
International Publishers, New Delhi
3. S.M. Sinha, Mathematical programming: Theory and Methods, Elsevier.
4. Hillier and Lieberman Introduction to Operations Research, McGraw‐Hill, 8th edition.
5. Saul I Gass, Linear programming, McGraw‐Hill, 5th edition.
6. Bazarra M.S., Sherali H.D. & Shetty C.M., Nonlinear Programming Theory and Algorithms, John
Wiley, New York.
7. Kalyanmoy Deb, Optimization for Engineering: Design‐Algorithms and Examples, Prentice Hall
(India).
66
Course Plan
67
07CS 7109 ADHOC WIRELESS NETWORKS
Course Objectives:
To introduce mobile ad hoc networks, design and implementation issues, security, knowledge of routing
mechanisms and knowledge of sensor networks and their characteristics.
Syllabus:
Introduction to Adhoc wireless networks; MAC protocols for adhoc networks; Routing protocols; table
driven routing protocols; On demand routing protocols; Hybrid routing protocols; Multicast routing in
wireless adhoc networks; transport layer and security protocols; Quality of service in adhoc wireless
networks; Energy Management in Adhoc wireless Networks; Wireless sensor Networks
Course Outcomes:
Students will be able to design and develop mobile ad hoc networks (MANETs)
Students will have acquired skills to analyse the performance of mobile ad hoc or wireless sensor
network using simulation tools.
References
1. C.Sivarama Murthy, B.S Manoj, Adhoc Wireless Networks (architectures and protocols)-Prentice
Hall- 2012
2. J Schiller, Mobile Communications, Addison-Wesley, January 2000
3. Andrew S Tanenbaum, Computer Networks, Prentice Hall 2002
4. Sudeep Mishra, lsaacWoungang, Guide to Wireless Adhoc Networks, Springer February 2009
5. KavehPahlavan, Prashant Krishnamurthy, Principles of wireless networks: a unified approach,
Prentice Hall PTR, 2002.
6. Toh, Ad Hoc Mobile Wireless Networks Protocols and System, Pearson
68
Course Plan
69
MODULE : 6 Energy Management (6 hours) 20
Energy Management in Adhoc wireless Networks- Need and classification 1
Battery management Schemes, Transmission Power Management and System 2
Power Management Schemes.
Wireless sensor Networks – Applications, Issues, Challenges and architecture 1
Data dissemination and Data gathering 1
MAC Protocols for Sensor Networks, Location discovery , Quality of sensor 1
network-
Case study: Middlewares and OS for Wireless Sensor Networks 1
70
07CS 7111 ADVANCED TOPICS IN CRYPTOGRAPHY
Course Objective:
To familiarize the concepts in cryptography from a complexity theoretical perspective.
Syllabus:
Basics of Cryptography and Complexity, Non-deterministic computation, Probabilistic computation, Public
key cryptography, Digital signatures, Key establishment protocols, Secure encryption, Identification
schemes.
Course Outcomes:
After completing this course the students will be
Familiarized with the applications of complexity theory in cryptography.
Able to analyse the complexities of various problems in different domains.
Able to demonstrate how the algorithms are used in different problem domains.
References:
1. Complexity and Cryptography An Introduction by John Talbot and Dominic Welsh, Cambridge
University Press.
2. Computational Complexity: A Modern Approach by Sanjeev Arora , Boaz Barak
3. Complexity Theory and Cryptology An Introduction to Crypto complexity by Rothe, Jörg
4. Cryptography and network security by William Stallings
71
Course Plan
72
07CS 7113 COMBINATORIAL ALGORITHMS
Corse Objectives:
To provide an introduction to the theory and algorithms for integer and combinatorial problems, Familiarizes
primal-dual theory of linear programming and its applications in flows, matching, set cover etc, To
understand approximation and algorithms and various other combinatorial problems.
Syllabus:
Primal dual theory of linear programming, and application to Max flow / Min cut problem. Application of
primal dual theory to matching, bipartite matching, non bipartite matching, set cover, spanning trees and
Steiner Forest problems. Introduction to randomized algorithms, probabilistic recurrence, Randomized
selection, two point sampling. Randomization techniques, The probabilistic method. Existence proofs.
Approximation algorithms. Approximation algorithms for Set Cover - Greedy and using Primal-Dual
schema, Steiner Tree and traveling salesman problems. Approximation algorithm for Steiner Forest problem
using Primal-Dual schema. Non-approximability. Hardness of approximating MAX-3-SAT.
Course Outcomes :
This empowers students with complex problems analysis skills, gives the mathematical theory behind
algorithms for combinatorial problems, helps to formulate a combinatorial problem efficiently and explains
how these type of problems can be solved.
References
1. C. H. Papadimitirou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity,
Dover, 1998.
2. G. Ausiello et.al., Complexity and Approximation: Combinatorial Algorithms and their
Approximability Properties, Springer, 2002.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, Prentice Hall India, 1990.
4. V. Aho, J. E. Hopcraft, J. D. Ullman, The design and Analysis of Computer Algorithms, Addison
Wesley, 1974.
5. Approximation Algorithms, Vijay, Vazirani, Springer, 2001
73
Course Plan
74
07CS 7115 BIG DATA ANALYTICS
Course Objectives :
To impart following concepts Big data analytics,Tools and practices for working with big data and Time
series and text analytics to students.
Syllabus:
Introduction to big data- features and evolution of big data; big data analytics – data analytics lifecycle
overview-case study ; Review of basic data analytics method –exploratory data analysis and methods for
evaluation- advanced analytical theory and methods - time series analysis and text analysis; advanced
analytics technology and tools- map reduce and hadoop.
Course Outcomes:
The students who successfully complete this course will have the ability to deploy a structured lifecycle
approach to data analytics problems and apply appropriate analytic techniques and tools to analyzing big
data. Graduates will demonstrate an ability to use techniques to investigate complex problems through
research and effectively utilize appropriate modern engineering tools to solve it.
References
1. David Dietrich, Barry Heller, Biebie Yang, Data Science and Big Data Analytics: Discovering,
Analyzing, Visualizing and Presenting Data, EMC Education Services, John Wiley &Sons, Inc
2. Frank J Ohlhorst, Big Data Analytics: Turning Big Data into Big Money, Wiley and SAS Business
Series, 2012.
3. Colleen Mccue, Data Mining and Predictive Analysis: Intelligence Gathering and Crime Analysis,
Elsevier, 2007
4. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cambridge University
Press, 2012.
5. Bill Franks, Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with
Advanced Analytics, Wiley and SAS Business Series, 2012.
6. Paul Zikopoulos, Chris Eaton, Paul Zikopoulos, Understanding Big Data: Analytics for Enterprise
Class Hadoop and Streaming Data, McGraw Hill, 2011.
7. Paul Zikopoulos, Dirk deRoos, Krishnan Parasuraman, Thomas Deutsch , James Giles, David
Corrigan, Harness the Power of Big data – The big data platform, McGraw Hill, 2012.
8. Pete Warden, Big Data Glossary, O’Reilly, 2011.
9. M Sudheep Elayidom, Datamining and Warehousing, 1st Edition, Cengage Learning India Pvt Ltd
10. Jiawei Han, Micheline Kamber Data Mining Concepts and Techniques, Second Edition, Elsevier,
Reprinted 2008.
75
Course Plan
76
07CS 7117 SEMINAR-2
Course Objectives:
To assess the debating capability of the student to present a technical topic. In addition, to impart training to
students to face audience and present their ideas and thus creating in them self-esteem and courage that are
essential for engineers.
Assessment Guidelines:
Students have to register for the seminar and select a topic in consultation with any faculty member
offering courses for the programme. A detailed write up on the topic of the seminar is to be prepared in the
prescribed format given by the Department. The seminar shall be of 30 minutes duration and a committee
with the PG coordinator as chairman and two faculty members from the department as members shall
evaluate the seminar based on the coverage of the topic, presentation and ability to answer questions put
forward by the committee.
Course Outcomes:
This course empowers students with problem analysis skills, improve effective communication skills, and
also inculcate lifelong learning skills.
77
07CS 7119 MASTER RESEARCH PROJECT PHASE-I
Course Objectives:
To improve the professional competency and research aptitude by touching the areas which otherwise not
covered by theory or laboratory classes. The project work aims to develop the work practice in students to
apply acquired theoretical concepts and practical tools/techniques to solve real life problems related to
industry and current research.
Assesment Guidelines:
The project work can be a design project/experimental project and/or computer simulation project on
any of the topics in computer science/inter disciplinary topics. The project work is allotted individually on
different topics. The students shall be encouraged to do their project work in the parent institute itself. If
found essential, they may be permitted to continue their project outside the parent institute, subject to the
conditions in M. Tech regulations. Department will constitute an Evaluation Committee to review the project
work. The Evaluation committee consists of at least three faculty members of which internal guide and two
experts in the specified area each.
The student is required to undertake the master research project phase 1 during the third semester
and the same is continued in the 4thsemester (Phase 2). Phase 1 consist of preliminary thesis work, two
reviews of the work and the submission of preliminary report. First review would highlight the topic,
objectives, methodology and expected results. Second review evaluates the progress of the work, preliminary
report and scope of the work which is to be completed in the 4th semester.
Course Outcomes:
This course enables students to apply the acquired fundamental engineering knowledge for investigating and
solving complex problems. Empowers students with problem analysis skills, familiarizes with the usage and
study of modern tools. Students also gain expertise for the design and development of solutions, by
enhancing engineering knowledge, and improving inter-personal skills.
78
SEMESTER -4
Course Objectives:
To improve the professional competency and research aptitude by touching the areas which otherwise not
covered by theory or laboratory classes. The project work aims to develop the work practice in students to
apply theoretical concepts and practical tools/techniques to solve real life problems related to industry and
current research.
Assesment Guidelines:
The project work can be a design project/experimental project and/or computer simulation project on
any of the topics in computer science/inter disciplinary topics. The project work is allotted individually on
different topics. The students shall be encouraged to do their project work in the parent institute itself. If
found essential, they may be permitted to continue their project outside the parent institute, subject to the
conditions in M. Tech regulations. Department will constitute an Evaluation Committee to review the project
work. The Evaluation committee consists of at least three faculty members of which internal guide and two
experts in the specified area.
Master Research project phase - II is a continuation of project phase - I started in the third semester. There
would be two reviews in the fourth semester, first in the middle of the semester and the second at the end of
the semester. First review is to evaluate the progress of the work, presentation and discussion. Second review
would be a pre-submission presentation before the evaluation committee to assess the quality and quantum of
the work done. This would be a pre-qualifying exercise for the students for getting approval by the
departmental committee for the submission of the thesis. At least one technical paper is to be prepared for
possible publication in journal or conferences. The technical paper is to be submitted along with the thesis.
The final evaluation of the project will be external evaluation.
Course Outcomes:
This course enables students to apply the acquired fundamental engineering knowledge for investigating and
solving complex problems. Empowers students with problem analysis skills, familiarizes with the usage and
study of modern tools. Students also gain expertise for the design and development of solutions, by
enhancing engineering knowledge. This course also teaches the importance of team work, by improving
upon the aspects of communication and inter-personal skills.
79