ugmb7t02 management science - welcome to …r)itiv-isyllabus.pdf · management, operations ... co 5...

UGMB7T02 MANAGEMENT SCIENCE

Regulations: R14 Theory: 3 hrs

Year / Semester: IV /I Credits: 3

Course Objective:

To enlighten the technical students with functional management related issues like Principles of

Management, Operations Management, HRM, MM, Project Management techniques.

Course Outcomes:

CO 1 Create awareness about the concepts like Evolution of Management thought, functions &

principles of management, types of organizational structures.

CO 2 Gain knowledge about the types of plant layout, inventory control techniques, Statistical quality

control charts.

CO 3 Acquire in-depth knowledge about the functions of HRM, issues related to employees payment,

merit rating etc.,

CO 4 Provide all round information to the students about matters related to concepts & functions

related to Marketing.

CO 5 Familiarize problems related to Project Management techniques like PERT, CPM, and project

crashing for completion of Projects in scheduled times.

CO 6 Knowledge about Strategy formulation & implementation, SWOT analysis in order to compete

with the competition & to gain competency advantage.

UNIT I:

Introduction to Management

Concept and importance of Management, Functions of management, Evaluation of Management

thought, Fayol’s principles of Management, Maslow’s need hierarchy & Herzberg’s two factor theory of

Motivation, Decision making process, Designing organizational structure, Principles of Organization,

Types of organization structures

UNIT II:

Operations management

Principles and types of plant Layout, Work study, Statistical Quality control

Charts – R Chart, c chart, p chart, Simple problems on R, c and p charts, Materials Management:

Objectives - Need for inventory control- Inventory control techniques EOQ, ABC, HML, SDE, VED and FSN

analysis

UNIT III:

Human Resources management (HRM)

Concepts of HRM,HRD & Personnel management and industrial relations, Basic functions of HR

manager, Wage payment plans (simple problems), Job Evaluation and Merit Rating

UNIT IV:

Marketing Management

Functions of marketing, Marketing Mix, Marketing strategies based on Product life cycle, Channels of

distribution

UNIT V:

Project Management (PERT/CPM)

Network analysis, Programme Evaluation and Review Technique (PERT), Critical path method(CPM) -

Identifying critical path, Difference between PERT & CPM, Project Crashing (simple problems)

UNIT VI:

Strategic Management

Mission, Goals, objectives, policy, strategy, Elements of corporate planning process, Environmental

scanning, SWOT analysis Steps in strategy formulation and implementation Generic strategy alternatives

TEXT BOOKS:

1. Dr. Arya Sri – Management Science, TMH 2011

2. Principles & Practices of Management-L.M.PRASAD

3. Production and Operations Management- K.ASWATHAPPA and K.SRIDHARA BHAT

4. Marketing Management- PHILIP KOTLER

5. HRM & IR- P.SUBBA RAO

6. Business Policy & Strategic Management- FRANCIS CHERUNILAM

UGIT7T01 CLOUD & BIG DATA



Course Objectives:

Upon completion of the course the student is familiar with the following aspects

1. Get the fundamentals of Cloud Computing

2. Understand the fundamentals of Big Data

3. Understand the fundamentals of Hadoop

Course Outcomes:

CO 1 Understand the Cloud environment and identify the private and public clouds.

CO 2 Ability to implement Cloud based services.

CO 3 Understand big data challenges in different domains

CO 4 Ability to install and perform applications on Hadoop

CO 5 Analyze Map-Reduce programming model for better optimization

CO 6 Ability to perform mining on stream data.

CO 7 Ability to perform mining on social network graphs

UNIT I:

CLOUD COMPUTING FUNDAMENTALS

Cloud Computing definition, private, and public and hybrid cloud, Cloud types; IaaS, PaaS, SaaS, Benefits

and challenges of cloud computing, public vs private clouds, role of virtualization in enabling the cloud

UNIT II:

CLOUD SERVICES MANAGEMENT

Reliability, availability and security of services deployed from the cloud. Performance and scalability of

services, tools and technologies used to manage cloud services deployment; Cloud Economics: Cloud

Computing infrastructures available for implementing cloud based services. Economics of choosing a

Cloud platform for an organization, based on application requirements.

UNIT III:

INTRODUCTION TO BIG DATA

What is Big Data? - differences between Big data Vs Data ware house – characteristics of Big Data-

Applications of Big Data – Challenges of Big Data – Technologies used in Big Data-Introduction to

Hadoop- Hadoop Infrastructure-How Hadoop Works-Advantages of Hadoop - NoSQL-HiVe

UNIT IV:

MapReduce

Distributed File System - Physical Organization of Compute Nodes- Large-Scale File-System Organization

– MapReduce - The Map Tasks – Grouping by a key – The Reduce Tasks – Combiners – Details of

