GUJARAT TECHNOLOGICAL UNIVERSITY

Bachelor of Engineering
Subject Code: 3170724
Semester – VII
Subject Name: Machine Learning

Type of course: Elective

Prerequisite: Programming and Data Structure, Algorithms, Probability and Statistics

Rationale: The objective of the course is to introduce the students with concepts of machine learning,
machine learning algorithms and building the applications using machine leaning for various domains.

Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total

L T P C Theory Marks Practical Marks Marks
ESE (E) PA (M) ESE (V) PA (I)
3 0 2 4 70 30 30 20 150

Content:g

Sr. No. Content Total

Hrs

1 Introduction to Machine Learning: 02

Overview of Human Learning and Machine Learning, Types of Machine Learning,
Applications of Machine Learning , Tools and Technology for Machine Learning .
2 Preparing to Model: 04
Machine Learning activities, Types of data in Machine Learning, Structures of data, Data
quality and remediation, Data Pre-Processing: Dimensionality reduction, Feature subset
selection.
3 Modelling and Evaluation: 05
Selecting a Model: Predictive/Descriptive, Training a Model for supervised learning,
model representation and interpretability, Evaluating performance of a model, Improving
performance of a model.
4 Basics of Feature Engineering: 03
Feature and Feature Engineering, Feature transformation: Construction and extraction,
Feature subset selection : Issues in high-dimensional data, key drivers, measure and overall
process
5 Overview of Probability: 04
Statistical tools in Machine Learning, Concepts of probability, Random variables, Discrete
distributions, Continuous distributions, Multiple random variables, Central limit theorem,
Sampling distributions, Hypothesis testing, Monte Carlo Approximation
6 Bayesian Concept Learning: 05
Impotence of Bayesian methods, Bayesian theorem, Bayes’ theorem and concept learning,
Bayesian Belief Network

Page 1 of 3

w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Engineering
Subject Code: 3170724
7 Supervised Learning: Classification and Regression: 10
Supervised Learning, Classification Model, Learning steps, Classification algorithms,
Regression, Regression algorithms,
8 Unsupervised Learning: 06
Supervised vs. Unsupervised Learning, Applications, Clustering, Association rules
9 Neural Network: 06
Introduction to neural network, Biological and Artificial Neurons, Types of Activation
functions, Implementation of ANN, Architecture, Leaning process, Backpropogation, Deep
Learning

Suggested Specification table with Marks (Theory):

Distribution of Theory Marks

R Level U Level A Level N Level E Level C Level

7 14 21 14 7 7

Legends: R: Remembrance; U: Understanding; A: Application, N: Analyze and E: Evaluate C:

Create and above Levels (Revised Bloom’s Taxonomy)

Reference Books:

1. Machine Learning, Saikat Dull, S. Chjandramouli, Das, Pearson

2. Machine Learning with Python for Everyone, Mark Fenner, Pearson
3. Machine Learning, Anuradha Srinivasaraghavan, Vincy Joseph, Wiley
4. Machine Learning with Python, U Dinesh Kumar Manaranjan Pradhan, Wiley
5. Python Machine Learning, Sebastian Raschka, Vahid Mirjalili, Packt Publishing

Course Outcomes:

Sr. CO statement Marks %

No. weightage
CO-1 Explore the fundamental issues and challenges in Machine Learning 25
including data and model selection and complexity
CO-2 Appreciate the underlying mathematical relationships within and across 15
Machine Learning algorithms
CO-3 Evaluate the various Supervised Learning algorithms using appropriate 25
Dataset.
CO-4 Evaluate the various unsupervised Learning algorithms using appropriate 20
Dataset.
CO-5 Design and implement various machine learning algorithms in a range of 15
real-world applications.

Page 2 of 3

w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Engineering
Subject Code: 3170724
List of Experiments:

Minimum 10 Experiments are to be designed covering various activities and algorithms in machine learning
with datasets from different domains

