Unit 11: India's Challenge i n the IT Enabled Services space
Unit 12: HR and Quality Issues in IT Enabled Services: HR in ITES, Employee Value Proposition, Balance of Rewards, Incentive Plan, Training, Quality Focus, Benchmarking quality & Performance.
Unit 13: Challenges Facing the Indian IT Enabled Outsourcing Market: Perspective, Supply & Demand side, Action Plan for India.
GROUP II : COMPUTER NETWORKING
Subject Code
|
J0302CN01
|
Title
|
Network Architecture and Design
|
Work Load Per Week
|
L: 3 T: 1 Lab: 0
|
Examinations
|
Int: 30 Univ: 70
|
Objectives
|
The aim is to help students to identify various network aspects that need to be monitored and analyzed during design and evaluation of network architecture.
|
Learning Outcomes
| -
Design a new network model to meet requirements for new and existing networks.
-
Use quantitative and qualitative techniques to design or upgrade a network
-
Making decisions on the proper network technologies, routing protocols, network topologies, node placement etc.
-
Identify network issues, risks, bottlenecks etc .
|
Pre-requisites
|
• Basic knowledge of networking concepts.
|
Text Book(s)
|
• Top - Down Network Design by Priscilla Oppenheimer
|
Unit I: Analyzing Business Goals and Constraints
Analyze typical network design business goals and changes in Enterprise networks.
Identify scope of network design and Importance of network security.
Analyze business constraints
-
Budgetary Constraints 2)Staffing Constraints 3)Project Scheduling
Unit II: Analyze Technical Goals
Scalability
-
Planning for Expansion 2) Expanding Access to Data 3) Constraints on scalability
Availability
-
Specify Availability Requirements 2) Mean Time Between Failure 3) Mean Time to Repair
Network Performance
1) Definition 2) Optimum Network Utilization 3) Throughput
4) Accuracy 5) Efficiency 6) Response Time
7) Security
a) Identify Network Assets
b) Analyze Security Risks
c) Developing Security Requirements
8) Manageability 9) Usability 10) Adaptability 11) Affordability
Unit III: Characterizing the Existing Internetwork
Characterizing the Network Infrastructure
a) Developing Network Map
1) Tools for developing Network maps
2) Characterizing Large Internetworks
3) Characterizing Logical Architecture
Characterizing Network Addressing and naming with examples
Characterizing wiring and media with example
Checking Architectural and environmental constraints- Checking for wireless Installation
Checking status of Routers, Switches and Firewalls
a) Tools for Characterizing Existing Network
1) Protocol Analyzers
2) Network Monitoring Tools
3) Network Management Tools
4) Remote Monitoring Tools
5) Cisco Tools
Unit IV: Characterizing Network Traffic
Characterizing Traffic Flow
-
Identifying Major Traffic sources & stores
-
Documenting Traffic Flow
Characterizing Types of Traffic Flow
-
Terminal/Host Traffic Flow
2) Client/Server Traffic Flow
3) Thin Client Traffic Flow
4) Peer-to-Peer Traffic Flow
5) Server/Server Traffic Flow
6) Distributed Computing Traffic Flow
7) Voice Over IP Network (VoIP) Traffic Flow
Characterizing Traffic Load
-
Calculating Theoretical Traffic Load
-
Documenting Application Usage Pattern
Refining Estimates Caused by Applications
-
Estimating Traffic Overhead for Protocols
-
Estimating Traffic load caused by Workstation
-
Estimating Load caused by Routing protocols
Characterizing Traffic Behavior
-
Broadcast/Multicast Behavior
-
Network Efficiency
a) Frame Size
b) Error Recovery Mechanisms
Unit V: Designing a Network Topology
Hierarchical Network Design
1) Why Use Hierarchical Network Model
a) Flat WAN Topologies b) Flat LAN Topologies
c) Mesh Topologies d) Hierarchical Mesh Topologies
Classic Three Layer Hierarchical Model
1) Core Layer 2) Distribution Layer 3) Access Layer
Guidelines for Hierarchical Network Design
Redundant Network Design Topologies
1) Backup Paths 2) Load Sharing
Modular Network Design
-
Enterprise Composite Network Model
a) Enterprise campus b) Enterprise Edge c) Service provider Edge
2) Designing a Campus Network Design Topology
-
Spanning Tree Protocol
-
STP Convergence
-
Selecting Root Bridge
Virtual LANs - Fundamental VLAN Designs
Wireless LANS - Positioning an Access Point
Designing Enterprise Edge Topology
-
Redundant WAN Segments 2) Multihoming Internet Connection
Virtual Private Networking
-
Site-to-Site VPNs 2) Remote-Access VPNs
Secure Network Design Topologies
-
Planning for Physical Security
-
Meeting Security Goals with Firewall topologies
Unit VI: Developing Network Security Strategies
Network Security Design
-
Identify Network Assets and Risks
-
Developing a Security Plan and Policy
-
Developing Security Procedures
Modularizing Security Design
-
Securing Internet Connections
-
Securing Public servers
-
Securing E-commerce Servers
-
Securing Remote-Access and VPNs
Unit VII: Developing Network Management Strategies
Network Management Design
1) Proactive network Management
2) Network management Processes
a) Performance Management b) Fault Management
c) Configuration Management d) Security Management
e) Accounting Management
3) Network Management Architecture
Unit VIII: Selecting Technologies and Devices for Campus networks
LAN Cabling plant Design
-
Cabling Topologies
-
Building –Cabling Topologies
-
Campus – Cabling Topologies
-
Types of Cables
LAN Technologies
-
Ethernet 2) IEEE 802.3
Selecting Internetworking Devices for Campus Network Design with example
-
Hub 2) Bridge 3) Switch 4) Router 5) Gateways
Unit IX: Testing the Network Design
Building and Testing a Prototype Network System
-
Determining scope of Prototype System
-
Writing test plan for Prototype System
a) Developing Test Objectives and Acceptance Criteria
b) Determining types of tests to Run
c) Documenting Network Equipment and other Resources
d) Writing Test scripts
Tools for Testing a Network Design
1) Types of Tools
Specific tools for Testing Network Design
1) CiscoWorks Internetwork Performance monitor
2) WANDL’s Network Planning and Analysis Tools
3) OPNET Technologies
4) Agilent’s Router tester
5) NETIQ Voice and Video Management Solution
6) Net predict’s Net Predictor
Reference Book:
-
Data Network Design Darren L. Spohn
Subject Code
|
J0302CN02
|
Title
|
Network Programming
|
Work Load Per Week
|
L:3 T: 1 Lab:1
|
Examinations
|
Int: 30 Univ: 70
|
Objectives
|
To enable the students to develop the necessary skills for developing robust and scalable network applications
|
Learning Outcomes
|
At the end of this course, student should be able to
-
Understand basic Network Programming concepts using JAVA as well as UNIX.
-
Understanding threads for developing high performance scalable applications
-
Learn about raw sockets.
|
Pre-requisites
|
Basic Knowledge of computer, Computer Network, Proficiency in JAVA Programming and UNIX, understanding of Inter Process Communication
|
Text Book(s)
| -
JAVA NETWORK PROGRAMMING Second Edition BY Elliotte Rusty Harold –O’REILLY
-
UNIX Network Programming, Volume 1: The Sockets Network API, 3rd Edition, by W. Richard Stevens, Bill Fenner, and Andrew M. Rudoff.
-
"UNIX Network Programming," Volume 1, second edition by W. Richard Stevens, Prentice Hall.
|
UNIT-I
Overview of Network Concepts: Review of OSI and TCP/IP models, Overview of TCP/IP Protocols:IPv4,IPv6,TCP,UDP, ICMP,IGMP,ARP,RARP, ICMPv6,BPF, DLP, The Client/Server Model, Internet Standards, Basic Web Concepts: URL, HTML, SGML,XML, HTTP, MIME, CGI, Protocol usage by common Internet Applications. Network Programming in Java: Looking up Internet Address: DNS, IP Addresses, The InetAddress Class: Creating new InetAddress Objects, Getter Methods: GetHostName(), GetHostAddress(), GetAddress(), Object Methods: Boolean equals(), Hashcode(), To String() . Retrieving Data with URLs: The URL class: creating new URLs, Splitting a URL into pieces, Retrieve Data from a URL, Utility Methods: sameFile(), toExternalForm(), Communicating with CGIs and Servelets through GET, Network Methods of Java.applet.Applet: Using java.applet.Applet to download Data, Downloading sounds, The MediaTracker class, Checking whether media has loaded, Waiting for media to load, Checking the status of Media
UNIT- II
Socket Programming using JAVA: Socket for Clients: Socket Basics, The Socket class, Getting information about a socket: getInet Address(), getPort(),get LocalPort(), getLocalAddress(),closing the socket, Setting Socket options: TCP_NODELAY, SO_BINDADDR, SO_TIMEOUT, SO_LINGER, SO_SNDBUF, SO_RCVBUF, SO_KEEPALIVE, Socket Exceptions. Socket for Servers: The ServerSocket Class, Accepting and closing connections, The get Methods(), Socket options, Some useful servers : Client Tester, HTTP Servers, Secure Sockets: Secure communication, Creating secure client socket, Methods of SSLSocket Class: Event Handlers, Session Management, Client Mode, Creating secure server socket, Methods of SSLServerSocket Class: Session Management, Client Mode. UDP Datagrams and sockets: The UDP protocol, The DatagramPacket Class, The get & set methods, The DatagramSocket Class, Sending and Receiving Datagrams, Socket options, UDP Server, UDP echo Client, Multicast Sockets: Multicast addresses and groups, Clients and servers, Routers and routing, Working with Multicast Socket, Communicating with a Multicast group
UNIT-III
The URLConnection Class: Opening URLConnections, Reading Data from a Server, Reading the Header, Configuring the connection, Writing data to a server, Protocol Handlers: What is a protocol handler, The URLStreamHandler Class, Writing a Protocol Handler, Content Handler:What is a content Handler, The ContentHandler Class, Using Content Handler. Remote Method Invocation: RMI: Security, Object Serialization, Implementation: The Client Side, The Server Side
UNIT-IV
Socket Programming on UNIX Platform: Sockets: Socket address structures, Value_result arguments
Byte ordering and manipulation functions and related functions, Elementary TCP Sockets: Socket, connect, bind, listen, accept, fork, exec functions, iterative and concurrent servers, close function and related functions, Application Development: TCP Echo Server, TCP Echo Client, normal startup, normal termination, Posix Signal handling, Server with multiple client- boundary conditions, server process crashes, server host crashes, server crashes and reboots, server shutdown. Socket options: Get_sockop and setsockopt functions, socket states, generic socket options, IPv4 socket options, IPv6 socket options, TCP socket options, Elementary UDP Sockets: UDP Echo server, UDP Echo Client, Lost datagrams, Multiplexing TCP and UDP Sockets
UNIT-V
Advanced Sockets: IPv4 and IPv6 interoperability, Threaded servers: thread creation and termination, TCP echo server using threads, Mutexes, condition variables, Raw Sockets: Raw Socket Creations,raw socket output/input, ping programs , trace route programs, Inter Process Communication(IPC): File and record locking, Pipes, FIFO streams and messages, Name spaces, system IPC, Message Queues, semaphores. Remote Login: Terminal Line disciplines, Pseudo Terminals, Terminal Modes, control terminals, rlogin overview, RPC transparency issues.
Subject Code
|
J0303CN03
|
Title
|
Network Administration
|
Work Load Per Week
|
L:4 T: Lab:1
|
Examinations
|
Int: 30 Univ: 70
|
Objectives
|
To understand and implement your own networks using various networking devices and configure them for reliable performance.
|
Learning Outcomes
|
At the end of this course, student should be able to
-
Understand designing and planning network.
-
Understand various hardware devices.
-
Configure these devices
-
Troubleshoot the network
-
Understand various protocols and their functioning.
-
Design the VLANS
|
Pre-requisites
|
Basic Knowledge software engineering
|
Text Book(s)
|
CCNA Cisco Certified Network Associate Study Guide (Exam 640-802) (Certification Press) by Richard Deal
CCNA Cisco Certified Network Associate Study Guide fifth edition ( Certification Press) by Todd Lammle, BPB Publications
The Practice of System and Network Administration, Second edition by Thomas A. Limoncelli, Christina J. Hogan, and Strata R. Chalup Addison-Wesley Professional; 2 edition.
|
Syllabus
|
|
Unit 1. Internetworking
-
Internetworking Models, OSI reference Models
-
Ethernet networking Wireless Networking
-
Cisco three layer hierarchical model
Unit 2. Internet Protocols
-
TCP/IP and DoD model Application and host to host layer protocol
-
Internet layer protocol IP addressing
-
IP terminology IP Addressing scheme
-
Private IP addresses Broadcast addresses
-
Network address translation
Unit 3. IP sub netting and variable length subnet masks
-
Subnetting Basics Subnet and subnet masks
-
Subnetting Class C addresses Subnetting Class B addresses
-
Subnetting Class A addresses Variable length Subnet masks
-
VLSM design Trouleshooting IP addressing
Unit 4. Introduction to the Cisco IOS
-
Cisco router GUI Cisco router IOS
-
Conneting to Cisco router Setup mode
-
Command line interface Router modes
-
CLI prompts Router Administrative functions
-
Configuring router Verify configuration
Unit 5. IP routing
-
Routing basics IP routing process
-
Configuring IP routing Routing Protocols
-
Routing information protocol Interior gateway routing protocol
-
Introduction to EIGRP Introduction to open shortest path first
Unit 6. Swithching
-
Switching services Spanning tree protocol
-
LAN switch type Configuring catalyst 1900 switches
-
Configuring catalyst 1900 switches
Unit 7. Virtual
-
VLAN Basics VLAN memberships
-
Identify VLANS VLAN trunking protocol
-
Routing between VLANS Configuring VLANS
Introduction to wide area networking protocols.
Subject Code
|
J0303CN04
|
Title
|
Network Security
|
Work Load Per Week
|
L:4 T: Lab:1
|
Examinations
|
Int: 30 Univ: 70
|
Objectives
|
This course provides an essential study of Network Security issues.
|
Learning Outcomes
|
At the end of this course, student should be able to
-
To acquire an understanding of Network Security and its changing character
-
To analyze both early and contemporary threats to Network Security
-
To understand the concept of Cryptography
-
To know the Network Security tools and applications
-
To understand the system level Security
-
To identify and investigate threats to Network Security
|
Pre-requisites
|
Basic Knowledge of computer, Network Protocols, Computer Security
|
Text Book(s)
| -
NETWORK SECURITY ESSENTIALS: Applications and Standards BY William Stallings – Pearson Publications.
-
NETWORK SECURITY :PRIVATE communication in a PUBLIC world 2nd edition BY Charlie Kaufman, Radia Perlman, Mike Speciner -Prentice Hall of India Private Limited.
|
UNIT –I
Introduction: Attacks, Services and mechanisms, Security Attacks: Passive attacks, Active attacks. Security services: Confidentiality, Authentication, Integrity, Nonrepudation, Access Control, Availability. A model of Network Security, Internet standards and RFCs, viruses, Worms, Trojan Horses, Legal issues. Basic Cryptography: Historical Background, Transposition/Substitution, Caesar Cipher. What is Cryptography: Computational Difficulty, To Publish or Not to Publish, Secret Codes, Breaking an Encryption Scheme: Cipher text only, Known Plaintext, chosen Plaintext. Types of Cryptographic functions: Secret Key Cryptography, Public Key Cryptography, Hash Algorithms, Mathematical tools for Cryptography: Substitution and Permutations, Modular Arithmetic, Euclid’s Algorithm, Finite Fields, Polynomial Arithmetic, Discrete Logarithms
UNIT-II
Secret Key Cryptography: Data Encryption Standard (DES):DES overview, Permutation of the Data, generating the Per-Round Keys, A DES round, The Mangler Function, Weak and Semi-Weak Keys, International Data Encryption Algorithm (IDEA): Primitive operations, Key Expansion, One Round, Inverse Keys for Decryption, Advanced Encryption Standard: Basic Standard, Primitive Operations, Key Expansion, Rounds, Inverse Rounds, Optimization, RC4,RC5,Rijindael (AES) Key Distribution, Modes of Operation: Encrypting a Large Message: Electronic Code Book(ECB),Cipher Block Chaining(CBC),Output Feedback Mode(OFB),Cipher Feedback Mode(CFB), Counter Mode(CTR), Generating MACs: Ensuring Privacy and Integrity together, CBC with a Weak Cryptographic Checksum, CBC , Encryption and CBC Residue with Related Keys, CBC with a Cryptographic Hash, Offset Codebook Mode(OCB). Multiple Encryption DES: How many Encryptions? CBC Outside vs. Inside
UNIT-III
Hashes and Message Digests: Strong and Weak collision resistance, the Birthday Paradox, Nifty things to do with Hash: Authentication, Computing a MAC with a Hash, Encryption with a Message Digest, Using Secret Key for a Hash, MD2,MD4,MD5, SHA-1, HMAC. Public Key Cryptography: Modular Arithmetic, RSA: RSA threats, Public Key Cryptography Standards: Diffie-Hellman, How secure is RSA and Diffe-Hellman? Elliptical Curve Cryptography, Zero Knowledge Proof Systems
UNIT-IV
Authentication: Overview of Authentication Systems: Password based Authentication, Address –Based Authentication, Cryptographic authentication Protocols, Password as cryptographic Keys, Trusted Intermediateries : KDCs. Certification Authorities, Certificate Revocation, Session Key Establishment, Digital Signatures, Digital Signature Standard(DSS and DSA), Authentication of People: Passwords, On-line Password Guessing, Off-Line Password Guessing, Eavesdropping, Initial Password Distribution, Authentication tokens, Physical Access, Biometrics, Security Handshake Pitfalls: Login Only, Mutual Authentication, Integrity/Encryption for Data, Mediated authentication, Picking Random Numbers, Performance Considerations, Authentication Protocol Checklist, Strong Password Protocols: Lamport’s Hash, SRP, Authentication Applications: Kerberos V4, Kerberos V5,X.509
UNIT-V
Real Time Communication Security and IP Security: Session Key Establishment, Perfect Forward Secrecy, Denial of service/Clogging Protection, Endpoint Identifier Hiding, Live partner Reassurance, Session Resumption, Data stream Protection, Negotiating Crypto Parameters, IP Security Overview: Applications of IP Sec, Benefits of IPSec, Routing Applications, IP security Architecture: IPSec Documents, IPSec Services, Security Associations, Authentication Header(AH), Encapsulating Security Payload(ESP), Combining security associations, Key Management: ISAKMP
UNIT-VI
Electronic Mail Security: Pretty Good Privacy(PGP), S/MIME, X.400, Electronic Commerce Security: Electronic Payment Systems, Secure Electronic Transaction(SET), Cyber Cash, Key Protocols, EcashIDigiCash), System Level Security: Intruder Detection, Password Management, Virus Counter Measures, Firewall Design Principals, Digital watermarking and Steganography
GROUP III : THEORETICAL COMPUTER SCIENCE
Subject Code
|
J0302TC01
|
Title
|
Design of Language Processors
|
Work Load Per Week
|
L:3 T:1
|
Examinations
|
Int: 30 Univ: 70
|
Objectives
|
This course aims to cover the main technologies associated with compiling programming languages, viz. lexical analysis, syntax analysis, type checking, run-time data organization and code-generation. Also study fundamental concepts of programming language design, specification, implementation and translation through the very practical exercise of designing, writing, documenting and testing a compiler; to survey the state of the art in compiler theory and design. Students will implement a working a compiler that translates a high-level language into assembly language for the x86.
|
Learning Outcomes
|
At the end of the course students should understand the overall structure of a compiler, and will know significant details of a number of important techniques commonly used. They will be aware of the way in which language features raise challenges for compiler builders.
|
Pre-requisites
|
XII Level Mathematics
|
Text Book(s)
|
Introduction to Computer Theory by Daniel Cohen, Compilers by Ullman
|
Syllabus
|
|
Lec.
Num.
|
Unit Title
|
Details
|
Learning Resources
|
1
|
Review of Mathematical Preliminaries
|
Set
|
Handout
|
2
|
|
Relation and Functions
|
Handout
|
3
|
|
Graph and Trees
|
Handout
|
4
|
|
Principle of induction
|
Handout
|
5
|
|
Alphabets and languages
|
Page 2-7(R1)
|
6
|
Theory of Automation
|
Definition, Description, Transition Graph
|
Page 52-87(R1)
|
7
|
|
DFA,NFA
|
Page 92-140(R1)
|
Lec.
Num.
|
Unit Title
|
Details
|
Learning Resources
|
8
|
|
Minimization of Finite Automata
|
Page 92-140(R1)
|
9
|
|
Equivalence of DFA & NDFA
|
Page 92-140(R1)
|
10
|
|
Moore & Mealy machine
|
Page 149-156(R1)
|
11
|
|
Equivalence of Moore &Mealy
|
Page 149-156(R1)
|
12
|
Regular Expression
|
Definition & Example
|
Page 31-44(R1)
|
13
|
|
Regular set & their closer properties
|
Page 31-44 (R1)
|
14
|
Grammar
|
Definition
|
Page 224-259 (R1)
|
15
|
|
Properties unrestricted grammar & their equivalence
|
Page 224-259 (R1)
|
16
|
|
Derivation trees
|
Page 224-259(R1)
|
17
|
|
Simplifying CFG
|
Page 224-259 (R1)
|
18
|
|
Unambiguifying CFG
|
Page 224-259 (R1)
|
19
|
|
Normal form of CFG
|
Page 224-259 (R1)
|
20
|
|
Chomsky Normal form
|
Page 224-259 (R1)
|
22
|
Introduction to Compiling and one pass compiler
|
Compilers & Translators
|
Page 1-20(R2)
|
23
|
|
Phases of Compilers
|
Page 1-20(R2)
|
24
|
|
Structure of a Compiler
|
Page 1-20(R2)
|
25
|
|
Overview of one pass Compiler
|
Page 25(R2)
|
26
|
|
Error handling
|
Page 25(R2)
|
27
|
Lexical Analysis
|
Role of lexical analyzer, specification of tokens
|
Page 83-92R2)
|
28
|
|
Implementation of lexical analyzer
|
Page 83-92(R2)
|
29
|
Syntax Analysis & Parsing Techniques
|
Phase Tree, Ambiguity of parse Tree
|
Page 159(R2)
|
30
|
|
Bottom up parsing and Top down parsing
|
Page 181-195(R2)
|
31
|
|
LR parsers, constructing SLR and canonical LR parsing tables
|
Page 215-257(R2)
|
32
|
|
Introduction to YACC,LR(1)& LALR Parsers
|
Page 215-257(R2)
|
Lec.
Num.
|
Unit Title
|
Details
|
Learning Resources
|
33
|
Code optimization
|
Folding
|
Page 585-660(R2)
|
34
|
|
Redundant sub-expression evolution
|
Page 585-660(R2)
|
35
|
|
Optimization within iterative loops
|
Page 585-660(R2)
|
36
|
Symbol Table handling techniques
|
Organization for structured and non-structured languages
|
Page 429-440(R2)
|
37
|
Linking and Loading Allocation
|
Various schemes of Linking and Loading
|
Handout
|
38
|
|
Absolute and Relocatable loader
|
Handout
|
39
|
Assembler
|
Statements, simple assembly scheme
|
Handout
|
40
|
|
Design of 2 pass assembler
|
Handout
|
41
|
|
Assembler Implementation
|
Handout
|
42
|
Interpreters
|
Interpreters execution
|
Handout
|
43
|
|
Interpretive languages
|
Handout
|
44
|
|
Structure of interpreter
|
Handout
|
45
|
|
Partial compilation
|
Handout
|
46
|
Editors-line
|
Window, screen editors
|
Handout
|
47
|
|
Stream and structure editors
|
Handout
|
48
|
|
Design and implementation issue
|
Handout
|
Reference Books:
R1: Introduction to Computer Theory by Daniel Cohn
R2: Introduction to Computer Theory by Daniel Cohen, Compilers by Ullmanen
Subject Code
|
J0302TC02
|
Title
|
Advanced Database Technologies
|
Work Load Per Week
|
L:3 T:1
|
Examinations
|
Int: 30 Univ: 70
|
Objectives
|
To study the database concepts which are not covered in earlier course on this topic and thus acquaint the students with some relatively advanced issues such as distributed databases, spatial & temporal database, data warehousing etc.
|
Learning Outcomes
|
At the end of the course students should be able to:
-
Gain an awareness of basic issues in object oriented data models.
-
Learn about the Web Database Management Systems integration technology.
-
Familiarize with data warehousing and other advanced topics as distributed databases, spatial & temporal database.
|
Pre-requisites
|
Thorough knowledge of Database Management Systems.
|
Reference Book(s)
|
A. Fundamentals of Database Systems 3rd Edition by Elmasri & Navathe
B. Database System Concepts by Korth.
C. Database Systems by Thomas Connolly & Carolyn Begg.
D. Data Mining Concepts & Techniques by Jiawei Han & Kamber
E. Data Warehousing by C.S.R. Prabhu
|
Syllabus
|
|
Lec.
Num.
|
Unit Title
|
Details
|
Learning Resources
|
1
|
Object Oriented Database & Object Relational DBMS
|
Overview of Object Oriented Concepts and Characteristics.
|
A- 361 - 363
|
2
|
|
Object identity, Object structure and Type Constructors.
|
A- 363 - 369
|
3.
|
|
Database design for ORDBMS, Comparing RDBMS. OODBMS & ORDBMS
|
B – 288-289
|
Lec.
Num.
|
Unit Title
|
Details
|
Learning Resources
|
4
|
Advanced Concepts in Distributed Databases
|
Introduction, distributed database concepts, Advantages and disadvantages of distributed database.
Data Fragmentation, Replication and allocation techniques for distributed database design.
|
A - 765 – 771
C – 686 - 694
A – 771 - 778
|
5
|
|
Dates 12 rules for distributed databases.
Types of distributed database systems.
|
C- 726 – 728
A – 778 - 781
|
6
|
|
Distributed Database Architecture, Homogeneous distributed database and Heterogeneous distributed database.
|
Hand Outs
|
7
|
|
Query Processing in distributed database.
|
A- 781 - 786
|
8
|
|
Overview of concurrency control and recovery in distributed database.
|
A – 786 - 789
|
9
|
|
An overview of client – server Architecture and its relationship to distributed database
|
A- 789 - 790
|
10
|
Parallel Database
|
Introduction, Parallel database concepts and parallel database architecture.
|
B – 565 & Handouts.
|
11
|
|
I/O Parallelism, Partitioning techniques, Handling of Skew.
|
B – 566 - 569
|
12
|
|
Interquery Parallelism, Intraquery Parallelism & Interoperation Parallelism.
|
B – 568 - 582
|
13
|
|
Design of parallel systems.
|
B – 582 - 583
|
14
|
Active Database
|
Introduction, concepts, Generalized model for active database.
|
A – 734 - 739
|
15
|
|
Design and implementation issues for Active database.
Potential applications for Active database.
|
A – 739 – 741
A - 744
|
16
|
Temporal Database
|
Concepts, Time representation, calendars and time dimensions in temporal database. Time series data.
|
A – 744 - 746
|
17
|
|
Incorporating time in Relational database using Tuple Versioning, Incorporating time in Object oriented database using attribute versioning.
|
A – 747 - 754
|
Lec.
Num.
|
Unit Title
|
Details
|
Learning Resources
|
18
|
Spatial & Geographic Database.
|
Representation of geometric information, design of database and geographic database, Representation and applications of geographic data.
|
B- 710 - 715
|
19
|
|
Indexing of spatial data, K-d Trees, Quad trees and R- trees.
|
|
20
|
Multimedia Database
|
Introduction, similarity based retrieval, continuous media data, multimedia data formats, and video server.
|
A – 759 – 760
B – 719 - 722
|
21
|
Mobile Database
|
Introduction, mobile computing Architecture
|
A – 886 - 887
|
22
|
|
Types of data in mobile application, Data Management issues.
|
A – 888 - 889
|
23
|
Deductive Database
|
Introduction, Applications of deductive database.
|
A – 834 - 835
|
24
|
Web Technology and DBMS
|
Introduction to the internet and web, Internet and Intranet, e- commerce & e- business.
|
C – 934 - 947
|
25
|
|
The web, HTTP, HTML, URL’s, Static and dynamic web pages.
|
C- 949 - 945
|
26
|
|
Web as a database application platforms: Requirements for Web – DBMS integration, Web –DBMS architecture
|
C – 954 - 958
|
27
|
|
Advantages and disadvantages of the Web – DBMS approach, Approaches to integrating the Web and DBMS.
|
C- 958 - 963
|
28
|
|
Web – Database Applications
|
Hand Outs
|
29
|
Data Warehouse
|
Definition, characteristics, benefits and need for a separate data warehouse.
|
D – 39 - 44
|
30
|
|
OLAP and OLTP Systems.
|
D – 43
|
31
|
|
Multidimensional data models: - Tables, spreadsheets and data cubes.
|
D – 44 - 48
|
32
|
|
Schemas for multidimensional data models: - Star, Snowflake and Fact constellation.
OLAP Operations
|
D – 48 – 51
D- 58 - 61
|
Lec.
Num.
|
Unit Title
|
Details
|
Learning Resources
|
33
|
|
Data Marts, Types of data marts, Loading a data mart, Metadata for data Mart, Data model for Data mart, Maintenance of a data mart, Nature of data in data mart, S/W components of data mart.
|
E – 1 - 5
|
34
|
|
Design of data warehouse, Process of data warehouse design. Three tier architecture
|
D- 62 - 69
|
35
|
|
OLAP servers, Data Warehouse back end tools and utilities.
|
D – 69 - 85
|
36
|
|
Data Preprocessing, need and objectives for data preprocessing. Preprocessing Techniques.
|
D – 105 - 108
|
37
|
|
Data Cleaning
|
D – 109 - 112
|
38
|
|
Data Integration
|
D – 112 - 114
|
39
|
|
Data Transformation
|
D - 114 - 116
|
40
|
|
Data Reduction and Discretization
|
D- 116 - 136
|
Subject Code
|
J0303TC03
|
Title
|
High Performance Computing
|
Work Load Per Week
|
L : 3 T : 1
|
Examinations
|
Int:30 Univ:70
|
Pre-requisites
|
|
Text Book(s)
|
Introduction of Parallel Computing Ananth Grama Anshul Gupta George Karypis, Vipin Kumar
Publisher : Addison Wesley
|
Lecture Number
|
Broad topic to be covered
|
Details thereof to be covered
|
1
|
Introduction to Parallel Computing
|
Motivating Parallelism
|
2
|
|
Scope of Parallel Computing
|
3
|
Parallel Programming Platforms
|
Implicit Parallelism: Trends in Microprocessor Architectures
|
4
|
|
Limitations of Memory System Performance
|
5
|
|
Dichotomy of Parallel Computing Platforms
|
6
|
|
Physical Organization of Parallel Platforms
|
7
|
Principles of Parallel Algorithm Design
|
Preliminaries
|
8
|
|
Decomposition Techniques
|
9
|
|
Characteristics of Tasks and Interactions
|
10
|
|
Mapping Techniques for Load Balancing
|
11
|
|
Methods for Containing Interaction Overheads
|
12
|
|
Parallel Algorithm Models
|
13
|
Programming Using the Message-Passing Paradigm
|
Principles of Message-Passing Programming
|
14
|
|
The Building Blocks: Send and Receive Operations
|
15
|
|
MPI: the Message Passing Interface
|
16
|
|
Topologies and Embedding
|
17
|
|
Overlapping Communication with Computation
|
18
|
|
Collective Communication and Computation Operations
|
19
|
|
Groups and Communicators
|
|
|
|
20
|
Programming Shared Address Space Platforms
|
Thread Basics
|
21
|
|
Why Threads?
|
22
|
|
Thread Basics :Creation & Termination
|
23
|
|
Synchronization Primitives in Pthreads
|
24
|
|
Controlling Thread and Synchronization Attributes
|
25
|
|
Thread Cancellation
|
26
|
|
Composite Synchronization Constructs
|
27
|
|
Tips for Designing Asynchronous Programs
|
28
|
Dense Matrix Algorithms
|
Matrix-Vector Multiplication
|
29
|
|
Matrix-Matrix Multiplication
|
30
|
Sorting
|
Issues in Sorting on Parallel Computers
|
31
|
|
Sorting Networks
|
32
|
|
Bubble Sort and its Variants
|
33
|
|
Quicksort
|
34
|
|
Bucket and Sample Sort
|
35
|
|
Other Sorting Algorithms
|
36
|
Graph Algorithms
|
Definitions and Representation
|
37
|
|
Minimum Spanning Tree: Prim's Algorithm
|
38
|
|
Single-Source Shortest Paths: Dijkstra's Algorithm
|
39
|
|
Transitive Closure
|
40
|
|
Connected Components
|
41
|
Search Algorithms for Discrete Optimization Problems
|
Definitions and Examples
|
42
|
|
Sequential Search Algorithms
|
43
|
|
Search Overhead Factor
|
44
|
|
Parallel Depth-First Search
|
45
|
|
Parallel Best-First Search
|
Subject Code
|
J0303TC04
|
Title
|
Simulation modeling
|
Work Load Per Week
|
L:3 T:1 Lab:0
|
Examinations
|
Int: 30 Univ: 70
|
Objectives
|
Computer techniques for simulating the behavior of physical, biological, engineering and social systems, including both natural and artificial systems. Applications include scientific inquiry, engineering design, manufacturing planning, training, entertainment, and games.
|
Learning Outcomes
|
The student will learn the theory of computer simulation and modeling, how it is used, and methods and tools for simulation and modeling and
and be able to model phenomena using discrete and continuous probability distributions, and elements from queuing theory.
They will learn the techniques of pseudo-random number generation, how to test and evaluate generators in a given application, and how to use those generators to model phenomena of interest also computer simulation, conduct input modeling, verification, validation, and output analysis. They will apply knowledge and skills learned on at least one large collaborative modeling and simulation project.
|
Pre-requisites
|
XII Level Mathematics
|
Text Book(s)
|
Simulation Modelling and Analysis by Averill M. Law & David Kelton
|
Syllabus
UNIT -1 Basic Simulation Modeling Introduction, Definition of Modeling and Simulation, Types of Simulation, Steps in simulation study, Application of simulation, Discrete Vs Continuous simulation, Advantage & Disadvantages, Pitfalls, Modeling Complex system, List Processing Simulation, Simulation Language
|
UNIT-2 Simulation Queuing System
Characteristics Performance of Queuing Systems, Steady State Behavior
Networks of Queues, Inventory models, Problem statement, Program organization and Logic
Job shop models, Problem Statement, Simlib Program, Simulation Output
Multiteller Bank with Jockeying, Problem Statement, Simlib Program, Simulation Output
Input Modeling ,Collecting Data, Identifying Distribution, Histograms, Parameter Estimation, Goodness of Fit, Statistical models, Terminology and Concepts, Useful Statistical Models, Statistical Analysis, Distributions
|
UNIT-3 Random Number Generation
|
Properties of Random Numbers, Generation of Pseudo-Random Numbers
Testing for Randomness, Pitfalls, Generating Random Variates, Inverse Transform
Composition Method, Convolution Method, Acceptance-Rejection Technique
Special properties
|
UNIT-4 Simulation Models
|
Introduction & Definitions, Model Details, Developing Simulation Programs
Techniques for Increasing Model Validity & Credibility, Output Data Analysis
Introduction, Steady-State Behavior of a Stochastic Process
Statistical Analysis for Steady-State Parameters
Techniques for Increasing Model Validity & Credibility
|
UNIT-5 Simulation software
|
History, Selection process, Simulation in High Level Language(C, C++, Pascal, FORTRAN)
Simulation packages (Methlab/ Simulink), Interpreted vs. compiled simulators
Future trends, Interpreted vs. compiled simulators, Examples
|
Share with your friends: |