MapReduce Execution – word count – Algorithms using MapReduce- Matrix –Vector Multiplication –

Relational algebra operations.

UNIT V:

MINING DATA STREAMS

Introduction To Streams Concepts – Stream Data Model and Architecture - Stream Computing -

Sampling Data in a Stream – Filtering Streams – Counting Distinct Elements in a Stream – Estimating

Moments – Estimating Moments-Counting Ones in a Window – Decaying Window.

UNIT VI:

MINING SOCIAL-NETWORK GRAPHS

Social Network as Graphs- Clustering of Social – Network Graphs – Partitioning of Graphs – simrank –

Counting triangles in a graph

TEXT BOOKS:

1. AnandRajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge University

Press, 2012.

2. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, 2007.

3. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with

Advanced Analytics”, John Wiley & sons, 2012.

Cloud:

1. Cloud Computing - Web Based Applications That Change the way you Work and Collaborate

Online - Michael Miller, Pearson Education.

2. Cloud Application Architectures, 1st Edition by George Reese O'Reilly Media.

UGIT7T02 PYTHON PROGRAMMING



Course Objective

Learn to program and programming paradigms brought in by Python with a focus on Collections, File

Handling and Regular Expressions.

Course Outcomes:

CO 1 Understand the architecture and programming constructs of python

CO 2 Design, implement, test, and debug functions and modules

CO 3 Analyze and demonstrate the use of objects and lists in Python.

CO 4 Study Regular Expressions

CO 5 Understand the file handling mechanism

UNIT I:

Introduction and overview

Introduction, What is Python, Origin, Comparison, Comments, Operators, Variables and Assignment,

Numbers, Strings, Lists and Tuples, Dictionaries, if Statement, while Loop, for Loop and the range() Built-

in Function, Files and the open() Built-in Function, Errors and Exceptions, Functions, Classes, Modules.

Syntax and Style

Statements and Syntax, Variable Assignment, Identifiers, Basic Style Guidelines, Memory Management,

Python Application Examples

UNIT II:

Conditionals and Loops

if statement, else Statement, else if Statement, while Statement, for Statement, break Statement,

continue Statement, pass Statement, else Statement.

Numbers and Strings

Introduction to Numbers, Integers, Floating Point Real Numbers, Complex Numbers, Operators, Built-in

Functions. Sequences: Strings, Lists, and Tuples, Sequences, Strings, Strings and Operators, String-only

Operators, Built-in Functions, String Built-in Methods, Special Features of Strings.

UNIT III:

Python Objects

Python Objects, Standard Types, Other Built-in Types, Internal Types, Standard Type Operators,

Standard Type Built-in Functions, Categorizing the Standard Types, Unsupported Types.

Lists

Operators, Built-in Functions, List Type Built-in Methods, Special Features of Lists, Tuples, Tuple

Operators and Built-in Functions, Special Features of Tuples.

UNIT IV:

Functions:

What are Functions, Calling Functions, Passing Arguments, Variable Length Arguments, Functional

Programming, Recursion

Modules:

What are Modules, Modules and Files, Namespaces, Importing Modules, Module Built-in Functions,

Packages.

UNIT V:

Files and Input/output

File Objects, File Built-in Function, File Built-in Methods, File Built-in Attributes, Standard Files,

Command-line Arguments, File System, File Execution, Persistent Storage Modules

UNIT VI:

Regular Expressions

Introduction/Motivation, Special Symbols and Characters for REs, REs and Python.

Applications: Check for data error in CSV files: Numeric Check, Alphanumeric Check, Email Check, Date

Check.

TEXT BOOKS:

1. Chun, J Wesley, Core Python Programming, 2nd

Edition, Pearson, 2007 Reprint 2010.

2. Python How to Program- Dietel and Dietel

3. Python in a Nutshell, Alex Martelli-Orielly

REFERENCE BOOKS:

1. Barry, Paul, Head First Python, 2nd

Edition, O Rielly, 2010.

2. Lutz, Mark, Learning Python, 4th

Edition, O Rielly, 2009.

3. Beginning Python, James Payne, Wrox Publisher

UGIT7T03 UML & DESIGN PATTERNS

Regulations: R14 Theory: 3 +2 hrs


Course Objectives

Up on successful completion of this course the student will be able to analyze and document the

requirements, so that they can design the models by using various patterns and also can evaluate

problems of various categories

Course Outcomes

CO 1 Ability to communicate using Models

CO 2 Clear understanding of various features available in UML throughout lifecycle of Project

CO 3 Comprehend the nature of design patterns by understanding a small number of examples

from different pattern categories, and to be able to apply these patterns in creating an OO

design.

CO 4 Understand Design Pattern principles and strategies to apply on object oriented design

and uncover recurring design problems

