Calicut University Syllabus IT: Difference between revisions

No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 1: Line 1:
IT: INFORMATION TECHNOLOGY  
IT: INFORMATION TECHNOLOGY  
  The syllabus for Information Technology at University of Calicut.
  The syllabus at University of Calicut.


= COMBINED FIRST AND SECOND SEMESTER =
= COMBINED FIRST AND SECOND SEMESTER =
Line 1,545: Line 1,545:


Lab -1 : (object-oriented programming in - Java /C+ +) - Programs to bring out concepts of classes and objects - for example the abstract data type binary tree
Lab -1 : (object-oriented programming in - Java /C+ +) - Programs to bring out concepts of classes and objects - for example the abstract data type binary tree
Lab - 2 : (object oriented programming) Programs to demonstrate inheritance and class hierarchy - for example define a base class “shape” and derived classes for rectangle, square, ellipse, circle with proper class hierarchy
Lab - 2 : (object oriented programming) Programs to demonstrate inheritance and class hierarchy - for example define a base class “shape” and derived classes for rectangle, square, ellipse, circle with proper class hierarchy
Lab - 3 : (object oriented programming) - Programs to demonstrate polymorphism, virtual functions - for example define base class for vectors and use inheritance to define complex and real vector with standard operations
Lab - 3 : (object oriented programming) - Programs to demonstrate polymorphism, virtual functions - for example define base class for vectors and use inheritance to define complex and real vector with standard operations
Lab - 4 : (functional programming - in Lisp / scheme / Haskell) - Program to demonstrate functional specification for a solution - for example implementation of quick sort
Lab - 4 : (functional programming - in Lisp / scheme / Haskell) - Program to demonstrate functional specification for a solution - for example implementation of quick sort
Lab - 5 : (functional programming) - Program to demonstrate implementation of conventional data structures - for example implementation of binary search tree with insertion, deletion, and search operations
Lab - 5 : (functional programming) - Program to demonstrate implementation of conventional data structures - for example implementation of binary search tree with insertion, deletion, and search operations
Lab -6 : (functional programming) - Program to demonstrate use of available data structures in functional programming languages - for example implementation of set with membership, union, and intersection operations
Lab -6 : (functional programming) - Program to demonstrate use of available data structures in functional programming languages - for example implementation of set with membership, union, and intersection operations
Lab - 7 : (logic programming - in prolog / VisiCalc) - Program to demonstrate ready implementation of propositional logic statements - for example implementation of logic program to find the gcd of two given integers
Lab - 7 : (logic programming - in prolog / VisiCalc) - Program to demonstrate ready implementation of propositional logic statements - for example implementation of logic program to find the gcd of two given integers
Lab - 8 : (logic programming) - Program to demonstrate language specific features - for example implement a logic program to check whether a given NFA accepts the given string
Lab - 8 : (logic programming) - Program to demonstrate language specific features - for example implement a logic program to check whether a given NFA accepts the given string
Lab - 9 : (concurrent programming - Java / Ada) Demonstration of concurrency support - for example program to find the least common ancestor of two given nodes in a binary tree may be implemented.
Lab - 9 : (concurrent programming - Java / Ada) Demonstration of concurrency support - for example program to find the least common ancestor of two given nodes in a binary tree may be implemented.
Lab - 10 : (concurrent programming) - Demonstration of synchronized concurrency - for example program for the readers and writers problem may be implemented.
Lab - 10 : (concurrent programming) - Demonstration of synchronized concurrency - for example program for the readers and writers problem may be implemented.


Line 1,566: Line 1,575:
Regularity  = 5
Regularity  = 5
Total marks  = 50
Total marks  = 50
 
 
== IT04  508(P)  :  HARDWARE  LAB ==
== IT04  508(P)  :  HARDWARE  LAB ==
3 hours practical per week
3 hours practical per week
  Objective:
  Objective:
This course is to understand the relevance and characteristics of hardware and operating system components of a digital computer system through various laboratory experiments. It also gives the students the ability to interface devices to computer systems through various interfacing techniques.
This course is to understand the relevance and characteristics of hardware and operating system components of a digital computer system through various laboratory experiments. It also gives the students the ability to interface devices to computer systems through various interfacing techniques.
Lab - 1 : Identification of components/cards and PC assembling from components
Lab - 1 : Identification of components/cards and PC assembling from components
Lab - 2 : Assembly language program for implementing arithmetic operations
Lab - 2 : Assembly language program for implementing arithmetic operations
Line 1,579: Line 1,589:
Lab - 8,9 : Parallel Interface: Printer and HEX keyboard.
Lab - 8,9 : Parallel Interface: Printer and HEX keyboard.
Lab - 10 : Serial Interface: PC to PC serial interface using MODEM.
Lab - 10 : Serial Interface: PC to PC serial interface using MODEM.
Reference books
 
Reference books
  Messmer H.P., The Indispensable PC Hardware Book, Pearson Education Asia
  Messmer H.P., The Indispensable PC Hardware Book, Pearson Education Asia
  Hall D.V., Microprocessors and Interfacing, Tata McGraw Hill
  Hall D.V., Microprocessors and Interfacing, Tata McGraw Hill
  Norton P., Dos Internals  
  Norton P., Dos Internals  
Sessional work assessment   
 
Sessional work assessment   
Lab practicals  & record = 25
Lab practicals  & record = 25
2 tests 2x10 = 20
2 tests 2x10 = 20
Line 1,589: Line 1,601:
Total marks  = 50
Total marks  = 50
    
    
SIXTH SEMESTER
= SIXTH SEMESTER =
Code
== IT04 601:  Embedded Systems ==
  Subject
  Hours/Week
  Internal Marks
  University Examination
  IT04 601
  Embedded systems
  3
  1
  -
  50
  3
  100
  IT04 602
  Database Management Systems
  3
  1
  -
  50
  3
  100
  IT04 603
  Computer Networks
  3
  1
  -
  50
  3
  100
  IT04 604
  Computer Architecture
  3
  1
  -
  50
  3
  100
  IT04 605
  Human Computer Interaction
  3
  1
  -
  50
  3
  100
  IT04 606
  Information Retrieval
  3
  1
  -
  50
  3
  100
  IT04 607(P)
  Systems lab
  -
  -
  3
  50
  3
  100
  IT04 608(P)
  Mini Project
  -
  -
  3
  50
  3
  -
  TOTAL
  18
  6
  6
  400
  -
  700
  DETAILED SYLLABUS
IT04 601:  Embedded Systems
(Common with CS04 601)
(Common with CS04 601)
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
Objective of the course is to teach students about architecture, h/w and s/w elements, programming models and practice and tools on embedded system design and implementation, common to computing streams.  Note that there is an annoying duplication of computer organization and software engineering, which can't be avoided as it, appears in a different context here; time may be spent more on untaught aspects after revision of ideas.  Thrust is on the available hardware  and real time operating systems for the embedded systems design.  Project works in the concerned field will supplement the learning process.
Objective of the course is to teach students about architecture, h/w and s/w elements, programming models and practice and tools on embedded system design and implementation, common to computing streams.  Note that there is an annoying duplication of computer organization and software engineering, which can't be avoided as it, appears in a different context here; time may be spent more on untaught aspects after revision of ideas.  Thrust is on the available hardware  and real time operating systems for the embedded systems design.  Project works in the concerned field will supplement the learning process.
Module - I: (10 hours)
 
Module - I: (10 hours)
Introduction:
Introduction:
Definition - Classification - Processors in the system - Other h/w units.
Definition - Classification - Processors in the system - Other h/w units.
Software components - Typical applications - Embedded systems on a chip(SoC) and use of VLSI circuits.
Software components - Typical applications - Embedded systems on a chip(SoC) and use of VLSI circuits.
Module - II: (12 hours)
 
Module - II: (12 hours)
Hardware organization:
Hardware organization:
Structured units of a processor - Processor selection factors.
Structured units of a processor - Processor selection factors.
Common memory devices - Memory selection - Memory map - Internal devices & I/O devices map - Direct memory access - Interfacing the above.
Common memory devices - Memory selection - Memory map - Internal devices & I/O devices map - Direct memory access - Interfacing the above.
Types of I/O devices - Serial devices - Parallel port devices - Sophisticated features - Timer and Counting devices - Advanced serial bus & I/O - High speed Buses - Common types - Advanced Buses.
Types of I/O devices - Serial devices - Parallel port devices - Sophisticated features - Timer and Counting devices - Advanced serial bus & I/O - High speed Buses - Common types - Advanced Buses.
Module - III: (15 hours)
 
Module - III: (15 hours)
Programming:
Programming:
Compiling, cross-compiling - Optimized use of memory - Use of DFG for program analysis - Control Data Flow graph - Use of finite state machines model - Use of Petrinet models - Use of Petri table for Real time programming - Issues in multiprocessor systems.
Compiling, cross-compiling - Optimized use of memory - Use of DFG for program analysis - Control Data Flow graph - Use of finite state machines model - Use of Petrinet models - Use of Petri table for Real time programming - Issues in multiprocessor systems.
Real time programming issues during software development process - Distinction between functions, ISR and tasks - Problems of sharing data in RTOS - Interprocess communication in RTOS.
Real time programming issues during software development process - Distinction between functions, ISR and tasks - Problems of sharing data in RTOS - Interprocess communication in RTOS.
Device drivers - Parallel port driver - Driver for internal programmable timing devices - Interrupt servicing mechanism - Context and periods for context switching - Deadline and Interrupt latency.
Device drivers - Parallel port driver - Driver for internal programmable timing devices - Interrupt servicing mechanism - Context and periods for context switching - Deadline and Interrupt latency.
Module - IV: (15 hours)
 
Module - IV: (15 hours)
Real Time Operating Systems:
Real Time Operating Systems:
Typical OS structure - RTOS structure - The context of its use - Schedule management for multiple tasks - Scheduling in real time - Interrupt routines in RTOS environment - RTOS task scheduling models - List of basic actions in pre-emptive scheduler and expected time taken - Strategy for synchronization - Discussion using Linux - OS securities issues - Mobile OS.
Typical OS structure - RTOS structure - The context of its use - Schedule management for multiple tasks - Scheduling in real time - Interrupt routines in RTOS environment - RTOS task scheduling models - List of basic actions in pre-emptive scheduler and expected time taken - Strategy for synchronization - Discussion using Linux - OS securities issues - Mobile OS.
Case study of RTOS using MUCOS.
Case study of RTOS using MUCOS.
Case study for RTOS based programming - Coding for Automatic Chocolate vending machine using MUCOS.
Case study for RTOS based programming - Coding for Automatic Chocolate vending machine using MUCOS.
Text books
 
Text books
1. Raj Kamal; Embedded systems - architecture, programming and design; Tata McGraw-Hill.  
1. Raj Kamal; Embedded systems - architecture, programming and design; Tata McGraw-Hill.  
Reference books
Reference books
Line 1,697: Line 1,638:
  David E. Simon; An embedded software primer; Pearson Education Asia
  David E. Simon; An embedded software primer; Pearson Education Asia
  Daniel W. Lewis; Fundamentals of Embedded Software where C and assembly meet; Pearson Education Asia  
  Daniel W. Lewis; Fundamentals of Embedded Software where C and assembly meet; Pearson Education Asia  
Internal work assessment
 
Internal work assessment
30 - Test papers (minimum 2)
30 - Test papers (minimum 2)
15 - Open book tests/Assignments/Term project/any other mode decided by the teacher  
15 - Open book tests/Assignments/Term project/any other mode decided by the teacher  
Line 1,709: Line 1,651:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04 602 :  DATABASE  MANAGEMENT  SYSTEMS
 
== IT04 602 :  DATABASE  MANAGEMENT  SYSTEMS ==
(Common with CS04 602)
(Common with CS04 602)
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
To introduce basic concepts of data bases connected with software engineering techniques and background information useful for the management of data bases. The syllabus includes the file organization, database design and transaction processing techniques.
To introduce basic concepts of data bases connected with software engineering techniques and background information useful for the management of data bases. The syllabus includes the file organization, database design and transaction processing techniques.
Module - I: (12 hours)
 
Module - I: (12 hours)
Introduction: characteristics of database approach - advantages of using DBMS - database concept and architecture - data models - schemes - instances - data independence - database languages and interfaces - database modeling using entity - relationship (ER) - entity sets attributes and keys - relationships - type role and structural constraints - weak entity types - enhanced entity-relationship (EER) and object modeling - sub classes - super classes and inheritance - specialization and generalization - modeling of union types
Introduction: characteristics of database approach - advantages of using DBMS - database concept and architecture - data models - schemes - instances - data independence - database languages and interfaces - database modeling using entity - relationship (ER) - entity sets attributes and keys - relationships - type role and structural constraints - weak entity types - enhanced entity-relationship (EER) and object modeling - sub classes - super classes and inheritance - specialization and generalization - modeling of union types
Module - II: (10 hours)
 
Module - II: (10 hours)
File organization and storage: secondary storage devices - RAID technology - operations in files - heap files and sorted files - hashing techniques - types of single level ordered index, multi-level indexes - B - trees and B + trees - indexes on multiple keys - other types of indexes
File organization and storage: secondary storage devices - RAID technology - operations in files - heap files and sorted files - hashing techniques - types of single level ordered index, multi-level indexes - B - trees and B + trees - indexes on multiple keys - other types of indexes
Module - III: (14 hours)
 
Module - III: (14 hours)
Database design: functional dependencies - normal forms - general definition of second and third normal forms - Boyce-Codd normal form - multi valued dependencies and fourth normal form - join dependencies and fifth normal form - inclusion dependencies - practical database design tuning - database design process relational model concepts - relational algebra operations - queries in SQL - insert - delete and update statements in SQL views in SQL
Database design: functional dependencies - normal forms - general definition of second and third normal forms - Boyce-Codd normal form - multi valued dependencies and fourth normal form - join dependencies and fifth normal form - inclusion dependencies - practical database design tuning - database design process relational model concepts - relational algebra operations - queries in SQL - insert - delete and update statements in SQL views in SQL
Module - IV: (16 hours)
 
Module - IV: (16 hours)
Transaction processing: desirable properties of transactions, schedules and recoverability - serializability of schedules concurrency control - locking techniques - time stamp ordering multi version concurrency control - granularity of data items - database recovery techniques based on deferred up data and immediate updating - shadow pages - ARIES recovery algorithm - database security and authorization - security issue access control based on granting/revoking of privileges introduction to statistical database security
Transaction processing: desirable properties of transactions, schedules and recoverability - serializability of schedules concurrency control - locking techniques - time stamp ordering multi version concurrency control - granularity of data items - database recovery techniques based on deferred up data and immediate updating - shadow pages - ARIES recovery algorithm - database security and authorization - security issue access control based on granting/revoking of privileges introduction to statistical database security
Text book
 
Text book
1. Elmasri & Navathe, "Fundamentals of Database Systems", Addison Wesley
1. Elmasri & Navathe, "Fundamentals of Database Systems", Addison Wesley
Reference books
Reference books
Line 1,730: Line 1,679:
  Ullman J.D., “Principles of Database Systems”, Galgotia Publications
  Ullman J.D., “Principles of Database Systems”, Galgotia Publications
  Date C.J., “ An Introduction to Database Systems “, Addison Wesley  
  Date C.J., “ An Introduction to Database Systems “, Addison Wesley  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 1,741: Line 1,692:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04 603: COMPUTER NETWORKS
 
== IT04 603: COMPUTER NETWORKS ==
(Common with CS04 603)
(Common with CS04 603)
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
This course is beneficial for the students to understand the mode of operation of different types of Computer networks that are used to interconnect a distributed community of computers and various interfacing standards and protocols. This course includes the essential theory and different techniques associated with Local Area Network (LAN), Wide area Network (WAN) and Inter network.
This course is beneficial for the students to understand the mode of operation of different types of Computer networks that are used to interconnect a distributed community of computers and various interfacing standards and protocols. This course includes the essential theory and different techniques associated with Local Area Network (LAN), Wide area Network (WAN) and Inter network.
Module - I: (13 hours)
 
Module - I: (13 hours)
Local Area Networks - Project  802  - Ethernet - Token Bus - Token  ring  - FDDI, Wireless LANs, Wireless media,  Transmission schemes, Medium access control, Switching - circuit switching - packet switching (Data gram & Virtual circuit) - Message switching, Connection oriented & Connectionless services.
Local Area Networks - Project  802  - Ethernet - Token Bus - Token  ring  - FDDI, Wireless LANs, Wireless media,  Transmission schemes, Medium access control, Switching - circuit switching - packet switching (Data gram & Virtual circuit) - Message switching, Connection oriented & Connectionless services.
Module - II: (14 hours)
 
Module - II: (14 hours)
ISDN - services - history - subscriber access  - ISDN layers, Broadband ISDN, X.25 - layers - PLP packets - Information packet - Control Packet, Frame relay - layers - operation - implementation, ATM - design goals - topology - protocol architecture, SONET/SDH -  layers - frames - multiplexing STS frames.
ISDN - services - history - subscriber access  - ISDN layers, Broadband ISDN, X.25 - layers - PLP packets - Information packet - Control Packet, Frame relay - layers - operation - implementation, ATM - design goals - topology - protocol architecture, SONET/SDH -  layers - frames - multiplexing STS frames.
Module - III: (13 hours)
 
Module - III: (13 hours)
Networking devices - Bridges - Routers - Gateways,  Routing  algorithms - distance vector - link state, Transport layer - duties - connection - OSI transport protocol, Upper OSI layers - session layer - presentation layer - application layer.
Networking devices - Bridges - Routers - Gateways,  Routing  algorithms - distance vector - link state, Transport layer - duties - connection - OSI transport protocol, Upper OSI layers - session layer - presentation layer - application layer.
Module - IV: (14 hours)
 
Module - IV: (14 hours)
Overview of TCP/IP, Network layer - IP - ARP - RARP - ICMP - IGMP, Transport layer - UDP - TCP, Application layer - DNS -  TELNET - FTP - Electronic Mail - SNMP - HTTP, World Wide Web - URL - browser architecture - WWW documents.
Overview of TCP/IP, Network layer - IP - ARP - RARP - ICMP - IGMP, Transport layer - UDP - TCP, Application layer - DNS -  TELNET - FTP - Electronic Mail - SNMP - HTTP, World Wide Web - URL - browser architecture - WWW documents.
Text books
 
Text books
1.  Behrouz Forouzan, Introduction to data communication and networking,  Tata McGraw-  Hill Publishing Company Ltd.
1.  Behrouz Forouzan, Introduction to data communication and networking,  Tata McGraw-  Hill Publishing Company Ltd.
Reference books
 
Reference books
1.  Halsall F., Data Communication, Computer Networks and Open Systems, Addison Wesley
1.  Halsall F., Data Communication, Computer Networks and Open Systems, Addison Wesley
2.  Peterson L.L. &Davie B.S., Computer Networks, A systems approach, Harcourt Asia
2.  Peterson L.L. &Davie B.S., Computer Networks, A systems approach, Harcourt Asia
Line 1,763: Line 1,722:
5.  Leon-Garcia A. & Widjaja I., Communication Networks, Tata McGraw Hill
5.  Leon-Garcia A. & Widjaja I., Communication Networks, Tata McGraw Hill
6.  Bertsekas & Gallagar, Data Networks, PHI  
6.  Bertsekas & Gallagar, Data Networks, PHI  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    -  8 short type questions of 5 marks each, 2 from each module
Q I    -  8 short type questions of 5 marks each, 2 from each module
Q II  -  2 questions of 15marks each from module I with choice to answer any one
Q II  -  2 questions of 15marks each from module I with choice to answer any one
Line 1,774: Line 1,735:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  604 :  COMPUTER  ARCHITECTURE
 
== IT04  604 :  COMPUTER  ARCHITECTURE ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
This paper is aimed to introduce a single concentrated course on parallel computing based computer architectures with a quantitative approach. The students will be able to understand new design paradigms to achieve parallelism, memory hierarchy design and interconnection networks.
This paper is aimed to introduce a single concentrated course on parallel computing based computer architectures with a quantitative approach. The students will be able to understand new design paradigms to achieve parallelism, memory hierarchy design and interconnection networks.
Module - I: (15 hours)
 
Module - I: (15 hours)
Fundamentals:  task of a computer designer - trends in technology usage and cost - performance measurement - quantitative principles of computer design - instruction set architectures - classification - addressing and operations - encoding an instruction set - role of compilers - case study: the DLX architecture - pipelining - pipeline for DLX - pipeline hazards - data and control hazards - implementation difficulties - pipelining with multicycle operations
Fundamentals:  task of a computer designer - trends in technology usage and cost - performance measurement - quantitative principles of computer design - instruction set architectures - classification - addressing and operations - encoding an instruction set - role of compilers - case study: the DLX architecture - pipelining - pipeline for DLX - pipeline hazards - data and control hazards - implementation difficulties - pipelining with multicycle operations
Module - II: (12 hours)  
 
Module - II: (12 hours)  
Instruction level parallelism: concepts and challenges - dynamic scheduling - dynamic hardware prediction - multiple issue of instructions - compiler and hardware support for ILP - vector processing - vector architecture - vector length and stride - compiler vectorization - enhancing vector performance
Instruction level parallelism: concepts and challenges - dynamic scheduling - dynamic hardware prediction - multiple issue of instructions - compiler and hardware support for ILP - vector processing - vector architecture - vector length and stride - compiler vectorization - enhancing vector performance
Module - III: (13 hours)
 
Module - III: (13 hours)
Memory hierarchy design - reducing cache misses and miss penalty, reducing hit time - main memory - virtual memory and its protection - case study - protection in the intel pentium - crosscutting issues - I/O systems - performance measures - reliability and availability - designing an I/O system - case study - unix file system performance
Memory hierarchy design - reducing cache misses and miss penalty, reducing hit time - main memory - virtual memory and its protection - case study - protection in the intel pentium - crosscutting issues - I/O systems - performance measures - reliability and availability - designing an I/O system - case study - unix file system performance
Module - IV: (12 hours)
 
