M S Ramaiah Institute of
Technology
Department
of
Computer
Science and
Engineering
August 13
2013
Scheme and Syllabi for batch
2011-15
V & VI semester
CSE-11/15
M.S. Ramaiah Institute of Technology, Bangalore - 54
(Autonomous Institute, Affiliated to VTU)
Department of Computer Science and Engineering
Programme Educational Objectives (PEOs)
A B.E. (Computer Science & Engineering) graduate of M S Ramaiah Institute of Technology should,
within three to five years of graduation
1. Pursue a successful career in the field of Computer Science & Engineering or a related field utilizing
his/her education and contribute to the profession as an excellent employee, or as an entrepreneur
2. Be aware of the developments in the field of Computer Science & Engineering, continuously
enhance their knowledge informally or by pursuing graduate studies
3. Engage in research and inquiry leading to new innovations and products
4. Be able to work effectively in multidisciplinary and multicultural environments
5.
Be responsible members and leaders of their communities, understand the human, social and
environmental context of their profession and contribute positively to the needs of individuals and
society at large
Programme Outcomes
The programme leading to the degree of Bachelor of Engineering in Computer Science & Engineering
aims to provide students with a strong theoretical and practical background in computer hardware and
software. A graduate engineer with a B.E. (CSE) degree must attain the engineering analysis, design, and
implementation skills necessary to work in both hardware and software domains.
The outcomes of the Bachelor of Engineering in Computer Science & Engineering Programme are as
follows:
A B.E. (Computer Science & Engineering) graduate must demonstrate
PO 1.
An ability to apply knowledge of mathematics, science, and engineering as it applies to
Computer Science & Engineering to solve engineering problems.
PO 2. An ability to use research methods to design and conduct experiments to investigate complex
problems, as well as to analyze and interpret data
PO 3. An ability to design a system, component, or process to meet the desired economic, social, and
environmental needs with appropriate consideration for public health and safety.
PO 4.
An ability to function effectively individually and in team, and in multi-disciplinary
environment.
PO 5. An ability to identify, formulate, study, analyze and solve problems using the first principles of
mathematics and natural sciences as well as computer science & engineering techniques.
PO 6.
An understanding of professional and ethical responsibilities in professional engineering
practice.
PO 7. An ability to communicate effectively.
PO 8.
The broad education necessary to understand the impact of engineering solutions in an
environmental and societal context.
PO 9. Recognition of the need for, and an ability to engage in life-long learning.
PO 10. An ability to create and use the techniques, algorithms, models and processes, and modern
software/hardware tools necessary for computer engineering practice.
PO 11. An ability to apply knowledge of contemporary issues to assess the societal, legal and cultural
issues related to the practice of computer science and engineering.
PO 12. An understanding of the engineering and management principles required for project and finance
management.
M. S. Ramaiah Institute of Technology, Bangalore – 560054.
Department of Computer Science and Engineering
Scheme of Studies in Bachelor of Engineering in Computer Science for the batch 2011 to 2015
III Semester
Code
Subject
CSMAT301 Engineering Mathematics III
CS311
Electronics Circuits
CS312
Digital Design with VHDL
CS313
Data Structures with C
CS314
Discrete Mathematical Structures
CS315
Object Oriented Programming with C++
CSL316
Programming Laboratory
CSL317
Analog & Digital Circuits Laboratory
IV Semester
Code
CSMAT401
CS411
CS412
CS413
CS414
CS415
CSL413
CSL414
V Semester
Code
CS511
CS512
CS513
CS514
CS515
CSL513
CSL514
Subject
Engineering Mathematics IV
Theory of Computation
Computer Organization
Design and Analysis of Algorithms
Introduction to Microprocessors
Data Communication
Algorithms Laboratory
Microprocessors Laboratory
Total Credits: 25
L T P Credit
4
0
0
4
3
0
0
3
3
0
0
3
3
1
0
4
4
0
0
4
3
0
0
3
0
0
2
2
0
0
2
2
Total Credits: 26
T P
Credit
0 0
4
1 0
4
0 0
4
0 0
4
0 0
4
0 0
4
0 1
1
0 1
1
L
4
3
4
4
4
4
0
0
Subject
System Software
Operating Systems
Database Systems
Computer Networks
Software Engineering
Elective -I
Database Applications Laboratory
Computer Networks Laboratory
VI Semester
Code
Subject
CS612
Compiler Design
CS613
Embedded Systems
CS614
Unix System Programming
CS616
Entrepreneurship & Intellectual Property Rights
CS617
Object Oriented Modeling and Design
Elective II
Elective - III
CSL613 Embedded Systems Laboratory
CSL618 Compilers & Systems Programming Laboratory
L
2
4
4
4
4
*
0
0
Total Credits: 25
T P Credit
0 1
3
0 0
4
0 0
4
0 0
4
0 0
4
* *
4
0 1
1
0 1
1
Total Credits: 25
L T P Credit
3 1 0
4
3 0 0
3
2 0 0
2
3 0 0
3
3 0 0
3
* * *
4
* * *
3
0 0 1
1
0 0 2
2
VII Semester
Code
Subject
CS711
Advanced Computer Architecture
CS712
Computer Graphics & Visualization
CS723
Project Management & Engineering
Economics
CS724
Cryptography and Network Security
Elective - IV
Elective - V
Open Elective
CSL716 High Performance Computing Laboratory
CSL712 Computer Graphics Laboratory
VIII Semester
Code
Subject
Elective - VI
CS812
Project
CS813
Seminar (for Regular Students)
CS8T1
Technical Seminar (for Lateral Entry
students)
L
3
3
3
3
*
*
*
0
0
L
*
-
Total Credits: 25
T P Credit
0 0
3
0 0
3
0 0
3
0
*
*
*
0
0
0
*
*
*
1
1
3
4
4
3
1
1
Total Credits: 24
T P Credit
* *
4
- 18
18
2
2
1
1
List of Electives:
V Semester
1 CSPE511
2 CSPE512
3 CSPE513
4 CSPE514
5 CSPE515
Signals & Systems (4:0:0)
Operations Research (4:0:0)
Advanced Algorithms (3:0:1)
Java & J2EE (3:0:1)
Programming Languages (4:0:0)
VI Semester: Elective III (3 Credits)
CSPE616 Information Retrieval (2:0:1)
7 CSPE617 Internet Technologies (2:0:1)
8 CSPE618 Information on Demand (2:0:1)
9 CSPE619 Game Theory (3:0:0)
10 CSPE620 System Simulation (3:0:0)
VI Semester: Elective II (4 Credits)
1 CSPE611 Artificial Intelligence (4:0:0)
2 CSPE613 Advanced DBMS (3:0:1)
3 CSPE614 Digital Signal Processing (4:0:0)
4 CSPE615 C# and .Net Technologies (3:0:1)
5 CSPE621 Pattern recognition (4:0:0)
Semester: 5
Course Title:
Year: 2013- 2014
System Software
Credits (L:T:P) : 2:0:1
Type of Course: Lecture, Laboratory
Course Code: CS511
Core/ Elective: Core
Total Contact Hours: 28 Hrs Theory, 28 Hrs Lab
Prerequisites: The student should have undergone the course on Introduction to microprocessors and any one
programming language.
Course Objectives:
This course will help students to achieve the following objectives:
1. Understand the fundamentals of machine architecture.
2. Identify the relationship between machine architecture and system software.
3. Analyze various assembler components of System Software.
4. Understand the importance of loaders and linkers in assembly level programming.
5. Understand macros in programming
Course Contents:
Unit 1
Machine Architecture: Introduction, System Software and Machine Architecture, Simplified Instructional
Computer (SIC) – SIC Machine Architecture, SIC/XE Machine Architecture, SIC & SIC/XE Programming
Examples.
Unit 2
Assemblers-I: Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures,
Machine Dependent Assembler Features - Instruction Formats & Addressing Modes, Program Relocation.
Unit 3
Assemblers-II: Machine Independent Assembler Features – Literals, Symbol, Definition Statements, Expression,
Program Blocks, Control Sections and Program Linking, Assembler Design Options , One- Pass Assembler, MultiPass Assembler.
Unit 4
Loaders and Linkers: Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader,
Machine-Dependent Loader Features – Relocation, Program Linking, Algorithm and Data Structures for a Linking
Loader, Machine-Independent Loader Features , Automatic Library Search, Loader Options, Overlays, Dynamic
Linking.
Unit 5
Macro Processor: Basic Macro Processor Functions – Macro Definitions and Expansion, Macro Processor
Algorithm and Data Structures, Machine-Independent Macro Processor Features - Concatenation of Macro
Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro
Processor Design Options – Recursive Macro Expansion.
Text Book:
1. Leland L. Beck: System Software, 3rd Edition, Addison-Wesley, 14th Indian Reprint, 2003.
Reference Books:
1. D.M.Dhamdhere: System Programming and Operating Systems, 2nd Edition, Tata McGraw Hill, 2011.
2. J. J. Donovan: Systems Programming, Tata McGraw Hill, 2011.
Course Delivery:
 Black Board teaching for introducing concepts and solving problems
 Practical problems are solved with the guided enquiry learning
