You are on page 1of 53

Subject Name: Compiler Design

Subject Code: CE 701


Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

04

00

02

06

Total

Theory

Credit

Hrs Marks
5

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:
The objective of this course is to introduce students to the following concepts underlying the
design and implementation of compilers.

Describe the steps and algorithms used by compilers.


Recognize the underlying formal models such as finite state automata, push-down
automata and their connection to language definition through regular expressions and
grammars.
Discuss the effectiveness of optimization.
Explain the impact of a separate compilation facility and the existence of program
libraries on the compilation process.

Outline of the Course:


Sr. No
1
2
3

Title of the Unit

4
5
6

Introduction to Compiling
Lexical Analyzer
Parsing Theory
Syntax Analyzer
Syntax Directed Translation
Error Recovery
Type Checking
Run Time Environments

7
8
9

Intermediate Code Generation


Code Generation
Code Optimization
Page 1 of 53

Minimum
Hours
6
6
18

3
4
6
5
7
5

Total hours (Theory): 60


Total hours (Practical): 30
Total hours: 90

Detailed Syllabus:
Sr.
No
1

3.1

3.2

Topic
Introduction to Compiling
Overview of the Translation Process- A Simple Compiler,
Difference between interpreter, assembler and compiler
Overview and use of linker and loader ,
types of Compiler,
Analysis of the Source Program,
The Phases of a Compiler,
Cousins of the Compiler, The Grouping of Phases,
Front-end and Back-end of compiler,
Pass structure
A simple one-pass compiler: overview
Lexical Analyzer
Introduction to Lexical Analyzer,
Input Buffering,
Specification of Tokens,
Recognition of Tokens,
A Language for Specifying Lexical Analyzers,
Finite Automata From a Regular Expression,
Design of a Lexical Analyzer Generator,
Optimization of DFA
Parsing Theory- Syntax Analyzer
The role of a parser
Context free grammars
Top Down and Bottom up Parsing Algorithms,
Top-Down Parsing, Bottom-Up Parsing,
Operator-Precedence Parsing,
LR Parsers,
Using Ambiguous Grammars,
Parser Generators,
Automatic Generation of Parsers.
Parsing Theory- Syntax Directed Translation
Syntax-Directed Definitions,
Construction of Syntax Trees,
Bottom-Up Evaluation of S-Attributed Definitions,
L-Attributed Definitions,
Syntax directed definitions and translation schemes
Page 2 of 53

Lecture
Hours

Weight
age(%)

06

10

06

20

12

25

06

Error Recovery
Error Detection & Recovery,
Ad-Hoc and Systematic Methods
Type Checking
Type systems
Specification of a simple type checker
Type conversions
Run Time Environments
Source Language Issues,
Storage Organization,
Storage-Allocation Strategies,
Parameter Passing,
Symbol Tables,
Language Facilities for Dynamic Storage Allocation,
Dynamic Storage Allocation Techniques.
Intermediate Code Generation
Different Intermediate Forms,
Implementation of Three Address Code
Intermediate code for all constructs of programming languages
(expressions, if-else, loops, switch case etc.)
Code Generation
Issues in the Design of a Code Generator
Basic Blocks and Flow Graphs
A Simple Code Generator
Register Allocation and Assignment
The DAG Representation of Basic Blocks
Peephole Optimization
Dynamic Programming Code-Generation Algorithm
Code Optimization
Global Data Flow Analysis,
A Few Selected Optimizations like Command Sub Expression
Removal, Loop Invariant Code Motion, Strength Reduction Etc.
Optimization of basic blocks

03

04

06

05

10

07

10

05

60

100

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Page 3 of 53

Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

STUDENTS LEARNING OUTCOMES:


On successful completion of the course, the student will:
Understand how the design of a compiler requires most of the knowledge acquired
during their study.
Develop a firm and enlightened grasp of concepts learned earlier in their study like
higher level programming, assemblers, automata theory, and formal languages.
Apply the ideas, the techniques, and the knowledge acquired for the purpose of other
language processor design.
Working skills in theory and application of finite state machines, recursive descent,
production rules, parsing, and language semantics.
Know about the powerful compiler generation tools, which are useful to the other
non-compiler applications
Reference Books:
1. Compilers, Principles, Techniques and Tools by A.V. Aho, R. Sethi and J.D.Ullman,
Pearson
2. Advanced compiler Design Implementation by Steven S. Muchnick
3. The Compiler Design handbook: Optimization and Machine Code Generation by Y. N.
Shrikant and Priti Shankar, Second Edition
4. Charles N. Fischer, Richard J. leBlanc, Jr.- Crafting a Compiler with C, Pearson
Education, 2008.

List of Practical:
Sr. No.
1
2.

3.

Name of Experiment
Implement a C program to identify keywords and identifiers using finite automata.
Implementation of lex programs.
a. Write a lex program to identify numbers, words and other characters and
generate tokens for each.
b. Write a lex program to identify all occurrences of LDRP and replace it with
COLLEGE.
Implementation of lex programs
a. To display the length of each word.
b. To change the case of the first letter of every word.
c. To count the number of characters, words and lines in the given input.
Page 4 of 53

4.

5.

6.
7.
8.
9.

10.

Implementation of lex programs


a. To remove empty lines.
b. Write a lex program that will replace the word Hello with ldrp if the line
starts with the letter a and with college if it starts with b.
c. Write a lex program to identify words followed by punctuation marks.
Implementation of lex programs
a. To display the comments from given input file.
b. To identify all the lexemes from input file that follows the given RE. Provide
the RE and input file as command line arguments.
Generate a lexer for C program.
Write a C program to eliminate left recursion from a production.
Write a C program to apply left factoring to a production.
Implementation of Yacc programs.
a. Write a Yacc program for desktop calculator with ambiguous grammar.
b. Write a Yacc program for desktop calculator with ambiguous grammar and
additional information.
Implementation of Yacc program: Write a Yacc program for calculator with
unambiguous grammar.

Page 5 of 53

Subject Name: Next Generation Networks


Subject Code: CE 702
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

04

00

02

06

Total

Theory

Credit

Hrs Marks
5

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:
To learn Wireless technologies and Ad-hoc Network.

Outline of the Course:


Sr.
No
1

Title of the Unit


Basic history of Mobile Computing

Minimum
Hours
11

Overview of Wireless n/w. and Technologies

13

General packet radio service(GPRS)

10

Infrastructure and ad-hoc network

13

Wireless Application Protocol(WAP) WAP,MMS,GPRS application


CDMA and 3G

13

Total hours (Theory): 60


Total hours (Lab): 30
Total hours: 90

Page 6 of 53

Detailed Syllabus
Sr.
No
1.

2.

3.

4.

5.

Lecture Weight
Hours age(%)