CO 5 Recognize and apply design patterns, and make judgments about when a particular

pattern will improve a design

UNIT I:

INTRODUCTION TO OBJECT-ORIENTED SOFTWARE DEVELOPMENT

Overview - Functional Decomposition - Problem of Requirements - Using Functional Decomposition –

Object Oriented Paradigm - Special Object Methods.

UNIT II:

UML DIAGRAMS AND NOTATIONS

UML –Use case Diagrams- Class Diagram - Interaction Diagram State chart, Activity Diagram,

Deployment Diagram, Notations Standard Object-Oriented Solution.

UNIT III:

INTRODUCTION TO DESIGN PATTERNS

Design Patterns Arose from Architecture and Anthropology - Architectural to Software Design Patterns -

Advantages of Design Patterns - Adapter Pattern Strategy Pattern - Bridge Pattern - Abstract Factory

Pattern.

UNIT IV:

NEW PARADIGM OF DESIGN

Principles and Strategies of Design Patterns - Open-Closed Principle - Designing from Context -

Encapsulating Variation. Commonality and Variability Analysis, Analysis Matrix - Decorator Pattern.

UNIT V:

VALUES OF PATTERNS

Observer Pattern - Categories of Patterns - Template Method Pattern - Applying the Template Method

to the Case Study - Using Template Method Pattern to Reduce Redundancy.

UNIT VI:

FACTORIES

Design Patterns: Factories - Singleton Pattern and the Double-Checked Locking Pattern - Applying

Singleton Pattern to Case Study. Object Pool Pattern Management of Objects. Factory Method Pattern -

Factory Method Pattern and Object-Oriented Languages.

TEXT BOOKS:

1. Jason McC. Smith (Apr 7, 2012), “Elemental design Patterns”, Pearson, 2012.

2. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides, “Design Patterns: Elements of

Reusable Object-Oriented Software”, Addison-Wesley, 2003.

REFERENCES:

1. Eric Freeman, Elisabeth Freeman, Kathy Sierra, Bert Bates, “Head First Design Patterns”, O'Reilly

Media, Inc., 2004

UGIT7T04 OPTIMIZATION TECHNIQUES

(Elective - 5)



Course Objectives:

The student will learn about the mathematical modelling, Linear Programming, Simplex method,

Transportation problem, assignment problems, processing jobs through several machines, queuing,

Inventory management and management decision making, Project management techniques, simulation

techniques, probability distributions and markov analysis.

Course Outcomes:

CO 1 Concept of mathematical modelling and development of a model.

CO 2 Use of graphical solution in solving LPP.

CO 3 Determining minimum transportation costs.

CO 4 Use of assignment models in business and industry

CO 5 Processing of jobs through different number of machines.

CO 6 Solving queuing problems in single-channel and multiple-channel situations

CO 7 Inventory management and management decision making

CO 8 Project management and simulation techniques

CO 9 Understand application of probability distributions and markov process in different situations.

UNIT I:

Introduction to Operations Research: Definition, Features, types of OR models, Methodology, Tools,

Limitations and applications of Linear Programming.

Linear Programming I: Introduction, Formulation of LPP, Assumptions for solving LPP, Applications of

LPP, Graphical method of solving LPP.

UNIT II:

Linear Programming II: Introduction, steps in solving problems using simplex method, Principle of

simplex method- Maximization and minimization problems, solution by simplex method, limitations of

LPP simplex method.

Linear Programming III: Introduction, concept of primal dual relationship, formulation of the dual of the

primal problem, solution of LP problems using duality.

UNIT III:

The Transportation Problem: Basics, Solution of Transportation problem with several methods,

performing optimality test, degeneracy in transportation problem.

Assignment model: Definition, Formulation, Different methods of solutions, Hungarian assignment

method, unbalanced assignment problems

UNIT IV:

The Sequencing problems: introduction, basics, types of sequencing problems, priority sequencing,

sequencing n jobs through two machines, n jobs and m machines, two jobs 3 machines case.

Waiting Line(Queuing) Theory: introduction, objectives and models, benefits and limitations, single

channel and multi-channel queuing models.

UNIT V:

Inventory Management: introduction, objectives, developing the model, EOQ, Selective inventory

management.

Project management PERT & CPM: introduction, construction of networks, calculation of EST, LST, EFT

and LFT, drawing of networks and calculation of timings

UNIT VI:

Simulation: introduction, applications, advantages and limitations, Monte Carlo simulation technique,

steps involved in use of simulation, generating and using random system, simulation of queuing system,

investment decisions using simulation.

Probability theory and markov analysis: Basics, law of probability, discreet and continuous random

variables, cumulative distribution function, frequency and probability distributions, mean and standard

deviation, Binomial probability distribution, Normal probability distribution. Markovian process-

