department of information technology … schedule 2015/ctae...department of information technology ....

DEPARTMENT OF INFORMATION TECHNOLOGY

College of Technology and Engineering, MPUAT, Udaipur

Lecture Plan/Schedule for

IT211 : Digital System & Design (Credit: 3+1)

2015-16 (Theory) Shalini Dutt

Lecture No. Topics(Theory)

1 Features of logic algebra, postulates and theorems of Boolean algebra.

2 Boolean functions drive logic gates: NAND Gate, NOR Gate, Exclusive-OR,

and Exclusive NOR gates.

3 Logical Operations and logic gates, logic circuits,

4 Realizing circuits from Boolean expressions

5 Boolean Algebra Theorems, De Morgan's Theorems, Duality Theorem.

6 Reducing Boolean Expressions by Algebraic reduction,

7 Logic gate conversion, universal gates

8 Essentials of Minimization Techniques: Minterm and Maxterm

9 Canonical Forms

10 Karnaugh Map: Karnaugh Map upto six variables.

11 Prime implicant (PI), Essential Prime implicant (EPI).

12 Minimization Techniques: Simplification of logic function using K-map in

POS and SOP form

13 Incompletely Specified Functions,

14 Mixed (Bubble) logic Combinational Circuits,

15 Quine-McCluskey Minimization technique.

16 Combinational Systems: Combinational circuit Design

17 Arithmetic Circuits: Adders, Subtractor, 2-bit Full-Adder/Subtractor

18 Binary Parallel Adder, BCD Adder, Multiplier, Digital comparator,

19 Decoders, Encoders, Priority Encoder, Multiplexers,

20 Implementation of Boolean Function with Multiplexer, Demultiplexer.

21 Sequential Systems: Latches

22 Flip-flops: SR(Set-Reset) Flip-Flop, Edge- Detector Circuits, Master-Slave S-R

Flip-Flop,

23 J-K flip-flop, Master- Slave J-K Flip-flop, D Flip-Flop, T Flip-flop

24 Conversions of flip-flops

25 Counters: Asynchronous (Ripple) Counters,

26 Propagation Delay in Ripple Counter

27 Asynchronous Counters with Mod Numbers,

28 Synchronous (Parallel) Counters

29 Design of Synchronous Counter

30 Registers: Serial- in/serial- out, Serial- in/parallel- out, Parallel- in/serial out

31 Parallel- in/parallel- out, Bi-directional shift register

32 Ring Counter, Johnson Counter.

33

Semiconductor Memories: Logic Families: Transistor- Transistor Logic

(TTL),

34 Metal-oxide semiconductor (MOS) logic,

35 Characteristics of digital ICs

36 Types and architectures

37 Random access memory (RAM) cells

38 Dynamic memory cell

39 Address decoders, Column address decoder

40 Read only memory (ROM), mask-programmable ROMs

41 SRAM: operation, characteristics, SRAM timing diagram,

42 DRAM: operation, architecture, refreshing.

Faculty:

Shalini Dutt

Department of Information Technology College of Technology and Engineering, MPUAT, Udaipur

Lecture Plan/Schedule for IT212: Shell Programming Lab (Credit: 0+2)

2015-16(Tutorial) Pranav Wadhwani

Pranav Wadhwani Faculty

Lecture No. Topics

1 Introduction to unix operating system

2 Unix Commands : who, date, paaswd, echo

3 Unix Commands : cat, cp, rm, mv, more

4 Unix Commands : ls, cd, pwd, mkir, rmdir

5 Unix Commands : sh, ps, kill, corn

6 Unix Commands : chmod, chown, chgrp

7 Unix Commands : write, mail, finger, pine

8 Simple editors: vi, gedit

9 Designing shell scripts using if, case, expr, sleep , while, until

10 Designing shell scripts using for, redirection, pipe and set constructs

11 Pattern matching in shell

12 Shell variables

13 BASH Shell envioenment variables

14 .profile, &BASH, &system startup scripts

DEPARTMENT OF INFORMATION TECHNOLOGY College of Technology & engineering

MPUAT, Udaipur Lecture Plan/Schedule for

