Course L-T-P - Year of

Course Name
code Credits Introduction
CS302 Design and Analysis of Algorithms 3-1-0-4 2016
Prerequisite: Nil
Course Objectives
To introduce the concepts of Algorithm Analysis, Time Complexity, Space Complexity.
To discuss various Algorithm Design Strategies with proper illustrative examples.
To introduce Complexity Theory.
Syllabus
Introduction to Algorithm Analysis, Notions of Time and Space Complexity, Asymptotic
Notations, Recurrence Equations and their solutions, Master’s Theorem, Divide and Conquer and
illustrative examples, AVL trees, Red-Black Trees, Union-find algorithms, Graph algorithms,
Divide and Conquer, Dynamic Programming, Greedy Strategy, Back Tracking and Branch and
Bound, Complexity classes
Expected outcome
The students will be able to
i. Analyze a given algorithm and express its time and space complexities in asymptotic
notations.
ii. Solve recurrence equations using Iteration Method, Recurrence Tree Method and
Master’s Theorem.
iii. Design algorithms using Divide and Conquer Strategy.
iv. Compare Dynamic Programming and Divide and Conquer Strategies.
v. Solve Optimization problems using Greedy strategy.
vi. Design efficient algorithms using Back Tracking and Branch Bound Techniques for
solving problems.
vii. Classify computational problems into P, NP, NP-Hard and NP-Complete.
Text Books
1. Ellis Horowitz, SartajSahni, SanguthevarRajasekaran, Computer Algorithms, Universities
Press, 2007 [Modules 3,4,5]
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to
Algorithms, MIT Press, 2009 [Modules 1,2,6]
References
1. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, The Design and Analysis of
Computer Algorithms, Pearson Education, 1999.
2. Anany Levitin, Introduction to the Design and Analysis of Algorithms, Pearson, 3rd
Edition, 2011.
3. Gilles Brassard, Paul Bratley, Fundamentals of Algorithmics, Pearson Education, 1995.
4. Richard E. Neapolitan, Kumarss Naimipour, Foundations of Algorithms using C++
Psuedocode, Second Edition, 1997.
Course Plan
End
Sem.
Module Contents Hours
Exam
Marks
 Introduction to Algorithm AnalysisTime and Space Complexity-
Elementary operations and Computation of Time Complexity-
Best, worst and Average Case Complexities- Complexity 04
I Calculation of simple algorithms 15 %
Recurrence Equations:Solution of Recurrence Equations – 04
Iteration Method and Recursion Tree Methods
Master’s Theorem(Proof not required) – examples, Asymptotic 05
Notations and their properties- Application of Asymptotic
Notations in Algorithm Analysis- Common Complexity Functions
II AVL Trees – rotations, Red-Black Trees insertion and deletion 15%
(Techniques only; algorithms not expected). B-Trees – insertion 05
and deletion operations. Sets- Union and find operations on
disjoint sets.
FIRST INTERNAL EXAM
Graphs – DFS and BFS traversals, complexity, Spanning trees –
III Minimum Cost Spanning Trees, single source shortest path
algorithms, Topological sorting, strongly connected components. 07 15%
Divide and Conquer:The Control Abstraction, 2 way Merge sort, 04
Strassen’s Matrix Multiplication, Analysis
IV Dynamic Programming : The control Abstraction- The 05 15%
Optimality Principle- Optimal matrix multiplication, Bellman-Ford
Algorithm
SECOND INTERNAL EXAM
Analysis, Comparison of Divide and Conquer and Dynamic
Programming strategies 02
Greedy Strategy: - The Control Abstraction- the Fractional
V
Knapsack Problem, 04 20%
Minimal Cost Spanning Tree Computation- Prim’s Algorithm –
Kruskal’s Algorithm. 03
Back Tracking: -The Control Abstraction – The N Queen’s
Problem, 0/1 Knapsack Problem 03
Branch and Bound:Travelling Salesman Problem. 03
VI
Introduction to Complexity Theory :-Tractable and Intractable 20%
Problems- The P and NP Classes- Polynomial Time Reductions - 03
The NP- Hard and NP-Complete Classes
END SEMESTER EXAM

Question Paper Pattern

1. There will be five parts in the question paper – A, B, C, D, E
2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules I and II;
Allfour questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules I and
II; Two questions have to be answered. Each question can have a
maximum of three subparts.
4. Part C
 a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules III and
IV; Allfour questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules III and
IV; Two questions have to be answered. Each question can have a
maximum of three subparts
6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and
VI; four questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/numerical questions.

 Course L-T-P Year of
Course Name
code Credits Introduction
CS304 COMPILER DESIGN 3-0-0-3 2016
Prerequisite: Nil
Course Objectives
To provide a thorough understanding of the internals of Compiler Design.
Syllabus
Phases of compilation, Lexical analysis, Token Recognition, Syntax analysis, Bottom Up and
Top Down Parsers, Syntax directed translation schemes, Intermediate Code Generation, Triples
and Quadruples, Code Optimization, Code Generation.
Expected Outcome
The students will be able to
i. Explain the concepts and different phases of compilation with compile time error
handling.
ii. Represent language tokens using regular expressions, context free grammar and finite
automata and design lexical analyzer for a language.
iii. Compare top down with bottom up parsers, and develop appropriate parser to produce
parse tree representation of the input.
iv. Generate intermediate code for statements in high level language.
v. Design syntax directed translation schemes for a given context free grammar.
vi. Apply optimization techniques to intermediate code and generate machine code for high
level language program.
Text Books
1. Aho A. Ravi Sethi and D Ullman. Compilers – Principles Techniques and Tools, Addison
Wesley, 2006.
2. D. M.Dhamdhare, System Programming and Operating Systems,Tata McGraw Hill &
Company, 1996.
References
1. Kenneth C. Louden, Compiler Construction – Principles and Practice, Cengage Learning
Indian Edition, 2006.
2. Tremblay and Sorenson, The Theory and Practice of Compiler Writing, Tata McGraw
Hill & Company,1984.
Course Plan
End
Sem.
Module Contents Hours
Exam
Marks
Introduction to compilers – Analysis of the source program,
Phases of a compiler, Grouping of phases, compiler writing tools
– bootstrapping
07
I Lexical Analysis: 15%
The role of Lexical Analyzer, Input Buffering, Specification of
Tokens using Regular Expressions, Review of Finite Automata,
Recognition of Tokens.
Syntax Analysis:
Review of Context-Free Grammars – Derivation trees and Parse
II Trees, Ambiguity. 06 15%
Top-Down Parsing: Recursive Descent parsing, Predictive
parsing, LL(1) Grammars.
 FIRST INTERNAL EXAM