applications, Markovian decision problems.

TEXT BOOKS:

1. Operations research, 2ed, Col D S Cheema, University Science Press, Lakshmi Publications

2. Hamdy H. Taha, “Operations Research -An Introduction” Pearson Education,2003

3. Taha Hamdy- Operations Research- An Introduction ,Prentice-Hall, 7th edition

REFERENCE BOOKS:

1. Operations Research, Panneer Selvan, Prentice Hall of India.

2. Banks, J, Carson II J. S., Nelson B.L., and Nicol D.M. Discrete – Event System Simulation. Pearson

Education Asia, 3 edition,

3. Principles of Operation Research (with applications to managerial decisions) – H.M Wagher, PHI,

New Delhi

UGIT7T05 INTERNET OF THINGS

(Elective - 5)



Course Objectives:

Student knows the basics of Internet of Things; get an idea of some of the application areas where

Internet of Things can be applied, the middleware for Internet of Things

To understand the concepts of Web of Things, the concepts of Cloud of Things with emphasis on Mobile

cloud computing, the IOT protocols

Course Outcomes:

CO 1 Identify and design the new models for market strategic interaction

CO 2 Design business intelligence and information security for WoB

CO 3 Analyze various protocols for IoT

CO 4 Design a middleware for IoT

CO 5 Analyze and design different models for network dynamics

UNIT I:

INTRODUCTION: Definitions and Functional Requirements –Motivation – Architecture - Web 3.0 View of

IoT– Ubiquitous IoT Applications – Four Pillars of IoT – DNA of IoT - The Toolkit Approach for End-user

Participation in the Internet of Things. Middleware for IoT: Overview – Communication middleware for

IoT –IoT Information Security

UNIT II:

IOT PROTOCOLS: Protocol Standardization for IoT – Efforts – M2M and WSN Protocols – SCADA and

RFID Protocols –Issues with IoT Standardization – Unified Data Standards – Protocols – IEEE 802.15.4 –

BACNet Protocol – Modbus – KNX – Zigbee Architecture – Network layer – APS layer – Security

UNIT III:

WEB OF THINGS: Web of Things versus Internet of Things – Two Pillars of the Web – Architecture,

Standardization for WoT– Platform Middleware for WoT – Unified Multitier WoT Architecture – WoT

Portals and Business Intelligence.

UNIT IV:

Cloud of Things: Grid/SOA and Cloud Computing – Cloud Middleware – Cloud Standards – Cloud

Providers and Systems – Mobile Cloud Computing – The Cloud of Things Architecture

UNIT V:

Integrated Billing Solutions in the Internet of Things Business Models for the Internet of Things -Network

Dynamics: Population Models – Information Cascades - Network Effects - Network Dynamics: Structural

Models - Cascading Behavior in Networks - The Small-World Phenomenon

UNIT VI:

APPLICATIONS: The Role of the Internet of Things for Increased Autonomy and Agility in Collaborative

Production Environments - Resource Management in the Internet of Things: Clustering, Synchronisation

and Software Agents. Applications - Smart Grid – Electrical Vehicle Charging.

TEXT BOOKS:

1. The Internet of Things in the Cloud: A Middleware Perspective - Honbo Zhou – CRC Press

2. Architecting the Internet of Things - Dieter Uckelmann; Mark Harrison; Florian Michahelles-

(Eds.) – Springer

REFERENCES:

1. Networks, Crowds, and Markets: Reasoning About a Highly Connected World - David Easley and

Jon Kleinberg, Cambridge University Press

2. The Internet of Things: Applications to the Smart Grid and Building Automation by - Olivier

Hersent, Omar Elloumi and David Boswarthick - Wiley

3. Olivier Hersent, David Boswarthick, Omar Elloumi , “The Internet of Things – Key applications

and Protocols”, Wiley

UGIT7T06 SOFTWARE PROJECT MANAGEMENT

(Elective - 5)



Course Objectives:

The student will be able to understand the roles of a manager, practical management issues in various

domains like quality, people, and risk management and apply the knowledge for various software

projects.

Course Outcomes:

CO 1 Apply theoretical knowledge on project management and software development into

practice.

CO 2 Understand project time and cost management for effective project management

CO 3 Understand human recourse management

CO 4 Understand risk analysis and management for a given project

CO 5 Apply procurement management in strategic planning and managing project execution

CO 6 Analyze project monitoring and controlling activities

UNIT I:

Introduction to software project Management: Project Stakeholders, Project Management Knowledge

Areas, Project Management Tools and Techniques, Program and Project Portfolio Management, the Role

of the Project Manager, the Project Management Profession, Project Phases and the Project Life Cycle.

UNIT II:

Software project Time and Cost management: Time management The Importance of Project Schedules,