IT 213: Information Technology Paradigms(Credit 3+0)

2015-16 (Theory) Sunil Choudhary

Lecture No. Topic (IT 213Theory)

1 Computers & Communication:The digital age, overview of development in computer

technology.

2 Computers & Communication: communication technology, connectivity & interactivity.

3 Computers & Communication: information Technology ethics.

4 Applications Soft Software, common features of software, examples and features of

word processing.

5 Spreadsheets, database, financial software for Cyberspace, Communication, E-mail,

Web browsers, desktop publishing.

6 Presentation graphics, project management, computer-aided design, drawing and

painting, groupware.

7 Multimedia authoring software, Software Ethics & intellectual property rights.

8 Processors: Microchips, miniaturization & mobility. CPU, main memory

9 Binary system, parity bit, machine language, microcomputer components.

10 Computers future trends. Energyconsumption and “Green PCs”.

11 Storage devices: Storage fundamentals, secondary storage device rating.

12 Diskettes, hard-disks, optical disks, Flash-memory cards.Magnetic tape.

13 Online secondary storage devices, Compression & decompression standards, Secondary

storage future.

14 Telecommunication: Practical uses of communications & connectivity

15 Telephone related communications services: Fax & voice mail,Video/Voice

communications

16 Video conferencing & picture phones. Online information services,

17 Internets & world-wide-web.

18 Sharedresources: Workgroup computing, EDI, Internet

19 New Internet Technologies: Phone, Radio, TV & 3-D.

20 Cyber ethics: Netiquette

21 Controversial material & censorship, privacy issues.

22 Communication technology: Telecommuting, virtual offices & mobile Work space.

23 Analog &digital signals, modems. Communication channels,

24 Communication Networks, Local Networks,

25 Factor affecting communication among devices,

26 Future of communication.

27 Information Systems: Trends forcing change in the workplace.

28 Organizations, department, tasks,

29 management level & types of information,

30 systems analysis & design

31 Software development: Programming concepts,

32 Design of program.

33 Coding & Testing.

34 Documentation & maintenance of program.

35 Generations of programming languages.

36 Examples & features of some programming languages used today.

37 Society & the digital age Information superhighway.

38 Security issues,

39 Safeguarding computers & communications

40 Quality-of-line & economic issues,

41 Benefits of information revolution.

Sunil Choudhary (Faculty) Department of Computer Science

INFORMATION TECHNOLOGY & ENGINEERING

COLLEGE OF TECHNOLOGY AND ENGINEERING MPUAT, UDAIPUR

LECTURE PLAN SCHEDULE For

IT-214: ALGORITHMS & DATA STRUCTURE (Credit 3 + 1) (THEORY) 2015-2016 Kartika Vyas

Lecture No. TOPIC

1 Strings and character data type.

2 Storing strings.

3 String processing

4 Word processing

5 Pattern matching

6 Array, Records & Pointers.

7 Memory representation of arrays.

8 Traversing, insertion & deletion in linear arrays.

9 Linear search, bubble sort, binary search.

10 Multidimensional arrays memory representation and pointer arrays.

11 Record structures & representation.

12 Matrices & Sparse Matrices.

13 Linked Lists memory representation.

14 Traversing, searching in linked lists.

15 Insertion & deletion in linked lists.

16 Header, circular and Two-Way linked lists.

17 Garbage Collection.

18 Array & linked list representation of stacks.

19 Arithmetic expression, polish notation.

20 Application of stack in implementing recursion, Quicksort & Tower of Hanoi.

21 Memory representation & algorithms for queues.

22 Memory representation & algorithms for circular queues.

23 Deques & priority queues

24 Trees, general tree, binary tree.

25 Binary tree traversals & memory representation.

26 Binary search tree representation.

27 BST traversal & searching.

28 BST insertion & deletion.

29 Heap & heap sort.

30 AVL trees, B-Trees representation & operations

31 Application of AVL trees & B-Trees.

32 Graph theory terminology & graph representation.

33 Adjacency Matrix & path matrix.

34 Linked representation of graphs.

35 Shortest path algorithm.

36 Operation on graphs & graph traversals.

37 Spanning tree.