Module - IV: (12 hours)
Interconnection networks - simple networks - connecting more than two computers - practical issues - multiprocessors - introduction - application domains - centralised-shared memory and distributed-shared memory architectures - synchronization - models of memory consistency
Interconnection networks - simple networks - connecting more than two computers - practical issues - multiprocessors - introduction - application domains - centralised-shared memory and distributed-shared memory architectures - synchronization - models of memory consistency
Text book
 
Text book
  1. Hennesy J.L. & Pattersen D.A., Computer Architecture: A Quantitative Approach, Harcourt Asia Pte Ltd. (Morgan Kaufman)
  1. Hennesy J.L. & Pattersen D.A., Computer Architecture: A Quantitative Approach, Harcourt Asia Pte Ltd. (Morgan Kaufman)
Reference books
 
Reference books
  Pattersen D.A. & Hennesy J.L., Computer Organization And Design: The Hardware/ Software Interface, Harcourt Asia Pte Ltd (Morgan Kaufman)
  Pattersen D.A. & Hennesy J.L., Computer Organization And Design: The Hardware/ Software Interface, Harcourt Asia Pte Ltd (Morgan Kaufman)
  Hwang K., Advanced Computer Architecture: Parallelism, Scalability And Programmability, McGraw Hill  
  Hwang K., Advanced Computer Architecture: Parallelism, Scalability And Programmability, McGraw Hill  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 1,802: Line 1,773:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04 605 :  Human Computer Interaction
 
== IT04 605 :  Human Computer Interaction ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
The problem of how to take into account the human and contextual part of a system with anything like the rigor with which other parts of the system are understood and designed is important in creating popular applications. Over the years, understanding the right interaction and implementing it has led to meddling with fields like applied psychology, industrial engineering, ergonomics.  Human computer Interaction is the latest of these, more complex in some ways because of the breadth of user populations and application, the reach into cognitive and social constraints, and the emphasis on the interaction. Objective of the course is to introduce the well developed models in this emerging area with a thrust to plan interaction for a new IT application.  Note that ubiquitous computing and rich sensor-filled environment are finding their way out of the laboratory, not just into films and fictions, but also into our workplaces and homes.
 
Module - I: (14 hours)
The problem of how to take into account the human and contextual part of a system with anything like the rigor with which other parts of the system are understood and designed is important in creating popular applications. Over the years, understanding the right interaction and implementing it has led to meddling with fields like applied psychology, industrial engineering, ergonomics.  Human computer Interaction is the latest of these, more complex in some ways because of the breadth of user populations and application, the reach into cognitive and social constraints, and the emphasis on the interaction. Objective of the course is to introduce the well developed models in this emerging area with a thrust to plan interaction for a new IT application.  Note that ubiquitous computing and rich sensor-filled environment are finding their way out of the laboratory, not just into films and fictions, but also into our workplaces and homes.
 
Module - I: (14 hours)
Foundations:
Foundations:
Introduction to model human processor - Input-output channel - Human memory - Thinking - Emotion - Difference between individuals - Psychology and the design of interactive systems.
Introduction to model human processor - Input-output channel - Human memory - Thinking - Emotion - Difference between individuals - Psychology and the design of interactive systems.
Typical Computer - Text entry devices - Positioning, pointing and drawing - Display devices - Devices for virtual reality & 3D interaction - Physical controls, sensors & special devices - Printing & scanning - Memory - Processing & networks.
Typical Computer - Text entry devices - Positioning, pointing and drawing - Display devices - Devices for virtual reality & 3D interaction - Physical controls, sensors & special devices - Printing & scanning - Memory - Processing & networks.
Introduction to interaction - Model - Frameworks & HCI - Ergonomics - Interactive styles - Elements of WIMP interface - Interaction & its context - Experience and engagement - Paradigms for interaction.
Introduction to interaction - Model - Frameworks & HCI - Ergonomics - Interactive styles - Elements of WIMP interface - Interaction & its context - Experience and engagement - Paradigms for interaction.
Module - II: (15 hours)
 
Module - II: (15 hours)
Design Process:
Design Process:
Introduction to interaction design - Process of design - User focus - Scenarios - Navigational design - Screen design & layout - Prototyping.
Introduction to interaction design - Process of design - User focus - Scenarios - Navigational design - Screen design & layout - Prototyping.
Line 1,816: Line 1,791:
Evaluation - Expert analysis - Evaluate through user participation - Choosing an evaluation method.
Evaluation - Expert analysis - Evaluate through user participation - Choosing an evaluation method.
Universal design principles - Multi-modal interaction - Design for diversity - Approaches to user support - Adaptive help systems.
Universal design principles - Multi-modal interaction - Design for diversity - Approaches to user support - Adaptive help systems.
Module - III: (12 hours)
 
Module - III: (12 hours)
Models & theories:
Models & theories:
Cognitive models - Linguistic model - Physical & device model - Socio-organizational issues - Communication and collaboration model - Uses of task analysis.
Cognitive models - Linguistic model - Physical & device model - Socio-organizational issues - Communication and collaboration model - Uses of task analysis.
Dialog  notation & design - Diagrammatic notation - Textual dialog notation - Dialog analysis and design.
Dialog  notation & design - Diagrammatic notation - Textual dialog notation - Dialog analysis and design.
Module - IV: (11 hours)
 
Module - IV: (11 hours)
GroupWare systems - Computer mediated communication - Meeting & discussion support systems - Shared applications and artifacts - Framework for GroupWare.
GroupWare systems - Computer mediated communication - Meeting & discussion support systems - Shared applications and artifacts - Framework for GroupWare.
Ubiquitous computing & realities - Ubiquitous computing applications research - Virtual and augmented reality - Information and data visualization.  
Ubiquitous computing & realities - Ubiquitous computing applications research - Virtual and augmented reality - Information and data visualization.  
Text books
 
Text books
  Alan Dix, Janet Finlay, Gregory D. Abowd, Russell Beale; Human - Computer Interaction, 3rd edition; Pearson Education Asia   
  Alan Dix, Janet Finlay, Gregory D. Abowd, Russell Beale; Human - Computer Interaction, 3rd edition; Pearson Education Asia   
  Reference books
  Reference books
  John M. Carroll; Human computer interaction in the New Millennium; Pearson Education Asia
  John M. Carroll; Human computer interaction in the New Millennium; Pearson Education Asia
  Ben Shneiderman; Designing the User Interface: Strategies for Effective Human-Computer Interaction, 3rd edition; Pearson Education Asia  
  Ben Shneiderman; Designing the User Interface: Strategies for Effective Human-Computer Interaction, 3rd edition; Pearson Education Asia  
Internal work assessment
 
Internal work assessment
30 - Test papers (minimum 2)
30 - Test papers (minimum 2)
15 - Open book tests/Assignments/Term project/any other mode decided by the teacher  
15 - Open book tests/Assignments/Term project/any other mode decided by the teacher  
Line 1,834: Line 1,814:
Total marks    =  50  
Total marks    =  50  
    
    
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 1,840: Line 1,821:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04 606 : INFORMATION RETRIEVAL
 
== IT04 606 : INFORMATION RETRIEVAL ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
In the current scenario of information explosion, tools and techniques for deriving the right information at the right time will give a competitive edge to an organization. This paper examines this aspect in detail in the context of the World Wide Web. It covers many forms of information, such as text, image, audio and video formats, and presents several research issues related to different IR tasks.
In the current scenario of information explosion, tools and techniques for deriving the right information at the right time will give a competitive edge to an organization. This paper examines this aspect in detail in the context of the World Wide Web. It covers many forms of information, such as text, image, audio and video formats, and presents several research issues related to different IR tasks.
Module -  I: (10 hours)
 
Module -  I: (10 hours)
Introduction: Information versus Data Retrieval, IR: Past, present, and future. Basic concepts: The retrieval process, logical view of documents. Modeling: A Taxonomy of IR models, ad-hoc retrieval and filtering. Classic IR models: Set theoretic, algebraic, probabilistic IR models, models for browsing.
Introduction: Information versus Data Retrieval, IR: Past, present, and future. Basic concepts: The retrieval process, logical view of documents. Modeling: A Taxonomy of IR models, ad-hoc retrieval and filtering. Classic IR models: Set theoretic, algebraic, probabilistic IR models, models for browsing.
Module - II: (12 hours)
 
Module - II: (12 hours)
Retrieval evaluation: Performance evaluation of IR: Recall and Precision, other measures, Reference Collections, such as TREC, CACM, and ISI data sets. Query Languages: keyword based queries, single word queries, context queries, Boolean Queries, Query protocols, query operations.
Retrieval evaluation: Performance evaluation of IR: Recall and Precision, other measures, Reference Collections, such as TREC, CACM, and ISI data sets. Query Languages: keyword based queries, single word queries, context queries, Boolean Queries, Query protocols, query operations.
Module - III: (12 hours)
 
Module - III: (12 hours)
Text and Multimedia Languages and properties, Metadata, Text formats, Markup languages, Multimedia data formats, Text Operations. Indexing and searching: Inverted files, Suffix trees, Suffix arrays, signature files, sequential searching, Pattern matching.
Text and Multimedia Languages and properties, Metadata, Text formats, Markup languages, Multimedia data formats, Text Operations. Indexing and searching: Inverted files, Suffix trees, Suffix arrays, signature files, sequential searching, Pattern matching.
Module - IV:  (16 hours)
 
Module - IV:  (16 hours)
Multimedia IR: Spatial access methods, Generic multimedia Indexing approach, Distance functions, feature extraction, Image features and distance functions. Searching the Web: Characterizing and measuring the Web. Search Engines: Centralized and Distributed architectures, user Interfaces, Ranking, Crawling the Web, Web directories, Dynamic  search and Software Agents.
Multimedia IR: Spatial access methods, Generic multimedia Indexing approach, Distance functions, feature extraction, Image features and distance functions. Searching the Web: Characterizing and measuring the Web. Search Engines: Centralized and Distributed architectures, user Interfaces, Ranking, Crawling the Web, Web directories, Dynamic  search and Software Agents.
   
   
Text book
Text book
1. R. Baeza-Yates and B. R. Neto: Modern Information Retrieval:, Pearson Education, 2004.
1. R. Baeza-Yates and B. R. Neto: Modern Information Retrieval:, Pearson Education, 2004.
Reference books
 
Reference books
1. C.J. van Rijsbergen: Information Retrieval, Butterworths, 1979.
1. C.J. van Rijsbergen: Information Retrieval, Butterworths, 1979.
2. C.D. Manning and H. Schutze: Foundations of Statistical natural Language Processing
2. C.D. Manning and H. Schutze: Foundations of Statistical natural Language Processing
  (Chapters 13, 14, and 15 only), The MIT Press, Cambridge, London.2001.
  (Chapters 13, 14, and 15 only), The MIT Press, Cambridge, London.2001.
3.  David Hand, Heikki Mannila, Padhraic Smyth, Data Mining, Prentice hall of India
3.  David Hand, Heikki Mannila, Padhraic Smyth, Data Mining, Prentice hall of India
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
QI  -  8 short type questions of 5 marks, 2 from each module
QI  -  8 short type questions of 5 marks, 2 from each module
QII -  2 questions  of 15 marks each from module I with choice to answer anyone
QII -  2 questions  of 15 marks each from module I with choice to answer anyone
Line 1,871: Line 1,861:
QIV -  2 questions  of 15 marks each from module III with choice to answer anyone
QIV -  2 questions  of 15 marks each from module III with choice to answer anyone
QV -  2 questions  of 15 marks each from module IV with choice to answer anyone
QV -  2 questions  of 15 marks each from module IV with choice to answer anyone
IT04  607(P) :  SYSTEMS  LAB
 
== IT04  607(P) :  SYSTEMS  LAB ==
3 hours practical per week
3 hours practical per week
Objective:
 
Objective:
This course is useful to understand the operating system (OS) structures and the implementation aspects of various OS functions and schedulers. The data base problems are incorporated to familiarize problems connected with Data Base designs.
This course is useful to understand the operating system (OS) structures and the implementation aspects of various OS functions and schedulers. The data base problems are incorporated to familiarize problems connected with Data Base designs.
Operating systems
Operating systems
  Implementation of dining philosophers problem by multiprogramming using threads, semaphores and shared memory
  Implementation of dining philosophers problem by multiprogramming using threads, semaphores and shared memory
Line 1,887: Line 1,880:
  Program to convert SQL subset into relational algebra (tools like YACC may be used.)
  Program to convert SQL subset into relational algebra (tools like YACC may be used.)
  Implement optimistic concurrency control algorithm  
  Implement optimistic concurrency control algorithm  
Reference books
 
Reference books
  Nutt G.J., "Operating Systems - A Modern Perspective", Addison Wesley
  Nutt G.J., "Operating Systems - A Modern Perspective", Addison Wesley
  Bach M.J., "The Design of the Unix Operating System", Prentice Hall India
  Bach M.J., "The Design of the Unix Operating System", Prentice Hall India
  Elmasri & Navathe, "Fundamentals of Database Systems", Addison Wesley
  Elmasri & Navathe, "Fundamentals of Database Systems", Addison Wesley
  Ramakrishnan R. & Gehrke J., "Database Management Systems", McGraw Hill  
  Ramakrishnan R. & Gehrke J., "Database Management Systems", McGraw Hill  
Sessional work assessment   
 
Sessional work assessment   
Lab practicals  & record = 25
Lab practicals  & record = 25
2 tests 2x10 = 20
2 tests 2x10 = 20
Line 1,898: Line 1,893:
Total marks  = 50
Total marks  = 50
    
    
IT04  608(P) :  MINI  PROJECT
== IT04  608(P) :  MINI  PROJECT ==
3 hours per week
3 hours per week
Guidelines for Project Formulation
 
Objectives
Guidelines for Project Formulation
Objectives
The mini project is aimed at improving the professional competency by touching the areas which otherwise is not covered in theory classes or laboratories - There is a greater realization of importance of the application of ideas to build a solution in complementing the learning process - Result of this exercise may be a completely deployable product with documentation made by following practice in Software Engineering - It is recommended to have connection between mini project and final year project - A report is to be submitted and students will be evaluated in groups and individually.
The mini project is aimed at improving the professional competency by touching the areas which otherwise is not covered in theory classes or laboratories - There is a greater realization of importance of the application of ideas to build a solution in complementing the learning process - Result of this exercise may be a completely deployable product with documentation made by following practice in Software Engineering - It is recommended to have connection between mini project and final year project - A report is to be submitted and students will be evaluated in groups and individually.
Type of project
 
Type of project
Students may be given an introduction to problems related to industry and level of current research.  They may be given idea about the state of technology in India and abroad and about typical killer applications to understand the implications of a product(computing solution).  Then each student is assigned to a project.
Students may be given an introduction to problems related to industry and level of current research.  They may be given idea about the state of technology in India and abroad and about typical killer applications to understand the implications of a product(computing solution).  Then each student is assigned to a project.
Two approaches are possible  
 
Two approaches are possible  
  To ask the students to select their work from already prepared list of works (prepared by a competitive person and  revised from time to time)  
  To ask the students to select their work from already prepared list of works (prepared by a competitive person and  revised from time to time)  
  To ask the students to select a relevant work which is approved by an approving authority.
  To ask the students to select a relevant work which is approved by an approving authority.
    
    
In any case, the work selected may include the use of as many as possible from the following list.
In any case, the work selected may include the use of as many as possible from the following list.
OS platforms: Relevant to the current state, with support for networked environment, for distributed computing, for development of multi-platform applications.  For example latest GNU Linux with supporting packages.
 
Internet technologies :  XML, Scripting languages like Perl / Python, Middleware(Component) technologies, Architectural concepts like RMI / CORBA
OS platforms: Relevant to the current state, with support for networked environment, for distributed computing, for development of multi-platform applications.  For example latest GNU Linux with supporting packages.
Front end / GUI:  Code development (XWINDOWS in GNU Linux) or development based on tools(Qt designer, Jbuilder etc…)
 
RDBMS/Back end: Relevant to current state, with database connectivity to different platforms.  For example MySQL or PostgreSQL
Internet technologies :  XML, Scripting languages like Perl / Python, Middleware(Component) technologies, Architectural concepts like RMI / CORBA
Languages: Qt, Glade or any similar 4GLs, scripting languages and C & C++ in GNU Linux (under GNU gcc)
 
Front end / GUI:  Code development (XWINDOWS in GNU Linux) or development based on tools(Qt designer, Jbuilder etc…)
 
RDBMS/Back end: Relevant to current state, with database connectivity to different platforms.  For example MySQL or PostgreSQL
 
Languages: Qt, Glade or any similar 4GLs, scripting languages and C & C++ in GNU Linux (under GNU gcc)
Universal n/w applications development platforms: JAVA, GNU .NET or any similar platform
Universal n/w applications development platforms: JAVA, GNU .NET or any similar platform
Unix internals : Device drivers, RPC, Threads, Socket programming
 
Embedded systems: RTOS, Embedded hardware with software for an application, Code optimization, security etc…
Unix internals : Device drivers, RPC, Threads, Socket programming
 
Embedded systems: RTOS, Embedded hardware with software for an application, Code optimization, security etc…
 
The project may be related to one of the following application areas:
The project may be related to one of the following application areas:
Financial / Manufacturing / Multimedia / Instructional design / DBMS / Networking or communication software development / Internet-intranet applications / TCP-IP programming / Protocol study / Operating systems / Distributed systems
Financial / Manufacturing / Multimedia / Instructional design / DBMS / Networking or communication software development / Internet-intranet applications / TCP-IP programming / Protocol study / Operating systems / Distributed systems
Projects like development of payroll, inventory, library system or any similar system and use of old packages like dbase III plus should not be entertained.  Development based on “Office suite” is also not recommended; for example, use of Visual Basic front end and MS-Access backend for development should not be entertained.
Projects like development of payroll, inventory, library system or any similar system and use of old packages like dbase III plus should not be entertained.  Development based on “Office suite” is also not recommended; for example, use of Visual Basic front end and MS-Access backend for development should not be entertained.
Format of report
 
Format of report
A format may be designed and enforced at each institution - formats must be available in all current OS platforms and students must be asked to use a specific document preparation systems recommended by each institution - they may  be asked to provide the report in electronic form also - this electronic form, made available in CD, will contain the entire project document besides multi-media illustration material prepared using any presentation software.
A format may be designed and enforced at each institution - formats must be available in all current OS platforms and students must be asked to use a specific document preparation systems recommended by each institution - they may  be asked to provide the report in electronic form also - this electronic form, made available in CD, will contain the entire project document besides multi-media illustration material prepared using any presentation software.
Guidelines for conduct and evaluation:
 
Guidelines for conduct and evaluation:
  A committee may be constituted for conduct and co-ordination of mini project related activities.  The committee is responsible for developing schedules for various activities and keeping them.  The functioning of a committee is over only after the final evaluation of the project.
  A committee may be constituted for conduct and co-ordination of mini project related activities.  The committee is responsible for developing schedules for various activities and keeping them.  The functioning of a committee is over only after the final evaluation of the project.
  Project may be allotted to a student or groups of size at the most four.  Each student may be asked to select a guide and then finalize a topic following the guidelines given above.  After finalizing the topic, students should submit a Project proposal to the guide.  The project work can start only after the approval of the report by guide.  The institution has to offer infrastructure recommended by guide till the completion of the project work.  In case of non-approval, the suggestions for reformulating the project will be communicated to the students.  The revised proposal may be submitted again to guide in a different time slot.  Sufficient number of chances may be given; the guide may device a time schedule to accommodate this revision process looking into the available time frame for the project.
  Project may be allotted to a student or groups of size at the most four.  Each student may be asked to select a guide and then finalize a topic following the guidelines given above.  After finalizing the topic, students should submit a Project proposal to the guide.  The project work can start only after the approval of the report by guide.  The institution has to offer infrastructure recommended by guide till the completion of the project work.  In case of non-approval, the suggestions for reformulating the project will be communicated to the students.  The revised proposal may be submitted again to guide in a different time slot.  Sufficient number of chances may be given; the guide may device a time schedule to accommodate this revision process looking into the available time frame for the project.
  The project may be an in-house project or an external project.  In any case, the student is associated with a guide. The guide must be competent in terms of academic qualifications and experience in the selected area.  A list of guides available for a term may be published by the committee mentioned above.
  The project may be an in-house project or an external project.  In any case, the student is associated with a guide. The guide must be competent in terms of academic qualifications and experience in the selected area.  A list of guides available for a term may be published by the committee mentioned above.
  The project proposal should be prepared in consultation with guide.  It states clearly the project objective and the environment of the proposed project to be undertaken.  The following details may be included in it:  
 
  The project proposal should be prepared in consultation with guide.  It states clearly the project objective and the environment of the proposed project to be undertaken.
 
  The following details may be included in it:  
  Title of the project
  Title of the project
  Objective of the project
  Objective of the project
Line 1,935: Line 1,949:
Students are supposed to go through initial software engineering activities related to the selected problem and may convince the guide about the genuineness of attempt. The proposal need be formed only after this.  The proposal may be at the most ten pages in size.
Students are supposed to go through initial software engineering activities related to the selected problem and may convince the guide about the genuineness of attempt. The proposal need be formed only after this.  The proposal may be at the most ten pages in size.
  The committee mentioned above should do an assessment of the project work at the end of the semester.  The students, with the approval of guide, must submit a project report on the work done.  Besides, they will make a presentation followed by demonstration before the committee for the evaluation purpose.  The assessment is made individually and in groups.  The pattern for awarding marks will be as follows:  
  The committee mentioned above should do an assessment of the project work at the end of the semester.  The students, with the approval of guide, must submit a project report on the work done.  Besides, they will make a presentation followed by demonstration before the committee for the evaluation purpose.  The assessment is made individually and in groups.  The pattern for awarding marks will be as follows:  
  Attendance : 5 marks
  Attendance : 5 marks
  Work in design and way of presentation evaluated by committee : 30 marks
  Work in design and way of presentation evaluated by committee : 30 marks
  Report and individual assessment by guide : 15 marks  
  Report and individual assessment by guide : 15 marks  
             Total = 50 marks
             Total = 50 marks