Topic
Basic history of Mobile Computing
Architecture for mobile computing, Three tier architecture,
design considerations for mobile computing, mobile
computing through internet, Wireless network architecture,
Applications, Security, Concerns and Standards, Benefits,
Future. Evolution of mobile computing.
Overview of Wireless n/w. and Technologies
Introduction, Different generations. Introduction to 1G, 2G,
3G
and
4G,
Bluetooth,
Radio
frequency
identification(Rfid),Wireless
Broadband,
Mobile
IP:
Introduction, Advertisement, Registration, TCP connections,
two level addressing, abstract mobility management model,
performance issue, routing in mobile host, Adhoc networks,
Mobile transport layer: Indirect TCP, Snooping
TCP, Mobile TCP, Time out freezing, Selective
retransmission, transaction oriented TCP. ,IPv6
Wireless network topologies, Cell
fundamentals and
topologies, Global system for mobile communication, Global
system for mobile communication, GSM architecture, GSM
entities, call routing in GSM, PLMN interface, GSM
addresses and identifiers, network aspects in GSM,GSM
frequency allocation, authentication and security, Short
message services, Mobile computing over SMS,SMS, value
added services through SMS, accessing the SMS bearer,
Security in wireless networks.
General packet radio service(GPRS)
GPRS and packet data network, GPRS network architecture,
GPRS network operation, data services in GPRS,
Applications of GPRS, Billing and charging in GPRS.
Infrastructure and ad-hoc network
System Architecture, Protocol Architecture, Medium Access
Control layer, MAC Management, Wireless LAN advantages,
IEEE 802.11a, 802.11b standards ,Wireless LAN architecture,
Mobility in Wireless LAN, Deploying Wireless LAN, Mobile
ad hoc networks and sensor networks, wireless LAN security
Wireless Application Protocol(WAP), MMS, GPRS
application CDMA and 3G
Spread-spectrum Technology, FHSS, DSSS, CDMA versus
Page 7 of 53

11

10

13

30

10

20

13

20

13

20

GSM, Wireless data, third generation networks, applications


in 3G Wireless LAN, WiFi v/s 3G Voice over Internet
protocol and convergence, Voice over IP,H.323 framework
for voice over IP, SIP, comparison between H.323 ad SIP,
Real time protocols, convergence technologies, call routing,
call routing, voice over IP applications, IMS, Mobile VoIP,
Security issues in mobile Information security, security
techniques and algorithms, security framework for mobile
environment.
Total

60

100

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

Reference Books:
1.
2.
3.
4.

Mobile Computing , Asoke K Telukder, Roopa R Yavagal, TMH


Mobile Communications, Jochen Schiller, Pearson
Wireless Communications and Networks, 3G and beyond, ITI Saha Misra, TMH.
Principle of wireless Networks by Kaveh Pahlavan and Prashant Krishnamurthy,
Pearson 2002.

List of experiments:
1

2
3

Name of Experiment
What is Mobile Computing? Explain the three tier architecture of mobile computing
with diagram.
Write a WML program to create a card.
Write a WML program to create a deck that contain two cards and provide the
Functionality of calling two cards from one another.

Page 8 of 53

Write a WML program to display list of following card and provide the functionality to
load a particular card,
a.
Sales
b.
Product
c.
Services
Write a WML program for usage of template tag.

Write a WML program to display the text in the following format.

Bold, Underlined, Emphasized, Big font, Small font, Strong font


8

Write a WML program to create the following table.


Honda

Suzuki

Yamaha

Mitsubishi

Ford

Maruti

Write a WML program to implement the functionality of Login by username.

10

Write a WML program to display special characters on the screen.

11

Write a WML program to create following selection list.


a. Red
b. Green
c. Yellow
d. Blue
Write a WML program to create following option group.

12

1. Honda
1.1 CD 100
1.2 CD Dawn
2. Suzuki
2.1 Max 100
2.2 Samurai

13

Write a WML program to display the image on the screen after 5 seconds.

14

Write a WML program to develop the calculator.

15

Write a program in J2ME to perform the following tasks:


A] Draw a text box on the device screen.
B] Change the background color of the device screen.
C] Change the color of the text.
D] Change the font style and font size of the displayed text.
Page 9 of 53

16

Write a program in J2ME to perform the simple calculator operations such as


a. Addition
b. Subtraction
c. Multiplication
d. Division

17

Write a program in J2ME to create a simple Quiz which contains 3 to 4 questions and
also display the score.

18

Write a program in J2ME to create a currency converter and also display the result.

19

Write a program in J2ME to generate a calendar.

20

Implement the concepts of wired LAN in NS-2

21

Implement the concept of Wireless LAN in NS-2

Page 10 of 53

Subject Name : Service Oriented Computing


Subject Code : CE 703-1
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

04

00

04

08

Total

Theory

Credit

Hrs Marks
6

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:

To gain understanding of the web services architectures and motivation for composition.
To learn service basic concept of SOAP,WSDL and UDDI.
To learn technology underlying the service design
To learn advanced concepts such as service composition, orchestration and
Choreography.
To learn about collaboration, Agents, Multi agents system, Agent communication.

Outline of the Course:


Sr.
No
1
2
3
4
5
6

Title of the Unit

Minimum
Hours
5
services

Introduction to distributed Computing and Web


architectures and standards.
Directory services, SOAP, WSDL, UDDI and Integration versus
Interoperation.
Principles of Service-Oriented Architecture
XML primer, Conceptual modeling, RDF, RDFS and OWL
Execution Models, Transaction over Composed Services, Business
process management, Relevant standards BPEL4WS,WSCI,WS-C.
Collaboration

Total hours (Theory): 60


Total hours (Lab): 60
Total hours: 120
Page 11 of 53

5
5
25
15
5

Detailed Syllabus:
Sr.
No

Topic

Brief history of information technology, Challenges for composition, Web


Services Architectures and Standards. Computing with services, Visions
for web, Semantic web, Peer to Peer Computing, Processes and Protocols.
Pragmatic web, Open environments.
Directory services, SOAP, REST WSDL, UDDI

2
3

Enterprise architectures and Service Oriented Computing


Integration versus interoperation, J2EE, .NET, Model Driven Architecture,
Legacy systems.
Use cases: Intra-enterprise and Inter-enterprise Interoperation, Application,
Configuration, Dynamic Selection, Software Fault Tolerance, Grid, and,
Utility Computing, Elements of Service-Oriented Architectures, RPC
versus Document, Orientation, Composing Services.
Description: Modeling and representation
XML primer, Conceptual modeling, Ontology and knowledge sharing,
Relevant standards: RDF, RDFS, and OWL, Differencing and tools,
Matchmaking.
Engagement:
Execution Models: Messaging, CORBA, Peer to peer computing, Jini, Grid
Computing, Transactions: ACID Properties, Schedules, Locking,
Distributed Transactions, Transactions over Composed Services:
Architecture,
Properties,
Compositional
Serializability,
Process
specification: Processes, Workflows.
Business Process Management:
Introduction of Business process Management, Process Specification
Language, Relevant standards: BPEL4WS, WSCI,
WS-C, ebXML, Relaxed transactions, Exception handling.
Collaboration
Describing collaborations, Agents,
Multiagent systems, Agent
communication, languages, Protocols,
Commitments and contracts,
Planning, Consistency maintenance, Relevant standards: FIPA, OWL-S,
Economic models, Organizational models.

Total

Lecture
Hours

Weight
age(%)

10

10

10

25

35

15

25

10

60

100

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Page 12 of 53

Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

Learning Outcome:

After the completion of this course student will be able to Understand primary concepts
of SOA
Know the integration of SOA technological points with Web Services.
Implement of SOA in development cycle of Web Services.

Reference Books:
1.
2.
3.
4.

Sandeep Chatterjee, James Webber, Developing Enterprise Web Services, An Architects


Guide, Pearson Education.
Newcomer, Lomow, Understanding SOA with Web Services, Pearson Education.
Thomas Erl, Service-Oriented Architecture: Concepts, Technology, and Design,Pearson
Education.
Dan Woods and Thomas Mattern, Enterprise SOA Designing IT for Business Innovation
OREILLY.

List of Experiment:
1. Prepare the documents of SOA terms: UDDI, SOAP, XQuery, XPath, Web Service
2.
3.
4.
5.
6.
7.

(JAX-WS & .net ), WSDL, BPEL, SAML, REST and Apache ANT.
Create DTD file for student information and create a valid well-formed XML
document to store student information against this DTD file.
Using XSL, Display student information in tabular format.
Create .XSL file for library book information and also create well formed XML
document to store this information against .XSL.
Create .XSD file for mobile information and also create well formed XML
document to store this information against .XSD.
Create web calculator service in .NET and create client to consume this service
Write a program to create a web service with the use of .net platform to send mail.

Page 13 of 53

Subject Name: Mobile Application Development with Android


Subject Code: CE 703-2
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

04

00

04

08

Total

Theory

Credit

Hrs Marks
6

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:
An Android technology is generally used in mobile system, where android is an open source
technology. This technology is used for mobile application development. Using android
technology, student can make own mobile applications and upload easily on mobile devices.

Outline of the Course:


Sr.
No
1
2
3
4
5
6
7
8
9
10

Title of the Unit


Introduction to Android
Android Application Design and Resources
Exploring User Interfaces screen elements

Designing User Interfaces with Layouts


Drawing and working with Animation
Android Storage APIs
Sharing Data Between Applications with Content Providers
Using Android Network, Web and Multimedia APIs
Telephony API and Notifications
Introduction to application development for windows phone

Total hours (Theory): 60


Total hours (Lab): 60
Total hours: 120
Page 14 of 53

Minimum
Hours
6
6
4
5
3
4
6
11
9
6

Detailed Syllabus:
Sr.
No

Topic

Lecture Weight
Hours age(%)

Introduction of Android:
Android Operating System, History of Mobile Software
Development, Open Handset Alliance (OHA), The Android
Platform, Downloading and Installing Eclipse, Exploring
Android SDK, Using the Command-Line Tools and the Android
Emulator, Build the First Android application, Android
Terminologies, Application Context, Application Tasks with
Activities, Intents, and Closer Look at Android Activities.
Android Application Design and Resources:
Anatomy of an Android Application, Android Manifest file,
Editing the Android Manifest File, Managing Applications
Identity, Enforcing Application
System Requirements,
Registering Activities and other Application Components,
Working with Permissions.
Exploring User Interface Screen Elements:
Introducing Android Views and Layouts, Displaying Text with
TextView, Retrieving Data From Users, Using Buttons, Check
Boxes and Radio Groups, Getting Dates and Times from Users,
Using Indicators to Display and Data to Users, Adjusting
Progress with SeekBar, Providing Users with Options and
Context Menus, Handling User Events, Working with Dialogs,
Working with Styles, Working with Themes.
Designing User Interfaces with Layouts:
Creating User Interfaces in Android, View versus ViewGroup,
Using Built-In Layout Classes such as FameLayout,
LinearLayout, RelativeLayout, TableLayout , Multiple Layouts on
a Screen, Data-Driven Containers, Organizing Screens with Tabs,
Adding Scrolling Support.
Drawing and Working with Animation:
Working with Canvases and Paints, Working with Text, Working
with Bitmaps, Working with Shapes, Working with Animation.
Android Storage APIs:
Working with Application Preferences such as Creating Private
and Shared Preferences, Adding, Updating, and Deleting
Preferences. Working with Files and Directories, Storing SQLite
Database such as Creating an SQLite Database, Creating,
Updating, and Deleting Database Records, Closing and Deleting a
SQLite Database.
Sharing Data Between Applications with Content Providers:
Exploring Androids Content Providers, Modifying Content
Providers Data, Enhancing Applications using Content
Providers, Acting as a Content Provider, Working with Folders.
Page 15 of 53

10

10

10

Using Android Networking APIs:


Understanding Mobile Networking Fundamentals, Accessing the
Internet (HTTP).
Using Android Web APIs:
Browsing the Web with WebView, Building Web Extensions
using WebKit, Working with Flash.
Using Android Multimedia APIs:
Working with Multimedia, Working with Still Images, Working
with Video, Working with Audio.
Using Android Telephony APIs:
Working with Telephony Utilities, Using SMS, Making and
Receiving Phone Calls.
Working with Notifications:
Notifying a User, Notifying with Status Bar, Vibrating the
Phone, Blinking the Lights, Making Noise, Customizing the
Notification, Designing Useful Notification.
Introduction to application development for windows phone
Application life cycle, syntax and semantics of visual studio 2013,
design and build windows phone app, integrating map and location
in app, advanced topics

10

11

18

15

10

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

Reference Books:
1. Android Wireless Application Development By Lauren Darcey and Shane Conder,
Pearson Education, 2nd Edition.
2. Unlocking Android Developers Guide By Frank Ableson and Charlie Collins and Robi
Sen, Manning Publication Co.
Page 16 of 53

List of experiments:
Sr. No

Name of Experiment

Create First Android Application , that will display LDRP - ITR in the middle of the
screen in the Blue color with White background.
Create sample application with Check username and password only. On successful login, go
to the next screen and on failing login, alert user using Toast. Also pass username to next
screen.

2
3

Create login application where you will have to validate EmailID (UserName). Till the
username and password is not validated, login button should remain disabled.

Create and Login application as above. On successful login , open browser with any
URL.
Create an application that will change color of the screen, based on selected options
from the menu.

5
6

Create an application that will display toast (Message) on specific interval of Time.

Create a background application that will open activity on specific Time.

Create an UI such that, one screen have list of all the types of Books. On selecting of any
book name, next screen should show Book details like: B o o k name , Author Name,
Publication name, images(using gallery) if available, show different colors in which it is
available.
Using content providers and permissions, Read phonebook contacts using content providers
and display in list.

9
10

Read Messages from the Mobile Devices and Display it on the screen.

11

Create an application that will play a media file from the memory card.

12

Create an application to make Insert, Update, Delete and Retrieve operation on the
database.

13

Create an application to send message between two emulators.

14

Create an application to pick up any image from the native application gallery and
display it on the screen.

15

Create simple app for windows phone.

Page 17 of 53

Subject Name: Mobile Application Development with iOS


Subject Code: CE 703 - 3
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

04

00

04

08

Total

Theory

Credit

Hrs Marks
6

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:
The main objectives to give the subject Mobile Application Development in iOS are:
To introduce basic concepts of Objective C Programming
To introduce iOS
To building Mobile Application With iOS

Outline of the Course:


Sr.
No
1

Title of the Unit


Fundamentals of programming

Learning Objective C

Introduction to iPhone OS

Application

Database integration with SqLite