Bottom-Up Parsing:
Shift Reduce parsing – Operator precedence parsing (Concepts
III
only)
LR parsing – Constructing SLR parsing tables, Constructing, 07 15%
Canonical LR parsing tables and Constructing LALR parsing
tables.
Syntax directed translation:
Syntax directed definitions, Bottom- up evaluation of S-
IV
attributed definitions, L- attributed definitions, Top-down 08 15%
translation, Bottom-up evaluation of inherited attributes.
Type Checking :
Type systems, Specification of a simple type checker.
SECOND INTERNAL EXAM
Run-Time Environments:
Source Language issues, Storage organization, Storage-
allocation strategies.
V Intermediate Code Generation (ICG): 07 20%
Intermediate languages – Graphical representations, Three-
Address code, Quadruples, Triples. Assignment statements,
Boolean expressions.
Code Optimization:Principal sources of optimization,
Optimization of Basic blocks
VI Code generation: 07 20%
Issues in the design of a code generator. The target machine, A
simple code generator.
END SEMESTER EXAM

Question Paper Pattern

1. There will be five parts in the question paper – A, B, C, D, E
2. Part A
a. Total marks : 12 b.. Four questions each having 3 marks, uniformly covering modules I
and II; Allfour questions have to be answered.
3. Part B
a. Total marks : 18 b. Three questionseach having 9 marks, uniformly covering modules I
and II; Two questions have to be answered. Each question can have a maximum of three
subparts.
4. Part C
a. Total marks : 12 b. Four questions each having 3 marks, uniformly covering modules
III and IV; All four questions have to be answered.
5. Part D
a. Total marks : 18 b. Three questions each having 9 marks, uniformly covering modules
III and IV; Two questions have to be answered. Each question can have a maximum of three
subparts
6. Part E
b. Total Marks: 40 b. Six questions each carrying 10 marks, uniformly covering modules V
and VI; four questions have to be answered.
c. A question can have a maximum of three sub-parts.
7. There should be at least 60% analytical/numerical questions.
Course L-T-P - Year of
Course Name
code Credits Introduction
CS306 Computer Networks 3-0-0-3 2016
Prerequisite: Nil
Course Objectives
To build an understanding of the fundamental concepts of computer networking.
To introduce the basic taxonomy and terminology of computer networking.
To introduce advanced networking concepts.
Syllabus
Concept of layering, LAN technologies (Ethernet), Flow and error control techniques, switching,
IPv4/IPv6, routers and routing algorithms (distance vector, link state), TCP/UDP and sockets,
congestion control, Application layer protocols.
Expected Outcome
The students will be able to
i. Visualise the different aspects of networks, protocols and network design models.
ii. Examine various Data Link layer design issues and Data Link protocols.
iii. Analyse and compare different LAN protocols.
iv. Compare and select appropriate routing algorithms for a network.
v. Examine the important aspects and functions of network layer, transport layer and
application layer in internetworking.
Text Books
1. Andrew S. Tanenbaum, Computer Networks, 4/e, PHI.
2. Behrouz A. Forouzan, Data Communications and Networking, 4/e, Tata McGraw Hill.
3. Larry L. Peterson & Bruce S. Dave, Computer Networks-A Systems Approach, 5/e,
Morgan Kaufmann, 2011.
References
1. Fred Halsall, Computer Networking and the Internet, 5/e.
2. James F. Kurose, Keith W. Ross, Computer Networking: A Top-Down Approach, 6/e.
3. Keshav, An Engineering Approach to Computer Networks, Addison Wesley, 1998.
4. Request for Comments (RFC) Pages - IETF -https://www.ietf.org/rfc.html
5. W. Richard Stevens. TCP/IP Illustrated volume 1, Addison-Wesley, 2005.
6. William Stallings, Computer Networking with Internet Protocols, Prentice-Hall, 2004.

Course Plan
End
Sem.
Module Contents Hours
Exam
Marks
Introduction – Uses – Network Hardware – LAN –MAN – WAN,
Internetworks – Network Software – Protocol hierarchies – Design
I 07 15%
issues for the layers – Interface & Service – Service Primitives.
Reference models – OSI – TCP/IP.
Data Link layer Design Issues – Flow Control and ARQ
techniques. Data link Protocols – HDLC. DLL in Internet. MAC
II Sub layer – IEEE 802 FOR LANs & MANs, IEEE 802.3, 802.4, 08 15%
802.5. Bridges - Switches – High Speed LANs - Gigabit Ethernet.
Wireless LANs - 802.11 a/b/g/n, 802.15.PPP
FIRST INTERNAL EXAMINATION
 Network layer – Routing – Shortest path routing, Flooding, Distance
Vector Routing, Link State Routing, RIP, OSPF, Routing for mobile
III hosts. 07 15%

Congestion control algorithms – QoS. Internetworking – Network

IV layer in internet. IPv4 - IP Addressing – Classless and Classfull 07 15%
Addressing. Sub-netting.
SECOND INTERNAL EXAMINATION
Internet Control Protocols – ICMP, ARP, RARP, BOOTP. Internet
V Multicasting – IGMP, Exterior Routing Protocols – BGP. IPv6 – 07 20%
Addressing – Issues, ICMPv6.
Transport Layer – TCP & UDP. Application layer –FTP, DNS,
VI 07 20%
Electronic mail, MIME, SNMP. Introduction to World Wide Web.
END SEMESTER EXAM

Question Paper Pattern

1. There will be five parts in the question paper – A, B, C, D, E
2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules I and II;Allfour
questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules I and II; Two
questions have to be answered. Each question can have a maximum of three
subparts.
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules III and IV;
Allfour questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules III and IV;
Two questions have to be answered. Each question can have a maximum of three
subparts
6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI; four
questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/numerical questions.

 Course L-T-P- Year of
Course Name
code Credits Introduction

CS308 Software Engineering and Project Management 3-0-0-3 2016

Pre-requisite: Nil

Course Objectives
To introduce the fundamental concepts of software engineering.
To build an understanding on various phases of software development.
To introduce various software process models.

Syllabus
Introduction to software engineering, Software process models, Software development
phases, Requirement analysis, Planning, Design, Coding, Testing, Maintenance.

Expected Outcome
The students will be able to
i. Identify suitable life cycle models to be used.
ii. Analyze a problem and identify and define the computing requirements to the
problem.
iii. Translate a requirement specification to a design using an appropriate software
engineering methodology.
iv. Formulate appropriate testing strategy for the given software system.
v. Develop software projects based on current technology, by managing resources
economically and keeping ethical values.