For external projects, the attendance may be evaluated based on proof for attendance provided by a competent authority of the external agency.  In addition, the technical report may contain a certificate from competent authority of the external agency as proof for originality of work done by the student at their premise.
 
SEVENTH SEMESTER
For external projects, the attendance may be evaluated based on proof for attendance provided by a competent authority of the external agency.  In addition, the technical report may contain a certificate from competent authority of the external agency as proof for originality of work done by the student at their premise.
Code
 
  Subject
= SEVENTH SEMESTER =
  Hours/Week
== IT04  701  :  DISTRIBUTED  SYSTEMS ==
  Internal Marks
  University Examination
  IT04 - 701
  Distributed Systems
  3
  1
  -
  50
  3
  100
  IT04 - 702
  Cryptography & Network security
  3
  1
  -
  50
  3
  100
  IT04 - 703
  Management Information Systems
  3
  1
  -
  50
  3
  100
  IT04 - 704
  Computer Graphics & Multimedia
  3
  1
  -
  50
  3
  100
  IT04 - 705
  Elective I
  3
  1
  -
  50
  3
  100
  IT04 - 706(P)
  Networks lab
  -
  -
  3
  50
  3
  100
  IT04 - 707(P)
  Seminar
  1
  -
  3
  50
  -
  -
  IT04 - 708(P)
  Project Work
  -
  -
  3
  50
  -
  -
  TOTAL
  18
  6
  6
  400
  -
  700
  ELECTIVE-I
  A
  Digital Signal Processing
  B
  Advanced Topics in Database systems
  C
  Theory of computation
  D
  Parallel architectures & algorithms
  E
  Professional Ethics
  F
  Critical Perspective of Technology
  DETAILED SYLLABUS
IT04  701  :  DISTRIBUTED  SYSTEMS
(Common with CS04 701)
(Common with CS04 701)
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
The development of distributed systems followed the emergence of high-speed local area networks, the availability of high performance PCs, workstations and servers has resulted in a recent shift towards distributed systems, and away from centralized, multi user systems. This trend has been accelerated by the development of distributed system software designed to support the development of distributed applications. This course is to impart basic knowledge of the issues concerning distributed systems, from both software and hardware viewpoints.
The development of distributed systems followed the emergence of high-speed local area networks, the availability of high performance PCs, workstations and servers has resulted in a recent shift towards distributed systems, and away from centralized, multi user systems. This trend has been accelerated by the development of distributed system software designed to support the development of distributed applications. This course is to impart basic knowledge of the issues concerning distributed systems, from both software and hardware viewpoints.
Module - I: (10 hours)
 
Module - I: (10 hours)
Operating system fundamentals - distributed system concepts and architectures - major design issues - distributed computing environments (DCE)
Operating system fundamentals - distributed system concepts and architectures - major design issues - distributed computing environments (DCE)
Module - II: (13 hours)  
 
Module - II: (13 hours)  
Concurrent processes and programming - threads and processes - client server model - time services language mechanisms for synchronization - concurrent programming languages
Concurrent processes and programming - threads and processes - client server model - time services language mechanisms for synchronization - concurrent programming languages
Module - III: (13 hours)
 
Module - III: (13 hours)
Interprocess communication and coordination - message passing communication - request/reply communication - transaction communication - name and directory services - distributed mutual exclusion - leader election
Interprocess communication and coordination - message passing communication - request/reply communication - transaction communication - name and directory services - distributed mutual exclusion - leader election
Module - IV: (16 hours)
 
Module - IV: (16 hours)
Distributed process scheduling - static process scheduling, dynamic load sharing and balancing - distributed process implementation - real-time scheduling - concepts of distributed file systems - distributed shared memory - distributed computer security
Distributed process scheduling - static process scheduling, dynamic load sharing and balancing - distributed process implementation - real-time scheduling - concepts of distributed file systems - distributed shared memory - distributed computer security
Text book
 
Text book
1. Chow R & Johnson T., "Distributed Operating Systems and Algorithms", Addison Wesley
1. Chow R & Johnson T., "Distributed Operating Systems and Algorithms", Addison Wesley
Reference books
Reference books
Line 2,051: Line 1,984:
  Coulouris G., Dollimore J. & Kindberg T., "Distributed Systems Concepts And Design", Addison Wesley
  Coulouris G., Dollimore J. & Kindberg T., "Distributed Systems Concepts And Design", Addison Wesley
  Singhal M. & Shivaratri, "Advanced Concepts In Operating Systems, Distributed Databases and Multiprocessor Operating Systems", McGraw Hill  
  Singhal M. & Shivaratri, "Advanced Concepts In Operating Systems, Distributed Databases and Multiprocessor Operating Systems", McGraw Hill  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,062: Line 1,997:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04 702 : CRYPTOGRAPHY & NETWORK SECURITY
 
== IT04 702 : CRYPTOGRAPHY & NETWORK SECURITY ==
(Common with CS04 702)
(Common with CS04 702)
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
This course introduces the principles and practice of cryptography and network security. It includes the issues to be addressed by network security capability and practical applications that have been implemented and are in use to provide network security.
This course introduces the principles and practice of cryptography and network security. It includes the issues to be addressed by network security capability and practical applications that have been implemented and are in use to provide network security.
Module - I: (14 hours)
 
Module - I: (14 hours)
Congruence equations : properties - complete and reduced residue systems - Fermat's theorem - Euler function.  
Congruence equations : properties - complete and reduced residue systems - Fermat's theorem - Euler function.  
Indeterminate equations - linear and second degree diophantine equations - congruences in one unknown - congruences of higher degree with prime and composite modulo - Wilson's theorem - quadratic residues.
Indeterminate equations - linear and second degree diophantine equations - congruences in one unknown - congruences of higher degree with prime and composite modulo - Wilson's theorem - quadratic residues.
Line 2,074: Line 2,012:
Modern techniques - DES - cryptanalysis - block cipher principles and design - Algorithms - triple DES - IDEA - blowfish  
Modern techniques - DES - cryptanalysis - block cipher principles and design - Algorithms - triple DES - IDEA - blowfish  
Confidentiality - placement of encryption function - traffic confidentiality - key distribution - random number generation.
Confidentiality - placement of encryption function - traffic confidentiality - key distribution - random number generation.
Module -  II:  (14 hours)
 
Module -  II:  (14 hours)
Public key encryption - RSA algorithm - key management and exchange.
Public key encryption - RSA algorithm - key management and exchange.
RSA Design and implementation- Chinese Remainder theorem, Garner's formula, RSA Model definition, Digital signatures and public Exponents, Public Key, RSA Key generating functions, Pitfalls in using RSA ,RSA encryption function, Signature functions.
RSA Design and implementation- Chinese Remainder theorem, Garner's formula, RSA Model definition, Digital signatures and public Exponents, Public Key, RSA Key generating functions, Pitfalls in using RSA ,RSA encryption function, Signature functions.
Line 2,081: Line 2,020:
encryption, faster multiplication, Elliptic curve cryptography - message authentication -
encryption, faster multiplication, Elliptic curve cryptography - message authentication -
requirements - functions and codes - hash functions - security of hash functions and MACs algorithms - MD5 message digest algorithm , Secure Hash (SHA-1 ) algorithm
requirements - functions and codes - hash functions - security of hash functions and MACs algorithms - MD5 message digest algorithm , Secure Hash (SHA-1 ) algorithm
Module -  III:  (14 hours)
 
Module -  III:  (14 hours)
Digital signature algorithm - DSA Decription -DSA prime generation-Security of DSA-GOST Digital Signature Algorithm-ONG-Schnorr-Shamir, ESIGN, - Identification schemes- Feige- Fiat-Shamir and its simplified form ,enhancements - Guillou-Quisquater
Digital signature algorithm - DSA Decription -DSA prime generation-Security of DSA-GOST Digital Signature Algorithm-ONG-Schnorr-Shamir, ESIGN, - Identification schemes- Feige- Fiat-Shamir and its simplified form ,enhancements - Guillou-Quisquater
schemes, - Schnorr schemes - Key-exchange Algorithms, Diffie-Hellman scheme and modifications- Encrypted Key exchange(EKE),- Conference Key Distribution and secret
schemes, - Schnorr schemes - Key-exchange Algorithms, Diffie-Hellman scheme and modifications- Encrypted Key exchange(EKE),- Conference Key Distribution and secret
Line 2,087: Line 2,027:
Coin Flips- Fair and Failsafe Cryptosystems ,Blind Signatures- Probabilistic Encryption-
Coin Flips- Fair and Failsafe Cryptosystems ,Blind Signatures- Probabilistic Encryption-
Quantum Cryptography
Quantum Cryptography
Module-  IV:  (10 hours)
 
Module-  IV:  (10 hours)
Kerberos- Model, working principle, key servers, Sesame- Common Cryptographic Architecture(CCA),ISO Authentication framework, Privacy-Enhanced Mail(PEM), Pretty
Kerberos- Model, working principle, key servers, Sesame- Common Cryptographic Architecture(CCA),ISO Authentication framework, Privacy-Enhanced Mail(PEM), Pretty
Good Privacy(PGP), Public-Key Cryptography Standards(PKCS).
Good Privacy(PGP), Public-Key Cryptography Standards(PKCS).
Line 2,094: Line 2,035:
WEB Security-Socket layer and Transport layer security, Secure Electronic transaction ,
WEB Security-Socket layer and Transport layer security, Secure Electronic transaction ,
password selection strategies ,Intrusion detection.
password selection strategies ,Intrusion detection.
Text book
 
Text book
1. Stallings W., Cryptography and Network Security Principles and Practice, Pearson Education Asia.
1. Stallings W., Cryptography and Network Security Principles and Practice, Pearson Education Asia.
2. Schneier B., Applied Cryptography: Protocols, Algorithms, and Source Code in C, John Wiley
2. Schneier B., Applied Cryptography: Protocols, Algorithms, and Source Code in C, John Wiley
3. Schneier B, Ferguson N. , Practical Cryptography, Wiley-Dream - tech India Pvt.Ltd.
3. Schneier B, Ferguson N. , Practical Cryptography, Wiley-Dream - tech India Pvt.Ltd.
Reference books
 
Reference books
1. Wenbo Mao , Modern cryptography - Theory and Practice, Pearson Education Asia
1. Wenbo Mao , Modern cryptography - Theory and Practice, Pearson Education Asia
2. Niven & Zuckerman H.S., An Introduction to The Theory of Numbers, John Wiley
2. Niven & Zuckerman H.S., An Introduction to The Theory of Numbers, John Wiley
3. Pfleeger C.P., Pfleeger S.L., Security in Computing ,, Pearson Education (Singapore) Pte.Ltd.
3. Pfleeger C.P., Pfleeger S.L., Security in Computing ,, Pearson Education (Singapore) Pte.Ltd.
4. Michel E. Whiteman, Herbert J.Mattord, Principles of Information Security, Thomson, Vikas Publishing House
4. Michel E. Whiteman, Herbert J.Mattord, Principles of Information Security, Thomson, Vikas Publishing House
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I - 8 short type questions of 5 marks each, 2 from each module
Q I - 8 short type questions of 5 marks each, 2 from each module
Q II - 2 questions of 15marks each from module I with choice to answer any one
Q II - 2 questions of 15marks each from module I with choice to answer any one
Line 2,114: Line 2,059:
Q IV - 2 questions of 15marks each from module III with choice to answer any one
Q IV - 2 questions of 15marks each from module III with choice to answer any one
Q V - 2 questions of 15marks each from module IV with choice to answer any one
Q V - 2 questions of 15marks each from module IV with choice to answer any one
IT04  703  :  MANAGEMENT  INFORMATION  SYSTEMS
 
== IT04  703  :  MANAGEMENT  INFORMATION  SYSTEMS ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
This course will introduce the methods and the influence of the information systems in management milieu and use MIS as an effective tool in management and decision making.
This course will introduce the methods and the influence of the information systems in management milieu and use MIS as an effective tool in management and decision making.
Module - I: (12 hours)
 
Module - I: (12 hours)
Information systems - functions of management - levels of management - framework for information systems - systems approach - systems concepts - systems and their environment - effects of system approach in information systems design - using systems approach in problem solving - strategic uses of information technology
Information systems - functions of management - levels of management - framework for information systems - systems approach - systems concepts - systems and their environment - effects of system approach in information systems design - using systems approach in problem solving - strategic uses of information technology
Module - II: (10 hours)
 
Module - II: (10 hours)
An overview of computer hardware and software components - file and database management systems - introduction to network components - topologies and types - remote access - the reasons for managers to implement networks - distributed systems - the internet and office communications
An overview of computer hardware and software components - file and database management systems - introduction to network components - topologies and types - remote access - the reasons for managers to implement networks - distributed systems - the internet and office communications
Module - III: (14 hours)
 
Module - III: (14 hours)
Application of information systems to functional - tactical and strategic areas of management, decision support systems and expert systems
Application of information systems to functional - tactical and strategic areas of management, decision support systems and expert systems
Module - IV: (16 hours)
 
Module - IV: (16 hours)
Information systems planning - critical success factor - business system planning - ends/means analysis - organizing the information systems plan - systems analysis and design - alternative application development approaches - organization of data processing - security and ethical issues of information systems
Information systems planning - critical success factor - business system planning - ends/means analysis - organizing the information systems plan - systems analysis and design - alternative application development approaches - organization of data processing - security and ethical issues of information systems
Text book
 
Text book
1. Robert Schultheis & Mary Sumner, Management Information Systems-The Manager's View, Tata McGraw Hill
1. Robert Schultheis & Mary Sumner, Management Information Systems-The Manager's View, Tata McGraw Hill
Reference books
Reference books
Line 2,134: Line 2,086:
  Alter S., Information Systems: A Management Perspective, Addison Wesley
  Alter S., Information Systems: A Management Perspective, Addison Wesley
  Effy Oz., Management Information Systems, Thomson, Vikas Publishing House  
  Effy Oz., Management Information Systems, Thomson, Vikas Publishing House  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,145: Line 2,099:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  704 :  COMPUTER  GRAPHICS  &  MULTIMEDIA
 
== IT04  704 :  COMPUTER  GRAPHICS  &  MULTIMEDIA ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objectives:
 
Objectives:
The objective of the course is to introduce fundamental principles of computer graphics design in software engineering and background information useful for the students of computing sciences stream. For adequacy this has to be complemented by exercises appearing in texts and references.
The objective of the course is to introduce fundamental principles of computer graphics design in software engineering and background information useful for the students of computing sciences stream. For adequacy this has to be complemented by exercises appearing in texts and references.
Module - I: (14 hours)
 
Module - I: (14 hours)
Introduction to computer graphics - basic raster graphics algorithms for drawing 2D primitives - scan converting lines - circles - generating characters - geometrical transformations - 2D transformations - homogeneous coordinates and matrix representation of transformations - window-to-viewport transformation - input devices and interactive techniques - interaction hardware - basic interaction tasks - 3D graphics - viewing in 3D - projections - basics of solid modeling - 3D transformations
Introduction to computer graphics - basic raster graphics algorithms for drawing 2D primitives - scan converting lines - circles - generating characters - geometrical transformations - 2D transformations - homogeneous coordinates and matrix representation of transformations - window-to-viewport transformation - input devices and interactive techniques - interaction hardware - basic interaction tasks - 3D graphics - viewing in 3D - projections - basics of solid modeling - 3D transformations
Module - II: (12 hours)
 
Module - II: (12 hours)
Introduction to multimedia - media and data streams - properties of a multimedia system - data stream characteristics - information units - multimedia hardware - platforms - memory and storage devices - input and output devices - communication devices - multimedia software - multimedia software tools - multimedia authoring tools
Introduction to multimedia - media and data streams - properties of a multimedia system - data stream characteristics - information units - multimedia hardware - platforms - memory and storage devices - input and output devices - communication devices - multimedia software - multimedia software tools - multimedia authoring tools
Module - III: (13 hours)
 
Module - III: (13 hours)
Multimedia building blocks - audio - basic sound concepts - music - speech - MIDI versus digital audio - audio file formats - sound for the web - images and graphics - basic concepts - computer image processing - video and animation - basic concepts - animation techniques - animation for the web - multimedia building blocks - audio - basic sound concepts - music - speech - MIDI versus digital audio - audio file formats - sound for the web - images and graphics - basic concepts - computer image processing - video and animation - basic concepts - animation techniques - animation for the web
Multimedia building blocks - audio - basic sound concepts - music - speech - MIDI versus digital audio - audio file formats - sound for the web - images and graphics - basic concepts - computer image processing - video and animation - basic concepts - animation techniques - animation for the web - multimedia building blocks - audio - basic sound concepts - music - speech - MIDI versus digital audio - audio file formats - sound for the web - images and graphics - basic concepts - computer image processing - video and animation - basic concepts - animation techniques - animation for the web
Module - IV: (13 hours)
 
Module - IV: (13 hours)
Data compression - storage space and coding requirements - classification of coding/compression techniques - basic compression techniques like JPEG, H.261, MPEG and DVI - multimedia database systems - characteristics of multimedia database management system - data analysis - data structure - operations on data - integration in a database model
Data compression - storage space and coding requirements - classification of coding/compression techniques - basic compression techniques like JPEG, H.261, MPEG and DVI - multimedia database systems - characteristics of multimedia database management system - data analysis - data structure - operations on data - integration in a database model
Text books
 
Text books
  Foley J.D., Van Dam A., Feiner S.K., & Hughes J.F., Computer Graphics Principles And Practice, Addison Wesley
  Foley J.D., Van Dam A., Feiner S.K., & Hughes J.F., Computer Graphics Principles And Practice, Addison Wesley
  Ralf Steinmetz & Klara Nahrstedt, Multimedia: Computing, Communications And Applications, Pearson Education  
  Ralf Steinmetz & Klara Nahrstedt, Multimedia: Computing, Communications And Applications, Pearson Education  
Reference books
 
Reference books
  Newmann W. & Sproull R.F., Principles of Interactive Computer Graphics, McGraw Hill
  Newmann W. & Sproull R.F., Principles of Interactive Computer Graphics, McGraw Hill
  Rogers D.F., Procedural Elements for Computer Graphics, McGraw Hill
  Rogers D.F., Procedural Elements for Computer Graphics, McGraw Hill
Line 2,166: Line 2,128:
  Koegel Buford J.F., Multimedia System, Addison Wesley
  Koegel Buford J.F., Multimedia System, Addison Wesley
  Vaughan T., Multimedia: Making It Work, Tata McGraw Hill  
  Vaughan T., Multimedia: Making It Work, Tata McGraw Hill  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,177: Line 2,141:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  705A :  DIGITAL  SIGNAL  PROCESSING
 
== IT04  705A :  DIGITAL  SIGNAL  PROCESSING ==
(Common with CS04 705A)
(Common with CS04 705A)
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
Current communication technology is based on digital signal processing. Here the fundamental principles of various transforms and the tools used in analysis and design of discrete-time systems for signal processing are introduced.
Current communication technology is based on digital signal processing. Here the fundamental principles of various transforms and the tools used in analysis and design of discrete-time systems for signal processing are introduced.
Module - I: (12 hours)
 
Module - I: (12 hours)
Discrete time signals and systems - discrete signal sequences - linear shift invariant systems - discrete signals - stability and casualty - difference equations - frequency domain representations - fourier transform and its properties - relationship between system representations, review of Z-transforms
Discrete time signals and systems - discrete signal sequences - linear shift invariant systems - discrete signals - stability and casualty - difference equations - frequency domain representations - fourier transform and its properties - relationship between system representations, review of Z-transforms
Module - II: (15 hours)
 
Module - II: (15 hours)
Discrete fourier transform - representation of discrete fourier series - properties of discrete fourier series - periodic convolution - DFT - properties of DFT - computation of DFT - circular convolution - linear convolution using DFT - FFTs - DIT-FFT and DIF-FFT - FFT algorithm for composite N
Discrete fourier transform - representation of discrete fourier series - properties of discrete fourier series - periodic convolution - DFT - properties of DFT - computation of DFT - circular convolution - linear convolution using DFT - FFTs - DIT-FFT and DIF-FFT - FFT algorithm for composite N
Module - III: (13 hours)
 
Module - III: (13 hours)
Design of digital filters - IIR and FIR filters - low pass analog filter design - Butterworth and Chebyshev filters - design examples - bilinear transformation and impulse invariant techniques - FIR filter design - linear phase characteristics - window method
Design of digital filters - IIR and FIR filters - low pass analog filter design - Butterworth and Chebyshev filters - design examples - bilinear transformation and impulse invariant techniques - FIR filter design - linear phase characteristics - window method
Module - IV: (12 hours)
 
Module - IV: (12 hours)
Realization of digital filters - discrete form I and II - cascade and parallel form - finite word length effects in digital filters - quantizer characteristics - saturation overflow - quantization in implementing systems - zero input limit cycles - introduction to DSP processors
Realization of digital filters - discrete form I and II - cascade and parallel form - finite word length effects in digital filters - quantizer characteristics - saturation overflow - quantization in implementing systems - zero input limit cycles - introduction to DSP processors
Reference books
 