38 Insertion sort, selection sort.

39 merging, merge-sort

40 Hashing: hash functions.

41 Collision resolution.

42 Linear probing & chaining.

Kartika Vyas

Faculty

COMPUTER SCIENCE AND ENGINEERING COLLEGE OF TECHNOLOGY AND ENGINEERING

MPUAT UDAIPUR LECTURE PLAN SCHEDULE FOR

IT 215: PRINCIPLES OF OBJECT ORIENTED PROGRAMMING CREDIT: 2+1

2015-2016 (THEORY) RAJDEEP S. SHAKTAWAT

Lecture No. TOPIC

1 concepts of classes and objects

2 attributes, public private and protected members

3 derieved classes & single and multiple inheritance

4 Enhancements in c++ over c in data types, operators and functions

5 Pragram Structure, functions and cin cout

6 iomanip.h

7 for, while,do while loops, if, if-else, nested if else

8 switch, logical and or and not operators

9 break, continue, goto and exit statements

10 fucntions, declarations, definations returns

11 parameters by values by refrence

12 default arguments, inline functions

13 automatic, external, static,variables.

14 constructors and distructors

15 objects and memory allocations

16 const and classes

17 objects as arguments to functions

18 aaray and strings

19 friend function

20 Functions

21 operator overloading- I

22 operator overloading- II

23 working with class and derived classes

24 single and multiple and multilevel ingeritances and their combinations

RAJDEEP S. SHAKTAWAT Faculty

25 virtual functions

26 pointers to objects

27 input and ouput flags

28 formatting operations

Department of Information Technology College of Technology & Engineering

MPUAT, Udaipur Lecture Plan/ Schedule for

IT 311: APPLICATION OF GRAPH THEORY (Credit 3 + 0)

2015-2016 (Theory) Hemwati Kumawat

Lecture No. Topics

1 Graph Theory: Introduction

2 Application of Graph, Finite and Infinite Graphs

3 Incidence and Degree, Isolated Vertex, Pendant Vertex and Null Graph

4 Paths and Circuits: Isomorphism, Subgraphs

5 Walks, Path and Circuits, Connected Graphs, Disconnected Graphs

6 Components, Eular Graphs

7 Operations on Graphs

8 Hamiltonian Paths and Circuits

9 Travelling Salesman Problem

10 Trees and Fundamentals Circuits: Properties of Trees

11 Pendant Vertices in a Tree, Distance and Centers in a Tree

12 Rooted and Binary Trees, On Counting Trees

13 Spanning Trees

14 Fundamentals Circuits

15 Finding All Spanning Trees of a Graph

16 Spanning Trees in a Weighted Graph

17 Cut – Sets and Cut – Vertices: Cut – Sets, Properties of Cut – Sets

18 Cut – Sets in a Graph, Fundamental Circuits and Cut – Sets

19 Connectivity and Separability, Network Flows

20 1 – Isomorphism,

21 2 – Isomorphism

22 Planer and Dual Graphs: Planer Graphs

23 Kuratowski’s Two Graphs

24 Different representation of a Planner Graph

25 Detection of Planarity

26 Geometric Dual

27 Combinational Dual

28 Matrix Representation of Graphs: Incidence Matrix

29 Matrix Representation of Graphs: Circuit Matrix

30 Matrix Representation of Graphs: Cut – Sets Matrix

31 Matrix Representation of Graphs: Path Matrix, Adjacency Matrix

32 Coloring, Covering and Partitioning

33 Chromatic Number, Chromatic Partitioning

34 Chromatic Polynomial, Matching, Covering

35 The Four Color Problem

36 Directed Graph: Types of Digraphs

37 Binary Relation, Eular Digraphs

38 Trees with Directed Edges

39 Fundamental Circuits in Digraphs

40 Adjacency Matrix of a Digraph

41 Acyclic Digraph and Decyclization

42 Revision and Discussion regarding Important Topics

Hemwati Kumawat Faculty

DEPARTMENT OF INFORMATION TECHNOLOGY College of Technology & Engineering

MPUAT, Udaipur Lecture Plan/schedule for

IT 312 Language Translator and Compiler (Credit: 3+1)