Deploying your iOS app

Introduction to application development for windows phone

Development

Minimum
Hours

9
9
in

iPhone

16
10
5

Total hours (Theory): 60


Total hours (Lab): 60
Total hours: 120
Page 18 of 53

Detailed Syllabus:
Sr.
No
1
2

Topic
Fundamentals of programming
OOP concepts and SQL Queries, Basics of Designing, Overview of
MAC OS and X-Code
Learning Objective C
Data
Types,
NSInteger, NSNumber,
Operators,
Loop,
Introduction to .H and .M, Files Inheritance, Method
Overloading, Mutable and Immutable Strings, Mutable and
Immutable Arrays, File Management
Introduction to iPhone OS
Introduction to iPhone Architecture, Essential COCOA Touch
Classes, Interface Builder, Nib File, COCOA and MVC
Framework, Overview of features of latest ios
Application Development in iPhone
Controls and Gestures, Controllers and Memory Management,
Using Application Delegate, Connecting
Outlets,
Managing
Application
Memory,
Advance Controllers Programming,
Views (Alert View, Table Views, Picker, Date and Time,
Image), Navigation Based Application Development, Tab Bar and
Tool Bar, Audio and Video, Releasing Memory, Reading PDF File
in iPhone Simulator, Animation, Accelerometer, Location Services
and 2-D Graphics, Email Sending, XML Parsing, JSON
Parsing, Web Services Integration, Exploring maps and local
search
Database integration with SqLite
SqLite, Creating Outlets and Actions, Parsing Data with SqLite,
Overview of Networking- SCNetwork, CFHTTP, CFFTP,
CFSocket, Berkeley Sockets, Web Server
Deploying your iOS app
Deploying the app to Beta Tester, Registering Beta device,
Generating digital certificates, Submitting app to Apple by
registering Apple Id, Validating and submitting App
Introduction to application development for windows phone
Application life cycle, syntax and semantics of visual studio 2013,
design and build windows phone app, integrating map and location
in app, advanced topics

Lecture
Hours

Weight
age(%)

10

17

17

16

26

10

15

10

60

100

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
Page 19 of 53

One internal exam will be conducted as a part of internal theory evaluation.


Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

Reference Books:
1. Building iPhone and iPad Electronic Projects - MikeWesterfield - O'Reilly Media
Pub.
2 . Head First iPhone and iPad Development, 2nd Edition - Dan Pilone, Tracey Pilone
O'Reilly Media
3. Beginning iPhone and iPad Web Apps - ChrisApers, Daniel Paterson - Apress Pub
4. Beginning iOS Programming Building and deploying iOS application, Nick Harris, Wrox
Publication

List of Practical:
Sr. No
1
2
3
4
5
6
7
8
9
10
11
12

Title
Print Hello World in iOS
Handling button events / actions in iOS
Implement UI elements like TextFields, Label, Toolbar, Statusbar, Tabbar
Handling image in iOS using ImageView
Implement UI elements like ScrollView, TableView, Pickers, Switches
Implement UI elements like Sliders, Alerts, Icons
Handling Accelerometer to manage change in position
Managing camera in iOS
Make Registration page using UI elements and SQLite Database
Handling audio, video and file in iOS
Deploying iOS app on app store
Create simple app for windows phone

Page 20 of 53

Subject Name : Image Processing


Subject Code : CE 704-1
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

04

00

02

06

Total

Theory

Credit

Hrs Marks
5

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:

To understand the sensing, acquisition and storage of digital images.


To study the image fundamentals and mathematical transforms necessary for image
processing.
To understand the digital processing systems and corresponding terminology.
To understand the base image transformation domains and methods.
To have an understanding of colour models, type of image representations and related
statistics.
To study the image enhancement techniques.
To study image compression procedures.
To study image segmentation and representation techniques.
To study image restoration.

Outline of the Course:


Sr.
No
1
2
3
4
5
6
7

Title of the Unit


Introduction to computer graphics
Image processing fundamentals
Image Enhancement
Image Restoration
Colour Image Processing
Image Compression
Morphological Image Processing Overview

Total hours (Theory): 60


Total hours (Lab): 30
Total hours: 90
Page 21 of 53

Minimum
Hours
4
6
10
10
12
10
8

Detailed Syllabus:
Sr.
No
1

Topic

Lecture Weight
Hours age(%)

Introduction to Computer Graphics:


Introduction of Coordinate representation and Pixel
Raster Scan & Random Scan systems
Video controller and raster scan display processor.
Introduction to image processing:
Fundamentals
Applications
Image processing system components
Image sensing and acquisition
Sampling and quantization
Neighbors of pixel adjacency connectivity
regions and boundaries
Distance measures.
Image Enhancement:
Frequency and Spatial Domain
Contrast Stretching
Histogram Equalization
Low pass and High pass filtering.
Image Restoration:
Noise models
mean, orderstatistics
adaptive filters
Band reject, Band pass and notch filters
Colour Image Processing:
Colour models
Pseudo colour Image processing
Colour transformation and segmentation.
Image Compression:
Models
Error free and lossy compression
Standards.
Morphological Image Processing: Overview
Boundary extraction
Region filtering
Connected component extraction
Convex hull
Thinning; Thickening; skeletons; pruning; Image
segmentation.
Total
Page 22 of 53

12

10

16

10

16

12

20

10

16

12

60

100

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

Learning Outcome:
On successful completion of the course, the student will:
Be able to understand basic concepts image processing, image storage and types of
transformations that can be applied to images.
Be able to compare the domains and methods of image processing.
Be able to check the correctness of algorithms using inductive proofs and loop invariants.
Learn Image Restoration & Enhancement techniques, colour image processing.
Be able to make proper use of image processing tools.
Familiar with morphological image processing.

Text Book:
1. Digital Image Processing, Second Edition by Rafel C. Gonzalez and Richard E.
Woods, Pearson Education

Reference books:
1. Digital Image Processing by Bhabatosh Chanda and Dwijesh Majumder, PHI
2. Fundamentals of Digital Image Processing by Anil K Jain, PHI
3. Digital Image Processing Using Matlab, Rafel C. Gonzalez and Richard E.
Woods, Pearson Education

Page 23 of 53

List of experiments:
Sr. No
Name of Experiment
1
Image Printing Program Based on Halftoning.
2

Reducing the Number of Intensity Levels in an Image.

Zooming and Shrinking Images by Pixel Replication.

Zooming and Shrinking Images by Bilinear Interpolation.

Arithmetic Operations.

Image Enhancement Using Intensity Transformations.

Histogram Equalization.

Spatial Filtering.

Enhancement Using the Laplacian.

10

Unsharp Masking.

Page 24 of 53

Subject Name: Embedded Systems


Subject Code: CE 704-2
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

04

00

02

06

Total

Theory

Credit

Hrs Marks
5

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:
To learn the concepts of Embedded System and implement these concepts into practice.

Outline of the Course:


Sr.
No
1

Title of the Unit


Introduction

Minimum
Hours
10

Memory and Input Management

15

Processes and Operating System

15

Embedded Software

20

Total hours (Theory): 60


Total hours (Lab): 30
Total hours: 90

Page 25 of 53

