DEPARTMENT OF INFORMATION TECHNOLOGY … SCHEDULE... · Lecture No. Topic 1 ... 11 8086: Pin...

DEPARTMENT OF INFORMATION TECHNOLOGY College of Technology & engineering

MPUAT, Udaipur

Lecture Plan/Schedule for

IT 221: Computer Organization & Architecture (Credit 3+1)

2015-16 (Theory) Nandita Chasta

Lecture No. Topic

1 Register Transfer Language

2 Data Movement around registers

3 Data Movement from/to Memory

4 Tutorial

5 Logic Micro operations

6 Concept of bus

7 Timing in register transfer

8 Tutorial

9 CPU Organization

10 Addressing Modes

11 Instruction Format

12 Tutorial

13 CPU organization with large registers

14 Stack and Handling of Interrupts

15 Subroutine and Instruction Pipelining

16 Tutorial

17 Arithmetic Algorithms: Array Multipler

18 Both’s Algorithm

19 Addition and Subtraction of Signed numbers

20 Tutorial

21 Addition and Subtraction of Unsigned numbers

22 Addition and Subtraction of 2’s compliment numbers

23 Microprogrammed Control Unit: Basic Organization

24 Tutorial

25 Horizontal and Vertical Formats

26 Address sequencer

27 Memory Organization

28 Tutorial

29 Memory Technology, Types

30 Performance, Access modes

31 RAM organization and Design

32 Tutorial

33 Auxiliary Memory Access methods

34 Auxiliary Memory Organization

35 Magnetic Disks types

36 Tutorial

37 Optical Memories

38 Memory Hierarchies

39 Associative Memory

40 Tutorial

41 Cache Memories: Organizations

42 Cache Memories: mapping

43 Principle of virtual Memory

44 Tutorial

45 Segmentation and Paging

46 I/O organizations: Introduction to peripherals

47 Peripherals interface

48 Tutorial

49 Strobe based communication

50 Handshake based communication

51 DMA based transfer and I/O processors

Tutorial

52 Introduction to SIMD and MIMD

53 Array Processors

54 Pipeline Architecture

Total 54

Nandita Chasta

(Faculty)

DEPARTMENT OF INFORMATION TECHNOLOGY College of Technology & Engineering

MPUAT, Udaipur


IT 222: Microprocessors & Interfacing (Credit 3+2)

2015-16 (Theory) Sunil Choudhary

Lecture No. Topic

1 Introduction of microprocessors

2 8085 microprocessor: Block diagram and Pins diagram

3 Pins and their function de-multiplexing of bushes

4 Control signals and pins a flags

5 Introduction to 8085 based microcomputer system

6 Instruction and Timings

7 Instruction format

8 Instruction classification

9 Addressing modes

10 Instructions and timing diagram.

11 8086: Pin diagram and internal architecture.

12 8088: Pin diagram and internal architecture.

13 Assembly Language and Programming in 8085 Part - I

14 Assembly Language and Programming in 8085 Part - II

15 Instruction set Part - I

16 Instruction set Part - II

17 Program structures (sequential, conditional, iterative) Part - I

18 Program structures (sequential, conditional, iterative) Part - II

19 Macros and subroutines Part -I

20 Macros and subroutines Part -II

21 Stacks

22 Counter

23 timing delay

24 Interrupt structure

25 Interrupt Programming

26 Devices and Interfacing

27 Interfacing of Memory

28 I/0 Devices

29 Architecture characteristics and interfacing to 8085

30 DMA controller 8257

31 Interrupt Controller 8259A

32 USART 8251

33 PPI 8255

34 Timer 8254 (8253)

35 Keyboard display controller 8279

36 Programming and operation of 8254 (8253)

37 PPI 8255

38 ADC interfacing with 8085 microprocessor

39 DAC interfacing with 8085 microprocessor

40 Level Converters MC 1488

41 Level Converters MC 1489

42 Communication buses

43 Centronics

44 IEEE 488

45 Current loop

46 RS 232 C

47 RS 422 A

48 RS 423 A

Total 48

Sunil Choudhary

(Faculty)

INFORMATION TECHNOLOGY & ENGINEERING

