«VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELGAUM III SEMESTER ENGINEERING MATHEMATICS – III CODE: 10 MAT 31 IA Marks: 25 Hrs/Week: 04 Exam Hrs: 03 ...»
UNIT – 6 6 Hours Interfaces and Collections: Defining Interfaces Using C# Invoking Interface Members at the object Level, Exercising the Shapes Hierarchy, Understanding Explicit Interface Implementation, Interfaces As Polymorphic Agents, Building Interface Hierarchies, Implementing, Implementation, Interfaces Using VS.NET, understanding the IConvertible Interface, Building a Custom Enumerator (IEnumerable and Enumerator), Building Cloneable objects (ICloneable), Building Comparable Objects ( I Comparable ), Exploring the system. Collections Namespace, Building a Custom Container (Retrofitting the Cars Type).
UNIT – 7 8 Hours
Callback Interfaces, Delegates, and Events, Advanced Techniques:
Understanding Callback Interfaces, Understanding the.NET Delegate Type, Members of System. Multicast Delegate, The Simplest Possible Delegate Example, Building More a Elaborate Delegate Example, Understanding Asynchronous Delegates, Understanding (and Using)Events.
The Advances Keywords of C#, A Catalog of C# Keywords Building a Custom Indexer, A Variation of the Cars Indexer Internal Representation of Type Indexer. Using C# Indexer from VB.NET. Overloading operators, The Internal Representation of Overloading Operators, interacting with Overload Operator from Overloaded- Operator- Challenged Languages, Creating Custom Conversion Routines, Defining Implicit Conversion Routines, The Internal Representations of Customs Conversion Routines UNIT – 8 6 Hours Understanding.NET Assembles: Problems with Classic COM Binaries, An Overview of.NET Assembly, Building a Simple File Test Assembly, A C#.
Client Application, A Visual Basic.NET Client Application, Cross Language Inheritance, Exploring the CarLibrary’s, Manifest, Exploring the CarLibrary’s Types, Building the Multifile Assembly, Using Assembly, Understanding Private Assemblies, Probing for Private Assemblies (The Basics), Private A Assemblies XML Configurations Files, Probing for Private Assemblies ( The Details), Understanding Shared Assembly, Understanding Shared Names, Building a Shared Assembly, Understanding Delay Signing, Installing/Removing Shared Assembly, Using a Shared Assembly
1. Andrew Troelsen: Pro C# with.NET 3.0, 4th Edition, Wiley India, 2009.
Chapters: 1 to 11 (up to pp.369)
2. E. Balagurusamy: Programming in C#, 2nd Edition, Tata McGraw Hill, 2008.
(Programming Examples 3.7, 3.10, 5.5, 6.1, 7.2, 7.4, 7.5, 7.6, 8.1, 8.2, 8.3, 8.5, 8.7, 8.8, 9.1, 9.2, 9.3, 9.4, 10.2, 10.4, 11.2, 11.4, 12.1, 12.4, 12.5, 12.6, 13.1, 13.2, 13.3, 13.6, 14.1, 14.2, 14.4, 15.2, 15.3, 16.1, 16.2, 16.3, 18.3, 126.96.36.199)
1. Tom Archer: Inside C#, WP Publishers, 2001.
2. Herbert Schildt: C# The Complete Reference, Tata McGraw Hill, 2004.
PART – B UNIT – 5 7 Hours
Image Enhancement: Image enhancement in the spatial domain:
Background, Some basic gray level transformations, Histogram processing, Enhancement using arithmetic/ logic operations, Basics of spatial filtering, Smoothing spatial filters, Sharpening spatial filters. Image enhancement in the frequency domain: Background, Introduction to the Fourier transform and the frequency domain, Smoothing Frequency-Domain filters, Sharpening Frequency Domain filters, Homomorphic filtering.
1. Milan Sonka, Vaclav Hlavac and Roger Boyle: Image Processing, Analysis and Machine Vision, 2nd Edition, Thomoson Learning, 2001.
(Chapters 2, 4.1 to 4.3, 5.1 to 5.4, 6, 11.1 to 11.4, 11.7)
2. Rafel C Gonzalez and Richard E Woods: Digital Image Processing, 3rd Edition, Pearson Education, 2003.
(Chapters 3.1 to 3.7, 4.1 to 4.5, 8.1 to 8.5)
1. Anil K Jain, “Fundamentals of Digital Image Processing”, PHI, 1997, Indian Reprint 2009.
2. B.Chanda, D Dutta Majumder, “Digital Image Processing and Analysis”, PHI, 2002.
UNIT – 1 8 Hours Introduction, Strategic Games: What is game theory? The theory of rational choice; Interacting decision makers.
Strategic games; Examples: The prisoner’s dilemma, Bach or Stravinsky,
Matching pennies; Nash equilibrium; Examples of Nash equilibrium; Bestresponse functions; Dominated actions; Equilibrium in a single population:
symmetric games and symmetric equilibria.
UNIT – 2 6 Hours Mixed Strategy Equilibrium: Introduction; Strategic games in which players may randomize; Mixed strategy Nash equilibrium; Dominated actions; Pure equilibria when randomization is allowed, Illustration: Expert Diagnosis;
Equilibrium in a single population, Illustration: Reporting a crime; The formation of players’ beliefs; Extensions; Representing preferences by expected payoffs.
UNIT – 3 6 Hours Extensive Games: Extensive games with perfect information; Strategies and outcomes; Nash equilibrium; Subgame perfect equilibrium; Finding subgame
perfect equilibria of finite horizon games: Backward induction. Illustrations:
The ultimatum game, Stackelberg’s model of duopoly, Buying votes.
UNIT – 4 6 Hours Extensive games: Extensions and Discussions: Extensions: Allowing for simultaneous moves, Illustrations: Entry in to a monopolized industry, Electoral competition with strategic voters, Committee decision making, Exit
from a declining industry; Allowing for exogenous uncertainty, Discussion:
subgame perfect equilibrium and backward induction.
PART – B
UNIT – 5 7 Hours
Bayesian Games, Extensive Games with Imperfect Information:
Motivational examples; General definitions; Two examples concerning information; Illustrations: Cournot’s duopoly game with imperfect information, Providing a public good, Auctions; Auctions with an arbitrary distribution of valuations.
Extensive games with imperfect information; Strategies; Nash equilibrium;
Beliefs and sequential equilibrium; Signaling games; Illustration: Strategic information transmission.
UNIT – 6 7 Hours Strictly Competitive Games, Evolutionary Equilibrium: Strictly competitive games and maximization; Maximization and Nash equilibrium;
Strictly competitive games; Maximization and Nash equilibrium in strictly competitive games.
Evolutionary Equilibrium: Monomorphic pure strategy equilibrium; Mixed strategies and polymorphic equilibrium; Asymmetric contests; Variations on themes: Sibling behavior, Nesting behavior of wasps, The evolution of sex ratio.
UNIT – 7 6 Hours Iterated Games: Repeated games: The main idea; Preferences; Repeated games; Finitely and infinitely repeated Prisoner’s dilemma; Strategies in an infinitely repeated Prisoner’s dilemma; Some Nash equilibria of an infinitely repeated Prisoner’s dilemma, Nash equilibrium payoffs of an infinitely repeated Prisoner’s dilemma.
UNIT – 8 6 Hours Coalitional Games and Bargaining: Coalitional games. The Core.
Illustrations: Ownership and distribution of wealth, Exchanging homogeneous items, Exchanging heterogeneous items, Voting, Matching. Bargaining as an extensive game; Illustration of trade in a market; Nash's axiomatic model of bargaining
1. Martin Osborne: An Introduction to Game Theory, Oxford University Press, Indian Edition, 2004.
(Listed topics only from Chapters 1 to 11, 13, 14, 16)
1. Roger B. Myerson: Game Theory: Analysis of Conflict, Harvard University Press, 1997.
2. Andreu Mas-Colell, Michael D. Whinston, and Jerry R. Green:
Microeconomic Theory. Oxford University Press, New York, 1995.
3. Philip D. Straffin, Jr.: Game Theory and Strategy, The Mathematical Association of America, January 1993.
UNIT – 1 7 Hours Introduction: What is AI? Intelligent Agents: Agents and environment;
Rationality; the nature of environment; the structure of agents. Problemsolving: Problem-solving agents; Example problems; Searching for solution;
Uninformed search strategies.
UNIT – 2 7 Hours
Informed Search, Exploration, Constraint Satisfaction, Adversial Search:
Informed search strategies; Heuristic functions; On-line search agents and unknown environment. Constraint satisfaction problems; Backtracking search for CSPs. Adversial search: Games; Optimal decisions in games; Alpha-Beta pruning.
UNIT – 4 6 Hours First-Order Logic, Inference in First-Order Logic – 1: Representation revisited; Syntax and semantics of first-order logic; Using first-order logic;
Knowledge engineering in first-order logic. Propositional versus first-order inference; Unification and lifting
UNIT – 6 7 Hours Knowledge Representation: Ontological engineering; Categories and objects; Actions, situations, and events; Mental events and mental objects;
The Internet shopping world; Reasoning systems for categories; Reasoning with default information; Truth maintenance systems.
UNIT – 7 7 Hours Planning, Uncertainty, Probabilistic Reasoning: Planning: The problem;
Planning with state-space approach; Planning graphs; Planning with propositional logic.
Uncertainty: Acting under certainty; Inference using full joint distributions;
Independence; Bayes’ rule and its use.
Probabilistic Reasoning: Representing knowledge in an uncertain domain;
The semantics of Bayesian networks; Efficient representation of conditional distributions; Exact inference in Bayesian networks.
UNIT – 8 6 Hours Learning, AI: Present and Future: Learning: Forms of Learning; Inductive learning; Learning decision trees; Ensemble learning; Computational learning theory.
AI: Present and Future: Agent components; Agent architectures; Are we going in the right direction? What if AI does succeed?
1. Stuart Russel, Peter Norvig: Artificial Intelligence A Modern Approach, 2nd Edition, Pearson Education, 2003.
( Chapters 1.1, 2, 3.1 to 3.4, 4.1, 4.2, 4.5, 5.1, 5.2, 6.1, 6.2, 6.3, 7, 8, 9, 10, 11.1, 11.2, 11.4, 11.5, 13.1, 13.4, 13.5, 13.6, 14.1, 14.2, 14.3, 14.4, 18, 27)
1. Elaine Rich, Kevin Knight: Artificial Intelligence, 3rd Edition, Tata McGraw Hill, 2009.
2. Nils J. Nilsson: Principles of Artificial Intelligence, Elsevier, 1980.
UNIT - 1 7 Hours Introduction to Information Storage and Management, Storage System Environment: Information Storage, Evolution of Storage Technology and Architecture, Data Center Infrastructure, Key Challenges in Managing Information, Information Lifecycle Components of Storage System Environment, Disk Drive Components, Disk Drive Performance, Fundamental Laws Governing Disk Performance, Logical Components of the Host, Application Requirements and Disk Performance.
UNIT - 2 6 Hours Data Protection, Intelligent Storage system: Implementation of RAID, RAID Array Components, RAID Levels, RAID Comparison, RAID Impact on Disk Performance, Hot Spares Components of an Intelligent Storage System, Intelligent Storage Array UNIT - 3 7 Hours Direct-Attached Storage, SCSI, and Storage Area Networks: Types of DAS, DAS Benefits and Limitations, Disk Drive Interfaces, Introduction to Parallel SCSI, Overview of Fibre Channel, The SAN and Its Evolution, Components of SAN, FC Connectivity, Fibre Channel Ports, Fibre Channel Architecture, Zoning, Fibre Channel Login Types, FC Topologies.
UNIT - 4 6 Hours NAS, IP SAN: General – Purpose Service vs. NAS Devices, Benefits of NAS, NAS File I / O, Components of NAS, NAS Implementations, NAS File-Sharing Protocols, NAS I/O Operations, Factors Affecting NAS Performance and Availability. iSCSI, FCIP.
PART - B UNIT - 5 6 Hours Content-Addressed Storage, Storage Virtualization: Fixed Content and Archives, Types of Archive, Features and Benefits of CAS, CAS Architecture, Object Storage and Retrieval in CAS, CAS Examples Forms of Virtualization, SNIA Storage Virtualization Taxonomy, Storage Virtualizations Configurations, Storage Virtualization Challenges, Types of Storage Virtualization UNIT - 6 6 Hours Business Continuity, Backup and Recovery: Information Availability, BC Terminology, BC Planning Lifecycle, Failure Analysis, Business Impact Analysis, BC Technology Solutions.
Backup Purpose, Backup Considerations, Backup Granularity, Recovery Considerations, Backup Methods, Backup Process, Backup and restore Operations, Backup Topologies, Backup in NAS Environments, Backup Technologies.
UNIT - 7 7 Hours Local Replication, Remote Replication: Source and Target, Uses of Local Replicas, Data Consistency, Local Replication Technologies, Restore and Restart Considerations, Creating Multiple Replicas, Management Interface, Modes of Remote Replication, Remote Replication Technologies, Network Infrastructure.
UNIT - 8 7 Hours Securing the Storage Infrastructure, Managing the Storage Infrastructure: Storage Security Framework, Risk Triad, Storage Security Domains, Security Implementations in Storage Networking Monitoring the Storage Infrastructure, Storage Management Activities, Storage Infrastructure Management Challenges, Developing an Ideal Solution.
1. G. Somasundaram, Alok Shrivastava (Editors): Information Storage and Management, EMC Education Services, Wiley India, 2009.
1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage Networks Explained, Wiley India, 2003.
2. Rebert Spalding: Storage Networks, The Complete Reference, Tata McGraw Hill, 2003.
3. Richard Barker and Paul Massiglia: Storage Area Networks Essentials A Complete Guide to Understanding and Implementing SANs, Wiley India, 2002.
UNIT – 1 7 Hours Introduction, Classical Sets and Fuzzy Sets: Background, Uncertainty and Imprecision, Statistics and Random Processes, Uncertainty in Information, Fuzzy Sets and Membership, Chance versus Ambiguity.