2015-2016 (Theory) Dolly Mendireta

Lecture no. Topic

1 Introduction to Translator requirement, Translator as Interpreter, Assembler,

Preprocessor,

2 Compiler structure,

3 Cousins of compiler, Regular expression

4 finite automata

5 Conversion from regular expression to DFA

6 Minimizing number of states of DFA

7 Role of Lexical Analyzer, Lexical Error detection and recovery

8 Input buffering

9 Role of Parser, Context free grammar

10 Writing a grammar-1

11 Writing a grammar-2

12 Syntactic Error detection and recovery

13 Introduction to Top down Parsing and bottom up parsing

14 Operator Precedence Parsing-1

15 Operator Precedence Parsing-2

16 SLR Parsing-1

17 SLR Parsing-2

18 Canonical LR Parsing-1

19 Canonical LR Parsing-1

20 LALR parsing table-1

21 LALR parsing table-2

22 Ambiguous Grammar

23 Parser generators

24 Syntax directed definition

25 S-attributed and L-attributed definition

26 Type checking

27 Type systems, Semantic errors

28 Intermediate language, Declarations

29 Assignment statements

30 Boolean Expression, ,

31 Case statements

32 Procedure calls

33 Symbol Table- data structure, hash table

34 representing scope information

35 Code Optimization sources

36 Optimization of basic blocks, loops in flow graphs

37 Code Generation: Design of code generator, target machine

38 Basic blocks and flow graph

39 Register allocation and assignment-1

40 Register allocation and assignment-2

41 Code generation from DAG

42 peephole optimization

Dolly Mendireta Faculty

DEPARTMENT OF INFORMATION TECHNOLOGY

College of Technology & Engineering MPUAT, Udaipur

Lecture Plan / Schedule for

IT 313: COMPUTER NETWORK AND INTERNET (Credit: 3+1)

2015-2016 (Theory) Garima Jain

Lecture no.

Topic

1 The theoretical basis for data communication: Fourier analysis, Bandwidth Limited

Signal, The maximum data rate of a channel

2 Magnetic Media, Twisted Pair

3 Coaxial Cable, Fiber Optics

4 The electromagnetic Spectrum, Radio Transmission, Microwave Transmission

5 Infrared and Millimeter, Lightwave Transmission

6 Geostationary Satellites, Medium earth orbit satellites

7 Low earth orbit satellites, Satellites versus Fiber

8 Service provided to the Network layer, Framing

9 Error Control, Flow Control, Error Detection and Correction

10 Error correcting codes, Error detecting codes

11 An Unrestricted Simplex protocol, A Simplex Stop and Wait Protocol

12 A simplex protocol for a noisy channel

13 Sliding Window protocol: A one bit Sliding window protocol

14 A protocol using Go Back N

15 A protocol using selective Repeat

16 High Level Data Link Control

17 Routing principles

18 The Data Link Layer in the Internet

19 Routing principles

20 Link State routing Algorithm

21 A distant Vector routing & OSPF algorithm

22 Concatenated Virtual Circuits

23 Connectionless Internetworking

24 Techniques for Achieving Good Quality of Service

25 Leaky and Token Bucket Algorithms

26 Tunneling

27 Internetwork Routing

28 Fragmentation

29 Network layer in the Internet: IP protocol

30 IP Addresses

31 Internet Control Protocols

32 Transport services

33 Elements of Transport Protocols

34 The Internet Transport Protocols

35 User Datagram Protocol (UDP)

36 Transmission Control Protocol (TCP)

37 The Application Layer

38 DNS-Domain name system

39 Electronics Mail: Architecture and service

40 Simple Mail Transfer Protocol (SMTP)

41 Final Delivery: POPS

42 Intermessage Message Access Protocol (IMAP)

Garima Jain Faculty

College Of Technology & Engineering MPUAT , Udaipur

Lecture Plan/Schedule for IT 314 Management Information System (credit 3+0)

2015-2016 (Theory) Rubina Banu Patel

Lecture No. Topic

1 Introduction: MIS - Concept, Definition, Role of MIS

2 Impact of MIS, MIS and computer, MIS and academies, MIS and User