COLLEGE OF TECHNOLOGY AND ENGINEERING

MPUAT, UDAIPUR

LECTURE PLAN SCHEDULE

For

IT-223: OBJECT ORIENTED PROGRAMMING (Credit 3 + 2)

(THEORY) 2015-2016

Course Teacher: Kartika Vyas

Lecture No. TOPIC

1 Introduction to Object-oriented programming: encapsulation,

polymorphism, inheritance.

2 Header files, structures, unions, anonymous unions.

3 Inline function, static data members and static member functions, scope

resolution operator.

4 Namespaces, Friend function.

5 Array of objects, pointer to objects, reference parameters, passing objects

to functions, returning objects,

6 Object assignment, passing references to objects, returning references,

independent references.

7 C++ dynamic allocation operators, this pointer

8 Constructor: default constructor, parameterized constructors.

9 Constructor: copy constructor, default arguments.

10 Objects & memory allocation, dynamic constructors.

11 Function overloading: overloading function.

12 Overloading constructor functions.

13 Function overloading & ambiguity.

14 Operator overloading: member operator functions.

15 Operator overloading using a friend function

16 Overloading new & delete.

17 Inheritance: Base-Class access control,

18 Inheritance and protected members.

19 Inheriting from multiple base classes

20 Execution of constructors & destructors in inheritance

21 Passing parameters to Base- Class Constructors.

22 Virtual Base classes.

23 Virtual functions & polymorphism: calling a virtual function through a

Base Class.

24 Hierarchical virtual functions

25 Pure virtual functions & Abstract classes.

26 Overloading << & >>.

27 C++ I/O: C++ streams, formatted I/O.

28 Formatting I/O using manipulators,.

29 Templates: generic functions, overloading function template.

30 Template classes, using default arguments with template classes

31 Explicit class specializations.

32 Exception Handling: catching class types.

33 Using multiple catch statements.

34 Handling derived class exceptions.

35 Restricting exceptions, rethrowing an exception.

36 C++ File I/O: fstream & file classes.

37 Opening, closing, reading & writing text files.

38 Unformatted and Binary I/O.

39 Detecting EOF, random access of file.

40 Introduction to java and advantages of java

41 Java virtual machine, java byte code.

42 Importance of java in internet

DEPARTMENT OF INFORMATION TECHNOLOGY

College of Technology & Engineering

MPUAT, Udaipur

Lecture Plan/schedule for

IT 321: Data Modeling and Design (Credit 3 + 1)

2015-2016 (Theory) Course Teacher: Hemwati Kumawat

Lecture No. Topic

1 Applications of database

2 Database system and file system

3 View, models of database

4 Database languages, transaction management

5 System structure, users of database

6 Data models: Entity relationship model: concepts, constraints, keys

7 Design issues of ER, ERD

8 Weak entity, ER symbols, ER-schema to tables

9 Relational algebra: structure

10 Tuple relational calculus

11 Domain relational calculus.

12 Relational databases: structured Query language-structure, set operation,

13 Aggregate functions, Null values

14 Nested sub queries, views

15 Complex queries part 1

16 Complex queries part 2

17 Joined relations

18 DDL, DML

19 Database modification

20 Embedded structured query language part 1

21 Embedded structured query language part 2

22 Dynamic structured query language part 1

23 Dynamic structured query language part 2

24 Database Integrity and Security: domain constraints, referential integrity,

25 Database Integrity and Security: assertions, triggers.

26 Relational Database design : First Normal Form, Functional Dependencies

27 Relational Database design : Decomposition-properties

28 Relational Database design : Second Normal Form

29 Relational Database design :Third Normal Form

30 Relational Database design : Boyce-codd Normal Form

31 Relational Database design : Fourth Normal Form

32 Relational Database design : more normal form, design process.

33 Object relational Databases: nested relations part 1

34 Object relational Databases: nested queries part 2

35 Object relational Databases: complex types

36 Object relational Databases: inheritance, reference types

37 Object relational Databases: query with complex types part 1

38 Object relational Databases: query with complex types part 2

39 Object relational Databases: functions and procedure

40 Object relational Databases: object oriented and object relational.

41 introduction to object oriented database

