ANNA UNIVERSITY, CHENNAI

AFFILIATED INSTITUTIONS
B.E. COMPUTER SCIENCE AND ENGINEERING
REGULATIONS – 2017
CHOICE BASED CREDIT SYSTEM

SEMESTER- VI

Sl. COURSE CONTACT

COURSE TITLE CATEGORY L T P C
No CODE PERIODS
THEORY
1. CS8651 Internet Programming PC 3 3 0 0 3
2. CS8691 Artificial Intelligence PC 3 3 0 0 3
3. CS8601 Mobile Computing PC 3 3 0 0 3
4. CS8602 Compiler Design PC 5 3 0 2 4
5. CS8603 Distributed Systems PC 3 3 0 0 3

6. PE 3 3 0 0 3
(Professional Elective I)
PRACTICALS
Internet Programming
7. CS8661 PC 4 0 0 4 2
Laboratory
Mobile Application
8. CS8662 PC 4 0 0 4 2
Development Laboratory
9. CS8611 Mini Project EEC 2 0 0 2 1
Professional
10. HS8581 EEC 2 0 0 2 1
Communication
TOTAL 32 18 0 14 25

PROFESSIONAL ELECTIVE – I

Sl. COURSE CONTACT

COURSE TITLE CATEGORY L T P C
No CODE PERIODS
Data Warehousing and
1. CS8075 PE 3 3 0 0 3
Data Mining
2. IT8076 Software Testing PE 3 3 0 0 3

3. IT8072 Embedded Systems PE 3 3 0 0 3

4. CS8072 Agile Methodologies PE 3 3 0 0 3

Graph Theory and
5. CS8077 PE 3 3 0 0 3
Applications
6. IT8071 Digital Signal Processing PE 3 3 0 0 3
7. GE8075 Intellectual Property Rights PE 3 3 0 0 3

B. Yasar (B.E.,)
CS8651 INTERNET PROGRAMMING L T P C
3 0 0 3
OBJECTIVES:
 To understand different Internet Technologies.
 To learn java-specific web services architecture

UNIT I WEBSITE BASICS, HTML 5, CSS 3, WEB 2.0 9

Web Essentials: Clients, Servers and Communication – The Internet – Basic Internet protocols – World wide web
– HTTP Request Message – HTTP Response Message – Web Clients – Web Servers – HTML5 – Tables – Lists
– Image – HTML5 control elements – Semantic elements – Drag and Drop – Audio – Video controls - CSS3 –
Inline, embedded and external style sheets – Rule cascading – Inheritance – Backgrounds – Border Images –
Colors – Shadows – Text – Transformations – Transitions – Animations.

UNIT II CLIENT SIDE PROGRAMMING 9

Java Script: An introduction to JavaScript–JavaScript DOM Model-Date and Objects,Regular Expressions-
Exception Handling-Validation-Built-in objects-Event Handling-
DHTML with JavaScript- JSON introduction – Syntax – Function Files – Http Request – SQL.

UNIT III SERVER SIDE PROGRAMMING 9

Servlets: Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions- Session Handling-
Understanding Cookies- Installing and Configuring Apache Tomcat Web Server- DATABASE CONNECTIVITY:
JDBC perspectives, JDBC program example - JSP: Understanding Java Server Pages-JSP Standard Tag Library
(JSTL)-Creating HTML forms by embedding JSP code.

UNIT IV PHP and XML 9

An introduction to PHP: PHP- Using PHP- Variables- Program control- Built-in functions- Form Validation- Regular
Expressions - File handling – Cookies - Connecting to Database. XML: Basic XML- Document Type Definition-
XML Schema DOM and Presenting XML, XML Parsers and Validation, XSL and XSLT Transformation, News Feed
(RSS and ATOM).

UNIT V INTRODUCTION TO AJAX and WEB SERVICES 9

AJAX: Ajax Client Server Architecture-XML Http Request Object-Call Back Methods; Web Services: Introduction-
Java web services Basics – Creating, Publishing, Testing and Describing a Web services (WSDL)-Consuming a
web service, Database Driven web service from an application –SOAP.