Reference books
  Proakis & Manolalus, Digital Signal Processing, Principles, Algorithm & Applications, Prentice Hall
  Proakis & Manolalus, Digital Signal Processing, Principles, Algorithm & Applications, Prentice Hall
  Oppenheim & Schafer, Discrete Time Signal Processing, Prentice Hall
  Oppenheim & Schafer, Discrete Time Signal Processing, Prentice Hall
Line 2,197: Line 2,168:
  Terrel T.J. & Shark L.K., Digital Signal Processing, Macmillan
  Terrel T.J. & Shark L.K., Digital Signal Processing, Macmillan
  Sanjit K. Mitra, Digital Signal Processing- A Computer- Based Approach, Tata McGraw-Hill.  
  Sanjit K. Mitra, Digital Signal Processing- A Computer- Based Approach, Tata McGraw-Hill.  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    -  8 short type questions of 5 marks each, 2 from each module
Q I    -  8 short type questions of 5 marks each, 2 from each module
Q II  -  2 questions of 15marks each from module I with choice to answer any one
Q II  -  2 questions of 15marks each from module I with choice to answer any one
Line 2,208: Line 2,181:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  705B  :  ADVANCED  TOPICS  IN  DATABASE  SYSTEMS
 
== IT04  705B  :  ADVANCED  TOPICS  IN  DATABASE  SYSTEMS ==
(Common with CS04 705B)
(Common with CS04 705B)
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
The course is intended to impart knowledge on the latest advancements in implementations of database management systems. This imparts sound idea on the latest methodologies such as object oriented, distributed and deductive database systems along with comparisons supported by some case studies. By the end of the course, it enables the student to analyze, design and implement modern database systems, especially for a distributed environment.
The course is intended to impart knowledge on the latest advancements in implementations of database management systems. This imparts sound idea on the latest methodologies such as object oriented, distributed and deductive database systems along with comparisons supported by some case studies. By the end of the course, it enables the student to analyze, design and implement modern database systems, especially for a distributed environment.
Module - I: (11 hours)
 
Module - I: (11 hours)
Overview of relational database concept - object oriented database - overview of object oriented concepts - object definition language - object query languages - object database conceptional design - overview of CORBA standard for distributed objects
Overview of relational database concept - object oriented database - overview of object oriented concepts - object definition language - object query languages - object database conceptional design - overview of CORBA standard for distributed objects
Module - II: (13 hours)
 
Module - II: (13 hours)
Distributed database concepts - data fragmentation replication and allocation - types of distributed database system - query process - concurrency control for distributed database - overview of client - server architecture and its relationship to distributed database
Distributed database concepts - data fragmentation replication and allocation - types of distributed database system - query process - concurrency control for distributed database - overview of client - server architecture and its relationship to distributed database
Module - III: (13 hours)
 
Module - III: (13 hours)
Deductive database - introduction to deduction database prolog/datalog notation - interpretation of rules - basic inference mechanism for logic programs - datalog programs and their evaluation - deduction database systems - data Warehousing and data mining - database on World Wide Web - multimedia database - mobile database - geographic information system - digital libraries
Deductive database - introduction to deduction database prolog/datalog notation - interpretation of rules - basic inference mechanism for logic programs - datalog programs and their evaluation - deduction database systems - data Warehousing and data mining - database on World Wide Web - multimedia database - mobile database - geographic information system - digital libraries
Module - IV: (15 hours)
 
Module - IV: (15 hours)
Oracle and Microsoft access - basic structure of the oracle system m database structures and its manipulation in oracle - storage organization programming oracle applications - oracle tools - an overview of Microsoft access features and functionality of access - distributed databases in oracle
Oracle and Microsoft access - basic structure of the oracle system m database structures and its manipulation in oracle - storage organization programming oracle applications - oracle tools - an overview of Microsoft access features and functionality of access - distributed databases in oracle
Text book
 
Text book
  Elmasri & Navathe, Fundamentals of Database Systems, Addison Wesley  
  Elmasri & Navathe, Fundamentals of Database Systems, Addison Wesley  
Reference books
Reference books
Line 2,228: Line 2,208:
  Silberschatz, Korth H.F. & Sudarshan S., Database System Concepts, Tata McGraw Hill
  Silberschatz, Korth H.F. & Sudarshan S., Database System Concepts, Tata McGraw Hill
  Theory T.J., Database Modelling And Design, Harcourt Asia (Morgan Kaufman)  
  Theory T.J., Database Modelling And Design, Harcourt Asia (Morgan Kaufman)  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,239: Line 2,221:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04 705C  :  Theory of Computation
 
== IT04 705C  :  Theory of Computation ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
Being a fundamental course on computational models and computability, the emphasis is on teaching the fundamentals regarding the theory.  Beginning with introductory concepts of languages and their classification, the course proceeds through treatment of their recognizers and automata.  The learners of this course are expected to have sound knowledge of set theory and relations as well as various proof techniques.  The course concludes with a treatment on the ways and means of classifying algorithm into the various computability classes and proofs of some standard algorithms.  The course teaches fundamental computability theory which can be later on used to lay the foundation for parsing theory and algorithms.
Being a fundamental course on computational models and computability, the emphasis is on teaching the fundamentals regarding the theory.  Beginning with introductory concepts of languages and their classification, the course proceeds through treatment of their recognizers and automata.  The learners of this course are expected to have sound knowledge of set theory and relations as well as various proof techniques.  The course concludes with a treatment on the ways and means of classifying algorithm into the various computability classes and proofs of some standard algorithms.  The course teaches fundamental computability theory which can be later on used to lay the foundation for parsing theory and algorithms.
Module - I: (13 hours)
 
Module - I: (13 hours)
Introduction to formal proof - Inductive proofs - Concepts of automata theory - Deterministic finite automata - Nondeterministic finite Automata - equivalence of deterministic and nondeterministic finite automata - Nondeterministic Finite automata with a transitions - Regular expressions - Finite automata and regular expressions - Algebraic laws for Regular expressions - Pumping lemma for regular languages - closure properties of regular languages - Decision properties of regular languages - Equivalence and minimization of automata.
Introduction to formal proof - Inductive proofs - Concepts of automata theory - Deterministic finite automata - Nondeterministic finite Automata - equivalence of deterministic and nondeterministic finite automata - Nondeterministic Finite automata with a transitions - Regular expressions - Finite automata and regular expressions - Algebraic laws for Regular expressions - Pumping lemma for regular languages - closure properties of regular languages - Decision properties of regular languages - Equivalence and minimization of automata.
Module - II: (13 hours)
 
Module - II: (13 hours)
Context free Grammars - Derivations - sentential forms - The language of grammar - Parse trees - Ambiguity in grammar and languages - Inherently ambiguous languages - Pushdown automata - Formal definition - Graphical notation - The language of a PDA - Acceptance by PDA - Empty stack - Final state - PDAs to grammars - Deterministic PDAs and CFLs - Non deterministic PDAs - Chomsky Normal Form - Greibach Normal Form - Pumping lemma for CFLs - Closure properties of CFLs - Decision properties of CFLs - CYK algorithm
Context free Grammars - Derivations - sentential forms - The language of grammar - Parse trees - Ambiguity in grammar and languages - Inherently ambiguous languages - Pushdown automata - Formal definition - Graphical notation - The language of a PDA - Acceptance by PDA - Empty stack - Final state - PDAs to grammars - Deterministic PDAs and CFLs - Non deterministic PDAs - Chomsky Normal Form - Greibach Normal Form - Pumping lemma for CFLs - Closure properties of CFLs - Decision properties of CFLs - CYK algorithm
Module - III: (14 hours)
 
Module - III: (14 hours)
Turing Machines - Notation - Instantaneous Description - Transition Diagram - The language of a Turing Machine - Halting of TMs - Programming techniques for Turing Machines - Extension to basic TMs - Nondeterministic TMs - Restricted TMs - Recursive and Recursively Enumerable Languages - Halting problem of TMs - Undecidable problem about TMs - Rice's Theorem - Post's Correspondence problem - Undecidablity of PCP - Undecidable problems on Languages  
Turing Machines - Notation - Instantaneous Description - Transition Diagram - The language of a Turing Machine - Halting of TMs - Programming techniques for Turing Machines - Extension to basic TMs - Nondeterministic TMs - Restricted TMs - Recursive and Recursively Enumerable Languages - Halting problem of TMs - Undecidable problem about TMs - Rice's Theorem - Post's Correspondence problem - Undecidablity of PCP - Undecidable problems on Languages  
Module - IV: (12 hours)
 
Module - IV: (12 hours)
Intractable problems - The classes P and NP - Polynomial time reducibility - NP-Complete problems - The Satisfiability problem - NP-Completeness of the satisfiability problem - NP-Completeness of CSAT - NP-Completeness of 3SAT - Node cover problem - Directed Hamiltonian circuit problem - The class of languages Co-NP - Problems solvable in polynomial space.
Intractable problems - The classes P and NP - Polynomial time reducibility - NP-Complete problems - The Satisfiability problem - NP-Completeness of the satisfiability problem - NP-Completeness of CSAT - NP-Completeness of 3SAT - Node cover problem - Directed Hamiltonian circuit problem - The class of languages Co-NP - Problems solvable in polynomial space.
Text books
 
Text books
  Hopcroft J.E, Motwani R & Ullman J. D., Introduction to Automata Theory, Languages and Computation, Pearson Education.  
  Hopcroft J.E, Motwani R & Ullman J. D., Introduction to Automata Theory, Languages and Computation, Pearson Education.  
Reference books
Reference books
Line 2,257: Line 2,246:
  Linz: P., An Introduction to Formal Languages & Automata, Narosa
  Linz: P., An Introduction to Formal Languages & Automata, Narosa
  Martin J. C., Introduction to Languages & the Theory of Computation, Tata McGraw Hill  
  Martin J. C., Introduction to Languages & the Theory of Computation, Tata McGraw Hill  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
QI  -  8 short type questions of 5 marks, 2 from each module
QI  -  8 short type questions of 5 marks, 2 from each module
QII -  2 questions  of 15 marks each from module I with choice to answer anyone
QII -  2 questions  of 15 marks each from module I with choice to answer anyone
Line 2,268: Line 2,259:
QIV -  2 questions  of 15 marks each from module III with choice to answer anyone
QIV -  2 questions  of 15 marks each from module III with choice to answer anyone
QV -  2 questions  of 15 marks each from module IV with choice to answer anyone
QV -  2 questions  of 15 marks each from module IV with choice to answer anyone
IT04  705D  :  PARALLEL  ARCHITECTURES  &  ALGORITHMS
 
== IT04  705D  :  PARALLEL  ARCHITECTURES  &  ALGORITHMS ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:  
Objective:  
This is a continuation of the Computer Architecture course and is trying to throw more light on issues of programmability, performance and scalability of parallel architectures.
This is a continuation of the Computer Architecture course and is trying to throw more light on issues of programmability, performance and scalability of parallel architectures.
Module - I: (11 hours)
 
Module - I: (11 hours)
Trends in parallel architectures - convergence of parallel architectures - fundamental design issues - parallel application case studies - the parallelization process - examples
Trends in parallel architectures - convergence of parallel architectures - fundamental design issues - parallel application case studies - the parallelization process - examples
Module - II: (14 hours)
 
Module - II: (14 hours)
Programming for performance - partitioning - data access and communications - orchestration for performance - performance factors - case studies - implications for programming models - workload-driven evaluation - scaling workloads and machines - evaluating a real machine - evaluating an architectural idea - illustrating workload characterization
Programming for performance - partitioning - data access and communications - orchestration for performance - performance factors - case studies - implications for programming models - workload-driven evaluation - scaling workloads and machines - evaluating a real machine - evaluating an architectural idea - illustrating workload characterization
Module - III: (15 hours)
 
Module - III: (15 hours)
Cache coherence - memory consistency design space for snooping protocols - assessing protocol design trade-offs - synchronization - snoop-based multiprocessor design - correctness requirements - single-level caches with an atomic bus - multilevel cache hierarchies - split-transaction bus - case studies - extending cache coherence
Cache coherence - memory consistency design space for snooping protocols - assessing protocol design trade-offs - synchronization - snoop-based multiprocessor design - correctness requirements - single-level caches with an atomic bus - multilevel cache hierarchies - split-transaction bus - case studies - extending cache coherence
Module - IV: (12 hours)
 
Module - IV: (12 hours)
Scalable multiprocessors - scalability - realizing programming models - physical DMA - user-level access - dedicated message processing - shared physical address space - clusters and networks of workstations - implications of parallel software - synchronization - directory-based cache coherence - scalable cache coherence - directory-based approaches - assessing directory protocols and tradeoffs - design challengers for directory protocols - memory-based directory protocols - cache-based directory protocols - performance parameters - synchronization - hardware / software tradeoffs
Scalable multiprocessors - scalability - realizing programming models - physical DMA - user-level access - dedicated message processing - shared physical address space - clusters and networks of workstations - implications of parallel software - synchronization - directory-based cache coherence - scalable cache coherence - directory-based approaches - assessing directory protocols and tradeoffs - design challengers for directory protocols - memory-based directory protocols - cache-based directory protocols - performance parameters - synchronization - hardware / software tradeoffs
Text book
 
Text book
  Culler D.E., Singh J.P. & Gupta A., Parallel Computer Architecture: A hardware/ Software Approach, Harcourt Asia, Morgan Kaufman  
  Culler D.E., Singh J.P. & Gupta A., Parallel Computer Architecture: A hardware/ Software Approach, Harcourt Asia, Morgan Kaufman  
Reference books
 
Reference books
  Sima D., Fountain T. & Kacsuk P., Advanced Computer Architectures, Addison Wesley
  Sima D., Fountain T. & Kacsuk P., Advanced Computer Architectures, Addison Wesley
  Hwang K., Advanced Computer Architecture, McGraw Hill
  Hwang K., Advanced Computer Architecture, McGraw Hill
  Quinn M.J., Parallel Computing Theory and Practice, McGraw Hill  
  Quinn M.J., Parallel Computing Theory and Practice, McGraw Hill  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,297: Line 2,298:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  705E: Professional Ethics
 
== IT04  705E: Professional Ethics ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
The course introduces student to important philosophical inputs of professional ethics.  The course introduces widely accepted theories in ethics as well as their applications in areas of human service. Understanding of these principles would lead to a student to take sound decisions and justify those, while confronting with dilemmas.
The course introduces student to important philosophical inputs of professional ethics.  The course introduces widely accepted theories in ethics as well as their applications in areas of human service. Understanding of these principles would lead to a student to take sound decisions and justify those, while confronting with dilemmas.
Module - I: (12 hours)
 
Module - I: (12 hours)
Ethical concepts and theories - autonomy - rights and right action - utilitarian theories - deontological theories - justification
Ethical concepts and theories - autonomy - rights and right action - utilitarian theories - deontological theories - justification
Module - II: (12 hours)
 
Module - II: (12 hours)
Ethics and health care - issues : abortion, euthanasia, mental retardedness - justice and health care
Ethics and health care - issues : abortion, euthanasia, mental retardedness - justice and health care
Module - III: (12 hours)
 
Module - III: (12 hours)
Business ethics - issues : corporatism, employer-employee relations - products and the consumers - social and ecological responsibilities
Business ethics - issues : corporatism, employer-employee relations - products and the consumers - social and ecological responsibilities
Module - IV: (12 hours)
 
Module - IV: (12 hours)
Ethics in technology development and use - information technology - genetic engineering - appropriate technology
Ethics in technology development and use - information technology - genetic engineering - appropriate technology
Text book  
 
Text book  
1.  David Appellbam, Sarah Veroni Lawton, Ethics and Professions, Prentice Hall, Englewood Cliffs, New Jersey 1980
1.  David Appellbam, Sarah Veroni Lawton, Ethics and Professions, Prentice Hall, Englewood Cliffs, New Jersey 1980
2.  John H Piet and Ayodhya Prasad, An Introduction to Applied Ethics, Cosmo Publications, India 2000
2.  John H Piet and Ayodhya Prasad, An Introduction to Applied Ethics, Cosmo Publications, India 2000
Line 2,343: Line 2,351:
  Arsenio Talingdon, Implications of Computer use in politics, Technology and Society, 12, Sep 1980
  Arsenio Talingdon, Implications of Computer use in politics, Technology and Society, 12, Sep 1980
  C Valbonia, J Johnson and S Beggs, Moral and legal implications of physicians responsibility in a computerized health system, Man and Computer 1974  
  C Valbonia, J Johnson and S Beggs, Moral and legal implications of physicians responsibility in a computerized health system, Man and Computer 1974  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,354: Line 2,364:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  705f : Critical Perspectives of Technology
 
== IT04  705f : Critical Perspectives of Technology ==
   
   
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:  
 
Objective:  
The course introduces student to various concepts of information society, knowledge society, techniques of production of knowledge in a society, along with the various forms of risks associated during application of such concepts in a society. The course enables critical thinking on part of student as an academic exercise.
The course introduces student to various concepts of information society, knowledge society, techniques of production of knowledge in a society, along with the various forms of risks associated during application of such concepts in a society. The course enables critical thinking on part of student as an academic exercise.
Module - I: (13 hours)
 
Module - I: (13 hours)
The concept of knowledge-society - knowledge society and information society - knowledge and power - power of knowledge - knowledge in modern societies
The concept of knowledge-society - knowledge society and information society - knowledge and power - power of knowledge - knowledge in modern societies
Module - II: (13 hours)
 
Module - II: (13 hours)
Modernity - techno structures - postmodernity - expertise and designing the lifeworld - knowledge and expertise - production and function of expertise
Modernity - techno structures - postmodernity - expertise and designing the lifeworld - knowledge and expertise - production and function of expertise
Module - III: (13 hours)
 
Module - III: (13 hours)
Concept of risk society - modernization and risks - risks and human existence - advanced technological risks and traditional risks
Concept of risk society - modernization and risks - risks and human existence - advanced technological risks and traditional risks
Module - IV: (13 hours)
 
Module - IV: (13 hours)
Knowledge and economy - human capital - knowledge production - risks and expertise - knowledge society as risk producing society - expertise - rationality
Knowledge and economy - human capital - knowledge production - risks and expertise - knowledge society as risk producing society - expertise - rationality
Reference books
 
Reference books
  Nicostehr and Richard V Ericson, The culture and power of knowledge in modern society, Walter de Gruyber, New York, 1992
  Nicostehr and Richard V Ericson, The culture and power of knowledge in modern society, Walter de Gruyber, New York, 1992
  Wiio, OA, The information society, is it really like this?, Intermedia 13:12-14, 1985
  Wiio, OA, The information society, is it really like this?, Intermedia 13:12-14, 1985
Line 2,388: Line 2,405:
  Pacey, Arnold, The culture of technology, MIT Press, Cambridge, 1983
  Pacey, Arnold, The culture of technology, MIT Press, Cambridge, 1983
  Rouse, Joseph, Knowledge and Power : Toward a political philosophy of science, Cornell University Press, Ithaca, 1987  
  Rouse, Joseph, Knowledge and Power : Toward a political philosophy of science, Cornell University Press, Ithaca, 1987  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,399: Line 2,418:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  706(P)  :  NETWORKS  LAB
 
== IT04  706(P)  :  NETWORKS  LAB ==
3 hours practical per week
3 hours practical per week
Objective:
Objective:
This practical course includes experiments in computer networking using basic network components and systems there by allowing the students to gain an intuitive feel for network protocols. This course is very much significant both from research perspective and from application perspective.
This practical course includes experiments in computer networking using basic network components and systems there by allowing the students to gain an intuitive feel for network protocols. This course is very much significant both from research perspective and from application perspective.
Lab - 1 : Implementation of PC to PC file transfer using serial port and MODEM.   
Lab - 1 : Implementation of PC to PC file transfer using serial port and MODEM.   
Lab - 2, 3 : Software simulation of IEEE 802.3, 802.4 and 802.5 protocols.
Lab - 2, 3 : Software simulation of IEEE 802.3, 802.4 and 802.5 protocols.
Lab - 4, 5 : Software simulation of medium access control protocols -  
Lab - 4, 5 : Software simulation of medium access control protocols -  
   1) Go back N
   1) Go back N
   2) Selective repeat and
   2) Selective repeat and
3) Sliding window.
3) Sliding window.
Lab - 6 : Implementation of a subset of simple mail transfer protocol using UDP
Lab - 6 : Implementation of a subset of simple mail transfer protocol using UDP
Lab - 7, 8 : Implementation of a subset of file transfer protocol using TCP/IP
Lab - 7, 8 : Implementation of a subset of file transfer protocol using TCP/IP
Lab - 9 : Implementation of “finger” utility using remote procedure call (RPC)
Lab - 9 : Implementation of “finger” utility using remote procedure call (RPC)
Lab - 10 : Generation and processing of HTML forms using CGI.
Lab - 10 : Generation and processing of HTML forms using CGI.
Reference books
 
Reference books
  Richard S.W., Unix Network Programming, PHI
  Richard S.W., Unix Network Programming, PHI
  Comer D.E., Internetworking With TCP/IP, Vol.1, 2 & 3, PHI
  Comer D.E., Internetworking With TCP/IP, Vol.1, 2 & 3, PHI
  Campione et. al M., The Java Tutorial Continued, Addison Wesley  
  Campione et. al M., The Java Tutorial Continued, Addison Wesley  
Sessional work assessment   
 
Sessional work assessment   
Lab practicals  & record = 25
Lab practicals  & record = 25
2 tests 2x10 = 20
2 tests 2x10 = 20
Line 2,423: Line 2,453:
Total marks  = 50
Total marks  = 50
    
    
IT04  707(P): SEMINAR
== IT04  707(P): SEMINAR ==
3 +1 hours per week
3 +1 hours per week
Objective
 