42 Query Processing

43 Optimization Physical Database Design in Relational Databases

44 concepts of Database Tuning in Relational Systems


2015-2016 (Practical) Course Teacher: Hemwati Kumawat

Practical

No

Topic

1 Sample database with Microsoft Access for basic understanding

of Tables, Records and Fields

2 Queries with and without Primary Key and Referential

constraints

3 Study ER Diagram

4 Bank Database

5 Create a Database of a company

6 SQL Create Queries for the Company Database with proper

Referential Constraints

7 SQL Alter Command with Option of add column, add

constraints , drop column for Company Database

8 Basic Queries in SQL: The Select From Where structure of

Basic SQL Queries

9 Basic Queries in SQL: Ambiguous Attribute Names, Aliasing

10 Unspecified WHERE Clause and Use of (*) Asterisk, Queries

as Tables as Sets in SQL (Union, Except, Intersection)

11 Queries of substring pattern matching and Arithmetic

Operators, SQL Queries for Ordering

12 Nested Queries, Queries: Exists and Not Exists Functions

13 Nested Queries, Queries: Joined Tables (with explicit Join,

Natural Join)

14 Queries with a use of Aggregate functions, Queries with Group

by and Having Clauses

15 Queries of Update and Delete Command

16 Sample form Design of Students details and connected with

database, having Insert, display functions

TOTAL

Practical List


Course Teacher: Hemwati Kumawat

S.No Topic

1. Sample database with Microsoft Access for basic understanding of Tables, Records and Fields.

2. Queries with and without Primary Key and Referential constraints.

3. Study ER Diagram, Bank Database.

4. Create a Database of a company

5. SQL Create Queries for the Company Database with proper Referential Constraints.

6. SQL Alter Command with Option of add column, add constraints, drop column for Company

Databse.

7. Basic Queries in SQL:

i) The Select From Where structure of Basic SQL Queries.

ii) Ambiguous Attribute Names, Aliasing.

iii) Unspecified WHERE Clause and Use of (*) Asterisk.

iv) Queries as Tables as Sets in SQL (Union, Except, Intersection).

v) Queries of substring pattern matching and Arithmetic Operators.

vi) SQL Queries for Ordering

vii) Nested Queries.

viii) Queries: Exists and Not Exists Functions

ix) Joined Tables (with explicit Join, Natural Join)

x) Queries with a use of Aggregate functions

xi) Queries with Group by and Having Clauses

xii) Queries of Update and Delete Command

8. Sample form Design of Students details and connected with database, having Insert, display

functions.



MPUAT, Udaipur


IT 322 Computer Algorithm (Credit: 3+1)

2015-2016 (Theory) Pallavi Joshi

Lecture No. Topic

1. Algorithms concepts, analysis, design,

2. asymptotic notations

3. Recurrence- substitution method

4. Recurrence tree method

5. Masters method

6. Probabilistic analysis and randomized algorithm

7. Probabilistic analysis and randomized algorithm

8. Hiring Problem, indicator random variables

9. Randomized algorithms

10. Data Structures: Hash tables, direct address tables.

11. Hash table functions, open addressing

12. Binary search tree: definition , querying

13. Binary search tree insertion deletion

14. Red- Black tree: Properties, rotation

15. Red- Black tree: insertion deletion

16. Oder statistics: Heap sort

17. Quick sort

18. Sorting in linear time

19. Median and order static`s

20. Binomial heaps: Binomial tree, Binomial heaps

21. Binomial heaps: Binomial tree, Binomial heaps operations

22. Advance design analysis and techniques: Dynamic Programming

23. Dynamic Programming: Elements, assembly line scheduling

24. Matrix chain multiplication

25. Longest Common subsequence

26. Linear Programming: Standard and slack form

27. Linear Programming: Standard and slack form

28. Formulating problems as linear programming

29. Simplex Algorithm

30. Approximation algorithm: Vertex cover problem

31. Vertex cover problem

32. Set covering problem

33. Floyd- Warshall Algorithm

34. Graph algorithms: BFS, DFS

35. Topological sort

36. Minimum Spanning Trees

37. Kruskal and Prim`s Algorithm