Estimating Activity Resources, Estimating Activity Durations, Developing the Schedule, Controlling the

Schedule, Using Software to Assist in Project Time Management. Cost management: The Importance of

Project Cost Management, Basic Principles of Cost Management, Estimating Costs, Types of Cost

Estimates, Cost Estimation Tools and Techniques, Determining the Budget, Controlling Costs.

UNIT III:

Human Resources Management: The Importance of Human Resource Management, Keys to Managing

People, Developing the Human Resource Plan, Acquiring the Project Team, Developing the Project

Team, Managing the Project Team, Using Software to Assist in Human Resource Management.

UNIT IV:

Risk Management: Planning Risk Management, Common Sources of Risk on Information Technology

Projects, Identifying Risks, Performing Qualitative Risk Analysis, Performing Quantitative Risk Analysis,

Planning Risk Responses, Monitoring and Controlling Risks, sing Software to Assist in Project Risk

Management.

UNIT V:

Procurement Management: Strategic Planning and Project Selection, Developing a Project Charter,

Developing a Project Management Plan, Directing and Managing Project Execution

UNIT VI:

Monitoring and Controlling: Project Work, Performing Integrated Change Control, Closing Projects or

Phases.

TEXT BOOKS:

1. INFORMATION TECHNOLOGY PROJECT MANAGEMENT, Kathy Schwalbe,6th edition, Cengage

Learning, 2011

2. SOFTWARE PROJECT MANAGEMENT A Unified Framework Walker Royce Pearson Edition.

REFERENCES:

1. Ramesh, Gopalaswamy, "Managing Global Projects", Tata McGraw Hill, 2001

2. Jalote, “Software Project Management in Practice”, Pearson Education, 2002

UGIT7T07 INFORMATION RETRIEVAL SYSTEMS

(Elective - 6)


Year / Semester: IV/I Credits: 3

Course Objectives:

To give knowledge on Information Retrieval System data structures, algorithms for effective information

retrieval.

Course Outcomes

CO 1 Understand the importance of Information Retrieval System and its data structures

CO 2 Familiarize the representation of Information retrieval system in various formats like

inverted files and signature files.

CO 3 Understand PAT trees and PAT arrays for representation of information

CO 4 Understand stemming algorithms to compress the data in text preprocessing

CO 5 Analyze the thesaurus construction from the given text

UNIT I:

Introduction to Information Storage and Retrieval System: Introduction, Domain Analysis of IR systems

and other types of Information Systems, IR System Evaluation.

Introduction to Data Structures and Algorithms related to Information Retrieval: Basic Concepts, Data

structures, Algorithms

UNIT II:

Inverted files: Introduction, Structures used in Inverted Files, Building Inverted file using a sorted array,

Modifications to Basic Techniques.

UNIT III:

Signature Files: Introduction, Concepts of Signature Files, Compression, Vertical Partitioning, Horizontal

Partitioning.

UNIT IV:

New Indices for Text: PAT Trees and PAT Arrays: Introduction, PAT Tree structure, algorithms on the

PAT Trees, Building PAT trees as PATRICA Trees, PAT representation as arrays.

UNIT V:

Stemming Algorithms: Introduction, Types of Stemming Algorithms, Experimental Evaluations of

Stemming to Compress Inverted Files

UNIT VI:

Thesaurus Construction: Introduction, Features of Thesauri, Thesaurus Construction, Thesaurus

construction from Texts, Merging existing Thesauri

TEXT BOOKS:

1. Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data Structures and Algorithms,

Prentice Hall, 1992.

2. Modern Information Retrival By Yates Pearson Education.

3. Information Storage & Retieval By Robert Korfhage – John Wiley & Sons.

REFERENCES:

1. Kowalski, Gerald, Mark T Maybury: Information Retrieval Systems: Theory and Implementation,

Kluwer Academic Press, 1997.

2. Information retrieval Algorithms and Heuristics, 2ed, Springer

UGIT7T08 NETWORK SECURITY

(Elective - 6)



Course Objective:

To introduce various cryptographic algorithms and their applications in securing the networking

environment

Course Outcomes:

CO 1 Understand various security services and mechanisms, various types of attacks

CO 2 Study various symmetric cryptography algorithms and mathematical foundation required

in the study of security protocols

CO 3 Study various Asymmetric cryptography algorithms and their applications

CO 4 Study the applications of authentication protocols

CO 5 Understand the security issues if IP layer and Transport layer

CO 6 Understand various types of malicious software and Firewall

UNIT I:

Introduction: Security Attacks, Security Services, Security Mechanisms, and a Model for Network

Security. Non-Cryptographic Protocol Vulnerabilities-DoS, DDoS, Session Hijacking and Spoofing,

Software Vulnerabilities- Phishing, Buffer Overflow, Format String Attacks, SQL Injection. Basics of