References
1. Ian Sommerville, Software Engineering, University of Lancaster, Pearson
Education, Seventh edition, 2004.
2. K. K.Aggarwal and Yogesh Singh, Software Engineering, New age International
Publishers, Second edition, 2005.
3. Roger S. Pressman, Software Engineering : A practitioner’s approach, McGraw
Hill publication, Eighth edition, 2014
4. S.A. Kelkar, Software Project Management: A concise study, PHI, Third edition,
2012.
5. Walker Royce, Software Project Management : A unified frame work, Pearson
Education, 1998

COURSE PLAN

End
Sem.
Module Contents Hours
Exam
Marks

I Introduction to software engineering- scope of software 07 15%

 engineering – historical aspects, economic aspects,
maintenance aspects, specification and design aspects, team
programming aspects. Software engineering a layered
technology – processes, methods and tools. Software process
models – prototyping models, incremental models, spiral
model, waterfall model.

Process Framework Models: Capability maturity model

(CMM), ISO 9000. Phases in Software development –
II 06 15%
requirement analysis- requirements elicitation for software,
analysis principles, software prototyping, specification.

FIRST INTERNAL EXAM

Planning phase – project planning objective, software

scope, empirical estimation models- COCOMO, single
variable model, staffing and personal planning. Design
III 07 15%
phase – design process, principles, concepts, effective
modular design, top down, bottom up strategies, stepwise
refinement.

Coding – programming practice, verification, size

measures, complexity analysis, coding standards. Testing –
fundamentals, white box testing, control structure testing,
IV 07 15%
black box testing, basis path testing, code walk-throughs
and inspection, testing strategies-Issues, Unit testing,
integration testing, Validation testing, System testing.

SECOND INTERNAL EXAM

Maintenance-Overview of maintenance process, types of

maintenance. Risk management: software risks - risk
V 07 20%
identification-risk monitoring and management. Project
Management concept: People – Product-Process-Project.

Project scheduling and tracking: Basic concepts-relation

between people and effort-defining task set for the
software project-selecting software engineering task
VI Software configuration management: Basics and standards 08 20%
User interface design - rules. Computer aided software
engineering tools - CASE building blocks, taxonomy of
CASE tools, integrated CASE environment.

END SEMESTER EXAM

Question Paper Pattern

1. There will be five parts in the question paper – A, B, C, D, E
2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules I and II;
 Allfour questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules I and II; Two
questions have to be answered. Each question can have a maximum of three
subparts.
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules III and IV;
Allfour questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules III and IV; Two
questions have to be answered. Each question can have a maximum of three
subparts
6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI; four
questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/numerical questions.

Course code Course Name L-T-P - Credits Year of
Introduction
HS300 Principles of Management 3-0-0-3 2016
Prerequisite : Nil
Course Objectives
To develop ability to critically analyse and evaluate a variety of management practices in
the contemporary context;
To understand and apply a variety of management and organisational theories in practice;
To be able to mirror existing practices or to generate their own innovative management
competencies, required for today's complex and global workplace;
To be able to critically reflect on ethical theories and social responsibility ideologies to
create sustainable organisations.
Syllabus
Definition, roles and functions of a manager, management and its science and art perspectives,
management challenges and the concepts like, competitive advantage, entrepreneurship and
innovation. Early contributors and their contributions to the field of management. Corporate
Social Responsibility. Planning, Organizing, Staffing and HRD functions, Leading and
Controlling. Decision making under certainty, uncertainty and risk, creative process and
innovation involved in decision making.
Expected outcome.
A student who has undergone this course would be able to
i. manage people and organisations
ii. critically analyse and evaluate management theories and practices
iii. plan and make decisions for organisations
iv. do staffing and related HRD functions
Text Book:
Harold Koontz and Heinz Weihrich, Essentials of Management, McGraw Hill Companies, 10th
Edition.
References:
1. Daft, New era Management, 11th Edition, Cengage Learning
2. Griffin, Management Principles and Applications, 10th Edition, Cengage Learning
3. Heinz Weirich, Mark V Cannice and Harold Koontz, Management: a Global,
Innovative and Entrepreneurial Perspective, McGraw Hill Education, 14th Edition
4. Peter F Drucker, The Practice of Management, McGraw Hill, New York
5. Robbins and Coulter, Management, 13th Edition, 2016, Pearson Education
Course Plan
Sem. Exam
Module Contents Hours
Marks

Introduction to Management: definitions, managerial roles and

functions; Science or Art perspectives- External environment-
I global, innovative and entrepreneurial perspectives of
Management (3 Hrs.)– Managing people and organizations in 6
the context of New Era- Managing for competitive advantage -
the Challenges of Management (3 Hrs.) 15%
 Early Contributions and Ethics in Management: Scientific
Management- contributions of Taylor, Gilbreths, Human
Relations approach-contributions of Mayo, McGregor's
II Theory, Ouchi's Theory Z (3 Hrs.) Systems Approach, the
Contingency Approach, the Mckinsey 7-S Framework
Corporate Social responsibility- Managerial Ethics. (3 Hrs)
6 15%
FIRST INTERNAL EXAMINATION

Planning: Nature and importance of planning, -types of plans

III
(3 Hrs.)- Steps in planning, Levels of planning - The Planning 6 15%
Process. – MBO (3 Hrs.).
Organising for decision making: Nature of organizing,
organization levels and span of control in management
Organisational design and structure –departmentation, line and
IV staff concepts (3 Hrs.) Limitations of decision making-
Evaluation and selecting from alternatives- programmed and 6 15%
non programmed decisions - decision under certainty,
uncertainty and risk-creative process and innovation (3 Hrs.)
SECOND INTERNAL EXAMINATION
Staffing and related HRD Functions: definition,
Empowerment, staff – delegation, decentralization and
recentralisation of authority – Effective Organizing and
culture-responsive organizations –Global and entrepreneurial
V
organizing (3 Hrs.) Manager inventory chart-matching person 9 20%
with the job-system approach to selection (3 Hrs.) Job design-
skills and personal characteristics needed in managers-
selection process, techniques and instruments (3 Hrs.)
Leading and Controlling: Leading Vs Managing – Trait
approach and Contingency approaches to leadership -
Dimensions of Leadership (3 Hrs.) - Leadership Behavior and
styles – Transactional and Transformational Leadership (3
VI
Hrs.) Basic control process- control as a feedback system – 9 20%
Feed Forward Control – Requirements for effective control –
control techniques – Overall controls and preventive controls –
Global controlling (3 Hrs.)
END SEMESTER EXAM
Question Paper Pattern
Max. marks: 100, Time: 3 hours .
The question paper shall consist of three parts