List of e-Learning Resources:

1. https://www.geeksforgeeks.org/machine-learning/
2. https://www.tutorialspoint.com/machine_learning_with_python/index.htm
3. https://nptel.ac.in/
4. https://www.coursera.org/

Page 3 of 3

w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Computer Engineering
Subject Code: 3170701
Semester – VII
Subject Name : Compiler Design

Type of course: Compulsory/Core

Prerequisite: Algorithms, Data Structures, Assembly Language Program, Theory of Computation,

C/C++ Programming Skills

Rationale: Compiler Design is a fundamental subject of Computer Engineering. Compiler design

principles provide an in-depth view of translation, optimization and compilation of the
entire source program. It also focuses on various designs of compiler and structuring of
various phases of compiler. It is inevitable to grasp the knowledge of various types of
grammar, lexical analysis, yacc, FSM(Finite State Machines) and correlative concepts of
languages.

Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total

L T P C Theory Marks Practical Marks Marks
ESE (E) PA (M) ESE (V) PA (I)
3 0 2 4 70 30 30 20 150

Content:

Sr. No. Content Total

Hrs

1 Overview of the Compiler and its Structure: 03

Language processor, Applications of language processors, Definition-Structure-Working
of compiler, the science of building compilers, Basic understanding of interpreter and
assembler. Difference between interpreter and compiler. Compilation of source code into
target language, Cousins of compiler, Types of compiler
2 Lexical Analysis: 05
The Role of the Lexical Analyzer, Specification of Tokens, Recognition of Tokens, Input
Buffering, elementary scanner design and its implementation (Lex), Applying concepts of
Finite Automata for recognition of tokens.
3 Syntax Analysis: 11
Understanding Parser and CFG(Context Free Grammars), Left Recursion and Left
Factoring of grammar Top Down and Bottom up Parsing Algorithms, Operator-Precedence
Parsing, LR Parsers, Using Ambiguous Grammars, Parser Generators, Automatic
Generation of Parsers. Syntax-Directed Definitions, Construction of Syntax Trees,
Bottom-Up Evaluation of S-Attributed Definitions, L-Attributed Definitions, syntax
directed definitions and translation schemes
Page 1 of 4

w.e.f. AY 2020-21
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Computer Engineering
Subject Code: 3170701
4 Error Recovery 04
Error Detection & Recovery, Ad-Hoc and Systematic Methods
5 Intermediate-Code Generation: 05
Variants of Syntax Trees, Three-Address Code, Types and Declarations, Translation of
Expressions, Type Checking, Syntax Directed Translation Mechanisms, Attributed
Mechanisms And Attributed Definition.
6 Run-Time Environments: 04
Source Language Issues, Storage Organization. Stack Allocation of Space, Access to
Nonlocal Data on the Stack, Heap Management,
7 Code Generation and Optimization: 06
Issues in the Design of a Code Generator, The Target Language, Addresses in the Target
Code, Basic Blocks and Flow Graphs, Optimization of Basic Blocks, A Simple Code
Generator, Machine dependent optimization, Machine independent optimization Error
detection of recovery
8 Instruction-Level Parallelism: 04
Processor Architectures, Code-Scheduling Constraints, Basic-Block Scheduling, Pass
structure of assembler

Suggested Specification table with Marks (Theory):

Distribution of Theory Marks

R Level U Level A Level N Level E Level C Level

10 25 20 10 05 00

Legends: R: Remembrance; U: Understanding; A: Application, N: Analyze and E: Evaluate C:

Create and above Levels (Revised Bloom’s Taxonomy)

Note: This specification table shall be treated as a general guideline for students and teachers. The actual
distribution of marks in the question paper may vary slightly from above table.

Text Books
1. Compiler Tools Techniques - A.V.Aho, Ravi Sethi, J.D.Ullman, Addison Wesley
2. The Theory And Practice Of Compiler Writing - Trembley J.P. And Sorenson P.G.
Mcgraw-Hill