Cryptography – Steganography, Symmetric Cipher Model, Substitution Techniques, Transportation

Techniques, Other Cipher Properties- Confusion, Diffusion, Block and Stream Ciphers.

UNIT II:

Secret Key Cryptography: S-DES, Data Encryption Standard (DES), Strength of DES, Block Cipher Design

Principles and Modes of Operations, Triple DES, AES.

Number Theory: Divisibility and the Division Algorithm, Prime and Relatively Prime Numbers, Modular

Arithmetic, Fermat’s and Euler’s Theorems, the Chinese Remainder Theorem, Discrete Logarithms.

UNIT III:

Public Key Cryptography: Principles of Public Key Cryptosystems, RSA Algorithm, Diffie-Hellman Key

Exchange, Introduction to Elliptic Curve Cryptography.

Cryptographic Hash Functions: Applications of Cryptographic Hash Functions, Secure Hash Algorithm,

Message Authentication Codes – Message Authentication Requirements and Functions, HMAC, Digital

signatures, Digital Signature Standards.

UNIT IV:

Authentication Applications: Kerberos, Key Management and Distribution, X.509 Directory

Authentication service, Public Key Infrastructure, Electronic Mail Security: Pretty Good Privacy.

UNIT V:

IP Security: Overview, Architecture, Authentication Header, Encapsulating Security Payload, Combining

security Associations, Internet Key Exchange.

Web Security: Web Security Considerations, Secure Sockets Layer and Transport Layer Security,

Electronic Payment.

UNIT VI:

System Security: Malicious Software – Types, Viruses, Virus Countermeasures, Worms.

Firewalls: Characteristics, Types of Firewalls, Placement of Firewalls, Firewall Configuration, Trusted

systems.

TEXT BOOKS:

1. Cryptography and Network Security: Principles and Practice,5th

edition, William Stallings,

Pearson Education,2011

2. Network Security and Cryptography, Bernard Menezes, Cengage Learning, 2011

3. Cryptography and Network, 2nd

edition, Behrouz A.Fourouzan and Debdeep Mukhopadhyay,

McGraw-Hill, 2010

REFERENCE BOOKS:

1. Fundamentals of Network Security by Eric Maiwald, Dreamtech press.

2. Principles of Information Security, Whitman, Thomson.

3. Introduction to Cryptography, Buchmann, Springer.

4. Applied Cryptography. 2nd

Edition, Bruce Schneier, Johnwiley & Sons

UGIT7T09 MIDDLEWARE TECHNOLOGIES

(Elective - 6)



Course Objective

To create a practical exposure on Middleware Technologies to understand distributed environment and

start building complex distributed systems with confidence.

Course Outcomes

At the end of the course, the student will be able to

CO 1 Use Middleware to Build Distributed Applications.

CO 2 Implement distributed Business objects

CO 3 Understand existing Distributed Technologies like CORBA and .NET Remoting

CO 4 Understand SOA and Web services architectures.

UNIT I:

Introduction to Middleware Technologies

General Middleware, Service Specific Middleware, Client/Server Building blocks – RPC - Messaging –

Peer – to – Peer, Java RMI.

UNIT II:

Distributed Objects

Computing standards, OMG, Overview of CORBA, Overview of COM/DCOM, and Overview of EJB.

UNIT III:

CORBA

Introduction and concepts, distributed objects in CORBA, CORBA components, architectural features,

method invocations, static and dynamic: IDL (Interface Definition Language) models and interfaces.

Structure of CORBA IDL, CORBA's self-describing data; CORBA interface repository. Building an

application using CORBA.

UNIT IV:

COM and .NET

Introduction to COM ,Evolution of DCOM, COM clients and servers, COM IDL, COM Interfaces, COM

Threading Models, Comparison of COM and CORBA, Introduction to .NET, Overview of .NET

architecture, .NET Remoting.

UNIT V:

Service Oriented architecture (SOA) Fundamentals

Defining SOA, Business value of SOA, SOA characteristics, Concept of a service, Basic SOA , Enterprise

Service Bus (ESB), SOA enterprise Software Models.

UNIT VI:

Web Services Technologies

XML in Web Services, WSDL, SOAP, UDDI, Web Services and Service Oriented Enterprise (SOE)

TEXT BOOKS:

1. G. Sudha Sadasivam “Distributed Component Architecture”, Wiley India edition.

2. Thomas Erl “Service Oriented Architecture: Concepts , Technology & Design”.

3. G. Brose, A Vogel and K. Duddy, “Java programming with CORBA”, 3rd Edition, Wiley-dreamtech,

India John Wiley and sons

REFERENCES:

1. Robert Orfali, Dan Harkey, “Client/server Programming with Java & Corba W/cd”, Wiley India Pvt.