Part A: 4 questions uniformly covering modules I and II. Each question carries 10 marks
Students will have to answer any three questions out of 4 (3X10 marks =30 marks)
Part B : 4 questions uniformly covering modules III and IV. Each question carries 10 marks
Students will have to answer any three questions out of 4 (3X10 marks =30 marks)
Part C: 6 questions uniformly covering modules V and VI. Each question carries 10 marks
Students will have to answer any four questions out of 6 (4X10 marks =40 marks)

Note: In all parts, each question can have a maximum of four sub questions, if needed.
Course L-T-P- Year of
Course Name
code Credits Introduction

CS362 Computer Vision 3-0-0-3 2016

Pre-requisite: NIL

Course Objectives
To build an understanding on detailed models of image formation.
To expose the students to image feature detection and matching.
To introduce fundamental algorithms for pattern recognition.
To introduce various classification techniques.
To expose the students to various structural pattern recognition and feature extraction
techniques.

Syllabus
Image formation and Image model with Components of a vision system, Multiple images and
the Geometry of multiple views, High level vision, Basics of pattern recognition, Linear
discriminant based classifiers and tree classifiers, Unsupervised Methods, Recent Advances in
Pattern Recognition.

Expected Outcome
The students will be able to
i. Appreciate the detailed models of image formation.
ii. Analyse the techniques for image feature detection and matching.
iii. Apply various algorithms for pattern recognition.
iv. Examine various clustering algorithms.
v. Analyze structural pattern recognition and feature extraction techniques.

Text Books:
1. Bernd Jahne and Horst HauBecker, Computer vision and Applications, Academic
press, 2000.
2. David A. Forsyth & Jean Ponce, Computer vision – A Modern Approach, Prentice
Hall, 2002.

References
1. C. M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006.
2. R. O. Duda, P. E. Hart and D. G. Stork, Pattern Classification, John Wiley, 2001.
3. Richard Hartley and Andrew Zisserman, Multiple View Geometry in Computer
Vision, Second Edition, Cambridge University Press, 2004.
4. S. Theodoridis and K. Koutroumbas, Pattern Recognition, 4th Ed., Academic Press,
2009.

COURSE PLAN

End
Sem.
Module Contents Hours
Exam
Marks
 Image formation and Image model- Components of a vision
system- Cameras- camera model and camera calibration-
I 06 15%
Radiometry- Light in space- Light in surface - Sources,
shadows and shading.

Multiple images-The Geometry of multiple views- Stereopsis-

Affine structure from motion- Elements of Affine Geometry
II Affine structure and motion from two images- Affine 07 15%
structure and motion from multiple images- From Affine to
Euclidean images.

FIRST INTERNAL EXAM

High level vision- Geometric methods- Model based vision-

III 07 15%
Obtaining hypothesis by pose consistency, pose clustering and
using Invariants, Verification.

Introduction to pattern and classification, supervised and

unsupervised learning, Clustering Vs classification, Bayesian
Decision Theory- Minimum error rate classification
IV 07 15%
Classifiers, discriminant functions, decision surfaces- The
normal density and discriminant-functions for the Normal
density.

SECOND INTERNAL EXAM

Linear discriminant based classifiers and tree classifiers

Linear discriminant function based classifiers- Perceptron-
V 07 20%
Minimum Mean Squared Error (MME) method, Support
Vector machine, Decision Trees: CART, ID3.

Unsupervised Methods Basics of Clustering; similarity /

dissimilarity measures; clustering criteria. Different distance
functions and similarity measures, K-means algorithm.
VI 08 20%
Recent Advances in Pattern Recognition Neural network
structures for pattern recognition, Pattern classification using
Genetic Algorithms.

END SEMESTER EXAM

Question Paper Pattern

1. There will be five parts in the question paper – A, B, C, D, E
2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules I and II;
Allfour questions have to be answered.
3. Part B
a. Total marks : 18
b. Threequestions each having 9 marks, uniformly covering modules I and II;
 Two questions have to be answered. Each question can have a maximum of
three subparts.
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules III and IV;
Allfour questions have to be answered.
5. Part D
a. Total marks : 18
b. Threequestions each having 9 marks, uniformly covering modules III and IV;
Two questions have to be answered. Each question can have a maximum of
three subparts
6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI;
four questions have to be answered.
c. A question can have a maximum of three sub-parts.

7. There should be at least 60% analytical/numerical questions.

 Course L-T-P - Year of
Course Name
code Credits Introduction
CS364 Mobile Computing 3-0-0-3 2016
Pre-requisite: CS307 Data Communication
Course Objectives
To impart basic understanding of the wireless communication systems.
To expose students to various aspects of mobile and ad-hoc networks.
Syllabus
Mobile Computing Application and Services, Mobile Computing Architecture, Emerging
Technologies, Intelligent Networks and Internet, Wireless LAN, MAC layer routing, Mobile
transport layer Security Issues in mobile computing.
Expected Outcome
Student is able to
1. Explain various Mobile Computing application, services and architecture.
2. Understand various technology trends for next generation cellular wireless networks.
3. Describe protocol architecture of WLAN technology.
4. Understand Security Issues in mobile computing.
Text Books
1. Asoke K. Talukder, Hasan Ahmad, Mobile Computing Technology- Application and
Service Creation, 2nd Edition, McGraw Hill Education.
2. Jochen Schiller, Mobile Communications, Pearson Education Asia, 2008.
3. Jonathan Rodriguez , Fundamentals of 5G Mobile Networks, ,Wiley Publishers, 2015
4. Theodore S. Rappaport, Wireless Communications Principles and Practice, 2/e, PHI, New
Delhi, 2004.
References
1. Andrew S. Tanenbaum, Computer Networks, PHI, Third edition, 2003.
Course Plan
End
Sem.
Module Contents Hours
Exam
Marks
Introduction to mobile computing, Middleware and Gateways,
Application and services, Internet-Ubiquitous networks,
I 06 15%
Architecture and three-tier architecture for Mobile Computing,
Design consideration for Mobile Computing.
Spread spectrum – Direct sequence, Frequency hoping. Medium
Access Control - SDMA, FDMA, TDMA, CDMA, Cellular
concepts- channel assignment strategy- hand off strategy interface
and system capacity- improving coverage and capacity in cellular
II 06 15%
system, Satellite Systems-GEO, LEO, MEO. Wireless
Communication Systems- Telecommunication Systems- GSM-
GSM services & features, architecture -DECT features &
characteristics, architecture.
FIRST INTERNAL EXAM
Wireless LANS: Wireless LAN Standards – IEEE 802 Protocol
Architecture, IEEE 802.11 System Architecture, Protocol
III Architecture & Services, Cellular Networks: Channel allocation, 07 15%
multiple access, location management, Handoffs.
MAC Layer & Management, Routing - Classification of Routing
 Algorithms, Algorithms such as DSR, AODV, DSDV, Mobile