Detailed Syllabus:
Sr.
No
1

Lecture Weight
Hours age(%)

Topic
Introduction
Challenges of Embedded Systems, Embedded system design
process, Embedded System processors & Micro controllers,
ARM, PIC architecture
Memory and Input Management
Common memory types, Memory hierarchy, Cache Memory,
Memory system mechanisms, Memory and I/O
devices and interfacing, Interrupts handling
Processes and Operating System
Multiple tasks and processes, Context switching, Scheduling
policies, Inter process communication mechanisms, Performance
issues, Introduction to RTOS, Process management & memory
management in RTOS along with Real time scheduling
Embedded Software
Programming embedded systems in assembly and C, Meeting real
time constraints, Arduino Uno and its programming, Embedded C
Programming, Introduction to Raspberry Pi and programming

Total

10

20

15

25

15

25

20

30

60

100

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

Reference Books:
1. Computers as Components: Principles of Embedded Computing System Design, Wayne
Wolf, 2nd Edition, Morgan Kaufmann Publishers
2. Embedded System Design: A Unified Hardware Software Approach, Frank Vahid and
Tony Givargis
3. Michael J. Pont, Embedded C, Pearson Education , 2007
Page 26 of 53

List of Practical:
Sr. No
1
2
3
4
5
6
7
8
9

Title
To print Hello World using Embedded C.
To implement operators in Embedded C.
To implement conditional statements and loop in Embedded C.
To implement the concept of port programming using Embedded C.
To display decimal numbers from 0-9 in the seven segment display.
To blink an LED.
To prepare digital clock.
To implement functions of Arduino board.
Controlling home appliances using Arduino board.

Page 27 of 53

Subject Name : Semantic Web


Subject Code : CE 704-3
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

04

00

02

06

Total

Theory

Credit

Hrs Marks
5

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:

To Introduce Semantic Web Vision


Understanding about XML,RDF,RDFS,OWL
Querying Ontology
Ontology Reasoning
Migration from Document to Data Web
LOD Cloud

Outline of the Course:


Sr.
No
1
2
3
4
5
6
7

Title of the Unit


Foundation of Semantic Web Technologies
Basic Description Logics
Structured Web Documents in XML
Describing Web Resources in RDF
Web Ontology Language: OWL
SPARQL
Linked Open data

Total hours (Theory): 60


Total hours (Lab): 30
Total hours: 90
Page 28 of 53

Minimum
Hours
3
18
5
10
8
6
10

Detailed Syllabus:
Sr.
No
1

Topic

Lecture Weight
Hours age(%)

Foundation of Semantic Web Technologies


Introduction
Current web vs Semantic Web
Semantic Web Technologies
A layered approach
Descriptive Logic
Introduction
Definition of the basic formalism
Reasoning algorithms
Language extensions
Structured Web Documents in XML
Introduction
XML
Structuring
Namespaces
Addressing and querying XML document
Processing
Describing Web Resources: RDF
Introduction
RDF: Basic Ideas
RDF: XML-Based Syntax
RDF serialization
RDF Schema: Basic Ideas
RDF Schema: The Language
RDF and RDF Schema in RDF Schema
Web Ontology Language: OWL
Introduction
OWL and RDF/RDFS
Three Sublanguages of OWL
Description of the OWL Language
Layering of OWL
Examples
OWL in OWL

18

30

10

15

12

10

SPARQL

SPARQL simple Graph Patterns, Complex Graph Patterns,


Group Patterns, Queries with Data Values, Filters

OWL Formal Semantics,


Page 29 of 53

Linked Open data


Introduction
Principles of Linked Data
Web of Data
LOD Cloud
Linked Data Source : Dbpedia, Freebase
Total

10

20

60

100

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

Learning Outcome:

Understand the semantic web Vision and technologies


Understand about ontology
Understanding about Data Web(Linked open data Cloud)

Text Book:

A Semantic Web Primer by Grigoris Antoniou Frank van Harmelen, The MIT Press
Cambridge
Foundation of Semantic Web Technologies, Pascal Hitzler, Markus and Sebastian
Linked Data : Evolving the Web into a Global Data space by Tom Heath, Christian Bizer
, Morgan & Claypool publication
Basic Description Logic by Franz Baader, Warner Nutt

Page 30 of 53

List of experiments:
Sr. No
1
Working with XML

Name of Experiment

Working with XML Schema, DTD

Design Of Ontology using RDF

Design RDF document with different Serialization format (e.g. tutle,N-triple)

Design Of Ontology using RDFS

Design Of Ontology using OWL

Case study : Pizza Ontology

Querying Ontology using SPARQL

Design of any domain specific Ontology in Protg

Case Study : Dbpedia

10

Case study : LOD Cloud

Page 31 of 53

Subject Name: Internet of Things


Subject Code: CE 704-4
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

04

00

02

06

Total

Theory

Credit

Hrs Marks
5

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:
Students will understand the concepts of Internet of Things and can able to build IoT
applications.

Outline of the Course:


Sr. No
1
2
3
4
5
6

Title of the Unit


Introduction to IoT
IoT & M2M
Network & Communication aspects
Challenges in IoT
Domain specific applications of IoT
Developing IoTs

Total hours (Theory): 60


Total hours (Practical): 30
Total hours: 90

Page 32 of 53

Minimum
Hours
6
6
16
10
6
16

Detailed Syllabus:
Sr.
No
1

Topic

Introduction to IoT
Defining IoT, Characteristics of IoT, Physical design of IoT, Logical
design of IoT, Functional blocks of IoT, Communication models &
APIs
IoT & M2M
Machine to Machine, Difference between Iot and M2M, Software
define Network
Network & Communication aspects
Wireless medium access issues, MAC protocol survey, Survey
routing protocols, Sensor deployment & Node discovery, Data
aggregation & dissemination
Challenges in IoT
Design challenges, Development challenges, Security challenges,
Other challenges
Domain specific applications of IoT
Home automation, Industry applications, Surveillance applications,
Other IoT applications
Developing IoTs
Introduction to Python, Introduction to different IoT tools,
Developing applications through IoT tools, Developing sensor based
application through embedded system platform, Implementing IoT
concepts with python

Lecture
Hours

Weight
age(%)

10

10

16

30

10

15

10

16

25

60

100

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

Page 33 of 53

STUDENTS LEARNING OUTCOMES:


On successful completion of the course, the student will:
Understand the concepts of Internet of Things
Analyze basic protocols in wireless sensor network
Design IoT applications in different domain and be able to analyze their performance
Implement basic IoT applications on embedded platform
Reference Books:
1. Vijay Madisetti, Arshdeep Bahga, Internet of Things: A Hands-On Approach
2. Waltenegus Dargie,Christian Poellabauer, "Fundamentals of Wireless Sensor Networks:
Theory and Practice"

Page 34 of 53

Subject Name: Mini Project


Subject Code: CE 705
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

00

00

06

Total

Theory

Credit

Hrs Marks
3

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

50

100

150

Exam

Learning Objectives:
Student will be developing a project to integrate knowledge and skills acquired during their
studies of various courses and focus on all aspects of Software Development Life Cycle.
Students inventiveness, degree of effort and documentation skills will be enhanced.