3 Processes of Management

4 Tutorial

5 Organization Structure & Behavior

6 Basics of MIS : Decision Making- concepts, methods, tools and procedures

7 Information Concepts, classification, methods of collection

8 Tutorial

9 Value of information, human as an information processor,

10 information concepts and their implications, organization and information

11 System Concepts & Control Types of System Handling

12 Tutorial

13 System Complexity

14 Post implementation problems

15 System Development Model

16 Tutorial

17 Structured System Analysis and Design, Computer System Design

18 Development of Management Information system: Requirement and

implementation of MIS

19 Development of long range plans of the MIS

20 Tutorial

21 Ascertaining the class of information

22 Determining the information requirement

23 Development and implementation of the MIS

24 Tutorial

25 Management of quality in the MIS

25 Choice of information technology for Management Information System:

Nature of decision, Strategic Decision,

26 Configuration design,

27 Evolution

28 Tutorial

29 IT implementation plan, choice of IT and MIS.

30 Application of Management Information system:

31 Application in Manufacturing sector using personal management,

32 Tutorial

33 Personal Management

34 Financial management

35 Production Management,

36 Tutorial

37 Material Management,

38 Marketing management Application in Service Sector

38 Enterprise Resource Planning(ERP):

40 Tutorial

41 EMS, ERP,

42 Benefits implementation,

43 Selection and implementation

44 Tutorial

45 EMS & MIS,

46 E-Business Security Control:

47 Threat of accidents and malfunction,

48 Tutorial

49 Threat of computer crime,

50 Factors that increases the risk,

51 Methods of minimizing risk

52 Tutorial

Rubina Banu Patel Faculy



IT 315: Design & Principles of Operating System (Credit 3+1)

2015-16 (Theory) Course Teacher: Sunil Choudhary

Lecture No. Topic (IT 315 Theory)

1 Introduction of OS: Significance of operating system

2 Batch systems,multi-programmed

3 Time sharing systems

4 Storage structure & storage hierarchy

5 System calls, system programs

6 Process scheduling

7 Operation on processes

8 Cooperating processes, scheduling criteria

9 Scheduling algorithms part 1

10 Scheduling algorithms part 2

11 Process Synchronizations

12 critical section problem

13 Synchronization hardware, Semaphores

14 Classical problems of synchronization part -1

15 Classical problems of synchronization part -2

16 Monitors, Atomic transactions.

17 Deadlocks

18 Characterization

19 Handling, Prevention

20 Avoidance and Detection

21 Deadlock Recovery.

22 Memory Management logical versus physical Address spaces

23 Swapping, Contiguous Allocation

24 Paging, Virtual Memory

25 DemandPaging, performance of demand paging

26 Page Replacement algorithms,

27 Allocation of frames, thrashing

28 Input-output Hardware, Application I/O Interface, Kernel I/O Subsystem,

Transforming I/O requests to hardwareoperations.

29 File System Implementation: File System Structure,

30 Allocation Methods, Free space management,

31 DirectoryImplementation, Efficiency and Performance, Recovery.

32 File System: File concepts, access methods.

33 Directory structure, File System Structure

34 Allocation Methods, Free space Management

35 Directory Implementation.

36 Secondary Storage Structure: Disk Structure,

37 Disk Scheduling, Disk Management,

38 Swap-Space Management, DiskReliability,

39 Stable Storage Implementation.

40 Introduction of DistributedSystem

41 Topology, Network types

42 Design issues.

Sunil Choudhary (Faculty) Department of Information Technology

INFORMATION TECHNOLOGY & ENGINEERING COLLEGE OF TECHNOLOGY AND ENGINEERING

MPUAT, UDAIPUR LECTURE PLAN SCHEDULE

For IT-411: ADVANCE DATA STRUCTURE (Credit 3 + 1)

(THEORY) 2015-2016 Kartika Vyas

Lecture No. TOPIC

1 Advanced Tress: Overview

2 2-4 tree: properties, insertion, and deletion.

3 Avl tree: properties, insertion, and deletion.

4 Red-Black tree: properties, insertion, and deletion.

5 Huffman trees: properties, insertion, and deletion.