Reference Books:

1. Modern Compiler Design - Dick Grune, Henri E. Bal, Jacob, Langendoen, WILEY
India
2. Compiler Construction - Waite W.N. And Goos G., Springer Verlag
3. Compiler Construction-Principles And Practices - D.M.Dhamdhere, Mcmillian
4. Principles of Compiler Design, V. Raghavan, McGrawHill
Page 2 of 4

w.e.f. AY 2020-21
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Computer Engineering
Subject Code: 3170701
Course Outcomes:

After learning the course the students should be able to:

Sr. CO statement Marks %

No. weightage
CO-1 Understand the basic concepts; ability to apply automata theory and knowledge on 35
formal languages.
CO-2 Ability to identify and select suitable parsing strategies for a compiler for various 25
cases. Knowledge in alternative methods (top-down or bottom-up, etc).
CO-3 Understand backend of compiler: intermediate code, Code optimization 25
Techniques and Error Recovery mechanisms
CO-4 Understand issues of run time environments and scheduling for instruction level 15
parallelism.

Sample List of Experiments

Sr No Title of Experiment
1 Implementation of Finite Automata and String Validation
2 Introduction to Lex Tool.
3 Implement following Programs Using Lex
a. Generate Histogram of words
b. Ceasor Cypher
c. Extract single and multiline comments from C Program
4 Implement following Programs Using Lex
a. Convert Roman to Decimal
b. Check weather given statement is compound or simple
c. Extract html tags from .html file
5 Implementation of Recursive Descent Parser without backtracking
Input: The string to be parsed.
Output: Whether string parsed successfully or not. Explanation:
Students have to implement the recursive procedure for RDP for a typical grammar. The
production no. are displayed as they are used to derive the string.
6 Finding “First” set
Input: The string consists of grammar symbols.
Output: The First set for a given string.
Explanation:
The student has to assume a typical grammar. The program when run will ask for the string
to be entered. The program will find the First set of the given string.
7 Generate 3-tuple intermediate code for given infix expression
8 Extract Predecessor and Successor from given Control Flow Graph
9 Introduction to YACC and generate Calculator Program
10 Finding “Follow” set
Input: The string consists of grammar symbols.
Output: The Follow set for a given string.
Explanation:
Page 3 of 4

w.e.f. AY 2020-21
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Computer Engineering
Subject Code: 3170701
The student has to assume a typical grammar. The program when run will ask for the string
to be entered. The program will find the Follow set of the given string.
11 Implement a C program for constructing LL (1) parsing.
12 Implement a C program to implement LALR parsing.
13 Implement a C program to implement operator precedence parsing.

Page 4 of 4

w.e.f. AY 2020-21
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Computer Engineering
Subject Code: 3170719
Semester –VII
Subject Name: Distributed System

Type of course: Elective

Prerequisite: Data Structure and Algorithm, Operating System, Computer Network

Rationale: A distributed system is a system whose components are located on different networked
computers, which communicate and coordinate their actions by passing messages to one another.The
components interact with one another in order to achieve a common goal. Three significant characteristics
of distributed systems are: concurrency of components, lack of a global clock, and independent failure of
components. From this course, students may learn foundations of distributed systems, idea of peer to peer
services and file system, and security issues in distributed system.

Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total

L T P C Theory Marks Practical Marks Marks
ESE (E) PA (M) ESE (V) PA (I)
3 0 2 4 70 30 30 20 150

Content:

Sr. No. Content Total

Hrs

1 Fundamentals of Distributed System: Definition of a Distributed System, Goals of a 02

Distributed System, Types of Distributed Systems, Basics of Operating System and
Networking.

2 Basics of Architectures, Processes, and Communication: Architectures - Types of 08

System Architectures, Self Management in Distributed Systems; Processes - Basics of
Threads, Virtualization, Roles of Client and Server, Code Migration; Communication -
Types of Communications, Remote Procedure Calls, Message-Oriented Communication,
Stream-Oriented Communication, Multicasting