38. Kruskal and Prim`s Algorithm

39. Single source Shortest path- Bellman Ford algorithm

40. Single source Shortest path- Bellman Ford algorithm

41. Dijkastra`s Algorithm

Pallavi Joshi

Faculty

Department of Information Technology

College of Technology and Engineering, MPUAT, Udaipur

Lecture Plan/ Schedule for

IT323: Internet Programming with Java (credits: 3+2)

2015-16(Theory) Pranav Wadhwani Lecture No Topic

1 Introduction to Java, Advantages of Java

2 JVM

3 Java Bytecode

4 Encapsulation, Abstraction

5 Polymorphism

6 Operators, Operators Precedence

7 Control Statements

8 Objects

9 Class in Java

10 Inner class

11 Static nested class

12 Anonymous and Local class

13 Inheritance: Member Access, Types of Inheritance

14 Method Overriding

15 Dynamic Method Dispatch

16 Abstract Classes

17 Using Final with Inheritance

18 Packages in Java

19 Access Protection and Importing Packages

20 Interfaces

21 Implementing multiple inheritance scenario using interfaces

22 Problems while implementing multiple inheritance scenario

23 Exception handling, try and catch block

24 Multiple catch blocks

25 Nested try statements

26 throw, throws, finally block

27 Using built-in exception classes and creating your own exception classes

28 Multithreaded Programming: Java thread model

29 Creating a thread, creating multiple threads

30 Thread priorities, Thread Group

31 Synchronization

32 Interthread Communication

33 Deadlock

34 Java I/O Classes and Interfaces

35 Stream Classes

36 Byte stream, Character stream

37 Stream I/O

38 Serialization

39 Applets

40 Applet Life cycle

41 Creating applets

42 Event Handling

43 Event Delegation Model

44 AWT- Frame, Panel, Containers and Components

45 AWT Layout Managers

46 Introduction to Swing

47 Swing’s features

48 Using Swing API

Department of Information Technology

College of Technology and Engineering, MPUAT, Udaipur

Lab Plan/ Schedule for

IT323: Internet Programming with Java (credits: 3+2)

2015-16(Lab) Pranav Wadhwani Lab No Objective

1 Program to find sum, average, minimum and maximum of N numbers using

command line arguments.

2 Program to find Simple Interest using command line arguments.

3 Program to take numeric input using Scanner Class and find:

(1) Prime and non-prime numbers in the input array of n numbers.

(2) Factorial of n numbers in the input array of n numbers.

4 Program to take numeric input using Scanner class and then perform Bubble

sort on the input array of n numbers.

5 Program to take numeric input using Scanner class and then perform Binary

Search on the input array (sorted) of n numbers.

6 Program to take a numeric input value using Scanner class and compute

factorial of the entered value using recursion.

7 Program to demonstrate the byte data type and operations.

8 Program to demonstrate the use of Variable-Length arguments and ambiguity

caused due to overloaded varargs method.

9 Program to demonstrate the implementation of Interfaces in Java.

10 Program to implement Fixed Size and Growable Size Stack using Interface.

11 Program to implement ArrayList Class using built-in ArrayList's Collection

methods: add(), remove(), toArray(), contains(), set().

12 Program to implement ArrayList Class and its methods: add(), get(),

increaseListSize(), remove(), size(), set(), toarray(); without using ArrayList's

Collection built-in methods

13 Program to implement LinkedList Class using built-in LinkedList's Collection

methods: add(), get(), size(), remove().

14 Program to implement LinkedList Class methods: add(), get(), size(), remove(),

without using built-in LinkedList's Collection methods.

15 Demo Programs to show the use of Super Keyword.

16 Program to implement String Class using built-in String Class's methods:

charAt, compareTo, concat, compareToIgnoreCase, contentEquals,

copyValueOf, endsWith, equals, getChars, matches, replace, replaceAll,

toLowerCase, toUpperCase, substring, toCharArray, valueOf.

17 Program to demonstrate the use of intern() method of String Class.

18 Program to implement Vector Class using built-in Vector Class's methods: add,

clone, addAll, containsAll, size, subList, toArray, retainAll, Iterator (hasNext,

next, remove) Enumerator (hasMoreElements, nextElement) .