TOTAL 45 PERIODS
OUTCOMES:
At the end of the course, the students should be able to:
 Construct a basic website using HTML and Cascading Style Sheets.
 Build dynamic web page with validation using Java Script objects and by applying different event handling
mechanisms.
 Develop server side programs using Servlets and JSP.
 Construct simple web pages in PHP and to represent data in XML format.
 Use AJAX and web services to develop interactive web applications

TEXT BOOK:
1. Deitel and Deitel and Nieto, ―Internet and World Wide Web - How to Program, Prentice Hall, 5th
Edition, 2011.

REFERENCES:
1. Stephen Wynkoop and John Burke ―Running a Perfect Website‖, QUE, 2nd Edition,1999.
2. Chris Bates, Web Programming – Building Intranet Applications, 3rd Edition, Wiley Publications, 2009.
3. Jeffrey C and Jackson, ―Web Technologies A Computer Science Perspective‖, Pearson Education,
2011.
4. Gopalan N.P. and Akilandeswari J., ―Web Technology‖, Prentice Hall of India, 2011.
5. UttamK.Roy, ―Web Technologies‖, Oxford University Press, 2011.

B. Yasar (B.E.,)
CS8691 ARTIFICIAL INTELLIGENCE L T P C
3 0 0 3
OBJECTIVES:
 To understand the various characteristics of Intelligent agents
 To learn the different search strategies in AI
 To learn to represent knowledge in solving AI problems
 To understand the different ways of designing software agents
 To know about the various applications of AI.

UNIT I INTRODUCTION 9
Introduction–Definition - Future of Artificial Intelligence – Characteristics of Intelligent Agents– Typical Intelligent
Agents – Problem Solving Approach to Typical AI problems.

UNIT II PROBLEM SOLVING METHODS 9

Problem solving Methods - Search Strategies- Uninformed - Informed - Heuristics - Local Search Algorithms and
Optimization Problems - Searching with Partial Observations - Constraint Satisfaction Problems – Constraint
Propagation - Backtracking Search - Game Playing - Optimal Decisions in Games – Alpha - Beta Pruning -
Stochastic Games

UNIT III KNOWLEDGE REPRESENTATION 9

First Order Predicate Logic – Prolog Programming – Unification – Forward Chaining-Backward Chaining –
Resolution – Knowledge Representation - Ontological Engineering-Categories and Objects – Events - Mental
Events and Mental Objects - Reasoning Systems for Categories - Reasoning with Default Information

UNIT IV SOFTWARE AGENTS 9

Architecture for Intelligent Agents – Agent communication – Negotiation and Bargaining – Argumentation among
Agents – Trust and Reputation in Multi-agent systems.

UNIT V APPLICATIONS 9
AI applications – Language Models – Information Retrieval- Information Extraction – Natural Language
Processing - Machine Translation – Speech Recognition – Robot – Hardware – Perception – Planning
– Moving

TOTAL 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:
 Use appropriate search algorithms for any AI problem
 Represent a problem using first order and predicate logic
 Provide the apt agent strategy to solve a given problem
 Design software agents to solve a problem
 Design applications for NLP that use Artificial Intelligence.

TEXT BOOKS:
1. S. Russell and P. Norvig, "Artificial Intelligence: A Modern Approach‖, Prentice Hall, Third Edition, 2009.
2. Bratko, ―Prolog: Programming for Artificial Intelligence‖, Fourth edition, Addison-Wesley Educational
Publishers Inc., 2011.

REFERENCES:
1. M. Tim Jones, ―Artificial Intelligence: A Systems Approach (Computer Science), Jones and Bartlett
Publishers, Inc.; First Edition, 2008
2. Nils J. Nilsson, ―The Quest for Artificial Intelligence‖, Cambridge University Press, 2009.
3. William F. Clocksin and Christopher S. Mellish,‖ Programming in Prolog: Using the ISO Standard‖, Fifth
Edition, Springer, 2003.
4. Gerhard Weiss, ―Multi Agent Systems‖, Second Edition, MIT Press, 2013.
5. David L. Poole and Alan K. Mackworth, ―Artificial Intelligence: Foundations of Computational Agents‖,
Cambridge University Press, 2010.

B. Yasar (B.E.,)
CS8601 MOBILE COMPUTING L T P C
3 0 0 3