6 Splay tree: properties, insertion, and deletion.

7 Operations on Disjoint sets.

8 Union-find problem Implementing Sets.

9 Number theoretic algorithm: Overview.

10 Number theoretic notation-I.

11 Number theoretic notation-II.

12 Division theorem.

13 GCD recursion.

14 Modular arithmetic-I

15 Modular arithmetic-II

16 Solving Linear equation.

17 Chinese remainder theorem.

18 Power of an element.

19 RSA public key Crypto system.

20 Primarily Testing.

21 Integer Factorization.

22 Geometric algorithms: Overview.

23 Point location Problem.

24 Finding the closest pair of points.

25 Convex hulls-I.

26 Convex hulls-II.

27 Graph algorithms: Overview.

28 Flows and cuts.

29 Maximum flow- Ford Fulkerson.

30 Maximum bipartite matching.

31 Parallel algorithms: Overview.

32 Basic techniques for sorting-I.

33 Basic techniques for sorting-II.

34 Techniques for searching-I.

35 Techniques for searching-II.

36 Merging list.

37 Ranking in PRAMs.

38 Sorting Networks: Overview.

39 Comparison network.

40 Zero-one principle.

41 Bitonic sorting.

42 Merging network sorter.

Kartika Vyas

Faculty



IT 412: Multimedia Technology & Application (Credit 3+1)

2015-16 (Theory) Course Teacher: NanditaChasta


1 Introduction to Media and Data Steams

2 Medium, Properties ofMultimedia

3 Data stream characteristics of continuous media

4 Information units.

5 Development of Video on Demand System

6 InternetProtocol.

7 QoS Fundamentals

8 QoS parameters Part -1

9 QoS parameters Part -2

10 Optical storage media

11 CD-ROM Technology

12 Compact disk digitalaudio

13 CDROM blocks,Modes

14 Sound / Audio: Audio formats

15 MIDI,Speech

16 Image and graphics: Image format

17 Graphics format, computerImage Processing.

18 Video and Animation: Basic concepts

19 ComputerBasedAnimation

20 Data Compression: JPEG, MPEG

21 Data Compression: H.26X, DVI.

22 Multimedia Communication Systems

23 Session management

24 Transportsubsystem

25 User and application requirements.

26 Transport layer: TCP,UDP, RTP,

27 RCTP, XTP, stream protocol

28 Quality of service and resourcemanagement.

29 The 1Pv4 ToS octet, Integrated Service (lntServ),

30 Differentiate Services (DiffServ),

31 VoD Service System over DiffServe

32 Video Representation, YUV Representation,

33 Video Hierarchy, VideoEncoding,

34 OCT-Based Video Encoding.

35 Inter-frame Coding: MotionEstimation and Compensation

36 Scalable Video Encoding, MPEGFrames,

37 Group of Pictures (GOP), MPEG Video Coding Standards,

38 MPEG-4 Video Transmission over IP

39 DiffServ Video: DifferentiatedService Scheme for MPEG Video Streams,

40 Diffserv Architecture,DiffServ Model,

41 Legacy Packet Markers: Marking Schemes Based onToken Bucket,

42 Scheduling and Queuing Management system.

NanditaChasta (Faculty) Department of Information Technology

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING College of Technology & Engineering,

MPUAT, Udaipur Lecture Plan/schedule for

IT413 Information and Transaction Management (Credit: 3+1)

Session 2015-2016 Kalpana Jain

Lecture no.

Topic

1. Storage and File structure : Introduction and file organization

2. Records in file, RAID

3. Data dictionary. Introduction to indexing

4. Indexing : ordered indexes

5. B+ tree

6. Introduction to Hashing , static hashing

7. Dynamic hashing

8. Multiple key access

9. Concurrency control and transaction : introduction, transaction state

10. Atomicity, durability, concurrent execution.

11. Serializability

12. Isolation, recoverability

13. Lock based concurrency control

14. Time stamp based concurrency control

15. Validation base concurrency control

16. Multiple granularity , introduction to deadlock

17. Deadlock handling

18. Data analysis: decision support system

19. OLAP, warehousing & mining