Course Assessment and Evaluation:
Indirect
Assessment
Methods
Direct Assessment
Methods
What
To Whom
Internal
Assessment Tests
CIE
Practical exams
SEE
Students
Semester End
Examination
Students
Feedback
When/ Where (Frequency
in the course)
Thrice (Average of the best
two will be computed)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
25
Blue Books
1-4
Twice (Average of the two
will be computed)
25
Data Sheets
3-4
End of Course (Answering
5 of 10 questions)
100
Answer scripts
1-5
Middle of the course
-
Feedback forms
1 - 4, Delivery of the
course
End of the course
-
Questionnaire
1 - 5, Relevance of the
course
Students
End of Course
Survey
Course Outcomes:
At the end of the course students should be able to:
1. Identify the basic principles of machine architecture
2. Compare two machine architectures with respect to design and instruction set.
3. Demonstrate the assembler functionalities
4. Recognize the basic loading and linking in assembly level programming
5. Identify macro features in assembly level programming
Mapping Course Outcomes with Program Outcomes:
Program Outcomes*
Course Outcomes
PO1
Identify the basic principles of different
machine architectures
Compare two machine architectures with
respect to design and instruction set.
Demonstrate the assembler functionalities
Recognize the basic loading, linking in
assembly level programming
Identify macro features in assembly level
programming
PO2
PO3
PO4
PO5
PO6
PO7
X
X
X
X
X
X
X
X
X
X
PO8
PO9
PO10
PO11
PO12
Semester: 5
Year: 2013- 2014
Course Title: Operating Systems
Course Code: CS512
Credits (L:T:P) : 4:0:0
Core/ Elective: Core
Type of Course: Lecture, Self Study & Assignment
Total Contact Hours: 56 Hrs
Prerequisites: Nil
Course Objectives:
The objective of this course is to make the students to
1. Understand the services of an operating system provides to its users and system itself.
2. Apply various CPU scheduling algorithms and recognize the classic synchronization problems.
3. Compare methods for handling deadlocks and apply various memory management techniques.
4. Describe file systems and its implementation.
5. Understand secondary storage structure and protection mechanisms.
Course Contents:
Unit 1
Introduction to Operating Systems, System structures: What operating systems do?, Computer System
organization, Computer System architecture, Operating System structure, Operating System operations, Process
management, Memory management, Storage management, Protection and security, Operating System Services, User
- Operating System interface, System calls, Types of system calls, System programs, Operating System design and
implementation, Operating System structure, Virtual machines, Operating System generation, System boot.
Unit 2
Process Management: Process concept, Process scheduling, Operations on processes, Inter-process
communication. Multi-Threaded Programming: Overview, Multithreading models.
Process Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Multiple-Processor scheduling.
Process Synchronization: Synchronization, The Critical section problem, Peterson’s solution, Synchronization
hardware, Semaphores, Classical problems of synchronization, Monitors.
Unit 3
Deadlocks: System model, Deadlock characterization, Methods for handling deadlocks, Deadlock prevention,
Deadlock avoidance, Deadlock detection and recovery from deadlock. Memory Management - Memory
Management Strategies: Background, Swapping, Contiguous memory allocation, Paging, Structure of page table,
Segmentation. Virtual Memory Management: Background, Demand paging, Copy-on-write, Page replacement,
Allocation of frames, Thrashing.
Unit 4
File System: Implementation of File System - File System, File concept, Access methods, Directory structure, File
system mounting, File sharing, Protection. Implementing File System: File system structure, File system
implementation, Directory implementation, Allocation methods, Free space management.
Unit 5
Secondary Storage Structures: Mass storage structures: Disk structure, Disk scheduling, Disk management, Swap
space management. Protection: Goals of protection, Principles of protection, Domain of protection, Access matrix,
Implementation of access matrix, Access control, Revocation of access rights, Capability-Based systems.
Text Book:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Principles, 8 th edition, WileyIndia, 2011.
Reference Books:
1. D.M Dhamdhere: Operating systems - A concept based Approach, 3rd Edition, Tata McGraw- Hill, 2012.
2. P.C.P. Bhatt: Introduction to Operating Systems Concepts and Practice, 3rd Edition, PHI, 2010.
3. Harvey M Deital: Operating systems, 3rd Edition, Pearson Education, 2011.
Course Delivery:
The course will be delivered through lectures, class room interaction, group discussion, and demonstrations.
Course Assessment and evaluation:
Indirect Assessment
Methods
Direct
Assessment
Methods
What
CIE
Internal
Assessment Tests
Quiz
SEE
To
Whom
Students
Standard
Examination
Students
Feedback
When/ Where
(Frequency in the
course)
Thrice(Average of
the best two will be
computed)
Twice
End of Course
(Answering
5 of 10 questions)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
30
Blue Books
1,2, 3,4 & 5
20
Quiz Answers
2&4
100
Answer scripts
1,2, 3,4 & 5
-
Feedback
forms
1, 2,3
Delivery of the
course
Questionnaire
1,2, 3,4 & 5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
Middle of the
course
Students
End of Course
Survey
End of the course
-
Course Outcomes:
At the end of the course the students should be able to:
1. Describe operating system operations and operating system structures.
2. Understand process management and apply process scheduling algorithms.
3. Recognize methods for handling deadlocks and demonstrate memory management techniques.
4. Identify file systems and recognize its implementation.
5. Demonstrate secondary storage structures and implement protection mechanisms.
Mapping course outcomes with program outcomes:
Program Outcomes
Course Outcomes
Describe operating system operations and operating
system structures.
1
X
2
3
4
5
6
7
8
9
10
Understand process management and apply process
scheduling algorithms.
X
X
X
X
Recognize methods for handling deadlocks and
demonstrate memory management techniques.
X
X
X
X
Identify file systems and recognize its
implementation.
Demonstrate secondary storage structures and
implement protection mechanisms.
X
X
X
X
X
X
X
11
12
Semester: 5
Year: 2012-2014
Course Title: Database Systems
Course Code: CS513
Credits (L:T:P) : 4:0:0
Core/ Elective: 50
Type of course: Lecture/ Laboratory/ /Project/ assignment
Total Contact Hours: 56 Hours
Prerequisites: NIL
Course Objectives (CO):
At the end of the course the students should be able to:
1. Understand database concepts, applications, data models, schemas and instances.
2. Implement the relational database design and data modeling using entity-relationship (ER) model. Demonstrate the use
of constraints and relational algebra operations.
3. Use of SQL in querying the database.
4. Normalization process and dependency preserving algorithms
5. Understanding of Transaction, Concurrency, Backup and recovery techniques.
Course Contents:
Unit 1
Introduction: Characteristics of Database approach, Advantages of using DBMS approach, Data models, schemas
and instances, Three-schema architecture and data independence, Database languages and interfaces, the database
system environment, Centralized and client-server architectures, Classification of Database Management systems,
Entity-Relationship Model: Conceptual Database design using ER Diagrams.
Unit 2
Relational Model and Relational Algebra: Relational Model Concepts, Transactions and dealing with constraint
violations, Relational Operations, Relational Algebra Operations from Set Theory, Binary Relational Operations,
Relational Database Design Using ER- to-Relational Mapping.
Unit 3
SQL: SQL Data Definition and Data Types, Specifying basic constraints in SQL, Schema change statements in
SQL, Basic queries in SQL, More complex SQL Queries. Insert, Delete and Update statements in SQL, Specifying
constraints as Assertion and Trigger, Views (Virtual Tables) in SQL, Additional features of SQL, Database
programming issues and techniques, Embedded SQL.
Unit 4
Database Design: Informal Design Guidelines for Relation Schemas, Functional Dependencies, Normalization,
Dependency Preserving Algorithms.
Unit 5
Transaction Management: Transactions and system concepts, properties of Transactions, Concurrency Control
techniques, Introduction to crash recovery, database recovery techniques.
Text Book:
1. Elmasri and Navathe: Fundamentals of Database Systems, 5 th Edition, Addison-Wesley, 2011.
Reference Books:
1. Silberschatz, Korth and Sudharshan: Data base System Concepts, 6th Edition, Tata McGraw Hill, 2011.
2. C.J. Date, A. Kannan, S. Swamynatham: An Introduction to Database Systems, 8 th Edition, Pearson education,
2009.
Course Delivery:
The course will be delivered through lectures, class room interaction, group discussion, lab exercises and projects.
Course Assessment and Evaluation:
Indirect Assessment
Methods
Direct
Assessment
Methods
What
CIE
SEE
Internal
Assessment
Tests
Quiz
To
Whom
Students
Standard
Examination
When/ Where
(Frequency in
the course)
Thrice(Average of
the best two will
be computed)
Twice
End of Course
(Answering
5 of 10 questions)
Students
Feedback
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
30
Blue Books
1,2, 3,4 & 5
20
Quiz Answers
2&4
100
Answer
scripts
1,2, 3,4 & 5
-
Feedback
forms
1, 2,3
Delivery of the
course
Questionnaire
1,2, 3,4 & 5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
Middle of the
course
Students
End of Course
Survey
End of the course
-
Course Outcomes:
CO1:
CO2:
CO3:
CO4:
CO5:
Identify the difference between traditional file system and database approach. Understand the characteristics of
database and advantages of Database system.
Learn and design logical model using Entity-Relationship diagram. Learn to map logical model to relational model.
Understand the use relational algebra notation to queries on a given database.
Learn Structured Query Language (SQL) and apply to query a database.
Learn the need for database normalization and apply this concept to build a normalized database for some case studies.
Discuss the database transaction processing and concurrency control. Learn backup and recovery techniques
Mapping Course Outcomes with Program Outcomes:
Course Learning Objectives
Program Outcomes
1
Identify the difference between traditional file system
and database approach. Understand the characteristics
of database and advantages of Database system.
Learn and design logical model using EntityRelationship diagram. Learn to map logical model to
relational model. Understand the use relational
algebra notation to queries on a given database.
Learn Structured Query Language (SQL) and apply to
query a database.
Learn the need for database normalization and apply
this concept to build a normalized database for some
case studies.
Discuss the database transaction processing and
concurrency control. Learn backup and recovery
techniques
2
3
4
5
6
7
x
8
9
10
11
12
x
x
x
x
x
x
x
x
x
Semester: 5
Year: 2013-2014
Course Title: Computer Networks
Course Code: CS514
Credits (L:T:P:) : 4:0:0
Core/ Elective: Core
Type of course: Lecture/ Laboratory/ /Project/ assignment
Total Contact Hours: 56 Hrs
Prerequisites: Data Communications
Course Objectives:
The objectives of this course are to:
1. Understand the significance of application layer, transport layer, network layer, wireless networks and
multimedia networks.
2. Understand the working of various protocols of TCP/IP reference model.
3. Apply suitable routing algorithm depending on the network configuration.
4. Understand the management principles for mobile IP.
5. Understand the need for quality of service in multimedia networks.
Course Contents:
Unit 1
Application Layer: principles of application layer protocols, Web and HTTP, FTP, Electronic mail, DNS, Peer-toPeer Applications, Socket Programming.
Unit 2
Transport layer: Transport layer services, multiplexing and demultiplexing, connectionless transport: UDP,
principles of reliable data transport, connection oriented transport: TCP, principles of congestion control, TCP
congestion control.
Unit 3
Network Layer: Network layer services, Virtual Circuit and Datagram Networks, Internet Protocol (IP), Routing
algorithms, Link state routing algorithms, Distance vector routing algorithms, Hierarchical routing, Routing in the
Internet, Broadcast and Multicast Routing.
Unit 4
Wireless and Mobile Networks: Wireless Links and Network Characteristics, WiFi: 802.11 Wireless LANs,
Cellular Internet Access, Mobility Management: Principles, Mobile IP, Managing Mobility in Cellular Networks.
Unit 5
Multimedia Networking: Applications, Streaming Stored Audio and Video, Making the Best of the Best-Effort
Service, Protocols for Real-Time Interactive Applications, Providing Multiple Classes of Service, Providing Quality
of Service Guarantees.
Lab contents include testing the working of various network protocols/algorithms by writing programs using a
network simulator like OPNet or NS2 and usage of tools like Wireshark.
Text Book:
1. James F. Kurose and Keith W. Ross: Computer Networking: A Top-Down Approach, 5th edition, AddisonWesley, 2009.
Reference Books:
1. Larry L. Peterson and Bruce S Davie: Computer Networks: A Systems Approach, Fifth Edition, Elsevier, 2011.
2. Tanenbaum: Computer Networks, 4th Ed, Pearson Education/PHI, 2003.
3. William Stallings: Data and Computer Communications, 8 th Edition, Pearson Education, 2012.
4. Behrouz A. Forouzan: Data communication and Networking, 4 th edition, Tata McGraw-Hill, 2012.
Course Delivery:
The course will be delivered through lectures, class room interaction, group discussion and lab exercises.
Course Assessment and Evaluation:
Indirect Assessment
Methods
Direct Assessment
Methods
What
To
Whom
Internal
Assessment Tests
CIE
SEE
Class-room
Surprise Quiz
Students
Standard
Examination
Students
Feedback
When/ Where
(Frequency in the
course)
Thrice(Average of
the best two will be
computed)
Twice(Summation
of the two will be
computed)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
30
Blue Books
1,2 3,4 & 5
20
Quiz papers
End of Course
(Answering
5 of 10 questions)
100
Answer scripts
1,2,3,4 &5
Middle of the
course
-
Feedback
forms
1, 2 & 3
Delivery of the
course
Questionnaire
1, 2, 3,4,5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
1,2,3 & 4
Students
End of Course
Survey
End of the course
-
Course Outcomes:
At the end of the course students should be able to:
1. Understand and recognize the importance of application layer and the working of protocols like HTTP,
FTP, DNS etc.
2. Differentiate between TCP & UDP, and understand the services provided by them like flow control,
congestion control etc.
3. Compare various routing algorithms like distance vector, link state, hierarchial & multicast routing, and
understand the concept of fragmentation.
4. Understand and recognize the use of mobile IP in wireless mobile networks.
5. Identify the different types of multimedia and analyze the quality of service provided by them.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Understand and recognize the importance of application
layer and the working of protocols like HTTP, FTP, DNS
etc.
Differentiate between TCP & UDP, and understand the
services provided by them like flow control, congestion
control etc.
Compare various routing algorithms like distance vector,
link state, hierarchial & multicast routing, and understand
the concept of fragmentation.
Understand and recognize the use of mobile IP in wireless
mobile networks.
Identify the different types of multimedia and analyze the
quality of service provided by them.
Program Outcomes
1
X
2
3
4
5
6
7
8
9
10
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
11
12
Semester: 5
Year: 2013-2014
Course Title: Software Engineering
Course Code: CS515
Credits (L:T:P) : 4:0:0
Core/ Elective: Core
Type of course: Lecture, Assignment
Total Contact Hours: 56 Hrs
Prerequisites: NIL
Course Objectives:
The Objectives of the course are to:
1. Provide an understanding of the principles of software engineering in a broader system context and the notions
of software engineering process and management.
2. Identify the processes, techniques and deliverables that are associated with requirement engineering including
system requirement and system modeling.
3. Analyze the various steps involved in the design process and the different design approaches which include
Architecture design, Object-oriented design, User interface design, Distributed system architecture.
4. Identify the different software development methods like agile method, software reuse and CBSE and also
learn about Software evolution and maintenance
5. Present an understanding of the software verification and validation process and test automation and different
cost estimation techniques .
Course Contents:
Unit 1
Introduction to Software Engineering: Introduction: Need for Software Engineering, Introduction to Software
Engineering Life Cycle, Professional and ethical responsibility, Socio-Technical systems: Emergent system
properties, Systems engineering, Organizations, people and computer systems, Legacy systems. Software
Processes and Critical systems: Computer-Aided Software Engineering.
Unit 2
Project Management: Management activities, Project Planning, Project Scheduling, Risk Management.
Requirements: Software Requirements, Functional and Non-functional requirements, User requirements,
System requirements, Interface specification, the software requirements document. Requirements Engineering
Processes. System models.
Unit 3
Software Architecture and Design: Architectural Design: Architectural design decisions, System organization,
Modular decomposition styles, Control styles. Distributed Systems Architecture. Design Approaches: Concept of
Procedure Oriented Design Process, Object-Oriented design: Objects and Object Classes, An Object-Oriented
design process, Design evolution. User Interface design.
Unit 4
Development: Rapid Software Development: Agile methods, Extreme programming, Rapid application
development, Component Based software Engineering. Software Evolution: Program evolution dynamics,
Software maintenance, Evolution processes, Legacy system evolution.
Unit 5
Verification and Validation: Verification, Validation, Planning, Software inspections, automated static analysis,
Verification and formal methods. Software testing: System testing, Component testing, Test case design, Test
automation, Software Cost estimation.
Text Book:
1. Ian Sommerville: Software Engineering, 8th Edition, Person Education Ltd., 2012.
Reference Books:
1. Roger.S.Pressman: Software Engineering - A Practitioners approach, 7th Edition, Tata McGraw-Hill,
2010.
2. Shari Lawrence Pfleeger, Joanne M Atlee : Software Engineering Theory and Practice, 4 th Edition, Pearson
Education, 2011.
3. Pankaj Jalote: Software Engineering A Precise Approach, First edition, Wiley Precise TextBook, 2011.
Course Delivery:
The course will be delivered through lectures in the classroom.
Course Assessment and Evaluation:
Indirect
Assessment
Method
Direct Assessment
Methods
What
CIE
Internal
Assessment
Test
Quiz
SEE
When/ Where
(Frequency in the
course)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
Thrice(Average of the
best two will be
computed)
30
Blue Books
1, 2, 3, 4 & 5
Formulating a Design
Document for a case
study ( Assessment 1, 2)
10
10
Soft copies of
the design
document
1, 2, 3, 4 & 5
End of Course (Answering
5 of 10 questions)
100
Answer scripts
1,2,3,4 & 5
Middle of the course
-
Feedback
forms
End of the course
-
Questionnaire
1, 2, 3
Delivery of the course
1, 2, 3, 4 & 5
Effectiveness of
Delivery of instructions
& Assessment Methods
To
Whom
Students
Standard
Examination
Students
Feedback
End of Course
Survey
Students
Course Outcomes:
At the end of the course the students should be able to:
1. Demonstrate an understanding of the principles and techniques of Software Engineering, Socio Technical
systems, Software Processes and identify the attributes of Critical Systems.
2. Understand the activities in project management, requirement engineering process and to identify the different
types of System Models.
3. Applying the different Architectural and design methods and Identifying the modular decomposition and
control styles.
4. Understand the various methods of software development and identify the software evolution methods.
5. Formulate different testing methods and tools.
Mapping Course Outcomes with program Outcomes:
Course Learning Objectives
Demonstrate an understanding of the principles and
techniques of Software Engineering, Socio Technical
systems, Software Processes and identify the attributes of
Critical
Systems.
Understand
the activities in project management,
requirement engineering process and to identify the different
types of System Models.
Applying the different Architectural and design methods and
Identifying the modular decomposition and control styles.
1
2
X
X X
X
X
X
10
11
X
X
X
X
X
X
X
X
12
X
X
Understand the various methods of software development
and identify the software evolution methods.
Formulate different testing methods and tools.
3
Program Outcomes
4
5 6 7 8 9
X
X
X
X
X
Semester: 5
Course Title: Database Applications Lab
Credits (L:T:P) : 0:0:1
Type of course: Practical, Project
Year: 2013-2014
Course Code: CSL513
Core/ Elective: Core
Total Contact Hours: 28 Hrs
Course Objectives:
The objective of the course is to:
1. Provide a strong formal foundation in database concepts, technology and practice to the students.
2. Familiarize the students with the database environments towards an information-oriented data-processing
oriented framework.
3. Understand the relational data model and to introduction to systematic database design approaches covering
conceptual design, logical design
4. Motivate the students to relate all these to one or more commercial product environments as they relate to
the developer tasks.
5. Present the concepts and techniques relating to query processing by SQL engines and to develop a database
application using any of the commercial application product (DB2, Visual Basic, Java, SAP HANA etc.)
Course Content:
In the lab session the programming assignments require the students to do the following:
Part A:
1. Collect the requirement for a particular case study.
2. Design the ER diagram for the given case study.
3. Map the ER diagram to relational database model
4. Build the model using Oracle database.
5. Populate the model and practice queries using SQL.
6. Use of DDL/ DML queries, Nested queries, triggers.
Part B:
1. Students in groups are required to develop a database application.
2. Design a database application for a particular case study. The students can use Oracle for the backend and
Visual Basic/Java for the front end. The students can also use SAP HANA, DB2 for the overall
development of the database application.
Course Outcomes:
At the end of the course the student will be able to:
1.
2.
3.
4.
5.
Explain the underlying concepts of database technologies. Design and implement a database schema for a
given problem-domain.
Normalize a database.
Populate and query a database using SQL DML/DDL commands To motivate the students to relate all
these to one or more commercial product environments as they relate to the developer tasks.
Declare and enforce integrity constraints on a database, explain to create triggers and administrative
commands
Design and build a GUI based database application using a Visual Basic/Java/SAP HANA, MySQL, DB2
Course Delivery:
The course will be delivered through lab exercises.
Course Assessment and Evaluation:
Indirect Assessment
Methods
Direct Assessment
Methods
What
To
Whom
Internal
Assessment Tests
CIE
Mini Project
SEE
Students
Practical
Examination
When/ Where
(Frequency in the
course)
Twice(Average of
the best two will be
computed)
Evidence
Collected
25
Record Book /
Data sheets
1,2 3,4 & 5
25
Project
Documentation
1,2,3,4 & 5
50
Answer scripts
1,2,3,4 &5
-
Feedback
forms
1, 2 & 3
Delivery of the
course
Questionnaire
1, 2, 3,4,5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
End of the Course
End of Course
Students
Feedback
Contribution to
Course
Outcomes
Max
Marks
Middle of the course
Students
End of Course
Survey
End of the course
-
Mapping Course Outcomes with program Outcomes:
Course Outcomes
Explain the underlying concepts of database
technologies. Design and implement a
database schema for a given problem-domain
Normalize a database
Populate and query a database using SQL
DML/DDL commands
Declare and enforce integrity constraints on a
database, explain to create triggers and
administrative commands
Design and build a GUI based database
application using a Visual Basic/Java/SAP
HANA, MySQL, DB2
Program Outcomes
1
2
3
4
5
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
6
7
8
9
10
11
12
X
X
X
X
X
Semester: 5
Year: 2013-2014
Course Title: Computer Networks Laboratory
Course Code: CSL514
Credits (L:T:P) : 0:0:1
Core/ Elective: Core
Type of course: Practical
Total Contact Hours: 28 Hrs
Prerequisites: Data Communications
Course Objectives :
The objective of the course is to:
1. Understand the working of simulators like OPNET and NS2.
2. Understand the working of packet sniffers like wireshark.
3. Learn how to use C/C++ code to implement network related concepts.
4. Analyze various protocol parameters of TCP/IP reference model.
5. Design network models and analyze its performance by specifying parameters.
Course Contents:
Note: Student is required to solve one problem from PART-A and one problem from PART-B. The questions
are allotted based on lots. Both questions carry equal marks.
PART - A
Implement the following in C/C++ or wireshark as suitable.
1. Write a program for error detection using CRC-CCITT (16-bits).
2. Write a program to generate Hamming Code for error detection and correction.
3. Trace Hypertext Transfer Protocol.
4. Trace Domain Name Server.
5. Write a client-server program using TCP/IP sockets in which client requests for a file by sending the file
name to the server, and the server sends back the contents of the requested file if present.
6. Trace Internet Protocol, Internet Control Message Protocol and Dynamic Host Configuration Protocol.
7. Write a program for congestion control using Leaky bucket algorithm.
PART-B
The following experiments shall be conducted using either NS-2/OPNET or any other suitable simulator.
8. Simulate a small intranet and plan for its expansion by analyzing the packet dropped and load on the
Server.
9. Simulate switched LANs using hubs & switches and analyze its performance.
10. Simulate a three nodes point-to-point network with duplex links between them. Set the queue size vary the
bandwidth and find the number of packets dropped.
11. Simulate a four node point-to-point network, and connect the links as follows: n0-n2, n1-n2 and n2-n3.
Apply TCP agent between n0-n3 and UDP agent between n1-n3. Apply relevant applications over TCP and
UDP agents by changing the parameters and determine the number of packets sent by TCP/UDP.
12. Implement Routing Internet Protocol and observe change in routing table entries when there is link failure.
13. Simulate simple Extended Service Set with transmitting nodes in wireless LAN and determine the
performance with respect to transmission of packets.
14. Simulate a wireless network, generate traffic and analyze its performance.
Reference Books:
1. James F. Kurose and Keith W. Ross: Computer Networking: A Top-Down Approach, 5th edition, AddisonWesley, 2009.
2. Larry L. Peterson and Bruce S Davie: Computer Networks: A Systems Approach, Fifth Edition, Elsevier, 2011.
3. Tanenbaum: Computer Networks, 4th Ed, Pearson Education/PHI, 2003.
4. Behrouz A. Forouzan: Data communication and Networking, 4 th edition, Tata McGraw-Hill, 2012.
Course Delivery: The course will be delivered through lab exercises.
Course Assessment Methods:
Indirect Assessment
Methods
Direct Assessment
Methods
What
To
Whom
Internal
Assessment Tests
CIE
Lab Record
SEE
Students
Practical
Examination
When/ Where
(Frequency in the
course)
Twice(Average of
the best two will be
computed)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
40
Blue Books
1,2 3,4 & 5
10
Record Book /
Data sheets
1,2,3,4 & 5
50
Answer scripts
1,2,3,4 &5
Middle of the
course
-
Feedback
forms
End of the course
-
Questionnaire
Every lab Session
End of Course
Students
Feedback
1, 2 & 3
Delivery of the
course
1, 2, 3,4,5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
Students
End of Course
Survey
Questions for CIE and SEE will be designed to evaluate the various educational components (Bloom’s taxonomy)
Course Outcomes:
At the end of the course the student will be able to:
1. Simulate experiments related to intranet, hubs, switches, routing protocols and wireless networks using
OPNET.
2. Simulate experiments related to point to point networks, TCP/UDP and wireless networks using NS-2
3. Implement network concepts like error detection, error correction and congestion control using C/C++
programs.
4. Analyze the HTTP, DNS, TCP, IP, ICMP and DHCP packets using wireshark.
5. Implement network concepts using the software tools.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Simulate experiments related to intranet, hubs,
switches, routing protocols and wireless networks
using OPNET.
Simulate experiments related to point to point
networks, TCP/UDP and wireless networks using
NS-2
Implement network concepts like error detection,
error correction and congestion control using
C/C++ programs.
Analyze the HTTP, DNS, TCP, IP, ICMP and
DHCP packets using wireshark.
Implement network concepts using the software
tools.
Program Outcomes
1
2
3
X
X
X
4
5
6
7
8
9
10
11
12
X
X
-
-
-
-
X
-
-
X
X
X
-
-
-
X
-
-
X
X
X
X
-
-
-
-
X
-
-
X
X
-
X
-
-
-
-
X
-
-
X
X
X
X
-
-
X
X
-
-
Semester: 5
Year: 2013-2014
Course Title: Signals & Systems
Course Code: CSPE511
Credits (L:T:P) : 4:0:0
Core/ Elective: Elective
Type of course: Lecture
Total Contact Hours: 56 Hrs
Course Contents:
Unit 1
Introduction: Definitions of a signal and a system, Classification of signals, Basic operations on signals,
Elementary signals.
Unit 2
Systems viewed as interconnections of operations: Properties of systems, Convolution, Impulse response
representation, Properties of impulse response representation. Differential and difference equation representations,
Block diagram representations.
Unit 3
Fourier representation: Introduction, Fourier representations for four signal classes, Orthogonality of complex
sinusoidal signals. DTFS representations, Continuous-time Fourier-series representations, DTFT and FT
representations, Properties of Fourier representations.
Unit 4
Application of Fourier representations: Frequency response of LTI systems, Solution of differential and
difference equations using system function. Fourier transform representations for periodic signals, Sampling of
continuous time signals and signal reconstruction.
Unit 5
Introduction to Z-transform: Properties of ROC, Properties of Z-transforms, Inversion of Z-transforms.
Transforms analysis of LTI systems, Transfer function, Stability and causality, Unilateral Z-transforms and its
application to solve difference equations.
Text Book:
1. Simon Haykin and Barry Van Veen: Signals and Systems, Second Edition, John Wiley and Sons, 2001,
Reprint 2012.
Reference Books:
1. Alan V. Oppenheim, Alan S. Willsky and S. Hamid Nawab: Signals and Systems, Pearson Education, 2nd
Edition, 2008.
2. D. Ganesh Rao and Satish Tunga: Signals and Systems - A Simplified Approach, 4th edition, Pearson
Education, 2012.
Semester: 5
Year: 2013-2014
Course Title: Operations Research
Course Code: CSPE512
Credits (L:T:P) : 4:0:0
Core/ Elective: Elective
Type of course: Lecture
Total Contact Hours: 56 Hrs
Course Contents:
Unit 1
Introduction, Linear Programming – 1: Introduction: The origin, nature and impact of OR, Defining the problem
and gathering data, Formulating a mathematical model, Deriving solutions from the model, Testing the model,
Preparing to apply the model, Implementation. Introduction to Linear Programming: Prototype example, The linear
programming (LP) model.
Unit 2
LP – 2, Simplex Method: Assumptions of LP, Additional examples. The essence of the simplex method, Setting
up the simplex method, Algebra of the simplex method, the simplex method in tabular form, Tie breaking in the
simplex method, Adapting to other model forms, Post optimality analysis, Computer implementation, Foundation of
the simplex method.
Unit 3
Simplex Method – 2, Duality Theory: The revised simplex method, a fundamental insight. The essence of duality
theory, Economic interpretation of duality, Primal dual relationship, Adapting to other primal forms.
Unit 4
Duality Theory and Sensitivity Analysis, Other Algorithms for LP : The role of duality in sensitive analysis,
The essence of sensitivity analysis, Applying sensitivity analysis. The dual simplex method, Parametric linear
programming, The upper bound technique.Transportation and Assignment Problems: The transportation problem, A
streamlined simplex method for the transportation problem, The assignment problem, A special algorithm for the
assignment problem.
Unit 5
Game Theory, Decision Analysis: Game Theory: The formulation of two persons, zero sum games, Solving
simple games- a prototype example, Games with mixed strategies, Graphical solution procedure, Solving by linear
programming, Extensions.
Decision Analysis: A prototype example, Decision making without experimentation, Decision making with
experimentation, Decision trees. Metaheuristics: The nature of Metaheuristics, Tabu Search, Simulated Annealing,
Genetic Algorithms.
Text Book:
1. Frederick S. Hillier and Gerald J. Lieberman: Introduction to Operations Research: Concepts and Cases, 8 th
Edition, Tata McGraw Hill, 2005.
Reference Books:
1. Wayne L. Winston: Operations Research Applications and Algorithms, 4th Edition, Cengage Learning,
2003.
2. Hamdy A Taha: Operations Research: An Introduction, 8 th Edition, Pearson Education, 2007.
Semester: 5
Year: 2013-2014
Course Title: Advanced Algorithms
Course Code: CSPE513
Credits (L:T:P) : 3:0:1
Core/ Elective: Elective
Type of course: Lecture, Practical
Total Contact Hours: 56 Hrs
Course Contents:
Unit 1
Analysis Techniques: Growth of Functions, Asymptotic notations, Standard notations and common functions,
Recurrences and Solution of Recurrence equations – The Substitution method, The recurrence – tree method, The
master method, Amortized Analysis: Aggregate, Accounting and Potential Methods.
Unit 2
Graph Algorithms: Bellman-Ford Algorithm, Single source shortest paths in a DAG, Johnson’s Algorithm for
sparse graphs, Flow networks and Ford-Fulkerson Method, Maximum bipartite matching. Polynomials and the FFT:
Representation of Polynomials, The DFT and FFT, Efficient implementation of FFT.
Unit 3
Number – Theoretic Algorithms: Elementary notations, GCD, Modular Arithmetic, Solving modular linear
equations, The Chinese remainder theorem, Powers of an element, RSA cryptosystem, Primality testing, Integer
factorization.
Unit 4
String Matching Algorithms: Naïve string matching, Rabin – Karp algorithm, String matching with finite
automata, Knuth-Morris-Pratt algorithm, Boyer-Moore Algorithms.
Unit 5
Approximation Algorithms: The vertex-cover Problem, The traveling sales person problem, The set covering
problem, The subset sum problem.
Text Book:
1. T H Cormen, C E Leiserson, R L Rivest and C Stein: Introduction to Algorithms, 3/e, PHI, 2011.
Reference Books:
1. Ellis Horowitz, Sartaj Sahni, S Rajasekharan: Fundamentals of Computer Algorithms, University Press,
2007.
2. Alfred V Aho, John E Hopcroft, J D Ullman: The Design and Analysis of Computer Algorithms, Pearson
Education, 2011.
Semester: 5
Year: 2013-2014
Course Title: Java and J2EE
Course Code: CSPE514
Credits (L:T:P) : 3:0:1
Core/ Elective: Elective
Type of course: Lecture / Practical / Mini Project
Total Contact Hours:42 hrs
Prerequisites: Knowledge of Object Oriented Programming Concepts.
Course Objectives:
This course will help students to achieve the following objectives:
1. Identify the different object oriented properties and implement applet programs.
2. Present multithreading programming concepts and different ways of implementing event handling.
3. Present J2EE concepts and designing database access with java applications.
4. Design & implement server side programming.
5. Apply remote method invocation concepts and analyze bean implementation.
Course Contents:
Unit 1
Classes, Inheritance, Exceptions, Applets: Classes: Classes in Java, Declaring a class, Class name, Super classes,
Constructors, Creating instances of class, Inner classes. Inheritance: Simple, multiple, and multilevel inheritance,
Overriding, overloading. Exception handling: Exception handling in Java. The Applet Class: Two types of Applets,
Applet basics, Applet Architecture, An Applet skeleton, Simple Applet display methods, Requesting repainting,
Using the Status Window, The HTML APPLET tag, Passing parameters to Applets, getDocumentbase() and
getCodebase(), AppletContext() and showDocument(), The AudioClip Interface, The AppletStub Interface, Output
to the Console.
Unit 2
Multi Threaded Programming, Event Handling: Multi Threaded Programming: What are threads? How to make
the classes threadable, Extending threads, Implementing runnable, Synchronization, Changing state of the thread,
Bounded buffer problems, read-write problem, producer-consumer problems. Event Handling: Two event handling
mechanisms, The delegation event model, Event classes, Sources of events, Event listener interfaces, Using the
delegation event model, Adapter classes, Inner classes. Swings: The origins of Swing, Two key Swing features,
Components and Containers, The Swing Packages, A simple Swing Application, Create a Swing Applet, Jlabel and
ImageIcon, JTextField,The Swing Buttons, JTabbedpane, JScrollPane, JList, JComboBox, JTable.
Unit 3
Java 2 Enterprise Edition Overview, Database Access: Overview of J2EE and J2SE. The Concept of JDBC,
JDBC Driver Types, JDBC Packages, A Brief Overview of the JDBC process, Database Connection, Associating
the JDBC/ODBC Bridge with the Database, Statement Objects, ResultSet, Transaction Processing, Metadata, Data
types, Exceptions.
Unit 4
Servlets: Background, The Life Cycle of a Servlet, Using Tomcat for Servlet Development, A simple Servlet, The
Servlet API, The Javax.servlet Package, Reading Servlet Parameter, The Javax.servlet.http package, Handling HTTP
Requests and Responses, Using Cookies, Session Tracking. Java Server Pages (JSP): JSP, JSP Tags, Tomcat,
Request String, User Sessions, Cookies, Session Objects.
Unit 5
Java Remote Method Invocation: Remote Method Invocation concept, Server side, Client side. Enterprise Java
Beans: Enterprise java Beans, Deployment Descriptors, Session Java Bean, Entity Java Bean, Message-Driven
Bean, The JAR File.
Note: The basic syntax aspects of Java must be covered during initial practical sessions.
Text Books:
1. Herbert Schildt: Java The Complete Reference, 8th Edition, Tata McGraw Hill, 2012.
2. Jim Keogh: J2EE The Complete Reference, first edition, Tata McGraw Hill, 2011.
Reference Books:
1. Y. Daniel Liang: Introduction to JAVA Programming, 7th Edition, Pearson Education, 2012.
2. Stephanie Bodoff, Dale Green, Kim Haasel: The J2EE Tutorial, 2nd Edition, Pearson Education, 2008.
Course Delivery: The course will be delivered through lectures, class room interaction, group discussion and
exercises and self-study cases.
Course Assessment and Evaluation Scheme:
Indirect
Assessment
Methods
Direct Assessment
Methods
What
CIE
Internal
Assessment
Tests
Internal Lab
Test
Mini Project
SEE
To
Whom
When/ Where
(Frequency in
the course)
Thrice
(Average of
best two)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
25
Blue Books
1,2,3,4 &5
Twice
15
Lab Data Sheets
1,2,3,4 &5
Once
10
Project Report
1,2,3,4 &5
End of Course
(Answering
5 of 10
questions)
100
Answer scripts
1,2,3,4 &5
Middle of the
course
-
Feedback forms
Delivery of the
course
Questionnaire
Effectiveness of
Delivery of
instructions &
Assessment
Methods
Students
Standard
Examination
Students
Feedback
Students
End of Course
Survey
End of the
course
-
Course Outcomes:
This course uses assigned readings, lectures, and homework to enable the students to:
1. Recognize the basic object oriented concepts & apply them to create java applications
2.
3.
4.
5.
Design java applications with multithreading concepts and demonstrate the event handling concepts.
Understand the J2EE concepts & design applications with database access.
Design client server applications and security models.
Design Enterprise applications
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Recognize the basic object oriented concepts
& apply them to create java applications
Design java applications with multithreading
concepts and demonstrate the event handling
concepts.
Understand the J2EE concepts & design
applications with database access.
Design client server applications and security
models.
Design Enterprise applications
3
4
5
Program Outcomes
6
7
8
1
2
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
9
10
X
X
X
X
11
X
X
X
X
X
X
X
12
Semester: 5
Year: 2013-2014
Course Title: Programming Languages
Course Code: CSPE515
Credits (L:T:P) : 4:0:0
Core/ Elective: Elective
Type of course: Lecture
Total Contact Hours:56 Hrs
Unit 1
Introduction, Names, Scope, and Bindings: Language design, Programming language spectrum, Why study
programming languages? Compilation and interpretation, Programming environments. Names, scope, and bindings:
Concept of binding time, Object lifetime and storage management, Scope rules and implementing scope. Names,
Scope, and Bindings, Control Flow The binding of reference environments, Binding within a scope, Separate
compilation. Control Flow – 1: Expression evaluation.
Unit 2
Control Flow: Structured and unstructured flow, Sequencing, Selection, Iteration, Recursion, Non-determinacy.
Data Types: Type systems, Type checking, Records and variants, Arrays.
Unit 3
Data Types: Strings, Sets, Pointers and recursive types, Lists, Files and Input/Output, Equality testing and
assignment. Subroutines and Control Abstraction: Review of stack layout, Calling sequences, Parameter passing,
Generic subroutines and modules, Exception handling.
Unit 4
Control Abstraction: Data Abstraction, Object Orientation: Control abstraction – 2: Coroutines. Data Abstraction,
Object Orientation: Object oriented programming, Encapsulation and Inheritance, Dynamic method binding,
Multiple inheritance, Object oriented programming revisited.
Unit 5
Functional Languages: Logic Languages, Scripting Languages: Functional Languages: Origins, Concepts, An
overview of scheme, Evaluation order revisited, Higher-order functions, Functional programming in perspective.
Logic Languages: Concepts, Prolog, Logic programming in perspective. Scripting Languages: Common
characteristics.
Text Book:
1. Michael L. Scott: Programming Language Pragmatics, 3rd Edition, Elsevier, 2011.
Reference Books:
1. Ravi Sethi, Vishwanantha K V: Programming languages Concepts and Constructs, 2nd Edition, Pearson
Education, 2011.
2. Allen Tucker, Robert Nonan : Programming languages, 2nd Edition, Tata McGraw-Hill, 2011.
Semester: 6
Year: 2013- 2014
Course Title: Compiler Design
Course Code: CS612
Credits (L:T:P) : 3:1:0
Core/ Elective: Core
Type of Course: Lecture, Tutorial
Total Contact Hours: 56Hrs
Prerequisites:
The student should have undergone the course on System Software and any one programming language.
Course Objectives:
This course will help students to achieve the following objectives:
1. Present fundamental concepts and techniques for compiler design.
2. Provide necessary background for writing algorithms in a formal way.
3. Identify the methods and strategies for parsing techniques.
4. Design and optimize the code generated.
5. Analyze the optimized code generated after the synthesis phase.
Course Contents:
Unit 1
Introduction, Lexical Analysis: Language processors, The structure Of Compilers, Lexical analysis: The Role of
Lexical Analyzer, Input Buffering, Specifications of Tokens, Recognition of Tokens. Syntax Analysis: Introduction,
Writing a Grammar.
Unit 2
Parsing: Top-down Parsing, Bottom-up Parsing, Introduction to LR Parsing: Simple LR parser. More Powerful LR
Parsers: Canonical parser, LALR parser.
Unit 3
Syntax-Directed Definitions: Evaluation order for SDDs, Applications of Syntax-directed translation, Syntaxdirected translation schemes. Run-Time Environments: Storage Organization, Stack allocation of space.
Unit 4
Intermediate Code Generation: Variants of syntax trees, Three-address code, Types and declarations, Translation
of expressions, Type checking, Control flow, Back patching, Switch statements, Intermediate code for procedures.
Unit 5
Code Generation: Issues in the design of Code Generator, The Target language, Addresses in the target code, Basic
blocks and Flow graphs, Optimization of basic blocks, A Simple Code Generator.
Text Books:
1. Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman: Compilers- Principles, Techniques and Tools,
2nd Edition, Pearson education, 2012.
Reference Books:
1. Kenneth C Louden: Compiler Construction - Principles & Practice, First Edition, Brooks/Cole, CENGAGE
learning, 1997.
2. Andrew W Appel: Modern Compiler Implementation in C, First Edition, Cambridge University Press, 2010.
Course Delivery:
The course will be delivered through lectures, class room interaction, group discussion and exercises and self-study
cases.
Course Assessment and Evaluation:
Direct Assessment
Methods
Indirect
Assessment
Methods
When/ Where
(Frequency in
the course)
Thrice(Average of
the best two will
be computed)
To
Whom
What
Internal
Assessment
Tests
CIE
Surprise Quiz
Evidence
Collected
Contribution to
Course Outcomes
30
Blue Books
1,2,3,4 & 5
Twice
20
Quiz
Answers
Recollection
Skills
End of Course
(Answering
5 of 10 questions)
100
Answer
scripts
1,2,3,4 & 5
Middle of the
course
-
Feedback
forms
1, 2 & 3, Delivery of
the course
Questionnaire
1,2,3,4 & 5
Effectiveness of
Delivery of
instructions &
Assessment Methods
Students
Standard
Examination
SEE
Max
Marks
Students
Feedback
Students
End of Course
Survey
End of the course
-
Course Outcomes:
At the end of the course students should be able to:
1. Identify the basic principles of compiler in high level programming structure.
2. Recognize the two phases of compiler with respect to design.
3. Demonstrate the syntax analysis and error correction strategies.
4. Associate the analysis phase with synthesis phases.
5. Understand the optimization of the code and apply for code samples.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Identify the basic principles
of compiler in high level
programming structure.
Recognize the two phases of
compiler with respect to
design.
Demonstrate the syntax
analysis and error correction
strategies.
Associate the analysis phase
with synthesis phases.
Understand the optimization
of the code and apply for
code samples.
Program Outcomes
PO1
PO2
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
PO3
X
PO4
PO5
PO6
PO7
PO8
PO9
PO10
PO11
PO12
Semester: 6
Year: 2013-2014
Course Title: Embedded Systems
Course Code: CS613
Credits (L:T:P) : 3:0:0
Core/ Elective: Core
Type of Course: Lecture
Total Contact Hours: 56Hrs
Prerequisites:
The student should have undergone the course on Microprocessors and Computer organization.
Course Objectives:
This course will help students to achieve the following objectives:
1. To teach the basics of embedded system, its challenges and advantages.
2. To teach programming using ARM microcntroller
3. To develop ability to write embedded C programs for ARM Microcontroller
4. To impart basic knowledge of RTOS.
5. To introduce to different real time applications which can be developed on ARM microcontroller.
Course Contents:
UNIT - 1
Introduction : Overview of embedded systems, embedded system design challenges, common design metrics, flow
and optimization. Specifications and modeling.
UNIT – 2
Embedded system design using ARM processors: Introduction to ARM embedded systems.
ARM processor fundamentals: registers, pipeline, exceptions, interrupts and vector table, architecture revisions,
ARM processor Families
Introduction to ARM instruction set and thumb instruction set.
UNIT – 3
C programming for ARM processors:
Efficient C programming: register allocation, pointer aliasing, function calls, inline functions and inline assembly,
portability issues
Writing and optimizing ARM assembly code: writing assembly code, instruction scheduling, register allocation, bit
manipulation, conditional execution, looping constructs.
Exception and interrupt handling: exception handling, Interrupts, interrupt handling schemes
UNIT – 4
RTOS: Fundamentals of RTOS, features, characteristics of RTOS, Real time Kernel and its types, Tasks, Task
states, state transition diagram, Task control bar and processes.
UNIT – 5
Real Time communication and case study of RTOS: Basic concepts of Real Time Communication, Network
topologies, Soft and hard Real Time Communication techniques, overview of different types of RTOS, introduction
to VX works/ Mucos, their features, Real Time Applications
TEXT BOOKS:
1.
2.
3.
Peter Marwedel,“Embedded System Design-Embedded Systems Foundations of Cyber-Physical Systems”
– Springer publications 2011.
Andrew.N.Sloss, Dominin Symes and Chris Wright, “ARM System Developer`s Guide- Desigining and
optimizing system software”, Morgan Kauffmann Publishers, 2005.
David E. Simon, “An Embedded software Primer”,Pearson Education, 1999.
REFERENCE BOOKS:
1. Raj Kamal , “Embedded Systems: Architecture ,Programming and Design”, Tata McGrawhill, New
Delhi,2003.
2. Tammy Noergaard, “Embedded Systems Architecture- Comprehensive Guide for Engineer and
Programmers – Elsevier Publication, 2005
3.
4.
Barnett, Cox & O’cull,”Embedded C programming”,Thomson ,2005.
Dr.K.V.K.K Prasad, “Embedded/ Real Time Syatems: Concepts, design and programming”, Dreamtech
press publications,2011 reprint.
Course Assessment and evaluation:
Indirect
Assessment
Methods
Direct Assessment
Methods
What
To
Whom
Internal
Assessment
Tests
CIE
Class-room
Surprise Quiz
SEE
Students
Standard
Examination
Students
Feedback
When/ Where
(Frequency in the
course)
Thrice(Average of
the best two will
be computed)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
30
Blue Books
1,2,4 & 5
Twice(Summation
of the two will be
computed)
20
Quiz sheets
2 & 3,5
End of Course
(Answering
5 of 10 questions)
100
Answer
scripts
1,2, 3,4 & 5
Middle of the
course
-
Feedback
forms
End of the course
-
Questionnaire
Students
End of Course
Survey
1, 2 & 3
Delivery of the
course
1, 2 & 3,
Effectiveness of
Delivery of
instructions &
Assessment Methods
Course Outcomes:
At the end of the course students should be able to:
1. Ability to understand the significance and importance of Embedded Systems.
2. Capability to write programs for ARM Microcontroller.
3. Expertise to create C programs for ARM Microcontroller.
4. Proficiency to understand and appreciate RTOS
5. Knowledge of different recent tools and applications which can be developed on ARM Microcontroller.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Ability to understand the significance and importance
of Embedded Systems
Capability to write programs for ARM
Microcontroller
Expertise to create C programs for ARM
Microcontroller
Proficiency to understand and appreciate RTOS
Knowledge of different recent tools and applications
which can be developed on ARM Microcontroller
1
2
3
Program Outcomes
4 5 6 7 8 9
X X
X
X X
X
X
X
X X
X
X
X
X
X
X
X X
X X
X
X
1
0
X
11
X
X
X
X
X
12
Semester: 6
Year: 2013-2014
Course Title: Unix System Programming
Course Code: CS614
Credits (L:T:P) : 2:0:0
Core/ Elective: Core
Type of Course: Lecture
Total Contact Hours: 28Hrs
Prerequisites: NIL
Course Objectives:
This course will help students to achieve the following objectives:
1. To familiarize with the UNIX kernel structure and system calls.
2. Able to produce programs similar to standard UNIX utilities (mv, rm etc.) using raw UNIX system calls
and do basic screen manipulation (for text based editors, menu driven systems, forms etc.).
3. TO manipulate system resources such as files, processes and system information.
4. Implement IPC and Signal process.
5. Analyze the characteristics and Coding rules of daemon process.
Course Contents:
Unit 1
UNIX Files: File Descriptors, open, creat, close, lseek, read, write, dup, fcntl, ioctl, stat, File Types, set-user-id, setgroup-id, access permissions, access, umask, chmod, Sticky bit, chown, File Size, File truncation.
Unit 2
Link and Directory Files: File Systems, link, Symbolic Links, symlink, readlink, File Times, utime, mkdir, rmdir,
Special Device Files. System Data Files and Information: Introduction, Password File, Shadow Passwords, Group
Files, Supplementary Group IDs, Login Accounting, System Identification, Time and Date Routines.
Unit 3
UNIX Processes: Environment of a UNIX Process main Function, Process Termination, Command-Line
Arguments, Environment List, Memory Layout of a C Program, setjmp, longjmp, Processes Identifiers, fork, vfork,
exit, wait, waitpid, Race Conditions, exec, Changing User IDs and Group IDs, Interpreter Files, system, Processes
Accounting.
Unit 4
Process Relationships and Interprocess Communication: Introduction, Terminal Logins, Network Logins,
Process Groups, Sessions, Controlling Terminal, tcgetpgrp, tcsetpgrp, tcgetsid, Job Control, Shell Execution of
Programs, Orphaned Process Groups, Pipe, popen, pclose, Coprocesses, FIFOs, System V IPC, Message Queues,
Semaphores, Shared Memory.
Unit 5
Signals and Daemon Processes: Introduction, Signal Concepts, Signal Function, SIGCLD Semantics, kill, raise,
alarm and pause Functions, Signal Set, sigprocmask, sigpending, sigaction, sigsetjmp, siglongjmp, sigsuspend,
abort, system, sleep Functions. Daemon Processes: Introduction, Daemon Characteristics, Coding Rules.
Lab components include executing programs which uses the various system calls explored in the course.
Text Book:
1. W. Richard Stevens: Advanced Programming in the UNIX Environment, Second Edition, Pearson
education, 2011.
Reference Books:
1. Terrence Chan: UNIX System Programming Using C++, First edition, Prentice Hall India, 2011.
2. Kay A Robbins and Steve Robbins: Unix Systems Programming, First Edition, Pearson Education, 2009.
3. Marc J. Rochkind: Advanced UNIX Programming, 2nd Edition, Pearson Education, 2009.
Course Delivery
The course will be delivered through lectures, presentations, classroom discussions, practice exercises and practical
sessions.
Course Assessment and evaluation:
Direct Assessment
Methods
What
CIE
Internal
Assessment
Tests
Quiz
Indirect
Assessment
Methods
SE
E
To
Whom
Student
s
Semester End
Examination
Students
Feedback
End of Course
Survey
When/ Where
(Frequency in the
course)
Thrice (Average of
the best two will be
computed)
Twice (Average of
the two will be
computed)
End of Course
(Answering
5 of 10 questions)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
30
Blue Books
1-5
20
Quiz sheets
1-5
50
Answer scripts
1-5
Middle of the course
-
Feedback
forms
1,2 & 3 Delivery of
the course
End of the course
-
Questionnaire
1-5, Relevance of
the course
Student
s
Course Outcomes:
At the end of the course students should be able to:
1. Understand UNIX System calls and terminology.
2. Develop a command of the UNIX environment, including advanced UNIX commands and utilities.
3. Recognize different types of file supported by UNIX operating system
4. Determine the basic IPC issues and techniques in UNIX system programming
5. Evaluate both the theory and practice of making Signals in UNIX and also how the daemon process works
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Understand UNIX System calls and
terminology
Develop a command of the UNIX
environment, including advanced
UNIX commands and utilities
Recognize different types of file
supported by UNIX operating
system.
Determine basic IPC issues and
techniques in UNIX system
programming
Evaluate both the theory and
practice of making Signals in
UNIX and also how the daemon
process works
PO1
PO2
PO3
PO4
Program Outcomes
PO5 PO6 PO7 PO8
PO9
PO
10
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
PO
11
PO
12
Semester: 6
Year: 2013-2014
Course Title: Entrepreneurship & Intellectual property rights
Course Code: CS616
Credits (L:T:P) : 3:0:0
Core/ Elective: Core
Type of Course: Lecture
Total Contact Hours: 42 Hrs
Prerequisites: NIL
Course Objectives:
This course will help students to achieve the following objectives:
1. Provide insights of Entrepreneurship.
2. Present various ways of marketing communication.
3. Identify the prerequisite to protect intellectual property rights
4. Analyze the challenges in protecting copy right
5. Identify the challenges in protecting trademark & other industrial design.
Course Contents:
Unit 1
The Foundations of Entrepreneurship: What's Feeding the Entrepreneurial Fire?, The Cultural Diversity of
Entrepreneurship. The Power of "Small" Business, The 10 Deadly Mistakes of Entrepreneurship. Putting Failure
into Perspective, How to Avoid the Pitfalls. Creativity, Innovation, and Entrepreneurship, Creativity—A Necessity
for Survival. Creative Thinking , Barriers to, Creativity How to Enhance Creativity, The Creative Process.
Techniques for Improving the Creative Process Protecting Your Ideas.
Unit 2
The Basics of a Marketing Communications Plan, The Operational Elements of a Marketing Communications Plan,
Selecting Advertising Media Preparing an Advertising Budget, Advertise Big on a Small Budget. Pricing Strategies
and Tactics, Pricing Strategies and Methods for Retailers Pricing. Concepts for Manufacturers, Pricing Strategies
and Methods for Service Firms The Impact of Credit on Pricing Managing Cash Flow, Cash Management, Cash and
Profits Are Not the Same. The Cash Budget, Preparing a Cash Budget, The "Big Three" of Cash Management.
Avoiding the Cash Crunch Creating a Successful Financial Plan: Basic Financial Statements Creating Projected
Financial Statements. Ratio Analysis Interpreting Business Ratios Break-Even Analysis.
Unit 3
Basic Principals of IP laws: An Introduction, Concept of Property, and Need, Protection, Criteria. Constitutional
aspects of IP, Evolution of Patent system in UK, US and India. Basis for Invention, patentability and Non-Patents:
Meaning of Patent, objectives, Regulations, Law in India. Procedure for obtaining Patent: Application.,
specifications, sealing, advertisement, etc. Grant of Patents, Compulsory License. Provisional and complete
specifications: kinds of specifications.
Unit 4
Rights conferred on a patentee: Patent rights Exceptions and limitations, Duties of Patentee. Transfer of Patent
Rights: Assignment, Kinds of Assignments License and kinds of License, Transfer of patent by law Infringement of
Patents: Construction of Claims, Patents held to be infringed or not. Action for Infringement: Institution of suit,
procedure for suit Proof for establishment of Infringement, Defense by defendant Reliefs, Injunction, Damages,
profits, drafting, data base searching for patents. Copy Rights: Introduction, Meaning and Characteristics. Author
and Owner ship of copy right: License, terms, contract.
Unit 5
Infringement of Copyright: Acts, general principles, Direct and indirect evidence of copying, Acts not constituting
the Infringement. Infringement in literary, music and dramatic. Remedies against Infringement of copyright, case
study. Trade Marks: Statutory Authorities Procedure of registration of Trade Mark, Rights and Licensing.
Infringement of trademark and action against Infringement. Industrial Design: Procedure for registration of a design
Piracy of a registered design. Case studies. Revisions
Text Books:
1. Thomas W. Zimmerer and Norman M. Scarborough: Essentials of Entrepreneurship and Small Business
Management (IV Edition), Prentice Hall, 2004.
2. Dr. B. L. Wadehhra: Intellectual Property Law Handbook, Universal Law Publishing Co. Ltd., 2002.
Reference Books:
1. P. C. Tripathi, P. N. Reddy: Principles of Management Tata McGraw Hill, 4th Edition, 2010.
2. Poornima M Charantimath : Entrepreneurship Development - Small Business Enterprises , 1st Edition, Pearson
Education – 2006
3. Dr. T Ramakrishna: Basic principles and acquisition of Intellectual Property Rights, NSLIU -2005.
Course Delivery:
The course will be delivered through lectures, presentations, classroom discussions, and case studies .
Course Assessment & Evaluation:
Indirect
Assessment
Methods
Direct
Assessment Methods
What
CI
E
Internal
Assessment
Tests
Quiz
S
E
E
To Whom
Students
Semester
End
Examination
Students
Feedback
When/ Where
(Frequency in
the course)
Thrice (Average
of the best two
will be computed)
Twice (Average
of the two will be
computed)
End of Course
(Answering
5 of 10 questions)
Max
Mark
s
Evidence
Collected
Contribution
to Course
Outcomes
30
Blue Books
1-5
20
Log record
in moodle
software
1-5
100
Answer
scripts
1-5
Middle of the
course
-
Feedback
forms
1-3, Delivery
of the course
End of the course
-
Questionnair
e
1-5, Relevance
of the course
Students
End of Course
Survey
Questions for CIE and SEE are designed in accordance with the Bloom’s taxonomy
Course outcomes:
At the end of the course the students should be able to:
1. Identity the importance of entrepreneurship
2.
3.
4.
5.
Identity and select the right marketing communication plan and financial plan
Understand Basic Principals of IP laws like Patents, etc.
Recognize the characteristics and Infringement of Copyright.
Understand the importance of Trade Marks, Industrial Design and its Infringement.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Program Outcomes
1
2
3
4
5
6
Identity the importance of entrepreneurship
X
Identify & select right media for advertisement
X
X
X
Understand Basic Principals of IP laws like Patents, etc.
Recognize the Characteristics and Infringement of Copyright
Understand the importance of Trade Marks, Industrial Design
and its Infringement
X
7
X
X
8
9
10
11
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
12
Semester:
6
Year: 2013-2014
Course Title: Object Oriented Modeling and Design
Course Code: CS617
Credits (L:T:P) : 3:0:0
Core/ Elective: core
Type of course: Lecture, Seminar
Total Contact Hours: 42
Prerequisites: Knowledge of Software Engineering. OO Fundamentals
Course Objectives:
The objective of the course is to:
1. Present students with the concept and terms used in Object Oriented Modeling using UML and to identify
modeling as a design technique
2. Develop an understanding of Class, State and Implementation Models after the process of system conception,
domain and application analysis.
3. Provide an understanding of various design patterns and their usage to solve some design problems.
4. Providing students with the necessary knowledge and skills in using object-oriented CASE tools
Course Contents
Unit 1
Introduction, Modeling Concepts, class Modeling: What is Object Orientation? What is OO development? OO themes;
Evidence for usefulness of OO development; OO modeling history. Modeling as Design Technique: Modeling; abstraction; The
three models. Class Modeling: Object and class concepts; Link and associations concepts; Generalization and inheritance; A
sample class model; Navigation of class models; Practical tips. Advanced Class Modeling, State Modeling: Advanced object
and class concepts; Association ends; N-ary associations; Aggregation; Abstract classes; Multiple inheritance; Metadata;
Reification; Constraints; Derived data; Packages; Practical tips. State Modeling: Events, States, Transitions and Conditions; State
diagrams; State diagram behavior; Practical tips.
Unit 2
Advanced State Modeling, Interaction Modeling: Advanced State Modeling: Nested state diagrams; Nested states; Signal
generalization; Concurrency; A sample state model; Relation of class and state models; Practical tips. Interaction Modeling: Use
case models; Sequence models; Activity models. Use case relationships; Procedural sequence models; Special constructs for
activity models. Process Overview, System Conception, Domain Analysis: Process Overview: Development stages;
Development life cycle. System Conception: Devising a system concept; Elaborating a concept; Preparing a problem statement.
Domain Analysis: Overview of analysis; Domain class model; Domain state model; Domain interaction model; Iterating the
analysis.
Unit 3
Application Analysis, System Design: Application Analysis: Application interaction model; Application class model;
Application state model; Adding operations. Overview of system design; Estimating performance; Making a reuse plan; Breaking
a system in to sub-systems; Identifying concurrency; Allocation of sub-systems; Management of data storage; Handling global
resources; Choosing a software control strategy; Handling boundary conditions; Setting the trade-off priorities; Common
architectural styles; Architecture of the ATM system as the example.
Unit 4
Class Design, Implementation Modeling, Legacy Systems: Class Design: Overview of class design; Bridging the gap;
Realizing use cases; Designing algorithms; Recursing downwards, Refactoring; Design optimization; Reification of behavior;
Adjustment of inheritance; Organizing a class design; ATM example. Implementation Modeling: Overview of implementation;
Fine-tuning classes; Fine-tuning generalizations; Realizing associations; Testing. Legacy Systems: Reverse engineering; Building
the class models; Building the interaction model; Building the state model; Reverse engineering tips; Wrapping; Maintenance.
Unit 5
Design Patterns: What is a pattern and what makes a pattern? Pattern categories; Relationships between patterns; Pattern
description. Communication Patterns: Forwarder-Receiver; Client-Dispatcher-Server; Publisher-Subscriber. Idioms:
Management Patterns: Command processor; View handler. Idioms: Introduction; what can idioms provide? Idioms and style;
Where to find idioms; Counted Pointer example.
Text Books:
1. Michael Blaha, James Rumbaugh: Object-Oriented Modeling and Design with UML, 2nd Edition, Pearson Education, 2005.
2. Frank Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michael Stal: Pattern-Oriented Software Architecture,
A System of Patterns, Volume 1, John Wiley and Sons, 2007.
Reference Books:
1. Grady Booch et al: Object-Oriented Analysis and Design with Applications, 3rd Edition, Pearson Education, 2007.
2. Brahma Dathan, Sarnath Ramnath: Object-Oriented Analysis, Design, and Implementation, Universities Press, 2009.
33
Course Delivery: The course will be delivered through lectures, presentations, classroom discussions, and practical
implementations. Questions for CIE and SEE are designed in accordance with the Bloom’s taxonomy.
Course Assessment and Evaluation:
Indirect
Assessment
Methods
Direct
Assessment Methods
What
To Whom
Internal
Assessment Tests
CIE
SEE
Creating models(3)
using Rational tool
for a case study
When/ Where
(Frequency in the
course)
Thrice (Average of
the best two will be
computed)
Students
Students
Feedback
End of Course
Survey
Evidence
Collected
Contribution
to Course
Outcomes
30
Blue Books
1,2,3,4,5
20
Soft copies of the
assignments
(UML Models)
1,2,3,4,5
100
Answer scripts
1,2,3,4,5
-
Feedback forms
1-3, Delivery
of the course
-
Questionnaire
1,2,3,4,5
Relevance of
the course
Review 1
Review 2
End of Course
(Answering
5 of 10 questions)
Middle of the
course
Semester End
Examination
Max
Marks
Students
End of the course
Course Outcomes:
At the end of the course the student will be able to:
1. Demonstrate an understanding of modeling as a design technique, identify and create class and state models for
a given case study.
2. Create advanced state and interaction models and apply the process of system conception and domain analysis
for any given problem.
3. Understand the process of application analysis and be able to develop a system design to a given case study
using Rational Suite.
4. Create a class design and implementation model and understand the reverse engineering process and its
importance.
5. Demonstrate an understanding of design patters and its implementation to provide solutions to some design
problems.
Mapping Course Outcomes with program Outcomes:
Program Outcomes
Course Outcomes
1
2
Demonstrate an understanding of Modeling as a design technique,
identify and create class and state models for a given case study
X
Create advanced state and Interaction Models and apply the process
of System Conception and Domain Analysis for any given problem
4
5
X
X
X
X
X
X
X
X
X
Understand the process of application Analysis and be able to
develop a System Design to a given case study using Rational Suite
X
X
X
X
X
X
Create a Class Design and Implementation Model and understand
the reverse engineering process and its importance.
X
X
X
X
X
X
X
X
X
X
X
X
Demonstrate an understanding of design patterns and its
implementation to provide solutions to some design problems.
3
6
7
8
9
10
11
12
34
Semester: 6
Year: 2013-2014
Course Title: Embedded System Laboratory
Course Code: CSL613
Credits (L:T:P) : 0:0:1
Core/ Elective: Core
Type of Course: Practical
Total Contact Hours: 28 Hrs
Prerequisites: The student must have knowledge in computer organization and microprocessors.
Course Objectives
This course will help students to achieve the following objectives:
1. Study the architecture of ARM processor and its instructions set.
2. Learn assembly and c programming in ARM GIOP
3. Learn interfacing of ARM processor with LCD, keyboard , AD convertor,
4. Design embedded system project in assembly and embedded c using ARM processor.
5. Using UART for serial transmitting and receiving data.
Course Outcomes(CO)
At the end of the course the students should be able to:
1) Demonstrate skill of writing assembly and c program and test using simulator
2) Demonstrate the use of various features of like timer, interrupts, look up table
3) Demonstrate the use of ports to interface led, lcd, keyboard
4) Interface ADC to the ARM board with a temperature sensor
5) Analyze, design and implementation an embedded project
Course Articulation Matrix:
Program Outcomes
Course OutComes
Demonstrate skill of writing assembly and c program and test
using simulator
Demonstrate the use of various features of like timer, interrupts,
look up table
Demonstrate the use of ports to interface led, lcd, keyboard
Interface ADC to the ARM board with a temperature sensor
Analyze, design and implementation an embedded project
Course Contents:
Session No.
1.
2.
3.
4.
5.
6.
7.
8.
9.
1
2
3
x
x
x
x
x
x
x
x
x
x
x
x
x
x
x
4
5
6
7
x
x
Topic
i) Swap two numbers without using an intermediate register
ii) To find the factorial of a given number
Generate 12 bit Hamming code from a given 8 bit code
i) Move a string from given memory location to another location
i)
a block
memory
to another
ii)Move
Convert
wordof
ofdata
littlefrom
endian
formatlocation
to big endian
format.
i)
Arrange
a given
set of
data inand
ascending
location
using
LOAD
multiple
STOREorder
multiple instructions.
ii)
Arrange
databetween
in descending
Exchange
agiven
blocksetof
memoryorder
locations.
i)To
Add Nanumbers
ofofdata
data
stored
consecutively
in memory
location
i)
Implement subroutine nesting using stack
Translate
the
given–THUMB
C nesting
code to (assembly.
ii) Implement
subroutine
different structure)
using
i)To
implement
ARM
interworking
to find the
for
(i=0;i<8;i++){a[i]=b[7-i];}
stack
smallest.
Part B:inCtheprograms
ii) To handle swi instruction
program
To familiarize I/O ports of LPC 2148 --- on/off control of Leds
using switches
8
9
10
11
12
x
x
x
No. of Hours
2
2
2
2
2
2
2
2
2
35
To display a given string using the LCD display interface
Interface key pad and to display the key pressed on LCD
Waveform generation using the internal DAC of LPC 2148.
To convert a given analog voltage to digital using ADC of LPC
2148. timers to generate a specified delay
Using
Using timer/counter/capture module of LPC 2148 to count the
number
of pulses
on transmitting
LCD.
Use
of UART
of and
LPCdisplay
2148 for
and receiving data
10.
11.
12.
13.
14.
15.
16.
2
2
2
2
2
2
2
Text Book:
1) “Andrew N.Sloss”, ARM system Developers Guide,Elsevier,2008
2) “William Hohl”, ARM Assembly Language – Fundamentals and Techniques ,CRC Press,2009
3) “J.R.Gibson”, ARM Assembly language An Introduction,CENGAGE Learning,2010
Course Delivery:
The course will be delivered through lectures in the laboratory with exercises.
Course Assessment and Evaluation:
What
To
Whom
Direct Assessment
Methods
Lab Test
CIE
Record
Students
Mini project
SE
E
Lab
Examination
Indirect
Assessment
Method
Students
Feedback
End of Course
Survey
When/ Where
(Frequency in the
course)
Twice(Average of the
two will be computed)
Every Week(Average of
the total score will be
computed)
Every Week(Average of
the total score will be
computed)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
20
Data sheets
1,2 ,3,4
5
Records
1,2 , 3,4
25
Viva Result
Sheets
Design and
implementation Skills
End of Course
(Executing 2 programs)
50
Answer scripts
1,2 ,3,4
Middle of the course
-
Feedback
forms
End of the course
-
Questionnaire
1, 2 , 3 & 4 Delivery of
the course
1, 2 ,3 ,4,5
Effectiveness of
Delivery of instructions
& Assessment Methods
Students
Bloom’s Taxonomy:

All CIE and SEE questions are formed according to Bloom’s Taxonomy
36
Semester: 6
Year: 2013-2014
Course Title: Compilers & Systems Programming Laboratory
Course Code: CSL618
Credits (L:T:P) : 0:0:2
Core/ Elective: Core
Type of Course: Laboratory
Total Contact Hours: 28 Hrs
Prerequisites: NIL
Course Objectives:
This course will help students to achieve the following objectives:
1. Present different phases of compilers and dealing with files
2. Provide details of tokenization and handling processes
3. Identify top down & bottom up parsing techniques and performing IPC
4. Design & implement semantic analysis phase and managing signals
5. Analyze intermediate code generation phases of compilation and managing daemon processes.
Course Contents:
Part A:
1. Designing lexical analyzer -Recognizing tokens
2. Designing Top down syntax analyzer- Elimination of left recursion, Performing left factoring, Recognizing
strings for a grammar, Designing Predictive parser
3. Designing Bottom up syntax analyzer- Designing shift reduce parser, Designing SLR parser.
4. Designing Semantic Analyzer- Typecasting of operands.
5. Generating three address code as intermediate code generation representation -Quadruples, Triples,
Indirect triples.
Part B:
1. File descriptor , Different API’s
2. Hard link and soft link , Time stamp
3. Processes , Different exec’s
4. Orphaned process, Pipes
5. Signals, Demon process
Text Books:
1.
2.
Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman: Compilers- Principles, Techniques and Tools,
2nd Edition, Addison-Wesley, 2007.
W. Richard Stevens: Advanced Programming in the UNIX Environment, Second Edition, Pearson education,
2011.
Reference Books:
1.
2.
3.
4.
5.
Kenneth C Louden: Compiler Construction - Principles & Practice, Brooks/Cole, CENGAGE learning, 1997.
Andrew W Appel: Modern Compiler Implementation in C, Cambridge University Press, 1999.
Terrence Chan: UNIX System Programming Using C++, First edition, Prentice Hall India, 2011.
Kay A Robbins and Steve Robbins: Unix Systems Programming, First Edition, Pearson Education, 2009.
Marc J. Rochkind: Advanced UNIX Programming, 2nd Edition, Pearson Education, 2009.
37
Course Delivery:
This course uses assigned readings, lectures, and homework to enable the students to: apply the compiler design and
Unix System programming concepts while programming, explore the knowledge by applying on suitable
applications.
Course Assessment and Evaluation Scheme:
Indirect Assessment
Methods
Direct
Assessment
Methods
What
CIE
To Whom
Practical
Examination
Students
SEE
Practical
Examination
Max
When/ Where
(Frequency in
the course)
Twice( Addition
of two will be
computed)
End of Course
Marks
25
25
50
-
Middle of the
course
Students Feedback
Evidence
Collected
Contribution to
Course Outcomes
Program
Answer
scripts
Program
Answer
scripts
1 to 5
Questionnaire
, Feedback
entries into
database
1 to 5, Delivery of
the course
Questionnaire
1, 2 ,3 ,4,5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
Students
End of Course
Survey
End of the course
-
1 to 5
1 to 5
Course Outcomes:
At the end of the course students should be able to:
1. Design and implement the lexical analyzer phase of compiler and file system
2. Formulate the design of top down and bottom up syntax analysis phase and deal processes
3. Recognize the top down & bottom up parsers and do communication among processes
4. Apply the typecasting of operands for semantic analysis and dealing signals
5. Demonstrate the importance of intermediate code generation and managing daemon processes
Mapping Course Outcomes with Program Outcomes:
2
3
4
Program Outcomes
5 6 7 8 9 10
Course outcomes
Design and implement the lexical analyzer phase of compiler
and file system
1
×
x
×
Formulate the design of top down and bottom up syntax analysis
phase and deal processes
Recognize the top down & bottom up parsers and do
communication among processes
Apply the typecasting of operands for semantic analysis and
dealing signals
Demonstrate the importance of intermediate code generation
and managing daemon processes
×
x
×
×
x
×
× × x
×
×
× × x
×
×
11
12
38
Semester:
6
Year: 2013-2014
Course Title: Artificial Intelligence
Course Code: CSPE611
Credits (L:T:P) : 4:0:0
Core/ Elective: Elective
Type of course: Lecture/Seminar
Total Contact Hours: 56
Prerequisites:
Knowledge of any advance programming language
Course Objectives:
The objectives of this course are to:
1. Present to the students an understanding of the basic concepts and the modern view of Artificial
Intelligence and its applications and the agent approach to AI, agent types, environments and their
applications
2. Identify the problem solving techniques that use different search methods.
3. Provide an ability to assess the applicability, strengths, and weaknesses of the different knowledge
representation and inference methods.
4. Understanding the methods of handling uncertainty, learning and planning techniques in solving
computational problems.
5. Develop an interest in the field of AI, sufficient to take more advanced and related subjects.
Course Content:
Unit 1
Introduction: What is AI? Intelligent Agents: Agents and environment, Rationality, the nature of environment, the
structure of agents. Problem-solving by search: Problem-solving agents, Example problems, searching for solution,
Uninformed search strategies.
Unit 2
Informed Search and Exploration: Informed search strategies, Heuristic functions, On-line search agents and
unknown environment. Logical Agents: Knowledge-based agents, The wumpus world, Logic, propositional logic,
Reasoning patterns in propositional logic, Effective propositional inference, Agents based on propositional logic
Unit 3
First-Order Logic: Representation revisited, Syntax and semantics of first-order logic, Using first-order logic,
Knowledge engineering in first-order logic. Interference in First-order Logic: Propositional versus first-order
inference, Unification and lifting, Forward chaining, Backward chaining, Resolution.
Unit 4
Knowledge Representation: Ontological engineering, Categories and objects, Actions, situations, and events,
Mental events and mental objects, The Internet shopping world, Reasoning systems for categories, Reasoning with
default information, Truth maintenance systems.
Planning: The Planning problem, planning with state-space approach, Planning graphs, Planning with propositional
logic.
Unit 5
Uncertainty: Acting under uncertainty, Basic probability Notations, Inference using full joint distributions,
Independence, Bayes’ rule and its use. Learning from observations: Forms of Learning, Inductive learning,
Learning decision trees, Ensemble learning, Computational learning theory. AI: Present and Future: Agent
components, Agent architectures, Are we going in the right direction? What if AI does succeed?
Text Book:
1. Stuart Russel, Peter Norvig: Artificial Intelligence - A Modern Approach, 2nd Edition, Pearson Education,
2012.
Reference Books:
1. Elaine Rich, Kevin Knight, Shivashankar B Nair: Artificial Intelligence, 3rd Edition, Tata McGraw Hill, 2011.
2. Nils J. Nilsson: Principles of Artificial Intelligence, First Edition, Elsevier, 2002.
Course Delivery: The course will be delivered through lectures, presentations, classroom discussions, and practical
implementations. Questions for CIE and SEE are designed in accordance with the Bloom’s taxonomy.
39
Course Assessment and Evaluation:
Indirect
Assessment
Methods
Direct
Assessment Methods
What
To
Whom
Internal
Assessment
Tests
CIE
Implementation
of AI
Techniques
Evidence
Collected
Contribution
to Course
Outcomes
30
Blue Books
1-5
20
Soft copies of
the
assignments
implemented
1,2,4,5
100
Answer scripts
1-5
-
Feedback
forms
-
Questionnaire
1-3, Delivery
of the course
1-5,
Relevance of
the course
End of Course
(Answering
5 of 10
questions)
Middle of the
course
Students
Feedback
End of Course
Survey
Max
Marks
Review 1
Review 2
Students
Semester End
Examination
SEE
When/ Where
(Frequency in
the course)
Thrice (Average
of the best two
will be
computed)
Students
End of the
course
Course Outcomes:
At the end of the course students should be able to:
1. Understand the modern view of AI and its application based on agent philosophy.
2.
3.
4.
5.
Demonstrate an understanding of various searching algorithms commonly used in AI by implementing them.
Understanding the various knowledge representation and inference techniques.
Demonstrate an understanding of the role of learning and planning techniques in building AI systems.
Recognize the various methods of handling uncertainty.
Mapping Course Outcomes with program Outcomes:
Course Outcomes
Program Outcomes*
1
Understand the modern view of AI and its application
based on agent philosophy
2
3
4
X
5
X
Demonstrate an understanding of various searching
algorithms commonly used in AI by implementing them.
X
X
Understanding the various knowledge representation and
inference techniques.
X
X
Demonstrate an understanding of the role of learning and
planning techniques in building AI systems.
X
X
X
Recognize the various methods of handling uncertainty.
X
X
X
X
6
7
X
X
8
9
10
X
X
X
X
X
X
X
X
X
X
X
X
11
40
12
Semester:
6
Year: 2013-2014
Course Title: Advanced DBMS
Course Code: CSPE613
Credits (L:T:P) : 3:0:1
Core/ Elective: Elective
Type of course: Lecture, Practical
Total Contact Hours: 56 Hrs
Course Content:
Unit 1
Overview of Storage and Indexing, Disks and Files: Data on external storage, File organizations and indexing,
Index data structures, Comparison of file organizations, Indexes and performance tuning. Memory hierarchy, RAID,
Disk space management, Buffer manager, Files of records, Page formats and record formats. Tree Structured
Indexing: Intuition for tree indexes, Indexed sequential access method, B+ trees, Search, Insert, Delete, Duplicates,
B+ trees in practice.
Unit 2
Hash-Based Indexing: Static hashing, Extendible hashing, Linear hashing, comparisons. Overview of Query
Evaluation, External Sorting: The system catalog, Introduction to operator evaluation, Algorithms for relational
operations, Introduction to query optimization, Alternative plans: A motivating example, What a typical optimizer
does. When does a DBMS sort data? A simple two-way merge sort, External merge sort.
Unit 3
Evaluating Relational Operators: The Selection operation, General selection conditions, The Projection operation,
The Join operation, The Set operations, Aggregate operations, The impact of buffering. A Typical Relational Query
Optimizer: Translating SQL queries into Relational Algebra, Estimating the cost of a plan, Relational algebra
equivalences, Enumeration of alternative plans, Nested sub-queries, Other approaches to query optimization.
Unit 4
Physical Database Design and Tuning: Introduction, Guidelines for index selection, examples, Clustering and
indexing, Indexes that enable index-only plans, Tools to assist in index selection, Overview of database tuning,
Choices in tuning the conceptual schema, Choices in tuning queries and views, Impact of concurrency, DBMS
benchmarking.
Unit 5
More Recent Applications: Mobile databases, Multimedia databases, Geographical Information Systems, Genome
data management.
Text Books:
1. Raghu Ramakrishnan and Johannes Gehrke: Database Management Systems, 3 rd Edition, McGraw-Hill,
2007.
2. Elmasri and Navathe: Fundamentals of Database Systems, 5th Edition, Addison-Wesley, 2011.
Reference Book:
1. Connolly and Begg: Database Systems, 4th Edition, Pearson Publications, 2012.
41
Semester:
6
Year: 2013-2014
Course Title: Digital Signal Processing
Course Code: CSPE614
Credits (L:T:P) : 4:0:0
Core/ Elective: Elective
Type of course: Lecture, Seminar
Total Contact Hours: 56 Hrs
Course Content:
Unit 1
The Discrete Fourier Transform: Its Properties and Applications: Frequency Domain Sampling: The Discrete
Fourier Transform: Frequency Domain Sampling and Reconstruction of Discrete-Time Signals, The Discrete
Fourier Transform (DFT), The DFT as a Linear Transformation, Relationship of the DFT to other Transforms.
Properties of the DFT: Periodicity, Linearity and Symmetry Properties, Multiplication of Two DFT’s and Circular
Convolution, Additional DFT Properties, Linear Filtering Methods Based on the DFT: Use of the DFT in Linear
Filtering, Filtering of Long Data Sequences, Frequency Analysis of Signals using the DFT.
Unit 2
Efficient Computation of the DFT: Fast Fourier Transform Algorithms: Efficient Computation of the DFT: FFT
Algorithms : Direct Computation of the DFT, Divide-and-Conquer Approach to Computation of the DFT, Radix-2
FFT Algorithms, Radix-4 FFT Algorithms, Split-Radix FFT Algorithms, Implementation of FFT Algorithms.
Applications of FFT Algorithms: Efficient computation of the DFT of Two Real Sequences, Efficient computation
of the DFT of a 2N-Point Real Sequence, Use of the FFT Algorithm in Linear filtering and Correlation. A Linear
filtering approach to Computation of the DFT: The Goertzel Algorithm, The Chirp-Z Transform Algorithm.
Quantization Effects in the Computation of the DFT: Quantization Errors in the Direct Computation of the DFT,
Quantization Errors in FFT Algorithms.
Unit 3
Implementation of Discrete-Time Systems: Structures for the Realization of Discrete-Time Systems. Structures
for FIR Systems: Direct-Form Structures, Cascade-Form Structures, Frequency-Sampling Structures, Lattice
Structure. Structures for IIR Systems: Direct-Form Structures, Signal Flow Graphs and Transposed Structures,
Cascade-Form Structures, Parallel-Form Structures, Lattice and Lattice-Ladder Structures for IIR Systems. StateSpace System Analysis and Structures: State-Space Descriptions of Systems Characterized by Difference Equations,
Solution of the State-Space Equations, Relationships between Input-Output and State-Space Descriptions, StateSpace Analysis in the Z-Domain.
Unit 4
Implementation of Discrete-Time Systems: Quantization of Filter Coefficients: Analysis of Sensitivity to
Quantization of Filter Coefficients, Quantization of Coefficients in FIR Filters. Round-Off Effects in Digital Filters:
Limit-Cycle Oscillations in Recursive Systems, Scaling to Prevent Overflow, Statistical Characterization of
Quantization effects in Fixed-Point Realizations of Digital Filters.
Unit 5
Design of Digital Filters: General Considerations: Causality and its Implications, Characteristics of Practical
Frequency-Selective Filters. Design of FIR Filters: Symmetric And Antisymetric FIR Filters, Design of LinearPhase FIR Filters Using Windows, Design of Linear-Phase FIR Filters by the Frequency-Sampling Method, Design
of Optimum Equiripple Linear-Phase FIR Filters, Design of FIR Differentiators, Design of Hilbert Transformers,
Comparison of Design Methods for Linear-Phase FIR filters.
Text Book:
1. John G. Proakis and Dimitris G. Manolakis: Digital Signal Processing, 4th Edition, Pearson Education,
2012.
Reference Book:
1. Paulo S. R. Diniz, Eduardo A. B. da Silva And Sergio L. Netto: Digital Signal Processing - System
Analysis and Design, First edition, Cambridge University Press, 2008.
42
Semester:
6
Year: 2013-2014
Course Title: C# and .NET Technologies
Course Code: CSPE615
Credits (L:T:P) : 3:0:1
Core/ Elective: Elective
Type of course: Lecture, Practical
Total Contact Hours: 56 Hrs
Prerequisites: Knowledge of any object oriented programming language
Course Objectives:
The objectives of this course are to
1. Provide the concepts of fundamentals of Object oriented programming.
2. Implement the C# programming and .NET features
3. Design the C# applications to solve real world problems.
4. Analyze the real world problems to solve using object-oriented approach
5. Implement the advanced concepts of C# programming
Course Content:
Unit 1
The philosophy of .NET: Understanding the Previous State of Affairs, The .NET Solution, The Building Block of
the .NET Platform (CLR,CTS, and CLS), The Role of the .NET Base Class Libraries, What C# Brings to the Table,
An Overview of .NET Binaries ( aka Assemblies ), the Role of the Common Intermediate Language , The Role of
.NET Type Metadata, The Role of the Assembly Manifast, Building C# Applications: The Role of the Command
Line Complier (csc.exe), Building C # Application using csc.exe Working with csc.exe Response Files, Generating
Bug Reports , Remaining C# Compiler Options,
Unit 2
C# Language Fundamentals: The Anatomy of a Basic C# Class, Creating objects: Constructor Basics, The
Composition of a C# Application, Default Assignment and Variable Scope, The C# Member Initialization Syntax,
Basic Input and Output with the Console Class, Understanding Value Types and Reference Types, The Master
Node: System, Object, Object- Oriented Programming with C#: Forms Defining of the C# Class, Definition the
“Default Public Interface” of a Type, C#’s Inheritance Supports, keeping Family Secrets: The “ Protected”
Keyword, Nested Type Definitions, The Third Pillar: C #’s Polymorphic Support, Casting Between.
Unit 3
Exceptions and Object Lifetime: Ode to Errors, Bugs, and Exceptions, The Role of .NET Exception Handing, the
System. Exception Base Class, Throwing a Generic Exception, Catching Exception, CLR System – Level Exception
(System. System Exception), Custom Application- Level Exception (System. System Exception), Interfaces and
Collections: Defining Interfaces Using C# Invoking Interface Members at the object Level, Exercising the Shapes
Hierarchy, Exploring the system. Collections Namespace, Building a Custom Container (Retrofitting the Cars
Type).
Unit 4
Callback Interfaces, Delegates, and Events, Advanced Techniques: Understanding Callback Interfaces,
Understanding the .NET Delegate Type, Members of System. Multicast Delegate, The Simplest Possible Delegate
Example, Building More a Elaborate Delegate Example, Conversion Routines, Defining Implicit Conversion
Routines, The Internal Representations of Customs Conversion Routines.
Unit 5
Advanced C# type construction techniques: Understanding .NET Assembles: Probing for Private Assemblies (
The Details), Understanding Shared Assembly, Understanding Shared Names, Building a Shared Assembly,
Understanding Delay Signing, Installing/Removing Shared Assembly, Using a Shared Assembly.
Lab Experiments:
1. Program to build C# application using csc.exe
2. Generating bug reports and working with c# compiler options
3. Experiments on C# language fundamentals
4. Programs to implement basic object oriented features in C#
5. Program on exception handling and dealing with object lifetime
6. Programs to implement interfaces in C#
7. Programs to demonstrate usage of delegates
43
8. Programs to demonstrate working of events
9. Programs to build a multifile assemblies
10. Programs to build and use a shared assemblies
Text Books:
1. Andrew Troelsen: Pro C# with .NET 3.0, First Edition, Apress Springer India, 2011.
2. E. Balagurusamy: Programming in C#, 3rd Edition, Tata McGraw Hill, 2012.
Reference Books:
1. Matthew MacDonald, Adam Freeman: Pro ASP.NET 4 in C# 2010, Fourth edition, Apress, 2011.
Indirect
Assessment
Methods
Direct
Assessment Methods
Course Delivery
The course will be delivered through lectures, presentations, classroom discussions, practice exercises and practical
sessions.
Course Assessment and evaluation:
When/ Where
Contribution
To
Max
Evidence
What
(Frequency in
to Course
Whom
Marks
Collected
the course)
Outcomes
Internal
Thrice (Average
Assessment
of the best two
25
Blue Books
1-5
Tests
will be computed)
CIE
Twice (Average
Practical exams Students
of the two will be
25
Data Sheets
1-5
computed)
End of Course
Semester End
Answer
SEE
(Answering
100
1-5
Examination
scripts
5 of 10 questions)
Students
Middle of the
Feedback
1-4, Delivery of
Feedback
course
forms
the course
End of Course
Survey
Students
End of the course
-
Questionnaire
1-5, Relevance
of the course
Course Outcomes:
At the end of the course students should be able to:
1. Understand conceptual framework of .Net environment
2. Create Configuration for a given machine to host the .NET runtime
3. Design .NET assemblies
4. Design the C# program with well understanding of C# language constructs
5. Conduct experiments with object oriented concepts in C# to solve real world problems
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Understand conceptual framework of .Net environment
Create Configuration for a given machine to host the .NET
runtime
Design .NET assemblies
Design the C# program with well understanding of C#
language constructs
Conduct experiments with object oriented concepts in C# to
solve real world problems
Program Outcomes
1
2
3
4
5
6
7
8
9
10
11
12
X
X
X X
X
X
X
X X
X
X
X
X X
X
X
44
Semester:
6
Year: 2013-2014
Course Title: Information Retrieval
Course Code: CSPE616
Credits (L:T:P) : 2:0:1
Core/ Elective: Elective
Type of course: Lecture, Practical
Total Contact Hours: 42 Hrs
Course Content:
Unit 1
Introduction: Data Retrieval & Information Retrieval, Automatic Text Analysis, Luhn's ideas, Conflation
Algorithm, Indexing and Index Term Weighing, Automatic Classification, Measures Of Association, Different
Matching Coefficient, Classification methods, Cluster Hypothesis, Single Link Algorithm.
Unit 2
IR Models: Basic concepts, Boolean Model, Vector Model, Probabilistic model, Fuzzy Set Model, Extended
Boolean Model, Latent Semantic Indexing, Neural Network Model, Genetic Algorithms, File Structures, Inverted
file, Other Indices for text.
Unit 3
Boolean Queries: Sequential searching, Pattern matching, Structural queries, Compression. Performance Evaluation
– precision and recall, Alternative measures, Reference Collection (TREC Collection).
Unit 4
Parallel Information Retrieval: Distributed Information Retrieval, MIMD Architectures. Collection Partitioning,
Source Selection, Query Processing.
Unit 5
Multimedia IR: Introduction, data modeling, Query languages, Spatial access methods. A general multimedia
indexing approach. One dimensional time series, Two dimensional color images, Automatic picture extraction.
Text Books:
1. Ricardo Baeza-Yates, Berthier Ribeiro-Neto: Modern Information Retrieval, First edition, Pearson
Education, 2011.
2. C.J. van Rijsbergen: Information Retrieval, Second Edition, Butterworth-Heinemann, 1979.
(http://www.dcs.gla.ac.uk/Keith/Preface.html#PREFACE)
Reference Book:
1. William B Frakes, Ricardo Baeza Yates: Information Retrieval Data Structures and Algorithms, First
edition, Pearson Education, 2009.
45
Semester:
6
Year: 2013-2014
Course Title: Internet Technologies
Course Code: CSPE617
Credits (L:T:P) : 2:0:1
Core/ Elective: Elective
Type of course: Lecture, Practical
Total Contact Hours: 42 Hrs
Prerequisites: Nil
Course Objectives:
The objectives of this course are to
1. Identify a valid standards-conformant HTML document involving a variety of element types, including
hyperlinks, images, lists, tables, and forms using CSS.
2. Analyze how JavaScript programs are used to create interactive web page including the use of event-handlers
and the Document Object Model.
3. Implement Perl scripts to parse and manipulate structured data.
4. Design simple database driven web applications using a server-side scripting language.
5. Design web applications using the powerful Rails framework
Course Content:
Unit 1
Fundamentals XHTMLand CSS: XHTML: Basic syntax, Standard structure, Basic text markup, Images, Hypertext
Links, Lists. Tables, Forms, Frames. CSS: Introduction, Levels of style sheets, Selector forms, Property value forms,
Font properties, List properties, Color, Alignment of text, The box model, Background images, The <span> and
<div> tags.
Unit 2
Javascript: Overview of Javascript, Syntactic characteristics, Primitives, operations, and expressions, Screen output
and keyboard input, Control statements, Object creation and modification, Arrays, Functions, Constructor, Pattern
matching using regular expressions, Errors in scripts, Examples. Javascript and HTML Documents, Dynamic
Documents with Javascript: The Javascript execution environment, The Document Object Model, Element access in
Javascript, Events and event handling, Handling events from the Body elements, Button elements, Text box and
Password elements.
Unit 3
XML : Introduction, Syntax, Document structure, Document Type definitions, Namespaces, XML schemas,
Displaying raw XML documents, Displaying XML documents with CSS, XSLT style sheets, XML processors, Web
services. Perl, CGI Programming: Origins and uses of Perl, Scalars and their operations, Assignment statements and
simple input and output, Control statements, Fundamentals of arrays, Hashes, References, Functions, Pattern
matching, file input and output, Examples. The Common Gateway Interface, CGI linkage, Query string format,
CGI.pm module, A survey example, Cookies.
Unit 4
PHP: Origins and uses of PHP, Overview of PHP, General syntactic characteristics, Primitives, operations and
expressions, Output, Control statements, Arrays, Functions, Pattern matching, Form handling, Files, Cookies,
Session tracking. Database Access: Relational databases, Architectures for database access, MySQL, Database
access with Perl and MySQL, Database access with PHP and MySQL.
Unit 5
Ruby, Rails: Origins and uses of Ruby, Scalar types and their operations, Simple input and output, Control
statements, Arrays, Hashes, Methods, Classes, Code blocks and iterators, Pattern matching.Overview of Rails,
Document requests, Processing forms, Rails applications with Databases, Layouts.
Text Book:
1. Robert W. Sebesta: Programming the World Wide Web, 4th edition, Pearson education, 2012.
Reference Books:
1. M. Deitel, P.J. Deitel, A. B. Goldberg: Internet & World Wide Web How to H program, 4th Edition, Pearson
education, 2011.
2. Chris Bates: Web Programming Building Internet Applications, 3rd Edition, Wiley India, 2011.
3. Joyce Farrell, Xue Bai, Michael Ekedahl: The Web Warrior Guide to Web Programming, First edition,
Thomson, 2010.
46
Course Delivery: The course will be delivered through lectures, presentations, classroom discussions, and practical
implementations. Questions for CIE and SEE are designed in accordance with the Bloom’s taxonomy.
Course Assessment and Evaluation:
When/Where
(frequency in the
course)
Max
Marks
Evidence
Collected
Contributing to
course outcome
Internal
Assessment
test
Thrice (Average of
best two)
25
Blue Books
1-5
Lab test +Mini
Project
Once
25
Quiz answers
1-5
Standard
Examination
End of
course(Answering 5
out of 10 questions)
100
Answer scripts
1 -5
Students
feedback
Middle of the course
-
Feedback
forms
1, 2 & 3 Delivery of
the course
Questionnaires
1-5 Effectiveness of
delivery of
instructions and
Assessment methods
Indirect
Assessment
Method
Direct Assessment method
What
C
I
E
To
Whom
Students
S
E
E
End of course
survey
Students
End of course
Course Outcomes (CO):
At the end of the course students should be able to:
1. Demonstrate the ability to use the World Wide Web and understand how Web pages are designed and
created using XHTML and CSS.
2. Apply java Script to add dynamic content to web page.
3. Create well-formed XML documents, and apply perl for text and file processing and write CGI
applications.
4. Design dynamic data-driven Web sites using MySQL and PHP and perl
5. Apply MVC design pattern to write database-backed Web Applications using the Ruby on Rails
Framework .
Mapping of Course Outcomes with Programme Outcomes:
Course Outcomes
Demonstrate the ability to use the World Wide Web and
understand how Web pages are designed and created using
XHTML and CSS
Apply java Script to add dynamic content to web page.
Create well-formed XML documents, and apply Perl for text
and file processing and write CGI applications.
Design dynamic data-driven Web sites using MySQL and
PHP and Perl
Apply MVC design pattern to write database-backed Web
Applications using the Ruby on Rails Framework
Program Outcomes
1
2
3
X
X
X
X
4
5
6
X
X
X
X
X
X
X
8
9
10
X
X
X
X
11
12
X
X
X
7
X
X
X
X
X
47
Semester:
6
Year: 2013-2014
Course Title: Information on Demand
Course Code: CSPE618
Credits (L:T:P) : 2:0:1
Core/ Elective: Elective
Type of course: Lecture, Practical
Total Contact Hours: 42 Hrs
Course Content:
Unit 1
Introduction: emerging trends of Information management Evolution of IOD, Developments in Relational
databases, XML processing capabilities, Pure query, tools for common operations. Enterprise content management:
technologies, strategies, methods and tools used to capture, manage, store, preserve, and deliver content and
documents related to an organization and it’s processes. Introduction to records management and compliance,
categorization of large volumes of data (content classification and search).
Unit 2
Information integration: Process of information integration, using data abstraction to provide a single interface for
viewing all the data within an organization, techniques to arrive at a single set of structures and naming conventions
to get a large set of heterogeneous data sources to appear to a user or system as a single , homogeneous data source.
Data Warehousing: Techniques, methods and strategies to retrieve and analyze data, to extract, transform and load
data, and to manage the data dictionary for a data warehousing system.
Unit 3
Master data management: overview and concepts for collecting, aggregating, matching, consolidating, quality
assuring, persisting and distributing such(Non-transactional) data to ensure consistency an control in the ongoing
maintenance and application use of this information. Introduction to domains, overview of key concepts and benefits
of MDM. Trends in data replication: Overview of replication methods, log based replication, challenges of
replication in distributed data environments, Advantages of replication in Disaster recovery and high availability
processes.
Unit 4
Business Intelligence: Introduction to business Intelligence and performance management . Reporting and
Analytics, Concepts, techniques and Methods to help a business acquire a better understanding of its commercial
context. OLAP, analytics, data mining, business performance management, benchmarks, text mining and predictive
analytics. Meta data management, concepts to drive data Lineage from databases to reporting.
Unit 5
Integrated data management, challenges in data growth management, data privacy compliance, e-discovery,
migration to different data repositories. Applied intelligence: real world implementation on Information Integration
and Analytics: Threat and Fraud detection, Usage of RFID technology to track flow of information in a supply
chain. Mashups- their relevance in Enterprises.
Text Book:
1. Paul Zikopoulos, George Baklarz, Chris Eaton, Leon Katsnelson : Information on Demand - Introduction
to DB2 9 New Features, McGraw-Hill Professional, 2007.
Reference Book:
1. Adrienne Tannenbaum: Metadata Solutions - Using Metamodels, Repositories, XML, and Enterprise
Portals to Generate Information on Demand, 1st edition, Addison-Wesley Professional, 2001.
48
Semester:
6
Year: 2013-2014
Course Title: Game Theory
Course Code: CSPE619
Credits (L:T:P) : 3:0:0
Core/ Elective: Elective
Type of course: Lecture
Total Contact Hours: 42 Hrs
Course Content:
Unit 1
Introduction: Strategic Games: What is game theory? The theory of rational choice, Interacting decision makers.
Strategic games, Example: The prisoner’s dilemma, Nash equilibrium, Examples of Nash equilibrium, Bestresponse functions, Dominated actions, Equilibrium in a single population: symmetric games and symmetric
equilibria.
Unit 2
Mixed Strategy Equilibrium: Introduction, Strategic games in which players may randomize, Mixed strategy Nash
equilibrium, Dominated actions, Pure equilibria when randomization is allowed, illustration, Equilibrium in a single
population, illustration, The formation of players’ beliefs, Extensions, Representing preferences by expected
payoffs. Extensive Games: Extensive games with perfect information, Strategies and outcomes, Nash equilibrium,
Subgame perfect equilibrium, Finding subgame perfect equilibria of finite horizon games.
Unit 3
Extensive games: Extensions, Coalitional Games and the Core: Extensions: Allowing for simultaneous moves,
illustration: entry into a monopolized industry, Discussion: subgame perfect equilibrium and backward induction.
Coalition games, The core, Illustration: ownership and the distribution of wealth, Other solution concepts. Bayesian
Games: Motivational examples, General definitions, Two examples concerning information, Illustration: auctions,
Auctions with an arbitrary distribution of valuations. Extensive games with imperfect information, Strategies, Nash
equilibrium, Beliefs and sequential equilibrium, Signaling games, Illustration: strategic information transmission.
Unit 4
Strictly Competitive Games, Rationalizability: Strictly competitive games and maximization, Maximization and
Nash equilibrium, Strictly competitive games, Maximization and Nash equilibrium in strictly competitive games.
Rationalizability, Iterated elimination of strictly dominated actions, Iterated elimination of weakly dominated
actions, Dominance solvability. Evolutionary Equilibrium, Iterated Games:
Monomorphic pure strategy equlibrium, Mixed strategies and polymorphic equilibrium,
Asymmetric contests, Variations on themes: Sibling behavior, Nesting behavior of wasps, the evolution of sex ratio.
Unit 5
Repeated games: The main idea, Preferences, Repeated games, Finitely and infinitely repeated Prisoner’s dilemma,
Strategies in an infinitely repeated Prisoner’s dilemma, Some Nash equilibria of an infinitely repeated Prisoner’s
dilemma. Repeated Games: General Results, Bargaining: Nash equilibria of general infinitely repeated games,
Subgame perfect equilibria of general infinitely repeated games, Finitely repeated games, Imperfect observability.
Bargaining as an extensive game, Trade in market as an illustration, Nash’s axiomatic model, Relation between
strategic and axiomatic models.
Text Book:
1. Martin Osborne: An Introduction to Game Theory, Oxford University Press, Indian Edition, 2011.
Reference Books:
1. Roger B. Myerson: Game Theory - Analysis of Conflict, Harvard University Press, 2010.
2. Andreu Mas-Colell, Michael D. Whinston, and Jerry R. Green: Microeconomic Theory. Oxford University
Press, New York, 2011.
49
Semester:
6
Year: 2013-2014
Course Title: System Simulation
Course Code: CSPE620
Credits (L:T:P) : 3:0:0
Core/ Elective: Elective
Type of course: Lecture
Total Contact Hours: 42 Hrs
Course Content:
Unit 1
Introduction: When simulation is the appropriate tool and when it is not appropriate, Advantages and
disadvantages of Simulation, Areas of application, Systems and system environment, Components of a system,
Discrete and continuous systems, Model of a system, Types of Models, Discrete-Event System Simulation, Steps in
a Simulation Study. Simulation examples: Simulation of queuing systems, Simulation of inventory systems, Other
examples of simulation.
Unit 2
General Principles, Simulation Software: Concepts in Discrete-Event Simulation: The Event-Scheduling / TimeAdvance Algorithm, World Views, Manual simulation Using Event Scheduling, List processing. Simulation in Java,
Simulation in GPSS. Queuing Models: Characteristics of Queuing Systems.
Unit 3
Random-Number Generation, Random-Variate Generation: Properties of random numbers, Generation of
pseudo-random numbers, Techniques for generating random numbers, Tests for Random Numbers. Random-Variate
Generation: Inverse transform technique, Acceptance-Rejection technique, Special properties.
Unit 4
Input Modeling: Data Collection, Identifying the distribution with data, Parameter estimation, Goodness of Fit
Tests, Fitting a non-stationary Poisson process, Selecting input models without data, Multivariate and Time-Series
input models.
Unit 5
Output Analysis for a Single Model: Types of simulations with respect to output analysis, Stochastic nature of
output data, Measures of performance and their estimation, Output analysis for terminating simulations, Output
analysis for steady-state simulations. Verification and Validation of Simulation Models: Model building, verification
and validation, Verification of simulation models, Calibration and validation of models. Optimization via
Simulation.
Text Book:
1. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol: Discrete-Event System Simulation, 4th
Edition, Pearson Education, 2012.
Reference Books:
1. Lawrence M. Leemis, Stephen K. Park: Discrete – Event Simulation: A First Course, First edition, Pearson
/ Prentice-Hall, 2006.
2. Averill M. Law: Simulation Modeling and Analysis, 4th Edition, Tata McGraw-Hill, 2011.
50
Semester:
6
Year: 2013-2014
Course Title: Pattern Recognition
Course Code: CSPE621
Credits (L:T:P) : 4:0:0
Core/ Elective: Elective
Type of course: Lecture
Total Contact Hours: 56 Hrs
Course Content:
Unit 1
Introduction: Machine perception, an example, Pattern Recognition System, The Design Cycle, Learning and
Adaptation. Bayesian Decision Theory: Introduction, Bayesian Decision Theory, Continuous Features, Minimum
error rate, classification, classifiers, discriminant functions, and decision surfaces, the normal density, Discriminant
functions for the normal density.
Unit 2
Maximum-likelihood and Bayesian Parameter Estimation: Introduction, Maximum-likelihood estimation,
Bayesian Estimation, Bayesian parameter estimation: Gaussian Case, general theory, Hidden Markov Models. Nonparametric Techniques: Introduction, Density Estimation, Parzen windows, kn – Nearest- Neighbor Estimation, The
Nearest- Neighbor Rule, Metrics and Nearest-Neighbor Classification.
Unit 3
Linear Discriminant Functions: Introduction, Linear Discriminant Functions and Decision Surfaces, Generalized
Linear Discriminant Functions, The Two-Category Linearly Separable case, Minimizing the Perception Criterion
Functions, Relaxation Procedures, Non-separable Behavior, Minimum Squared-Error procedures, The Ho-Kashyap
procedures. Stochastic Methods: Introduction, Stochastic Search, Boltzmann Learning, Boltzmann Networks and
Graphical Models, Evolutionary Methods.
Unit 4
Non-Metric Methods: Introduction, Decision Trees, CART, Other Tree Methods, Recognition with Strings,
Grammatical Methods.
Unit 5
Unsupervised Learning and Clustering: Introduction, Mixture Densities and Identifiability, Maximum-Likelihood
Estimates, Application to Normal Mixtures, Unsupervised Bayesian Learning, Data Description and Clustering,
Criterion Functions for Clustering.
Text Book:
1. Richard O. Duda, Peter E. Hart, and David G.Stork: Pattern Classification, 2nd Edition, Wiley-Interscience,
2012.
Reference Book:
1. Earl Gose, Richard Johnsonbaugh, Steve Jost: Pattern Recognition and Image Analysis, First Edition, PHI,
2009.
51