VERTICAL 1

ARTIFICIAL INTELLIGENCE

COURSE NAME: APP DEVELOPMENT L T P C

COURSE CODE: 191ITV11 2 0 2 3

COURSE OBJECTIVES:
● To learn development of native applications with basic GUI Components
● To develop cross-platform applications with event handling
● To develop applications with location and data storage capabilities
● To develop web applications with database access

UNIT I FUNDAMENTALS OF MOBILE & WEB APPLICATION DEVELOPMENT 6

Basics of Web and Mobile application development, Native App, Hybrid App, Cross-platform App, What is
Progressive Web App, Responsive Web design

UNIT II NATIVE APP DEVELOPMENT USING JAVA 6

Native Web App, Benefits of Native App, Scenarios to create Native App, Tools for creating Native App,
Cons of Native App, Popular Native App Development Frameworks, Java & Kotlin for Android, Swift &
Objective-C for iOS, Basics of React Native, Native Components, JSX, State,Props

UNIT III HYBRID APP DEVELOPMENT 6

Hybrid Web App, Benefits of Hybrid App, Criteria for creating Native App, Tools for creating Hybrid App,
Cons of Hybrid App, Popular Hybrid App Development Frameworks, Ionic, Apache Cordova

UNIT IV CROSS-PLATFORM APP DEVELOPMENT USING REACT-NATIVE 6

What is Cross-platform App, Benefits of Cross-platform App, Criteria for creating Cross-platform App,
Tools for creating Cross-platform App, Cons of Cross-platform App, Popular Cross Platform App
Development Frameworks, Flutter, Xamarin, React-Native, Basics of React Native, Native Components,
JSX, State, Props

UNIT V NON-FUNCTIONAL CHARACTERISTICS OF APP FRAMEWORKS 6

Comparison of different App frameworks, Build Performance, App Performance, Debugging
capabilities,Time to Market, Maintainability, Ease of Development, UI/UX, Reusability

30 PERIODS
COURSE OUTCOMES:
CO1: Develop Native applications with GUI Components.
CO2: Develop hybrid applications with basic event handling.
CO3: Implement cross-platform applications with location and data storage capabilities.
CO4: Implement cross platform applications with basic GUI and event handling.
CO5: Develop web applications with cloud database access.

PRACTICAL EXERCISES: 30 PERIODS

1. Using react native, build a cross platform application for a BMI calculator.
2. Build a cross platform application for a simple expense manager which allows entering expenses and
income on each day and displays category wise weekly income and expense.
3. Develop a cross platform application to convert units from imperial system to metric system (km to miles,
kg to pounds etc.,)
4. Design and develop a cross platform application for day to day task (to-do) management.
5. Design an android application using Cordova for a user login screen with username, password, reset button
and a submit button. Also, include header image and a label. Use layout
managers.
6. Design and develop an android application using Apache Cordova to find and display the current location
of the user.
7. Write programs using Java to create Android application having Databases
● For a simple library application.
● For displaying books available, books lend, book reservation. Assume that student information is
available in a database which has been stored in a database server.
TOTAL:60 PERIODS

TEXT BOOKS
1. Head First Android Development, Dawn Griffiths, O’Reilly, 1st edition
2. Apache Cordova in Action, Raymond K. Camden, Manning. 2015
3. Full Stack React Native: Create beautiful mobile apps with JavaScript and React Native, Anthony
Accomazzo, Houssein Djirdeh, Sophia Shoemaker, Devin Abbott, FullStack publishing

REFERENCES
1. Android Programming for Beginners, John Horton, Packt Publishing, 2nd Edition
2. Native Mobile Development by Shaun Lewis, Mike Dunn
3. Building Cross-Platform Mobile and Web Apps for Engineers and Scientists: An Active Learning
Approach, Pawan Lingras, Matt Triff, Rucha Lingras
4. Apache Cordova 4 Programming, John M Wargo, 2015
5. React Native Cookbook, Daniel Ward, Packt Publishing, 2nd Edition