Objective
Each student is expected to present a seminar on a topic of current relevance in Information Technology - they are expected  to  refer papers from standard journals like ACM, IEEE, JPDC, IEE, or RFCs (from www.ietf.org) etc - at least three cross references must be used - the seminar report must not be the reproduction of the original paper.
Each student is expected to present a seminar on a topic of current relevance in Information Technology - they are expected  to  refer papers from standard journals like ACM, IEEE, JPDC, IEE, or RFCs (from www.ietf.org) etc - at least three cross references must be used - the seminar report must not be the reproduction of the original paper.
Conduct and evaluation
 
Conduct and evaluation
An evaluation committee must be formed to determine the schedule of activities and subsequently conduct evaluation.  The members of the committee must be competent in academic qualification and experience.  Students are supposed to select a topic in consultation with any of the members of committee.  The committee may publish guidelines to complete this process easily.  After this, an abstract may be submitted along with title of the seminar.  A formal approval of the committee is necessary for the seminar presentation. In case of non-approval, the suggestions for reformulating it will be communicated to the students.  The revised proposal may be submitted again to the committee in a different time slot.  Sufficient number of chances may be given; the committee may device a time schedule to accommodate this revision process looking into the available time frame for seminar.
An evaluation committee must be formed to determine the schedule of activities and subsequently conduct evaluation.  The members of the committee must be competent in academic qualification and experience.  Students are supposed to select a topic in consultation with any of the members of committee.  The committee may publish guidelines to complete this process easily.  After this, an abstract may be submitted along with title of the seminar.  A formal approval of the committee is necessary for the seminar presentation. In case of non-approval, the suggestions for reformulating it will be communicated to the students.  The revised proposal may be submitted again to the committee in a different time slot.  Sufficient number of chances may be given; the committee may device a time schedule to accommodate this revision process looking into the available time frame for seminar.
A seminar report need to be submitted in a format insisted by the institution well in advance to the presentation.  Marks may be awarded according to the following pattern:
 
Sessional work assessment
A seminar report need to be submitted in a format insisted by the institution well in advance to the presentation.  Marks may be awarded according to the following pattern:
 
Sessional work assessment
Presentation & discussion  = 25
Presentation & discussion  = 25
Regularity = 5
Regularity = 5
Line 2,436: Line 2,470:
Relevance = 10
Relevance = 10
Total marks = 50
Total marks = 50
IT04  708(P)  : PROJECT
 
== IT04  708(P)  : PROJECT ==
3 hours per week
3 hours per week
Guidelines for Project Formulation
 
Objectives
Guidelines for Project Formulation
 
Objectives
The project is aimed at improving the professional competency by touching the areas which otherwise is not covered in theory classes or laboratory classes - There is a greater realization of importance of the application of ideas to build a solution in complementing the learning process.  The work practice here will help student develop ability to apply theoretical and practical tools/techniques to solve real life problems related to industry and current research. It is recommended to have connection between mini project and final year project.  However, there is clear distinction in terms of time frame for project and mini project and hence problems must be selected carefully.  Problems related to mini project domain should never be allowed here.
The project is aimed at improving the professional competency by touching the areas which otherwise is not covered in theory classes or laboratory classes - There is a greater realization of importance of the application of ideas to build a solution in complementing the learning process.  The work practice here will help student develop ability to apply theoretical and practical tools/techniques to solve real life problems related to industry and current research. It is recommended to have connection between mini project and final year project.  However, there is clear distinction in terms of time frame for project and mini project and hence problems must be selected carefully.  Problems related to mini project domain should never be allowed here.
Type of project
 
Type of project
Students may be given an introduction to problems related to industry and level of current research.  They may be given idea about the state of technology in India and abroad and what an employer expect from them.  They may be given idea about the venues for higher studies in India and abroad and what such institution expects from them.  They may be given idea about opportunities of making use of technology and what capacities an entrepreneur should have for successfully running an enterprise.  Then each student is assigned to a project.
Students may be given an introduction to problems related to industry and level of current research.  They may be given idea about the state of technology in India and abroad and what an employer expect from them.  They may be given idea about the venues for higher studies in India and abroad and what such institution expects from them.  They may be given idea about opportunities of making use of technology and what capacities an entrepreneur should have for successfully running an enterprise.  Then each student is assigned to a project.
Two approaches are possible  
 
Two approaches are possible  
  To ask the students to select their work from already prepared list of works (prepared by a competitive person and  revised from time to time)  
  To ask the students to select their work from already prepared list of works (prepared by a competitive person and  revised from time to time)  
  To ask the students to select a relevant work which is approved by an approving authority  
  To ask the students to select a relevant work which is approved by an approving authority  
In any case, the work selected may include the use of as many as possible from the following list.
In any case, the work selected may include the use of as many as possible from the following list.
OS platforms: Relevant to the current state, with support for networked environment, for distributed computing, for development of multi-platform applications.  For example latest GNU Linux with supporting packages.
 
Internet technologies :  XML, Scripting languages like Perl / Python, Middleware(Component) technologies, Architectural concepts like RMI / CORBA
OS platforms: Relevant to the current state, with support for networked environment, for distributed computing, for development of multi-platform applications.  For example latest GNU Linux with supporting packages.
Front end / GUI:  Code development (XWINDOWS in GNU Linux) or development based on tools(Qt designer, Jbuilder etc…)
 
Internet technologies :  XML, Scripting languages like Perl / Python, Middleware(Component) technologies, Architectural concepts like RMI / CORBA
 
Front end / GUI:  Code development (XWINDOWS in GNU Linux) or development based on tools(Qt designer, Jbuilder etc…)
RDBMS/Back end: Relevant to current state, with database connectivity to different platforms.  For example MySQL or PostgreSQL
RDBMS/Back end: Relevant to current state, with database connectivity to different platforms.  For example MySQL or PostgreSQL
Languages: Qt, Glade or any similar 4GLs, scripting languages and C & C++ in GNU Linux (under GNU gcc)
 
Languages: Qt, Glade or any similar 4GLs, scripting languages and C & C++ in GNU Linux (under GNU gcc)
Universal n/w applications development platforms: JAVA, GNU .NET or any similar platform
Universal n/w applications development platforms: JAVA, GNU .NET or any similar platform
Unix internals : Device drivers, RPC, Threads, Socket programming
 
Embedded systems : RTOS, Embedded hardware with software for an application, Code optimization, security etc…
Unix internals : Device drivers, RPC, Threads, Socket programming
 
Embedded systems : RTOS, Embedded hardware with software for an application, Code optimization, security etc…
 
The project may be related to one of the following application areas:
The project may be related to one of the following application areas:
Financial / Manufacturing / Multimedia / Instructional design / DBMS / Networking or communication software development / Internet-intranet applications / TCP-IP programming / Protocol study / Operating systems / Distributed systems
Financial / Manufacturing / Multimedia / Instructional design / DBMS / Networking or communication software development / Internet-intranet applications / TCP-IP programming / Protocol study / Operating systems / Distributed systems
Projects should not be developed using the packages like Dbase III plus, Foxpro, Visual Foxpro and MS-Access.  Projects should not be developed using the combination of Visual Basic as the front end and MS-Access as the back end.  Students can also develop applications using tools / languages / software not listed above, if they are part of latest technologies. Existing open source projects may also be used, but the contribution of the group to the project should be clearly demarcated, distinguished and visible.  Project work should compulsorily involve hardware and/or software development work;  developing installation instructions, developing configuring instructions for LAN / WAN etc… are examples for works not involving any such development and hence are strictly not allowed.
Projects should not be developed using the packages like Dbase III plus, Foxpro, Visual Foxpro and MS-Access.  Projects should not be developed using the combination of Visual Basic as the front end and MS-Access as the back end.  Students can also develop applications using tools / languages / software not listed above, if they are part of latest technologies. Existing open source projects may also be used, but the contribution of the group to the project should be clearly demarcated, distinguished and visible.  Project work should compulsorily involve hardware and/or software development work;  developing installation instructions, developing configuring instructions for LAN / WAN etc… are examples for works not involving any such development and hence are strictly not allowed.
Format of report
 
Format of report
A format may be designed and enforced at each institution - Formats must be available in all current OS platforms and students must be asked to use a specific document preparation systems recommended by each institution - An interim report is to be submitted.  Besides they may  be asked to do a multi-media presentation using any presentation software; the formats and tools may again be standardized by each institution.
A format may be designed and enforced at each institution - Formats must be available in all current OS platforms and students must be asked to use a specific document preparation systems recommended by each institution - An interim report is to be submitted.  Besides they may  be asked to do a multi-media presentation using any presentation software; the formats and tools may again be standardized by each institution.
Guidelines for conduct and evaluation:
 
Guidelines for conduct and evaluation:
  A committee may be constituted for conduct and co-ordination of project related activities.  The committee is responsible for developing schedules for various activities and keeping them.  The functioning of a committee is over only after the final evaluation of the project.
  A committee may be constituted for conduct and co-ordination of project related activities.  The committee is responsible for developing schedules for various activities and keeping them.  The functioning of a committee is over only after the final evaluation of the project.
  Project may be allotted to a student or groups of size at the most four.  Each student may be asked to finalize a topic following the guidelines given above.  After finalizing the topic and selection of guide, students should submit a Project proposal with approval of the guide.  The project work can start only after the approval of the committee constituted.  The institution has to offer infrastructure recommended by this committee till the completion of the project work.  In case of non-approval, the suggestions for reformulating the project will be communicated to the students.  The revised proposal may be submitted again to the committee in a different time slot.  Sufficient number of chances may be given; the committee may device a time schedule to accommodate this revision process looking into the available time frame for the project.
  Project may be allotted to a student or groups of size at the most four.  Each student may be asked to finalize a topic following the guidelines given above.  After finalizing the topic and selection of guide, students should submit a Project proposal with approval of the guide.  The project work can start only after the approval of the committee constituted.  The institution has to offer infrastructure recommended by this committee till the completion of the project work.  In case of non-approval, the suggestions for reformulating the project will be communicated to the students.  The revised proposal may be submitted again to the committee in a different time slot.  Sufficient number of chances may be given; the committee may device a time schedule to accommodate this revision process looking into the available time frame for the project.
  The project may be an in-house project or an external project.  In any case, the student is associated with a guide. The guide must be competent in terms of academic qualifications and experience in the selected area.  A list of guides available for a term may be published by the committee mentioned above.
  The project may be an in-house project or an external project.  In any case, the student is associated with a guide. The guide must be competent in terms of academic qualifications and experience in the selected area.  A list of guides available for a term may be published by the committee mentioned above.
  The project proposal should be prepared in consultation with guide.  It states clearly the project objective and the environment of the proposed project to be undertaken.  The following details may be included in it:  
 
  The project proposal should be prepared in consultation with guide.  It states clearly the project objective and the environment of the proposed project to be undertaken.
 
  The following details may be included in it:  
  Title of the project
  Title of the project
  Objective of the project
  Objective of the project
Line 2,470: Line 2,524:
  Information pertaining to analysis and design
  Information pertaining to analysis and design
  Tools / Platforms, Hardware and software requirement specification.  
  Tools / Platforms, Hardware and software requirement specification.  
Students are supposed to go through initial software engineering activities related to the selected problem and may convince the guide about the genuineness of attempt. The proposal need be formed and forwarded for approval only after this.  The proposal may be at the most ten pages in size.
 
An assessment of the project work should be done at the end of the  semester by the committee mentioned above.  An interim report of at the most 20 pages on the work done must be submitted by the students with the approval of guide.  Besides, they will make a presentation before the committee for the evaluation purpose.  The assessment is made individually and in groups.  The pattern for awarding marks will be as follows:
Students are supposed to go through initial software engineering activities related to the selected problem and may convince the guide about the genuineness of attempt. The proposal need be formed and forwarded for approval only after this.  The proposal may be at the most ten pages in size.
 
An assessment of the project work should be done at the end of the  semester by the committee mentioned above.  An interim report of at the most 20 pages on the work done must be submitted by the students with the approval of guide.  Besides, they will make a presentation before the committee for the evaluation purpose.  The assessment is made individually and in groups.  The pattern for awarding marks will be as follows:
  Attendance : 5 marks
  Attendance : 5 marks
  Work in design and way of presentation evaluated by committee : 30 marks
  Work in design and way of presentation evaluated by committee : 30 marks
  Report and individual assessment by guide : 15 marks  
  Report and individual assessment by guide : 15 marks  
       Total = 50 marks
       Total = 50 marks
For external projects, the attendance may be evaluated based on proof for attendance provided by a competent authority of the external agency.
EIGHTH SEMESTER
Code
  Subject
  Hours/Week
  Internal Marks
  University Examination
  IT04 801
  Industrial Management & Economics
  3
  1
  -
  50
  3
  100
  IT04 802
  Mobile Communication Systems
  3
  1
  -
  50
  3
  100
  IT04 803
  Internet  Technologies
  3
  1
  -
  50
  3
  100
  IT04 804
  Elective II
  3
  1
  -
  50
  3
  100
  IT04 805
  Elective III
  3
  1
  -
  50
  3
  100
  IT04 806(P)
  Graphics & Multimedia Lab
  -
  -
  3
  50
  3
  100
  IT04 807(P)
  Project Work
  -
  -
  7
  100
  -
  -
  IT04 808(P)
  Viva voce
  -
  -
  -
  -
  -
  100
  TOTAL
  15
  5
  10
  400
  -
  700
  ELECTIVE-II
  A
  Artificial Intelligence
  B
  Image Processing
  C
  Compiler Design
  D
  Industrial Psychology
  E
  Simulation & modeling
  F


  Quantum Computing
For external projects, the attendance may be evaluated based on proof for attendance provided by a competent authority of the external agency.
  ELECTIVE-III


  A
= EIGHTH SEMESTER =
== IT04  801  :  INDUSTRIAL MANAGEMENT AND ECONOMICS ==
(Common with CS04 801)
3 hours lecture & 1 hour tutorial per week


  Neural networks & Fuzzy logic
PART A : ENGINEERING ECONOMICS


  B
Objective:
 
a brief exposure of Engineering Economics necessary for engineering graduate.
  Pattern recognition


  C
  Module - I: (13 Hours)
 
  Design and Analysis of algorithms
 
  D
 
  Entrepreneurship
 
  E
 
  Stochastic Processes
 
  F
 
  Concrete Mathematics
  DETAILED SYLLABUS
IT04 801  :  INDUSTRIAL MANAGEMENT AND ECONOMICS
(Common with CS04 801)
3 hours lecture & 1 hour tutorial per week
PART A : ENGINEERING ECONOMICS
Objective:
a brief exposure of Engineering Economics necessary for engineering graduate.
Module - I: (13 Hours)
1. Introductory Background - Nature and scope of Economics, Science, Engineering and Technology, their relationship with economic development.
1. Introductory Background - Nature and scope of Economics, Science, Engineering and Technology, their relationship with economic development.
2. Basic Economic Concepts - Wants and utility, Demand and supply, Elasticity of demand and supply, concept of cost and revenue, concept of equilibrium and margin, wealth and capital.
2. Basic Economic Concepts - Wants and utility, Demand and supply, Elasticity of demand and supply, concept of cost and revenue, concept of equilibrium and margin, wealth and capital.
3. Money and Banking - Functions of money - Functions of banks - Commercial and Central Banks, Monetary policy of the Reserve Bank of India.
3. Money and Banking - Functions of money - Functions of banks - Commercial and Central Banks, Monetary policy of the Reserve Bank of India.
Module - II: (13 Hours)
 
Module - II: (13 Hours)
4. Industrialization and Economic Planning in India - Need for industrialization, Development of Indian Industry since independence, Role of public sector in India, Industrial Policy of the Government of India, A brief study of Five Year Plans of India.
4. Industrialization and Economic Planning in India - Need for industrialization, Development of Indian Industry since independence, Role of public sector in India, Industrial Policy of the Government of India, A brief study of Five Year Plans of India.
5. Agriculture - Role of Agriculture in Indian Economy - Problems of Indian Agriculture - Green Revolution in Indian Features and effects.
5. Agriculture - Role of Agriculture in Indian Economy - Problems of Indian Agriculture - Green Revolution in Indian Features and effects.
6. Foreign exchange and International Trade - Determination of rate of exchange - Balance of payments and Trade - India's Foreign Trade Policy - A short note on International Monetary Fund (I.M.F.).
6. Foreign exchange and International Trade - Determination of rate of exchange - Balance of payments and Trade - India's Foreign Trade Policy - A short note on International Monetary Fund (I.M.F.).
PART B: PRINCIPLES OF MANAGEMENT
 
Objective
PART B: PRINCIPLES OF MANAGEMENT
An elementary level exposure of management principles relevant for industrial sector.
Module - III: (13 hours)
Objective
 
An elementary level exposure of management principles relevant for industrial sector.
 
Module - III: (13 hours)
Need for management - principles of management - management functions - span of control - delegation - directing - leadership and motivation (basic concepts only) Theories of scientific management (an overview only expected) - Fredric Taylor's theory - Frank Gilbreth's theory - Henry Foyal's theory - present concepts of management.
Need for management - principles of management - management functions - span of control - delegation - directing - leadership and motivation (basic concepts only) Theories of scientific management (an overview only expected) - Fredric Taylor's theory - Frank Gilbreth's theory - Henry Foyal's theory - present concepts of management.
Financial management - objectives and functions - time value of money (numerical examples included) - basics of financial accounting (problem solving not required) - profit and loss account - balance sheet (only introduction) - sources of industrial finance- shares - debentures - public deposits - bank loans - financial institutions.
Financial management - objectives and functions - time value of money (numerical examples included) - basics of financial accounting (problem solving not required) - profit and loss account - balance sheet (only introduction) - sources of industrial finance- shares - debentures - public deposits - bank loans - financial institutions.
Module - IV: (13 hours)
 
Module - IV: (13 hours)
Marketing management -concept of market and marketing - marketing mix - market
Marketing management -concept of market and marketing - marketing mix - market
research - advertising and sales promotion, Scope and objective of Human Resource Management - manpower recruitment analysis- recruitment and training - job analysis - job
research - advertising and sales promotion, Scope and objective of Human Resource Management - manpower recruitment analysis- recruitment and training - job analysis - job
evaluation - wages and incentives. Decision making - Introduction and definition - techniques of decision making - decision making process - under certainty - uncertainty and
evaluation - wages and incentives. Decision making - Introduction and definition - techniques of decision making - decision making process - under certainty - uncertainty and
risk (problems not included), Network analysis - CPM and PERT (analysis of simple networks).
risk (problems not included), Network analysis - CPM and PERT (analysis of simple networks).
Text books
 
Text books
1.  Mazda F, Engineering management, Low priced edition, Addison Wesley.
1.  Mazda F, Engineering management, Low priced edition, Addison Wesley.
2.  O.P.Khanna, Industrial Management.
2.  O.P.Khanna, Industrial Management.
Line 2,627: Line 2,579:
6.  K.K.Dewett, Modern Economic Theory
6.  K.K.Dewett, Modern Economic Theory
7.  Ishwar.C.Dhingra, The Indian Economy (Resources Planning development and Problem)
7.  Ishwar.C.Dhingra, The Indian Economy (Resources Planning development and Problem)
Reference books
 
Reference books
1.  Koontz H, O'Donnel C & Weihrich H, Essentials of management, McGraw Hill.
1.  Koontz H, O'Donnel C & Weihrich H, Essentials of management, McGraw Hill.
2.  Satya Raju R & Parthasarathy A, Management: Text & Cases, Prentice Hall.
2.  Satya Raju R & Parthasarathy A, Management: Text & Cases, Prentice Hall.
3.  Ramaswamy V.S & Namakumari S, Marketing Management : Planning, Implementation and Control, MacMillan.
3.  Ramaswamy V.S & Namakumari S, Marketing Management : Planning, Implementation and Control, MacMillan.
Assignments:
 
Assignments:
1. Economics: Assignment should be able to help students appreciate necessity of economics in engineering.
1. Economics: Assignment should be able to help students appreciate necessity of economics in engineering.
2. Management: Individual documentation of best management practices by various organizations.
2. Management: Individual documentation of best management practices by various organizations.
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
QI  -  8 short type questions of 5 marks, 2 from each module
QI  -  8 short type questions of 5 marks, 2 from each module
QII -  2 questions  of 15 marks each from module I with choice to answer anyone
QII -  2 questions  of 15 marks each from module I with choice to answer anyone
Line 2,645: Line 2,601:
QIV -  2 questions  of 15 marks each from module III with choice to answer anyone
QIV -  2 questions  of 15 marks each from module III with choice to answer anyone
QV -  2 questions  of 15 marks each from module IV with choice to answer anyone
QV -  2 questions  of 15 marks each from module IV with choice to answer anyone
IT2K  802  :  MOBILE  COMMUNICATION  SYSTEMS
 
== IT2K  802  :  MOBILE  COMMUNICATION  SYSTEMS ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
This course is an introduction to the field of mobile communications and focuses on the aspects of digital data transfer in wireless and mobile environments. The students require a basic understanding of communication and a rough knowledge of the Internet or networking in general.]
This course is an introduction to the field of mobile communications and focuses on the aspects of digital data transfer in wireless and mobile environments. The students require a basic understanding of communication and a rough knowledge of the Internet or networking in general.]
Module - I: (12 hours)
 
Module - I: (12 hours)
Introduction - applications - history of wireless communications - reference model wireless transmission - frequencies for radio transmission - signals - antennas - signal propagation - multiplexing - modulation - spread sprectrum - cellular systems - medium access control - specialized MAC - SDMA - FDMA - TDMA - aloha - CSMA - collision avoidance - polling - CDMA - comparison of S/T/F/CDMA
Introduction - applications - history of wireless communications - reference model wireless transmission - frequencies for radio transmission - signals - antennas - signal propagation - multiplexing - modulation - spread sprectrum - cellular systems - medium access control - specialized MAC - SDMA - FDMA - TDMA - aloha - CSMA - collision avoidance - polling - CDMA - comparison of S/T/F/CDMA
Module - II: (12 hours)
 