Agents, Service Discovery.
Mobile internet-mobile network layer-mobile IP-dynamic host
configuration protocol-, mobile transport layer-implications of TCP
IV on mobility-indirect TCP-snooping TCP- mobile TCP transmission- 07 15%
selective retransmission, Transaction oriented TCP- Support for
mobility-file systems-WAP.
SECOND INTERNAL EXAM
Mobile Transport Layer - Conventional TCP/IP Protocols, Indirect
TCP, Snooping TCP, Mobile TCP, Other Transport Layer Protocols
for Mobile Networks.
V 08 20%
Protocols and Platforms for Mobile Computing - WAP, Bluetooth,
XML, J2ME, JavaCard, PalmOS, Linux for Mobile Devices,
Android.
Security issues in mobile computing, Information Security,
Components of Information Security, Next Generation Networks-
VI LTE – Architecture & Interface – LTE radio planning and tools, 5G 08 20%
architecture, MIMO, Super core concept, Features and Application
Case Study – Setting up anadhoc network system, LiFi.
END SEMESTER EXAM

Question Paper Pattern

1. There will be five parts in the question paper – A, B, C, D, E

2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules I and II;
Allfour questions have to be answered.
3. Part B
a. Total marks : 18
b. Threequestions each having 9 marks, uniformly covering modules I and II;
Two questions have to be answered. Each question can have a maximum of
three subparts.
4. Part C
a. Total marks : 12
b. Fourquestions each having 3 marks, uniformly covering modules III and IV;
Allfour questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules III and IV;
Two questions have to be answered. Each question can have a maximum of
three subparts
6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI;
four questions have to be answered.
c. A question can have a maximum of three sub-parts.
 Course L-T-P Year of
Course Name
code Credits Introduction
CS366 Natural language processing 3-0-0-3 2016
Prerequisite: Nil
Course Objectives
To introduce the fundamentals of Language processing from the algorithmic viewpoint.
To discuss various issues those make natural language processing a hard task.
To discuss some applications of Natural Language Processing (NLP).
Syllabus
Levels of Language Analysis, Syntax, Semantics and Pragmatics of Natural Language, Language
Processing, Issues and approaches to solutions, Applications of Natural Language Processing
(NLP).
Expected Outcome
The student able to
1. appreciate the fundamental concepts of Natural Language Processing.
2. design algorithms for NLP tasks.
3. develop useful systems for language processing and related tasks involving text
processing.
Text Books
1. D. Jurafsky and J. H. Martin, Speech and Language Processing, Prentice Hall India, 2000
2. James Allen, Natural Language Understanding, 2e, The Benjamin/Cummings Publishing
Company Inc., Redwood City, CA.
References
1. Charniak, Eugene, Introduction to Artificial intelligence, Addison-Wesley, 1985..
2. Ricardo Baeza-Yates and Berthier Ribeiro-Neto, Modern Information Retrieval,
Addison-Wesley,1999.
3. U. S. Tiwary and Tanveer Siddiqui, Natural Language Processing and Information
Retrieval, Oxford University Press, 2008.
Course Plan
End
Sem.
Module Contents Hours
Exam
Marks
Introduction to Natural Language Understanding- Levels of
I language analysis- Syntax, Semantics, Pragmatics. 8 15%
Linguistic Background- An Outline of English Syntax.
Lexicons, POS Tagging, Word Senses.
II Grammars and Parsing- Features, Agreement and Augmented 7 15%
Grammars.
FIRST INTERNAL EXAM
Grammars for Natural Language, Parsing methods and Efficient
Parsing.
III 9 15%
Ambiguity Resolution- Statistical Methods. Probabilistic Context
Free Grammar.
Semantics and Logical Form: Linking Syntax and Semantics-
IV Ambiguity Resolution- other Strategies for Semantic Interpretation- 6 15%
Scoping and the Interpretation of Noun Phrases.
SECOND INTERNAL EXAM
V Knowledge Representation and Reasoning- Local Discourse 8 20%
 Context and Reference- Using World Knowledge- Discourse
Structure- Defining a Conversational Agent.
Applications- Machine Translation, Information Retrieval and
VI 4 20%
Extraction, Text Categorization and Summarization.
END SEMESTER EXAM

Question Paper Pattern

1. There will be five parts in the question paper – A, B, C, D, E
2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules I and II; Allfour
questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules I and II; Two
questions have to be answered. Each question can have a maximum of three
subparts.
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules III and IV;
Allfour questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules III and IV;
Two questions have to be answered. Each question can have a maximum of three
subparts.
6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI; four
questions have to be answered.
c. A question can have a maximum of three sub-parts.
 Course L-T-P - Year of
Course Name
code Credits Introduction
CS368 Web Technologies 3-0-0-3 2016
Prerequisite: Nil
Course Objectives
To impart the design, development and implementation of Dynamic Web Pages.
To develop programs for Web using Scripting Languages.
To give an introduction to Data Interchange formats in Web.
Syllabus
Basics of Internet and World Wide Web, HTML and XHTML, Cascading Style Sheets,
Frameworks, Basics of JavaScript, JQuery, Introduction to XML and JSON, Overview of PHP
Expected Outcome
The student will be able to
i. Understand different components in web technology and to know about CGI and CMS.
ii. Develop interactive Web pages using HTML/XHTML.
iii. Present a professional document using Cascaded Style Sheets.
iv. Construct websites for user interactions using JavaScript and JQuery.
v. Know the different information interchange formats like XML and JSON.
vi. Develop Web applications using PHP.
Text Books
1. P. J. Deitel, H.M. Deitel, Internet &World Wide Web How To Program, 4/e, Pearson
International Edition 2010.
2. Robert W Sebesta, Programming the World Wide Web, 7/e, Pearson Education Inc., 2014.
References
1. Bear Bibeault and Yehuda Katz, jQuery in Action, Second Edition, Manning
Publications.[Chapter 1]
Black Book, Kogent Learning Solutions Inc. 2009.
2. Bob Boiko, Content Management Bible, 2nd Edition, Wiley Publishers. [Chapter 1, 2]
3. Chris Bates, Web Programming Building Internet Applications, 3/e, Wiley India Edition
2009.
4. Dream Tech, Web Technologies: HTML, JS, PHP, Java, JSP, ASP.NET, XML, AJAX,
5. Jeffrey C Jackson, Web Technologies A Computer Science Perspective, Pearson
Education Inc. 2009.
6. Lindsay Bassett, Introduction to JavaScript Object Notation: A To-the-Point Guide to
JSON 1st Edition, O’Reilly.[Chapter 1,2,3,4]
7. Matthew MacDonald, WordPress: The Missing Manual, 2nd Edition, O'Reilly Media.
[Chapter 1]
Web Resources
1. www.w3.org/CGI/
2. old.tree.ro/en/strategy-white-papers/content-management-systems.pdf
3. httpd.apache.org/download.cgi
4. https://alistapart.com/article/frameworks
5. http://getbootstrap.com/css/
6. https://www.w3.org/TR/WD-DOM/introduction.html
Course Plan
End
Sem.
Module Contents Hours
Exam
Marks
 Introduction to the Internet: The World Wide Web, Web Browsers,