OBJECTIVES:
 To understand the basic concepts of mobile computing.
 To learn the basics of mobile telecommunication system.
 To be familiar with the network layer protocols and Ad-Hoc networks.
 To know the basis of transport and application layer protocols.
 To gain knowledge about different mobile platforms and application development.

UNIT I INTRODUCTION 9
Introduction to Mobile Computing – Applications of Mobile Computing- Generations of Mobile Communication
Technologies- Multiplexing – Spread spectrum -MAC Protocols – SDMA- TDMA- FDMA- CDMA

UNIT II MOBILE TELECOMMUNICATION SYSTEM 9

Introduction to Cellular Systems - GSM – Services & Architecture – Protocols – Connection Establishment –
Frequency Allocation – Routing – Mobility Management – Security – GPRS- UMTS – Architecture – Handover –
Security

UNIT III MOBILE NETWORK LAYER 9

Mobile IP – DHCP – AdHoc– Proactive protocol-DSDV, Reactive Routing Protocols – DSR, AODV , Hybrid routing–
ZRP, Multicast Routing- ODMRP, Vehicular Ad Hoc networks ( VANET) –MANET Vs VANET – Security.

UNIT IV MOBILE TRANSPORT AND APPLICATION LAYER 9

Mobile TCP– WAP – Architecture – WDP – WTLS – WTP –WSP – WAE – WTA Architecture – WML

UNIT V MOBILE PLATFORMS AND APPLICATIONS 9

Mobile Device Operating Systems – Special Constraints & Requirements – Commercial Mobile Operating Systems
– Software Development Kit: iOS, Android, BlackBerry, Windows Phone – MCommerce – Structure – Pros & Cons
– Mobile Payment System – Security Issues

TOTAL 45 PERIODS
OUTCOMES:
At the end of the course, the students should be able to:
 Explain the basics of mobile telecommunication systems
 Illustrate the generations of telecommunication systems in wireless networks
 Determine the functionality of MAC, network layer and Identify a routing protocol for a given Ad hoc
network
 Explain the functionality of Transport and Application layers
 Develop a mobile application using android/blackberry/iOS/Windows SDK

TEXT BOOKS:
1. Jochen Schiller, ―Mobile Communications, PHI, Second Edition, 2003.
2. Prasant Kumar Pattnaik, Rajib Mall, ―Fundamentals of Mobile Computing, PHI Learning Pvt.Ltd, New
Delhi – 2012

REFERENCES :

1. Dharma Prakash Agarval, Qing and An Zeng, "Introduction to Wireless and Mobile systems",Thomson
Asia Pvt Ltd, 2005.
2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, ―Principles of Mobile Computing‖,
Springer, 2003.
3. William.C.Y.Lee,―Mobile Cellular Telecommunications-Analog and Digital Systems‖, Second
Edition,TataMcGraw Hill Edition ,2006.
4. C.K.Toh, ―AdHoc Mobile Wireless Networks‖, First Edition, Pearson Education, 2002.
5. Android Developers : http://developer.android.com/index.html
6. Apple Developer: https://developer.apple.com/
7. Windows Phone DevCenter : http://developer.windowsphone.com
8. BlackBerry Developer : http://developer.blackberry.com

B. Yasar (B.E.,)
CS8602 COMPILER DESIGN L T P C
3 0 2 4
OBJECTIVES:
 To learn the various phases of compiler.
 To learn the various parsing techniques.
 To understand intermediate code generation and run-time environment.
 To learn to implement front-end of the compiler.
 To learn to implement code generator.

UNIT I INTRODUCTION TO COMPILERS 9

Structure of a compiler – Lexical Analysis – Role of Lexical Analyzer – Input Buffering – Specification of Tokens –
Recognition of Tokens – Lex – Finite Automata – Regular Expressions to Automata – Minimizing DFA.

UNIT II SYNTAX ANALYSIS 12

Role of Parser – Grammars – Error Handling – Context-free grammars – Writing a grammar – Top Down Parsing
- General Strategies Recursive Descent Parser Predictive Parser-LL(1) Parser-Shift Reduce Parser -LR Parser-
LR (0) Item Construction of SLR Parsing Table Introduction to LALR Parser - Error Handling and Recovery in
Syntax Analyzer-YACC.