Instructional Method and Pedagogy:

A student is required to prepare project independently or in a team.


The project involves analytical, numerical or system analysis and design, system
development and testing, study - research project or combination of these.
Two internal presentations will be conducted.
The student is required to demonstrate their inventiveness, degree of effort and
documentation skills.
The students are also required to submit the report and defend the same.

Page 35 of 53

Internal Project evaluation based on following criteria:


Sr.
No
1.
2.
3.

Criteria

Weightage

Examiners

Presentation 1
Presentation 2
Documentation

35%
35%
30%

Panel consisting of minimum two


members
Internal Guide

Evaluation Criteria of Presentation 1


Innovative
Project
Database System Presentation Question
Definition
Criteria
and
Design Diagrams
Skill
Answer
literature
survey
20%
20%
20%
10%
15%
Weightage

Interaction
with
Internal
Guide
15%

Evaluation Criteria of Presentation 2

Criteria
Weightage

Input / Technical
Presentation Question
Practical
Output Knowledge
Implementation
Skill
Answer
Design of Project
30%

10%

20%

10%

15%

Interaction
with
Internal
Guide
15%

External Project evaluation based on following criteria:


Practical
Innovative Literature Database
Presentation Question Project
Implementation
Project
Skill
Survey
Design
Answer Report
& Testing
Definition
10%
10%
15%
30%
10%
15%
10%
Weightage

Criteria

Page 36 of 53

Subject Name: Big Data Analytics


Subject Code: CE 801
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

04

00

02

06

Total

Theory

Credit

Mid Sem

Hrs Marks
5

70

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:

To introduce students to basic applications, concepts, and techniques of Data


Warehousing & mining.
Understand the fundamental processes, concepts and techniques of data mining and
develop an appreciation for the inherent complexity of the data- mining task.
To develop skills for using recent data mining software to solve practical problems
in a variety of disciplines.
To introduce students to bigdata and its implementation.

Outline of the Course:


Sr.
No
1

Title of the Unit


Introduction to Data Warehousing

Minimum
Hours
6

Concepts and techniques in Data Warehousing

Introduction to data mining (DM)

Data Preprocessing

Concept Description & Association Rule Mining

Classification and Prediction

Advance topics

Introduction to Big Data, Fundamental concepts, MapReduce and


Hadoop, Hadoop Implementation and Deployment

14

Page 37 of 53

Total hours (Theory): 60


Total hours (Lab): 30
Total hours: 90

Detailed Syllabus
Sr.
No
1

Lecture Weight
Hours age(%)

Topic
Overview and concepts Data Warehousing
What is data warehousing - The building Blocks, Defining
Features Data warehouses and data marts, Overview of the
components, Metadata in the data warehouse, Need for data
warehousing, Basic elements of data warehousing, Trends in
data warehousing
Concepts and techniques in Data Warehousing
OLAP (Online analytical processing) definitions, Difference
between OLAP and OLTP, Dimensional analysis - What are
cubes?, Drill-down and roll-up - slice and dice or rotation,
OLAP models, ROLAP versus MOLAP, defining schemas:
Stars, snowflakes and fact constellations
Introduction to Data Mining (DM)
DM Functionalities, Classification of DM Systems, Issues in DM
KDD Process

Data Preprocessing
Why to preprocess data?, Data cleaning: Missing Values,
Noisy Data, Data Integration and transformation, Data
Reduction: Data cube aggregation, Dimensionality Reduction,
Data Compression, Numerosity Reduction, Data Mining
Primitives, Languages and System Architectures: Task
relevant data, Kind of Knowledge to be mined, Discretization
and Concept Hierarchy
Concept Description and Association Rule Mining
Introduction to Concept description, Data Generalization and
summarization-based
Characterization,
Analytical
Characterization, Class Comparisons, Descriptive Statistical
Measures, Market basket analysis- basic concepts
,Association Rule Mining, The Apriori Algorithm, Mining
Multilevel
Association
Rule
Mining,
Mining
Multidimensional Association Rule Mining
Introduction to Classification and Prediction
Introduction to classification and prediction, Issues regarding
Classification, Classification using Decision trees, Bayesian
Classification, Classification by Backpropagation, Prediction
Page 38 of 53

10

10

10

10

12

12

Classification Accuracy
Advance topics
Introduction of Clustering, Spatial mining, Web mining, Text
mining
Introduction to Big Data, MapReduce and Hadoop:
What Is Big Data?, Driving the growth of Big Data,
Differentiating between Big Data and traditional enterprise
relational data, Challenges of Bid Data, Hadoop, MapReduce
Why Is MapReduce Necessary?, How Does MapReduce
Work?, Real-World MapReduce Examples
Hadoop Implementation and Deployment:
Introducing Hadoop, Hadoop cluster components, Hadoop
Architecture, Hadoop Ecosystem, Evaluation criteria for
distributed MapReduce runtimes, Enterprise-grade Hadoop
Deployment, Hadoop Implementation
Total

10

14

12

60

100

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

Learning Outcome:
Upon completion of this course, students will be able to do the following:
Students will able to understand important of data mining and its various concepts
like data preprocessing, various classification algorithms etc.
Student will be able to develop a reasonably sophisticated data mining
application.
Student will be able to develop a reasonably sophisticated data mining
application.
Student is able to select methods and techniques appropriate for the task
Student is able to develop the methods and tools for the given task
Page 39 of 53

Text Books:

J. Han, M. Kamber, Data Mining Concepts and Techniques, Morgan Kaufmann

Paulraj Ponnian, Data Warehousing Fundamentals, John Willey.

Robert D. Schneider , Hadoop for Dummies, Wiley India.

Reference Books:

M. Kantardzic, Data mining: Concepts, models, methods and algorithms, John Wiley

&Sons Inc.

M. Dunham, Data Mining: Introductory and Advanced Topics, Pearson

Pieter Adriaans, Dolf Zantinge , Data Mining, Pearson Education Asia

List of experiments:
1
2
3

4
5
6

7
8
9
10
11
12
13

Name of Experiment
Design and Create Cube by identifying measures and dimensions for Star Schema,
Snowflake
Design and Create Cube by identifying measures and dimensions for Design storage
for cube using storage
Process Cube and Browse Cube Data
1. By replacing a dimension in the grid, filtering and drilldown using cube browser
2. Browse dimension data and view dimension members, member properties, member
property values
3. Create calculated member using arithmetic operators and member property of
dimension Member
Create and use Excel Pivot Table Report based on data cube
Design and Create data mining models using Analysis Service of SQL server 2005
Design and Build targeted mailing data mining model using analysis service of SQL
server 2005 and compare their predictive capabilities using the Mining Accuracy
Chart View and Create predictions using Prediction Query Builder.
Perform various steps of Preprocessing on the given relational database / warehouse.
To implement Data Mining Extensions (DMX) language and MDX query language
Perform various steps of Preprocessing using WEKA software.
Creating Data Mining Structure & Predictive Models (Neural Networks and Decision
Tree) using the Excel Add-In for SQL Server 2008.
Case Study: To study research papers on the given topic and prepare the report on it.
To setup Hadoop.
To run sample program using hadoop.
Page 40 of 53

Subject Name : Information Retrieval