Web Servers, Uniform Resource Locators, Multipurpose Internet
I Mail Extensions, The Hypertext Transfer Protocol. Common 06 15%
Gateway Interface(CGI), Content Management System – Basics
Case Study: Apache Server, WordPress.
Introduction to HTML/XHTML : Origins and Evolution of HTML
and XHTML, Basic Syntax of HTML, Standard HTML Document
II Structure, Basic Text Markup, Images, Hypertext Links, 07 15%
Lists, Tables, Forms, HTML5, Syntactic Differences between HTML
and XHTML.
FIRST INTERNAL EXAM
Introduction to Styles sheets and Frameworks
Cascading Style Sheets: Levels of Style Sheets - Style
Specification Formats, Selector Forms, Property-Value
III Forms, Font Properties, List Properties, Alignment of Text, Color, 06 15%
The Box Model, Background Images, The span and div Tags.
Frameworks: Overview and Basics of Responsive CSS Frameworks
- Bootstrap.
Introduction to JavaScript and jQuery
The Basics of JavaScript: Overview of JavaScript, Object
Orientation and JavaScript, General Syntactic Characteristics-
Primitives, Operations, and Expressions, Screen Output and
IV 07 15%
Keyboard Input, Control Statements, Object Creation and
Modification,Arrays, Functions. Callback Functions, Java
Script HTML DOM.
Introduction to jQuery: Overview and Basics.
SECOND INTERNAL EXAMINATION
Introduction to Data Interchange Formats
XML: The Syntax of XML, XML Document Structure, Namespaces,
XML Schemas, Displaying Raw XML Documents, Displaying XML
V 08 20%
Documents with CSS, XSLT Style Sheets, XML Applications.
JSON(Basics Only): Overview, Syntax, Datatypes, Objects, Schema,
Comparison with XML.
Introduction to PHP: Origins and Uses of PHP, Overview of PHP -
General Syntactic Characteristics - Primitives, Operations, and
VI 08 20%
Expressions - Control Statements, Arrays, Functions, Pattern
Matching, Form Handling, Cookies, Session Tracking.
END SEMESTER EXAM

Assignment:
It is highly recommended to give assignment based on:
1. JavaScript Frameworks (like AngularJS or/and NodeJS)
2. Any PHP web app based on frameworks(like Laravel, CodeIgniter, CakePHP, Zend
etc.)
 Question Paper Pattern
1. There will be five parts in the question paper – A, B, C, D, E
2. Part A
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules I and II; All
four questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules I and II; Two
questions have to be answered. Each question can have a maximum of three
subparts.
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules III and IV; All
four questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules III and IV;
Two questions have to be answered. Each question can have a maximum of three
subparts
6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI; four
questions have to be answered.
c. A question can have a maximum of three sub-parts.
 Course L-T-P - Year of
Course Name
code. Credits Introduction
CS372 HIGH PERFORMANCE COMPUTING 3-0-0-3 2016
Pre-requisites : CS202 Computer Organization and Architecture
Course Objectives
To introduce the concepts of Modern Processors.
To introduce Optimization techniques for serial code.
To introduce Parallel Computing Paradigms.
To introduce Parallel Programming using OpenMP and MPI.
Syllabus
Modern processors - pipelining-superscalarity-multicore processors- Mutithreaded processors-
vector processors- basic optimization techniques for serial code - taxonomy of parallel computing
paradigms- shared memory computers- distributed-memory computers- Hierarchical Systems-
networks- basics of parallelization - data parallelism - function parallelism- Parallel scalability-
shared memory parallel programming with OpenMp - Distributed-memory parallel programming
with MPI.
Expected Outcome
The students will be able to
i. appreciate the concepts used in Modern Processors for increasing the performance.
ii. appreciate Optimization techniques for serial code.
iii. appreciate Parallel Computing Paradigms.
iv. identify the performance issues in Parallel Programming using OpenMP and MPI.
Text Book
1. Georg Hager, Gerhard Wellein, Introduction to High Performance Computing for
Scientists and Engineers, Chapman & Hall / CRC Computational Science series, 2011.
References
1. Charles Severance, Kevin Dowd, High Performance Computing, O'Reilly Media, 2nd
Edition, 1998.
2. Kai Hwang, Faye Alaye Briggs, Computer Architecture and Parallel Processing, McGraw
Hill, 1984.
Course Plan
End
Sem.
Module Contents Hours
Exam
Marks
Modern Processors : Stored Program Computer Architecture-
General purpose cache- based microprocessor-Performance based
metrics and benchmarks- Moore's Law- Pipelining- Superscalarity-
I SIMD- Memory Hierarchies Cache- mapping- prefetch- Multicore 07 15%
processors- Mutithreaded processors- Vector Processors- Design
Principles- Maximum performance estimates- Programming for
vector architecture.
 Basic optimization techniques for serial code : scalar profiling-