UNIT III INTERMEDIATE CODE GENERATION 8

Syntax Directed Definitions, Evaluation Orders for Syntax Directed Definitions, Intermediate Languages: Syntax
Tree, Three Address Code, Types and Declarations, Translation of Expressions, Type Checking.

UNIT IV RUN-TIME ENVIRONMENT AND CODE GENERATION 8

Storage Organization, Stack Allocation Space, Access to Non-local Data on the Stack, Heap Management - Issues
in Code Generation - Design of a simple Code Generator.

UNIT V CODE OPTIMIZATION 8

Principal Sources of Optimization – Peep-hole optimization - DAG- Optimization of Basic BlocksGlobal Data Flow
Analysis - Efficient Data Flow Algorithm.

LIST OF EXPERIMENTS:
1. Develop a lexical analyzer to recognize a few patterns in C. (Ex. identifiers, constants, comments,
operators etc.). Create a symbol table, while recognizing identifiers.
2. Implement a Lexical Analyzer using Lex Tool
3. Implement an Arithmetic Calculator using LEX and YACC
4. Generate three address code for a simple program using LEX and YACC.
5. Implement simple code optimization techniques (Constant folding, Strength reduction and Algebraic
transformation)
6. Implement back-end of the compiler for which the three address code is given as input and the 8086
assembly language code is produced as output.

PRACTICALS 30 PERIODS
THEORY 45 PERIODS
TOTAL : 75 PERIODS

OUTCOMES:
On Completion of the course, the students should be able to:
 Understand the different phases of compiler.
 Design a lexical analyzer for a sample language.
 Apply different parsing algorithms to develop the parsers for a given grammar.
 Understand syntax-directed translation and run-time environment.
 Learn to implement code optimization techniques and a simple code generator.
 Design and implement a scanner and a parser using LEX and YACC tools.

TEXT BOOK:
1. Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, Compilers: Principles, Techniques and
Tools‖, Second Edition, Pearson Education, 2009.

B. Yasar (B.E.,)
REFERENCES

1. Randy Allen, Ken Kennedy, Optimizing Compilers for Modern Architectures: A Dependence based
Approach, Morgan Kaufmann Publishers, 2002.
2. Steven S. Muchnick, Advanced Compiler Design and Implementation‖, Morgan Kaufmann Publishers -
Elsevier Science, India, Indian Reprint 2003.
3. Keith D Cooper and Linda Torczon, Engineering a Compiler‖, Morgan Kaufmann Publishers Elsevier
Science, 2004.
4. V. Raghavan, Principles of Compiler Design‖, Tata McGraw Hill Education Publishers, 2010.
5. Allen I. Holub, Compiler Design in C‖, Prentice-Hall Software Series, 1993.

B. Yasar (B.E.,)
CS8603 DISTRIBUTED SYSTEMS L T P C
3 0 0 3
OBJECTIVES:
 To understand the foundations of distributed systems.
 To learn issues related to clock Synchronization and the need for global state in distributed
systems.
 To learn distributed mutual exclusion and deadlock detection algorithms.
 To understand the significance of agreement, fault tolerance and recovery protocols in
Distributed Systems.
 To learn the characteristics of peer-to-peer and distributed shared memory systems.

UNIT I INTRODUCTION 9
Introduction: Definition –Relation to computer system components –Motivation –Relation to parallel systems –
Message-passing systems versus shared memory systems –Primitives for distributed communication –
Synchronous versus asynchronous executions –Design issues and challenges.
A model of distributed computations: A distributed program –A model of distributed executions –Models of
communication networks –Global state – Cuts –Past and future cones of an event –Models of process
communications.
Logical Time: A framework for a system of logical clocks –Scalar time –Vector time – Physical clock
synchronization: NTP.

UNIT II MESSAGE ORDERING & SNAPSHOTS 9

Message ordering and group communication: Message ordering paradigms –Asynchronous execution with
synchronous communication –Synchronous program order on an asynchronous system –Group communication –
Causal order (CO) - Total order.
Global state and snapshot recording algorithms: Introduction –System model and definitions –Snapshot
algorithms for FIFO channels