COURSE NAME: BIO-INSPIRED OPTIMIZATION TECHNIQUES L T P C

COURSE CODE: 191ITV12 3 0 0 3

COURSE OBJECTIVES:
● To understand fundamental topics in bio-inspired optimization techniques
● To Learn the collective systems such as ACO, PSO, and BCO
● To develop skills in biologically inspired algorithm design with an emphasis on solving real world
problems
● To understand the most appropriate types of algorithms for different data analysis problems and to
introduce some of the most appropriate implementation strategies.
● To implement the Bio-inspired technique with other traditional algorithms.

UNIT I INTRODUCTION 9
Optimization Techniques: Introduction to Optimization Problems – Single and Muti- objective Optimization
– Classical Techniques – Overview of various Optimization methods – Evolutionary Computing: Genetic
Algorithm and Genetic Programming: Basic concept – encoding – representation – fitness function –
Reproduction – differences between GA and Traditional optimization methods – Applications – Bio- inspired
Computing (BIC): Motivation – Overview of BIC – usage of BIC – merits and demerits of BIC.

UNIT II SWARM INTELLIGENCE 9

Introduction – Biological foundations of Swarm Intelligence – Swarm Intelligence in Optimization – Ant
Colonies: Ant Foraging Behavior – Towards Artificial Ants – Ant Colony Optimization (ACO) – S-ACO –
Ant Colony Optimization Metaheuristic: Combinatorial Optimization – ACO Metaheuristic – Problem
solving using ACO – Other Metaheuristics – Simulated annealing – Tabu Search – Local search methods –
Scope of ACO algorithms

UNIT III NATURAL TO ARTIFICIAL SYSTEMS 9

Biological Nervous Systems – artificial neural networks – architecture – Learning Paradigms – unsupervised
learning – supervised learning – reinforcement learning – evolution of neural networks – hybrid neural
systems – Biological Inspirations in problem solving – Behavior of Social Insects: Foraging –Division of
Labor – Task Allocation – Cemetery Organization and Brood Sorting – Nest Building – Cooperative
transport.

UNIT IV SWARM ROBOTICS 9

Foraging for food – Clustering of objects – Collective Prey retrieval – Scope of Swarm Robotics – Social
Adaptation of Knowledge: Particle Swarm – Particle Swarm Optimization (PSO) – Particle 165 Swarms for
Dynamic Optimization Problems – Artificial Bee Colony (ABC) Optimization biologically inspired
algorithms in engineering.

UNIT V CASE STUDIES 9

Other Swarm Intelligence algorithms: Fish Swarm – Bacteria foraging – Intelligent Water Drop Algorithms –
Applications of biologically inspired algorithms in engineering. Case Studies: ACO and PSO for NP-hard
problems – Routing problems – Assignment problems – Scheduling problems – Subset problems – Machine
Learning Problems – Traveling Salesman problem.

TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Familiarity with the basics of several biologically inspired optimization techniques.
CO2: Familiarity with the basics of several biologically inspired computing paradigms.
CO3: Ability to select an appropriate bio-inspired computing method and implement it for any application
and data set.
CO4: Theoretical understanding of the differences between the major bio-inspired computing methods.
CO5: Learn Other Swarm Intelligence algorithms and implement the Bio-inspired technique with other
traditional algorithms.

TEXT BOOK
1. A. E. Elben and J. E. Smith, “Introduction to Evolutionary Computing”, Springer, 2010.
2.Floreano D. and Mattiussi C., "Bio-Inspired Artificial Intelligence: Theories, Methods, and Technologies",
MIT Press, Cambridge, MA, 2008.
3. Leandro Nunes de Castro, " Fundamentals of Natural Computing, Basic Concepts, Algorithms and
Applications", Chapman & Hall/ CRC, Taylor and Francis Group, 2007