3 Naming - Names, Identifiers, And Addresses, Flat Naming, Structured Naming, Attribute- 02
Based Naming

4 Synchronization - Clock Synchronization, Logical Clocks, Mutual Exclusion, Global 04

Positioning Of Nodes, Election Algorithms

Page 1 of 3

w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Computer Engineering
Subject Code: 3170719
5 Consistency, Replication and Fault Tolerance-Introduction To Replication, Data- 10
Centric Consistency Models, Client-Centric Consistency Models, Replica Management,
Consistency Protocols, Basics of Fault Tolerance, Process Resilience, Reliable Client-
Server Communication, Reliable Group Communication, Distributed Commit, Recovery

6 Security: Introduction to Security- Security Threats, Policies, and Mechanisms, Design 07

Issues, Basics of Cryptography, Secure Channels- Authentication, Message Integrity and
Confidentiality, Secure Group Communication; Access Control- General Issues in Access
Control, Firewalls, Secure Mobile Code, Denial of Service; Security Management-Key
Management, Secure Group Management, Authorization Management

7 Categories of Distributed System:Architecture, Processes, Communication, Naming, 09

Synchronization, Consistency and Replication, Fault Tolerance, Security: Distributed
Object-based System;Distributed File System;Distributed Web-based System; Distributed
Coordination based System

Suggested Specification table with Marks (Theory):

Distribution of Theory Marks

R Level U Level A Level N Level E Level C Level

15 20 20 10 05 00

Legends: R: Remembrance; U: Understanding; A: Application, N: Analyze and E: Evaluate C:

Create and above Levels (Revised Bloom’s Taxonomy)

Note: This specification table shall be treated as a general guideline for students and teachers. The actual
distribution of marks in the question paper may vary slightly from above table.

Reference Books:

1. Tanenbaum, A.S. and Van Steen, M., 2007. Distributed systems: principles and paradigms.
Prentice-Hall.

2. Sinha, P.K., 1998. Distributed operating systems: concepts and design. PHI Learning Pvt. Ltd..

3. Liu, M.L., 2003. Distributed computing: principles and applications. Pearson Education Inc..

4. Lynch, N.A., 1996. Distributed algorithms. Elsevier.

5. Coulouris, G.F., Dollimore, J. and Kindberg, T., 2005. Distributed systems: concepts and
design.pearson education.
Page 2 of 3

w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Computer Engineering
Subject Code: 3170719
Course Outcomes:

Sr. CO statement Marks %

No. weightage
CO-1 Understand architecture and communication systems in Distributed 30
Systems
CO-2 Understand synchronization and various election algorithms in 10
Distributed Systems
CO-3 Analyze various consistency and replication protocols and methods 30
CO-4 Recognize security threats and apply cryptography methods for security 15
in Distributed Systems
CO-5 Understand various types of Distributed Systems 15

Sample List of Experiments:

1. Write a Program to implement Concurrent Echo Client Server Application.

2. Write at least 2 Programs for Remote Procedure call.
3. Write at least 2 Programs for Remote Method Invocation.
4. Write the Programs for Thread Programming in JAVA.
5. Implement Network File System (NFS).
6. Creation of a BPEL (Business Process Execution Language) Module and a Composite Application.
7. Implement CORBA file.
8. Study of Web Service Programming
9. Study of open source key management tool.

Page 3 of 3

w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Engineering
Subject Code: 3170717
CLOUD COMPUTING
Semester - 7th Semester

Type of course: Professional Elective

Prerequisite: Fundamentals of Distributed Computing

Rationale: This course aims students to understand the hardware, software concepts and architecture of cloud
computing. Students realize the importance of Cloud Virtualization, Abstractions and Enabling Technologies.

Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks
Total
Theory Marks Practical Marks
L T P C Marks
ESE (E) PA ESE (V) PA (I)
3 0 0 3 70 30 0 0 100