UNIT III DISTRIBUTED MUTEX & DEADLOCK 9

Distributed mutual exclusion algorithms: Introduction – Preliminaries – Lamport‘s algorithm – Ricart-Agrawala
algorithm – Maekawa‘s algorithm – Suzuki–Kasami‘s broadcast algorithm.
Deadlock detection in distributed systems: Introduction – System model – Preliminaries – Models of deadlocks
– Knapp‘s classification – Algorithms for the single resource model, the AND model and the OR model .

UNIT IV RECOVERY & CONSENSUS 9

Checkpointing and rollback recovery: Introduction – Background and definitions – Issues in failure recovery –
Checkpoint-based recovery – Log-based rollback recovery – Coordinated checkpointing algorithm – Algorithm for
asynchronous checkpointing and recovery.
Consensus and agreement algorithms: Problem definition – Overview of results – Agreement in a failure – free
system – Agreement in synchronous systems with failures.

UNIT V P2P & DISTRIBUTED SHARED MEMORY 9

Peer-to-peer computing and overlay graphs: Introduction – Data indexing and overlays – Chord – Content
addressable networks – Tapestry.
Distributed shared memory: Abstraction and advantages – Memory consistency models –Shared memory Mutual
Exclusion.

TOTAL 45 PERIODS
OUTCOMES:
At the end of this course, the students will be able to:
 Elucidate the foundations and issues of distributed systems
 Understand the various synchronization issues and global state for distributed systems.
 Understand the Mutual Exclusion and Deadlock detection algorithms in distributed systems
 Describe the agreement protocols and fault tolerance mechanisms in distributed systems.
 Describe the features of peer-to-peer and distributed shared memory systems

TEXT BOOKS:
1. Kshemkalyani, Ajay D., and Mukesh Singhal. Distributed computing: principles, algorithms, and
systems. Cambridge University Press, 2011.

B. Yasar (B.E.,)
 2. George Coulouris, Jean Dollimore and Tim Kindberg, ―Distributed Systems Concepts and
Design‖, Fifth Edition, Pearson Education, 2012.

REFERENCES:
1. Pradeep K Sinha, "Distributed Operating Systems: Concepts and Design", Prentice Hall of India, 2007.
2. Mukesh Singhal and Niranjan G. Shivaratri. Advanced concepts in operating systems. McGraw-Hill, Inc.,
1994.
3. Tanenbaum A.S., Van Steen M., ―Distributed Systems: Principles and Paradigms, Pearson Education,
2007.
4. Liu M.L., ―Distributed Computing, Principles and Applications‖, Pearson Education, 2004.
5. Nancy A Lynch, ―Distributed Algorithms‖, Morgan Kaufman Publishers, USA, 2003.

B. Yasar (B.E.,)
CS8075 DATA WAREHOUSING AND DATA MINING L T P C
3 0 0 3
OBJECTIVES:
 To understand data warehouse concepts, architecture, business analysis and tools
 To understand data pre-processing and data visualization techniques
 To study algorithms for finding hidden and interesting patterns in data
 To understand and apply various classification and clustering techniques using tools.

UNIT I DATA WAREHOUSING, BUSINESS ANALYSIS AND ON-LINE ANALYTICAL

PROCESSING (OLAP) 9
Basic Concepts - Data Warehousing Components – Building a Data Warehouse – Database Architectures for
Parallel Processing – Parallel DBMS Vendors - Multidimensional Data Model – Data Warehouse Schemas for
Decision Support, Concept Hierarchies -Characteristics of OLAP Systems – Typical OLAP Operations, OLAP and
OLTP.

UNIT II DATA MINING – INTRODUCTION 9

Introduction to Data Mining Systems – Knowledge Discovery Process – Data Mining Techniques – Issues –
applications- Data Objects and attribute types, Statistical description of data, Data Preprocessing – Cleaning,
Integration, Reduction, Transformation and discretization, Data Visualization, Data similarity and dissimilarity
measures.

UNIT III DATA MINING - FREQUENT PATTERN ANALYSIS 9