REFERENCES
1. Eric Bonabeau, Marco Dorigo, Guy Theraulaz, “Swarm Intelligence: From Natural to Artificial Systems”,
Oxford University press, 2000.
2. Christian Blum, Daniel Merkle (Eds.), “Swarm Intelligence: Introduction and Applications”, Springer
Verlag, 2008.
3. Leandro N De Castro, Fernando J Von Zuben, “Recent Developments in Biologically Inspired
Computing'', Idea Group Inc., 2005.
4. Albert Y.Zomaya, "Handbook of Nature-Inspired and Innovative Computing", Springer, 2006.
5. C. Eberhart et al., “Swarm Intelligence'', Morgan Kaufmann, 2001.

COURSE NAME: COGNITIVE SCIENCE L T P C

COURSE CODE: 191ITV14 2 0 2 3

COURSE OBJECTIVES:
● To know the theoretical background of cognition.
● To understand the link between cognition and computational intelligence.
● To explore probabilistic programming language.
● To study the computational inference models of cognition.
● To study the computational learning models of cognition.

UNIT I PHILOSOPHY, PSYCHOLOGY AND NEUROSCIENCE 6

Philosophy: Mental-physical Relation – From Materialism to Mental Science – Logic and the Sciences of the
Mind – Psychology: Place of Psychology within Cognitive Science – Science of Information Processing –
Cognitive Neuroscience – Perception – Decision – Learning and Memory – Language Understanding and
Processing.

UNIT II COMPUTATIONAL INTELLIGENCE 6

Machines and Cognition – Artificial Intelligence – Architectures of Cognition – Knowledge Based Systems –
Logical Representation and Reasoning – Logical Decision Making –Learning – Language – Vision.

UNIT III PROBABILISTIC PROGRAMMING LANGUAGE 6

WebPPL Language – Syntax – Using Javascript Libraries – Manipulating probability types and distributions –
Finding Inference – Exploring random computation – Coroutines: Functions that receive continuations –
Enumeration

UNIT IV INFERENCE MODELS OF COGNITION 6

Generative Models – Conditioning – Causal and statistical dependence – Conditional dependence – Data
Analysis – Algorithms for Inference.

UNIT V LEARNING MODELS OF COGNITION 6

Learning as Conditional Inference – Learning with a Language of Thought – Hierarchical Models– Learning
(Deep) Continuous Functions – Mixture Models.
30 PERIODS

PRACTICAL EXERCISES :
1. Demonstration of Mathematical functions using WebPPL.
2. Implementation of reasoning algorithms.
3. Developing an Application system using generative model.
4. Developing an Application using conditional inference learning model.
5. Application development using hierarchical model. 6. Application development using Mixture model.
30 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1:Understand the underlying theory behind cognition.
CO2:Connect to the cognition elements computationally.
CO3:Implement mathematical functions through WebPPL.
CO4:Develop applications using cognitive inference models.
CO5:Develop applications using cognitive learning models.
TOTAL: 60 PERIODS
TEXT BOOK:
1. Vijay V Raghavan,Venkat N.Gudivada, VenuGovindaraju, C.R. Rao, Cognitive Computing: Theory and
Applications: (Handbook of Statistics 35), Elsevier publications, 2016
2. Judith Hurwitz, Marcia Kaufman, Adrian Bowles, Cognitive Computing and Big Data Analytics, Wiley
Publications, 2015
3. Robert A. Wilson, Frank C. Keil, “The MIT Encyclopedia of the Cognitive Sciences”,The MIT Press,
1999.
4. Jose Luis Bermúdez, Cognitive Science -An Introduction to the Science of the Mind, Cambridge
University Press 2020

REFERENCES:
1. Noah D. Goodman, Andreas Stuhlmuller, “The Design and Implementation of Probabilistic Programming
Languages”, Electronic version of book, https://dippl.org/.
2. Noah D. Goodman, Joshua B. Tenenbaum, The ProbMods Contributors, “Probabilistic Models of
Cognition”, Second Edition, 2016, https://probmods.org/.