2. Wolfgang Emmerich, “Engineering Distributed Objects”, John Wiley, 2000.

3. Web Services: Concepts, Architectures and Applications

UGIT7P10 HADOOP & BIG DATA LAB

Regulations: R14 Lab: 3 hrs


Week 1, 2:

1. (i)Perform setting up and Installing Hadoop in its three operating modes:

Standalone, Pseudo distributed, Fully distributed

(ii)Use web based tools to monitor your Hadoop setup.

Week 3:

2. Implement the following file management tasks in Hadoop:

• Adding files and directories

• Retrieving files

• Deleting files

Hint: A typical Hadoop workflow creates data files (such as log files) elsewhere and copies them

into HDFS using one of the above command line utilities.

Week 4:

3. Run a basic Word Count MapReduce program to understand MapReduce Paradigm.

Week 5:

4. Write a mapreduce program that mines weather data.

Weather sensors collecting data every hour at many locations across the globe gather a large

volume of log data, which is a good candidate for analysis with MapReduce, since it is semi

structured and record-oriented.

Week 6:

5. Use MapReduce to find the shortest path between two people in a social graph.

Hint: Use an adjacency list to model a graph, and for each node store the distance from the

original node, as well as a backpointer to the original node. Use the mappers to propagate the

distance to the original node, and the reducer to restore the state of the graph. Iterate until the

target node has been reached.

Week 7:

6. Implement Friends-of-friends algorithm in MapReduce.

Hint: Two MapReduce jobs are required to calculate the FoFs for each user in a social network.

The first job calculates the common friends for each user, and the second job sorts the common

friends by the number of connections to your friends.

Week 8:

7. Implement an iterative PageRank graph algorithm in MapReduce.

Hint: PageRank can be implemented by iterating a MapReduce job until the graph has

converged. The mappers are responsible for propagating node PageRank values to their

adjacent nodes, and the reducers are responsible for calculating new PageRank values for each

node, and for re-creating the original graph with the updated PageRank values.

Week 9:

8. Create a Bloom filter in MapReduce.

Hint: Write a MapReduce job to create and output a Bloom filter using the Hadoop built-in

BloomFilter class. The mappers are responsible for creating intermediary Bloom filters, and the

single reducer combines them together to output a combined Bloom filter.

Week 10:

9. Perform an efficient semi-join in MapReduce.

Hint: Perform a semi-join by having the mappers load a Bloom filter from the Distributed Cache,

and then filter results from the actual MapReduce data source by performing membership

queries against the Bloom filter to determine which data source records should be emitted to

the reducers.

Week 11:

10. Install and Run Pig then write Pig Latin scripts to sort, group, join, project, and filter your

data.

Week 12:

Install and Run Hive then use Hive to create, alter, and drop databases, tables, views, functions, and

indexes

UGIT7P11 PYTHON PROGRAMMING LAB



1. Write a script to compute and print the prime number below N Read N from console.

2. Write a program that computes the minimum number of bills and coins needed to make change for a

person. For instance, if you need to give 2788 in change you would need two thousand rupees, one Five

hundred rupees, two hundred rupees, one fifty rupees, one twenty rupees, one ten rupees, one five

rupee coin, one two rupee coin, and single one rupee coin.

3. Write a function called zip that is given two lists of the same length and creates a new list of two -

tuples where each two - tuple is the tuple of the corresponding elements from the two lists. For

example, zip([1,2,3],[4,5,6])would re-turn [(1, 4), (2, 5), (3, 6)].

4. Write a function called unzip that returns a tuple of two lists that result from unzipping a zipped list .

So unzip([(1,4),(2,5),(3,6)])would return ([1, 2, 3], [4, 5, 6]).

5. Creating a CSV File based on user input.

6. Reading a CSV File already created and check for a specific pattern.

7.

a) Write a function that accepts a text and a character as argument and returns the no. of occurrences

of the character in the text.

b) Modify the function in the previous task, such that the caller can specify whether case should be

ignored. The default is to ignore case.

8.

A table of names and telephone no. is given below.

Name Telephone

Jack 4098

Sape 4139

a. Represent the table as dictionary mapping names to telephone numbers.

b. Add a new entry that maps guido to 4127.

c. Get the telephone no. of jack, from the dictionary.

d. Remove the entry for sape from the dictionary.

e. Get the names from the dictionary.

f. Get the telephone nos. from the dictionary.

g. Check if guido is in the dictionary.

9. Define a function that accepts the student names as a list in the first argument, and the student’s

mark as a list in the second argument and prints the name and the mark.

10.

a. Write a module with the following contents, and name it fibo.py.

# Fibonacci numbers module

def fib(n): # write Fibonacci series up to n

a, b = 0, 1

while b < n:

print b,

a, b = b, a+b