Module - II: (12 hours)
Telecommunication systems - GSM - mobile services - system architecture - radio interface - protocols - localization and calling - handover - security - new data services - DECT - TETRA - UMTS and IMT-2000 - satellite systems - history - applications - basics - rooting - localization - handover - examples - broadcast systems - overview - cyclic repetition of data - digital audio broadcasting - digital video broadcasting
Telecommunication systems - GSM - mobile services - system architecture - radio interface - protocols - localization and calling - handover - security - new data services - DECT - TETRA - UMTS and IMT-2000 - satellite systems - history - applications - basics - rooting - localization - handover - examples - broadcast systems - overview - cyclic repetition of data - digital audio broadcasting - digital video broadcasting
Module - III: (12 hours)
 
Module - III: (12 hours)
Wireless LAN - infrared Vs radio transmissions - infrastructure and adhoc networks - IEEE 802.11 - HIPERLAN - bluetooth - wireless ATM - motivation for WATM working group - WATM services - reference model - functions - radio access layer - handover - location management - addressing - mobile quality of service - access point control protocol
Wireless LAN - infrared Vs radio transmissions - infrastructure and adhoc networks - IEEE 802.11 - HIPERLAN - bluetooth - wireless ATM - motivation for WATM working group - WATM services - reference model - functions - radio access layer - handover - location management - addressing - mobile quality of service - access point control protocol
Module - IV: (16 hours)
 
Module - IV: (16 hours)
Mobile network layer - mobile IP - packet delivery - registration - tunneling and encapsulation - optimizations - reverse tunneling - dynamic host configuration protocol - adhoc networks - routing - algorithms - metrics - mobile transport layer - TCP - indirect TCP - snooping TCP - mobile TCP - retransmission - recovery - transaction oriented TACP - support for mobility - file systems - WWW - WAP - architecture - datagram protocol - transport security - transaction protocol - session protocol - application - environment - WML - WML script - wireless telephony application - example stacks with WAP
Mobile network layer - mobile IP - packet delivery - registration - tunneling and encapsulation - optimizations - reverse tunneling - dynamic host configuration protocol - adhoc networks - routing - algorithms - metrics - mobile transport layer - TCP - indirect TCP - snooping TCP - mobile TCP - retransmission - recovery - transaction oriented TACP - support for mobility - file systems - WWW - WAP - architecture - datagram protocol - transport security - transaction protocol - session protocol - application - environment - WML - WML script - wireless telephony application - example stacks with WAP
Text book
 
Text book
1. Schiller J., Mobile Communications, Addison Wesley
1. Schiller J., Mobile Communications, Addison Wesley
Reference books
Reference books
Line 2,666: Line 2,629:
  Lee W.C., Mobile Collection Tele Communications, McGraw Hill
  Lee W.C., Mobile Collection Tele Communications, McGraw Hill
  Tero Ojawpera & Ranjee Prasad, Wide Band CDMA for Third Generation Mobile Communication, AH  
  Tero Ojawpera & Ranjee Prasad, Wide Band CDMA for Third Generation Mobile Communication, AH  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,677: Line 2,642:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  803  :  INTERNET TECHNOLOGIES
 
== IT04  803  :  INTERNET TECHNOLOGIES ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
This course introduces the algorithms and protocols implemented to have human interaction with internet with an emphasis on application layer and multimedia networking. It also introduces the techniques and methods of E-Commerce.
This course introduces the algorithms and protocols implemented to have human interaction with internet with an emphasis on application layer and multimedia networking. It also introduces the techniques and methods of E-Commerce.
Module - I: (14 hours)
 
Module - I: (14 hours)
Network Applications-Client-Server Interaction-Socket Interface-Connection Oriented Service-Simple Client and Server example-Domain Name System-Electronic Mail - Representation and Transfer-VoIP-File Transfer and Remote File Access-RPC and Middleware-Initialization
Network Applications-Client-Server Interaction-Socket Interface-Connection Oriented Service-Simple Client and Server example-Domain Name System-Electronic Mail - Representation and Transfer-VoIP-File Transfer and Remote File Access-RPC and Middleware-Initialization
Module - II: (12 hours)
 
Module - II: (12 hours)
Multimedia networking-applications-streaming stored audio and video - internet telephony - RTP - scheduling and policing mechanisms - integrated services - RSVP -
Multimedia networking-applications-streaming stored audio and video - internet telephony - RTP - scheduling and policing mechanisms - integrated services - RSVP -
differentiated services - network management - the internet network management framework - network security - integrity, Access control attacks & control measures
differentiated services - network management - the internet network management framework - network security - integrity, Access control attacks & control measures
Module - III: (13 hours)
 
Module - III: (13 hours)
E-commerce-Difference between E-commerce and E-Business, Unique features, types - Portals - E-distributor. Emerging E-commerce areas. Technology infrastructure - Internet and web features (case study not required). Building an E-commerce website- choosing server software- choosing hardware- E-commerce site tools. Security needs in E-commerce environment.
E-commerce-Difference between E-commerce and E-Business, Unique features, types - Portals - E-distributor. Emerging E-commerce areas. Technology infrastructure - Internet and web features (case study not required). Building an E-commerce website- choosing server software- choosing hardware- E-commerce site tools. Security needs in E-commerce environment.
Module - IV: (13 hours)
 
Module - IV: (13 hours)
E-commerce payment systems - credit cards, E-commerce transactions - digital payments in B2C arena - B2B payment systems, B2B E-commerce and Supply Chain
E-commerce payment systems - credit cards, E-commerce transactions - digital payments in B2C arena - B2B payment systems, B2B E-commerce and Supply Chain
Management - Evolution - Procurement process & Supply Chain Management - Trends in Supply Chain Management and collaborative commerce, Net Marketers -  characteristics, types, e-distributors, e-procurement.
Management - Evolution - Procurement process & Supply Chain Management - Trends in Supply Chain Management and collaborative commerce, Net Marketers -  characteristics, types, e-distributors, e-procurement.
Text books
 
Text books
1. Douglas E. Comer, Computer Networks and Internets with Internet Applications - Pearson Education
1. Douglas E. Comer, Computer Networks and Internets with Internet Applications - Pearson Education
2.  Kurose J.F. & Ross K.W, Computer Networking: A Top -Down Approach Featuring the Internet- Pearson Education
2.  Kurose J.F. & Ross K.W, Computer Networking: A Top -Down Approach Featuring the Internet- Pearson Education
3. Kenneth C. Laudon, Carol Guercio Traver, E-Commerce-Business, Technology, Society - Pearson Education
3. Kenneth C. Laudon, Carol Guercio Traver, E-Commerce-Business, Technology, Society - Pearson Education
Reference books
 
Reference books
1.  Nalin K. Sharda, Multimedia Information Networking - Prentice Hall of India.
1.  Nalin K. Sharda, Multimedia Information Networking - Prentice Hall of India.
2.  Stallings, Computer Networking with Internet Protocols - Pearson Education Asia.
2.  Stallings, Computer Networking with Internet Protocols - Pearson Education Asia.
Line 2,702: Line 2,675:
5.  Kalakota R. & Whinston A.B., Frontiers of Electronic Commerce - Addison Wesley
5.  Kalakota R. & Whinston A.B., Frontiers of Electronic Commerce - Addison Wesley
6.  Schneider G.P. & Perry J.T. Electronic Commerce, Course Technology
6.  Schneider G.P. & Perry J.T. Electronic Commerce, Course Technology
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,713: Line 2,688:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  804A  :  ARTIFICIAL  INTELLIGENCE
 
== IT04  804A  :  ARTIFICIAL  INTELLIGENCE ==
(Common with CS04 804A)
(Common with CS04 804A)
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:  
 
Objective:  
The course intends to introduce students to elementary and informational aspects of artificial intelligence. Various perspectives of the subject are analysed from different viewpoints. The course is expected to enable the student to gain a deeper understanding of the philosophy of the AI.
The course intends to introduce students to elementary and informational aspects of artificial intelligence. Various perspectives of the subject are analysed from different viewpoints. The course is expected to enable the student to gain a deeper understanding of the philosophy of the AI.
Module - I: (12 hours)
 
Module - I: (12 hours)
Introduction to philosophy of AI, Algorithms and Turing machines, Church-Turing thesis - computational theories of mind.
Introduction to philosophy of AI, Algorithms and Turing machines, Church-Turing thesis - computational theories of mind.
Module - II: (12 hours)
 
Module - II: (12 hours)
Classical version of AI - symbolic representation - rules and representation - classical AI's consequences for technological and psychological AI - rationality
Classical version of AI - symbolic representation - rules and representation - classical AI's consequences for technological and psychological AI - rationality
Module - III: (12 hours)
 
Module - III: (12 hours)
Problem in classical model of AI - commonsense reasoning - non-monotonic logic - Eliza effect - Chinese Room argument - semantics of AI - Language model - Limits of informational semantics
Problem in classical model of AI - commonsense reasoning - non-monotonic logic - Eliza effect - Chinese Room argument - semantics of AI - Language model - Limits of informational semantics
Module - IV: (13 hours)
 
Module - IV: (13 hours)
Neural networks - connectionism - subsymbolic micro-freatures and context sensitivity of interpretation - parallel distributed processing - PDP and brain situated robotics - connectionism and representation - dielectic representation - dynamic system approach
Neural networks - connectionism - subsymbolic micro-freatures and context sensitivity of interpretation - parallel distributed processing - PDP and brain situated robotics - connectionism and representation - dielectic representation - dynamic system approach
Reference articles and books
 
Reference articles and books
  Boden, MA AI and Natural Man, MIT Press, London 1987
  Boden, MA AI and Natural Man, MIT Press, London 1987
  Boden, MA, Computer models of mind : Computational approaches in theoretical psychology, CUP, Cambridge, 1985
  Boden, MA, Computer models of mind : Computational approaches in theoretical psychology, CUP, Cambridge, 1985
Line 2,739: Line 2,721:
  Gelder, T Van, What is cognition, if not computation?, Journal of Philosophy, 91, 1995 (A defense of dynamic systems)
  Gelder, T Van, What is cognition, if not computation?, Journal of Philosophy, 91, 1995 (A defense of dynamic systems)
  Holl & JM, Holy Oak KJ, Nisbet RE and Thagard PR, Induction : Processes of Inference, Learnings and Discovery, MIT Press, Cambridge 1980 (Algorithms)  
  Holl & JM, Holy Oak KJ, Nisbet RE and Thagard PR, Induction : Processes of Inference, Learnings and Discovery, MIT Press, Cambridge 1980 (Algorithms)  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,750: Line 2,734:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  804b  :  IMAGE  PROCESSING
 
== IT04  804b  :  IMAGE  PROCESSING ==
(Common with CS04 804B)
(Common with CS04 804B)
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Module - I: (20 hours)
 
Module - I: (20 hours)
Introduction - digital image representation - fundamental steps in image processing - elements of digital image processing systems - digital image fundamentals - elements of visual perception - a simple image model - sampling and quantization - basic relationship between pixels - image geometry - image transforms - introduction to Fourier transform - discrete Fourier transform - some properties of 2-fourier transform (DFT) - the FFT - other separable image transforms - hotelling transform
Introduction - digital image representation - fundamental steps in image processing - elements of digital image processing systems - digital image fundamentals - elements of visual perception - a simple image model - sampling and quantization - basic relationship between pixels - image geometry - image transforms - introduction to Fourier transform - discrete Fourier transform - some properties of 2-fourier transform (DFT) - the FFT - other separable image transforms - hotelling transform
Module  -II: (12 hours)
 
Module  -II: (12 hours)
Image enhancement - point processing - spatial filtering - frequency domain - color image processing - image restoration - degradation model - diagonalization of circulant and block circulant matrices - inverse filtering - least mean square filter
Image enhancement - point processing - spatial filtering - frequency domain - color image processing - image restoration - degradation model - diagonalization of circulant and block circulant matrices - inverse filtering - least mean square filter
Module - III: (10 hours)
 
Module - III: (10 hours)
Image compression - image compression models - elements of information theory - error-free compression - lossy compression - image compression standards
Image compression - image compression models - elements of information theory - error-free compression - lossy compression - image compression standards
Module - IV: (10 hours)
 
Module - IV: (10 hours)
Image reconstruction from projections - basics of projection - parallel beam and fan beam projection - method of generating projections - Fourier slice theorem - filtered back projection algorithms - testing back projection algorithms
Image reconstruction from projections - basics of projection - parallel beam and fan beam projection - method of generating projections - Fourier slice theorem - filtered back projection algorithms - testing back projection algorithms
Text book
 
Text book
1. Rafael C., Gonzalez & Woods R.E., Digital Image Processing, Addison Wesley
1. Rafael C., Gonzalez & Woods R.E., Digital Image Processing, Addison Wesley
Reference books
 
Reference books
  Rosenfeld A. & Kak A.C., Digital Picture Processing, Academic Press
  Rosenfeld A. & Kak A.C., Digital Picture Processing, Academic Press
  Jain A.K & Englewood Cliffs N.J., Fundamentals of Digital Image Processing, Prentice Hall
  Jain A.K & Englewood Cliffs N.J., Fundamentals of Digital Image Processing, Prentice Hall
  Schalkoff R.J., Digital Image Processing And Computer Vision, John Wiley
  Schalkoff R.J., Digital Image Processing And Computer Vision, John Wiley
  Pratt W.K., Digital Image Processing, John Wiley  
  Pratt W.K., Digital Image Processing, John Wiley  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,779: Line 2,772:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  804C  :  COMPILER  DESIGN
 
== IT04  804C  :  COMPILER  DESIGN ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
Objective of the course is to introduce the software engineering techniques and background information in a single paper useful for the students of computing sciences stream. For adequacy this has to be complemented by exercises appearing in texts and references. Books have been carefully chosen to get examples from diverse computing application for practice along with theory. Students are expected to find additional training materials downloadable from sites associated with each book. It is expected that the techniques learned here would be useful in doing project.
Objective of the course is to introduce the software engineering techniques and background information in a single paper useful for the students of computing sciences stream. For adequacy this has to be complemented by exercises appearing in texts and references. Books have been carefully chosen to get examples from diverse computing application for practice along with theory. Students are expected to find additional training materials downloadable from sites associated with each book. It is expected that the techniques learned here would be useful in doing project.
Module - I: (10 hours)
 
Module - I: (10 hours)
Introduction - analysis of the source program - phases of a compiler - compiler construction tools - lexical analysis - role of the lexical analyser - specification of tokens - recognition of tokens - lexical analyzer generators
Introduction - analysis of the source program - phases of a compiler - compiler construction tools - lexical analysis - role of the lexical analyser - specification of tokens - recognition of tokens - lexical analyzer generators
Module - II: (15 hours)  
 
Module - II: (15 hours)  
Syntax analysis: role of the parser - context-free grammars - top-down parsing - bottom-up parsing - operator precedence parsing - LR parsers (SLR, canonical LR, LALR) - parser generators
Syntax analysis: role of the parser - context-free grammars - top-down parsing - bottom-up parsing - operator precedence parsing - LR parsers (SLR, canonical LR, LALR) - parser generators
Module - III: (13 hours)
 
Module - III: (13 hours)
Syntax-directed translation - syntax-directed definitions - S-atributed definitions - L-attributed definitions - bottom-up and top-down translation - type checking - type systems - specification of a type checker - run-time environments - source language issues - storage organization - storage allocation strategies - access to non-local names - parameter passing - symbol tables
Syntax-directed translation - syntax-directed definitions - S-atributed definitions - L-attributed definitions - bottom-up and top-down translation - type checking - type systems - specification of a type checker - run-time environments - source language issues - storage organization - storage allocation strategies - access to non-local names - parameter passing - symbol tables
Module - IV: (14 hours)
 
Module - IV: (14 hours)
Intermediate code generation - intermediate languages - declarations - assignment statements - Boolean expressions - procedure calls - introduction to code optimization - sources of optimization - introduction to data-flow analysis - introduction to code generation - issues in the design of a code generator - the target machine - a simple code generator
Intermediate code generation - intermediate languages - declarations - assignment statements - Boolean expressions - procedure calls - introduction to code optimization - sources of optimization - introduction to data-flow analysis - introduction to code generation - issues in the design of a code generator - the target machine - a simple code generator
Text book
 
Text book
1. Aho A.V., Sethi R. & Ullman J.D. Compilers: Principles, Techniques and Tools, Addison Wesley
1. Aho A.V., Sethi R. & Ullman J.D. Compilers: Principles, Techniques and Tools, Addison Wesley
Reference books
 
Reference books
  Aho A.V. & Ullman J.D. Principles of Compiler Design, Narosa
  Aho A.V. & Ullman J.D. Principles of Compiler Design, Narosa
  Muchnick S.S., Advanced Compiler Design Implementation, Harcourt Asia (Morgan Kaufman)
  Muchnick S.S., Advanced Compiler Design Implementation, Harcourt Asia (Morgan Kaufman)
Line 2,800: Line 2,801:
  Kenneth C Lauden, Compiler Construction - Principles and practice , Thomson Brooks/Cole - Vikas Publishing House
  Kenneth C Lauden, Compiler Construction - Principles and practice , Thomson Brooks/Cole - Vikas Publishing House
  Dick Grune, Henri E Bal, Ceriel J.H Jacobs & Koen G Langendoen,  Modern Compiler design, Dreamtech  
  Dick Grune, Henri E Bal, Ceriel J.H Jacobs & Koen G Langendoen,  Modern Compiler design, Dreamtech  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
QI  -  8 short type questions of 5 marks, 2 from each module
QI  -  8 short type questions of 5 marks, 2 from each module
QII -  2 questions  of 15 marks each from module I with choice to answer anyone
QII -  2 questions  of 15 marks each from module I with choice to answer anyone
Line 2,813: Line 2,816:
    
    
    
    
IT04  804D  :  INDUSTRIAL  PSYCHOLOGY
== IT04  804D  :  INDUSTRIAL  PSYCHOLOGY ==
3 hours lecture and 1 hour tutorial
3 hours lecture and 1 hour tutorial
Objective:
 
Objective:
The course is expected to expose to the student various techniques in analyzing and improving relationships, that are expected by people employed in industries while conducting within an organization. It looks at various psychological issues and attempts to solve them.
The course is expected to expose to the student various techniques in analyzing and improving relationships, that are expected by people employed in industries while conducting within an organization. It looks at various psychological issues and attempts to solve them.
Module - I: (13 hours)
 
Module - I: (13 hours)
Introduction - psychology as a science - areas of applications - study of individual - individual differences - study of behavior - stimulus - response behavior - heredity and environment - human mind - cognition - character - thinking - attention - memory- emotion - traits - attitude - personality
Introduction - psychology as a science - areas of applications - study of individual - individual differences - study of behavior - stimulus - response behavior - heredity and environment - human mind - cognition - character - thinking - attention - memory- emotion - traits - attitude - personality
Module - II: (13 hours)
 
Module - II: (13 hours)
Organizational behavior - definition - development - fundamental concept - nature of people - nature of organization - an organizational behavior system - models - autocratic model - hybrid model - understanding a social - system social culture - managing communication - downward, upward and other forms of communication
Organizational behavior - definition - development - fundamental concept - nature of people - nature of organization - an organizational behavior system - models - autocratic model - hybrid model - understanding a social - system social culture - managing communication - downward, upward and other forms of communication
Module - III: (13 hours)
 
Module - III: (13 hours)
Motivation - motivation driver - human needs - behavior modification - goal setting - expectancy model - comparison models - interpreting motivational models - leadership - path goal model - style - contingency approach
Motivation - motivation driver - human needs - behavior modification - goal setting - expectancy model - comparison models - interpreting motivational models - leadership - path goal model - style - contingency approach
Module - IV: (13 hours)
 
Module - IV: (13 hours)
Special topics in industrial psychology - managing group in organization - group and inter group dynamics -managing change and organizational development - nature planned change - resistance - characteristic of OD - OD process
Special topics in industrial psychology - managing group in organization - group and inter group dynamics -managing change and organizational development - nature planned change - resistance - characteristic of OD - OD process
Reference books
 
Reference books
  Davis K. & Newstrom J.W., "Human Behavior At Work", McGraw Hill International
  Davis K. & Newstrom J.W., "Human Behavior At Work", McGraw Hill International
  Schermerhorn J.R. Jr., Hunt J.G. & Osborn R.N., "Managing Organizational Behavior", John Willy
  Schermerhorn J.R. Jr., Hunt J.G. & Osborn R.N., "Managing Organizational Behavior", John Willy
Line 2,831: Line 2,840:
  Morgan C.T., King R.A., Rweisz J. & Schoples J., "Introduction to Psychology", McGraw Hill
  Morgan C.T., King R.A., Rweisz J. & Schoples J., "Introduction to Psychology", McGraw Hill
  Blum M.L. & Naylor J.C., "Industrial Psychology", CBS Publisher, Horper & Row  
  Blum M.L. & Naylor J.C., "Industrial Psychology", CBS Publisher, Horper & Row  
Sessional work assessment
 
Sessional work assessment
2 Tests 2 x 15 = 30
2 Tests 2 x 15 = 30
2 Assignments 2 x 10 = 20
2 Assignments 2 x 10 = 20
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    -  8 short type questions of 5 marks each, 2 from each module
Q I    -  8 short type questions of 5 marks each, 2 from each module
Q II  -  2 questions A and B of 15marks each from module I with choice to answer any one
Q II  -  2 questions A and B of 15marks each from module I with choice to answer any one
Line 2,841: Line 2,852:
Q IV  - 2 questions A and B of 15marks each from module III with choice to answer any one
Q IV  - 2 questions A and B of 15marks each from module III with choice to answer any one
Q V  - 2 questions A and B of 15marks each from module IV with choice to answer any one
Q V  - 2 questions A and B of 15marks each from module IV with choice to answer any one
IT04  804E  :  SIMULATION  &  MODELLING
 