COURSE NAME: ETHICS AND AI L T P C

COURSE CODE: 191ITV16 2 0 2 3

COURSE OBJECTIVES:
● Study the morality and ethics in AI
● Learn about the Ethical initiatives in the field of artificial intelligence
● Study about AI standards and Regulations
● Study about social and ethical issues of Robot Ethics
● Study about AI and Ethics- challenges and opportunities

UNIT I INTRODUCTION 6
Definition of morality and ethics in AI-Impact on society-Impact on human psychology-Impact on the legal
system-Impact on the environment and the planet-Impact on trust

UNIT II ETHICAL INITIATIVES IN AI 6

International ethical initiatives-Ethical harms and concerns-Case study: healthcare robots, Autonomous
Vehicles, Warfare and weaponization.

UNIT III AI STANDARDS AND REGULATION 6

Model Process for Addressing Ethical Concerns During System Design - Transparency of Autonomous
Systems-Data Privacy Process- Algorithmic Bias Considerations - Ontological Standard for Ethically Driven
Robotics and Automation Systems

UNIT IV ROBOETHICS:SOCIAL AND ETHICAL IMPLICATION OF ROBOTICS 6 Robot-

Roboethics- Ethics and Morality- Moral Theories-Ethics in Science and Technology - Ethical Issues in an
ICT Society- Harmonization of Principles- Ethics and Professional ResponsibilityRoboethics Taxonomy.

UNIT V AI AND ETHICS- CHALLENGES AND OPPORTUNITIES 6

Challenges - Opportunities- ethical issues in artificial intelligence- Societal Issues Concerning the
Application of Artificial Intelligence in Medicine- decision-making role in industries-National and
International Strategies on AI.
30 PERIODS

PRACTICAL EXERCISES:
1. Recent case study of ethical initiatives in healthcare, autonomous vehicles and defense
2. Exploratory data analysis on a 2 variable linear regression model
3. Experiment the regression model without a bias and with bias
4. Classification of a dataset from UCI repository using a perceptron with and without bias
5. Case study on ontology where ethics is at stake
6. Identification on optimization in AI affecting ethics
30 PERIODS
TOTAL: 60 PERIODS
COURSE OUTCOMES:
On completion of the course, the students will be able to
CO1: Learn about morality and ethics in AI
CO2: Acquire the knowledge of real time application ethics, issues and its challenges.
CO3: Understand the ethical harms and ethical initiatives in AI
CO4: Learn about AI standards and Regulations like AI Agent, Safe Design of Autonomous and Semi-
Autonomous Systems
CO5: Understand the concepts of Roboethics and Morality with professional responsibilities.
CO6: Learn about the societal issues in AI with National and International Strategies on AI

TEXT BOOKS:
1. y. Eleanor Bird, Jasmin Fox-Skelly, Nicola Jenner, Ruth Larbey, Emma Weitkamp and Alan
Winfield,”The ethics of artificial intelligence: Issues and initiatives”, EPRS | European Parliamentary
Research Service Scientific Foresight Unit (STOA) PE 634.452 – March 2020
2. Patrick Lin, Keith Abney, George A Bekey,” Robot Ethics: The Ethical and Social Implications of
Robotics”, The MIT Press- January 2014
.
REFERENCES:
1. Towards a Code of Ethics for Artificial Intelligence (Artificial Intelligence: Foundations, Theory, and
Algorithms) by Paula Boddington, November 2017 2. Mark Coeckelbergh,” AI Ethics”, The MIT Press
Essential Knowledge series, April 2020

WEB LINK:
1. https://sci-hub.mksa.top/10.1007/978-3-540-30301-5_65
2. https://www.scu.edu/ethics/all-about-ethics/artificial-intelligence-and-ethics-sixteenchallenges-and-
opportunities/
3. https://www.weforum.org/agenda/2016/10/top-10-ethical-issues-in-artificial-intelligence/
4. https://sci-hub.mksa.top/10.1159/000492428