19 Program to demonstrate Polymorphism - Part 1

20 Program to demonstrate Polymorphism - Part 2

21 Program to show that static method cannot be overridden in java

22 Program to check whether we can override private methods in Java.

23 Program to show: What happens when more restrictive access is given to a

derived class method in java.

24 Program to demonstrate that in calling chain (during Stacktrace) Unchecked

Exceptions are forwarded by default.

25 Program to demonstrate that in calling chain (during Stacktrace) Unchecked

Exceptions are forwarded by default.

26 Program to show that checked exceptions can be propagated using throws

keyword.

27 Program to demonstrate Exception Handling with Method Overriding when the

superclass method does not declare an exception.

28 Program to demonstrate Exception Handling with Method Overriding when the

superclass method does not declare an exception.

29 Program to demonstrate exception chaining.

30 Program to demonstrate the use of nested-try statements.

31 Program to demonstrate the use of multiple catch statements and unreachable

catch problem.

32 Program to create a custom or user-defined exception.

33 Program to demonstrate the use of finally block.

34 Program to create and invoke a thread object by extending the standard Thread

class.

35 Program to create and invoke a thread object by implementing Runnable

interface.

36 Program to demonstrate the need of Synchronized keyword in program which

may or may not print counter value in sequence and every time we run it, it

produces different result based on CPU availability to a thread.

37 Program to demonstrate the use of Synchronized keyword to print counter value

in sequence and every time we run it.

38 Program to show how two thread can communicate (InterThread

Communication) using wait() and notify() method.

39 A program with multiple threads performing concurrent operations.

40 A Program to show a typical invocation of banking operations via multiple

threads.

41 A program which shows altering order of threads by changing priority.

42 Program to implement Producer-Consumer problem with the wait() and notify()

methods.

43 Program to show the InterThread Communication using PipedStream Classes.

44 Program to design a simple Calulator using Applet.



MPUAT, Udaipur


IT 324: Computer Graphics (Credit 3 + 1)

2015-2016 (Theory) Course Teacher: Hemwati Kumawat

Lecture

No.

Topic

1 Refresh cathode-ray tubes

2 Raster-Scan Displays

3 Random-Scan Displays

4 Color CRT Monitors

5 Direct-View Storage Tubes

6 Flat-Panel Displays part 1

7 Flat-Panel Displays part 2

8 Video Controllers, Raster-Scan Display Processors

9 Random- Scan Systems, Graphics Monitors and Workstations.

10 Keyboards, Mouse ,Trackball and Spaceball

11 Joysticks, Digitizers

12 Image Scanners,Touch Panels, Light Pens, Voice Systems

13 Hard-Copy Devices and Graphics software.

14 Output Primitives : Points and lines , line-drawing algorithms

15 DDA algorithms, Bresenham’s line algorithms

16 Parallel line algorithms, loading the frame buffer

17 Line function, properties of circles

18 Midpoint circle algorithms

19 Ellipse-generating algorithms, properties of ellipse

20 Midpoint ellipse algorithms.

21 Pixel addressing and object geometry

22 Boundary-fill algorithms

23 Flood-fill algorithms and Character generation

24 Attributes of output primitives: Line, curve attributes color and grayscale levels

25 Attributes of output primitives : area-fill, character attributes.

26 Bundled Attributes, enquiry functions.

27 Two dimensional geometric transformation: Translation

28 Two dimensional geometric transformation: Rotation

29 Two dimensional geometric transformation: Scaling

30 Matrix Representations Homogeneous Coordinates

31 Composite Transformations: Translations

32 Composite Transformations: Rotations

33 Composite Transformations: Scaling

34 Composite Transformations: Reflection, Shear

35 Three-Dimensional Geometric and Modeling Transformations: Translation,

rotation

36 Three-Dimensional Geometric and Modeling Transformations: scaling,

reflections

37 Three-Dimensional Geometric and Modeling Transformations: modeling and

coordinate transformations

38 The Viewing Pipeline

39 Viewing Coordinate

40 Reference Frame, Window-to-Viewport Coordinate Transformation

41 Two-Dimensional Viewing Functions