Contents:
Sr. Total
Content
No. Hrs
Introduction: Cloud Computing, Layers and Types of Clouds, Cloud Infrastructure
Management, Challenges and Applications. Virtualization: Virtualization of
1 04
Computing, Storage and Resources. Cloud Services: Introduction to Cloud Services
IaaS, PaaS and SaaS
Software as a Service (SaaS): Evolution of SaaS, Challenges of SaaS Paradigm,
SaaS Integration Services, SaaS Integration of Products and Platforms.
Infrastructure As a Services (IaaS): Introduction, Background & Related Work,
2 Virtual Machines Provisioning and Manageability, Virtual Machine Migration 08
Services, VM Provisioning and Migration in Action. Platform As a service (PaaS):
Integration of Private and Public Cloud, Technologies and Tools for Cloud
Computing, Resource Provisioning services

Abstraction and Virtualization: Introduction to Virtualization Technologies, Load

Balancing and Virtualization, Understanding Hyper visors, Understanding Machine
Imaging, Porting Applications, Virtual Machines Provisioning and Manageability
3 Virtual Machine Migration Services, Virtual Machine Provisioning and Migration in 08
Action, Provisioning in the Cloud Context, Virtualization of CPU, Memory, I/O
Devices, Virtual Clusters and Resource management, Virtualization for Data Center
Automation

Cloud Infrastructure and Cloud Resource Management: Architectural Design of

Compute and Storage Clouds, Layered Cloud Architecture Development, Design
4 Challenges, Inter Cloud Resource Management, Resource Provisioning and 08
Platform Deployment, Global Exchange of Cloud Resources. Administrating the
Clouds, Cloud Management Products, Emerging Cloud Management Standards
Security: Security Overview, Cloud Security Challenges and Risks, Software-as-a
Service Security, Cloud computing security architecture: Architectural
5 Considerations, General Issues Securing the Cloud, Securing Data, Data Security, 07
Application Security, Virtual Machine Security, Identity and Presence, Identity
Management and Access Control, Autonomic Security Establishing Trusted Cloud

Page 1 of 2
w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Engineering
Subject Code: 3170717
computing, Secure Execution Environments and Communications, , Identity
Management and Access control Identity management, Access control, Autonomic
Security Storage Area Networks, Disaster Recovery in Clouds.

Cloud Middleware: OpenStack, Eucaluptus, Windows Azure, CloudSim, EyeOs,

6 05
Aneka, Google App Engine
Cloud Based Case-Studies: Overview of Cloud services, Designing Solutions for
7 the Cloud, Implement & Integrate Solutions, Emerging Markets and the Cloud, 05
Tools for Building Private Cloud: IaaS using Eucalyptus, PaaS on IaaS - AppScale

Suggested Specification table with Marks (Theory):

Distribution of Theory Marks

R Level U Level A Level N Level E Level C Level
25 30 10 05 - -
Legends: R: Remembrance; U: Understanding; A: Application, N: Analyze and E: Evaluate C: Create and
above Levels (Revised Bloom’s Taxonomy)
Note: This specification table shall be treated as a general guideline for students and teachers. The actual
distribution of marks in the question paper may vary from above table.

Books:
1. Rajkumar Buyya, James Broberg, Andrzej M Goscinski, Cloud Computing: Principles and Paradigms,
Wiley publication.
2. Toby Velte, Anthony Velte, Cloud Computing: A Practical Approach, McGraw-Hill Osborne Media.
3. George Reese, Cloud Application Architectures: Building Applications and Infrastructure in the Cloud,
O'Reilly Publication.
4. John Rhoton, Cloud Computing Explained: Implementation Handbook for Enterprises, Recursive Press.

Course Outcomes: Students will be able to