Subject Code : CE 802-1
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

03

00

02

05

Total

Theory

Credit

Hrs Marks
4

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:

Learn to write code for text indexing and retrieval.


Learn to evaluate information retrieval systems
Learn to analyze textual and semi-structured data sets
Learn to evaluate information retrieval systems
Learn about text similarity measure
Understanding about search engine
Text Classification

Outline of the Course:


Sr.
No
1
2
3
4
5
6
7

Title of the Unit


Overview of text retrieval systems
Retrieval models and implementation: Vector Space Models
Query expansion and feedback
Probabilistic models; statistical language models
Text classification & Text clustering
Web search basics, crawling, indexes, Link analysis
IR applications

Total hours (Theory): 45


Total hours (Lab): 30
Total hours: 75
Page 41 of 53

Minimum
Hours
5
6
5
8
10
8
3

Detailed Syllabus:
Sr.
No
1

Topic

Lecture Weight
Hours age(%)

Overview of text retrieval systems


Boolean retrieval
The term vocabulary and postings lists
Dictionaries and tolerant retrieval

Index construction and compression


Retrieval models and implementation: Vector Space
Models
Vector Space Model
TF-IDF Weight
Evaluation in information retrieval
Query expansion and feedback
Relevance feedback
pseudo relevance feedback
Query Reformulation
Probabilistic models; statistical language models
Okapi/BM25;
Language models
KL-divergence
Smoothing
Text classification & Text clustering
The text classification problem
Naive Bayes text classification
k- nearest neighbors
Support vector Machine
Feature Selection
Vector-space clustering;
K-means algorithm
Hierarchical clustering
DBSCAN algorithm
PAM and PAMK
EM algorithm
Web search basics, crawling, indexes, Link analysis
Web Characteristic
Crawling
Web As a graph
Page Rank

Hubs and Authorities


Page 42 of 53

12

15

12

15

10

22

15

IR applications
Information extraction
Question answering
Opinion summarization
Social Network
Total

45

100

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

Learning Outcome:

To Understand Document as Vector


Performance evolution metric for IR
To understand search Engine functionality
Various Supervised and Unsupervised learning Method

Text Book:

Christopher D. Manning, Prabhakar Raghavan and Hinrich Schtze, Introduction to


Information Retrieval, Cambridge University Press. 2008. http://nlp.stanford.edu/IRbook/information-retrieval-book.html
ChengXiang Zhai, Statistical Language Models for Information Retrieval (Synthesis
Lectures Series on Human Language Technologies), Morgan & Claypool Publishers,
2008.
http://www.morganclaypool.com/doi/abs/10.2200/S00158ED1V01Y200811HLT001

Page 43 of 53

List of Practicals:
Sr. No
Name of Experiment
1
Implementation of various classification algorithm on text
2

Implementation of various Clustering algorithm on text

Implement Domain specific Search Engine

Social media analytic

Design and development of Question/Answering System

IR from Micro blog

Various track at TREC 2015 conference (students will be encouraged to participate in


such track)

Clinical Decision Support Track


Contextual Suggestion Track
Microblog Track
Temporal Summarization Track
Tasks Track