42 Clipping Operations, point Clipping

43 Cohen-Sutherland Line Clipping

44 Liang-Barsky Line Clipping

45 Nicholl-Lee-Nicholl Line Clipping

46 Line Clipping using Nonrectangular Clip Windows

47 Splitting Concave Polygons

48 Polygon Clipping


2015-2016 (Practical) Course Teacher: Hemwati Kumawat

Practical

No

Topic

1 Write a program to change background color.

2 Write a program to write a name using san serif font.

3 Write a program to draw a Indian flag.

4 Write a program to implement human face(eyebro, eye ,ears, nose

and lips)

5 Write a program to draw a moving wheel.

6 Write a program to simulate traffic light.

7 Write a program to draw line using DDA line draw algorithm

8 Write a program to draw line using bresenham’s line draw algorithm

9 Write a program to draw ellipse using midpoint ellipse algorithm.

10 Write a program to draw circle using midpoint circle and algorithm.

11 Write a program to fill area using flood fill algorithm

12 Write a program to fill area using boundary fill algorithm

13 Write a program to fill area using fillarea function.

14 Write a program to implement rotation of a line.

15 Write a program for translation of a triangle.

16 Write a program for scaling of a triangle.

TOTAL


Course Teacher: Hemwati Kumawat

Practical List

1. Write a program to draw line using DDA line draw algorithm.

2. Write a program to draw line using bresenham’s line draw algorithm.

3. Write a program to draw circle using midpoint circle algorithm.

4. Write a program to draw ellipse using midpoint ellipse algorithm.

5. Write a program to fill area using flood fill algorithm

6. Write a program to fill area using boundary fill algorithm

7. Write a program to fill area using fill area function.

8. Write a program for translation of a triangle.

9. Write a program for scaling of a triangle.

10. Write a program to implement rotation of a line.

11. Write a program to write a name using san serif font.

12. Write a program to change background color.

13. Write a program to simulate traffic light.

14. Write a program to draw a moving wheel.

15. Write a program to draw a Indian flag.

16. Write a program to implement human face.(eyebro, eye ,ears, nose and lips)



MPUAT, Udaipur


IT 421: Net Centric Computing (Credit: 3+1)

2015-16 (Theory) Vishal Jain

Lecture

No.

Topic

1. Unit-1: Network and internetworking: types of network

2. Unit-1: Network principles

3. Unit-1: Internet protocols

4. Unit-1: Characterization of distributed computing.

5. Unit-1: Design issues of distributed computing.

6. Unit-1: IPC in unix.

7. Unit-1: External Data Representation.

8. Unit-1: Remote procedure calls.

9. Unit-1: Remote method invocation.

10. Unit-1: Distributed garbage collection.

11. Unit-2: Distributed File System.

12. Unit-2: File service architecture.

13. Unit-2: Sun network file system.

14. Unit-2: Continued…….Sun network file system.

15. Unit-2: Andrew File system.

16. Unit-2: Continued…….Andrew File system.

17. Unit-2: Name Services: domain name system.

18. Unit-2: Continued….domain name system.

19. Unit-2: Directory & discovery services.

20. Unit-2: Continued…….directory & discovery services.

21. Unit-2: Global name service.

22. Unit-2: X.500 directory service.

23. Unit-3: Time & global states: clocks.

24. Unit-3: Events, process states.

25. Unit-3: Synchronizing physical clock.

26. Unit-3: Continued….. synchronizing physical clock.

27. Unit-3: Continued….. synchronizing physical clock.

28. Unit-3: Logical time and logical clocks.

29. Unit-3: Continued…… Logical time and logical clocks.

30. Unit-3: Coordination and agreement: Distributed mutual exclusion.

31. Unit-3: Continued….. Coordination and agreement: Distributed mutual exclusion.

32. Unit-3: Continued…… Coordination and agreement: Distributed mutual exclusion.

33. Unit-3: Distributed Elections.

34. Unit-3: Continued….. Distributed Elections.

35. Unit-3: Continued….. Distributed Elections.

36. Unit-4: Transaction & concurrency control: transactions.

37. Unit-4: Continued….transactions.

38. Unit-4: Nested transactions.