Sr. Marks
CO Statement
No. % Weightage
1 Compare the strengths and limitations of cloud computing 15
2 Identify the architecture, infrastructure and delivery models of cloud computing 25
3 Apply suitable virtualization concept. 20
4 Choose the appropriate cloud player, Programming models and approach 20
5 Address the core issues of cloud computing such as security, privacy and interoperability 20

List of Open Source Software/learning website:

• technolamp.blogspot.com
• www.intelligentedu.com/
• NITTR Instructional Resources Videos

Page 2 of 2
w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Computer Engineering
Subject Code: 3170716
Semester – VII
Subject Name: Artificial Intelligence

Type of course: Regular

Prerequisite: Data Structures, Mathematics

Rationale: With the usage of Internet and World Wide Web increasing day by day, the field of AI and its
techniques are being used in many areas which directly affect human life. Various techniques for encoding
knowledge in computer systems such as Predicate Logic, Production rules, Semantic networks find
application in real world problems. The fields of AI such as Game Playing, Natural Language Processing,
and Connectionist Models are also important. Student should know some programming language for AI.

Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total

L T P C Theory Marks Practical Marks Marks
ESE (E) PA (M) ESE (V) PA (I)
3 0 2 4 70 30 30 20 150

Contents:

Sr. Content Total

No. Hrs
Introduction : The AI Problems, The Underlying Assumption, AI techniques, The Level 2
1
of The Model, Criteria For Success
Problems, State Space Search & Heuristic Search Techniques: Defining The Problems 6
As A State Space Search, Production Systems, Production Characteristics, Production
2 System Characteristics and Issues in the Design of Search Programs, Generate-And-Test,
Hill Climbing, Best-First Search, Problem Reduction, Constraint Satisfaction, Means-Ends
Analysis.
Knowledge Representation: Representations And Mappings, Approaches To Knowledge 7
Representation, Representation Simple Facts In Logic, Representing Instance And Isa
3
Relationships, Computable Functions and Predicates, Resolution, Procedural versus
Declarative Knowledge, Logic Programming, Forward versus Backward Reasoning.
Symbolic Reasoning Under Uncertainty: Introduction To Nonmonotonic Reasoning, 2
4
Logics For Non-monotonic Reasoning.
Probabilistic Reasoning: Probability And Bays’ Theorem, Certainty Factors And Rule- 3
5
Base Systems, Bayesian Networks, Dempster-Shafer Theory, Fuzzy Logic
Game Playing: Overview, MiniMax Search Procedure, Alpha-Beta Cut-offs, 2
6
Refinements, Iterative deepening.
7 Planning: The Blocks World, Components Of a Planning System, Goal Stack Planning, 3
Nonlinear Planning Using Constraint Posting, Hierarchical Planning, Reactive Systems
8 Natural Language Processing: Introduction, Syntactic Processing, Semantic Analysis, 3
Discourse And Pragmatic Processing, Spell Checking

Page 1 of 3

w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Computer Engineering
Subject Code: 3170716
9 Connectionist Models: Introduction: Hopfield Network, Learning In Neural Network, 4
Application Of Neural Networks, Recurrent Networks, Distributed Representations,
Connectionist AI And Symbolic AI.
10 Expert Systems: Representing and Using Domain Knowledge, Expert System Shells, 2
Explanation, Knowledge Acquisition.
11 Genetic Algorithms: A Peek into the Biological World, Genetic Algorithms (GAs), 4
Significance of the Genetic Operators, Termination Parameters.
12 Introduction to Prolog: Introduction, Converting English to Prolog Facts and Rules, 4
Goals, Prolog Terminology, Variables, Control Structures, Arithmetic Operators, Matching
in Prolog, Backtracking, Cuts, Recursion, Lists.

Suggested Specification table with Marks (Theory):

Distribution of Theory Marks

R Level U Level A Level N Level E Level C Level
10 20 20 10 05 05
Legends: R: Remembrance; U: Understanding; A: Application, N: Analyze and E: Evaluate C:
Create and above Levels (Revised Bloom’s Taxonomy)