Mining Frequent Patterns, Associations and Correlations – Mining Methods- Pattern Evaluation Method – Pattern
Mining in Multilevel, Multi Dimensional Space – Constraint Based Frequent Pattern Mining, Classification using
Frequent Patterns

UNIT IV CLASSIFICATION AND CLUSTERING 9

Decision Tree Induction - Bayesian Classification – Rule Based Classification – Classification by Back Propagation
– Support Vector Machines –– Lazy Learners – Model Evaluation and Selection-Techniques to improve
Classification Accuracy.

Clustering Techniques – Cluster analysis -Partitioning Methods - Hierarchical Methods – Density Based Methods
- Grid Based Methods – Evaluation of clustering – Clustering high dimensional data- Clustering with constraints,
Outlier analysis-outlier detection methods.

UNIT V WEKA TOOL 9

Datasets – Introduction, Iris plants database, Breast cancer database, Auto imports database - Introduction to
WEKA, The Explorer – Getting started, Exploring the explorer, Learning algorithms, Clustering algorithms,
Association–rule learners.

TOTAL 45 PERIODS

OUTCOMES:
Upon completion of the course, the students should be able to:
 Design a Data warehouse system and perform business analysis with OLAP tools.
 Apply suitable pre-processing and visualization techniques for data analysis
 Apply frequent pattern and association rule mining techniques for data analysis
 Apply appropriate classification and clustering techniques for data analysis

TEXT BOOK:
1. Jiawei Han and Micheline Kamber, ―Data Mining Concepts and Techniques, Third Edition, Elsevier,2012

REFERENCES:
1. Alex Berson and Stephen J.Smith, ―Data Warehousing, Data Mining & OLAP, Tata McGraw – Hill
Edition, 35th Reprint 2016.
2. K.P. Soman, Shyam Diwakar and V. Ajay, ―Insight into Data Mining Theory and Practice, Eastern
Economy Edition, Prentice Hall of India, 2006.
3. Ian H.Witten and Eibe Frank, ―Data Mining: Practical Machine Learning Tools and Techniques, Elsevier,
Second Edition.

B. Yasar (B.E.,)
CS8661 INTERNET PROGRAMMING LABORATORY L T P C
0 0 4 2
OBJECTIVES:
 To be familiar with Web page design using HTML/XML and style sheets
 To be exposed to creation of user interfaces using Java frames and applets.
 To learn to create dynamic web pages using server side scripting.
 To learn to write Client Server applications.
 To be familiar with the PHP programming.
 To be exposed to creating applications with AJAX

LIST OF EXPERIMENTS:

1. Create a web page with the following using HTML

a. To embed a map in a web page
b. To fix the hot spots in that map
c. Show all the related information when the hot spots are clicked.

2. Create a web page with the following.

a. Cascading style sheets.
b. Embedded style sheets.
c. Inline style sheets. Use our college information for the web pages.

3. Validate the Registration, user login, user profile and payment by credit card pages using JavaScript.
4. Write programs in Java using Servlets:
i. To invoke servlets from HTML forms
ii. Session tracking using hidden form fields and Session tracking for a hit count
5. Write programs in Java to create three-tier applications using servlets for conducting online examination
for displaying student mark list. Assume that student information is available in a database which has
been stored in a database server.

6. Install TOMCAT web server. Convert the static web pages of programs into dynamic web pages using
servlets (or JSP) and cookies. Hint: Users information (user id, password, credit card number) would be
stored in web.xml. Each user should have a separate Shopping Cart.

7. Redo the previous task using JSP by converting the static web pages into dynamic web pages. Create a
database with user information and books information. The books catalogue should be dynamically
loaded from the database.

8. Create and save an XML document at the server, which contains 10 users Information. Write a Program,
which takes user Id as an input and returns the User details by taking the user information from the XML
document.

9. i. Validate the form using PHP regular expression.

ii. PHP stores a form data into database.

10. Write a web service for finding what people think by asking 500 people‘s opinion for any
consumer product.
TOTAL 60 PERIODS
OUTCOMES:
Upon Completion of the course, the students will be able to:
 Construct Web pages using HTML/XML and style sheets.
 Build dynamic web pages with validation using Java Script objects and by applying