39. Unit-4: Locks.

40. Unit-4: Optimistic concurrency control.

41. Unit-4: Timestamp ordering.

42. Unit-4: Distributed transactions: flat and nested distributed transactions.

43. Unit-4: Continued…. flat and nested distributed transactions.

44. Unit-4: Atomic commit protocols.

45. Unit-4: Concurrency control in distributed transactions.

46. Unit-4: Distributed deadlocks.

47. Unit-4: Transaction recovery.

48. Unit-4: Continued….. Transaction recovery.

Vishal Jain

Guest Teacher



MPUAT, Udaipur

Lecture Plan/ Schedule for

IT 422: E-Commerce (Credit: 3-0-0)

2015-16 (Theory) Miss. Himani Jain

Lecture No. Topic

1 Introduction to e-commerce, Scope of electronic commerce,

2 e-commerce and trade cycle, electronic markets, EDI and internet commerce

3 E-commerce in perspective.

4 Introduction to Business Strategy in an Electronic Age

5 Value Chain-supply chains, Porter’s value chain model and Inter-

Organizational value chains.

6 Competitive Advantage- Competitive Strategy, Porter’s Model,

7 First Mover advantage and competitive advantage using e-commerce

business strategy,

8 Introduction to Business Strategy,

9 Strategic Implications of IT technology.

10 E-commerce: Implementation and evaluation.

11 Web booking systems and competitive outcomes.

12 Introduction to Business-to-Business Electronic Commerce

13 Inter-Organizational Transaction,

14 The credit Transaction Trade cycle.

15 A variety of transactions.

16 Introduction to Electronic Markets

17 Markets and electronic markets, usage of electronic markets

18 Advantages and disadvantages of electronic markets.

19 Introduction to Electronic Data Interchange (EDI)

20 Definition and benefits of EDI

21 EDI technology and standards

22 EDI communication

23 EDI implementations

24 EDI agreements and securities.

25 EDI trading pattern and transactions

26 EDI Adoption and EDI Maturity

27 IOS, EDI, and Internet e-commerce

28 Introduction to Inter-Organizational e-commerce

29 Transactions, Purchasing Online, After Sales Online,

30 E-commerce in Desktop Facilities Management.

31 Introduction to Business-to-Consumer Electronic Commerce

32 Introduction to Consumer Trade Transactions

33 A page on Web, HTML,

34 Client side Scripting, Server side Scripting

35 The Elements of e-commerce

36 e-Visibility, The e-shop

37 Online Payments, Delivering the goods,

38 After Sales Service,

39 Internet e-commerce Security,

40 A Website Evaluation Model.

HIMANI JAIN

Faculty


MPUAT, Udaipur

Lecture Plan/Schedule for IT 423(e): PARALLEL AND DISTRIBUTED DATABASE (Credit: 3+1)

2015-16 (Theory) Course Teacher: Garima Jain

Lecture No.

TOPIC

1 Parallel database systems

2 Parallel database architecture

3 Parallel database functional aspects

4 Parallel DBMS techniques: data placement

5 Query parallelism

6 Parallel data processing

7 Parallel query optimization

8 Parallel execution: initialization, interferences and convoy effect

9 Load balancing and performance evaluation for hierarchical

architecture

10 Distributed database issues and challenges

11 Distributed database architecture, client/server architecture

12 Peer-to-Peer architecture, MDBS architecture

13 Distributed database design, top-down design

14 Bottom-up design

15 Horizontal fragmentation

16 Vertical Fragmentation

17 Hybrid Fragmentation

18 Allocation issues

19 Information requirement

20 Allocation model

21 Semantic data control

22 View management

23 Data security

24 Semantic integrity control

25 Query processing

26 Decomposition and Localization

27 Query processing objectives

28 Query processors characterization- types of optimization

29 Optimization timing, statistics, decision sites

30 Network topology and query processing

31 Replicated fragments, use of semi joins.

32 Query processing layers, query decomposition- normalization,

analysis, redundancy

33 Localization- primary horizontal fragmentation, vertical

fragmentation,

34 Derived fragmentation, hybrid fragmentation

35 Distributed transaction management: definition