Note: This specification table shall be treated as a general guideline for students and teachers. The actual
distribution of marks in the question paper may vary slightly from above table.

Reference Books:
1. “Artificial Intelligence” -By Elaine Rich And Kevin Knight (2nd Edition) Tata Mcgraw-Hill
2. “Artificial Intelligence: A Modern Approach” -By Stuart Russel, Peter Norvig, PHI
3. “Introduction to Prolog Programming” -By Carl Townsend.
4. “PROLOG Programming For Artificial Intelligence” -By Ivan Bratko( Addison-Wesley)
5. “Programming with PROLOG” –By Klocksin and Mellish.
Course Outcomes:
Sr. CO statement Marks %
No. weightage
CO-1 Understand the search technique procedures applied to real world problems 25
CO-2 Understand and use various types of logic and knowledge representation schemes. 30
CO-3 Understand various Game Playing techniques and apply them in programs. 15
CO-4 Gain knowledge in AI Applications and advances in Artificial Intelligence 20
CO-5 Use Prolog Programming language using predicate logic 10

Sample List of Experiments:

1. Write a program to implement Tic-Tac-Toe game problem.

2. Write a program to implement BFS (for 8 puzzle problem or Water Jug problem or any AI search
problem) .
Page 2 of 3

w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Computer Engineering
Subject Code: 3170716
3. Write a program to implement DFS (for 8 puzzle problem or Water Jug problem or any AI search
problem)
4. Write a program to implement Single Player Game (Using any Heuristic Function)
5. Write a program to Implement A* Algorithm.
6. Write a program to implement mini-max algorithm for any game development.
7. Assume given a set of facts of the form father(name1,name2) (name1 is the father of name2).
8. Define a predicate brother(X,Y) which holds iff X and Y are brothers.
Define a predicate cousin(X,Y) which holds iff X and Y are cousins.
Define a predicate grandson(X,Y) which holds iff X is a grandson of Y.
Define a predicate descendent(X,Y) which holds iff X is a descendent of Y.
Consider the following genealogical tree:
father(a,b).
father(a,c).
father(b,d).
father(b,e).
father(c,f).
Say which answers, and in which order, are generated by your definitions for the following queries
in Prolog:

?- brother(X,Y).
?- cousin(X,Y).
?- grandson(X,Y).
?- descendent(X,Y).
9. Write a program to solve Tower of Hanoi problem using Prolog.
10. Write a program to solve N-Queens problem using Prolog.
11. Write a program to solve 8 puzzle problem using Prolog.
12. Write a program to solve travelling salesman problem using Prolog.

List of Open Source Software/learning website:

https://nptel.ac.in/courses/106/105/106105077/
http://www.journals.elsevier.com/artificial-intelligence/

Page 3 of 3

w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Engineering
Subject Code: 3170726
Semester – VII
Subject Name: Mobile Application Development
Type of course: Elective

Prerequisite: Basic Knowledge of OOPS concept and Core java

Rationale: There is a growing number of people who uses smartphones and tablets and hence mobile app
development has ability to access a large segment. Android has an advantage of being open source. This
course will enable the students to develop mobile application using Android.
Teaching and Examination Scheme:

Teaching Scheme Credits Examination Marks Total

L T P C Theory Marks Practical Marks Marks
ESE (E) PA (M) ESE (V) PA (I)
2 0 2 3 70 30 30 20 150

Sr.
TOPICS
No. Hrs.
1 Pre Requirements (Basic Knowledge of OOPS concept and Core java) 1
2 Fundamental : Software Engineering with SDLC, Flow chart, DFD, SQL database 1