function and line based runtime profiling- hardware performance
counters- common sense optimizations- simple measures, large
impact- elimination of common subexpressions- avoiding branches-
using simd instruction sets- the role of compilers - general
II optimization options- inlining - aliasing- computational accuracy- 07 15%
register optimizations- using compiler logs- c++ optimizations -
temporaries- dynamic memory management- loop kernels and
iterators data access optimization: balance analysis and light speed
estimates- storage order- case study: jacobi algorithm and dense
matrix transpose.
FIRST INTERNAL EXAM
Parallel Computers : Taxonomy of parallel computing paradigms-
Shared memory computers- Cache coherance- UMA - ccNUMA-
Distributed-memory computers- Hierarchical systems- Networks-
Basic performance characteristics- Buses- Switched and fat- tree
networks- Mesh networks- Hybrids - Basics of parallelization -
III Why parallelize - Data Parallelism - Function Parallelism- Parallel 07 15%
Scalability- Factors that limit parallel execution- Scalability
metrics- Simple scalability laws- parallel efficiency - serial
performance Vs Strong scalability- Refined performance models-
Choosing the right scaling baseline- Case Study: Can slow
processors compute faster- Load balance.
Distributed memory parallel programming with MPI : message
passing - introduction to MPI – example - messages and point-to-
point communication - collective communication – nonblocking
IV 08 15%
point-to-point communication- virtual topologies - MPI
parallelization of Jacobi solver- MPI implementation - performance
properties
SECOND INTERNAL EXAM
Shared memory parallel programming with OpenMp : introduction
to OpenMp - parallel execution - data scoping- OpenMp work
sharing for loops- synchronization - reductions - loop scheduling -
V tasking - case study: OpenMp- parallel jacobi algorithm- advanced 08 20%
OpenMpwavefront parallelization- Efficient OpenMP
programming: Profiling OpenMP programs - Performance pitfalls-
Case study: Parallel Sparse matrix-vector multiply.
Efficient MPI programming : MPI performance tools-
communication parameters- Synchronization, serialization,
contention- Reducing communication overhead- optimal domain
VI 08 20%
decomposition- Aggregating messages – Nonblocking Vs
Asynchronous communication- Collective communication-
Understanding intra-node point-to-point communication.
END SEMESTER EXAM

Question Paper Pattern

1. There will be five parts in the question paper – A, B, C, D, E
2. Part A
a. Total marks : 12
 b. Four questions each having 3 marks, uniformly covering modules I and II;
Allfour questions have to be answered.
3. Part B
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules I and II; Two
questions have to be answered. Each question can have a maximum of three
subparts.
4. Part C
a. Total marks : 12
b. Four questions each having 3 marks, uniformly covering modules III and IV;
Allfour questions have to be answered.
5. Part D
a. Total marks : 18
b. Three questions each having 9 marks, uniformly covering modules III and IV;
Two questions have to be answered. Each question can have a maximum of three
subparts
6. Part E
a. Total Marks: 40
b. Six questions each carrying 10 marks, uniformly covering modules V and VI; four
questions have to be answered.
c. A question can have a maximum of three sub-parts.
7. There should be at least 60% analytical/numerical questions.
 Course L-T-P- Year of
Course Name
code Credits Introduction
CS332 MICROPROCESSOR LAB 0-0-3-1 2016
Pre-requisite: CS305 Microprocessors and Microcontrollers
Course Objectives
To practice assembly language programming on 8086.
To practice fundamentals of interfacing/programming various peripheral devices with
microprocessor/microcontroller.
List of Exercises/ Experiments: (Minimum 12 Exercises/ Experiments are mandatory. Exercises/
Experiments marked with * are mandatory)
I. Assembly Language Programming Exercises/Experiments using 8086 Trainer kit

1. Implementation of simple decimal arithmetic and bit manipulation operations.*

2. Implementation of code conversion between BCD, Binary, Hexadecimal and ASCII.
3. Implementation of searching and sorting of 16-bit numbers.
4. Programming exercises using stack and subroutines.*
II. Exercises/Experiments using MASM (PC Required)
5. Study of Assembler and Debugging commands.
6. Implementation of decimal arithmetic( 16 and 32 bit) operations.*
7. Implementation of String manipulations.*
8. Implementation of searching and sorting of 16-bit numbers.
9. Implementation of Matrix operations like addition, transpose, multiplication etc.
III. Interfacing Exercises/Experiments with 8086 trainer kit through Assembly Language
Programming
10. Interfacing with stepper motor - Rotate through any given sequence.*
11. Interfacing with 8255 (mode0 and mode1 only).*
12. Interfacing with 8279 (Rolling message, 2 key lock out and N-key roll over
implementation).*
13. Interfacing with 8253/54 Timer/Counter.
14. Interfacing with Digital-to-Analog Converter.*
15. Interfacing with Analog-to- Digital Converter.
16. Interfacing with 8259 Interrupt Controller.
IV. Exercises/Experiments using 8051 trainer kit
17. Familiarization of 8051 trainer kit by executing simple Assembly Language programs such
as decimal arithmetic and bit manipulation.*
18. Implementation of Timer programming (in mode1).
19. Implementation of stepper motor interfacing, ADC/DAC interfacing and sensor interfacing
with 8251 through Assembly Language programming.
Expected Outcome
The students will be able to
i. Develop assembly language programs for problem solving using software interrupts and
various assembler directives.
ii. Implement interfacing of various I/O devices to the microprocessor/microcontroller
through assembly language programming.
 B-Tech CSE S5& S6 Syllabus & Course Plan

Course L-T-P- Year of