36 Transaction properties-Atomicity, consistency, isolation,

durability.

37 Transaction issues- flat transaction, nested transactions, workflows

38 Distributed concurrency Control

39 taxonomy of concurrency control

40 Serializability, locking-base concurrency control

41 Timestamp-based concurrency control, optimistic concurrency

control

42 Relaxed concurrency control, deadlock


MPUAT, Udaipur

Lecture Plan/Schedule for IT 423(e): PARALLEL AND DISTRIBUTED DATABASE (Credit: 3+1)

2015-16 (Practical) Course Teacher: Garima Jain

Practical

No.

Topic

1. Queries on functions with and without parameters

2. Queries on user defined procedures with and without parameters

3. Queries on cursors, triggers, sequences

4. Queries to implement multiple return statements, recursive function

5. Queries on stored procedures, implementing nested procedure block

6. Queries implementing cursor variable assignment, use of RPAD

PRACTICAL LIST

1. Write a program calling a function-

(a) Area of a circle

(b)Lateral area of a cone

(c)Area of a cube.

2. Write a program calling a function for a table employee & find their average salary.

3. Write a program to create or replace a function.

4. Write a program to create a function dealing with cursors.

5. Write a program to exit a function.

6. Write a function to call a function from PL/SQL without parameters.

7. Write for local subprograms that is calling function inside cursor.

8. Write a program to implement multiple return statements.

9. Write a program to return a user defined data type.

10. Write a program to implement recursive function.

11. Write a program to call a procedure.

12. Write a program to execute a procedure.

13. Write a program for creating stored procedures.

14. Write a program to decrease salary with user procedure.

15. Write a program to implement nested procedure block.

16. Write a program where loop is required to read each row in cursor returned.

17. Write a program to implement cursor for counting.

18. Write a program using RPAD to format cursor variable.

19. Write a program to implement CONCAT ( ) Function.

20. Write a program to implement cursor variable assignment.

21. Write a program to create a trigger for setting employee salary to 0.


College of Technology & Engineering MPUAT, Udaipur


IT-424: Parallel Computer Architecture (Credit: 3+0)

2015-2016 (Theory) Rubina Banu Patel

Lecture no. Topic

1 Parallel programs: Parallel applications

2 Parallelization processes

3 parallelizing computation versus data, Goals of parallelization processes

4 Programming for performance: partitioning for performance

5 Load balance

6 Reducing inherent communication

7 Data access and communication in a multi-memory system

8 Workload —Driven evaluation: scaling workloads and machines

9 Key issues in scaling

10 Scaling models and speedup measures

11 Scaling workload parameters

12 Evaluating a real machine

13 Performance isolation

14 Choosing workloads

15 Choosing performance metrics

16 Shared memory multiprocessors: cache coherence problem, Cache coherence

through bus snooping

17 Memory consistency

18 Snooping protocols



21 Snoop-Based multiprocessor design : correctness requirement

22 Cache controller

23 Reporting snoop results

24 Dealing with write backs

25 Non-atomic state transitions

26 Serialization, Deadlocks, live-locks & starvation

27 Multilevel cache hierarchies

28 Split transaction bus

29 Snoop results & conflicting requests

30 Path of cache miss, Serialization & sequential consistency

31 Split transaction bus with multiple caches

32 Shared cache design

33 Coherence for virtually indexed caches

34 Translation look-aside buffer coherence

35 Scalable Multiprocessors: scalability, Network transaction

36 Shared address space

37 Message passing

38 Active messages

39 Physical DMA

40 Node to network interface

41 Dedicated message passing

42 Shared physical address space

43 Cluster & network of workstations

44 Network transaction performance

45 Shared address space operations

46 Message passing operations

47 Application level performance

48 Synchronization

49 Algorithms for locks

50 Algorithms for barriers

Faculty: Rubina Banu Patel

DEPARTMENT OF INFORMATION TECHNOLOGY … SCHEDULE... · Lecture No. Topic 1 ... 11 8086: Pin...

Documents

Transcript of DEPARTMENT OF INFORMATION TECHNOLOGY … SCHEDULE... · Lecture No. Topic 1 ... 11 8086: Pin...