def fib2(n): # return Fibonacci series up to n

result = []

a, b = 0, 1

while b < n:

result.append(b)

a, b = b, a+b

return result

b. Import the module.

c. Access the function fib defined within the module.

d. Access and print the module’s name.

e. Assign a local name for the function fibo.fib, and invoke the function using local name.

f. Import the function fibo.fib directly into the local name fib.

11. Write a Time class that has three fields: hours, minutes and seconds. The class should have the

following methods.

a. Initialization method.

b. print_time - that prints the time.

c. increment - that increments the time.

Web References

1. http://www.swaroopch.com/notes/python/

2. http://www.python.org/download/releases/3.2.3/

3. http://wiki.python.org/moin/IntegratedDevelopmentEnvironments

4. http://zetcode.com/lang/python/

5. http://www.programiz.com/python-programming/

UGIT7P12 UML & DESIGN PATTERNS LAB



1. To create a UML diagram of ATM APPLICATION

2. To create a UML diagram of LIBRARY MANAGEMENT SYSTEM

3. To create a UML diagram of ONLINE BOOK SHOP

4. To create a UML diagram of RAILWAY RESERVATION SYSTEM

5. To create a UML diagram of BANKING SYSTEM

6. To design a Document Editor

7. Using UML, design Abstract Factory design pattern

8. Using UML, design Builder design pattern

9. Using UML, design Façade design pattern

10. Using UML, design Bridge design pattern

11. Using UML, design Decorator design pattern

12. User gives a print command from a word document. Design to represent this chain of

responsibility design pattern

UGEE7A12 ENERGY STUDIES

(Audit Course)


Year / Semester: IV /I Credits: --

Course Outcomes:

Student should be able to

CO 1 Analyze solar radiation data, extraterrestrial radiation, radiation on earth’s surface.

CO 2 Design solar thermal collections.

CO 3 Design solar photo voltaic systems.

CO 4 Develop maximum power point techniques in solar PV and wind.

CO 5 Explain wind energy conversion systems, Betz coefficient, tip speed ratio.

CO 6 Explain basic principle and working of hydro, tidal, biomass, fuel cell and geothermal

systems.

UNIT I:

Fundamentals of Energy Systems

Energy conservation principle – Energy scenario (world and India) – Solar radiation: Outside earth’s

atmosphere – Earth surface – Analysis of solar radiation data – Geometry – Radiation on tilted surfaces –

Numerical problems.

UNIT II:

Solar Thermal Systems

Liquid flat plate collections: Performance analysis – Transmissivity – Absorptivity product collector

efficiency factor – Collector heat removal factor – Numerical problems. Introduction to solar air heaters

– Concentrating collectors and solar pond.

UNIT III:

Solar Photovoltaic Systems

Balance of systems – IV characteristics – System design: storage sizing – PV system sizing – Maximum

power point tracking techniques: Perturb and observe (P&O) technique – Hill climbing technique.

UNIT IV:

Wind Energy

Wind patterns – Types of turbines – Kinetic energy of wind – Betz coefficient – Tip–speed ratio –

Efficiency – Power output of wind turbine – Selection of generator(synchronous, induction) – Maximum

power point tracking.

UNIT V:

Hydro and Tidal power systems

Basic working principle of small and micro hydro turbines – measurement of head and flow – Energy

equation-Tidal power – Basics – Kinetic energy equation – Numerical problems – Wave power – Basics –

Kinetic energy equation.

UNIT VI:

Biomass, fuel cells and geothermal systems

Biomass Energy: Fuel classification – Pyrolysis – Direct combustion of heat – Different digesters and

sizing.

Fuel cell: Classification – Efficiency – VI characteristics.

Geothermal: Classification – Dry rock and acquifer – Energy analysis.

TEXT BOOKS:

1. Solar Energy: Principles of Thermal Collection and Storage, S. P. Sukhatme and J. K. Nayak, TMH,

New Delhi, 3rd Edition.

2. Renewable Energy Resources, John Twidell and Tony Weir, Taylor and Francis -second

edition,2013.

3. Energy Science: Principles, Technologies and Impacts, John Andrews and Nick Jelly, Oxford.

REFERENCE BOOKS:

1. Renewable Energy- Edited by Godfrey Boyle-oxford university.press,3rd

edition,2013.

2. Handbook of renewable technology Ahmed and Zobaa, Ramesh C Bansal, World scientific,

Singapore.

3. Renewable Energy Technologies /Ramesh & Kumar /Narosa.

4. Renewable energy technologies – A practical guide for beginners – Chetong Singh Solanki, PHI.

5. Non conventional energy source –B.H.khan- TMH-2nd

edition.

ugmb7t02 management science - welcome to …r)itiv-isyllabus.pdf · management, operations ... co 5...

Documents