Course Name
code Credits Introduction
CS334 Network Programming Lab 0-0-3-1 2016
Pre-requisite: CS307 Data Communication
Course Objectives
To introduce Network related commands and configuration files in Linux Operating System.
To introduce tools for Network Traffic Analysis and Network Monitoring.
To practice Network Programming using Linux System Calls.
To design and deploy Computer Networks.
List of Exercises/ Experiments (12 Exercises/ Experiments are to be completed . Exercises/
Experiments marked with * are mandatory)
1. Getting started with Basics of Network configurations files and Networking Commands in Linux.
2. To familiarize and understand the use and functioning of System Calls used for Operating system
and network programming in Linux.
3. Familiarization and implementation of programs related to Process and thread.
4. Implement the First Readers-Writers Problem.
5. Implement the Second Readers-Writers problem.
6. Implement programs for Inter Process Communication using PIPE, Message Queue and Shared
Memory.
7. Implement Client-Server communication using Socket Programming and TCP as transport layer
protocol.*
8. Implement Client-Server communication using Socket Programming and UDP as transport layer
protocol.*
9. Implement a multi user chat server using TCP as transport layer protocol.*
10. Implement Concurrent Time Server application using UDP to execute the program at remoteserver.
Client sends a time request to the server, server sends its system time back to the client. Client
displays the result.*
11. Implement and simulate algorithm for Distance vector routing protocol.
12. Implement and simulate algorithm for Link state routing protocol.
13. Implement Simple Mail Transfer Protocol.*
14. Develop concurrent file server which will provide the file requested by client if it exists. If not server
sends appropriate message to the client. Server should also send its process ID (PID) to clients for
display along with file or the message.*
15. Using Wireshark observe data transferred in client server communication using UDP and identify
the UDP datagram.
16. Using Wireshark observe Three Way Handshaking Connection Establishment, Data Transfer and
Three Way Handshaking Connection Termination in client server communication using TCP.
17. Develop a packet capturing and filtering application using raw sockets.
18. Design and configure a network with multiple subnets with wired and wireless LANs using required
network devices. Configure the following services in the network- TELNET, SSH, FTP server, Web
server, File server, DHCP server and DNS server.*
19. Install network simulator NS-2 in any of the Linux operating system and simulate wired and wireless
scenarios.
Expected Outcome
The students will be able to
1. Use network related commands and configuration files in Linux Operating System.
2. Develop operating system and network application programs.
3. Analyze network traffic using network monitoring tools.
Course code Course Name L-T-P - Credits Year of
Introduction
**341 DESIGN PROJECT 0-1-2-2 2016
Prerequisite : Nil
Course Objectives
To understand the engineering aspects of design with reference to simple products
To foster innovation in design of products, processes or systems
To develop design that add value to products and solve technical problems
Course Plan
Study :Take minimum three simple products, processes or techniques in the area of specialisation,
study, analyse and present them. The analysis shall be focused on functionality, strength, material,
manufacture/construction, quality, reliability, aesthetics, ergonomics, safety, maintenance,
handling, sustainability, cost etc. whichever are applicable. Each student in the group has to
present individually; choosing different products, processes or techniques.

Design: The project team shall identify an innovative product, process or technology and proceed
with detailed design. At the end, the team has to document it properly and present and defend it.
The design is expected to concentrate on functionality, design for strength is not expected.

Note : The one hour/week allotted for tutorial shall be used for discussions and presentations. The
project team (not exceeding four) can be students from different branches, if the design problem is
multidisciplinary.
Expected outcome.
The students will be able to
i. Think innovatively on the development of components, products, processes or
technologies in the engineering field
ii. Analyse the problem requirements and arrive workable design solutions

Reference:
Michael Luchs, Scott Swan, Abbie Griffin, 2015. Design Thinking. 405 pages, John
Wiley & Sons, Inc

Evaluation
First evaluation ( Immediately after first internal examination ) 20 marks
Second evaluation ( Immediately after second internal examination) 20 marks
Final evaluation ( Last week of the semester) 60 marks

Note: All the three evaluations are mandatory for course completion and for awarding the final
grade.
Course code Course Name L-T-P - Credits Year of
Introduction
**352 Comprehensive Examination 0-1-1-2 2016
Prerequisite : Nil
Course Objectives
To assess the comprehensive knowledge gained in basic courses relevant to the branch of
study
To comprehend the questions asked and answer them with confidence.
Assessment

Oral examination – To be conducted by the college (@ three students/hour) covering all the
courses up to and including V semester– 50 marks
Written examination - To be conducted by the Dept. on the date announced by the University–
common to all students of the same branch – objective type ( 1 hour duration)– 50 multiple choice
questions ( 4 choices) of 1 mark each covering the six common courses of S1&S2 and six branch
specific courses listed – questions are set by the University - no negative marks – 50 marks.

Note: Both oral and written examinations are mandatory. But separate minimum marks is not
insisted for pass. If a students does not complete any of the two assessments, grade I shall be
awarded and the final grade shall be given only after the completion of both the assessments.
The two hours allotted for the course may be used by the students for discussion, practice and for
oral assessment.
Expected outcome.
The students will be confident in discussing the fundamental aspects of any engineering
problem/situation and give answers in dealing with them
Course code Course Name L-T-P - Credits Year of
Introduction
**451 Seminar and Project Preliminary 0-1-4-2 2016
Prerequisite : Nil
Course Objectives
To develop skills in doing literature survey, technical presentation and report preparation.
To enable project identification and execution of preliminary works on final semester
project
Course Plan
Seminar: Each student shall identify a topic of current relevance in his/her branch of engineering,
get approval of faculty concerned, collect sufficient literature on the topic, study it thoroughly,
prepare own report and present in the class.
Project preliminary:
Identify suitable project relevant to the branch of study. Form project team ( not exceeding four
students). The students can do the project individually also. Identify a project supervisor. Present
the project proposal before the assessment board (excluding the external expert) and get it
approved by the board.
The preliminary work to be completed: (1) Literature survey (2) Formulation of objectives (3)
Formulation of hypothesis/design/methodology (4) Formulation of work plan (5) Seeking funds
(6) Preparation of preliminary report
Note: The same project should be continued in the eighth semester by the same project team.
Expected outcome.
The students will be able to
i. Analyse a current topic of professional interest and present it before an audience
ii. Identify an engineering problem, analyse it and propose a work plan to solve it.

Evaluation
Seminar : 50 marks
(Distribution of marks for the seminar is as follows: i. Presentation : 40% ii. Ability to answer
questions : 30% & iii. Report : 30%)
Project preliminary : 50 marks( Progress evaluation by the supervisor : 40% and
progress evaluation by the assessment board excluding external expert : 60%. Two progress
evaluations, mid semester and end semester, are mandatory.)

Note: All evaluations are mandatory for course completion and for awarding the final grade.
Course code Course Name Credits Year of
Introduction
**492 PROJECT 6 2016
Prerequisite : Nil
Course Objectives
To apply engineering knowledge in practical problem solving
To foster innovation in design of products, processes or systems
To develop creative thinking in finding viable solutions to engineering problems
Course Plan
In depth study of the topic assigned in the light of the preliminary report prepared in the seventh
semester
Review and finalization of the approach to the problem relating to the assigned topic
Preparing a detailed action plan for conducting the investigation, including team work
Detailed Analysis/Modelling/Simulation/Design/Problem Solving/Experiment as needed
Final development of product/process, testing, results, conclusions and future directions
Preparing a paper for Conference presentation/Publication in Journals, if possible
Preparing a report in the standard format for being evaluated by the dept. assessment board
Final project presentation and viva voce by the assessment board including external expert
Expected outcome
The students will be able to
iii. Think innovatively on the development of components, products, processes or
technologies in the engineering field
iv. Apply knowledge gained in solving real life engineering problems

Evaluation
Maximum Marks : 100
(i) Two progress assessments 20% by the faculty supervisor(s)
(ii) Final project report 30% by the assessment board
(iii) Project presentation and viva voce 50% by the assessment board

Note: All the three evaluations are mandatory for course completion and for awarding the final
grade.