== IT04  804E  :  SIMULATION  &  MODELLING ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
In simulation scientists try to reproduce real-world events or process under controlled laboratory conditions, using mainly mathematical models. Some of the most important scientific discoveries stem from the use of computers to simulate the complex natural phenomena. Hence, both from research perspective and from application perspective, study of the course is inevitable.
In simulation scientists try to reproduce real-world events or process under controlled laboratory conditions, using mainly mathematical models. Some of the most important scientific discoveries stem from the use of computers to simulate the complex natural phenomena. Hence, both from research perspective and from application perspective, study of the course is inevitable.
Module - I: (10 hours)
 
Module - I: (10 hours)
Introduction - systems and models - computer simulation and its applications - continuous system simulation - modelling continuous systems - simulation of continuous systems - discrete system simulation - methodology - event scheduling and process interaction approaches - random number generation - testing of randomness - generation of stochastic variates - random samples from continuous distributions - uniform distribution - exponential distribution m-Erlang distribution - gamma distribution - normal distribution - beta distribution - random samples from discrete distributions - Bernoulli - discrete uniform - binomial - geometric and poisson
Introduction - systems and models - computer simulation and its applications - continuous system simulation - modelling continuous systems - simulation of continuous systems - discrete system simulation - methodology - event scheduling and process interaction approaches - random number generation - testing of randomness - generation of stochastic variates - random samples from continuous distributions - uniform distribution - exponential distribution m-Erlang distribution - gamma distribution - normal distribution - beta distribution - random samples from discrete distributions - Bernoulli - discrete uniform - binomial - geometric and poisson
Module - II: (12 hours)
 
Module - II: (12 hours)
Evaluation of simulation experiments - verification and validation of simulation experiments - statistical reliability in evaluating simulation experiments - confidence intervals for terminating simulation runs - simulation languages - programming considerations - general features of GPSS - SIM SCRIPT and SIMULA
Evaluation of simulation experiments - verification and validation of simulation experiments - statistical reliability in evaluating simulation experiments - confidence intervals for terminating simulation runs - simulation languages - programming considerations - general features of GPSS - SIM SCRIPT and SIMULA
Module - III: (15 hours)
 
Module - III: (15 hours)
Simulation of queueing systems - parameters of queue - formulation of queueing problems - generation of arrival pattern - generation of service patterns - Simulation of single server queues - simulation of multiserver queues - simulation of tandom queues
Simulation of queueing systems - parameters of queue - formulation of queueing problems - generation of arrival pattern - generation of service patterns - Simulation of single server queues - simulation of multiserver queues - simulation of tandom queues
Module - IV: (15 hours)
 
Module - IV: (15 hours)
Simulation of stochastic network - simulation of PERT network - definition of network diagrams - forward pass computation - simulation of forward pass - backward pass computations - simulation of backward pass - determination of float and slack times determination of critical path - simulation of complete network - merits of simulation of stochastic networks
Simulation of stochastic network - simulation of PERT network - definition of network diagrams - forward pass computation - simulation of forward pass - backward pass computations - simulation of backward pass - determination of float and slack times determination of critical path - simulation of complete network - merits of simulation of stochastic networks
Note to the question paper setter - programming questions must be based on `C` language or specified simulation languages in the syllabus.
Note to the question paper setter - programming questions must be based on `C` language or specified simulation languages in the syllabus.
Reference books
 
Reference books
  Deo N., System Simulation and Digital Computer, Prentice Hall of India.
  Deo N., System Simulation and Digital Computer, Prentice Hall of India.
  Gordan G., System Simulation, Prentice Hall of India.
  Gordan G., System Simulation, Prentice Hall of India.
  Law A.M. & Ketton W.D., Simulation Modelling And Analysis, McGraw Hill.  
  Law A.M. & Ketton W.D., Simulation Modelling And Analysis, McGraw Hill.  
Sessional work assessment
 
Sessional work assessment
Assignments* 2x7.5  =  15
Assignments* 2x7.5  =  15
2 Tests**  2x15  =  30
2 Tests**  2x15  =  30
Line 2,865: Line 2,884:
*    One assignment must be computer based. (practical)
*    One assignment must be computer based. (practical)
**  One sessional test must be computer based.(practical)
**  One sessional test must be computer based.(practical)
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,871: Line 2,891:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  804F  :  QUANTUM  COMPUTING
 
== IT04  804F  :  QUANTUM  COMPUTING ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
The developments in fabrication technology will eventually reach a point where logic gates are so small that they are made out of only a handful of atoms. On the atomic scale matter obeys the rules of quantum mechanics, which are quite different from the classical rules that determine the properties of conventional logic gates. So if computers are to become smaller in the future, new, quantum technology must replace or supplement what we have now. The point is, however, that quantum technology can offer much more than cramming more and more bits to silicon and multiplying the clock-speed of microprocessors. It can support entirely new kind of computation with qualitatively new algorithms based on quantum principles.  This course is meant to be an introduction to this field.  
The developments in fabrication technology will eventually reach a point where logic gates are so small that they are made out of only a handful of atoms. On the atomic scale matter obeys the rules of quantum mechanics, which are quite different from the classical rules that determine the properties of conventional logic gates. So if computers are to become smaller in the future, new, quantum technology must replace or supplement what we have now. The point is, however, that quantum technology can offer much more than cramming more and more bits to silicon and multiplying the clock-speed of microprocessors. It can support entirely new kind of computation with qualitatively new algorithms based on quantum principles.  This course is meant to be an introduction to this field.  
Module - I: (13 hours)
 
Module - I: (13 hours)
Foundations of quantum theory - states - observable - measurement - dynamics quantum measurement - quantum entanglement - bell's theorems
Foundations of quantum theory - states - observable - measurement - dynamics quantum measurement - quantum entanglement - bell's theorems
Module - II: (13 hours)
 
Module - II: (13 hours)
Classical information theory - entropy - quantum information theory - quantification of entanglement - communication complexity - quantum cryptography
Classical information theory - entropy - quantum information theory - quantification of entanglement - communication complexity - quantum cryptography
Module - III: (13 hours)
 
Module - III: (13 hours)
Turing machines - reversible computation - universal logic gates and circuits - quantum computers and circuits - quantum algorithms - search - FFT - prime factorisation
Turing machines - reversible computation - universal logic gates and circuits - quantum computers and circuits - quantum algorithms - search - FFT - prime factorisation
Module - IV: (13 hours)
 
Module - IV: (13 hours)
Quantum simulations - quantum error correction and codes - fault tolerant quantum computation - physical implementations - ion traps - quantum dots - cavity QED - NMR
Quantum simulations - quantum error correction and codes - fault tolerant quantum computation - physical implementations - ion traps - quantum dots - cavity QED - NMR
Reference books
 
Reference books
  Preskill J., Lecture Notes For The Course On Quantum Computation, bttp://www.theory.caltech.edu/people.preskill/ph229.
  Preskill J., Lecture Notes For The Course On Quantum Computation, bttp://www.theory.caltech.edu/people.preskill/ph229.
  Berman G.P., Dooten G.D., Mainieri. R. & Tsifrinovich V., Introduction to Quantum Computers, World Scientific
  Berman G.P., Dooten G.D., Mainieri. R. & Tsifrinovich V., Introduction to Quantum Computers, World Scientific
  Lo H.K., Popescu S. & Spiller T., Introduction to Quantum Computation and Information, World Scientific
  Lo H.K., Popescu S. & Spiller T., Introduction to Quantum Computation and Information, World Scientific
  Press A., Quantum Theory: Concepts And Methods, Kluwer Academic  
  Press A., Quantum Theory: Concepts And Methods, Kluwer Academic  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,899: Line 2,928:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04 805A  :  NEURAL  NETWORKS  &  FUZZY  LOGIC
 
== IT04 805A  :  NEURAL  NETWORKS  &  FUZZY  LOGIC ==
(Common with CS04 805A)
(Common with CS04 805A)
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
This course is intended to introduce some of the methods and techniques by means of which it is possible to incorporate human like performance in machine. At the end of this course students will be able to design and develop such systems using neural networks and fuzzy logic.
This course is intended to introduce some of the methods and techniques by means of which it is possible to incorporate human like performance in machine. At the end of this course students will be able to design and develop such systems using neural networks and fuzzy logic.
Module - I: (13 hours)
 
Module - I: (13 hours)
Introduction to artificial neural networks - biological neurons - Mc Culloch and Pitts modals of neuron - types of activation function - network architectures - knowledge representation - learning process - error-correction learning - supervised learning - unsupervised learning - single unit mappings and the perceptron - perceptron convergence theorem (with out proof) - method of steepest descent - least mean square algorithms - adaline/medaline units - multilayer perceptrons - derivation of the back-propagation algorithm
Introduction to artificial neural networks - biological neurons - Mc Culloch and Pitts modals of neuron - types of activation function - network architectures - knowledge representation - learning process - error-correction learning - supervised learning - unsupervised learning - single unit mappings and the perceptron - perceptron convergence theorem (with out proof) - method of steepest descent - least mean square algorithms - adaline/medaline units - multilayer perceptrons - derivation of the back-propagation algorithm
Module - II: (13 hours)
 
Module - II: (13 hours)
Radial basis and recurrent neural networks - RBF network structure - covers theorem and the separability of patterns - RBF learning strategies - K-means and LMS algorithms - comparison of RBF and MLP networks - recurrent networks - Hopfield networks - energy function - spurious states - error performance - simulated annealing - the Boltzman machine - Boltzman learning rule - the mean field theory machine - MFT learning algorithm - applications of neural network - the XOR problem - traveling salesman problem - image compression using MLPs - character retrieval using Hopfield networks
Radial basis and recurrent neural networks - RBF network structure - covers theorem and the separability of patterns - RBF learning strategies - K-means and LMS algorithms - comparison of RBF and MLP networks - recurrent networks - Hopfield networks - energy function - spurious states - error performance - simulated annealing - the Boltzman machine - Boltzman learning rule - the mean field theory machine - MFT learning algorithm - applications of neural network - the XOR problem - traveling salesman problem - image compression using MLPs - character retrieval using Hopfield networks
Module - III: (13 hours)
 
Module - III: (13 hours)
Fuzzy logic - fuzzy sets - properties - operations on fuzzy sets - fuzzy relations - operations on fuzzy relations - the extension principle - fuzzy measures - membership functions - fuzzification and defuzzification methods - fuzzy controllers - Mamdani and Sugeno types - design parameters - choice of membership functions - fuzzification and defuzzification methods - applications
Fuzzy logic - fuzzy sets - properties - operations on fuzzy sets - fuzzy relations - operations on fuzzy relations - the extension principle - fuzzy measures - membership functions - fuzzification and defuzzification methods - fuzzy controllers - Mamdani and Sugeno types - design parameters - choice of membership functions - fuzzification and defuzzification methods - applications
Module - IV: (13 hours)
 
Module - IV: (13 hours)
Introduction to genetic algorithm and hybrid systems - genetic algorithms - natural evolution - properties - classification - GA features - coding - selection - reproduction - cross over and mutation operators basic GA and structure
Introduction to genetic algorithm and hybrid systems - genetic algorithms - natural evolution - properties - classification - GA features - coding - selection - reproduction - cross over and mutation operators basic GA and structure
Introduction to Hybrid systems - concept of neuro-fuzzy and neuro-genetic systems
Introduction to Hybrid systems - concept of neuro-fuzzy and neuro-genetic systems
Reference books
 
Reference books
  Simon Haykins, “Neural Network A - Comprehensive Foundation”, Macmillan College, Proc, Con, Inc
  Simon Haykins, “Neural Network A - Comprehensive Foundation”, Macmillan College, Proc, Con, Inc
  Zurada J.M., “Introduction to Artificial Neural Systems, Jaico publishers
  Zurada J.M., “Introduction to Artificial Neural Systems, Jaico publishers
Line 2,921: Line 2,957:
  Goldberg D.E., “Genetic Algorithms in Search Optimisation and Machine Learning”, Addison Wesley
  Goldberg D.E., “Genetic Algorithms in Search Optimisation and Machine Learning”, Addison Wesley
  Suran Goonatilake & Sukhdev Khebbal (Eds.), “Intelligent Hybrid Systems”, John Wiley  
  Suran Goonatilake & Sukhdev Khebbal (Eds.), “Intelligent Hybrid Systems”, John Wiley  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,932: Line 2,970:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  805b :  PATTERN  RECOGNITION
 
== IT04  805b :  PATTERN  RECOGNITION ==
(Common with CS04 805B)
(Common with CS04 805B)
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
The course will impart a basic knowledge on pattern recognition and will give a sound idea on the topics of parameter estimation and supervised learning, linear discriminant functions and syntactic approach to PR. It will provide the strong foundation to students to understand and design pattern recognition systems.
The course will impart a basic knowledge on pattern recognition and will give a sound idea on the topics of parameter estimation and supervised learning, linear discriminant functions and syntactic approach to PR. It will provide the strong foundation to students to understand and design pattern recognition systems.
Module - I: (12 hours)
 
Module - I: (12 hours)
Introduction - introduction to statistical - syntactic and descriptive approaches - features and feature extraction - learning - Bayes Decision theory - introduction - continuous case - 2-category classification - minimum error rate classification - classifiers - discriminant functions - and decision surfaces - error probabilities and integrals - normal density - discriminant functions for normal density
Introduction - introduction to statistical - syntactic and descriptive approaches - features and feature extraction - learning - Bayes Decision theory - introduction - continuous case - 2-category classification - minimum error rate classification - classifiers - discriminant functions - and decision surfaces - error probabilities and integrals - normal density - discriminant functions for normal density
Module - II: (12 hours)
 
Module - II: (12 hours)
Parameter estimation and supervised learning - maximum likelihood estimation - the Bayes classifier - learning the mean of a normal density - general bayesian learning - nonparametric technic - density estimation - parzen windows - k-nearest neighbour estimation - estimation of posterior probabilities - nearest - neighbour rule - k-nearest neighbour rule
Parameter estimation and supervised learning - maximum likelihood estimation - the Bayes classifier - learning the mean of a normal density - general bayesian learning - nonparametric technic - density estimation - parzen windows - k-nearest neighbour estimation - estimation of posterior probabilities - nearest - neighbour rule - k-nearest neighbour rule
Module - III: (12 hours)
 
Module - III: (12 hours)
Linear discriminant functions - linear discriminant functions and decision surfaces - generalised linear discriminant functions - 2-category linearly separable case - non-separable behaviour - linear programming procedures - clustering - data description and clustering - similarity measures - criterion functions for clustering
Linear discriminant functions - linear discriminant functions and decision surfaces - generalised linear discriminant functions - 2-category linearly separable case - non-separable behaviour - linear programming procedures - clustering - data description and clustering - similarity measures - criterion functions for clustering
Module - IV: (16 hours)
 
Module - IV: (16 hours)
Syntactic approach to PR - introduction to pattern grammars and languages - higher dimensional grammars - tree, graph, web, plex, and shape grammars - stochastic grammars - attribute grammars - parsing techniques - grammatical inference
Syntactic approach to PR - introduction to pattern grammars and languages - higher dimensional grammars - tree, graph, web, plex, and shape grammars - stochastic grammars - attribute grammars - parsing techniques - grammatical inference
Text books
 
Text books
  Duda & Hart P.E, Pattern Classification And Scene Analysis, John Wiley
  Duda & Hart P.E, Pattern Classification And Scene Analysis, John Wiley
  Gonzalez R.C. & Thomson M.G., Syntactic Pattern Recognition - An Introduction, Addison Wesley  
  Gonzalez R.C. & Thomson M.G., Syntactic Pattern Recognition - An Introduction, Addison Wesley  
Reference book
 
Reference book
1. Fu K.S., Eaglewood Cliffs N.J., Syntactic Pattern Recognition And Applications, Prentice Hall
1. Fu K.S., Eaglewood Cliffs N.J., Syntactic Pattern Recognition And Applications, Prentice Hall
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 2,961: Line 3,009:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  805C  :  DESIGN  AND  ANALYSIS  OF  ALGORITHMS
 
== IT04  805C  :  DESIGN  AND  ANALYSIS  OF  ALGORITHMS ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective of the course is to provide a sound basis of algorithm design and analysis techniques. A background of data structures and programming languages is assumed. After completing the course, one is expected to be able to design efficient algorithms, compare different algorithms for efficiency and also to have an idea about what is computable by a machine.
 
Module - I: (13 hours)
Objective of the course is to provide a sound basis of algorithm design and analysis techniques. A background of data structures and programming languages is assumed. After completing the course, one is expected to be able to design efficient algorithms, compare different algorithms for efficiency and also to have an idea about what is computable by a machine.
 
Module - I: (13 hours)
Analysis: RAM model - cost estimation based on key operations - big Oh - big omega - little Oh - little omega and theta notations - recurrence analysis - master's theorem - solution to recurrence relations with full history probabilistic analysis - linearity of expectations - worst and average case analysis of quick-sort - merge-sort - heap-sort - binary search - hashing algorithms - lower bound proofs for the above problems - amortized analysis - aggregate - accounting and potential methods - analysis of Knuth-Morris-Pratt algorithm - amortized weight balanced trees
Analysis: RAM model - cost estimation based on key operations - big Oh - big omega - little Oh - little omega and theta notations - recurrence analysis - master's theorem - solution to recurrence relations with full history probabilistic analysis - linearity of expectations - worst and average case analysis of quick-sort - merge-sort - heap-sort - binary search - hashing algorithms - lower bound proofs for the above problems - amortized analysis - aggregate - accounting and potential methods - analysis of Knuth-Morris-Pratt algorithm - amortized weight balanced trees
Module - II: (13 hours)
 
Module - II: (13 hours)
Design: divide and conquer - Strassen's algorithm, o(n) median finding algorithm - dynamic programming - matrix chain multiplication - optimal polygon triangulation - optimal binary search trees - Floyd-Warshall algorithm - CYK algorithm - greedy - Huffman coding - Knapsack, Kruskal's and Prim's algorithms for mst - backtracking - branch and bound - travelling salesman problem - matroids and theoretical foundations of greedy algorithms
Design: divide and conquer - Strassen's algorithm, o(n) median finding algorithm - dynamic programming - matrix chain multiplication - optimal polygon triangulation - optimal binary search trees - Floyd-Warshall algorithm - CYK algorithm - greedy - Huffman coding - Knapsack, Kruskal's and Prim's algorithms for mst - backtracking - branch and bound - travelling salesman problem - matroids and theoretical foundations of greedy algorithms
Module - III: (13 hours)
 
Module - III: (13 hours)
Complexity: complexity classes - P, NP, Co-NP, NP-Hard and NP-complete problems - cook's theorem (proof not expected) - NP-completeness reductions for clique - vertex cover - subset sum - hamiltonian cycle - TSP - integer programming - approximation algorithms - vertex cover - TSP - set covering and subset sum
Complexity: complexity classes - P, NP, Co-NP, NP-Hard and NP-complete problems - cook's theorem (proof not expected) - NP-completeness reductions for clique - vertex cover - subset sum - hamiltonian cycle - TSP - integer programming - approximation algorithms - vertex cover - TSP - set covering and subset sum
Module - IV: (13 hours)
 
Module - IV: (13 hours)
Probabilistic algorithms: pseudo random number generation methods - Monte Carlo algorithms - probabilistic counting - verifying matrix multiplication - primality testing - miller rabin test - integer factorization - Pollard's rho heuristic - amplification of stochastic advantage - applications to cryptography - interactive proof systems - les vegas algorithms - randomized selection and sorting - randomized solution for eight queen problem - universal hashing - Dixon's integer factorization algorithm
Probabilistic algorithms: pseudo random number generation methods - Monte Carlo algorithms - probabilistic counting - verifying matrix multiplication - primality testing - miller rabin test - integer factorization - Pollard's rho heuristic - amplification of stochastic advantage - applications to cryptography - interactive proof systems - les vegas algorithms - randomized selection and sorting - randomized solution for eight queen problem - universal hashing - Dixon's integer factorization algorithm
Text books
 
Text books
  Corman T.H., Lieserson C.E. & Rivest R.L., Introduction to Algorithms, Prentice Hall India, Modules I, II and III
  Corman T.H., Lieserson C.E. & Rivest R.L., Introduction to Algorithms, Prentice Hall India, Modules I, II and III
  Motwani R. & Raghavan P., Randomized Algorithms, Cambridge University Press, Module IV  
  Motwani R. & Raghavan P., Randomized Algorithms, Cambridge University Press, Module IV  
Reference books
 
Reference books
  Basse S., Computer Algorithms: Introduction to Design And Analysis, Addison Wesley
  Basse S., Computer Algorithms: Introduction to Design And Analysis, Addison Wesley
  Manber U., Introduction to Algorithms: A Creative Approach, Addison Wesley
  Manber U., Introduction to Algorithms: A Creative Approach, Addison Wesley
  Aho V., Hopcraft J.E. & Ullman J.D., The Design And Analysis of Computer Algorithms, Addison Wesley
  Aho V., Hopcraft J.E. & Ullman J.D., The Design And Analysis of Computer Algorithms, Addison Wesley
  Kenneth A Berman, Jerome L Paul,  Fundamentals of sequential and parallel algorithms, Vidya Vikas Publications  
  Kenneth A Berman, Jerome L Paul,  Fundamentals of sequential and parallel algorithms, Vidya Vikas Publications  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