Various track at CLEF 2015 Conference(students will be encouraged to participate in


below track

Linked Data Track

Tweet Contextualization track

Relevance Feedback Track

Page 44 of 53

Subject Name: High Performance Computing


Subject Code: CE 802-2
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

03

00

02

05

Total

Theory

Credit

Hrs Marks
4

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

LEARNING OBJECTIVES:
The objective of this course is

To Study various computing technology architecture.


To know Emerging trends in computing technology.
To highlight the advantage of deploying computing technology.

OUTLINE OF THE COURSE:


Sr. No

Title of the Unit

Minimum
Hours
10

Cluster Computing and its Architecture

Cluster Setup and Administration

Introduction to Grid and its Evolution

Introduction to Cloud Computing

Nature of Cloud

11

Cloud Elements

Total hours (Theory): 45


Total hours (Practical): 30
Total hours: 75
Page 45 of 53

DETAILED SYLLABUS:
Sr.
No
1

Topic
Cluster Computing and its Architecture:
Ease of Computing
Scalable Parallel Computer Architecture
Towards Low Cost Parallel Computing & Motivation
Windows opportunity
A Cluster Computer And Its Architecture
Cluster Classification
Commodity Components for Clusters
Network Services/Communication SW
Cluster Middleware and Single Systems Image
Resource management & Scheduling (RMS)
Cluster Setup and Administration:
Introduction
Setting up the cluster
Security
System Monitoring
System Tuning
Introduction to Grid and its Evolution:
Introduction to Grid and its Evolution:
Beginning of the Grid
Building blocks of Grid
Grid Application and Grid Middleware
Evolution of the Grid: First, Second & Third Generation
Introduction to Cloud Computing:
Defining Clouds
Cloud Providers
Consuming Cloud Services
Cloud Models Iaas, Paas, SaaS
Inside the cloud
Administering cloud services
Technical interface
Cloud resources

Page 46 of 53

Lecture
Hours

Weight age
(%)

10

20

14

14

18

Nature of Cloud:
Tradition Data Center
Cost of Cloud Data Center
Scaling computer systems
Cloud work load
Managing data on clouds
Public, private and hybrid clouds
Cloud Elements:
Infrastructure as a service
Platform as a service
Software as a service

11

22

12

INSTRUCTIONAL METHOD AND PEDAGOGY


At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of multi-media projector, black board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.
STUDENTS LEARNING OUTCOMES:
On successful completion of the course, the student will:

On successful completion of the course, the student will be having the basic knowledge
of computing technology.
Student will be able to understand architecture of computing technology.
Student will be able to know cloud computing service models.
Know about emerging trends in computing technology.
Student will be able to know big data and hadoop architecture.

Page 47 of 53

TEXT BOOKS:
1. High Performance Cluster Computing, Volume 1, Architecture and Systems, Rajkumar
Buyya, Pearson Education.
2. Berman, Fox and Hey, Grid Computing Making the Global Infrastructure a Reality,
Wiley India.
3. Hurwitz, Bllor, Kaufman, Halper, Cloud Computing for Dummies, Wiley India.

REFERENCE BOOKS:
1. Ronald Krutz, Cloud Security, Wiley India.
2. Cloud Computing, A Practical Approach, Anthony Velte, Toby Velte, Robert Elsenpeter,
McGrawHill.

LIST OF PRACTICALS:
Sr. No
1
2
3
4
5
6
7
8

Name of Experiment
To study the basic commands of linux.
To establish Beowulf Cluster using MPI(Message Passing Interface) Library.
Installation and configuration of Alchemi Grid.
Running a sample application on Alchemi Grid and analysing it.
To study a Grid Simulation Toolkit.
To run two sample programs using GridSim Toolkit.
To study a Cloud Simulation Toolkit.
To setup Cloud.

Page 48 of 53

Subject Name : Soft Computing


Subject Code : CE 802-3
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

03

00

02

05

Total
Credit

Theory
Hrs Marks

03

70

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

30

20

30

150

Exam

Learning Objectives:
The main objective of the Soft Computing Techniques to Improve Data Analysis Solutions is to
strengthen the dialogue between the statistics and soft computing research communities in order
to cross-pollinate both fields and generate mutual improvement activities.
Soft Computing is a consortia of methodologies which collectively provide a body of concepts
and techniques for designing intelligent systems.

Outline of the Course:


Sr.
No

Title of the Unit

Minimum Hours

Introduction of Soft computing and Hard computing

Neural Networks

10

Fuzzy Logic

Genetic Algorithm

Hybrid System

GA and Fuzzy based Backpropagation Network

10

Page 49 of 53

Total hours (Theory): 45


Total hours (Lab): 30
Total hours: 75
Detailed Syllabus:
Sr.
No
1

Topic
Introduction:
What is Soft Computing? Difference between Hard and Soft
computing, Requirement of Soft computing, Major Areas of
Soft Computing, Applications of Soft Computing.
Neural Networks:
What is Neural Network, Learning rules and various
activation functions, Single layer Perceptrons , Back
Propagation networks, Architecture of Backpropagation(BP)
Networks, Backpropagation Learning, Variation of Standard
Back propagation Neural Network, Introduction to Associative
Memory, Adaptive Resonance theory and Self Organizing
Map, Recent Applications.
Fuzzy Systems:
Fuzzy Set theory, Fuzzy versus Crisp set, Fuzzy Relation,
Fuzzification, Minmax Composition, Defuzzification Method,
Fuzzy Logic, Fuzzy Rule based systems, Predicate logic, Fuzzy
Decision Making, Fuzzy Control Systems, Fuzzy
Classification.

Lecture
Hours

Weightage(%)

10

10

24

18

18

10

10

10

Genetic Algorithm:
4

History of Genetic Algorithms (GA), Working Principle,


Various
Encoding methods, Fitness function, GA
Operators- Reproduction, Crossover, Mutation, Convergence
of GA, Bit wise operation in GA, Multi-level Optimization.
Hybrid Systems:
Sequential Hybrid Systems, Auxiliary Hybrid Systems,
Embedded Hybrid Systems, Neuro-Fuzzy Hybrid Systems,
Neuro-Genetic Hybrid Systems, Fuzzy-Genetic Hybrid
Systems.
GA based Backpropagation Networks:
GA based Weight Determination, K - factor determination in
Columns.
Fuzzy Backpropagation Networks:
LR type Fuzzy numbers, Fuzzy Neuron, Fuzzy BP
Architecture, Learning in Fuzzy BP, Application of Fuzzy BP
Networks.

Page 50 of 53

Instructional Method and Pedagogy:

At the start of course, the course delivery pattern, prerequisite of the subject will be
discussed.
Lectures will be conducted with the aid of Multi-media projector, Green board, OHP etc.
Attendance is compulsory in lecture and laboratory which carries 10 marks in overall
evaluation.
One internal exam will be conducted as a part of internal theory evaluation.
Assignments based on the course content will be given to the students for each unit and
will be evaluated at regular interval evaluation.
Surprise tests/Quizzes/Seminar/tutorial will be conducted having a share of five marks in
the overall internal evaluation.
The course includes a laboratory, where students have an opportunity to build an
appreciation for the concepts being taught in lectures.
Experiments shall be performed in the laboratory related to course contents.

Reference Books:

Neural Networks, Fuzzy Logic and Genetic Algorithms: Synthesis & Applications,
S.Rajasekaran, G. A. Vijayalakshami, PHI.
Genetic Algorithms: Search and Optimization, E. Goldberg.
Neuro-Fuzzy Systems, Chin Teng Lin, C. S. George Lee, PHI.
Build_Neural_Network_With_MS_Excel_sample by Joe choong.

List of experiments:
Sr.
No

Name of Experiment

Create a perceptron with appropriate no. of inputs and outputs. Train it using fixed increment
learning algorithm until no change in weights is required. Output the final weights.

2
3
4

5
6
7
8

Create a simple ADALINE network with appropriate no. of input and output nodes. Train it
using delta learning rule until no change in weights is required. Output the final weights.
Train the autocorrelator by given patterns: A1=(-1,1,-1,1), A2=(1,1,1,-1), A3=(-1, -1, -1,
1). Test it using patterns: Ax=(-1,1,-1,1), Ay=(1,1,1,1), Az=(-1,-1,-1,-1).
Train the hetrocorrelator using multiple training encoding strategy for given patterns:
A1=(000111001) B1=(010000111), A2=(111001110) B2=(100000001), A3=(110110101)
B3(101001010). Test it using pattern A2.
Implement Union, Intersection, Complement and Difference operations on fuzzy sets. Also
create fuzzy relation by Cartesian product of any two fuzzy sets and perform max-min
composition on any two fuzzy relations.
Solve Greg Viots fuzzy cruise controller using MATLAB Fuzzy logic toolbox.
Solve Air Conditioner Controller using MATLAB Fuzzy logic toolbox
Implement TSP using GA.
Page 51 of 53

Subject Name: Project


Subject Code: CE 803
Teaching Scheme (Credits and Hours)
Teaching scheme

Evaluation Scheme

Total

Hrs

Hrs

Hrs

Hrs

00

00

34

34

Total

Theory

Credit

Hrs Marks
17

Mid Sem

CIA

Pract.

Total

Marks

Marks

Marks

Marks

300

300

600

Exam

Learning Objectives:
Student will be developing a project to integrate knowledge and skills acquired during their
studies of various courses and focus on all aspects of Software Development Life Cycle.
Students inventiveness, degree of effort and documentation skills will be enhanced.

Instructional Method and Pedagogy:

This is the full time project so the student will undergo sincere work under the guidance
of internal faculty members as well as external guides from industry.
A student is required to prepare project independently or in a team.
The project involves analytical, numerical or system analysis and design, system
development and testing, study - research project or combination of these.
Two internal presentations will be conducted.
One of the faculty member will visit the industry in which student is doing project to
interact with external guide and take the feedback. This feedback carries weightage in the
evaluation scheme.
The student is required to demonstrate their inventiveness, degree of effort and
documentation skills.
The students are also required to submit the report and defend the same.

Page 52 of 53

Internal Project evaluation based on following criteria:


Sr.
No
4.
5.
6.
7.

Criteria

Weightage

Examiners

Presentation 1
Presentation 2
Documentation
Industry Feedback

35%
35%
20%
10%

Panel consisting of minimum two


members
Internal Guide
External Guide

Evaluation Criteria of Presentation 1


Innovative
Project
Database System Presentation Question
Definition
Criteria
and
Design Diagrams
Skill
Answer
literature
survey
20%
20%
20%
10%
15%
Weightage

Interaction
with
Internal
Guide
15%

Evaluation Criteria of Presentation 2

Criteria
Weightage

Input / Technical
Presentation Question
Practical
Output Knowledge
Implementation
Skill
Answer
Design of Project
30%

10%

20%

10%

15%

Interaction
with
Internal
Guide
15%

External Project evaluation based on following criteria:


Practical
Innovative Literature Database
Presentation Question Project
Implementation
Project
Skill
Survey
Design
Answer Report
& Testing
Definition
10%
10%
15%
30%
10%
15%
10%
Weightage

Criteria

Page 53 of 53

You might also like