20. Ware housing and mining

21. Recovery system : introduction

22. Failure classification, storage structure

23. Recovery and atomicity

24. Recovery and atomicity

25. Log based recovery

26. Recovery and concurrent transaction

27. Buffer management

28. Information retrieval : ranking using terms

29. Hyperlinks, synonyms, homonyms

30. Ontologism, document indexing

31. Retrieval effectiveness, web search engines

32. Retrieval and structured data, directories

33. Application development administration: web interfaces

34. Performance tuning, benchmarks, Standardization

35. Advanced querying and information retrieval: Intro

36. Decision support system

37. Data analysis , OLAP

38. Data mining

39. Information retrieval system

40. Advanced data types

Kalpana Jain Assistant Professor



IT 414: Data Mining (Credit 3+1)

2015-16 (Theory) Course Teacher: Sunil Choudhary


1 Introduction to Data Mining & Data Processing

2 Functionalities, classification, issues,

3 Data warehouses and OLEP technology-definition,

4 Multimedia data model, data warehouse architecture,

5 Data warehouse implementation.

6 Data Processing

7 Data cleaning

8 Data integration and transformation

9 Data reduction, discretization

10 Concept hierarchy generation.

11 Data mining primitives,

12 Languages and system and architectures

13 Datamining Task, query language.

14 Characterization and comparison-conceptdescription,

15 Data generalization

16 Summarization- Based Characterization.

17 Analytical characterization-

18 Attribute relevance analysismethods mining association rules in large

database

19 Concepts, mining single-Dimensional Boolean association rules from

transactiondatabase Part -1

20 Concepts, mining single-Dimensional Boolean association rules from

transactiondatabase part - 2

21 Constraint based association mining.

22 Classification and Prediction: definition,

23 Decision tree induction classification,

24 Bayesian classification,

25 Back propagation

26 Classifier accuracy.

27 Cluster Analysis: definition,

28 Data types, categorization,

29 Hierarchical methods,

30 Density based methods, grid-based methods

31 Model based clustering methods.

32 Mining Complex Types of Data

33 MultidimensionalAnalysis and

34 descriptive mining of complex objects part -1

35 descriptive mining of complex objects part - 2

36 Mining spatial databases Part - 1

37 Mining spatial databases Part – 2

38 Multimedia databases,

39 time series and sequence data,

40 WWW.

41 Datamining application,

42 Trends in data mining.

Sunil Choudhary (Faculty) Department of Information Technology

COMPUTER SCIENCE AND ENGINEERING COLLEGE OF TECHNOLOGY AND ENGINEERING

MPUAT UDAIPUR LECTURE PLAN SCHEDULE FOR

IT 415(b): INFORMATION SECURITY CREDIT: 3+1 2015-2016 (THEORY) RAJDEEP S. SHAKTAWAT

Lecture No. TOPIC

1 Need for security

2 secuirty approaches

3 principle of security

4 types of attacks

5 cryptography techniques: Plain text and cipher text

6 subsitution techniques

7 Transposition techniques

8 Encryption and decryption

9 symmetric and Asymmetric cryoptography

10 steganography, key range and key size

11 symmetric Algorithms: Algorithms types and modes

12 overview of symmetric key cryptography

13 data encryption standard

14 International data encryption algorithm

15 advance encryption standard - I

16 advance encryption standard - II

17 Asymmetric key cryptographic algorithm: Overview

18 RSA algorithm - I

19 RSA algorithm - II

20 Digital signature

21 Message digest algorithms: overview

22 MD5

23 Public key Infrasructure: overview

24 Message authentication code

25 digital certificates

RAJDEEP S. SHAKTAWAT Faculty

26 private key management

27 Authentication: overview

28 password authentication

29 tokens

30 certificate based authentication

31 biometric authentication

32 kerberos

33 Internet security Protocols: overview

34 Secure socket layer (SSL)

35 Secure electronic transation(SET)

36 SSL verses SET

37 electronic money

38 Email security

39 Wireless application Protocol (WAP)

40 Network security: IP security

41 Firewalls

42 Virtual Private Network

department of information technology … schedule 2015/ctae...department of information technology ....

Documents