QI  -  8 short type questions of 5 marks, 2 from each module
QI  -  8 short type questions of 5 marks, 2 from each module
QII -  2 questions  of 15 marks each from module I with choice to answer anyone
QII -  2 questions  of 15 marks each from module I with choice to answer anyone
Line 2,991: Line 3,049:
QIV -  2 questions  of 15 marks each from module III with choice to answer anyone
QIV -  2 questions  of 15 marks each from module III with choice to answer anyone
QV -  2 questions  of 15 marks each from module IV with choice to answer anyone
QV -  2 questions  of 15 marks each from module IV with choice to answer anyone
IT04  805D  :  ENTREPRENEURSHIP
 
== IT04  805D  :  ENTREPRENEURSHIP ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
The course intends to help strengthen the entrepreneurial capabilities of a student while preparing to graduate as a professional. These capabilities include identification of opportunities, studying project feasibility, and implementing business ventures.  The course also exposes the intricacies of economic fundamentals  of a business venture, needed  for commissioning one.
The course intends to help strengthen the entrepreneurial capabilities of a student while preparing to graduate as a professional. These capabilities include identification of opportunities, studying project feasibility, and implementing business ventures.  The course also exposes the intricacies of economic fundamentals  of a business venture, needed  for commissioning one.
Module - I: (20 hours)
 
Module - I: (20 hours)
Entrepreneurial perspectives - understanding of entrepreneurship process - entrepreneurial decision process - entrepreneurship and economic development - characteristics of entrepreneur - entrepreneurial competencies - managerial functions for enterprise
Entrepreneurial perspectives - understanding of entrepreneurship process - entrepreneurial decision process - entrepreneurship and economic development - characteristics of entrepreneur - entrepreneurial competencies - managerial functions for enterprise
Module - II: (10 hours)
 
Module - II: (10 hours)
Process of business opportunity identification and evaluation - industrial policy - environment - market survey and market assessment - project report preparation - study of feasibility and viability of a project - assessment of risk in the industry
Process of business opportunity identification and evaluation - industrial policy - environment - market survey and market assessment - project report preparation - study of feasibility and viability of a project - assessment of risk in the industry
Module - III: (12 hours)
 
Module - III: (12 hours)
Process and strategies for starting a venture - stages of small business growth - entrepreneurship in international environment - entrepreneurship - achievement motivation - time management creativity and innovation structure of the enterprise - planning, implementation and growth
Process and strategies for starting a venture - stages of small business growth - entrepreneurship in international environment - entrepreneurship - achievement motivation - time management creativity and innovation structure of the enterprise - planning, implementation and growth
Module - IV: (10 hours)
 
Module - IV: (10 hours)
Technology acquisition for small units - formalities to be completed for setting up a small scale unit - forms of organizations for small scale units - financing of project and working capital - venture capital and other equity assistance available - break even analysis and economic ratios technology transfer and business incubation
Technology acquisition for small units - formalities to be completed for setting up a small scale unit - forms of organizations for small scale units - financing of project and working capital - venture capital and other equity assistance available - break even analysis and economic ratios technology transfer and business incubation
Reference books
 
Reference books
  Koontz H. & Weihrich H., Essentials of Management, McGraw Hill International
  Koontz H. & Weihrich H., Essentials of Management, McGraw Hill International
  Hirich R.D. & Peters Irwin M.P., Entrepreneurship, McGraw Hill
  Hirich R.D. & Peters Irwin M.P., Entrepreneurship, McGraw Hill
Line 3,013: Line 3,078:
  Rao C.R., Finance for Small Scale Industries
  Rao C.R., Finance for Small Scale Industries
  Pandey G.W., A Complete Guide to Successful Entrepreneurship, Vikas Publishing  
  Pandey G.W., A Complete Guide to Successful Entrepreneurship, Vikas Publishing  
Sessional work assessment
 
Sessional work assessment
Assignments 2x7.5 = 15
Assignments 2x7.5 = 15
Tests 2x15 = 30
Tests 2x15 = 30
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 3,024: Line 3,091:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  805E  :  STOCHASTIC  PROCESSES
 
== IT04  805E  :  STOCHASTIC  PROCESSES ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective: Dynamic indeterminism  is to be analyzed in any field of Science and Technology with reference to time, which is in other words defined as random processes. Students are introduced to various methods to model and analyze such systems.
Objective: Dynamic indeterminism  is to be analyzed in any field of Science and Technology with reference to time, which is in other words defined as random processes. Students are introduced to various methods to model and analyze such systems.
Module - I: (13 hours)
 
Module - I: (13 hours)
Markov chains and poisson processes (a brief revision) - continuous time Markov chains - definition -transition probability function - Chapman - Kolmogorov equations - rate matrix - Kolmogorov forward and backward equations - computing the transition probabilities - limiting probabilities - pure birth process  - birth and death process - M/ M/ 1 queue
Markov chains and poisson processes (a brief revision) - continuous time Markov chains - definition -transition probability function - Chapman - Kolmogorov equations - rate matrix - Kolmogorov forward and backward equations - computing the transition probabilities - limiting probabilities - pure birth process  - birth and death process - M/ M/ 1 queue
Module - II: (13 hours)  
 
Module - II: (13 hours)  
Renewal theory and its applications - the renewal process N(t) - distribution of N(t) - renewal function - renewal equation - limit theorems and their applications - elementary  renewal theorem (without proof ) - applications of renewal theorem - central limit theorem of renewal processes (without proof) - renewal reward processes - regenerative processes - delayed renewal processes - alternating renewal processes
Renewal theory and its applications - the renewal process N(t) - distribution of N(t) - renewal function - renewal equation - limit theorems and their applications - elementary  renewal theorem (without proof ) - applications of renewal theorem - central limit theorem of renewal processes (without proof) - renewal reward processes - regenerative processes - delayed renewal processes - alternating renewal processes
Module - III: (13 hours)
 
Module - III: (13 hours)
Queueing theory I - introduction - preliminaries - cost equations - Little's formula - steady state probability - exponential models - single server exponential queueing system - single server exponential - system having finite capacity - a queueing system with bulk service - network of queues - open systems - closed systems - the system M/G/1 - preliminaries - work and cost identity - applications of work to M/G/1 - busy periods - discussion of M/D/1 model and M/Ek/1 model
Queueing theory I - introduction - preliminaries - cost equations - Little's formula - steady state probability - exponential models - single server exponential queueing system - single server exponential - system having finite capacity - a queueing system with bulk service - network of queues - open systems - closed systems - the system M/G/1 - preliminaries - work and cost identity - applications of work to M/G/1 - busy periods - discussion of M/D/1 model and M/Ek/1 model
Module - IV: (13 hours)
 
Module - IV: (13 hours)
Queueing theory II: variations on the M/G/1 - the M/G/1 with random sized batch arrivals - priority queues - the model G/M/1 - the G/M/1 busy and idle periods - multi server queues - erlang loss system - the M/M/k queue -the G/M/k queue - the M/G/k queue - M/G/ queue
Queueing theory II: variations on the M/G/1 - the M/G/1 with random sized batch arrivals - priority queues - the model G/M/1 - the G/M/1 busy and idle periods - multi server queues - erlang loss system - the M/M/k queue -the G/M/k queue - the M/G/k queue - M/G/ queue
Text book
 
Text book
  Ross S.M., Introduction to Probability Models, Sixth edition, Harcourt Asia Pvt. Ltd. & Academic Press, Chapter 6- sections6.1, 6.2, 6.3, 6.4, 6.5, 6.8; Chapter 7 - sections 7.1, 7.2, 7.3, 7.4, 7.5; Chapter 8 - Sections 8.1 to 8.5 for module 3 and the remaining for module 4  
  Ross S.M., Introduction to Probability Models, Sixth edition, Harcourt Asia Pvt. Ltd. & Academic Press, Chapter 6- sections6.1, 6.2, 6.3, 6.4, 6.5, 6.8; Chapter 7 - sections 7.1, 7.2, 7.3, 7.4, 7.5; Chapter 8 - Sections 8.1 to 8.5 for module 3 and the remaining for module 4  
Reference book
 
Reference book
1. Medhi J., Stochastic Processes, Wiley Eastern Ltd.
1. Medhi J., Stochastic Processes, Wiley Eastern Ltd.
Sessional work assessment
Sessional work assessment
Line 3,044: Line 3,118:
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 3,050: Line 3,125:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  805F  :  CONCRETE  MATHEMATICS
 
== IT04  805F  :  CONCRETE  MATHEMATICS ==
3 hours lecture and 1 hour tutorial per week
3 hours lecture and 1 hour tutorial per week
Objective:
 
Objective:
This is an introduction to the mathematics that support advanced programming and analysis of algorithms.  By its very nature it illustrate how computer science benefited from mathematics and how mathematics benefited from computer science.  As such this is the continuation of number theory taught as part of the cryptography course earlier.  Including examples of core applications based on the theory presented here will increase the acceptance of the material.
This is an introduction to the mathematics that support advanced programming and analysis of algorithms.  By its very nature it illustrate how computer science benefited from mathematics and how mathematics benefited from computer science.  As such this is the continuation of number theory taught as part of the cryptography course earlier.  Including examples of core applications based on the theory presented here will increase the acceptance of the material.
Module - I: (10 hours)
 
Module - I: (10 hours)
Recurrent problems - tower of Hanoi - lines in the plane - the Josephus problem - sums - notation - sums and recurrences - manipulation of sums - multiple sums - general methods - finite and infinite calculus - infinite sums
Recurrent problems - tower of Hanoi - lines in the plane - the Josephus problem - sums - notation - sums and recurrences - manipulation of sums - multiple sums - general methods - finite and infinite calculus - infinite sums
Module - II: (18 hours)
 
Module - II: (18 hours)
Integer functions - floors and ceilings - applications - floor / ceiling recurrences - mod - the binary operation - floor / ceiling sums - number theory - divisibility - primes - prime examples - factorial factors - relative primality - mod - the congruence relation - independent residues - additional applications - phi and mu
Integer functions - floors and ceilings - applications - floor / ceiling recurrences - mod - the binary operation - floor / ceiling sums - number theory - divisibility - primes - prime examples - factorial factors - relative primality - mod - the congruence relation - independent residues - additional applications - phi and mu
Module - III: (12 hours)
 
Module - III: (12 hours)
Binomial coefficients - basic identities - basic practice - tricks of the trade - generating functions - hypergeometric - functions - hypergeometric transformations - partial hypergeometric sums - mechanical summations
Binomial coefficients - basic identities - basic practice - tricks of the trade - generating functions - hypergeometric - functions - hypergeometric transformations - partial hypergeometric sums - mechanical summations
Module - IV: (12 hours)
 
Module - IV: (12 hours)
Special numbers - Stirling numbers - Eulerian numbers - harmonic numbers - harmonic summation - Bernoulli numbers - Fibonacci numbers - continuants
Special numbers - Stirling numbers - Eulerian numbers - harmonic numbers - harmonic summation - Bernoulli numbers - Fibonacci numbers - continuants
Text book
 
Text book
1. Graham R.L., Knuth D.E. & Patashnik O., Concrete Mathematics, Addison Wesley
1. Graham R.L., Knuth D.E. & Patashnik O., Concrete Mathematics, Addison Wesley
Reference books
 
Reference books
  Melzak Z.A., Mathematical Techniques for Various Applications, Wiley
  Melzak Z.A., Mathematical Techniques for Various Applications, Wiley
  Melzak Z.A., Mathematical Ideas, Modelling and Applications, Wiley  
  Melzak Z.A., Mathematical Ideas, Modelling and Applications, Wiley  
Line 3,072: Line 3,155:
Regularity  = 05
Regularity  = 05
Total marks  = 50
Total marks  = 50
University examination pattern
 
University examination pattern
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q I    - 8 short type questions of 5 marks each, 2 from each module
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Q II  - 2 questions of 15marks each from module I with choice to answer any one
Line 3,078: Line 3,162:
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q IV  - 2 questions of 15marks each from module III with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
Q V  - 2 questions of 15marks each from module IV with choice to answer any one
IT04  806(P)  :  GRAPHICS  &  MULTIMEDIA  LAB
 
== IT04  806(P)  :  GRAPHICS  &  MULTIMEDIA  LAB ==
3 hours practical per week
3 hours practical per week
Lab 1 : Basic raster drawing algorithms implementations (lines, circle, ellipse, polygons etc.)
 
Lab 2 :  mplementation of algorithms for 2D/3D object generation, transformations
Lab 1 : Basic raster drawing algorithms implementations (lines, circle, ellipse, polygons etc.)
Lab 3 : Generate a 3D object, say a cube, and try to implement the following using any standard graphic library set (for example OpenGL library) on a selected OS
 
Lab 2 :  mplementation of algorithms for 2D/3D object generation, transformations
 
Lab 3 : Generate a 3D object, say a cube, and try to implement the following using any standard graphic library set (for example OpenGL library) on a selected OS
1. Viewing transformations
1. Viewing transformations
2. Modeling transformations
2. Modeling transformations
3. Projection transformations
3. Projection transformations
4. Drawing a scene (2D picture of 3D space or a shot by camera) involving object
4. Drawing a scene (2D picture of 3D space or a shot by camera) involving object
Lab 4 : Generate a 3D object, say a sphere, based on surfaces or polygonal faces or wireframe approach and render it defining a material, light source and lighting model properties using any standard graphic library set (for example OpenGL library) on a selected OS
 
Lab 5 : Model a scene containing several 3D objects, say table top having several objects - each object may be modelled as given in above experiment - also render the scene with hidden surfaces in mind - rendering considering a light source may also be practiced - this again is using standard graphic library set on a selected OS
Lab 4 : Generate a 3D object, say a sphere, based on surfaces or polygonal faces or wireframe approach and render it defining a material, light source and lighting model properties using any standard graphic library set (for example OpenGL library) on a selected OS
Lab 6 : Use source code of any freely available sound recording, encoding / decoding software - encoding / decoding portions may be removed before actual experimentation - study any three audio formats to learn about (a) file size (b) popularity (c) quality of audio reproduced.  Do the following in a chosen OS
 
Lab 5 : Model a scene containing several 3D objects, say table top having several objects - each object may be modelled as given in above experiment - also render the scene with hidden surfaces in mind - rendering considering a light source may also be practiced - this again is using standard graphic library set on a selected OS
 
Lab 6 : Use source code of any freely available sound recording, encoding / decoding software - encoding / decoding portions may be removed before actual experimentation - study any three audio formats to learn about (a) file size (b) popularity (c) quality of audio reproduced.  Do the following in a chosen OS
1. Record sound for 10 secs
1. Record sound for 10 secs
2. Convert from one format to other
2. Convert from one format to other
3. Playback both the formats and analyze the results
3. Playback both the formats and analyze the results
Lab 7 : Study any 5 popular still image formats (JPEG, BMP included) - do the following in a chosen OS
 
Lab 7 : Study any 5 popular still image formats (JPEG, BMP included) - do the following in a chosen OS
1. Take a snap of face of a person using digital camera or a webcam
1. Take a snap of face of a person using digital camera or a webcam
2. Use any photo editing tools (say, Adobe Photoshop) to get desired size, desired resolution photo(both color and black and white may be generated).  Paint touching may also be practiced
2. Use any photo editing tools (say, Adobe Photoshop) to get desired size, desired resolution photo(both color and black and white may be generated).  Paint touching may also be practiced
3. Create the image of a decorated greeting card or an identity card using image creation tools and insert the photo and print it.  Verify for color matching and size of the image
3. Create the image of a decorated greeting card or an identity card using image creation tools and insert the photo and print it.  Verify for color matching and size of the image
Lab8 : Use a MPEG decoder source code freely available from internet and do the following in a chosen OS
 
Lab8 : Use a MPEG decoder source code freely available from internet and do the following in a chosen OS
1. Play MPEG video
1. Play MPEG video
2. Modify the source code so that play can be done frame by frame
2. Modify the source code so that play can be done frame by frame
Lab 9 : Use any web animation authoring tool, say macromedia flash, on a chosen OS to create simple animations
 
Lab 10 : Learn to use server and client software for streaming media - pick any freely available software on a chosen OS - create a web page with multimedia content and providing interaction in some form to a user
Lab 9 : Use any web animation authoring tool, say macromedia flash, on a chosen OS to create simple animations
Reference books
 
Lab 10 : Learn to use server and client software for streaming media - pick any freely available software on a chosen OS - create a web page with multimedia content and providing interaction in some form to a user
 
Reference books
  Foley J.D., Dam A.V., Feiner S.K. & Hughes J., Computer Graphics: Principles and Practice, Addison Wesley
  Foley J.D., Dam A.V., Feiner S.K. & Hughes J., Computer Graphics: Principles and Practice, Addison Wesley
  Stevens R.T., Graphics Programming In C, BPB Publications
  Stevens R.T., Graphics Programming In C, BPB Publications
Line 3,110: Line 3,206:
  Addele Droblas Greenberg & Seith Greenberg, Fundamental Photoshop, McGraw Hill
  Addele Droblas Greenberg & Seith Greenberg, Fundamental Photoshop, McGraw Hill
  Linda Richards, Web Graphics for Dummies, IDG Books  
  Linda Richards, Web Graphics for Dummies, IDG Books  
Sessional work assessment
 
Sessional work assessment
Laboratory practicals and record = 15
Laboratory practicals and record = 15
Tests = 30
Tests = 30
Regularity = 5
Regularity = 5
Total marks = 50
Total marks = 50
IT04  807(P)  : PROJECT WORK
 
== IT04  807(P)  : PROJECT WORK ==
7 hours per week
7 hours per week
Guidelines for completion of project
 
Guidelines for completion of project
 
The project work started in seventh semester is to be continued here.  In the rare special case of a student joining in eighth semester(due to year out or shortage of attendance), the design part mentioned in 708(P) Project  has to be repeated following the guidelines there.  However, the duration of the project need to be limited to a semester.
The project work started in seventh semester is to be continued here.  In the rare special case of a student joining in eighth semester(due to year out or shortage of attendance), the design part mentioned in 708(P) Project  has to be repeated following the guidelines there.  However, the duration of the project need to be limited to a semester.
Format of report
 
Format of report
 
A format may be designed and enforced at each institution - formats must be available in all current OS platforms and students must be asked to use a specific document preparation systems recommended by each institution - they may  be asked to provide the report in electronic form also - this electronic form, made available in CD, will contain the entire project document besides multi-media illustration material prepared using any presentation software -  Each student has to submit a technical report about work done and a detailed report of work done; these may also be provide in the CD.
A format may be designed and enforced at each institution - formats must be available in all current OS platforms and students must be asked to use a specific document preparation systems recommended by each institution - they may  be asked to provide the report in electronic form also - this electronic form, made available in CD, will contain the entire project document besides multi-media illustration material prepared using any presentation software -  Each student has to submit a technical report about work done and a detailed report of work done; these may also be provide in the CD.
Guidelines for conduct and evaluation:
 
Guidelines for conduct and evaluation:
  The committee constituted in the seventh semester will continue with the remaining activities.  The committee is responsible for developing schedules for various activities remaining and keeping them.  The functioning of a committee is over only after the final evaluation of the project.
  The committee constituted in the seventh semester will continue with the remaining activities.  The committee is responsible for developing schedules for various activities remaining and keeping them.  The functioning of a committee is over only after the final evaluation of the project.
  The committee mentioned above should do an assessment of the project work at the end of the eighth semester.  The project must be submitted in a technical paper format with a maximum of eight pages in single line spacing of 12 point Times New Roman Font.  A detailed report may be submitted to the guide for his assessment.  Besides, they will make a presentation and demonstration of work done by them before the committee mentioned above for their assessment.  
  The committee mentioned above should do an assessment of the project work at the end of the eighth semester.  The project must be submitted in a technical paper format with a maximum of eight pages in single line spacing of 12 point Times New Roman Font.  A detailed report may be submitted to the guide for his assessment.  Besides, they will make a presentation and demonstration of work done by them before the committee mentioned above for their assessment.  
The assessment is thus done in individual and in groups.  The pattern for awarding marks will be as follows:
 
The assessment is thus done in individual and in groups.   
 
The pattern for awarding marks will be as follows:
  Attendance: 10 marks
  Attendance: 10 marks
  Technical report, work done and presentation evaluated by committee : 60 marks
  Technical report, work done and presentation evaluated by committee : 60 marks
  Work record and individual assessment by guide : 30 marks  
  Work record and individual assessment by guide : 30 marks  
       Total = 100 marks
       Total = 100 marks
For external projects, evaluation of attendance may be done on the basis of proof of attendance provided by a competent authority of the external agency.  In addition, the technical report may contain a certificate from competent authority of the external agency as proof for originality of work done by the student at their premise.
 
IT04  808(P)  : VIVA VOCE
For external projects, evaluation of attendance may be done on the basis of proof of attendance provided by a competent authority of the external agency.  In addition, the technical report may contain a certificate from competent authority of the external agency as proof for originality of work done by the student at their premise.
Each student is required to appear for the viva-voce examination on the project work and seminar, and also on the various subjects prescribed for the course - the project and seminar reports are to be produced for the viva-vice examination - the examiners will ask questions from subjects studied for the B.Tech course, mini project, project and seminar reports of the student .
 
There is only University examination for Viva-voce.  University will appoint examiners to conduct this. The mark distribution should be as follows:
== IT04  808(P)  : VIVA VOCE ==
Mark distribution for Viva-voce
Each student is required to appear for the viva-voce examination on the project work and seminar, and also on the various subjects prescribed for the course - the project and seminar reports are to be produced for the viva-vice examination - the examiners will ask questions from subjects studied for the B.Tech course, mini project, project and seminar reports of the student .
 
There is only University examination for Viva-voce.  University will appoint examiners to conduct this. The mark distribution should be as follows:
 
Mark distribution for Viva-voce
Subjects          :  40
Subjects          :  40
Mini project  :  20
Mini project  :  20