Android OS
Introduction to Android, Android System with Architecture, Android Architecture,
3 Development with Android – Platforms, Tools, Versions, Setup Android Environment, Say 2
Hello to Android Application, Building Blocks of Android Application, Work with Activity,
Activity Lifecycle, Intents Fragments, Fragment Lifecycle
Android UI And Component using Fragments
Create Android UI, Working with Layout, Create Custom Layouts, Work with UI
4 5
Components and Events, Material Design Toolbar, Tab Layout, Recycler View and Card
View, Android Menus
Database Connectivity
Storage in Android, Shared Preferences, Shared Preferences Layout, Android Requesting
5 5
Permission at run time (Android 6.0), Work with SD Card and Files, Database in Android,
Realm-No SQL Database
Applicability to Industrial Projects
6 Web services and Parsing, JSON Parsing, Access web data with JSON, Connect to Web 4
Services, Using Async Task & Third Party Library : Retrofit
Advanced Android Development
7 Google Map, Location Service and GPS, Creating Google Map, Work with Location, 5
Location service with Location Manager, Find Current Location, Geo coding

Page 1 of 3
w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Engineering
Subject Code: 3170726
Graphics and Animation, Work with 2D Graphics, Bitmap, Animation, Frame Animation,
Tween Animation, View Animation, Multimedia in Android, Play Audio Files, Play Video
Files
Work in Background, Services, Notification Services, Broadcast Receiver
Introduction to Firebase with simple CRUID Operation
Work with android system
Text to Speech, Camera, Taking Picture with Camera, Manage Bluetooth Connection,
Monitor and Manage Wi-Fi, Accelerometer Sensor & Gyroscope.
8 5
Development and Deployment
Delvik Debug Tool, Logcat, Emulator Control, Device Control, Work with ADB, Connect
Real Devices, Execute Application on Real Device, Publish your Application
Total 28

Suggested Specification table with Marks (Theory): (For BE only)

Distribution of Theory Marks

R Level U Level A Level N Level E Level C Level
10 30 60 - - -

Legends: R: Remembrance; U: Understanding; A: Application, N: Analyze and E: Evaluate C:

Create and above Levels (Revised Bloom’s Taxonomy)

Course Outcomes: Students will be able to

Sr. CO statement Marks %

No. weightage
CO-1 Understand Android architecture, activities and their life cycle. 10
CO-2 Apply the knowledge to design user interface using Android UI And Component 40
CO-3 Manage system database, remote database operations using web services and 20
Firebase
CO-4 Apply knowledge of map, location services, Graphics, android system and 25
background services
CO-5 Publish and distribute Android Application 05

Books:
1) Android Application Development Black Book by Pradeep Kothari, DreamTech
2) Beginning Android 4 Application Development by Wei Meng Lee, Wrox
3) Android Wireless Application Development By Lauren Darcey, Shane Conder, Pearson U

List of Open Source Software/learning website:

1. https://developer.android.com/
Page 2 of 3
w.e.f. AY 2018-19
 GUJARAT TECHNOLOGICAL UNIVERSITY
Bachelor of Engineering
Subject Code: 3170726

List of Practical:
Sr Practical
1 Design Login activity and implement control events : Use EditText, Checkbox and Buttons
Implement Practical 1 using following layouts:
1. Linear Layout
2. Relative Layout
2 3. Table Layout
Create Activities & implement following
1. Implicit intent
2. Explicit Intent
3 3. StartActivityForResult
4 Implement activity Lifecycle and State Callbacks
5 Practical : Use an Options Menu
Create a Recycler View and list the details of student using following fields:
1. Name
2. Address
3. Photo (Image)
6 4. Delete ( Button Operation)
7 Practical: Theme, Custom Styles, Drawables
8 Practical: Save user data in a database
9 Use an AsyncTask to access remote database (make a use of simple PhP Web service)
10 Use Retrofit to access remote database (make a use of simple PhP Web service)
11 Practical : Use Firebase to perform CRUID operation
12 Practical: BroadcastReceiver
13 Practical: Notifications
14 Practical: Get and Save User Preferences
15 Practical : make a use of android system
16 Using location service get the current location and display in TextView
17 Practical : Display the use of animations

Page 3 of 3
w.e.f. AY 2018-19