COURSE NAME: KNOWLEDGE ENGINEERING L T P C

COURSE CODE: 191ITV17 2 0 2 3

COURSE OBJECTIVES:
● To understand the basics of Knowledge Engineering.
● To discuss methodologies and modeling for Agent Design and Development.
● To design and develop ontologies.
● To apply reasoning with ontologies and rules.
● To understand learning and rule learning

UNIT I REASONING UNDER UNCERTAINTY 6

Introduction – Abductive reasoning – Probabilistic reasoning: Enumerative Probabilities – Subjective
Bayesian view – Belief Functions – Baconian Probability – Fuzzy Probability – Uncertainty methods -
Evidence-based reasoning – Intelligent Agent – Mixed-Initiative Reasoning – Knowledge Engineering.

UNIT II METHODOLOGY AND MODELING 6

Conventional Design and Development – Development tools and Reusable Ontologies – Agent Design and
Development using Learning Technology – Problem Solving through Analysis and Synthesis – Inquiry-
driven Analysis and Synthesis – Evidence-based Assessment – Believability Assessment – Drill- Down
Analysis, Assumption-based Reasoning, and What-If Scenarios.

UNIT III ONTOLOGIES – DESIGN AND DEVELOPMENT 6

Concepts and Instances – Generalization Hierarchies – Object Features – Defining Features – Representation
– Transitivity – Inheritance – Concepts as Feature Values – Ontology Matching. Design and Development
Methodologies – Steps in Ontology Development – Domain Understanding and ConceptElicitation –
Modeling-based Ontology Specification.

UNIT IV REASONING WITH ONTOLOGIES AND RULES 6

Production System Architecture – Complex Ontology-based Concepts – Reduction and Synthesis rules and
the Inference Engine – Evidence-based hypothesis analysis – Rule and Ontology Matching – Partially
Learned Knowledge – Reasoning with Partially Learned Knowledge.

UNIT V LEARNING AND RULE LEARNING 6

Machine Learning – Concepts – Generalization and Specialization Rules –Types – Formal definition of
Generalization. Modeling, Learning and Problem Solving – Rule learning and Refinement – Overview –
Rule Generation and Analysis – Hypothesis Learning.

30 PERIODS

PRACTICAL EXERCISES: 30 PERIODS

1. Perform operations with Evidence Based Reasoning.
2. Perform Evidence based Analysis.
3. Perform operations on Probability Based Reasoning.
4. Perform Believability Analysis.
5. Implement Rule Learning and refinement.
6. Perform analysis based on learned patterns.
7. Construction of Ontology for a given domain. TOTAL: 60 PERIODS

COURSE OUTCOMES:
At the end of the semester the students can be able to:
CO1 Understand the basics of Knowledge Engineering.
CO2 Apply methodologies and modeling for Agent Design and Development.
CO3 Design and develop ontologies.
CO4 Apply reasoning with ontologies and rules.
CO5 Understand learning and rule learning.