different event handling mechanisms.
 Develop dynamic web pages using server side scripting.
 Use PHP programming to develop web applications.
 Construct web applications using AJAX and web services.

SOFTWARE REQUIRED:
 Dream Weaver or Equivalent, MySQL or Equivalent, Apache Server, WAMP/XAMPP

B. Yasar (B.E.,)
CS8662 MOBILE APPLICATION DEVELOPMENT LABORATORY L T P C
0 0 4 2

OBJECTIVES:
 To understand the components and structure of mobile application development frameworks for Android
and windows OS based mobiles.
 To understand how to work with various mobile application development frameworks.
 To learn the basic and important design concepts and issues of development of mobile applications.
 To understand the capabilities and limitations of mobile devices.

LIST OF EXPERIMENTS:
1. Develop an application that uses GUI components, Font and Colors
2. Develop an application that uses Layout Managers and event listeners.
3. Write an application that draws basic graphical primitives on the screen.
4. Develop an application that makes use of databases.
5. Develop an application that makes use of Notification Manager
6. Implement an application that uses Multi-threading
7. Develop a native application that uses GPS location information
8. Implement an application that writes data to the SD card.
9. Implement an application that creates an alert upon receiving a message
10. Write a mobile application that makes use of RSS feed
11. Develop a mobile application to send an email.
12. Develop a Mobile application for simple needs (Mini Project)

TOTAL 60 PERIODS
OUTCOMES:
Upon Completion of the course, the students will be able to:
 Develop mobile applications using GUI and Layouts.
 Develop mobile applications using Event Listener.
 Develop mobile applications using Databases.
 Develop mobile applications using RSS Feed, Internal/External Storage, SMS, Multithreading and GPS.
 Analyze and discover own mobile app for simple needs.

REFERENCES:
1. Build Your Own Security Lab, Michael Gregg, Wiley India

LIST OF EQUIPMENTS FOR A BATCH OF 30 STUDENTS:

 SOFTWARE: C / C++ / Java or equivalent compiler GnuPG, Snort, N-Stalker or Equivalent
 HARDWARE: Standalone desktops - 30 Nos. (or) Server supporting 30 terminals or more.

B. Yasar (B.E.,)
HS8581 PROFESSIONAL COMMUNICATION L T P C
0 0 2 1

OBJECTIVES:
The course aims to:
 Enhance the Employability and Career Skills of students
 Orient the students towards grooming as a professional
 Make them Employable Graduates
 Develop their confidence and help them attend interviews successfully.

UNIT I
Introduction to Soft Skills-- Hard skills & soft skills - employability and career Skills—Grooming as a professional
with values—Time Management—General awareness of Current Affairs

UNIT II
Self-Introduction-organizing the material - Introducing oneself to the audience – introducing the topic – answering
questions – individual presentation practice–– presenting the visuals effectively – 5 minute presentations

UNIT III
Introduction to Group Discussion— Participating in group discussions – understanding group dynamics -
brainstorming the topic -– questioning and clarifying –GD strategies- activities to improve GD skills

UNIT IV
Interview etiquette – dress code – body language – attending job interviews– telephone/skype interview -
one to one interview &panel interview – FAQs related to job interviews

UNIT V
Recognizing differences between groups and teams- managing time-managing stress- networking professionally-
respecting social protocols-understanding career management-developing a long-term career plan-making career
changes

TOTAL 30 PERIODS

OUTCOMES:
At the end of the course Learners will be able to:
 Make effective presentations
 Participate confidently in Group Discussions.
 Attend job interviews and be successful in them.
 Develop adequate Soft Skills required for the workplace

Recommended Software
1. Globearena
2. Win English

REFERENCES:
1. Butterfield, Jeff Soft Skills for Everyone. Cengage Learning: New Delhi, 2015
2. E. Suresh Kumar et al. Communication for Professional Success. Orient Blackswan: Hyderabad, 2015
3. Interact English Lab Manual for Undergraduate Students,. OrientBalckSwan: Hyderabad, 2016.
4. Raman, Meenakshi and Sangeeta Sharma. Professional Communication. Oxford University Press:
Oxford, 2014
5. S. Hariharanetal. Soft Skills. MJP Publishers: Chennai, 2010

B. Yasar (B.E.,)