TEXT BOOK:
1. Gheorghe Tecuci, Dorin Marcu, Mihai Boicu, David A. Schum, Knowledge Engineering Building
Cognitive Assistants for Evidence-based Reasoning, Cambridge University Press, First Edition, 2016. (Unit
1 – Chapter 1 / Unit 2 – Chapter 3,4 / Unit 3 – Chapter 5, 6 / Unit 4 - 7 , Unit 5 – Chapter 8,

REFERENCES:
1. Ronald J. Brachman, Hector J. Levesque: Knowledge Representation and Reasoning, Morgan Kaufmann,
2004.
2. Ela Kumar, Knowledge Engineering, I K International Publisher House, 2018.
3. John F. Sowa: Knowledge Representation: Logical, Philosophical, and Computational Foundations,
Brooks/Cole, Thomson Learning, 2000.
4. King , Knowledge Management and Organizational Learning , Springer, 2009.
5. Jay Liebowitz, Knowledge Management Learning from Knowledge Engineering, 1st Edition,2001.

COURSE NAME: SOFT COMPUTING L T P C

COURSE CODE: 191ITV18 2 0 2 3

COURSE OBJECTIVES:
● To introduce the ideas of fuzzy sets, fuzzy logic and the use of heuristics based on human experience.
● To provide the mathematical background for carrying out the optimization associated with neural
network learning
● To learn various evolutionary Algorithms.
● To become familiar with neural networks that can learn from available examples and generalize to
form appropriate rules for inference systems.
● To introduce case studies utilizing the above and illustrate the Intelligent behavior of programs based
on soft computing

UNIT 1 INTRODUCTION TO SOFT COMPUTING AND FUZZY LOGIC 6

Introduction - Fuzzy Logic - Fuzzy Sets, Fuzzy Membership Functions, Operations on Fuzzy Sets, Fuzzy
Relations, Operations on Fuzzy Relations, Fuzzy Rules and Fuzzy Reasoning, Fuzzy Inference Systems

UNIT II NEURAL NETWORKS 6

Supervised Learning Neural Networks – Perceptrons - Back Propagation -Multilayer Perceptrons –
Unsupervised Learning Neural Networks – Kohonen Self-Organizing Networks

UNIT III GENETIC ALGORITHMS 6

Chromosome Encoding Schemes -Population initialization and selection methods - Evaluation function -
Genetic operators- Crossover – Mutation - Fitness Function – Maximizing function

UNIT IV NEURO FUZZY MODELING 6

ANFIS architecture – hybrid learning – ANFIS as universal approximator – Coactive Neuro fuzzy modeling –
Framework – Neuron functions for adaptive networks – Neuro fuzzy spectrum - Analysis of Adaptive
Learning Capability

UNIT V APPLICATIONS 6
Modeling a two input sine function - Printed Character Recognition – Fuzzy filtered neural networks – Plasma
Spectrum Analysis – Hand written neural recognition - Soft Computing for Color Recipe Prediction.

30 PERIODS

COURSE OUTCOMES:
CO1: Understand the fundamentals of fuzzy logic operators and inference mechanisms
CO2: Understand neural network architecture for AI applications such as classification and clustering
CO3: Learn the functionality of Genetic Algorithms in Optimization problems
CO4: Use hybrid techniques involving Neural networks and Fuzzy logic
CO5: Apply soft computing techniques in real world applications

PRACTICAL EXERCISES 30 PERIODS

1. Implementation of fuzzy control/ inference system
2. Programming exercise on classification with a discrete perceptron
3. Implementation of XOR with backpropagation algorithm
4. Implementation of self organizing maps for a specific application
5. Programming exercises on maximizing a function using Genetic algorithm
6. Implementation of two input sine function
7. Implementation of three input nonlinear function
TOTAL: 60 PERIODS
TEXT BOOKS:
1. SaJANG, J.-S. R., SUN, C.-T., & MIZUTANI, E. (1997). Neuro-fuzzy and soft computing:A
computational approach to learning and machine intelligence. Upper Saddle River, NJ, Prentice Hall,1997
2. Himanshu Singh, Yunis Ahmad Lone, Deep Neuro-Fuzzy Systems with Python
3. With Case Studies and Applications from the Industry, Apress, 2020

REFERENCES
1. roj Kaushik and Sunita Tiwari, Soft Computing-Fundamentals Techniques andApplications, 1st Edition,
McGraw Hill, 2018.
2. S. Rajasekaran and G.A.V.Pai, “Neural Networks, Fuzzy Logic and Genetic Algorithms”,PHI, 2003.
3. Samir Roy, Udit Chakraborthy, Introduction to Soft Computing, Neuro Fuzzy and Genetic Algorithms,
Pearson Education, 2013.
4. S.N. Sivanandam, S.N. Deepa, Principles of Soft Computing, Third Edition, Wiley India Pvt Ltd, 2019.
5. R.Eberhart, P.Simpson and R.Dobbins, “Computational Intelligence - PC Tools”, AP Professional, Boston,
1999
OPTIMIZATION TECHNIQUES LTPC
2023
COURSE OBJECTIVES:
The objective of this course is to enable the student to
• Formulate and solve linear programming problems (LPP)
• Evaluate Integer Programming Problems, Transportation and Assignment Problems.
• Obtain a solution to network problems using CPM and PERT techniques.
• Able to optimize the function subject to the constraints.
• Identify and solve problems under Markovian queuing models.

UNIT I LINEAR MODELS 6

Introduction of Operations Research - mathematical formulation of LPP- Graphical Methods to solve LPP-
Simplex Method- Two-Phase method
UNIT II INTEGER PROGRAMMING AND TRANSPORTATION PROBLEMS 6
Integer programming: Branch and bound method- Transportation and Assignment problems - Traveling
salesman problem.
UNIT III PROJECT SCHEDULING 6
Project network -Diagram representation – Floats - Critical path method (CPM) – PERT- Cost considerations
in PERT and CPM
UNIT IV CLASSICAL OPTIMIZATION THEORY 6
Unconstrained problems – necessary and sufficient conditions - Newton-Raphson method, Constrained
problems – equality constraints – inequality constraints - Kuhn-Tucker conditions.
UNIT V QUEUING MODELS 6
Introduction, Queuing Theory, Operating characteristics of a Queuing system, Constituents of a Queuing
system, Service facility, Queue discipline, Single channel models, multiple service channels.
30 PERIODS

PRACTICALS
1. Solving simplex maximization problems using R programming.
2. Solving simplex minimization problems using R programming.
3. Solving mixed constraints problems – Big M & Two phase method using TORA.
4. Solving transportation problems using R.
5. Solving assignment problems using R.
6. Solving optimization problems using LINGO.
7. Studying Primal-Dual relationships in LP using TORA.
8. Solving LP problems using dual simplex method using TORA.
9. Sensitivity & post optimality analysis using LINGO.
10. Solving shortest route problems using optimization software
11. Solving Project Management problems using optimization software
12. Testing random numbers and random variates for their uniformity.
13. Testing random numbers and random variates for their independence
14. Solve single server queuing model using simulation software package.
15. Solve multi server queuing model using simulation software package.
30 PERIODS

COURSE OUTCOMES:
On successful completion of this course, the student will able to
CO1:Formulate and solve linear programming problems (LPP)
CO2:Evaluate Integer Programming Problems, Transportation and Assignment Problems.
CO3:Obtain a solution to network problems using CPM and PERT techniques.
CO4:Able to optimize the function subject to the constraints.
CO5:Identify and solve problems under Markovian queuing models
TOTAL: 60 PERIODS

TEXT BOOK:
1. Hamdy A Taha, Operations Research: An Introduction, Pearson, 10th Edition, 2017.

REFERENCES:
1. ND Vohra, Quantitative Techniques in Management, Tata McGraw Hill, 4th Edition, 2011.
2. J. K. Sharma, Operations Research Theory and Applications, Macmillan, 5th Edition, 2012.
3. Hiller F.S, Liberman G.J, Introduction to Operations Research, 10th Edition McGraw Hill, 2017.
4. Jit. S. Chandran, Mahendran P. Kawatra, KiHoKim, Essentials of Linear Programming, Vikas Publishing
House Pvt.Ltd. New Delhi, 1994.
5. Ravindran A., Philip D.T., and Solberg J.J., Operations Research, John Wiley, 2nd Edition, 2007.
GAME THEORY LTPC
2023
COURSE OBJECTIVES:
• To introduce the student to the notion of a game, its solutions concepts, and other basic notions and tools of
game theory, and the main applications for which they are appropriate, including electronic trading markets.
• To formalize the notion of strategic thinking and rational choice by using the tools of game theory, and to
provide insights into using game theory in 41odeIIing applications.
• To draw the connections between game theory, computer science, and economics, especially emphasizing
the computational issues.
• To introduce contemporary topics in the intersection of game theory, computer science, and economics.
• To apply game theory in searching, auctioning and trading.

UNIT I INTRODUCTION 6
Introduction — Making rational choices: basics of Games — strategy — preferences — payoffs —
Mathematical basics — Game theory — Rational Choice — Basic solution concepts-non-cooperative versus
cooperative games — Basic computational issues — finding equilibria and learning in games- Typical
application areas for game theory (e.g. Google's sponsored search, eBay auctions, electricity trading
markets).
UNIT II GAMES WITH PERFECT INFORMATION 6
Games with Perfect Information — Strategic games — prisoner's dilemma, matching pennies - Nash
equilibria —mixed strategy equilibrium — zero-sum games
UNIT III GAMES WITH IMPERFECT INFORMATION 6
Games with Imperfect Information — Bayesian Games — Motivational Examples — General Definitions
— Information aspects — Illustrations — Extensive Games with Imperfect — Information — Strategies —
Nash Equilibrium —Repeated Games — The Prisoner's Dilemma — Bargaining
UNIT IV NON-COOPERATIVE GAME THEORY 6
Non-cooperative Game Theory — Self-interested agents — Games in normal form — Analyzing games:
from optimality to equilibrium — Computing Solution Concepts of Normal — Form Games
— Computing Nash equilibria of two-player, zero-sum games —Computing Nash equilibria of two-player,
general- sum games — Identifying dominated strategies
UNIT V MECHANISM DESIGN 6
Aggregating Preferences — Social Choice — Formal Model — Voting — Existence of social functions —
Ranking systems — Protocols for Strategic Agents: Mechanism Design — Mechanism design with
unrestricted preferences
30 PERIODS

COURSE OUTCOMES:
Upon Completion of the course, the students will be able to
CO1:Discuss the notion of a strategic game and equilibria and identify the characteristics of main
applications of these concepts.
CO2:Discuss the use of Nash Equilibrium for other problems.
CO3:Identify key strategic aspects and based on these be able to connect them to appropriate game theoretic
concepts given a real world situation.
CO4:Identify some applications that need aspects of Bayesian Games.
CO5:Implement a typical Virtual Business scenario using Game theory.
Laboratory Exercises:
● Prisoner’s dilemma
● Pure Strategy Nash Equilibrium
● Extensive Form – Graphs and Trees, Game Trees
● Strategic Form – Elimination of dominant strategy
● Minimax theorem, minimax strategies
● Perfect information games: trees, players assigned to nodes, payoffs, backward Induction, subgame perfect
equilibrium,
● imperfect-information games - Mixed Strategy Nash Equilibrium - Finding mixed-strategy Nash equilibria
for zero sum games, mixed versus behavioral strategies.
● Repeated Games
● Bayesian Nash equilibrium
30 PERIODS
TOTAL: 60 PERIODS

TEXT BOOKS / REFERENCES:

1. M. J. Osborne, An Introduction to Game Theory. Oxford University Press, 2012.
2. M. Machler, E. Solan, S. Zamir, Game Theory, Cambridge University Press, 2013.
3. N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani, Algorithmic Game Theory. Cambridge
University Press, 2007.
4. A.Dixit and S. Skeath, Games of Strategy, Second Edition. W W Norton & Co Inc, 2004.
5. YoavShoham, Kevin Leyton-Brown, Multiagent Systems: Algorithmic, Game-Theoretic, and Logical
Foundations, Cambridge University Press 2008.
6. Zhu Han, DusitNiyato, WalidSaad, TamerBasar and Are Hjorungnes, “Game Theory in Wireless and
Communication Networks”, Cambridge University Press, 2012.
7. Y.Narahari, “Game Theory and Mechanism Design”, IISC Press, World Scientific.
8. William Spaniel, “Game Theory 101: The Complete Textbook”, CreateSpace Independent Publishing,
2011.